摘要：
Problem Description 七夕节那天,月老来到数字王国,他在城门上贴了一张告示,并且和数字王国的人们说:"你们想知道你们的另一半是谁吗?那就按照告示上的方法去找吧!" 人们纷纷来到告示前,都想知道谁才是自己的另一半.告示如下: 数字N的因子就是所有比N小又能被N整除的所有正整数...
阅读全文
posted @ 2015-04-24 10:37
星斗万千
阅读(112)
推荐(0)
编辑
摘要：
Problem Description Eddy's interest is very extensive, recently he isinterested in prime number. Eddy discover the all number owned can be dividedin...
阅读全文
posted @ 2015-04-24 10:33
星斗万千
阅读(97)
推荐(0)
编辑
摘要：
Problem Description Now I thinkyou have got an AC in Ignatius.L's "Max Sum" problem. To be a braveACMer, we always challenge ourselves to more diffi...
阅读全文
posted @ 2015-04-24 10:31
星斗万千
阅读(114)
推荐(0)
编辑
摘要：
ProblemDescription The three hands of theclock are rotating every second and meeting each other many times everyday.Finally, they get bored of this ...
阅读全文
posted @ 2015-04-24 10:30
星斗万千
阅读(138)
推荐(0)
编辑
摘要：
Problem Description Have you ever played quoit in a playground? Quoit is agame in which flat rings are pitched at some toys, with all the toys encir...
阅读全文
posted @ 2015-04-24 10:30
星斗万千
阅读(166)
推荐(0)
编辑
摘要：
Problem Description A numbersequence 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...
阅读全文
posted @ 2015-04-24 10:28
星斗万千
阅读(110)
推荐(0)
编辑
摘要：
Problem Description Contest timeagain! How excited it is to see balloons floating around. But to tell you asecret, the judges' favorite time is gues...
阅读全文
posted @ 2015-04-24 10:28
星斗万千
阅读(102)
推荐(0)
编辑
