登录
首页 » C++ » IsSubStr

IsSubStr

于 2015-11-17 发布 文件大小:639KB
0 289
下载积分: 1 下载次数: 2

代码说明:

  从控制台输入一个字符串,然后再输入想要查找的字符串,判断要查找的字符串是不是在第一次输入的字符串中出现过。(find substring in a source string)

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

发表评论

0 个回复

  • console1.6
    从多媒体文件中搜索给定的视频帧号,这些帧有一个start_code标志位,本算法是融合顺序和预测相结合的方法,算法的执行时间以及内存空间都比较少。(search the presibed viedo frame in multimedia files,with the startcode flag.Use the predict algorithm and sequence algorithm. The algorithm demand small time and little memory space.)
    2011-06-17 15:00:59下载
    积分:1
  • Win32Timer
    基于Visual C++ 的win32控制台的程序,实现使用定时器的功能,(Visual C++ win32 console-based program, using the timer function,)
    2012-03-06 14:20:34下载
    积分:1
  • B06040324_B2
    模拟电信计费系统的设计与实现 要求:(1) 计费功能。根据存放在源数据文件中的通话记录和长途费率文件对每一条通话记录计算其通话费用,并将结果保存在费用文件中。其中: 通话费的计算方法如下: 通话费=长途电话费+本地电话费 长途电话费=费率(元/分钟)×通话时长(分钟) (通话时长不满1分钟的按1分钟计算) 本地电话费为:3分钟以内0.5元,以后每3分钟递增0.2元。 (2) 话费查询。输入一个电话号码,从费用文件中统计该电话号码的所有本地话费、长途话费,并从用户文件中查找其用户名,最后在屏幕上显示: 用户名 电话号码 本地话费 长途话费 话费总计 (3) 话单查询。输入一个电话号码,查询并在屏幕显示该用户的所有通话记录,格式为: 用户名 主叫电话号码 被叫电话号码 通话时长 (Design and implementation of simulation of telecommunication billing system Requirements: (1) the charging function. According to the calculation of the call charges stored in the source data file in the call records and the long rate documents for each call record, and save the results in cost file. Among them: The following conversation method to calculate the fee: Long distance telephone calls =+ local telephone fee Long distance telephone fee = rate (yuan/minute)* call time (minutes) (call time less than 1 minutes to 1 minutes) Local call: 3 minutes 0.5 yuan, increasing 0.2 yuan every 3 minutes later. (2) calls inquiries. Enter a phone number, all local calls, long-distance calls statistics the phone number from the cost in the file, and find the user name from user file, and finally displayed on the screen: The user name phone number local calls long distance charges charges totaling (3) if a single query. Enter a phone number, query and display all the call records of th)
    2013-09-25 05:53:29下载
    积分:1
  • aPLib-1.01
    this is the library to compress and decompress any file. I found it on Net
    2010-09-10 19:25:46下载
    积分:1
  • KTL
    说明:  从专业设备上读取数据图像,并对其进行分析的代码。(from professional equipment to read data from images and analysis of its code.)
    2005-09-17 11:17:51下载
    积分:1
  • ATM
    编写一个控制台程序,模拟在ATM机的存款和取款过程,当输入给定的卡号和密码(初始卡号和密码到数据文件里查看)时,系统能登录ATM系统,根据用户的身份不同显示不同的程序界面;取款   每次取款金额只能为100的倍数,总额不超过2000元,不允许透支。且取款之后,要记录取款的金额和时间。 存款   每次存款金额只能为100的倍数,总额不超过2000元。 修改密码   新密码长度不小于6位,不允许出现6位完全相同的情况,只有旧密码正确,新密码符合要求,且两次输入相同的情况下才可以成功修改密码。(Write a console program to simulate the ATM deposits and withdrawals process, when you enter a given number and password (the initial number and password to the data file view), the system can log in ATM systems, according to the user' s identity different display different The program interface withdrawal amount each withdrawal can only be a multiple of 100, the total does not exceed 2,000 yuan, does not allow overdrafts. And withdrawals after the withdrawal of the amount to be recorded and time. Deposit Amount per Deposit only a multiple of 100, totaling no more than 2,000 yuan. Change Password New Password length not less than six, allowed six identical situation, only the old password is correct, the new password meets the requirements, and enter the same case twice before they can successfully change the password.)
    2013-10-14 22:50:17下载
    积分:1
  • Desktop
    调度问题的回溯算法,算法中的经典问题。问题描述:假设有n个任务由k个可并行工作的机器完成。完成任务i需要的时间为ti。试设计一个算法找出完成这n个任务的最佳调度,使得完成全部任务的时间最早。(Scheduling problem backtracking algorithm is the classic problem. Problem Description: Suppose there are n-task by the k-parallel machine can be completed. The time required to complete the task i is ti. Try to design an algorithm to find completing these n-best task scheduling, making the earliest time to complete all tasks.)
    2010-02-19 23:31:11下载
    积分:1
  • ljsc
    OpenCF Bluetooth OpenNETCF Bluetooth Widco div hr div B 文件列表 B : div div(OpenCF Bluetooth OpenNETCF Bluetooth Widco div hr div B file list B: div div)
    2019-01-04 04:49:51下载
    积分:1
  • MY_YangHuiTriangle
    利用二维数组创建杨辉三角形,基于vc++程序设计(Creating a Yang Hui triangle by using a two-dimensional array .Programming based on vc++)
    2018-01-03 22:40:15下载
    积分:1
  • Triangle
    求解符号三角形问题.给定一行符号(比如+和-),按照同号为+异号为-的原则计算第二行直至下面的行,最后的一行只有一个符号,要求统计各个符号的个数.(Problem solving triangle symbols. Given his symbols (such as+ And-), in accordance with the same number is+ Different number- the principle of calculation of the second line until the following line, the last line there is only one symbol, all symbols requested statistics number.)
    2008-07-15 14:53:58下载
    积分:1
  • 696516资源总数
  • 106618会员总数
  • 4今日下载