Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2028 Accepted Submission(s): 819 Problem Description After an uphill battle, General Li won a great victory. Now the head of state decide to re
Reward Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5940 Accepted Submission(s): 1827 Problem Description Dandelion's uncle is a boss of a factory. As the spring festival is coming , he w
Reward Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4638 Accepted Submission(s): 1416 Problem Description Dandelion's uncle is a boss of a factory. As the spring festival is coming , he w
A Knight's Journey Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 33634 Accepted: 11450 Description Background The knight is getting bored of seeing the same black and white squares again and again and has decided to make a journey around
A Knight's Journey Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 32422 Accepted: 11040 Description Background The knight is getting bored of seeing the same black and white squares again and again and has decided to make a journey ar
A Knight's Journey Time Limit: 1000ms Memory Limit: 65536KB This problem will be judged on PKU. Original ID: 248864-bit integer IO format: %lld Java class name: Main Background The knight is getting bored of seeing the same black and white squa
Little boy Igor wants to become a traveller. At first, he decided to visit all the cities of his motherland — Uzhlyandia. It is widely known that Uzhlyandia has n cities connected with m bidirectional roads. Also, there are no two roads in the countr