小寒

数的长度时间限制：3000 ms  |  内存限制：65535 KB难度：1描述     N！阶乘是一个非常大的数，大家都知道计算公式是N!=N*(N-1）······*2*1.现在你的任务是计算出N！的位数有多少（十进制）？输入首行输入n，表示有多少组测试数据(n随后n行每行输入一组测试数据 N( 0 输出对于每个数N，输出N!的（十进制）位数。样例输入313

Pseudoprime numbersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7396 Accepted: 3050DescriptionFermat's theorem states that for any prime number p and for any integer a > 1, ap

Raising Modulo NumbersTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 5343 Accepted: 3122DescriptionPeople are different. Some secretly read magazines full of interesting girls' pi

GCD and LCMWrite a program which computes the greatest common divisor (GCD) and the least common multiple (LCM) of given a and b (0 InputInput consists of several data sets. Each data set co

Carmichael Numbers An important topic nowadays in computer science is cryptography. Some people even think that cryptography is the only important field in computer science, and that life would not

CakeTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2350    Accepted Submission(s): 1225Problem Description一次生日Party可能有p人或者q人参加,

找新朋友Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8276    Accepted Submission(s): 4340Problem Description新年快到了，“猪头帮协会”准备搞一个聚会，

相遇周期Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2548 Accepted Submission(s): 1181 Problem Description2007

An problem about date时间限制：2000 ms  |  内存限制：65535 KB难度：2描述acm的iphxer经常忘记某天是星期几，但是他记那天的具体日期，他希望你能写个程序帮帮他。 输入每行有三个整数 year,month,day，日期在1600年1月1日到9600年1月1日之间;输出输出对应的星期，用一个整

矩形的个数时间限制：1000 ms  |  内存限制：65535 KB难度：1描述 在一个3*2的矩形中，可以找到6个1*1的矩形，4个2*1的矩形3个1*2的矩形，2个2*2的矩形，2个3*1的矩形和1个3*2的矩形，总共18个矩形。给出A，B,计算可以从中找到多少个矩形。输入本题有多组输入数据（输入2个整数A,B(1输出输出找到的矩形数。 样例输

A problem is easy时间限制：1000 ms  |  内存限制：65535 KB难度：3描述 When Teddy was a child , he was always thinking about some simple math problems ,such as “What it’s 1 cup of water plus 1 pile of dough ..

Prime NumberWrite a program which reads an integer n and prints the number of prime numbers which are less than or equal to n. A prime number is a natural number which has exactly two distinct nat