摘要：
[1443] Weiqihttp://ac.nbutoj.com/Problem/view.xhtml?id=1443时间限制: 1000 ms 内存限制: 65535 K问题描述Have you ever played Weiqi?In a composition, there exist two kinds of chess pieces black and white.The problem is so easy, can you find out how many white pieces are encircled by blacks?输入First line will contai 阅读全文
摘要：
[1444] The Waterfall Flow http://ac.nbutoj.com/Problem/view.xhtml?id=1444时间限制: 1000 ms 内存限制: 65535 K问题描述 The Hero is on the way to beat the Devil, now he comes near to a waterfall flow. The Devil puts a magic on the waterfall flow in order to stop the Hero.The magic makes the waterfall flow... 阅读全文
摘要：
小孩报数问题Time Limit:1000MSMemory Limit:65536KTotal Submissions:8181Accepted:3851Description有N个小孩围成一圈，给他们从1开始依次编号，现指定从第W个开始报数，报到第S个时，该小孩出列，然后从下一个小孩开始报数，仍是报到S个出列，如此重复下去，直到所有的小孩都出列（总人数不足S个时将循环报数），求小孩出列的顺序。Input第一行输入小孩的人数N（N<=64）接下来每行输入一个小孩的名字(人名不超过15个字符)最后一行输入W,S (W < N)，用逗号","间隔Output按人名输 阅读全文
摘要：
QuestionsTime Limit:1000MSMemory Limit:65536KTotal Submissions:1208Accepted:441DescriptionHolding a collegiate programming contest is a very exhausting work. There is a well-known proverb that one fool can ask so many questions that a hundred clever men will not answer. And during a collegiate progr 阅读全文
摘要：
Eeny Meeny MooTime Limit:1000MSMemory Limit:65536KTotal Submissions:2929Accepted:2015DescriptionSurely you have made the experience that when too many people use the Internet simultaneously, the net becomes very, very slow.To put an end to this problem, the University of Ulm has developed a continge 阅读全文
摘要：
Card TrickTime Limit:1000MSMemory Limit:65536KTotal Submissions:3224Accepted:2354DescriptionThe magician shuffles a small pack of cards, holds it face down and performs the following procedure:The top card is moved to the bottom of the pack. The new top card is dealt face up onto the table. It is th 阅读全文
摘要：
ComputerTime Limit : 1000/1000ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 1Accepted Submission(s) : 1Font:Times New Roman|Verdana|GeorgiaFont Size:←→Problem DescriptionA school bought the first computer some time ago(so this computer's id is 1). During the recent 阅读全文
摘要：
Starship TroopersTime Limit : 10000/5000ms (Java/Other)Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 1Accepted Submission(s) : 1Font:Times New Roman|Verdana|GeorgiaFont Size:←→Problem DescriptionYou, the leader of Starship Troopers, are sent to destroy a base of the bugs. The base is 阅读全文