kongming_acm的专栏

 2156: DrunkStatusIn/OutTIME LimitMEMORY LimitSubmit TimesSolved UsersJUDGE TYPEstdin/stdout3s8192K1158262StandardJack is drunk again and he wants to walk out of

<br /> 1267: Pascal's Triangle of DeathResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K35889Standard<br />In this problem, you are asked to generate Pascal's Triangle. Pascal's Triangle is useful in many areas from probability to polynomials to pr

<br /> 2506: Pseudoprime numbersResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s16384K26572Standard<br />Fermat's theorem states that for any prime number p and for any integer a > 1, a^p == a (mod p). That is, if we raise a to the pth power and divide

<br />1600: Big ModResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K1658309Standard<br />Calculate <br /> <br /><br /> <br />for large values of B, P, and M using an efficient algorithm. (That's right, this problem has a time dependency !!!.) <br /

<br />1996: Super AdditionResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE60s10240K2026141Standard<br />The sum of any two integers A=a1a2...an and B=b1b2...bn is very easy to make(of course ai or bi may be zero), especially to programmers, because they

1199: Just the FactsStatusIn/OutTIME LimitMEMORY LimitSubmit TimesSolved UsersJUDGE TYPEstdin/stdout3s8192K734332StandardThe expression N!, read as ``N factoria

1189: Integer InquiryStatusIn/OutTIME LimitMEMORY LimitSubmit TimesSolved UsersJUDGE TYPEstdin/stdout1s8192K879320StandardOne of the first users of BITs new supe

#includeint main(){ int nn,n; scanf("%d",&nn); while(nn--) {  scanf("%d",&n);  int count=0;  while(n)  {   count+=n/5;   n/=5;  }  printf("%d/n",count); } return 0;}/*算一个大整数的阶乘的末尾有多少的0.算法:不断的将该数除以5,

 1920: JojerStatusIn/OutTIME LimitMEMORY LimitSubmit TimesSolved UsersJUDGE TYPEstdin/stdout3s8192K652204StandardMr Jojer is a teacher, and he is crazy in progr

 1949: Fibonacci NumbersStatusIn/OutTIME LimitMEMORY LimitSubmit TimesSolved UsersJUDGE TYPEstdin/stdout3s16384K775220Special TestA Fibonacci sequence is calculat

Number Sequence<br />Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 37463    Accepted Submission(s): 7885<br /><br />Problem DescriptionA number sequence is defined as follows:<br /><br />f(1)