05 2017 档案
摘要:1 #include 2 #include 3 #include 4 using namespace std; 5 int gcd(int a,int b) 6 { 7 return b==0?a:gcd(b,a%b); 8 } 9 int main() 10 { 11 int b,a; 12 while(~scanf("%d%d",&a,&b))...
阅读全文
摘要:Ignatius's puzzle Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9783 Accepted Submission(s): 68
阅读全文
摘要:Number Sequence Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 171693 Accepted Submission(s): 42
阅读全文
摘要:Problem Description Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7
阅读全文
摘要:A Simple Math Problem Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1795 Accepted Submission(s)
阅读全文
摘要:As is known to all,the ASCII of character 'a' is 97. Now,find out how many character 'a' in a group of given numbers. Please note that the numbers her
阅读全文
摘要:Buy the Ticket Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6867 Accepted Submission(s): 2845
阅读全文
摘要:One spring day on his way to university Lesha found an array A. Lesha likes to split arrays into several parts. This time Lesha decided to split the a
阅读全文
摘要:1 int powermod(int a,int b,int c) 2 { 3 int ans=1; 4 a=a%c; 5 while(b>0) 6 { 7 if(b%2==1) 8 ans=(ans*a)%c; 9 b=b/2; 10 a=(a*a)%c; 11 } 12 ...
阅读全文

浙公网安备 33010602011771号