登录
首页 » Visual C++ » jiaobingbu

jiaobingbu

于 2013-11-29 发布 文件大小:2KB
0 160
下载积分: 1 下载次数: 4

代码说明:

  集合的运算:交、并、补(难度系数:1.1) 全集:大写字母 ‘A’~’Z’ 要求实现以下功能: 1、集合的输入:自动去掉重复和非法的字符 2、集合的显示:输出集合的全部元素 3、输出一个给定集合的补集 4、输出两个给定集合的交集和并集 (jiao bing bu)

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

发表评论

0 个回复

  • jiaobingbu
    集合的运算:交、并、补(难度系数:1.1) 全集:大写字母 ‘A’~’Z’ 要求实现以下功能: 1、集合的输入:自动去掉重复和非法的字符 2、集合的显示:输出集合的全部元素 3、输出一个给定集合的补集 4、输出两个给定集合的交集和并集 (jiao bing bu)
    2013-11-29 20:49:25下载
    积分:1
  • NovatelRange
    上传程序用于解析Novatel输出range 信息,解析结果已经验证。(The upload process is used to resolve the Novatel output range information, analytical results have been verified.)
    2013-05-17 16:24:27下载
    积分:1
  • Camera_EXG50_GigE
    Initialise and acquisition of Camera EXG50 GigE
    2011-12-20 17:32:53下载
    积分:1
  • medo
    设X[ 0 : n - 1]和Y[ 0 : n – 1 ]为两个数组,每个数组中含有n个已排好序的数。找出X和Y的2n个数的中位数。  编程任务 利用分治策略试设计一个O (log n)时间的算法求出这2n个数的中位数。 数据输入 由文件input.txt提供输入数据。文件的第1行中有1个正整数n(n<=200),表示每个数组有n个数。接下来的两行分别是X,Y数组的元素。结果输出 程序运行结束时,将计算出的中位数输出到文件output.txt中(Let X [0: n- 1] and Y [0: n- 1] for the two arrays, each array containing the n number has been sorted. 2n X and Y to identify the number of digits.  programming tasks using the divide and conquer strategy try to design an O (log n) time algorithm to calculate this median number 2n. Data input by the input data provided input.txt file. The first line in the file has a positive integer n (n < = 200), that there are n numbers of each array. The next two lines are the X, Y array elements. The end result is output program runs, the calculated median output to file output.txt)
    2021-03-22 16:29:16下载
    积分:1
  • KTL
    说明:  从专业设备上读取数据图像,并对其进行分析的代码。(from professional equipment to read data from images and analysis of its code.)
    2005-09-17 11:17:51下载
    积分:1
  • medo
    设X[ 0 : n - 1]和Y[ 0 : n – 1 ]为两个数组,每个数组中含有n个已排好序的数。找出X和Y的2n个数的中位数。  编程任务 利用分治策略试设计一个O (log n)时间的算法求出这2n个数的中位数。 数据输入 由文件input.txt提供输入数据。文件的第1行中有1个正整数n(n<=200),表示每个数组有n个数。接下来的两行分别是X,Y数组的元素。结果输出 程序运行结束时,将计算出的中位数输出到文件output.txt中(Let X [0: n- 1] and Y [0: n- 1] for the two arrays, each array containing the n number has been sorted. 2n X and Y to identify the number of digits.  programming tasks using the divide and conquer strategy try to design an O (log n) time algorithm to calculate this median number 2n. Data input by the input data provided input.txt file. The first line in the file has a positive integer n (n < = 200), that there are n numbers of each array. The next two lines are the X, Y array elements. The end result is output program runs, the calculated median output to file output.txt)
    2021-03-22 16:29:16下载
    积分:1
  • shiper
    Воронежский гос университет, задача по сям
    2009-10-11 01:30:49下载
    积分:1
  • lucky38
    hangle unicode used AI
    2011-08-30 18:34:33下载
    积分:1
  • 9_2
    VC中容器和游标的使用,一个简单的例子。。(VC cursor in the containers and the use of a simple example. .)
    2009-05-31 23:35:52下载
    积分:1
  • tvicport
    在WINDOWS 9X/NT下不通过WIN DDK而直接存取硬件的专用开发包,支持VISUAL C++和DELPHI/C++ BUILDER,需要32位编译器。TVicPort includes transparent support for Windows 95/98 and Windows NT (in Windows 9X/NT under WIN DDK is not passed directly access dedicated hardware development kits, support Visual C and Delphi/C BUILDER need 32 compiler. TVicPort includes transparent support for Windows 95/98 and Windows NT)
    2005-05-26 10:40:55下载
    积分:1
  • 696522资源总数
  • 104042会员总数
  • 18今日下载