随笔分类 - ACM/ICPC-POJ
ACM/ICPC,POJ
摘要：FroggerTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 17471Accepted: 5692DescriptionFreddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on another stone. He plans to visit her, but since the water is dirty and full of tourists' sunsc
阅读全文
摘要：Find The MultipleTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 12097Accepted: 4968Special JudgeDescriptionGiven a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains only the digits 0 and 1. You may assume that n is not greater .
阅读全文
摘要：A Funny GameTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 2979Accepted: 1722DescriptionAlice and Bob decide to play a funny game. At the beginning of the game they pick n(1 <= n <= 106) coins in a circle, as Figure 1 shows. A move consists in removing one or two adjacent coins, leav
阅读全文
摘要：NimTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 3591Accepted: 1623DescriptionNim is a 2-player game featuring several piles of stones. Players alternate turns, and on his/her turn, a player’s move consists of removing one or more stones from any single pile. Play ends when all the stone.
阅读全文
摘要：Matches GameTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 6537Accepted: 3739DescriptionHere is a simple game. In this game, there are several piles of matches and two players. The two player play in turn. In each turn, one can choose a pile and take away arbitrary number of matches from .
阅读全文
摘要：A multiplication gameTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 4350Accepted: 2147DescriptionStan and Ollie play the game of multiplication by multiplying an integer p by one of the numbers 2 to 9. Stan always starts with p = 1, does his multiplication, then Ollie multiplies the numbe.
阅读全文
摘要：Curling 2.0Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 4112Accepted: 1699DescriptionOn Planet MM-21, after their Olympic games this year, curling is getting popular. But the rules are somewhat different from ours. The game is played on an ice game board on which a square mesh is marked.
阅读全文
摘要：棋盘问题Time Limit: 1000MSMemory Limit: 10000KTotal Submissions: 8895Accepted: 4278Description在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编程求解对于给定形状和大小的棋盘，摆放k个棋子的所有可行的摆放方案C。Input输入含有多组测试数据。 每组数据的第一行是两个正整数，n k，用一个空格隔开，表示了将在一个n*n的矩阵内描述棋盘，以及摆放棋子的数目。 n <= 8 , k <= n 当为-1 -1时表示输入结束
阅读全文
摘要：A Knight's JourneyTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 11297Accepted: 3773DescriptionBackground The knight is getting bored of seeing the same black and white squares again and again and has decided to make a journey around the world. Whenever a knight moves, it is two square
阅读全文
摘要：SticksTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 72127Accepted: 15839DescriptionGeorge took sticks of the same length and cut them randomly until all parts became at most 50 units long. Now he wants to return sticks to the original state, but he forgot how many sticks he had originall.
阅读全文
摘要：Catch That CowTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 18320Accepted: 5630DescriptionFarmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a number line and the cow is at a point K (0 ≤ K ≤ 100.
阅读全文
摘要：Find The MultipleTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 7103Accepted: 2952Special JudgeDescriptionGiven a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains only the digits 0 and 1. You may assume that n is not greater t.
阅读全文
摘要：PotsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 4011Accepted: 1689Special JudgeDescriptionYou are given two pots, having the volume of A and B liters respectively. The following operations can be performed:FILL(i) fill the pot i (1 ≤ i ≤ 2) from the tap;DROP(i) empty the pot i to the d.
阅读全文
摘要：Children of the Candy CornTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 4063Accepted: 1850DescriptionThe cornfield maze is a popular Halloween treat. Visitors are shown the entrance and must wander through the maze facing zombies, chainsaw-wielding psychopaths, hippies, and other terrors.
阅读全文
摘要：Network SaboteurTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 4515Accepted: 1889DescriptionA university network is composed of N computers. System administrators gathered information on the traffic between nodes, and carefully divided the network into two subnetworks in order to minimize.
阅读全文
摘要：Channel AllocationTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 6071Accepted: 3108DescriptionWhen a radio station is broadcasting over a very large area, repeaters are used to retransmit the signal so that every receiver has a strong signal. However, the channels used by each repeater mu.
阅读全文
摘要：Shredding CompanyTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 1807Accepted: 1037DescriptionYou have just been put in charge of developing a new shredder for the Shredding Company Although a "normal" shredder would just shred sheets of paper into little pieces so that the conten
阅读全文
摘要：SudokuTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 6771Accepted: 3277Special JudgeDescriptionSudoku is a very simple task. A square table with 9 rows and 9 columns is divided to 9 smaller squares 3x3 as shown on the Figure. In some of the cells are written decimal digits from 1 to 9. Th.
阅读全文
摘要：Tree RecoveryTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 4273Accepted: 2852DescriptionLittle Valentine liked playing with binary trees very much. Her favorite game was constructing randomly looking binary trees with capital letters in the nodes. This is an example of one of her creatio.
阅读全文
摘要：Waiting：你的程序刚刚提交，正在等待OJ评测你的程序。Compiling：OJ正在编译你的程序。Accepted：OK!你的程序是正确的 ^_^。Wrong Answer：你的程序运行的结果和正确结果不同。状态页面CASE那一览显示的是你的程序在第几个样例上出错的。Time Limit Exceeded：你的程序运行时间太长了，超过了对应题目的时间限制。Memory Limit Exceeded：你的程序运行所用的内存太多了，超过了对应题目的限制。Output Limit Exceeded：你的程序输出了太多的内容了，超过了OJ的限制，轻检查你的程序中是否有可能存在无限循环输出。Floa
阅读全文
浙公网安备 33010602011771号