已知：Sn= 1＋1／2＋1／3＋…＋1／n。显然对于任意一个整数K，当n足够大的时候，Sn大于K。 现给出一个整数K（1<=k<=15），要求计算出一个最小的n；使得Sn＞K。 INPUT 键盘输入 k Output 屏幕输出 n Sample INPUT 1 Sample Output 2 Source
上传时间： 2014-01-25
上传用户：ruixue198909
这是一个ACM中的题请大家看以下哈 如果有问题请多多指教 n个猴子围坐一圈并按照顺时针方向从1到n编号，从第s个猴子开始进行1到m的报数，报数到第m的猴子 退出报数，从紧挨它的下一个猴子重新开始1到m的报数，如此进行下去知道所有的猴子都退出为止。 求给出这n个猴子的退出的顺序表。 INPUT 有做组测试数据．每一组数据有两行，第一行输入n（表示猴子的总数）第二行输入数据s(从第s 个猴子开 始报数)和数据m(第m个猴子退出报数)．当输入０ ０ ０时表示程序结束． Output 输出中，每组数据的输出结果为一行，中间用逗号间隔。
上传时间： 2014-01-01
上传用户：脚趾头
An AHB system is made of masters slaves and interconnections. A general approach to include all possible "muxed" implementation of multi layered AHB systems and arbitrated AHB ones can be thought as an acyclic graph where every source node is a master, every destination node is a slave and every internal node is an arbiter there must be one and only one arc exiting a master and one or more entering a slave (single slave verus multi-slave or arbitrated slave) an arbiter can have as many INPUT and output connections as needed. A bridge is a special node that collapses one or more slave nodes and a master node in a new "complex" node.
标签： interconnections approach general include
上传时间： 2015-12-12
上传用户：lyy1234
Using the UnderC Tokenizer Class It s often necessary to parse complex text files, where standard i/o is too clumsy. C programmers fall back on strtok(), but this can be tricky to use properly. Besides, you are still responsible for keeping strtok() fed with new INPUT, and I don t like the schlepp. Tokenizer is a text-parsing INPUT stream, modelled after the (undocumented) VCL TParser class, and based on the UnderC tokenizing preprocessor front-end.
标签： Tokenizer necessary standard complex
上传时间： 2013-12-16
上传用户：whenfly
« 问题描述： 假设要在足够多的会场里安排一批活动，并希望使用尽可能少的会场。设计一个有效的 贪心算法进行安排。(这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个 顶点，不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数，相应于要找的最小 会场数。) « 编程任务： 对于给定的k个待安排的活动，编程计算使用最少会场的时间表。 « 数据输入： 由文件INPUT.txt给出输入数据。第一行有1 个正整数k，表示有k个待安排的活动。接 下来的k行中，每行有2个正整数，分别表示k个待安排的活动开始时间和结束时间。时间 以0 点开始的分钟计。 « 结果输出: 将编程计算出的最少会场数输出到文件output.txt。
标签： laquo
上传时间： 2013-12-20
上传用户：LIKE
DAGON Approach Object of this exercise: Given a subject graph and a set of pattern graph in canonical representation (2-INPUT NAND and INV), implement the second step of DAGON approach. (Both the subject graph and the pattern graphs are trees.)
标签： graph Approach exercise subject
上传时间： 2014-01-19
上传用户：stampede
AES Core Modules In this document I describe components designated to encoding and decoding using AES. aes enc — parametrizable component which can encrypt INPUT data, using 128, 192 and 256 bit key, • aes dec — parametrizable component which can decrypt INPUT data, using 128, 192 and 256 bit key, • key expansion — parametrizable component which can produce key expansion, using 128, 192 and 256 bit key,
标签： components designated document describe
上传时间： 2015-12-22
上传用户：Late_Li
ICP fit points in data to the points in model. Fit with respect to minimize the sum of square errors with the closest model points and data points. Ordinary usage: [R, T] = icp(model,data) INPUT: model - matrix with model points, data - matrix with data points, OUTPUT: R - rotation matrix and T - translation vector accordingly so newdata = R*data + T . newdata are transformed data points to fit model see help icp for more information
标签： points the minimize respect
上传时间： 2014-01-02
上传用户：gyq
算符优先文法分析的c语言实现代码 需要输入词法分析的txt结果文件- The operator first grammar analysis c language realization code needs to INPUT the lexical analysis the txt result document
标签： realization analysis operator language
上传时间： 2015-12-28
上传用户：youlongjian0
最大流，The programs are designed to run under BSD UNIX. All programs read from the standard INPUT and write to the standard output. Run "make" to compile the programs and generators. File "list" lists the programs produced my "make". INPUT files are in DIMACS format. See sample.INPUT.
标签：
上传时间： 2015-12-30
上传用户：zhenyushaw
