随笔分类 - ACM_高精度
摘要:题目链接 题意:给定一个很大的数,把他们分为数个回文数的和,分的个数不超过50个,输出个数并输出每个数,special judge。 题解:现场赛的时候很快想出来了思路,把这个数从中间分为两部分,当位数为偶数的时候3456就分为34和56,34-1=33,回文数3333,3456-3333=123然
阅读全文
摘要:题目链接 题意:中文题。 题解:暴力枚举。
阅读全文
摘要:Sum Time Limit:1000MS Memory Limit:131072KB 64bit IO Format:%I64d & %I64u Submit Status Practice HDU 4704 Sum Submit Status Practice HDU 4704 Descript
阅读全文
摘要:Chinese Girls' Amusement Time Limit:1000MS Memory Limit:64000KB 64bit IO Format:%lld & %llu Submit Status Practice ACdream 1210 Chinese Girls' Amuseme
阅读全文
摘要:Children’s Queue Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13333 Accepted Submission(s): 43
阅读全文
摘要:Hat's Fibonacci Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10568 Accepted Submission(s): 350
阅读全文
摘要:又见a+b 又见a+b Problem:1146 Time Limit:1000ms Memory Limit:65535K Description 给定两个非负整数A,B,求他们的和。 Input 多组输入,每组输入两个非负整数A和B(0<=A,B<10^3000),可能会有前缀0,但保证总长度不
阅读全文
摘要:Function1 Function1 Problem:F Time Limit:1000ms Memory Limit:65535K Problem:F Time Limit:1000ms Memory Limit:65535K Problem:F Problem:F Time Limit:100
阅读全文
摘要:Train Problem II Time Limit: 1000MS Memory Limit: 32768KB 64bit IO Format: %I64d & %I64u Submit Status Description As we all know the Train Problem I,
阅读全文