Place the RobotsTime Limit: 5 Seconds Memory Limit:32768 KB Robert is a famous engineer. One day he was given a task by his boss. Thebackground of the task was the following:Given a map consisting of square blocks. There were three kinds of
WHUgirlsTime Limit: 3000/2000 MS(Java/Others) Memory Limit: 131072/131072 K(Java/Others)Total Submission(s): 584 Accepted Submission(s): 262Problem DescriptionThere are many pretty girls in Wuhan University,and as we know, every girl loves
v/:* {behavior:url(#default#VML);}o/:* {behavior:url(#default#VML);}w/:* {behavior:url(#default#VML);}.shape {behavior:url(#default#VML);}-->Girls and BoysTime Limit: 10 Seconds MemoryLimit: 32768 KB the second year of the university somebody
PalindromeTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 31491 Accepted: 10509DescriptionA palindrome is a symmetrical string, that is, a string read identically from left to right as well as from right to left. You are to write a program
Osaisen Choudai!Time Limit: 3 Seconds Memory Limit:65536 KB A saisenbako (賽銭箱,offertory, or religious collection box) is situated in front of the hall ofHakurei Shrine. Hakurei Reimu (博麗霊夢), the miko ofHakurei Shrine, may ask the friends who
Constructing Roads In JGShining's KingdomTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3938 Accepted Submission(s): 1119Problem DescriptionJGShining's kingdom consists of 2n(n is no more
Knight MovesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1147 Accepted Submission(s): 721Problem DescriptionA friend of you is doing research on the Traveling Knight Problem (TKP) where
3100. Getting Gold Time Limit: 5.0 Seconds Memory Limit: 65536KTotal Runs: 246 Accepted Runs: 142 Multiple test filesWe're building an old-school back-to-basics computer game. It's a very simple text based adventure game where you walk
ExponentiationDescriptionProblems involving the computation of exact values of very large magnitude and precision are common. For example, the computation of the national debt is a taxing experience for many computer systems. This problem requires