李硕

Saving Beans Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1666    Accepted Submission(s): 592 Problem Description Although winte

Number Sequence Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 78704    Accepted Submission(s): 18378 Problem Description A number

还是上传上来吧,又一中快速幂的写法这个快速幂的写法比较简单,不用求digit数组 #include #include #include #include using namespace std; const int MOD = 10007; int quick_pow(int n, int m) { int temp = n; int ans = 1; while (m >

Fibonacci Check-up Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 900    Accepted Submission(s): 507 Problem Description Every ALP

C - Gauss Fibonacci Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Submit Status Appoint description:  System Crawler  (2011-07-23) Description Without ex

Another kind of Fibonacci Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1175    Accepted Submission(s): 446 Problem Description A