夏午晴天

摘要： 1 #include 2 3 using namespace std; 4 #define LL long long 5 6 LL fac(int n) 7 { 8 LL f; 9 if(n == 0 || n == 1) 10 f = 1; 11 else f = n * fac(n - 1); 12 return f;... 阅读全文

摘要： A. Gotta Catch Em' All! time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output A. Gotta Catch Em 阅读全文

摘要： A. Neverending competitions time limit per test 2 seconds memory limit per test 512 megabytes input standard input output standard output A. Neverendi 阅读全文

摘要： A. Dasha and Stairs time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output A. Dasha and Stairs 阅读全文

摘要： A. New Year and Hurry time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output A. New Year and Hur 阅读全文

摘要： 题目描述 一群妖王排成一排站在苦情巨树下，寻找自己的转世恋人。虽然都是妖王，但按照涂山的规定必须进行标号，标号为1的妖王排在最后面，标号为n的妖王排在最前面。每个妖王只有一个妖力值a[i]表示它们现在的地位。妖王们是讲究实力的，当然不服比它妖力值低的居然可以排在前面，它们现在想知道在它前面，妖力值比 阅读全文

摘要： Misha hacked the Codeforces site. Then he decided to let all the users change their handles. A user can now change his handle any number of times. But 阅读全文

摘要： 1 #include 2 3 using namespace std; 4 //upper_bound(a, arr + 10, 7) - a; 5 int search(int *a, int l, int r, int key) 6 { 7 int mid; 8 while(l key) r = mid - 1; 14 } 15 retu... 阅读全文

摘要： SPY The National Intelligence Council of X Nation receives a piece of credible information that Nation Y will send spies to steal Nation X’s confident 阅读全文

摘要： Let the Balloon Rise Contest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time is gue 阅读全文