摘要： Race to 1Time Limit:10000MSMemory Limit:Unknown64bit IO Format:%lld & %llu[Submit] [Go Back] [Status]DescriptionBRace to 1Input:Standard InputOutput:Standard OutputDilu have learned a new thing about integers, which is - any positive integer greater than 1 can be divided by at least one prime nu 阅读全文

摘要： 不要62Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16975Accepted Submission(s): 5566Problem Description杭州人称那些傻乎乎粘嗒嗒的人为62（音：laoer）。杭州交通管理局经常会扩充一些的士车牌照，新近出来一个好消息，以后上牌照，不再含有不吉利的数字了，这样一来，就可以消除个别的士司机和乘客的心理障碍，更安全地服务大众。不吉利的数字为所有含有4或62的号码。例如：62315 73418 8 阅读全文

摘要： Kia's CalculationTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1367Accepted Submission(s): 327Problem DescriptionDoctor Ghee is teaching Kia how to calculate the sum of two integers. But Kia is so careless and alway forget to carry a number w 阅读全文

摘要： The Moving PointsTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 964Accepted Submission(s): 393Problem DescriptionThere are N points in total. Every point moves in certain direction and certain speed. We want to know at what time that the largest d 阅读全文

摘要： Naive and Silly MugglesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 452Accepted Submission(s): 307Problem DescriptionThree wizards are doing a experiment. To avoid from bothering, a special magic is set around them. The magic forms a circle, whi 阅读全文

摘要： Problem 2144 Shooting GameAccept: 99Submit: 465Time Limit: 1000 mSecMemory Limit : 32768 KBProblem DescriptionFat brother and Maze are playing a kind of special (hentai) game in the playground. (Maybe it’s the OOXX game which decrypted in the last problem, who knows.) But as they don’t like using re 阅读全文

摘要： 1、本原勾股数：概念：一个三元组(a,b,c)，其中a,b,c没有公因数而且满足：a^2+b^2=c^2首先，这种本原勾股数的个数是无限的，而且构造的条件满足：a=s*t,b=(s^2-t^2)/2,c=(s^2+t^2)/2其中s>t>=1是任意没有公因数的奇数！由以上概念就可以导出任意一个本原勾股数组。2、素数计数（素数定理）令π(x)为1到x中素数的个数19世纪最高的数论成就就是以下这个玩意儿：lim(x->∞){π(x)/(x/ln(x))}=1数论最高成就，最高成就！！！有木有！！！3、哥德巴赫猜想(1+1)一个大偶数(>=4)必然可以拆分为两个素数的和，虽然 阅读全文

摘要： 1.burnside定理，polya计数法 这个大家可以看brudildi的《组合数学》，那本书的这一章写的很详细也很容易理解。最好能完全看懂了，理解了再去做题，不要只记个公式。 *简单题：（直接用套公式就可以了） pku2409 Let it Bead http://acm.pku.edu.cn/JudgeOnline/problem?id=2409 pku2154 Color http://acm.pku.edu.cn/JudgeOnline/problem?id=2409 pku1286 Necklace of Beads ... 阅读全文

摘要： Eddy's爱好Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1266Accepted Submission(s): 541Problem DescriptionIgnatius 喜欢收集蝴蝶标本和邮票，但是Eddy的爱好很特别，他对数字比较感兴趣，他曾经一度沉迷于素数，而现在他对于一些新的特殊数比较有兴趣。这些特殊数是这样的：这些数都能表示成M^K，M和K是正整数且K>1。正当他再度沉迷的时候，他发现不知道什么时候才能知道这样 阅读全文

摘要： 本原串Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 580Accepted Submission(s): 202Problem Description由0和1组成的串中，不能表示为由几个相同的较小的串连接成的串，称为本原串，有多少个长为n（n 2 #include 3 #include 4 #include 5 using namespace std; 6 #define mod 2008 7 #define ll int 8 int ... 阅读全文