ACM试题Problem K:Ones Description Given any integer 0 <= n <= 10000 not divisible by 2 or 5, some multiple of n is a number which in decimal notation is a sequence of 1 s. How many digits are in the smallest such a multiple of n?
资源简介：ACM试题Problem K:Ones Description Given any integer 0 <= n <= 10000 not divisible by 2 or 5, some multiple of n is a number which in decimal notation is a sequence of 1 s. How many digits are in the smallest such a multiple of n?
上传时间： 2015-08-23
上传用户：zhenyushaw
资源简介：ACM试题An Easy Problem Description As we known, data stored in the computers is in binary form. The Problem we discuss now is about the positive integers and its binary form. Given a positive integer I, you task is to find out an integer...
上传时间： 2013-12-11
上传用户：libenshu01
资源简介：中南赛区ACM竞赛题 Description Given a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1*1 or greater located within the whole array. The sum of a rectangle is the sum of all th...
上传时间： 2013-12-22
上传用户：lijianyu172
资源简介：acm HDOJ 1051WoodenSticks Description: There is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fashion. It needs some time, called...
上传时间： 2014-03-08
上传用户：netwolf
资源简介：2004年acm试题题解
上传时间： 2013-12-21
上传用户：851197153
资源简介：Problem Statement You are given a string input. You are to find the longest substring of input such that the reversal of the substring is also a substring of input. In case of a tie, return the string that occurs earliest in input. De...
上传时间： 2015-09-21
上传用户：sunjet
资源简介：pku acm 1001,share it and enjoy it acm.pku.edu.cn if you have any Problems,connect me.
上传时间： 2013-12-07
上传用户：Ants
资源简介：pku acm 1002,share it and enjoy it acm.pku.edu.cn if you have any Problems,connect me.
上传时间： 2014-06-21
上传用户：ecooo
资源简介：pku acm 1001,share it and enjoy it acm.pku.edu.cn if you have any Problems,connect me.
上传时间： 2014-01-13
上传用户：CSUSheep
资源简介：包括计算几何、特殊数据结构、组合数学等知识点的代码。每个代码对应一道ACM试题，根据代码头说明找到题目具体来源，比如POJ 2050。来自NUAA ACM校队，ACM比赛必备！
上传时间： 2016-04-04
上传用户：zhangyigenius
资源简介：ACM ACM试题 MultiplyDigits
上传时间： 2016-07-02
上传用户：hasan2015
资源简介：acm比赛参考用书 里面附有源代码 还有Report 为北大ACM试题
上传时间： 2013-12-16
上传用户：wys0120
资源简介：杭电ACM试题集，很好，很强大！！！！！！！！！！
上传时间： 2014-12-21
上传用户：虫虫虫虫虫虫
资源简介：计算如序列x[k]={1,2,3,4,5}与序列h[k]={2,-2,3,5}的卷积本程序是和互相关的C源程序。
上传时间： 2014-09-09
上传用户：凤临西北
资源简介：bool:you will be given two bool statements and your assignment is to check it right or wrong.
上传时间： 2015-07-04
上传用户：ljmwh2000
资源简介：When created, this DLL does not export any symbols. As a result, it will not produce a .lib file when it is built. If you wish this project to be a project dependency of some other project, you will either need to add code to export...
上传时间： 2015-09-01
上传用户：asdkin
资源简介：TFormDesigner allows you move and resize any control on your form. You need not prepare your form to use TFormDesigner. Just place TFormDesigner into your form, set Active property to True and enjoy!
上传时间： 2014-01-09
上传用户：cuiyashuo
资源简介：zlib is designed to be a free, general-purpose, legally unencumbered -- that is, not covered by any patents -- lossless data-compression library for use on virtually any computer hardware and operating system. The zlib data format is itself...
上传时间： 2014-01-13
上传用户：hfmm633
资源简介：离散01串问题 « 问题描述： (n,k)01 串定义为：长度为n 的01 串，其中不含k 个连续的相同子串。对于给定的正 整数n 和k，计算(n,k)01 串的个数。 « 编程任务： 对于给定的正整数n和k，计算(n,k)01串的个数。
上传时间： 2016-07-15
上传用户：fredguo
资源简介：北京中软笔试题 1.不许用中间变量,把String ABCDE 倒转 2.10000个数求第2大的数,不许用排序算法. 3.排序算法的测试用例
上传时间： 2016-11-25
上传用户：dengzb84
资源简介：AV SDK Interface and Usage Description Rev 2.6.5
上传时间： 2017-03-30
上传用户：zhyiroy
资源简介：This book uses the Python language to teach pro - gramming concepts and Problem -solving skills, without assuming any previous program- ming experience. With easy-to-understand examples, pseudocode, flowcharts, and other tools, the st...
上传时间： 2014-01-12
上传用户：独孤求源
资源简介：JCCKit is a Java library which can be used in any Java application or applet to visualize scientific data by plots or charts
上传时间： 2014-01-23
上传用户：三人用菜
资源简介：There are some 79 or so Matlab files here which will help in many aspects of the computer vision structure from motion Problem, a full Description is provided in the manual, torrsam.ps.
上传时间： 2014-01-02
上传用户：xlcky
资源简介：2^x mod n = 1 acm竞赛题 Give a number n, find the minimum x that satisfies 2^x mod n = 1. Input One positive integer on each line, the value of n. Output If the minimum x exists, print a line with 2^x mod n = 1. Print 2^?...
上传时间： 2015-06-02
上传用户：qlpqlq
资源简介：已知：Sn= 1＋1／2＋1／3＋…＋1／n。显然对于任意一个整数K，当n足够大的时候，Sn大于K。 现给出一个整数K（1<=k<=15），要求计算出一个最小的n；使得Sn＞K。 Input 键盘输入 k Output 屏幕输出 n Sample Inp...
上传时间： 2014-01-25
上传用户：ruixue198909
资源简介：本题的算法中涉及的三个函数： double bbp(int n,int k,int l) 其中n为十六进制位第n位，k取值范围为0到n+7，用来计算16nS1，16nS2，16nS3，16nS4小数部分的每一项。返回每一项的小数部分。 void pi(int m,int n,int p[]) 计算从n位开始的连续m位的十六进制...
上传时间： 2014-01-05
上传用户：xcy122677
资源简介：Interface for Microsoft Audio Compression Manager. - Delphi Source The ACM uses existing driver interface hooks to override the default mapping algorithm for waveform audio devices. This allows the ACM to intercept device-open calls. Aft...
上传时间： 2013-12-13
上传用户：541657925
资源简介：Description Calculate a+b Input Two integer a,b (0<=a,b<=101000) Output Output a + b Sample Input 5 7 Sample Output 12
上传时间： 2014-01-25
上传用户：tonyshao
资源简介：Description 将m个孩子从1到m编上号，按序号围坐成一个圈，从1号孩子开始数，每数到n时，被数到的孩子即离开圈子，然后从下一个孩子开始，再从1开始数，如此不断地数下去，只到只剩下最后一个孩子，问剩下的孩子是几号？ Input 输入为一组整数对，每个...
上传时间： 2016-12-09
上传用户：凌云御清风
