Welcome![Sign In][Sign Up]
Location:
Search - sicily

Search list

[SourceCodesicily

Description: .................sicily
Platform: | Size: 8773 | Author: 109706466@qq.com | Hits:

[Windows DevelopSicily_ACM_Accepted

Description: 中山大学ACM网站Sicily上的50题AC源码!效率高,算法好!-Sun Yat-sen University Sicily on the ACM web site AC source 50 title! High efficiency, good algorithm!
Platform: | Size: 15360 | Author: G。G。 | Hits:

[DocumentsSicily_1198

Description: Sicily 1198题 SubString 源代码-Sicily 1198 source code
Platform: | Size: 1024 | Author: lrb | Hits:

[Other1029-Rabbit

Description: 中大oj(Sicily)1029的题目。这道题目主要是看清递归关系式而编即可。注意处理精度。本程序利用四位进位处理精度。-Problem The rabbits have powerful reproduction ability. One pair of adult rabbits can give birth to one pair of kid rabbits every month. And after m months, the kid rabbits can become adult rabbits. As we all know, when m=2, the sequence of the number of pairs of rabbits in each month is called Fibonacci sequence. But when m<>2, the problem seems not so simple. You job is to calculate after d months, how many pairs of the rabbits are there if there is exactly one pair of adult rabbits initially. You may assume that none of the rabbits dies in this period. Input The input may have multiple test cases. In each test case, there is one line having two integers m(1<=m<=10), d(1<=d<=100), m is the number of months after which kid rabbits can become adult rabbits, and d is the number of months after which you should calculate the number of pairs of rabbits. The input will be terminated by m=d=0. Output You must print the n
Platform: | Size: 1024 | Author: 冰淇淋 | Hits:

[Othersicily1587

Description: 中大ACM sicily 1587 eaten or be eaten题目代码-SYSU ACM answer code for 1587 on sicily
Platform: | Size: 529408 | Author: alex | Hits:

[Othersicily1093

Description: 中山大学ACM SICILY 1093 air express题目代码-Sun Yat-sen University ACM SICILY 1093 air express subject code
Platform: | Size: 519168 | Author: alex | Hits:

[Othersicilybovielatin

Description: 中山大学 ACM sicily bovie latin 题目代码-Sun Yat-sen University ACM sicily bovie latin subject code
Platform: | Size: 515072 | Author: alex | Hits:

[Othersicily1380

Description: 中山大学 ACM sicily 1380 题目代码-Sun Yat-sen University ACM sicily 1380 the subject code
Platform: | Size: 489472 | Author: alex | Hits:

[Othersicily1428

Description: 中山大学 ACM sicily 1428 题目代码-Sun Yat-sen University ACM sicily 1428 the subject code
Platform: | Size: 499712 | Author: alex | Hits:

[Othersicily1510

Description: 中山大学 ACM sicily 1510 题目代码-Sun Yat-sen University ACM sicily 1510 the subject code
Platform: | Size: 510976 | Author: alex | Hits:

[Othersicily1712

Description: 中山大学 ACM sicily 1712 题目代码-Sun Yat-sen University ACM sicily 1712 the subject code
Platform: | Size: 346112 | Author: alex | Hits:

[Delphi/CppBuildersicily

Description: sicily 源代码 高质量 accepted-sicily
Platform: | Size: 15360 | Author: baby | Hits:

[Mathimatics-Numerical algorithmssicily

Description: 中山大学sicilyAC源码+注释+中文说明-SYSU sicily Accepted
Platform: | Size: 92160 | Author: 陈光南 | Hits:

[Mathimatics-Numerical algorithmssysu_sicily_acm_leture

Description: 中山大学算法课件,动态规划,数论,及其他常用的算法,还有一些具体题目的分析(sicily)-the lecture of algorithms, sysu acm
Platform: | Size: 2158592 | Author: youguiyan | Hits:

[Mathimatics-Numerical algorithmscode

Description: 中山大学acm online sicily,一些经典的题目-problems of sysu sicily
Platform: | Size: 19456 | Author: youguiyan | Hits:

[Othersicily

Description: 中大sicily上的1000到1765题中大部分题目的代码,已通过测试。仅供参考只用-Code of some probelms on Sicily forum of SUN-Yat-Sen university,has been tested. For reference only.
Platform: | Size: 72704 | Author: tiantian | Hits:

[Other1002

Description: Sicily上的1002题,主要是为一些初学者设计的-Problem Given a sequence of consecutive integers n,n+1,n+2,...,m, an anti-prime sequence is a rearrangement of these integers so that each adjacent pair of integers sums to a composite (non-prime) number. For example, if n = 1 and m = 10, one such anti-prime sequence is 1,3,5,4,2,6,9,7,8,10. This is also the lexicographically first such sequence. We can extend the definition by defining a degree danti-prime sequence as one where all consecutive subsequences of length 2,3,...,d sum to a composite number. The sequence above is a degree 2 anti-prime sequence, but not a degree 3, since the subsequence 5, 4, 2 sums to 11. The lexicographically .rst degree 3 anti-prime sequence for these numbers is 1,3,5,4,6,2,10,8,7,9.
Platform: | Size: 1024 | Author: 胡乔 | Hits:

[Othersicily

Description: 中大sicily部分题目代码,已经在OJ上通过-sysu,sicily,source code
Platform: | Size: 9216 | Author: 李攀 | Hits:

[Windows CEsicily

Description: 中山大学sicily中的大部分代码,已经通过,绝对Accepted。-The code of the sicily has been accepted in Sun-Yan-Sen University
Platform: | Size: 23552 | Author: 郭嵩山 | Hits:

[Othersicily

Description: 这是一个Sicily上的题目,可供大家参考-This is a topic on Sicily
Platform: | Size: 6144 | Author: 我还没变 | Hits:
« 12 3 4 5 »

CodeBus www.codebus.net