登录
首页 » Visual C++ » Dict2

Dict2

于 2011-08-27 发布 文件大小:674KB
0 364
下载积分: 1 下载次数: 8

代码说明:

  Word segmentation using dictionary.

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • testPowerCtrl
    电力系统监测组件,显示电动机的控件的源代码。(N/A)
    2010-12-27 22:26:57下载
    积分:1
  • tongxunlu
    通讯录中的每一个信息包括姓名(规定字节数为15个)、电话(规定字节数为15个)和工作单位(最大字节数为30个)等信息。(Each information including the name of the mail list ( specified byte number 15 ), phone ( specified byte number 15 ) and work units ( the maximum number of bytes to 30 ) and other information.)
    2013-01-24 21:08:29下载
    积分:1
  • ALL
    封装实现了 多线程操作、TCP/IP操作、运算符重载等。(Package which enables multi-threaded operation, TCP/IP operations, operator overloading, and so on.)
    2011-07-11 16:43:33下载
    积分:1
  • GPIBUtility
    GPIButility是ADLINK公司的GPIB驱动所带的工具软件,可以自动获得所有GPIB设备信息并可作相应的各项参数设置。(ADLINK' s GPIButility is brought GPIB driver software tool that can automatically access to all GPIB device information and can set the parameters accordingly.)
    2009-09-11 08:52:32下载
    积分:1
  • VC-generated-excel-histogram
    vc6.0 excel2003 用c++生成excel表格并且绘制柱状图 一步完成不需要操作excel(vc6.0 excel2003 c++ excel spreadsheet to generate and draw a histogram step does not need to operate excel)
    2013-05-17 15:57:41下载
    积分:1
  • mm1
    implement mm1 queue system on customer process
    2012-05-06 15:20:35下载
    积分:1
  • 9682767
    C语言如何使用函数中的局部变量,仅供学习与参考(How to use C language function of the local variable, is only for study and reference)
    2017-08-19 14:31:44下载
    积分:1
  • 模糊综合评判算法 FuzzyComprehensiveEvolution
    模糊综合评判算法,C程序,4个评价集,6个评价因子,欢迎下载(fuzzy comprehensive evaluation algorithm, C procedures, evaluation of four sets, six evaluation factor welcome Download)
    2007-07-05 22:26:19下载
    积分:1
  • dog
    小狗说话代码,小狗只能说特定的话语,当某些条件满足时,小狗可以叫喊或者说出自己的名字,最后输出的是小狗说的话(Speak code puppy, puppy can only say that the particular words, when certain conditions are met, the puppy can yell or say his name, the final output is a puppy say)
    2013-03-20 20:15:54下载
    积分:1
  • closest_pair
    分治法思想,求最邻近点对,考虑将所给的n个点的集合S分成2个子集S1和S2,每个子集中约有n/2个点,然后在每个子集中递归地求其最接近的点对(Divide and conquer ideas, find the nearest point to consider given the set S of n points into two subsets S1 and S2, each subset of about n/2 points, and then recursively find its focus in each sub-the closest point)
    2013-12-07 16:46:26下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载