摘要:
Sumsets Time Limit: 2000MS Memory Limit: 200000K Total Submissions: 18373 Accepted: 7190 Description Farmer John commanded his cows to search for diff 阅读全文
摘要:
Cow Bowling Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 18561 Accepted: 12360 Description The cows don't use actual bowling balls when 阅读全文
摘要:
Problem Description Computer simulations often require random numbers. One way to generate pseudo-random numbers is via a function of the formseed(x+1 阅读全文
摘要:
Problem Description The digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit the 阅读全文
摘要:
Problem Description A number sequence is defined as follows:f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.Given A, B, and n, you are 阅读全文
摘要:
Problem Description Contest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time is gues 阅读全文