The Clocks<br />IOI'94 - Day 2 Consider nine clocks arranged in a 3x3 array thusly:|-------| |-------| |-------| | | | | | | | |---O | |---O | | O | | | | | | |

脱离地牢Time Limit:1000MS Memory Limit:10000KDescription在一个神秘的国度里，年轻的王子Paris与美丽的公主Helen在一起过着幸福的生活。他们都随身带有一块带磁性的阴阳魔法石，身居地狱的魔王Satan早就想得到这两块石头了，只要把它们溶化，Satan就能吸收其精华大增自己的魔力。于是有一天他趁二人不留意，吧他们带到了自己的地牢，分别困在了不同的地方。然后Satan念起了咒语，准备炼狱，届时二人都将葬身于这地牢里。 危险！Paris与Helen都知道了Sata

OverfencingKolstad and SchrijversFarmer John went crazy and created a huge maze of fences out in a field. Happily, he left out two fence segments on the edges, and thus created two "exits" for the maze. Even more happily, the maze he created by this over

SubstringTime Limit:1000MS Memory Limit:10000KDescriptionDr lee cuts a string S into N pieces, s[1],…,s[N].Now, Dr lee gives you these N sub-strings: s[1],…,s[N]. There might be several possibilities that the string S could be. For example, if Dr. lee give

 Fractions to Decimals<br /><br />Write a program that will accept a fraction of the form N/D, where N is the numerator and D is the denominator and print the decimal representation. If the decimal representation has a repeating sequence of digits, indicat