登录
首页 » Visual C++ » myTask0

myTask0

于 2013-10-28 发布 文件大小:1KB
0 179
下载积分: 1 下载次数: 6

代码说明:

  有的科技图书会附有索引,其中列出书中重要术语出现的页码,便于读者查看。试设计一个类似的程序。输入是一个英文文本文件,输出是文件中关键字及其出现的行号的列表并按照关键字有序排列。程序运行方式:>index inputfile keys outputflie (Some books will be accompanied by technology index, which lists important terms appear in the book pages, easy to readers to view. Try to design a similar procedure. English text input is a file, the output is a file that appears in the keywords and their line numbers list and ordered according to keywords. Program run mode:> index inputfile keys outputflie)

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

发表评论

0 个回复

  • vec
    A simple vector operation class and header
    2009-04-22 00:13:18下载
    积分:1
  • VBchouhaoqi
    可用于抽奖等需要临时随机抽号的场合(压缩包中详细的说明文档)(Can be used to draw random numbers that require temporary occasions (compressed package detailed documentation))
    2013-10-27 21:21:53下载
    积分:1
  • 54678976543
    简单的鼠标画线Vb源代码,有需要的就下载吧。(Simple mouse to draw lines Vb source code, there is a need to download it.)
    2013-08-30 09:19:35下载
    积分:1
  • search-the-number
    用于求三组数,每组数的各个位都不相同。第二组数为第一组的2倍,第3组数为第一组的3倍(Is used to find the number of three, the number of the bits in each group are different. The second number of groups for the first group of two times the number of the third group of three times the first group)
    2013-11-15 20:08:10下载
    积分:1
  • aCalculator
    一个可以自由转换进制的计算器 八,十,十六,随意转换(a free conversion of 229 calculators 8, 10, 16, the casual change)
    2007-01-21 22:51:17下载
    积分: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
  • converte-into-corresponding-digital
    对一段只含有几种字符的字符串进行转换,转换成相应的数字(a string contains only several character conversion, and converted into the corresponding digital )
    2013-09-07 17:46:26下载
    积分: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
  • opcproxy_src
    opc com ole opc代理存根源码(opc com ole opc proxy stub source)
    2010-09-28 08:09:32下载
    积分:1
  • Unikey-4.0
    to study for student
    2013-08-28 12:11:13下载
    积分:1
  • 696518资源总数
  • 104349会员总数
  • 32今日下载