樱花落舞

摘要： Description Greatest common divisor GCD(a, b) of two positive integers a and b is equal to the biggest integer d such that both integers a and b are d 阅读全文

摘要： #include #include #include using namespace std; #define DIGIT 4 //四位隔开,即万进制 #define DEPTH 10000 //万进制 #define MAX 100 //题目最大位数/4，要不大直接设为最大位数也行 typedef int bignum_t[MAX+1]... 阅读全文

摘要： Description Consider 2n rows of the seats in a bus. n rows of the seats on the left and n rows of the seats on the right. Each row can be filled by tw 阅读全文

摘要： Description You are given an array of n elements, you must make it a co-prime array in as few moves as possible. In each move you can insert any posit 阅读全文

摘要： Description Mike and some bears are playing a game just for fun. Mike is the judge. All bears except Mike are standing in an n × m grid, there's exact 阅读全文

摘要： Description While Mike was walking in the subway, all the stuff in his back-bag dropped on the ground. There were several fax messages among them. He 阅读全文

摘要： ULL C(int n,int m) { if(n<m) return 0; ULL ans=1; for(int i=0;i<m;i++) ans=ans*(ULL)(n-i)/(ULL)(i+1); return ans; } ULL A(int n,int m) { if(n<m) retur 阅读全文

摘要： Description IT City company developing computer games decided to upgrade its way to reward its employees. Now it looks the following way. After a new 阅读全文

摘要： Description The Department of economic development of IT City created a model of city development till year 2100. To prepare report about growth persp 阅读全文

摘要： Description IT City company developing computer games invented a new way to reward its employees. After a new game release users start buying it activ 阅读全文