摘要：
Can you find it?Time Limit: 10000/3000 MS (Java/Others)Memory Limit: 32768/10000 K (Java/Others)Total Submission(s): 9266Accepted Submission(s): 2418Problem DescriptionGive you three sequences of numbers A, B, C, then we give you a number X. Now you need to calculate if you can find the three number 阅读全文
摘要：
Can you solve this equation?Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6763Accepted Submission(s): 3154Problem DescriptionNow,given the equation 8*x^4 + 7*x^3 + 2*x^2 + 3*x + 6 == Y,can you find its solution between 0 and 100;Now please try yo 阅读全文
摘要：
Feel GoodTime Limit:3000MSMemory Limit:65536KTotal Submissions:8753Accepted:2367Case Time Limit:1000MSSpecial JudgeDescriptionBill is developing a new mathematical theory for human emotions. His recent investigations are dedicated to studying how good or bad days influent people's memories about 阅读全文
摘要：
NecklaceTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1566Accepted Submission(s): 455Problem DescriptionYou are given a necklace consists of N beads linked as a circle. Each bead is either crystal or jade.Now, your task is:1.Choose an arbitrary p 阅读全文
摘要：
Non-negative Partial SumsTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1420Accepted Submission(s): 544Problem DescriptionYou are given a sequence of n numbers a0,..., an-1. A cyclic shift by k positions (0=0 的个数。 7 想了一下，思路有了。可以这样子。 8 任意前i数和都满足> 阅读全文
摘要：
Max Sum of Max-K-sub-sequenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5335Accepted Submission(s): 1939Problem DescriptionGiven a circle sequence A[1],A[2],A[3]......A[n]. Circle sequence means the left neighbour of A[1] is A[n] , and the rig 阅读全文
摘要：
Sliding WindowTime Limit:12000MSMemory Limit:65536KTotal Submissions:35031Accepted:10343Case Time Limit:5000MSDescriptionAn array of sizen≤ 106is given to you. There is a sliding window of sizekwhich is moving from the very left of the array to the very right. You can only see theknumbers in the win 阅读全文
摘要：
Problem 1894 志愿者选拔Accept: 1205Submit: 3808Time Limit: 1500 mSecMemory Limit : 32768 KB Problem Description世博会马上就要开幕了，福州大学组织了一次志愿者选拔活动。参加志愿者选拔的同学们排队接受面试官们的面试。参加面试的同学们按照先来先面试并且先结束的原则接受面试官们的考查。面试中每个人的人品是主要考查对象之一。（提高人品的方法有扶老奶奶过街，不闯红灯等）作为主面试官的John想知道当前正在接受面试的同学队伍中人品值最高的是多少。于是他请你帮忙编写一个程序来计算。 Input输入数据第一行为 阅读全文
摘要：
1 LL pow1_sum(LL a,LL b,LL mod) //a*b%mod 2 { 3 a=a%mod; 4 b=b%mod; 5 LL cur=0; 6 while(b) 7 { 8 if(b&1) 9 {10 cur=cur+a;11 if(cur>=mod) cur=cur-mod;12 }13 a=a=mod) a=a-mod;15 b=b>>1;16 }17 return cur;18 }19... 阅读全文