Dyan的专栏

Time limit : 3 sec   Memory limit : 32 M For each pair of integers A B and C ( -2^31 Sample Input 1 2 3 3 4 3 Sample Output 6 10 提示 请注意32位机上int的表示范围。 Solution: #include

Time limit : 10 sec   Memory limit : 64 M According to Goldbach’s conjecture, every evennumber can be expressed as a sum of two oddprimes. Which numbers can be expressed as thesum of tw

Time limit : 1 sec   Memory limit : 64 M Tom is a master in several mathematical-theoretical disciplines. He recently founded a research-lab at ouruniversity and teaches newcomers lik

Time limit : 15 sec   Memory limit : 32 M Find a minimal interger K which is merely comprised of N and can be divided by M. For example,11 is the minimal number that and be divid

Description We have 3 positive numbers a, b, c where a >= b. Given p = a mod c and q = b mod c, you should calculate ( a - b) mod c. Hint 1: For any two positive numbers a and b, where a = k * b +

Time limit : 10 sec   Memory limit : 32 M for each pair of integers A and B ( 0 Sample Input 1 2 3 4 Sample Output 3 7 Solution: #include int main() { int a=0,b=0;

找1到N之间的素数（包括1和N），如果素数数未偶数，则输出最中间的2*C个，否则输出最中间的2*C-1个 Input Each input set will be on a line by itself and will consist of 2 numbers. The first number (1 <= N <= 1000) is the maximum number in th

模拟题、枚举： 1000 A+B 1001 A+B+C 1004 Prime Palindromes 1006   Weird Clock 1009 Fat Cat 1010 The Angle 1025 Skew Binary 1043 Maya Calendar 1054 Game Prediction 1057 Mileage Bank 1069 Prime Land