随笔分类 -  搜索

摘要：J -Goblin WarsTime Limit:3000MSMemory Limit:0KB64bit IO Format:%lld & %lluSubmitStatusPracticeUVALive 5992Appoint description:DescriptionACM International Collegiate Programming Contest, Asia-Amritapuri Site, 2011Problem J: Goblin WarsThe wizards and witches of Hogwarts School of Witchcraft foun 阅读全文

摘要：C. Valera and Electionstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe city Valera lives in is going to hold elections to the city Parliament.The city hasndistricts andn - 1bidirectional roads. We know that from any district there is a path al 阅读全文

摘要：I -Biridian ForestTime Limit:2000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusAppoint description:DescriptionYou're a mikemon breeder currently in the middle of your journey to become a mikemon master. Your current obstacle is go through the infamous Biridian Forest.The fo 阅读全文

摘要：D. Block Towertime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAfter too much playing on paper, Iahub has switched to computer games. The game he plays is called "Block Towers". It is played in a rectangular grid withnrows andmcolumns (i 阅读全文

摘要：A. Two Semiknights Meettime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputA boy Petya loves chess very much. He even came up with a chess piece of his own, a semiknight. The semiknight can move in any of these four directions:2squares forward and2squ 阅读全文

摘要：484. KolaTime limit per test: 0.5 second(s)Memory limit: 65536 kilobytesinput: standardoutput: standardOne day Vasya decided to buy a bottle of his favourite Kola in the old vending machine. But he forgot that there was a Halloween that day, so evil forces had made an inner structure of the vending 阅读全文

摘要：Yet Another Multiple ProblemTime Limit: 40000/20000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2004Accepted Submission(s): 482Problem DescriptionThere are tons of problems about integer multiples. Despite the fact that the topic is not original, the content is high 阅读全文