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
上傳用戶：凌云御清風
