nealgavin的专栏

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3001 Accepted Submission(s): 1868Problem DescriptionA friend of you is doing research on

BabelfishTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 26420 Accepted: 11341DescriptionYou have just moved from Waterloo to a big city. The people her

D - Ant on the TreeCrawling in process...Crawling failedTime Limit:2000MSMemory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmitStatus DescriptionConnected undirected gra

C - Mail StampsCrawling in process...Crawling failedTime Limit:2000MSMemory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmitStatus Practice CodeForces 29C Description

Gnome TetravexTime Limit: 10 Seconds Memory Limit: 32768 KB Hart is engaged in playing an interesting game, Gnome Tetravex, these days. In the game, at the beginning, the player is given n

RescueTime Limit: 2 Seconds Memory Limit: 65536 KB Angel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M Angel's friends want to save

Bus PassTime Limit: 5 Seconds Memory Limit: 32768 KB You travel a lot by bus and the costs of all the seperate tickets are starting to add up.Therefore you want to see if it might be a

D - King's Problem?Crawling in process...Crawling failedTime Limit:3000MSMemory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmitStatus Practice CodeForces 30D Description

A very hard mathematic problemTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2581    Accepted Submission(s): 747Problem Description

Yukari's BirthdayTime Limit: 12000/6000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 883    Accepted Submission(s): 151Problem DescriptionToday is

E. Ivan the Fool VS Gorynych the Dragontime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOnce upon a time in

E - Sweets GameTime Limit:3000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 63EDescriptionKarlsson has visited Lillebror again.

Fence RailsBurch, Kolstad, and SchrijversFarmer John is trying to erect a fence around part of his field. He has decided on the shape of the fence and has even already installed the posts, but h

B - Tyndex.BromeTime Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 62BDescriptionTyndex is again well ahead of the rival

HELPTime Limit 1000msMemory Limit 65536Kdescription You are a warrior, but your dear princess was caught by big devil. you want to save the

Saving Princess claire_Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1497    Accepted Submission(s): 559Problem DescriptionPrinces

Problem A: The Monocycle A monocycle is a cycle that runs on one wheel and the one we will be considering is a bit more special. It has a solid wheel colored with five different colors as

Farm IrrigationTime Limit: 2 Seconds Memory Limit: 65536 KB Benny has a spacious farm land to irrigate. The farm land is a rectangle, and is divided into a lot of samll squares. Water pipe

Tempter of the BoneTime Limit: 2 Seconds Memory Limit: 65536 KB The doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to sha

Packing RectanglesIOI 95 The six basic layouts of four rectangles Four rectangles are given. Find the smallest enclosing (new) rectangle into which these four may be fitted without overlapping. B

Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 38029    Accepted Submission(s): 10265Problem DescriptionThe dogg

The ClocksIOI'94 - Day 2 Consider nine clocks arranged in a 3x3 array thusly: |-------| |-------| |-------| | | | | | | | |---O | |---O | | O |

Arithmetic ProgressionsAn arithmetic progression is a sequence of the form a, a+b, a+2b, ..., a+nb where n=0,1,2,3,... . For this problem, a is a non-negative integer and b is a positive integer.

Checker ChallengeExamine the 6x6 checkerboard below and note that the six checkers are arranged on the board so that one and only one is placed in each row and each column, and there is never more tha

The CastleIOI'94 - Day 1 In a stroke of luck almost beyond imagination, Farmer John was sent a ticket to the Irish Sweepstakes (really a lottery) for his birthday. This ticket turned out to have o

Zero SumConsider the sequence of digits from 1 through N (where N=9) in increasing order:1 2 3 ... N. Now insert either a `+' for addition or a `-' for subtraction or a ` ' [blank] to run the

Controlling CompaniesSome companies are partial owners of other companies because they have acquired part of their total shares of stock. For example, Ford owns 12% of Mazda. It is said that a com

OverfencingKolstad and Schrijvers Farmer John went crazy and created a huge maze of fences out in a field. Happily, he left out two fence segments on the edges, and thus created two "exits" for th

Magic SquaresIOI'96 Following the success of the magic cube, Mr. Rubik invented its planar version, called magic squares. This is a sheet composed of 8 equal-sized squares:1234

Anagrams by StackTime Limit: 2 Seconds      Memory Limit: 65536 KB How can anagrams result from sequences of stack operations? There are two sequences of stack operators which can convert TR

NTATime Limit: 2 Seconds      Memory Limit: 65536 KB The NTA (Non-deterministic Tree Automata) is a kind of tree structure device. The device is built in a set of operating rules. With these

CamelotIOI 98 Centuries ago, King Arthur and the Knights of the Round Table used to meet every year on New Year's Day to celebrate their fellowship. In remembrance of these events, we consider a b

FatMouse and CheeseTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2977    Accepted Submission(s): 1160Problem DescriptionFatMouse

D - Two PathsCrawling in process...Crawling failedTime Limit:2000MS    Memory Limit:65536KB   64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 14DDescriptionAs you know,

D - Roads not only in BerlandCrawling in process...Crawling failedTime Limit:2000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 25D DescriptionB

Problem B: Fire!Joe works in a maze. Unfortunately, portions of the maze have caught on fire, and the owner of the maze neglected to create a fire escape plan. Help Joe escape the maze.Given J