Problem A A. Jzzhu and Children time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output There are n children in Jzzhus school. Jzzhu is going to give some candies to them. Lets numberProblem A A. Jzzhu and Childrentime limit per test 1 secondmemory limit per test 256 megabytesinput standard inputoutput standard output There are n children inJzzh...
Caisa solved the problem with the sugar and now he is on the way back to home. Caisa is playing a mobile game during his path. There are ( n ??1) pylons numbered from 0 to n in this game. The pylon with number 0 has zero height, the pylon Caisa solved the problem with the sugar and now he is on the way back to home.Caisa is playing a mobile game during his path. There are (n?+?1) pylons numbered f...
Problem A: A. Rewards time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Bizon the Champion is called the Champion for a reason. Bizon the Champion has recently got a present — a nProblem A:A. Rewardstime limit per test 1 secondmemory limit per test 256 megabytesinput standard inputoutput standard output Bizon the Champion is called the Ch...
Amr loves Geometry. One day he came up with a very interesting problem. Amr has a circle of radius r and center in point ( x ,? y ) . He wants the circle center to be in new position ( x ,? y ) . In one step Amr can put a pin to the bord Amr loves Geometry. One day he came up with a very interesting problem.Amr has a circle of radius r and center in point (x,?y).He wants the circle center to be in...
D. Minesweeper 1D time limit per test 2 seconds memory limit per test 512 megabytes input standard input output standard output Game Minesweeper 1D is played on a line of squares, the lines height is 1 square, the lines width is n square D. Minesweeper 1Dtime limit per test 2 secondsmemory limit per test 512 megabytesinput standard inputoutput standard outputGame "Minesweeper 1D" is played on a li...
B. Little Pony and Sort by Shift time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output One day, Twilight Sparkle is interested in how to sort a sequence of integers a 1 ,? a 2 ,?...,? B. Little Pony and Sort by Shifttime limit per test 1 secondmemory limit per test 256 megabytesinput standard inputoutput standard outputOne day, Twilight Sparkl...
D. A Lot of Games time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Andrew, Fedor and Alex are inventive guys. Now they invent the game with strings for two players. Given a group D. A Lot of Gamestime limit per test 1 secondmemory limit per test 256 megabytesinput standard inputoutput standard outputAndrew, Fedor and Alex are inventive gu...
D. Interesting Array time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Well call an array of n non-negative integers a [1],? a [2],?...,? a [ n ] interesting , if it meets m const D. Interesting Arraytime limit per test 1 secondmemory limit per test 256 megabytesinput standard inputoutput standard outputWell call an array of n non-negative...
A. Guess a number! time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output A TV show called Guess a number! is gathering popularity. The whole Berland, the old and the young, are watchin A. Guess a number!time limit per test 1 secondmemory limit per test 256 megabytesinput standard inputoutput standard outputA TV show called "Guess a number!" is...
D. Little Pony and Harmony Chest time limit per test 4 seconds memory limit per test 256 megabytes input standard input output standard output Princess Twilight went to Celestia and Lunas old castle to research the chest from the Elements D. Little Pony and Harmony Chesttime limit per test 4 secondsmemory limit per test 256 megabytesinput standard inputoutput standard outputPrincess Twilight went ...
E. Little Pony and Summer Sun Celebration time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Twilight Sparkle learnt that the evil Nightmare Moon would return during the upcoming Su E. Little Pony and Summer Sun Celebrationtime limit per test 1 secondmemory limit per test 256 megabytesinput standard inputoutput standard outputTwilight Spark...
E. Presidents Path time limit per test 4 seconds memory limit per test 256 megabytes input standard input output standard output Good old Berland has n cities and m roads. Each road connects a pair of distinct cities and is bidirectional. E. Presidents Pathtime limit per test 4 secondsmemory limit per test 256 megabytesinput standard inputoutput standard outputGood old Berland has n cities and m r...
Andrew plays a game called Civilization. Dima helps him. The game has n cities and m bidirectional roads. The cities are numbered from 1 to n . Between any pair of cities there either is a single (unique) path, or there is no path at all. Andrew plays a game called "Civilization". Dima helps him.The game has n cities and m bidirectional roads.The cities are numbered from 1 to n. Between any pair o...
Twilight Sparkle once got a crystal from the Crystal Mine. A crystal of size n ( n is odd; n ??1 ) is an n ?? n matrix with a diamond inscribed into it. You are given an odd integer n . You need to draw a crystal of size n . The diamond Twilight Sparkle once got a crystal from the Crystal Mine. A crystal of size n (n isodd; n?>?1) is an n??n matrix with a diamondinscribed into it.You are given an ...
Note In the first sample, theres only one way to pour, and the danger wont increase. In the second sample, no matter we pour the 1 st chemical first, or pour the 2 nd chemical first, the answer is always 2 . In the third sample, there ar NoteIn the first sample, theres only one way to pour, and the danger wont increase.In the second sample, no matter we pour the 1st chemical first, or pour the 2nd...