Buy Tickets
Time Limit: 4000MS Memory Limit: 65536K
Total Submissions: 12734 Accepted: 6292
Description
Railway tickets were difficult to buy around the Lunar New Year in China, so we must...
分类：
其他好文 时间：
2014-07-28 00:08:59
阅读次数：
399
Ubiquitous Religions
Time Limit: 5000MS Memory Limit: 65536K
Total Submissions: 23580 Accepted: 11609
Description
There are so many different religions in the world today that it is difficult to...
分类：
其他好文 时间：
2014-07-26 02:34:00
阅读次数：
246
Description
The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has no public highways. So the traffic is difficult in Flatopia. The Flatopian government is aware of this problem...
分类：
其他好文 时间：
2014-07-22 18:01:17
阅读次数：
230
Highways
Description
The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has no public highways. So the traffic is difficult in Flatopia. The Flatopian government is aware...
分类：
其他好文 时间：
2014-07-21 14:03:40
阅读次数：
184
Description
Problem C: A Walk Through the Forest
Jimmy experiences a lot of stress at work these days, especially since his accident made working difficult. To relax after a hard day, he likes to ...
分类：
其他好文 时间：
2014-07-21 09:27:14
阅读次数：
300
DescriptionRailway tickets were difficult to buy around the Lunar New Year in China, so we must get up early and join a long queue…The Lunar New Year ...
分类：
其他好文 时间：
2014-07-18 18:17:12
阅读次数：
280
Description
There are so many different religions in the world today that it is difficult to keep track of them all. You are interested in finding out how many different religions students in your ...
分类：
其他好文 时间：
2014-07-17 16:02:36
阅读次数：
264
DescriptionThere are so many different religions in the world today that it is difficult to keep track of them all. You are interested in finding out ...
分类：
其他好文 时间：
2014-07-13 08:17:12
阅读次数：
267
Buy Tickets
Time Limit: 4000MS
Memory Limit: 65536K
Total Submissions: 12296
Accepted: 6071
Description
Railway tickets were difficult to buy around the Lunar New Y...
分类：
其他好文 时间：
2014-07-08 15:24:47
阅读次数：
160
This question is not so difficult.
First,my thoughts were we should use a lot of code to find out the loop block,but there is no need to do that .
you just need to get every new position of char in ...
分类：
其他好文 时间：
2014-06-27 23:39:44
阅读次数：
293
