Problems # Name A Counting Sticks standard input/output 1 s, 256 MB x2326 B Very Beautiful Number standard input/output 1 s, 256 MB x856 C Dominoes standard input/output 2 s, 256 MB x803 D Physical Education and Buns standard input/output Problems#NameACounting Sticksstandard input/output 1 s, 256 MBx2326BVery Beautiful Numberstandard input/output 1 s, 256 MBx856CDominoesstandard input/output 2 s,...
Note In the first sample George went to bed at 00:06 . Note that you should print the time only in the format 00:06 . Thats why answers 0:06 , 00:6 and others will be considered incorrect. In the second sample, George went to bed yesterda NoteIn the first sample George went to bed at "00:06". Note that you should print the time only in the format "00:06".Thats why answers "0:06", "00:6" and others...
George decided to prepare a Codesecrof round, so he has prepared m problems for the round. Lets number the problems with integers 1 through m . George estimates the i -th problems complexity by integer b i . To make the round good , he n George decided to prepare a Codesecrof round, so he has prepared m problems for the round. Lets number the problems with integers1 through m.George estimates the ...
Input The first line has a non-empty sequence of characters describing the scales. In this sequence, an uppercase English letter indicates a weight, and the symbol | indicates the delimiter (the character occurs in the sequence exactly onc InputThe first line has a non-empty sequence of characters describing the scales. In this sequence, an uppercase English letter indicates a weight, and the symb...
Gerald has n younger brothers and their number happens to be even. One day he bought n 2 candy bags. One bag has one candy, one bag has two candies, one bag has three candies and so on. In fact, for each integer k from 1 to n 2 he has exac Gerald has n younger brothers and their number happens to be even. One day he bought n2 candybags. One bag has one candy, one bag has two candies, one bag has t...
Vasily the bear has a favorite rectangle , it has one vertex at point (0,?0) , and the opposite vertex at point ( x ,? y ) . Of course, the sides of Vasyas favorite rectangle are parallel to the coordinate axes. Vasya also loves triangles Vasily the bear has a favorite rectangle, it has one vertex at point (0,?0), and the opposite vertexat point (x,?y). Of course, the sides of Vasyas favorite rect...
比赛链接：http://codeforces.com/contest/447 A. DZY Loves Hash time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output DZY has a hash table with p buckets, numbered from 0 to p ?-?1 . He比赛链接：http://codeforces.com/contest/447A. DZY Loves Hashtime limit per test 1 secondmemory limit per test 256 megabytesinput standard inputoutput standard out...
Twilight Sparkle was playing Ludo with her friends Rainbow Dash, Apple Jack and Flutter Shy. But she kept losing. Having returned to the castle, Twilight Sparkle became interested in the dice that were used in the game. The dice has m face Twilight Sparkle was playing Ludo with her friends Rainbow Dash, Apple Jack and Flutter Shy. But she kept losing. Having returned to the castle, Twilight Sparkl...
Input The first line contains an integer n ( 1?≤? n ?≤?10 5 ) — the number of laptops. Next n lines contain two integers each, a i and b i (1?≤? a i ,? b i ?≤? n ) , where a i is the price of the i -th laptop, and b i is the number thInput The first line contains an integer n (1?≤?n?≤?105) — the number of laptops. Next n lines contain two integers each,ai andbi(1?≤?ai,?bi?≤?n),whereai is...
DZY loves chessboard, and he enjoys playing with it. He has a chessboard of n rows and m columns. Some cells of the chessboard are bad, others are good. For every good cell, DZY wants to put a chessman on it. Each chessman is either whiteDZY loves chessboard, and he enjoys playing with it. He has a chessboard of n rows and m columns. Some cells of the chessboard are bad, others are good. For ever...
Note In the first sample pair (2,?4) is not coprime and pairs (2,?3) and (3,?4) are. In the second sample you cannot form a group of three distinct integers, so the answer is -1. In the third sample it is easy to see that numbers 900000000 NoteIn the first sample pair (2,?4) is not coprime and pairs (2,?3) and (3,?4) are.In the second sample you cannot form a group of three distinct integers, so t...
DZY loves chemistry, and he enjoys mixing chemicals. DZY has n chemicals, and m pairs of them will react. He wants to pour these chemicals into a test tube, and he needs to pour them in one by one, in any order. Lets consider the danger oDZY loves chemistry, and he enjoys mixing chemicals. DZY has n chemicals, and m pairs of them will react. He wants to pour these chemicals into a test tube, and ...
Little Dima misbehaved during a math lesson a lot and the nasty teacher Mr. Pickles gave him the following problem as a punishment. Find all integer solutions x (0?? x ??10 9 ) of the equation: x ?=? b s ( x ) a ?? c ,? where a , b , c Little Dima misbehaved during a math lesson a lot and the nasty teacher Mr. Pickles gave him the following problem as a punishment.Find all integer solutions x (0?...
Note In the first sample you give the set of numbers {1,?3,?5} to the first friend and the set of numbers {2} to the second friend. Note that if you give set {1,?3,?5} to the first friend, then we cannot give any of the numbers 1 , 3 , 5 t NoteIn the first sample you give the set of numbers {1,?3,?5} to the first friend and the set of numbers {2} tothe second friend. Note that if you give set {1,?...
Toastman came up with a very easy task. He gives it to Appleman, but Appleman doesnt know how to solve it. Can you help him? Given a n ?? n checkerboard. Each cell of the board has either character x , or character o . Is it true Toastman came up with a very easy task. He gives it to Appleman, but Appleman doesnt know how to solve it. Can you help him?Given a n??n checkerboard. Each cell of the ...