摘要:
Divisors Description Your task in this problem is to determine the number of divisors of Cnk. Just for fun -- or do you need any special reason for su 阅读全文
摘要:
Sticks Description George took sticks of the same length and cut them randomly until all parts became at most 50 units long. Now he wants to return st 阅读全文
摘要:
D. Vasiliy's Multiset time limit per test 4 seconds memory limit per test 256 megabytes input standard input output standard output Author has gone ou 阅读全文
摘要:
阶乘问题 题目描述 也许你早就知道阶乘的含义,N阶乘是由1到N相乘而产生,如: 12! = 1 x 2 x 3 x 4 x 5 x 6 x 7 x 8 x 9 x 10 x 11 x 12 = 479,001,600 12的阶乘最右边的非零位为6。 写一个程序,计算N(1<=N<=50,000,00 阅读全文
摘要:
Wavio Sequence Wavio is a sequence of integers. It has some interesting properties. Wavio is of odd length i.e. L= 2n+ 1. The rst (n+ 1) integers of W 阅读全文
摘要:
History Grading History Grading Description Background Many problems in Computer Science involve maximizing some measure according to constraints. Con 阅读全文
摘要:
Longest Match A newly opened detective agency is struggling with their limited intelligence to find out a secret information passing technique among i 阅读全文
摘要:
#include #include const int MAXN = 100002; using namespace std; int array[MAXN], array2[MAXN]; void Merge(int low, int high){ int i = low; int mid = (low + high)/2; int j = mid+1; ... 阅读全文