dataset stringclasses 1
value | question stringlengths 29 13k | exe_method stringclasses 1
value | solutions null | task_id int64 0 5.07k | test_time_limit int64 1 1 | example_input listlengths 0 5 | example_output listlengths 0 5 | test_input listlengths 1 10 | test_output listlengths 1 10 |
|---|---|---|---|---|---|---|---|---|---|
CodeContests | B --Doctor Course Is Recommended / D How about going forward?
Story
Since the person D decided to advance to D, he decided to take the entrance examination for the doctoral program. The written test was in mark sheet format. Since all the questions were in his area of expertise, D was able to quickly come up with a... | stdin | null | 3,692 | 1 | [
"2\n3\nD 30\nD 50\nD 20\n0\n"
] | [
"80\n"
] | [
"2\n3\nD 30\nC 50\nD 20\n0\n",
"2\n3\nD 35\nC 88\nD 20\n0\n",
"2\n3\nD 43\nD 50\nD 20\n0\n",
"2\n3\nD 30\nC 50\nD 24\n0\n",
"2\n3\nD 35\nC 88\nD 40\n0\n",
"2\n3\nD 30\nC 50\nD 26\n0\n",
"2\n3\nD 27\nC 24\nD 20\n0\n",
"2\n3\nD 12\nC 88\nD 40\n0\n",
"2\n3\nD 27\nC 24\nD 17\n0\n",
"2\n3\nD 19\nC 24\n... | [
"50\n",
"55\n",
"93\n",
"54\n",
"75\n",
"56\n",
"47\n",
"52\n",
"44\n",
"36\n"
] |
CodeContests | D --Invisible
Problem Statement
You are trying to play a card game called "Invisible" with your friends. This card game uses two types of cards, a "scoring card" and a "jamming card". A positive value is written on each score card. The rules of this card game are as follows.
* The game is played by two players, play... | stdin | null | 1,743 | 1 | [
"2 2\n100 -1\n200 300\n"
] | [
"-100\n"
] | [
"2 2\n100 -1\n200 62\n",
"2 2\n110 -1\n200 62\n",
"2 2\n111 -1\n200 62\n",
"2 2\n100 -1\n200 398\n",
"2 2\n100 -1\n200 37\n",
"2 2\n110 -1\n200 85\n",
"2 2\n111 -1\n42 62\n",
"2 1\n100 -1\n200 37\n",
"2 2\n100 -1\n200 85\n",
"2 1\n101 -1\n200 37\n"
] | [
"38\n",
"48\n",
"49\n",
"-100\n",
"63\n",
"25\n",
"69\n",
"100\n",
"15\n",
"101\n"
] |
CodeContests | Klein is trying to get her dog Jack into the Frisbee Dog Tournament. But she's not sure if Jack will get a good grade. For her, she simulates the tournament to get Jack's grade. I want you to create a program to estimate.
The tournament is held by N dogs on a two-dimensional plane. At the start of the tournament, the ... | stdin | null | 3,925 | 1 | [
"2 1\n12 5 3\n0 17 3\n0 0 2 2\n2 3\n2 0 2\n100 100 2\n0 0 -1 0\n-2 -5 0 3\n100 100 1 1\n0 0\n"
] | [
"1 0\n2 1\n"
] | [
"2 1\n12 5 1\n0 17 3\n0 0 2 2\n2 3\n2 0 2\n100 100 2\n0 0 -1 0\n-2 -5 0 3\n100 100 1 1\n0 0\n",
"2 1\n7 5 1\n0 17 3\n0 0 2 2\n2 3\n2 0 2\n110 101 2\n0 0 -1 0\n-2 -5 0 3\n100 100 1 0\n0 0\n",
"2 1\n7 5 1\n1 17 3\n0 0 2 2\n2 3\n0 0 2\n100 001 0\n0 1 -1 1\n-2 -9 0 3\n000 100 1 0\n0 0\n",
"2 1\n7 3 1\n1 17 3\n0 0... | [
"0 1\n2 1\n",
"1 0\n2 1\n",
"1 0\n3 0\n",
"0 1\n3 0\n",
"0 0\n",
"0 0 0 0\n",
"1 0\n0 0\n",
"0 1\n2 1\n",
"0 1\n2 1\n",
"0 1\n2 1\n"
] |
CodeContests | RJ Freight, a Japanese railroad company for freight operations has recently constructed exchange lines at Hazawa, Yokohama. The layout of the lines is shown in Figure B-1.
<image>
Figure B-1: Layout of the exchange lines
A freight train consists of 2 to 72 freight cars. There are 26 types of freight cars, which are d... | stdin | null | 3,166 | 1 | [
"4\naa\nabba\nabcd\nabcde\n"
] | [
"1\n6\n12\n18\n"
] | [
"4\naa\nabba\nbbcd\nabcde\n",
"4\nab\nabba\nbbcd\nedcba\n",
"4\nb`\nabba\nbcbe\nbbced\n",
"4\n`b\nabba\nbebe\nbecbd\n",
"4\n`b\naabb\nbebe\nbecbd\n",
"4\n`c\naabb\nbebe\nbecce\n",
"4\ne`\na`bb\nbbee\neddeb\n",
"4\ne`\na`ba\nbbee\neddeb\n",
"4\n_f\na`ba\nebbe\neddea\n",
"4\n_e\na`ba\nebbf\neddea\n"... | [
"1\n6\n8\n18\n",
"2\n6\n8\n18\n",
"2\n6\n8\n14\n",
"2\n6\n4\n18\n",
"2\n4\n4\n18\n",
"2\n4\n4\n13\n",
"2\n8\n4\n13\n",
"2\n12\n4\n13\n",
"2\n12\n6\n13\n",
"2\n12\n12\n13\n"
] |
CodeContests | A sequence a_1,a_2,... ,a_n is said to be /\/\/\/ when the following conditions are satisfied:
* For each i = 1,2,..., n-2, a_i = a_{i+2}.
* Exactly two different numbers appear in the sequence.
You are given a sequence v_1,v_2,...,v_n whose length is even. We would like to make this sequence /\/\/\/ by replacing s... | stdin | null | 2,959 | 1 | [
"4\n3 1 3 2\n",
"4\n1 1 1 1\n",
"6\n105 119 105 119 105 119\n"
] | [
"1\n",
"2\n",
"0\n"
] | [
"4\n3 2 3 2\n",
"6\n105 119 204 119 105 119\n",
"4\n4 1 3 2\n",
"6\n105 120 54 119 105 78\n",
"6\n105 120 54 119 190 78\n",
"6\n105 119 204 119 105 78\n",
"4\n4 1 3 0\n",
"6\n105 119 54 119 105 78\n",
"4\n4 1 3 1\n",
"4\n4 1 6 1\n"
] | [
"0\n",
"1\n",
"2\n",
"3\n",
"4\n",
"2\n",
"2\n",
"2\n",
"1\n",
"1\n"
] |
CodeContests | Mr. A is planning to travel alone on a highway bus (hereinafter referred to as "bus") during his high school holidays. First, Mr. A chose the town he wanted to visit the most and made it his destination. Next, you have to decide the route to transfer the bus from the departure point to the destination. When connecting,... | stdin | null | 4,275 | 1 | [
"1 3 3 1 3\n1 3 2000\n1 2 1000\n2 3 1000\n2 3 3 1 3\n1 3 2300\n1 2 1000\n2 3 1200\n2 6 6 5 1\n1 2 1500\n1 3 4500\n2 6 2000\n5 4 1000\n6 4 2200\n3 5 3000\n0 0 0 0 0\n"
] | [
"1000\n1100\n3750\n"
] | [
"1 3 3 1 3\n1 3 2000\n1 2 1000\n2 3 1001\n2 3 3 1 3\n1 3 2300\n1 2 1000\n2 3 1200\n2 6 6 5 1\n1 2 1500\n1 3 4500\n2 6 2000\n5 4 1000\n6 4 2200\n3 5 3000\n0 0 0 0 0\n",
"1 3 3 1 3\n1 3 2000\n1 2 1000\n2 3 1000\n2 3 3 1 3\n1 3 2300\n1 2 1000\n2 3 1200\n2 6 6 5 1\n1 2 26\n1 3 4500\n2 6 2000\n5 4 1000\n6 4 2200\n3 5 ... | [
"1000\n1100\n3750\n",
"1000\n1100\n3126\n",
"1000\n600\n3126\n",
"500\n1100\n3750\n",
"1000\n1100\n3100\n",
"1000\n600\n3750\n",
"1000\n1100\n5250\n",
"500\n500\n3750\n",
"1000\n1100\n4600\n",
"1000\n600\n3100\n"
] |
CodeContests | The Chef has prepared the appetizers in the shapes of letters to spell a special message for the guests. There are n appetizers numbered from 0 to n-1 such that if the appetizers are arrayed in this order, they will display the message. The Chef plans to display them in this order on a table that can be viewed by all g... | stdin | null | 3,296 | 1 | [
"2\n2 chef\n4 enjoyourapplepie\n"
] | [
"cehf\neayejpuinpopolre\n"
] | [
"2\n2 chef\n4 eipelpparuoyojne\n",
"2\n2 chef\n4 enjoyourappmepie\n",
"2\n2 cief\n4 enjoyourappmepie\n",
"2\n2 cgef\n4 enjoyourapplepie\n",
"2\n2 chef\n4 eipempparuoyojne\n",
"2\n2 cief\n4 enjoyourpapmepie\n",
"2\n2 cgef\n4 enjoyourapqlepie\n",
"2\n2 cief\n4 enjoyourpaqmepie\n",
"2\n2 cgef\n4 eipelq... | [
"cehf\nerlopopniupjeyae\n",
"cehf\neayejpuinpopomre\n",
"ceif\neayejpuinpopomre\n",
"cegf\neayejpuinpopolre\n",
"cehf\nermopopniupjeyae\n",
"ceif\nepyejpuinaopomre\n",
"cegf\neayejquinpopolre\n",
"ceif\nepyejquinaopomre\n",
"cegf\nerlopopniuqjeyae\n",
"cegf\nerlopopniuqjexae\n"
] |
CodeContests | Let \mathrm{popcount}(n) be the number of `1`s in the binary representation of n. For example, \mathrm{popcount}(3) = 2, \mathrm{popcount}(7) = 3, and \mathrm{popcount}(0) = 0.
Let f(n) be the number of times the following operation will be done when we repeat it until n becomes 0: "replace n with the remainder when n... | stdin | null | 607 | 1 | [
"23\n00110111001011011001110\n",
"3\n011\n"
] | [
"2\n1\n2\n2\n1\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n1\n3\n",
"2\n1\n1\n"
] | [
"23\n00110111001011011001111\n",
"3\n111\n",
"23\n00110111001011011101111\n",
"3\n110\n",
"23\n00110111001011011101101\n",
"3\n101\n",
"23\n00110111001011011001101\n",
"3\n100\n",
"23\n01110111001011011101101\n",
"3\n001\n"
] | [
"3\n3\n2\n2\n3\n3\n2\n3\n3\n3\n2\n2\n3\n2\n2\n2\n2\n3\n2\n3\n3\n3\n2\n",
"2\n2\n1\n",
"4\n4\n3\n3\n4\n3\n3\n3\n4\n4\n3\n4\n3\n3\n4\n3\n3\n3\n4\n3\n3\n3\n2\n",
"1\n1\n2\n",
"3\n3\n2\n2\n3\n3\n2\n3\n3\n3\n3\n2\n3\n2\n2\n2\n3\n3\n2\n3\n1\n3\n3\n",
"1\n2\n1\n",
"3\n3\n3\n3\n3\n3\n3\n3\n3\n3\n3\n3\n3\n3\n3\n... |
CodeContests | You have a pot and N ingredients. Each ingredient has a real number parameter called value, and the value of the i-th ingredient (1 \leq i \leq N) is v_i.
When you put two ingredients in the pot, they will vanish and result in the formation of a new ingredient. The value of the new ingredient will be (x + y) / 2 where... | stdin | null | 331 | 1 | [
"2\n3 4\n",
"3\n500 300 200\n",
"5\n138 138 138 138 138\n"
] | [
"3.5\n",
"375\n",
"138\n"
] | [
"2\n1 4\n",
"3\n500 300 210\n",
"5\n138 138 232 138 138\n",
"2\n1 2\n",
"3\n500 105 210\n",
"5\n138 138 232 218 138\n",
"2\n2 4\n",
"3\n500 4 210\n",
"5\n37 138 232 218 138\n",
"3\n500 4 409\n"
] | [
"2.5000000000\n",
"377.5000000000\n",
"185.0000000000\n",
"1.5000000000\n",
"328.7500000000\n",
"205.0000000000\n",
"3.0000000000\n",
"303.5000000000\n",
"198.6875000000\n",
"353.2500000000\n"
] |
CodeContests | Input Format
N K
a_1 a_2 a_3 ... a_N
Output Format
Print the minimum cost in one line. In the end put a line break.
Constraints
* 1 ≤ K ≤ N ≤ 15
* 1 ≤ a_i ≤ 10^9
Scoring
Subtask 1 [120 points]
* N = K
Subtask 2 [90 points]
* N ≤ 5
* a_i ≤ 7
Subtask 3 [140 points]
* There are no additional constraint... | stdin | null | 2,053 | 1 | [
"5 5\n3949 3774 3598 3469 3424\n"
] | [
"1541\n"
] | [
"5 5\n5960 3774 3598 3469 3424\n",
"5 5\n3949 3774 4045 3469 3424\n",
"5 5\n5960 3774 3598 2384 3424\n",
"5 5\n5960 3774 3598 610 3424\n",
"5 5\n5960 3170 3598 610 3424\n",
"5 1\n5960 3170 3598 610 3424\n",
"5 5\n3949 359 3598 3469 3424\n",
"5 5\n5960 3774 3598 4173 3424\n",
"5 5\n3949 3208 4045 346... | [
"9585\n",
"1376\n",
"10670\n",
"12444\n",
"13048\n",
"0\n",
"4956\n",
"8881\n",
"1942\n",
"10026\n"
] |
CodeContests | There is a tree with N vertices. The vertices are numbered 1 through N. For each 1 ≤ i ≤ N - 1, the i-th edge connects vertices a_i and b_i. The lengths of all the edges are 1.
Snuke likes some of the vertices. The information on his favorite vertices are given to you as a string s of length N. For each 1 ≤ i ≤ N, s_i... | stdin | null | 498 | 1 | [
"4\n1 2\n1 3\n1 4\n1100\n",
"5\n1 2\n1 3\n1 4\n4 5\n11111\n",
"6\n1 2\n1 3\n1 4\n2 5\n2 6\n100011\n"
] | [
"4\n",
"11\n",
"8\n"
] | [
"4\n1 2\n2 3\n1 4\n1100\n",
"6\n1 2\n1 3\n1 4\n2 5\n2 6\n101011\n",
"4\n2 2\n2 3\n1 4\n1100\n",
"4\n2 4\n2 3\n1 4\n1100\n",
"4\n2 4\n2 3\n2 4\n1100\n",
"4\n1 2\n1 3\n1 3\n1100\n",
"5\n1 2\n1 3\n1 4\n3 5\n11111\n",
"4\n1 2\n1 3\n1 3\n0100\n",
"5\n1 2\n1 3\n1 4\n5 5\n11111\n",
"5\n2 2\n1 3\n1 4\n4 5... | [
"5\n",
"10\n",
"2\n",
"6\n",
"1\n",
"4\n",
"11\n",
"3\n",
"8\n",
"9\n"
] |
CodeContests | In 2028 and after a continuous growth, AtCoder Inc. finally built an empire with six cities (City 1, 2, 3, 4, 5, 6)!
There are five means of transport in this empire:
* Train: travels from City 1 to 2 in one minute. A train can occupy at most A people.
* Bus: travels from City 2 to 3 in one minute. A bus can occupy a... | stdin | null | 3,513 | 1 | [
"5\n3\n2\n4\n3\n5\n",
"10\n123\n123\n123\n123\n123\n",
"10000000007\n2\n3\n5\n7\n11\n"
] | [
"7\n",
"5\n",
"5000000008\n"
] | [
"5\n3\n2\n4\n3\n6\n",
"10\n123\n219\n123\n123\n123\n",
"10000000007\n2\n3\n5\n3\n11\n",
"10000000007\n2\n3\n1\n3\n11\n",
"10\n123\n633\n27\n9\n123\n",
"5\n3\n2\n4\n1\n6\n",
"10\n31\n457\n1\n123\n48\n",
"10\n110\n1017\n3\n9\n29\n",
"10000000007\n4\n3\n9\n14\n3\n",
"10\n123\n219\n27\n123\n123\n"
] | [
"7\n",
"5\n",
"5000000008\n",
"10000000011\n",
"6\n",
"9\n",
"14\n",
"8\n",
"3333333340\n",
"5\n"
] |
CodeContests | We have a sequence of N integers: x=(x_0,x_1,\cdots,x_{N-1}). Initially, x_i=0 for each i (0 \leq i \leq N-1).
Snuke will perform the following operation exactly M times:
* Choose two distinct indices i, j (0 \leq i,j \leq N-1,\ i \neq j). Then, replace x_i with x_i+2 and x_j with x_j+1.
Find the number of differe... | stdin | null | 1,484 | 1 | [
"3 2\n",
"100000 50000\n",
"10 10\n",
"2 2\n"
] | [
"19\n",
"3463133\n",
"211428932\n",
"3\n"
] | [
"100001 50000\n",
"5 10\n",
"0 2\n",
"100001 27098\n",
"5 7\n",
"101001 27098\n",
"6 7\n",
"101000 27098\n",
"3 7\n",
"101000 9586\n"
] | [
"546347865\n",
"42801\n",
"0\n",
"949668337\n",
"11600\n",
"74153970\n",
"63008\n",
"277745716\n",
"169\n",
"163578301\n"
] |
CodeContests | Gwen is good in hacking. She helps Ben and Kevin in many missions. This time the boys need CCTV recordings of a particular area. The security network is secured by a special keyless encryption. When she tries to access the tapes remotely, she sees a series of non-negative integers on screen. By stealing security logs a... | stdin | null | 3,263 | 1 | [
"2\n3\n2 3 7\n4\n3 9 5 1\n\nSAMPLE\n"
] | [
"-1\n1\n"
] | [
"2\n3\n31 7 7\n34\n1 0 0 1 0 1 0 1 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 1 0 1 0 1 1 0 0 0 1\n",
"2\n3\n2 3 7\n4\n3 9 5 1\n\nSAMPME\n",
"2\n3\n31 7 11\n34\n1 0 0 1 0 1 0 1 0 0 0 0 0 1 0 1 0 0 0 1 0 0 0 0 1 0 1 0 1 1 0 0 0 1\n",
"2\n3\n2 3 7\n4\n3 9 4 1\n\nSAMPLE\n",
"2\n3\n2 3 2\n4\n3 7 5 1\n\nSAMPME\n",
"2\n3\... | [
"7\n0\n",
"-1\n1\n",
"-1\n0\n",
"-1\n-1\n",
"2\n1\n",
"0\n0\n",
"2\n-1\n",
"2\n0\n",
"1\n0\n",
"12\n0\n"
] |
CodeContests | In sliding block puzzles, we repeatedly slide pieces (blocks) to open spaces within a frame to establish a goal placement of pieces.
A puzzle creator has designed a new puzzle by combining the ideas of sliding block puzzles and mazes. The puzzle is played in a rectangular frame segmented into unit squares. Some square... | stdin | null | 4,634 | 1 | [
"3 3\noo.\noXX\n.XX\n3 3\nXXo\nXX.\no.o\n3 5\n.o*XX\noooXX\noooo.\n7 12\noooooooooooo\nooooo*****oo\noooooo****oo\no**ooo***ooo\no***ooooo..o\no**ooooooXXo\nooooo****XXo\n5 30\noooooooooooooooooooooooooooooo\noooooooooooooooooooooooooooooo\no***************************oo\nXX.ooooooooooooooooooooooooooo\nXX.oooooooo... | [
"11\n0\n-1\n382\n6807\n"
] | [
"3 3\noo.\noXX\n.XX\n3 3\nXXp\nXX.\no.o\n3 5\n.o*XX\noooXX\noooo.\n7 12\noooooooooooo\nooooo*****oo\noooooo****oo\no**ooo***ooo\no***ooooo..o\no**ooooooXXo\nooooo****XXo\n5 30\noooooooooooooooooooooooooooooo\noooooooooooooooooooooooooooooo\no***************************oo\nXX.ooooooooooooooooooooooooooo\nXX.oooooooo... | [
"11\n0\n-1\n382\n6807\n",
"9\n0\n-1\n382\n6807\n",
"11\n0\n-1\n382\n5799\n",
"11\n0\n-1\n-1\n6807\n",
"11\n0\n-1\n382\n3303\n",
"11\n0\n-1\n354\n6807\n",
"11\n0\n-1\n382\n4215\n",
"9\n0\n32\n382\n6807\n",
"9\n0\n-1\n-1\n6807\n",
"11\n0\n-1\n402\n6807\n"
] |
CodeContests | Mr. Kobou found a bundle of old paper when he was cleaning his family home. On each paper, two series of numbers are written. Strange as it appeared to him, Mr. Kobou further went through the storehouse and found out a note his ancestor left. According to it, the bundle of paper is a treasure map, in which the two sequ... | stdin | null | 3,522 | 1 | [
"5 5\n3 2 3 0 0\n4 2 0 0 2\n",
"5 4\n0 2 2 1 1\n1 1 1 3\n"
] | [
"0\n",
"1\n"
] | [
"5 3\n3 2 3 0 0\n4 2 0 0 2\n",
"4 4\n0 1 1 1 1\n1 0 1 4\n",
"5 3\n3 2 5 0 0\n4 2 0 0 2\n",
"4 3\n3 2 5 0 0\n4 2 0 0 2\n",
"4 3\n3 2 5 0 0\n4 2 0 0 4\n",
"4 3\n3 2 6 0 0\n4 2 0 0 4\n",
"4 3\n3 1 6 0 0\n4 2 0 0 4\n",
"5 5\n3 2 3 0 0\n4 2 0 -1 2\n",
"5 4\n0 2 2 0 1\n1 1 1 3\n",
"5 3\n3 2 3 0 0\n4 2 0... | [
"0\n",
"1\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n"
] |
CodeContests | Proof of knowledge
The entrance door of the apartment you live in has a password-type lock. This password consists of exactly four digits, ranging from 0 to 9, and you always use the password P given to you by the apartment manager to unlock this door.
One day, you wondered if all the residents of the apartment were ... | stdin | null | 4,915 | 1 | [
"[+c[+a[^bd]]]\n0404\n[*b[*[*cd]a]]\n7777\n[^[^ab][^cd]]\n1295\na\n9876\n[^dd]\n9090\n.\n"
] | [
"0 10\n7 1\n15 544\n9 1000\n0 10000\n"
] | [
"[+c[+a[^bd]]]\n0404\n[*b[*[*cd]a]]\n7777\n[^[^ab][^cd]]\n2570\na\n9876\n[^dd]\n9090\n.\n",
"[+c[*a[^bd]]]\n0404\n[*b[*[*cd]a]]\n7777\n[^[^ab][^cd]]\n2570\na\n9876\n[^dd]\n9090\n.\n",
"[+c[^a[+bd]]]\n0404\n[*b[*[*cd]a]]\n7777\n[^[^ab][^cd]]\n1295\na\n9876\n[^dd]\n9090\n.\n",
"[+c[+a[^bd]]]\n0404\n[*b[*[*cd]a]... | [
"0 10\n7 1\n0 712\n9 1000\n0 10000\n",
"0 450\n7 1\n0 712\n9 1000\n0 10000\n",
"4 220\n7 1\n15 544\n9 1000\n0 10000\n",
"0 10\n7 1\n0 712\n1 1000\n0 10000\n",
"0 10\n0 8895\n15 544\n9 1000\n0 10000\n",
"0 10\n0 8895\n0 712\n9 1000\n0 10000\n",
"0 10\n0 8895\n0 712\n8 1000\n0 10000\n",
"0 10\n7 1\n15 5... |
CodeContests | Given a square matrix of size N×NN×N, calculate the absolute difference between the sums of its diagonals.
Input Format
The first line contains a single integer, NN. The next NN lines denote the matrix's rows, with each line containing NN space-separated integers describing the columns.
Output Format
Print the abso... | stdin | null | 4,690 | 1 | [
"3\n11 2 4\n4 5 6\n10 8 -12\n\nSAMPLE\n"
] | [
"15\n"
] | [
"5\n-10 3 0 5 -4\n2 -1 0 2 -8\n9 -2 -5 6 0\n9 -7 4 8 -2\n3 8 8 -5 0\n",
"3\n11 2 4\n4 5 6\n5 8 -12\n\nSAMPLE\n",
"5\n-10 3 0 5 -4\n2 0 0 2 -8\n9 -2 -5 6 0\n9 -7 4 8 -2\n3 8 8 -5 0\n",
"3\n11 2 6\n4 1 6\n5 8 -12\n\nSAMPLE\n",
"5\n-10 6 0 5 -4\n2 0 0 2 -8\n9 -2 -5 6 0\n9 -7 3 8 -2\n5 8 8 -5 0\n",
"3\n1 4 6\... | [
"3\n",
"10\n",
"4\n",
"12\n",
"2\n",
"22\n",
"1\n",
"29\n",
"0\n",
"33\n"
] |
CodeContests | A modified KP number is a positive whole number n with d digits, such that when we split its square into two pieces - a right hand piece r with d digits and a left hand piece l that contains the remaining d or d−1 digits, the sum of the pieces is equal to the original number (i.e. l + r = n).
Note: r may have leading ... | stdin | null | 1,119 | 1 | [
"1\n100\n\nSAMPLE\n"
] | [
"1 9 45 55 99\n"
] | [
"100\n88\n",
"1\n110\n\nSAMPLE\n",
"100\n337\n",
"100\n773\n",
"100\n1067\n",
"100\n2391\n",
"100\n128\n",
"100\n85\n",
"100\n81\n",
"100\n40\n"
] | [
"INVALID RANGE\n",
"1 9 45 55 99\n",
"297\n",
"297 703\n",
"297 703 999\n",
"297 703 999 2223\n",
"INVALID RANGE\n",
"INVALID RANGE\n",
"INVALID RANGE\n",
"INVALID RANGE\n"
] |
CodeContests | Problem
On a company's network, there are $ n $ computers and $ m $ communication cables that connect them. Computers are distinguished by identifiers from $ 0 $ to $ n -1 $, and communication cables also have identifiers from $ 0 $ to $ m -1 $.
Any two different computers currently in the company can communicate wit... | stdin | null | 711 | 1 | [
"4 5\n0 2 22 13\n0 3 15 25\n1 2 3 3\n1 3 28 5\n2 3 5 22\n",
"2 1\n0 1 1 1\n",
"5 6\n0 1 22 33\n0 2 43 11\n0 3 92 10\n1 3 50 12\n2 3 88 2\n3 4 58 89\n"
] | [
"0.36000\n",
"0\n",
"0.06667\n"
] | [
"4 5\n0 2 22 13\n0 3 15 25\n1 2 0 3\n1 3 28 5\n2 3 5 22\n",
"2 1\n0 1 0 1\n",
"5 6\n0 1 22 33\n0 2 43 11\n0 3 86 10\n1 3 50 12\n2 3 88 2\n3 4 58 89\n",
"4 5\n0 3 22 13\n0 3 15 25\n1 2 0 3\n1 3 18 5\n2 3 5 22\n",
"4 5\n0 3 22 13\n0 3 15 25\n1 2 0 3\n1 3 1 5\n2 3 5 22\n",
"5 6\n0 1 22 33\n0 2 43 11\n0 3 92 ... | [
"0.3600000000\n",
"0\n",
"0.0689655172\n",
"0.4500000000\n",
"0.7272727273\n",
"0.0507246377\n",
"0.6363636364\n",
"0.3200000000\n",
"0.5925925926\n",
"0.9545454545\n"
] |
CodeContests | One day Viru and Gauty after playing cricket decided to play an indoor game. In this Viru will give a string of even length to Gauty. The each character of string will be either ‘a’ ,’b’ or ‘/’. Gauty’s task is to replace each ‘/’ such that final string becomes palindrome.
Here twist is that Viru will also give him t... | stdin | null | 3,626 | 1 | [
"3\naba/bab/\n4\n6\naaaabbbb\n8\n5\na/ba//abaa\n5\n9\n\nSAMPLE\n"
] | [
"10\n-1\n15\n"
] | [
"17\nbbaa/a//aa/a/b/a/a/b////aab//aabbbba/a/bbbaa/bbb/baa//abaaab/baa//aba/ba/ba/ababa//bbaabaa/a///////b//aaa//bb/aa/bb/aab//aab///bbbbba//baa/bb//a//a/babb/b///b/b/abbaba//b//b/aaa/a///bab/bab//bbaaa/aabab/b/b///////b/a/abba/bb//a//abaabb/bab/bb/a///b/ab/ab//aba//baab/ba/baaab//b/abbabb/babaabb/bba//abaab/bba/abb... | [
"-1\n-1\n45494\n-1\n-1\n51680\n-1\n107178\n-1\n5764\n190110\n27329\n78961\n118682\n16828\n4651\n-1\n",
"10\n-1\n15\n",
"10\n-1\n11\n",
"-1\n-1\n45494\n-1\n-1\n51680\n-1\n107178\n-1\n5764\n91767\n27329\n78961\n118682\n16828\n4651\n-1\n",
"12\n-1\n11\n",
"-1\n-1\n45494\n-1\n-1\n51680\n-1\n107178\n-1\n5764\n... |
CodeContests | Problem
Today, the high-class restaurant "Maizu Restaurant", which is completely invited, has finally opened. Only members of this restaurant have the right to invite new members, initially only the owner of the restaurant with membership number 0.
Due to its luxury, the Maze Restaurant is only open for $ N $ days fr... | stdin | null | 1,187 | 1 | [
"3\n0\n0\n2\n",
"5\n0\n1\n2\n3\n4\n"
] | [
"1\n1\n2\n",
"1\n1\n2\n2\n3\n"
] | [
"5\n0\n1\n0\n3\n4\n",
"3\n0\n1\n2\n",
"5\n0\n1\n1\n3\n4\n",
"3\n0\n1\n1\n",
"5\n0\n0\n0\n0\n4\n",
"5\n0\n0\n1\n3\n0\n",
"5\n0\n1\n1\n1\n1\n",
"5\n0\n1\n1\n0\n2\n",
"5\n0\n0\n1\n3\n4\n",
"5\n0\n0\n2\n3\n4\n"
] | [
"1\n1\n2\n2\n3\n",
"1\n1\n2\n",
"1\n1\n1\n2\n2\n",
"1\n1\n1\n",
"1\n1\n1\n1\n2\n",
"1\n1\n2\n2\n2\n",
"1\n1\n1\n1\n1\n",
"1\n1\n1\n2\n3\n",
"1\n1\n2\n2\n3\n",
"1\n1\n2\n2\n3\n"
] |
CodeContests | Takahashi has come to a party as a special guest. There are N ordinary guests at the party. The i-th ordinary guest has a power of A_i.
Takahashi has decided to perform M handshakes to increase the happiness of the party (let the current happiness be 0). A handshake will be performed as follows:
* Takahashi chooses o... | stdin | null | 2,203 | 1 | [
"5 3\n10 14 19 34 33\n",
"9 14\n1 3 5 110 24 21 34 5 3\n",
"9 73\n67597 52981 5828 66249 75177 64141 40773 79105 16076\n"
] | [
"202\n",
"1837\n",
"8128170\n"
] | [
"5 3\n10 4 19 34 33\n",
"9 14\n1 3 5 110 24 21 34 2 3\n",
"9 73\n67597 52981 5828 18 75177 64141 40773 79105 16076\n",
"5 1\n10 4 19 34 33\n",
"9 14\n1 3 5 111 24 21 34 2 3\n",
"9 73\n67597 52981 5828 18 116472 64141 40773 79105 16076\n",
"9 14\n1 3 3 111 24 21 34 2 3\n",
"9 14\n3 3 3 111 24 21 34 2 3... | [
"202\n",
"1832\n",
"7131148\n",
"68\n",
"1847\n",
"7874458\n",
"1843\n",
"1844\n",
"1848\n",
"9270936\n"
] |
CodeContests | Given a binary tree in a two dimensional plane which has both side covered by mirrors.
As this is a 2D dimensional image, we define our print function to print only those nodes whose reflection is showing
on one of the mirrors, first we print the value of the nodes with reflections appearing on the right mirror and th... | stdin | null | 4,654 | 1 | [] | [] | [
"20\n511\n4 114 122 119 120 102 114 70 73 83 66 47 53 48 45 77 90 33 34 93 77 15 21 97 103 58 59 33 51 34 37 113 134 94 77 112 128 76 84 98 122 40 33 42 43 43 47 0 0 108 121 42 49 68 95 106 124 87 103 15 38 0 0 33 69 88 81 33 41 55 50 63 62 19 24 30 30 58 57 88 112 94 109 50 72 45 29 87 111 55 44 101 124 82 69 0 0 ... | [
"4\n122\n114\n45\n37\n38\n31\n59\n8\n114\n119\n70\n77\n113\n33\n65\n113\n\n3\n84\n42\n15\n107\n32\n82\n44\n66\n87\n29\n47\n66\n28\n112\n42\n34\n\n2\n97\n84\n77\n55\n83\n41\n62\n90\n108\n102\n77\n47\n54\n58\n57\n61\n\n4\n121\n34\n82\n55\n69\n31\n126\n111\n92\n79\n53\n75\n22\n17\n103\n67\n\n2\n103\n74\n76\n26\n113\n8... |
CodeContests | For an integer n not less than 0, let us define f(n) as follows:
* f(n) = 1 (if n < 2)
* f(n) = n f(n-2) (if n \geq 2)
Given is an integer N. Find the number of trailing zeros in the decimal notation of f(N).
Constraints
* 0 \leq N \leq 10^{18}
Input
Input is given from Standard Input in the following format:
... | stdin | null | 1,605 | 1 | [
"1000000000000000000\n",
"5\n",
"12\n"
] | [
"124999999999999995\n",
"0\n",
"1\n"
] | [
"1000000000010000000\n",
"7\n",
"10\n",
"1000000000010001000\n",
"1010000000010001000\n",
"24\n",
"1010100000010001000\n",
"1010100000011001000\n",
"1010100000011101000\n",
"30\n"
] | [
"125000000001249993\n",
"0\n",
"1\n",
"125000000001250117\n",
"126250000001250117\n",
"2\n",
"126262500001250116\n",
"126262500001375116\n",
"126262500001387616\n",
"3\n"
] |
CodeContests | You are given two integers A and B.
Print a grid where each square is painted white or black that satisfies the following conditions, in the format specified in Output section:
* Let the size of the grid be h \times w (h vertical, w horizontal). Both h and w are at most 100.
* The set of the squares painted white is ... | stdin | null | 2,365 | 1 | [
"3 14\n",
"1 1\n",
"2 3\n",
"7 8\n"
] | [
"8 18\n..................\n..................\n....##.......####.\n....#.#.....#.....\n...#...#....#.....\n..#.###.#...#.....\n.#.......#..#.....\n.........#..####.\n",
"4 2\n..\n.\n",
"3 3\n##.\n..#\n#.#\n",
"3 5\n.#.#\n.#.#.\n.#.#\n"
] | [
"0 14\n",
"1 2\n",
"0 3\n",
"12 8\n",
"1 4\n",
"0 1\n",
"19 8\n",
"1 7\n",
"19 12\n",
"1 13\n"
] | [
"100 100\n####################################################################################################\n####################################################################################################\n####################################################################################################\n... |
CodeContests | There are N Reversi pieces arranged in a row. (A Reversi piece is a disc with a black side and a white side.) The state of each piece is represented by a string S of length N. If S_i=`B`, the i-th piece from the left is showing black; If S_i=`W`, the i-th piece from the left is showing white.
Consider performing the f... | stdin | null | 3,434 | 1 | [
"BWBWBW\n",
"BBW\n"
] | [
"6\n",
"2\n"
] | [
"WBWBWB\n",
"BBX\n",
"WBWBVB\n",
"BXB\n",
"WBWBUB\n",
"BYB\n",
"WBWBUC\n",
"CYB\n",
"WBWBTC\n",
"CYA\n"
] | [
"3\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"0\n"
] |
CodeContests | There is a grid of squares with H+1 horizontal rows and W vertical columns.
You will start at one of the squares in the top row and repeat moving one square right or down. However, for each integer i from 1 through H, you cannot move down from the A_i-th, (A_i + 1)-th, \ldots, B_i-th squares from the left in the i-th ... | stdin | null | 568 | 1 | [
"4 4\n2 4\n1 1\n2 3\n2 4\n"
] | [
"1\n3\n6\n-1\n"
] | [
"4 7\n2 4\n1 1\n2 3\n2 4\n",
"4 4\n2 4\n1 1\n2 0\n2 4\n",
"4 4\n3 4\n1 1\n2 3\n2 4\n",
"4 4\n2 4\n1 1\n2 0\n3 4\n",
"4 4\n1 4\n1 1\n2 0\n3 4\n",
"4 5\n0 4\n0 1\n4 5\n3 4\n",
"4 7\n2 4\n0 1\n2 3\n5 7\n",
"4 7\n1 3\n0 1\n4 1\n3 7\n",
"4 7\n2 4\n0 1\n2 3\n2 4\n",
"4 7\n2 4\n0 1\n4 3\n2 4\n"
] | [
"1\n2\n3\n4\n",
"1\n3\n4\n-1\n",
"1\n2\n5\n-1\n",
"1\n3\n4\n5\n",
"-1\n-1\n-1\n-1\n",
"1\n2\n-1\n-1\n",
"1\n2\n3\n7\n",
"1\n2\n3\n-1\n",
"1\n2\n3\n4\n",
"1\n2\n3\n4\n"
] |
CodeContests | As we all know, Chef is cooking string for long days, his new discovery on string is the longest common pattern length. The longest common pattern length between two strings is the maximum number of characters that both strings have in common. Characters are case sensitive, that is, lower case and upper case characters... | stdin | null | 870 | 1 | [
"4\nabcd\nxyz\nabcd\nbcda\naabc\nacaa\nCodechef\nelfedcc\n"
] | [
"0\n4\n3\n5\n"
] | [
"4\nabcd\nxyz\nabcd\nbcda\nacba\nacaa\nCodechef\nelfedcc\n",
"4\nbdca\nxyz\nabcd\nbcda\nabca\nacaa\nCodechff\nelfedcc\n",
"4\nbdca\nyyz\nabdd\nbcda\nabca\nacaa\nCodechff\nelfedcc\n",
"4\nabcd\nxyz\nabcd\nbcda\nacba\nacba\nCodechef\nelfedcc\n",
"4\nbdca\nxyz\nabcd\nbcea\nabca\nacaa\nCodechef\nelfedcc\n",
"... | [
"0\n4\n3\n5\n",
"0\n4\n3\n4\n",
"0\n3\n3\n4\n",
"0\n4\n4\n5\n",
"0\n3\n3\n5\n",
"0\n4\n3\n3\n",
"0\n4\n2\n3\n",
"0\n3\n2\n4\n",
"0\n4\n2\n5\n",
"0\n3\n3\n3\n"
] |
CodeContests | Anurag is posed with a very serious problem. He will be in London during the summers from days [ a,b ] for an internship. But he also wants to attend the ACM-ICPC World Finals with his team to be held in Thailand during [ c,d ] days. The opening ceremony for the World Finals will be held on c day. He found out that it ... | stdin | null | 760 | 1 | [
"2\n1 14 15 20 2\n13 14 15 20 3\n\nSAMPLE\n"
] | [
"13\nSTAY IN LONDON\n"
] | [
"2\n1 14 15 20 2\n13 14 29 20 3\n\nSAMPLE\n",
"2\n1 14 15 20 2\n13 27 29 20 3\n\nSAMPLE\n",
"2\n1 14 15 20 2\n13 49 1 20 3\n\nSAMPLE\n",
"2\n1 25 24 20 2\n13 49 1 34 3\n\nSAMPLE\n",
"2\n1 6 24 20 2\n26 30 2 34 1\n\nSAMPLE\n",
"2\n-1 1 27 42 1\n24 17 3 35 0\n\nSAMPLE\n",
"2\n1 25 24 20 0\n13 49 1 34 3\n\... | [
"13\n14\n",
"13\n26\n",
"13\nSTAY IN LONDON\n",
"22\nSTAY IN LONDON\n",
"6\nSTAY IN LONDON\n",
"1\nSTAY IN LONDON\n",
"24\nSTAY IN LONDON\n",
"9\nSTAY IN LONDON\n",
"2\nSTAY IN LONDON\n",
"5\nSTAY IN LONDON\n"
] |
CodeContests | CODE FESTIVAL 2016 is going to be held. For the occasion, Mr. Takahashi decided to make a signboard.
He intended to write `CODEFESTIVAL2016` on it, but he mistakenly wrote a different string S. Fortunately, the string he wrote was the correct length.
So Mr. Takahashi decided to perform an operation that replaces a ce... | stdin | null | 4,038 | 1 | [
"C0DEFESTIVAL2O16\n",
"FESTIVAL2016CODE\n"
] | [
"2\n",
"16\n"
] | [
"C0DEFESTIVAL2O61\n",
"EDOC6102LAVITSEF\n",
"C0DEFERTIVAL2O61\n",
"C0DEGERTIVAL2O61\n",
"CTDEGER0IVAL2O61\n",
"CT/EGERDIVAL2O61\n",
"CT0EGERDIVAK2O61\n",
"1DO2LAVI6REGE0TC\n",
"VT0EGER6ICAL2OD0\n",
"VV1EFFR7ICAK2OD0\n"
] | [
"4\n",
"16\n",
"5\n",
"6\n",
"7\n",
"8\n",
"9\n",
"15\n",
"10\n",
"11\n"
] |
CodeContests | Today, you have been given the task of handling the entire Taxi Network of Berland City. Berland city has a huge number of taxi travellers, and you need to help them in transportation in the most efficient manner.
To be precise, this city consists of N users who want to travel via a Taxi today. You have a total of M ... | stdin | null | 3,267 | 1 | [
"5 5\n1 100\n2 100\n3 100\n4 100\n5 100\n\nSAMPLE\n"
] | [
"1 2 3 4 5\n"
] | [
"1000 100\n1 10000\n2 10000\n3 10000\n4 10000\n5 10000\n6 10000\n7 10000\n8 10000\n9 10000\n10 10000\n11 10000\n12 10000\n13 10000\n14 10000\n15 10000\n16 10000\n17 10000\n18 10000\n19 10000\n20 10000\n21 10000\n22 10000\n23 10000\n24 10000\n25 10000\n26 10000\n27 10000\n28 10000\n29 10000\n30 10000\n31 10000\n32 1... | [
"1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 -1 -1 -1 -1 -1 -1 -1 -1... |
CodeContests | Little chandu is very fond of playing games. Recently, He found a few straws each of length 1 inches in the store room. He took all of them and decided to mark a rectangular area on the floor with straws and warn rest of the family members to not to enter that area so that he can play in peace. He wants to maximize tha... | stdin | null | 4,999 | 1 | [
"3\n6\n9\n11\n\nSAMPLE\n"
] | [
"2\n4\n6\n"
] | [
"100\n1207244\n255313\n56\n83269\n638451\n347617\n29369\n233941\n61\n7937\n85\n6\n80\n2485\n7\n6394\n92\n52190\n278\n14467\n9\n7\n2018983\n2607\n916\n18515\n3600328\n1\n1\n11995\n743468\n3403\n507\n149\n36\n38208\n47423\n974\n81\n494913\n192\n85\n9\n8492427\n655\n9912940\n40843\n4716\n46470\n435483\n26548\n8\n9762\... | [
"91089879721\n4074013584\n196\n433347489\n25476150156\n7552305216\n53904964\n3420495225\n225\n3936256\n441\n2\n400\n385641\n2\n2555202\n529\n170237256\n4830\n13079072\n4\n2\n254768019770\n424452\n52441\n21423012\n810147606724\n0\n0\n8991002\n34546541689\n723350\n16002\n1369\n81\n91240704\n140552880\n59292\n400\n153... |
CodeContests | Let us define the FizzBuzz sequence a_1,a_2,... as follows:
* If both 3 and 5 divides i, a_i=\mbox{FizzBuzz}.
* If the above does not hold but 3 divides i, a_i=\mbox{Fizz}.
* If none of the above holds but 5 divides i, a_i=\mbox{Buzz}.
* If none of the above holds, a_i=i.
Find the sum of all numbers among the first... | stdin | null | 4,579 | 1 | [
"1000000\n",
"15\n"
] | [
"266666333332\n",
"60\n"
] | [
"1100000\n",
"16\n",
"1110000\n",
"23\n",
"1110010\n",
"3\n",
"1111010\n",
"1111110\n",
"4\n",
"8\n"
] | [
"322667033332\n",
"76\n",
"328560000000\n",
"157\n",
"328565550022\n",
"3\n",
"329158562362\n",
"329217448560\n",
"7\n",
"22\n"
] |
CodeContests | Problem
Define a function $ f $ that starts with $ 1 $ and takes a sequence of finite lengths as an argument as follows.
$ \ displaystyle f (\\ {a_1, a_2, \ ldots, a_n \\}) = \ sum_ {i = 1} ^ n {a_i} ^ i $
Given a sequence of length $ N $, $ X = \\ {x_1, x_2, \ ldots, x_N \\} $, $ f (X) for all subsequences $ X'$ ex... | stdin | null | 393 | 1 | [
"5\n100 200 300 400 500\n",
"3\n1 2 3\n"
] | [
"935740429\n",
"64\n"
] | [
"5\n100 325 300 400 500\n",
"3\n1 4 3\n",
"5\n101 325 300 400 500\n",
"3\n2 4 3\n",
"5\n101 325 404 400 500\n",
"3\n3 4 3\n",
"5\n101 608 404 400 500\n",
"3\n4 4 3\n",
"5\n101 608 404 772 500\n",
"3\n4 4 1\n"
] | [
"936266429\n",
"92\n",
"936266445\n",
"96\n",
"94365292\n",
"100\n",
"96479868\n",
"104\n",
"831789230\n",
"60\n"
] |
CodeContests | Dark was deeply studying in the afternoon and came across a concept called as "REVERSE OF A NUMBER"
Hearing first time he became eager to learn and searched on "INTERNET" , after his research on reverse of a number he decided to design a program which can reverse any long numbers.
At the end of afternoon, he started... | stdin | null | 565 | 1 | [
"4\n1\n3\n6\n15\n\nSAMPLE\n"
] | [
"ODD\nODD\nEVEN\nODD\n"
] | [
"62\n463784326487628374\n127836871637123\n128736871637821683\n162356123512\n265362\n1\n3278462873462\n1236812736871\n21365162837821\n123761827368127\n3864873648723\n128638712638712\n123976128731\n12361827361\n1237123182\n187368712361\n18736871263812\n18263187263812\n17236871263182\n12376187236128\n10000000000000000... | [
"EVEN\nODD\nODD\nODD\nEVEN\nODD\nODD\nODD\nEVEN\nODD\nODD\nODD\nODD\nODD\nODD\nODD\nODD\nODD\nODD\nODD\nODD\nODD\nODD\nEVEN\nODD\nODD\nODD\nODD\nODD\nODD\nODD\nEVEN\nODD\nODD\nODD\nEVEN\nODD\nODD\nODD\nEVEN\nODD\nODD\nODD\nODD\nODD\nODD\nODD\nODD\nODD\nODD\nODD\nODD\nODD\nODD\nEVEN\nODD\nODD\nODD\nODD\nODD\nODD\nOD... |
CodeContests | Sig has built his own keyboard. Designed for ultimate simplicity, this keyboard only has 3 keys on it: the `0` key, the `1` key and the backspace key.
To begin with, he is using a plain text editor with this keyboard. This editor always displays one string (possibly empty). Just after the editor is launched, this stri... | stdin | null | 3,201 | 1 | [
"5000\n01000001011101000100001101101111011001000110010101110010000\n",
"3\n0\n",
"300\n1100100\n"
] | [
"500886057\n",
"5\n",
"519054663\n"
] | [
"5000\n01000001011101010100001101101111011001000110010101110010000\n",
"3\n-1\n",
"300\n1100000\n",
"3\n-122\n",
"3\n1\n",
"5000\n01000001011001010100001101101111011001000110010101110010000\n",
"3\n-2\n",
"300\n0100000\n",
"5000\n01000001011001010100001101101111010001000110010101110010000\n",
"3\n... | [
"500886057\n",
"1\n",
"519054663\n",
"0\n",
"5\n",
"500886057\n",
"1\n",
"519054663\n",
"500886057\n",
"1\n"
] |
CodeContests | Sara and Tara were two young girls who had a really bad handwriting.So they decided to write down a word. Being highly passionate about improving their handwriting as well using there creative mind, they also wrote down the same word again but this time starting from the last letter to the first letter with the intern... | stdin | null | 1,600 | 1 | [
"Useful\n\nSAMPLE\n"
] | [
"U-s-e-f-u-l\nl-u-f-e-s-U\n"
] | [
"Arbhitecture\n",
"Crazykife\n",
"Tseful\n\nSAMPLE\n",
"erutcetihbrA\n",
"Crazykiff\n",
"lufesT\n\nSAMPLE\n",
"erutcetihbrB\n",
"Crazykigf\n",
"Brbhitecture\n",
"Cra{ykigf\n"
] | [
"A-r-b-h-i-t-e-c-t-u-r-e\ne-r-u-t-c-e-t-i-h-b-r-A\n",
"C-r-a-z-y-k-i-f-e\ne-f-i-k-y-z-a-r-C\n",
"T-s-e-f-u-l\nl-u-f-e-s-T\n",
"e-r-u-t-c-e-t-i-h-b-r-A\nA-r-b-h-i-t-e-c-t-u-r-e\n",
"C-r-a-z-y-k-i-f-f\nf-f-i-k-y-z-a-r-C\n",
"l-u-f-e-s-T\nT-s-e-f-u-l\n",
"e-r-u-t-c-e-t-i-h-b-r-B\nB-r-b-h-i-t-e-c-t-u-r-e\n"... |
CodeContests | Problem
You were asked by your friend Tousa the day before yesterday. He wants to decorate a tree with an arithmetic progression and use it for a birthday party, but the tree is too big to be used alone. Therefore, he wants you, an excellent programmer, to write a program that efficiently decorates a tree with arithme... | stdin | null | 2,540 | 1 | [
"5 6\n1 0\n2 0\n3 2\n4 1\n1 1 4 0 4\n0 4 1\n1 3 0 7 3\n0 2 2\n1 4 1 8 0\n0 4 2\n",
"3 3\n0 2\n1 2\n1 1 0 0 1\n0 0 2\n0 0 1\n"
] | [
"4\n10\n43\n",
"3\n3\n"
] | [
"5 6\n1 0\n2 0\n3 2\n4 1\n1 1 4 0 4\n0 4 1\n1 3 0 7 3\n0 2 2\n1 4 1 8 0\n0 4 1\n",
"5 6\n1 0\n2 0\n3 2\n4 1\n1 1 4 0 4\n0 4 1\n1 3 0 7 3\n0 3 2\n1 4 1 8 0\n0 4 1\n",
"5 6\n1 0\n2 0\n3 2\n4 1\n1 1 4 0 4\n0 4 1\n1 3 0 7 3\n0 2 2\n1 4 1 8 1\n0 4 2\n",
"3 3\n0 2\n1 2\n1 1 0 1 1\n0 0 2\n0 0 1\n",
"5 6\n1 0\n2 0\... | [
"4\n10\n20\n",
"4\n17\n20\n",
"4\n10\n44\n",
"5\n6\n",
"4\n0\n37\n",
"4\n23\n20\n",
"4\n37\n20\n",
"0\n37\n20\n",
"0\n37\n32\n",
"0\n37\n18\n"
] |
CodeContests | problem
You are looking for a constellation in a picture of the starry sky. The photo always contains exactly one figure with the same shape, orientation, and size as the constellation you are looking for. However, there is a possibility that extra stars are shown in the photograph other than the stars that make up th... | stdin | null | 147 | 1 | [
"5\n8 5\n6 4\n4 3\n7 10\n0 10\n10\n10 5\n2 7\n9 7\n8 10\n10 2\n1 2\n8 1\n6 7\n6 0\n0 9\n5\n904207 809784\n845370 244806\n499091 59863\n638406 182509\n435076 362268\n10\n757559 866424\n114810 239537\n519926 989458\n461089 424480\n674361 448440\n81851 150384\n459107 795405\n299682 6700\n254125 362183\n50795 541942\n0... | [
"2 -3\n-384281 179674\n"
] | [
"5\n8 5\n6 4\n4 3\n7 10\n0 10\n10\n10 5\n2 7\n10 7\n8 10\n10 2\n1 2\n8 1\n6 7\n6 0\n0 9\n5\n904207 809784\n845370 244806\n499091 59863\n638406 182509\n435076 362268\n10\n757559 866424\n114810 239537\n519926 989458\n461089 424480\n674361 448440\n81851 150384\n459107 795405\n299682 6700\n254125 362183\n50795 541942\n... | [
"-384281 179674\n",
"2 -3\n",
"2 -3\n-384281 179674\n",
"-384281 179674\n",
"-384281 179674\n",
"-384281 179674\n",
"-384281 179674\n",
"-384281 179674\n",
"-384281 179674\n",
"-384281 179674\n"
] |
CodeContests | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019.
Constraints
* All values in input are integers.
* 0 \leq L < R \leq 2 \times 10^9
Input
Input is given from Standard Input in the fol... | stdin | null | 5,050 | 1 | [
"4 5\n",
"2020 2040\n"
] | [
"20\n",
"2\n"
] | [
"3 5\n",
"4 10\n",
"2020 3053\n",
"1 5\n",
"8 10\n",
"2845 3053\n",
"2 5\n",
"6 8\n",
"5 12\n",
"9 10\n"
] | [
"12\n",
"20\n",
"0\n",
"2\n",
"72\n",
"1\n",
"6\n",
"42\n",
"30\n",
"90\n"
] |
CodeContests | Hexwamp is a strange swamp, paved with regular hexagonal dimples. Hexerpents crawling in this area are serpents adapted to the environment, consisting of a chain of regular hexagonal sections. Each section fits in one dimple.
Hexerpents crawl moving some of their sections from the dimples they are in to adjacent ones.... | stdin | null | 3,444 | 1 | [
"3\n2 -2\n2 -1\n1 0\n1\n0 2\n0 0\n4\n2 -2\n2 -1\n2 0\n3 0\n2\n1 -1\n0 2\n0 0\n8\n-6 0\n-5 0\n-4 0\n-3 0\n-2 0\n-1 0\n0 0\n1 0\n1\n-1 1\n0 0\n6\n2 -3\n3 -3\n3 -2\n3 -1\n3 0\n2 1\n3\n1 -1\n1 0\n1 1\n0 0\n3\n-8000 4996\n-8000 4997\n-8000 4998\n2\n-7999 4999\n-8001 5000\n-8000 5000\n8\n10 -8\n9 -7\n9 -6\n9 -5\n9 -4\n9 ... | [
"3\n9\n18\n18\n19\n20\n"
] | [
"3\n2 -2\n2 -1\n1 0\n1\n0 2\n0 0\n4\n2 -2\n2 -1\n2 0\n3 0\n2\n1 -1\n0 2\n0 0\n0\n-6 0\n-5 0\n-4 0\n-3 0\n-2 0\n-1 0\n0 0\n1 0\n1\n-1 1\n0 0\n6\n2 -3\n3 -3\n3 -2\n3 -1\n3 0\n2 1\n3\n1 -1\n1 0\n1 1\n0 0\n3\n-8000 4996\n-8000 4997\n-8000 4998\n2\n-7999 4999\n-8001 5000\n-8000 5000\n8\n10 -8\n9 -7\n9 -6\n9 -5\n9 -4\n9 ... | [
"3\n9\n",
"5\n9\n",
"3\n7\n",
"3\n13\n",
"3\n3\n",
"4\n9\n",
"5\n3\n",
"3\n1\n",
"4\n7\n",
"3\n8\n"
] |
CodeContests | Knights' tournaments were quite popular in the Middle Ages. A lot of boys were dreaming of becoming a knight, while a lot of girls were dreaming of marrying a knight on a white horse.
In this problem we consider one of these tournaments.
Let's us call a tournament binary, if it runs according to the scheme described... | stdin | null | 1,347 | 1 | [
"2\n",
"1\n"
] | [
"0\n8\n16\n24\n",
"2\n2\n"
] | [
"3\n",
"6\n",
"4\n",
"5\n",
"7\n",
"8\n",
"11\n",
"10\n",
"9\n",
"13\n"
] | [
"0\n0\n0\n1152\n4608\n11520\n23040\n40320\n",
"0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n440731713\n103414690\n706342376\n338546859\n712284996\n328451928\n25453538\n995319214\n602181130\n898582784\n84189382\n866904918\n606409267\n744769815\n608188675\n198445255\n... |
CodeContests | There are some coins in the xy-plane. The positions of the coins are represented by a grid of characters with H rows and W columns. If the character at the i-th row and j-th column, s_{ij}, is `#`, there is one coin at point (i,j); if that character is `.`, there is no coin at point (i,j). There are no other coins in t... | stdin | null | 177 | 1 | [
"5 4\n#.##\n.##.\n#...\n..##\n...#\n",
"13 27\n......#.........#.......#..\n...#.....###..\n..............#####...##...\n...#######......#...#######\n...#.....#.....###...#...#.\n...#######....#.#.#.#.###.#\n..............#.#.#...#.#..\n.#.#.#...###..\n...........#...#...#######\n..#######..#...#...#.....#\n..#..... | [
"3\n",
"870\n",
"3\n"
] | [
"5 6\n#.##\n.##.\n#...\n..##\n...#\n",
"13 27\n......#.........#.......#..\n...#.....###..\n..............#####...##...\n...#######......#...#######\n...#.....#.....###...#...#.\n...#######....#.#.#.#.###.#\n..............#.#.#...#.#..\n.#.#.#...###..\n...........#...#./.#######\n..#######..#...#...#.....#\n..#..... | [
"3\n",
"583\n",
"0\n",
"1\n",
"476\n",
"187\n",
"2\n",
"565\n",
"528\n",
"530\n"
] |
CodeContests | Harry is playing a game with is friend. He is given a notebook which has names of their friends written in various lowercase letter from 'a' to 'z'. His task is to find a 'special-letters'. A letter is a 'special-letters' if it occurs at least once in each of their friends name.
Given the list of N names, display the ... | stdin | null | 2,830 | 1 | [
"3\nabcdde\nbaccd\neeabcg\n\nSAMPLE\n"
] | [
"3\n"
] | [
"100\nxhsbaqwbokcaqbkhrzddydwirmldcr\nkwkbkhlwmlpuomfaenahhnnpgqpkcxlspbomrweoqq\nrtdckeukfoppbsiccflxqcoxrhwnxpwyjsrvjngqmbgqfwahhkzcbifrvpamffoxcetdochazcqsqhazndwdk\ncakdnrducighyuuemxhqmujauwxabextkdamxybkoyexmdmlyvnmlrwwrt\nczuzxlzrmuaa\ngquymxuabmymtnljadbqxjsipnixbyhwhaoaciinwdhppbpyxswcveddpojlopqsuqsvjhpob... | [
"1\n",
"2\n",
"0\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n"
] |
CodeContests | Pulkit is really good at maths. Recently, he came to know about a problem on matrices. Amazed by the problem he got, he asked Ashish the same problem. Ashish also being good at maths solved the problem within 5 minutes. Now, its your time to solve the problem.
You will be given n*m binary matrix. You need to tell if i... | stdin | null | 2,749 | 1 | [
"2\n3 3\n101\n000\n100\n2 2\n11\n11\n\nSAMPLE\n"
] | [
"Yes\nNo\n"
] | [
"2\n3 3\n101\n000\n110\n2 2\n11\n11\n\nSAMPLE\n",
"2\n3 3\n101\n000\n110\n1 2\n11\n11\n\nSAMPLE\n",
"2\n3 3\n101\n000\n000\n2 2\n11\n11\n\nSAMPLE\n",
"2\n3 3\n101\n000\n000\n1 2\n11\n11\n\nSAMPLE\n",
"2\n3 1\n101\n000\n110\n1 2\n11\n11\n\nSAMPLE\n",
"2\n3 1\n101\n000\n110\n1 2\n11\n11\n\nELPMAS\n",
"2\n... | [
"Yes\nNo\n",
"Yes\nYes\n",
"No\nNo\n",
"No\nYes\n",
"Yes\nYes\n",
"Yes\nYes\n",
"Yes\nYes\n",
"Yes\nYes\n",
"Yes\nNo\n",
"Yes\nYes\n"
] |
CodeContests | In ancient times, Romans constructed numerous water ways to supply water to cities and industrial sites. These water ways were amongst the greatest engineering feats of the ancient world.
These water ways contributed to social infrastructures which improved people's quality of life. On the other hand, problems related... | stdin | null | 423 | 1 | [
"3 8\n########\n#P....*#\n########\n10 10\n##########\n#P.......#\n#..#*....#\n#..#*.#.*#\n#.....#*.#\n#*.......#\n#..##....#\n#...#.P..#\n#P......P#\n##########\n0 0\n"
] | [
"5\n14\n"
] | [
"3 8\n########\n#P....*#\n########\n10 10\n##########\n#P.......#\n#..#*....#\n#..#*.#.*#\n#.....#*.#\n#*.......#\n#..##....#\n#...#.P..#\n#P......O#\n##########\n0 0\n",
"3 8\n########\n#P....*#\n########\n10 10\n##########\n#O.......#\n#..#*....#\n#..#*.#.*#\n#.....#*.#\n#*.......#\n#..##....#\n#...#.P..#\n#P..... | [
"5\n14\n",
"5\n15\n",
"5\n16\n",
"5\n17\n",
"0\n16\n",
"1\n16\n",
"5\n18\n",
"0\n14\n",
"5\n12\n",
"5\n13\n"
] |
CodeContests | Aditya is a professor in Engilsh loves to play with words. Today he asks his assistant Abishek to perform an experiment where he wants him to calculate the total number of word that can be formed from a given word such that the characters are arranged lexicographically(in alphabetical order). The words that are to be f... | stdin | null | 4,773 | 1 | [
"3\nankit\naman\ncvrcebhubaneswar\n\nSAMPLE\n"
] | [
"5\n3\n11\n"
] | [
"100\nyqypgenznlzztptieaqkgldlzzvfptbgkaxbfygoqyaagbvulzulemtnybvszhmpbrqmyodsudywprbyfbdlwdusnrgxytlrcaybobwugeosucuqreyfzgktbatrcponfibpsbfwbsrrkobtpmodiywsccddvpkbtnsclwoofmfkdxqhkzrvlnypxkiwodvhsefkayhy\nkgrmgjuxgpnrnozmjtflxdnpskyolhwcytjsurjavhdkcbehynyeuizynsrcxsxeehkwlzjkrcnhjtyfywrmquufnsujqarslmftezrijcru... | [
"25\n26\n26\n26\n26\n26\n26\n26\n26\n26\n9\n26\n26\n26\n26\n26\n26\n26\n24\n26\n26\n26\n26\n27\n26\n26\n26\n26\n26\n26\n21\n26\n26\n26\n26\n26\n26\n20\n26\n26\n26\n26\n26\n26\n26\n26\n26\n26\n26\n26\n26\n26\n26\n26\n26\n26\n26\n26\n23\n26\n25\n26\n26\n26\n26\n26\n26\n26\n26\n26\n26\n26\n26\n26\n26\n26\n26\n26\n26\n... |
CodeContests | Problem D: Mr. Rito Post Office
You are a programmer working at a post office on a remote island. The area you live in consists of multiple islands. There is one or more port towns on each island. There may be other towns and villages in addition to them. You have to use a boat to go from one island to another. You ca... | stdin | null | 587 | 1 | [
"3 3\n1 2 5 L\n1 2 7 S\n2 3 11 S\n3\n1 2 3\n5 5\n1 2 15 L\n2 3 10 L\n4 5 7 L\n1 3 30 S\n3 4 100 S\n5\n1 3 5 4 1\n0 0\n"
] | [
"18\n269\n"
] | [
"3 3\n1 2 5 L\n1 2 7 S\n2 3 11 S\n3\n1 2 3\n5 5\n1 2 15 L\n2 3 10 L\n4 5 7 L\n1 3 30 S\n3 5 100 S\n5\n1 3 5 4 1\n0 0\n",
"3 3\n1 2 5 L\n1 2 7 S\n2 3 11 S\n3\n1 2 3\n7 5\n1 2 15 L\n2 3 10 L\n4 5 7 L\n1 3 30 S\n3 4 000 S\n5\n1 3 5 4 1\n0 0\n",
"3 3\n1 2 5 L\n1 2 7 S\n2 3 11 S\n3\n2 2 3\n5 5\n1 2 15 L\n2 3 10 L\n4... | [
"18\n269\n",
"18\n69\n",
"11\n269\n",
"5\n269\n",
"5\n124\n",
"18\n60\n",
"11\n270\n",
"10\n124\n",
"18\n61\n",
"6\n269\n"
] |
CodeContests | Chef Palin, as his name suggests, is always very interested in palindromic strings. Recently, he made a pretty interesting discovery on palindromes and that made him feel really Lucky. He came across something known as Lucky Palindromes. He defines a string as being a lucky palindrome if it is a palindrome containing t... | stdin | null | 3,659 | 1 | [
"3\nlaubcdkey\nluckycodechef\naaaaaaaa\n"
] | [
"luckykcul 8\nluckycocykcul 6\nunlucky\n"
] | [
"3\nlaubcdkey\nlubkycodechef\naaaaaaaa\n",
"3\nlaubcdkey\nyubklcodechef\naaaaaaaa\n",
"3\nlatbcdkfy\nfeicedocljbux\naaaaaaba\n",
"3\nytkdadfbl\ntobjlcedechwf\naabaaaba\n",
"3\nytkdadfbl\ntobjlcfdechwf\naabaaaba\n",
"3\nytkdadlbf\ntobjlcfdechwf\naabaaaca\n",
"3\nytjdadlbf\nfwmceefchjtnb\nb`aaaada\n",
"... | [
"luckykcul 8\nluckycocykcul 7\nunlucky\n",
"luckykcul 8\nluckycocykcul 9\nunlucky\n",
"luckykcul 8\nfluckyoykculf 10\nunlucky\n",
"luckykcul 8\nfluckyeykculf 10\nunlucky\n",
"luckykcul 8\nfluckyfykculf 10\nunlucky\n",
"ykculucky 8\nfluckyfykculf 10\nunlucky\n",
"ykculucky 8\nbluckyfykculb 10\nunlucky\n"... |
CodeContests | Problem
Taro decided to watch one movie every day at a nearby movie theater during the summer vacation. (Taro has 31 days of summer vacation from August 1st to August 31st.)
The theater is set to show n movies during the summer vacation. Each movie is assigned a number from 1 to n, and the i-th movie will only be sho... | stdin | null | 4,399 | 1 | [
"4\n1 31\n2 2\n2 3\n3 3\n",
"5\n1 10\n10 20\n20 21\n22 31\n4 20\n"
] | [
"1700\n",
"1800\n"
] | [
"4\n1 31\n2 4\n2 3\n3 3\n",
"5\n1 10\n10 20\n20 21\n22 31\n4 15\n",
"4\n1 31\n2 2\n2 1\n3 3\n",
"5\n1 10\n10 20\n20 21\n22 31\n4 28\n",
"5\n1 10\n15 20\n20 21\n22 31\n4 20\n",
"5\n1 10\n10 20\n20 21\n22 31\n7 15\n",
"5\n1 10\n10 20\n20 21\n12 31\n7 15\n",
"5\n1 10\n14 20\n20 21\n12 31\n7 15\n",
"4\n... | [
"1750\n",
"1800\n",
"1700\n",
"1800\n",
"1800\n",
"1800\n",
"1800\n",
"1800\n",
"1750\n",
"1800\n"
] |
CodeContests | We will call a string that can be obtained by concatenating two equal strings an even string. For example, `xyzxyz` and `aaaaaa` are even, while `ababab` and `xyzxy` are not.
For a non-empty string S, we will define f(S) as the shortest even string that can be obtained by appending one or more characters to the end of... | stdin | null | 2,885 | 1 | [
"vgxgpuamkvgxgvgxgpuamkvgxg\n1 1000000000000000000\n",
"xx\n1 1000000000000000000\n",
"abaaba\n6 10\n"
] | [
"87167725689669676 0 0 0 0 0 282080685775825810 0 0 0 87167725689669676 0 87167725689669676 0 0 87167725689669676 0 0 0 0 87167725689669676 141040342887912905 0 141040342887912905 0 0\n",
"0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1000000000000000000 0 0\n",
"3 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... | [
"vgxgpuamkvgxgvgxgpuamkvgxg\n1 0000000000000000000\n",
"xx\n2 1000000000000000000\n",
"abaaca\n6 10\n",
"vgxgpuamkvgxgvgxgpuamkvgxg\n1 0000100000000000000\n",
"vgxgpualkvgxgvgxgpuamkvgxg\n1 0000100000000000000\n",
"abaaca\n11 11\n",
"vgxgpualkvgxgvgxgpuamkvgxg\n1 0001100000000000000\n",
"vgxgpualkvgxg... | [
"0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n",
"0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 999999999999999999 0 0\n",
"3 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n",
"8716772568967 0 0 0 0 0 28208068577582 0 0 0 8716772568967 0 8716772568967 0 0 8716772568967 0 0 0 0 8716772568967 141040... |
CodeContests | Snuke has an integer sequence A of length N.
He will freely choose an integer b. Here, he will get sad if A_i and b+i are far from each other. More specifically, the sadness of Snuke is calculated as follows:
* abs(A_1 - (b+1)) + abs(A_2 - (b+2)) + ... + abs(A_N - (b+N))
Here, abs(x) is a function that returns the... | stdin | null | 3,354 | 1 | [
"5\n2 2 3 5 5\n",
"7\n1 1 1 1 2 3 4\n",
"9\n1 2 3 4 5 6 7 8 9\n",
"6\n6 5 4 3 2 1\n"
] | [
"2\n",
"6\n",
"0\n",
"18\n"
] | [
"5\n2 2 3 5 10\n",
"7\n1 2 1 1 2 3 4\n",
"9\n1 2 3 4 5 6 7 8 1\n",
"6\n6 0 4 3 2 1\n",
"7\n1 0 1 1 2 3 4\n",
"9\n1 2 3 4 5 4 7 8 1\n",
"6\n6 0 4 3 2 2\n",
"9\n1 2 3 4 5 2 7 8 1\n",
"6\n6 0 4 6 2 2\n",
"7\n1 0 1 1 0 1 4\n"
] | [
"6\n",
"7\n",
"8\n",
"15\n",
"5\n",
"10\n",
"14\n",
"12\n",
"17\n",
"9\n"
] |
CodeContests | We have N boxes numbered 1 to N, and M balls numbered 1 to M. Currently, Ball i is in Box A_i.
You can do the following operation:
* Choose a box containing two or more balls, pick up one of the balls from that box, and put it into another box.
Since the balls are very easy to break, you cannot move Ball i more th... | stdin | null | 3,152 | 1 | [
"3 3\n1 2 1\n2 1 1\n1 3 2\n",
"1 1\n1 1 1\n",
"2 2\n1 2 1\n2 1 1\n",
"5 5\n1 2 1\n2 1 1\n1 3 2\n4 5 1\n5 4 1\n"
] | [
"3\n",
"0\n",
"-1\n",
"6\n"
] | [
"6 3\n1 2 1\n2 1 1\n1 3 2\n",
"2 2\n1 2 1\n1 1 1\n",
"5 5\n1 2 1\n3 1 1\n1 3 2\n4 5 1\n5 4 1\n",
"5 5\n1 2 1\n3 1 1\n1 3 2\n1 5 1\n5 4 1\n",
"2 1\n1 1 1\n",
"5 5\n1 2 1\n3 1 1\n0 3 2\n1 5 1\n5 5 1\n",
"2 2\n1 3 1\n1 1 1\n",
"5 5\n1 2 1\n3 1 1\n0 3 2\n1 5 1\n5 4 1\n",
"5 5\n1 2 1\n3 1 1\n0 3 2\n1 5 1... | [
"3\n",
"1\n",
"6\n",
"5\n",
"0\n",
"4\n",
"1\n",
"5\n",
"5\n",
"5\n"
] |
CodeContests | Problem :
The Starks(S),Lannisters(L) and the Baratheons(B) are fighting for the
Iron Throne. These three houses are fighting from ages to capture the
throne.
The N th battle goes on for N days before a winner
emerges. Interestingly,the battles follow a pattern.
If the battle
number N is divisible by 3 it is fought... | stdin | null | 3,301 | 1 | [
"3\n1\n6\n12\n\nSAMPLE\n"
] | [
"LB\nSL\nBS\n"
] | [
"2421\n30818\n4399\n6718\n14365\n22792\n21922\n5364\n32273\n14894\n6502\n4931\n10384\n17321\n30287\n21441\n6061\n16849\n413\n26555\n25679\n17277\n16932\n24777\n10107\n21551\n20906\n31910\n18134\n9867\n11665\n17215\n27237\n17166\n31414\n19210\n32664\n3836\n16536\n6041\n28039\n16282\n24509\n18031\n24187\n3486\n18257\... | [
"BS\nLB\nBS\nLB\nLB\nBS\nBS\nBS\nBS\nSL\nSL\nSL\nSL\nSL\nSL\nBS\nLB\nBS\nBS\nBS\nSL\nLB\nLB\nLB\nLB\nSL\nLB\nLB\nBS\nSL\nSL\nBS\nBS\nBS\nLB\nLB\nLB\nBS\nBS\nSL\nSL\nBS\nLB\nLB\nBS\nBS\nBS\nBS\nSL\nLB\nSL\nSL\nSL\nLB\nBS\nBS\nBS\nLB\nBS\nLB\nLB\nBS\nSL\nBS\nBS\nBS\nBS\nLB\nSL\nLB\nLB\nLB\nSL\nSL\nLB\nSL\nSL\nLB\nSL\... |
CodeContests | A serious incident happened at Taro's house, which loves steamed buns. One of the three steamed buns offered at the Buddhist altar in the Japanese-style room was gone. When Taro, who was aiming for a snack someday, started an investigation to find the criminal, it turned out that there were many people who entered the ... | stdin | null | 2,965 | 1 | [
"6\n7\n5 2\n1 4\n3 5\n4 2\n1 6\n6 4\n3 4\n"
] | [
"3\n5\n1\n6\n4\n2\n"
] | [
"6\n7\n5 2\n1 4\n3 5\n8 2\n1 6\n6 4\n3 4\n",
"6\n7\n7 2\n1 4\n3 5\n8 2\n1 6\n6 4\n2 4\n",
"6\n7\n3 2\n1 4\n6 5\n3 2\n1 6\n6 4\n3 4\n",
"6\n7\n5 2\n1 4\n3 5\n8 2\n2 6\n6 4\n3 4\n",
"6\n7\n3 2\n1 4\n3 1\n4 2\n1 6\n6 4\n3 4\n",
"6\n7\n7 2\n1 4\n3 5\n8 2\n2 6\n6 4\n2 4\n",
"6\n7\n3 2\n1 4\n6 5\n3 2\n1 6\n5 ... | [
"1\n6\n3\n5\n4\n2\n",
"1\n6\n3\n5\n2\n4\n",
"1\n6\n5\n3\n4\n2\n",
"3\n5\n2\n6\n1\n4\n",
"3\n1\n6\n5\n4\n2\n",
"2\n6\n3\n5\n1\n4\n",
"1\n6\n5\n4\n3\n2\n",
"3\n2\n1\n6\n5\n4\n",
"2\n6\n3\n5\n4\n1\n",
"3\n2\n6\n5\n4\n1\n"
] |
CodeContests | We have a sequence A of length N.
On this sequence, we can perform the following two kinds of operations:
* Swap two adjacent elements.
* Select one element, and increment it by 1.
We will repeatedly perform these operations so that A will be a non-decreasing sequence. Find the minimum required number of operati... | stdin | null | 1,091 | 1 | [
"20\n8\n2\n9\n7\n4\n6\n7\n9\n7\n4\n7\n4\n4\n3\n6\n2\n3\n4\n4\n9\n",
"5\n4\n1\n8\n8\n7\n"
] | [
"62\n",
"2\n"
] | [
"20\n8\n2\n9\n7\n4\n6\n7\n9\n7\n4\n7\n4\n4\n3\n6\n0\n3\n4\n4\n9\n",
"5\n4\n1\n8\n2\n7\n",
"20\n8\n2\n9\n7\n4\n6\n7\n9\n7\n4\n7\n4\n8\n3\n6\n0\n3\n4\n4\n9\n",
"5\n4\n1\n8\n2\n10\n",
"20\n8\n2\n9\n7\n4\n6\n7\n9\n7\n4\n7\n4\n8\n3\n12\n0\n3\n4\n4\n9\n",
"20\n8\n2\n9\n7\n4\n6\n7\n9\n5\n3\n7\n4\n8\n3\n12\n0\n3\... | [
"64\n",
"4\n",
"60\n",
"3\n",
"62\n",
"65\n",
"63\n",
"76\n",
"80\n",
"78\n"
] |
CodeContests | fact(n) refers to n×(n−1)×⋯×3×2×1
Example, fact(10)=9×⋯×3×2×1=3628800,
and the summation of the digits of fact(10) is 3+6+2+8+8+0+0=27.
Write your program to find the summation of the digits of fact(N).
Input Format
The first line contains an integer T , i.e., number of test cases.
Next T lines will contain an integ... | stdin | null | 4,262 | 1 | [
"2\n3\n6\n\nSAMPLE\n"
] | [
"6\n9\n"
] | [
"4\n7\n6\n3\n4\n",
"5\n30\n69\n104\n10\n11\n",
"2\n1\n6\n\nSAMPLE\n",
"5\n30\n69\n104\n6\n11\n",
"2\n1\n1\n\nSAMPLE\n",
"5\n30\n74\n104\n6\n11\n",
"5\n30\n74\n127\n6\n11\n",
"5\n8\n74\n127\n6\n11\n",
"5\n8\n74\n107\n6\n11\n",
"4\n7\n9\n5\n4\n"
] | [
"9\n9\n6\n6\n",
"117\n351\n702\n27\n36\n",
"1\n9\n",
"117\n351\n702\n9\n36\n",
"1\n1\n",
"117\n378\n702\n9\n36\n",
"117\n378\n873\n9\n36\n",
"9\n378\n873\n9\n36\n",
"9\n378\n594\n9\n36\n",
"9\n27\n3\n6\n"
] |
CodeContests | Backgorund
The super popular game "Puzzle & Hexagons" has finally been released. This game is so funny that many people are addicted to it. There were a number of people who were certified as addicted by doctors because of their excessive enthusiasm. Volunteers from around the world have created a "Puzzle & Hexagons" ... | stdin | null | 822 | 1 | [
"4 5\nBYYGG\nRRRRR\nRRBRR\nYYGGB\n2\n3 1\n3 1\n",
"3 3\nRGR\nRBP\nYEB\n1\n1 1\n",
"4 4\nBEEP\nERYY\nBBRP\nRBYP\n1\n1 2\n"
] | [
".....\n.....\n.....\nB.BGB\n",
"…\nYBG\nEBP\n",
"....\n....\n....\n.B..\n"
] | [
"4 4\nBEEP\nYYRE\nBBRP\nRBYP\n1\n1 2\n",
"3 3\nRGR\nRBP\nYEB\n1\n1 2\n",
"3 3\nGRR\nRBP\nYEB\n1\n1 1\n",
"4 4\nBEEP\nERYY\nBBRP\nRBYP\n1\n1 3\n",
"3 3\nGRR\nRBP\nYEB\n1\n1 0\n",
"4 5\nBYYGG\nRRRRR\nRRBRR\nYYGGB\n2\n4 1\n3 1\n",
"4 4\nBEEP\nYYRE\nBBRP\nRBYP\n1\n2 2\n",
"3 3\nGRR\nRBP\nBEY\n1\n1 1\n",
... | [
"....\n....\n....\nB...\n",
"RGR\nRBP\nYEB\n",
".G.\nYB.\nEBP\n",
"...P\nBRYY\n..RP\nR.YP\n",
"...\nGBP\nYEB\n",
".....\nBYYBG\n..G..\nYYGBG\n",
"BYEE\nYRR.\n..E.\nR.Y.\n",
".G.\nBB.\nEYP\n",
"...B\nPRYY\n..RP\nR.YP\n",
"...B\n..YY\nP.BB\nPBYP\n"
] |
CodeContests | Kostya likes the number 4 much. Of course! This number has such a lot of properties, like:
Four is the smallest composite number;
It is also the smallest Smith number;
The smallest non-cyclic group has four elements;
Four is the maximal degree of the equation that can be solved in radicals;
There is four-color theorem... | stdin | null | 2,788 | 1 | [
"5\n447474\n228\n6664\n40\n81\n"
] | [
"4\n0\n1\n1\n0\n"
] | [
"5\n447474\n228\n6664\n40\n35\n",
"5\n447474\n228\n2424\n40\n57\n",
"5\n447474\n340\n2424\n40\n57\n",
"5\n447474\n340\n2424\n40\n42\n",
"5\n742529\n340\n2424\n40\n42\n",
"5\n1167956\n340\n2424\n40\n42\n",
"5\n1167956\n340\n2424\n40\n7\n",
"5\n1167956\n580\n2424\n40\n7\n",
"5\n1167956\n580\n2424\n61\... | [
"4\n0\n1\n1\n0\n",
"4\n0\n2\n1\n0\n",
"4\n1\n2\n1\n0\n",
"4\n1\n2\n1\n1\n",
"1\n1\n2\n1\n1\n",
"0\n1\n2\n1\n1\n",
"0\n1\n2\n1\n0\n",
"0\n0\n2\n1\n0\n",
"0\n0\n2\n0\n0\n",
"1\n0\n2\n0\n0\n"
] |
CodeContests | Scheme? - Too loudly said. Just a new idea. Now Chef is expanding his business. He wants to make some new restaurants in the big city of Lviv. To make his business competitive he should interest customers. Now he knows how. But don't tell anyone - it is a secret plan. Chef knows four national Ukrainian dishes - salo, ... | stdin | null | 953 | 1 | [
"3\n2\n3\n5\n"
] | [
"12\n24\n240\n"
] | [
"3\n2\n3\n6\n",
"3\n2\n3\n3\n",
"3\n3\n3\n6\n",
"3\n2\n3\n2\n",
"3\n4\n3\n2\n",
"3\n4\n5\n2\n",
"3\n4\n5\n4\n",
"3\n2\n5\n4\n",
"3\n2\n5\n5\n",
"3\n2\n6\n5\n"
] | [
"12\n24\n732\n",
"12\n24\n24\n",
"24\n24\n732\n",
"12\n24\n12\n",
"84\n24\n12\n",
"84\n240\n12\n",
"84\n240\n84\n",
"12\n240\n84\n",
"12\n240\n240\n",
"12\n732\n240\n"
] |
CodeContests | An undirected graph is given. Each edge of the graph disappears with a constant probability. Calculate the probability with which the remained graph is connected.
Input
The first line contains three integers N (1 \leq N \leq 14), M (0 \leq M \leq 100) and P (0 \leq P \leq 100), separated by a single space. N is the... | stdin | null | 1,543 | 1 | [
"3 3 10\n1 2\n2 3\n3 1\n",
"4 5 50\n1 2\n2 3\n3 4\n4 1\n1 3\n",
"3 3 50\n1 2\n2 3\n3 1\n"
] | [
"0.972000000000\n",
"0.437500000000\n",
"0.500000000000\n"
] | [
"4 5 50\n1 2\n2 3\n3 4\n4 2\n1 3\n",
"3 0 50\n1 2\n2 3\n3 1\n",
"3 3 10\n1 2\n3 3\n3 1\n",
"4 5 50\n2 2\n2 3\n3 4\n4 1\n1 3\n",
"1 0 31\n1 2\n2 3\n3 0\n",
"2 3 10\n1 2\n3 3\n3 1\n",
"3 0 31\n1 2\n2 3\n3 1\n",
"3 0 31\n1 1\n2 3\n3 1\n",
"3 0 43\n1 1\n2 3\n3 1\n",
"3 0 43\n1 1\n2 3\n1 1\n"
] | [
"0.437500000\n",
"0.000000000\n",
"0.810000000\n",
"0.250000000\n",
"1.000000000\n",
"0.900000000\n",
"0.000000000\n",
"0.000000000\n",
"0.000000000\n",
"0.000000000\n"
] |
CodeContests | Write a program to find the mode of a given list of integers. Mode of a number is defined as the number which is most frequently occured.
For example:
L = {1,2,2,3} // Here mode is 2(most frequently occured)
It is possible that multiple answers are possible for a list. In that case print all possible answers in no... | stdin | null | 3,502 | 1 | [
"2\n5\n1 2 2 2 2 \n6\n1 2 2 3 3 4\n\nSAMPLE\n"
] | [
"2\n3 2\n"
] | [
"2\n5\n1 4 2 2 2 \n6\n1 2 2 3 3 4\n\nSAMPLE\n",
"2\n5\n1 2 2 2 2 \n6\n1 2 2 3 0 4\n\nSAMPLE\n",
"2\n5\n1 4 2 2 2 \n6\n1 2 0 3 3 4\n\nSAMPLE\n",
"2\n5\n1 4 0 2 2 \n6\n1 2 1 3 3 4\n\nS@EPLM\n",
"2\n5\n1 4 3 2 2 \n6\n1 2 2 3 6 6\n\nSAMPLE\n",
"2\n5\n1 4 0 2 2 \n6\n1 2 1 3 1 4\n\nS@EPLM\n",
"2\n5\n1 0 3 2 2... | [
"2\n3 2\n",
"2\n2\n",
"2\n3\n",
"2\n3 1\n",
"2\n6 2\n",
"2\n1\n",
"2\n2 1\n",
"2\n6 3\n",
"2\n6\n",
"2\n4 3\n"
] |
CodeContests | A-Aun's breathing
Problem Statement
Maeda-san and Goto-san, who will both turn 70 years old in 2060, are long-time friends and friends who fought together at the ACM-ICPC in college.
The two are still excited about competitive programming, drinking tea together.
When the two of us drank tea together, Mr. Maeda said... | stdin | null | 2,661 | 1 | [
"4\nA\nUn\nA\nUn\n"
] | [
"YES\n"
] | [
"4\nA\nUn\nB\nUn\n",
"4\n@\nUn\nB\nUn\n",
"4\n@\nUn\nB\nnU\n",
"4\n@\nUn\nB\noU\n",
"4\n@\nUn\nA\noU\n",
"4\n@\nUn\nA\nUo\n",
"4\n@\nTn\nA\nUo\n",
"4\n@\nTn\nA\nVo\n",
"4\n@\nTo\nA\nVo\n",
"4\n@\nUo\nA\nVo\n"
] | [
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n"
] |
CodeContests | There are a total of n people in Prateek's class, numbered from 1 to n.
Every person has some field of interest for their projects.
There are a number people who have the same field of interest.
Now, you are given a number of pairs of the form (x,y).
This means that the students numbered x and y have interest in the ... | stdin | null | 1,004 | 1 | [
"1\n6 4\n1 2\n2 3\n4 5\n2 6\n\nSAMPLE\n"
] | [
"6\n"
] | [
"1\n6 4\n1 2\n2 3\n6 5\n2 6\n\nSAMPLE\n",
"1\n6 4\n1 2\n2 1\n6 5\n2 6\n\nSAMPLE\n",
"1\n11 4\n1 2\n2 1\n0 5\n2 6\n\nSAMPLE\n",
"1\n11 3\n1 2\n2 1\n0 4\n2 6\n\nSAMPLE\n",
"1\n6 4\n1 2\n4 3\n4 5\n2 6\n\nSAMPLE\n",
"1\n6 4\n1 2\n2 1\n2 5\n2 6\n\nSAMPLE\n",
"1\n11 4\n1 2\n2 1\n2 5\n2 6\n\nSAMPLE\n",
"1\n6... | [
"10\n",
"6\n",
"3\n",
"1\n",
"9\n",
"6\n",
"6\n",
"3\n",
"6\n",
"6\n"
] |
CodeContests | Problem A: Swap crypto
A 2D enthusiast at R University, he often writes embarrassing sentences that blush when seen by people. Therefore, in order for a third party to not be able to see the text he is writing, he encrypts the text using a method called swap encryption that he devised independently. In swap encryption... | stdin | null | 3,490 | 1 | [
"1\ntojxo\n1 4\n5\nuhcqmlmkv\n4 5\n6 9\n3 6\n1 7\n3 6\n5\nshzxadexonr\n8 9\n3 9\n5 8\n4 9\n10 11\n0\n"
] | [
"aojwo\nshinryaku\nshitadegeso\n"
] | [
"1\ntojxo\n1 4\n5\nuhcqmlmkv\n4 5\n6 9\n3 6\n1 7\n3 6\n5\nshzxadexonr\n8 9\n3 9\n5 9\n4 9\n10 11\n0\n",
"1\ntojxo\n1 4\n5\nuhcqmlnkv\n4 5\n6 9\n3 6\n1 7\n3 6\n5\nshzxadexonr\n8 9\n3 9\n5 8\n4 9\n10 11\n0\n",
"1\ntojxo\n1 4\n5\nuhcqmlnkv\n4 5\n6 9\n3 6\n1 4\n3 6\n5\nshzxadexonr\n8 9\n3 9\n5 8\n4 9\n10 11\n0\n",
... | [
"aojwo\nshinryaku\nshktgdegyso\n",
"aojwo\nthinryaku\nshitadegeso\n",
"aojwo\nthinyynku\nshitadegeso\n",
"aojwo\nthinyynku\nshitxdegyfo\n",
"aojwo\nthinryaku\nshitaeegeso\n",
"aojwo\nthinyynku\nsaitsdegyfq\n",
"aojwo\ntponyynki\nsaitsdegyfq\n",
"aojwo\ntponyynki\nsakxsdegyxq\n",
"aojwo\nshinryaku\ns... |
CodeContests | The solution of $ x ^ 3 = q $ is to calculate the recurrence formula $ x_ {n + 1} = x_n-\ frac {x_ {n} ^ 3 --q} {3x_ {n} ^ 2} $ It can be calculated approximately with.
Put a positive number $ \ frac {q} {2} $ in $ x_1 $
$ x_2 = x_1-\ frac {x_ {1} ^ 3 --q} {3x_ {1} ^ 2} $, $ x_3 = x_2-\ frac {x_ {2} ^ 3 --q} {3x_ {2}... | stdin | null | 4,274 | 1 | [
"15\n15\n-1\n"
] | [
"2.466212\n2.466212\n"
] | [
"15\n29\n-1\n",
"15\n31\n-1\n",
"15\n47\n-1\n",
"15\n19\n-1\n",
"15\n33\n-1\n",
"15\n43\n-1\n",
"15\n84\n-1\n",
"15\n10\n-1\n",
"15\n55\n-1\n",
"15\n99\n-1\n"
] | [
"2.466212\n3.072317\n",
"2.466212\n3.141382\n",
"2.466212\n3.608826\n",
"2.466212\n2.668407\n",
"2.466212\n3.207537\n",
"2.466212\n3.503398\n",
"2.466212\n4.379519\n",
"2.466212\n2.154437\n",
"2.466212\n3.802953\n",
"2.466212\n4.626066\n"
] |
CodeContests | Taro Aizu's company has a boss who hates being indivisible. When Taro goes out to eat with his boss, he pays by splitting the bill, but when the payment amount is not divisible by the number of participants, his boss always pays for it.
One day, Taro became the secretary of the dinner party. Mr. Taro, who has little m... | stdin | null | 1,252 | 1 | [
"4 15000\n305\n260\n129\n500\n3 400\n10\n20\n30\n3 200909\n5\n9\n12\n0 0\n"
] | [
"14983\nNA\n200909\n"
] | [
"4 15000\n305\n260\n129\n500\n3 400\n10\n20\n30\n3 337371\n5\n9\n12\n0 0\n",
"4 15000\n305\n124\n129\n500\n3 400\n10\n20\n30\n3 200909\n5\n9\n12\n0 0\n",
"4 15000\n305\n260\n136\n500\n3 400\n10\n1\n30\n3 337371\n5\n1\n12\n0 0\n",
"4 11033\n305\n24\n129\n177\n3 547\n6\n20\n30\n3 200909\n5\n9\n32\n0 0\n",
"4 ... | [
"14983\nNA\n337369\n",
"14983\nNA\n200909\n",
"14983\n397\n337369\n",
"11027\nNA\n200909\n",
"14057\nNA\n200909\n",
"11213\nNA\n200909\n",
"7951\nNA\n200909\n",
"14983\nNA\n317797\n",
"14057\nNA\nNA\n",
"14983\nNA\n5011\n"
] |
CodeContests | Find the number of palindromic numbers among the integers between A and B (inclusive). Here, a palindromic number is a positive integer whose string representation in base 10 (without leading zeros) reads the same forward and backward.
Constraints
* 10000 \leq A \leq B \leq 99999
* All input values are integers.
Inp... | stdin | null | 3,636 | 1 | [
"11009 11332\n",
"31415 92653\n"
] | [
"4\n",
"612\n"
] | [
"31415 27129\n",
"31415 97709\n",
"31415 41187\n",
"38168 41187\n",
"53417 77120\n",
"44323 77120\n",
"18202 20736\n",
"44323 83416\n",
"15858 24247\n",
"44323 46102\n"
] | [
"0\n",
"662\n",
"97\n",
"31\n",
"237\n",
"328\n",
"26\n",
"391\n",
"84\n",
"18\n"
] |
CodeContests | A video game company called ICPC (International Company for Playing and Competing) is now developing a new arcade game. The new game features a lot of branches. This makes the game enjoyable for everyone, since players can choose their routes in the game depending on their skills. Rookie players can choose an easy rout... | stdin | null | 2,180 | 1 | [
"4 6\n0 1 5\n0 2 5\n0 3 5\n1 2 5\n1 3 5\n2 3 5\n",
"2 1\n0 1 10\n",
"3 3\n0 1 5\n1 2 3\n0 2 2\n"
] | [
"20\n",
"0\n",
"6\n"
] | [
"3 3\n0 1 5\n1 2 3\n1 2 2\n",
"2 1\n0 1 13\n",
"3 3\n0 1 5\n1 2 2\n0 2 2\n",
"3 3\n0 1 5\n1 2 5\n1 2 2\n",
"3 3\n0 1 5\n1 2 6\n0 2 2\n",
"3 3\n0 1 9\n1 2 6\n0 2 2\n",
"3 3\n0 1 13\n1 2 6\n0 2 2\n",
"3 3\n0 1 5\n1 2 3\n1 2 1\n",
"3 3\n0 1 9\n1 2 6\n0 2 3\n",
"3 3\n0 1 1\n1 2 6\n0 2 3\n"
] | [
"1\n",
"0\n",
"5\n",
"3\n",
"9\n",
"13\n",
"17\n",
"2\n",
"12\n",
"4\n"
] |
CodeContests | Find the symmetric difference of two sets $A = \\{a_0, a_1, ..., a_{n-1}\\}$ and $B = \\{b_0, b_1, ..., b_{m-1}\\}$.
Constraints
* $1 \leq n, m \leq 200,000$
* $0 \leq a_0 < a_1 < ... < a_{n-1} \leq 10^9$
* $0 \leq b_0 < b_1 < ... < b_{m-1} \leq 10^9$
Input
The input is given in the following format.
$n$
$a_0 \; ... | stdin | null | 3,256 | 1 | [
"7\n1 2 3 4 5 6 7\n4\n2 4 6 8\n"
] | [
"1\n3\n5\n7\n8\n"
] | [
"7\n1 2 3 4 5 6 8\n4\n2 4 6 8\n",
"7\n1 2 3 4 5 6 7\n4\n2 4 6 11\n",
"7\n1 2 3 4 5 6 7\n1\n2 4 6 11\n",
"7\n1 2 3 4 5 6 10\n1\n2 7 6 11\n",
"7\n1 2 3 4 5 6 7\n4\n1 4 6 8\n",
"7\n1 2 3 4 5 6 10\n4\n1 4 6 8\n",
"7\n1 2 3 4 5 7 10\n1\n2 14 6 11\n",
"7\n1 2 3 4 5 7 10\n2\n2 14 6 11\n",
"7\n1 2 3 4 5 6 1... | [
"1\n3\n5\n",
"1\n3\n5\n7\n11\n",
"1\n3\n4\n5\n6\n7\n",
"1\n3\n4\n5\n6\n10\n",
"2\n3\n5\n7\n8\n",
"2\n3\n5\n8\n10\n",
"1\n3\n4\n5\n7\n10\n",
"1\n3\n4\n5\n7\n10\n14\n",
"1\n2\n3\n5\n6\n10\n",
"2\n3\n5\n10\n"
] |
CodeContests | In the middle of Tyrrhenian Sea, there is a small volcanic island called Chronus. The island is now uninhabited but it used to be a civilized island. Some historical records imply that the island was annihilated by an eruption of a volcano about 800 years ago and that most of the people in the island were killed by pyr... | stdin | null | 4,279 | 1 | [
"3\n8 8 18\n32 32 32\n57 2 57\n5\n49 3 49\n7 30 44\n27 21 21\n33 56 56\n21 46 4\n3\n45 52 28\n36 26 36\n20 55 50\n10\n33 8 39\n50 57 43\n35 21 12\n21 17 11\n16 21 58\n45 40 53\n45 30 53\n39 1 8\n55 48 30\n7 48 15\n0\n"
] | [
"00:00:00 00:00:10\n06:14:56 06:32:09\n07:27:37 07:32:02\n05:17:40 05:21:03\n"
] | [
"3\n8 8 18\n32 32 32\n57 2 57\n5\n49 3 49\n7 30 44\n27 21 21\n33 56 56\n21 46 4\n3\n45 52 28\n36 26 36\n40 55 50\n10\n33 8 39\n50 57 43\n35 21 12\n21 17 11\n16 21 58\n45 40 53\n45 30 53\n39 1 8\n55 48 30\n7 48 15\n0\n",
"3\n8 8 18\n32 32 32\n57 2 57\n5\n49 3 49\n7 30 44\n27 21 21\n33 56 56\n21 46 4\n3\n45 52 28\n... | [
"00:00:00 00:00:10\n06:14:56 06:32:09\n00:07:43 00:10:15\n05:17:40 05:21:03\n",
"00:00:00 00:00:10\n06:14:56 06:32:09\n00:07:43 00:10:15\n02:16:53 02:20:00\n",
"05:27:27 05:32:00\n06:14:56 06:32:09\n00:07:43 00:10:15\n02:16:53 02:20:00\n",
"05:27:27 05:32:00\n06:14:56 06:32:09\n07:49:49 07:56:03\n02:16:53 02:... |
CodeContests | problem
Information I want to paint a rectangular veneer board to make a signboard for the promotion of the Olympic Games. Some rectangular masking tapes are pre-attached to the veneer board where I do not want to paint. We decided to paint each area with a different color. For example, in the case of Figure 5-1 we us... | stdin | null | 4,591 | 1 | [
"15 6\n10\n1 4 5 6\n2 1 4 5\n1 0 5 1\n6 1 7 5\n7 5 9 6\n7 0 9 2\n9 1 10 5\n11 0 14 1\n12 1 13 5\n11 5 14 6\n0 0\n"
] | [
"5\n"
] | [
"15 6\n10\n1 4 5 6\n2 1 4 5\n1 0 5 1\n6 1 7 5\n7 5 3 6\n7 0 9 2\n9 1 10 5\n11 0 14 1\n12 1 13 5\n11 5 14 6\n0 0\n",
"15 6\n10\n1 4 5 6\n2 1 0 5\n1 0 5 1\n6 1 7 5\n7 5 3 6\n7 0 9 2\n9 1 10 5\n11 0 14 1\n12 1 13 5\n11 5 14 6\n0 0\n",
"15 6\n10\n1 4 5 6\n2 1 4 5\n1 0 5 1\n6 1 7 5\n7 5 9 6\n7 0 18 2\n9 1 10 5\n11 0... | [
"3\n",
"2\n",
"5\n",
"6\n",
"4\n",
"1\n",
"2\n",
"3\n",
"2\n",
"2\n"
] |
CodeContests | ICPC World Finals Day 2
Mr. Tee and his colleagues arrived at the airport terminal. From now on, I will transfer the plane and board the enemy land R country. Since we go through Country D, we have to exchange our money into two currencies.
Mr. Kay "How does Mr. Tee exchange money?"
Mr. Tee "Huff Huff Huff Huff Huff... | stdin | null | 3,971 | 1 | [
"M r\n"
] | [
"9333\n"
] | [
"L r\n",
"L q\n",
"M q\n",
"L p\n",
"M p\n",
"M o\n",
"N o\n",
"N n\n",
"O n\n",
"O m\n"
] | [
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n"
] |
CodeContests | A professor invented Cookie Breeding Machine for his students who like cookies very much.
When one cookie with the taste of x is put into the machine and a non-negative integer y less than or equal to 127 is input on the machine, it consumes the cookie and generates two cookies with the taste of y and (x XOR y).
Here... | stdin | null | 3,399 | 1 | [
"3\n3 1\n4 108\n1 10\n"
] | [
"255\n400\n10\n"
] | [
"3\n3 2\n4 108\n1 10\n",
"3\n3 0\n4 108\n1 10\n",
"3\n3 1\n4 98\n1 10\n",
"3\n1 1\n4 108\n1 10\n",
"3\n3 1\n4 108\n1 2\n",
"3\n3 1\n2 98\n1 10\n",
"3\n3 1\n4 50\n1 2\n",
"3\n3 2\n2 98\n1 10\n",
"3\n3 1\n4 75\n1 2\n",
"3\n3 2\n2 98\n1 9\n"
] | [
"256\n400\n10\n",
"254\n400\n10\n",
"255\n410\n10\n",
"1\n400\n10\n",
"255\n400\n2\n",
"255\n156\n10\n",
"255\n458\n2\n",
"256\n156\n10\n",
"255\n433\n2\n",
"256\n156\n9\n"
] |
CodeContests | There is a string S consisting of digits `1`, `2`, ..., `9`. Lunlun, the Dachshund, will take out three consecutive digits from S, treat them as a single integer X and bring it to her master. (She cannot rearrange the digits.)
The master's favorite number is 753. The closer to this number, the better. What is the mini... | stdin | null | 2,999 | 1 | [
"35753\n",
"1234567876\n",
"1111111111\n"
] | [
"0\n",
"34\n",
"642\n"
] | [
"43594\n",
"1133184093\n",
"1110111111\n",
"80343\n",
"1646883079\n",
"93622\n",
"978408132\n",
"120326\n",
"1514858721\n",
"226242\n"
] | [
"159\n",
"87\n",
"642\n",
"50\n",
"65\n",
"131\n",
"31\n",
"427\n",
"32\n",
"129\n"
] |
CodeContests | G: Palindromic Subsequences
problem
Given a string S consisting only of lowercase letters, find out how many subsequences of this string S are not necessarily continuous and are palindromes.
Here, a subsequence that is not necessarily continuous with S is an arbitrary selection of one or more characters | S | charac... | stdin | null | 3,776 | 1 | [
"acpc\n"
] | [
"5\n"
] | [
"ccpa\n",
"cnbc\n",
"emec\n",
"ccoa\n",
"aocc\n",
"pcca\n",
"ccao\n",
"pcda\n",
"ccbo\n",
"qcda\n"
] | [
"4\n",
"6\n",
"5\n",
"4\n",
"4\n",
"4\n",
"4\n",
"4\n",
"4\n",
"4\n"
] |
CodeContests | You have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan). In how many ways can we select some of these coins so that they are X yen in total?
Coins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that co... | stdin | null | 3,877 | 1 | [
"2\n2\n2\n100\n",
"30\n40\n50\n6000\n",
"5\n1\n0\n150\n"
] | [
"2\n",
"213\n",
"0\n"
] | [
"2\n2\n4\n100\n",
"30\n40\n77\n6000\n",
"5\n0\n0\n150\n",
"30\n47\n77\n6000\n",
"5\n0\n0\n0\n",
"2\n2\n5\n100\n",
"2\n2\n10\n100\n",
"30\n47\n77\n10696\n",
"5\n0\n1\n0\n",
"2\n0\n10\n100\n"
] | [
"2\n",
"293\n",
"0\n",
"319\n",
"1\n",
"2\n",
"2\n",
"0\n",
"1\n",
"1\n"
] |
CodeContests | Taro is an elementary school student who has just learned multiplication. Somehow, he likes multiplication, so when he sees numbers, he wants to multiply. He seems to like to do the following for integers greater than or equal to 0. (Processing flow)
* Procedure 1. If a certain integer n greater than or equal to 0 is ... | stdin | null | 34 | 1 | [
"2\n999999\n1000000\n",
"3\n9\n99\n123\n"
] | [
"12\n1\n",
"0\n2\n3\n"
] | [
"2\n999999\n1000100\n",
"3\n9\n99\n238\n",
"2\n999999\n1010100\n",
"3\n9\n99\n39\n",
"2\n999999\n1010110\n",
"3\n16\n120\n59\n",
"3\n16\n127\n59\n",
"3\n16\n127\n21\n",
"3\n16\n127\n5\n",
"3\n3\n127\n5\n"
] | [
"12\n2\n",
"0\n2\n4\n",
"12\n3\n",
"0\n2\n3\n",
"12\n5\n",
"1\n2\n3\n",
"1\n3\n3\n",
"1\n3\n1\n",
"1\n3\n0\n",
"0\n3\n0\n"
] |
CodeContests | Mehta is a forever alone and desperate guy. He has a crush on N girls of his society. He wants to impress them all and so he needs to do their task collectively.All the girls give him a number which he stores in an array named A of size N. To do their task, he has to report the number of triplets (i,j,k) in the array A... | stdin | null | 1,198 | 1 | [
"5\n21\n22\n23\n24\n25\n\nSAMPLE\n"
] | [
"10\n"
] | [
"5\n21\n22\n23\n24\n25\n\nELPMAS\n",
"5\n5\n22\n27\n24\n25\n\nELPMAS\n",
"5\n5\n22\n27\n31\n25\n\nELPMAS\n",
"5\n3\n11\n21\n34\n25\n\nESPNAL\n",
"5\n63\n22\n23\n2\n3\n\nSAMPLF\n",
"5\n21\n22\n27\n24\n25\n\nELPMAS\n",
"5\n3\n22\n27\n31\n25\n\nELPMAS\n",
"5\n3\n22\n27\n34\n25\n\nELPMAS\n",
"5\n3\n22\n... | [
"10\n",
"4\n",
"1\n",
"0\n",
"2\n",
"10\n",
"1\n",
"1\n",
"1\n",
"1\n"
] |
CodeContests | Problem A Secret of Chocolate Poles
Wendy, the master of a chocolate shop, is thinking of displaying poles of chocolate disks in the showcase. She can use three kinds of chocolate disks: white thin disks, dark thin disks, and dark thick disks. The thin disks are $1$ cm thick, and the thick disks are $k$ cm thick. Disk... | stdin | null | 1,737 | 1 | [
"5 3\n"
] | [
"6\n"
] | [
"5 4\n",
"2 4\n",
"4 4\n",
"7 4\n",
"7 3\n",
"11 3\n",
"7 2\n",
"17 3\n",
"31 3\n",
"25 3\n"
] | [
"4\n",
"1\n",
"3\n",
"7\n",
"11\n",
"32\n",
"14\n",
"142\n",
"4179\n",
"985\n"
] |
CodeContests | You are given a polynomial of degree N with integer coefficients: f(x)=a_Nx^N+a_{N-1}x^{N-1}+...+a_0. Find all prime numbers p that divide f(x) for every integer x.
Constraints
* 0 \leq N \leq 10^4
* |a_i| \leq 10^9(0\leq i\leq N)
* a_N \neq 0
* All values in input are integers.
Input
Input is given from Standard I... | stdin | null | 2,881 | 1 | [
"2\n7\n-7\n14\n",
"0\n998244353\n"
] | [
"2\n7\n",
"998244353\n"
] | [
"0\n1365261696\n",
"0\n754892205\n",
"0\n663325004\n",
"0\n130630416\n",
"0\n46502294\n",
"0\n41442548\n",
"0\n15639162\n",
"0\n1226279\n",
"0\n124557\n",
"0\n99361\n"
] | [
"2\n3\n43\n9187\n",
"3\n5\n41\n853\n1439\n",
"2\n29\n197\n29027\n",
"2\n3\n7\n388781\n",
"2\n31\n750037\n",
"2\n7\n401\n3691\n",
"2\n3\n7\n11\n33851\n",
"19\n233\n277\n",
"3\n41519\n",
"67\n1483\n"
] |
CodeContests | Atish is very talkative. He just doesn't stop speaking. Unfortunately for those around him, he's also a maths wiz, and befuddles anyone who dares speak to him. Annoyed with this, Souradeep asked him to shut up, to which Atish replied,
Take a number, x, find its factorial, remove the zeroes, and find the last digit. C... | stdin | null | 3,624 | 1 | [
"5\n\n0\n1\n24\n13\n87\n\nSAMPLE\n"
] | [
"1\n1\n6\n8\n4\n"
] | [
"5\n\n0\n1\n24\n13\n87\n\nRAMPLE\n",
"5\n\n1\n2\n24\n13\n87\n\nRAMPLE\n",
"5\n\n1\n2\n5\n13\n87\n\nRAMPLE\n",
"5\n\n1\n2\n5\n13\n150\n\nRAMPLE\n",
"5\n\n1\n4\n5\n13\n273\n\nRAMPLE\n",
"5\n\n1\n4\n3\n13\n273\n\nRAMOLE\n",
"5\n\n1\n4\n1\n13\n177\n\nRAMOLE\n",
"5\n\n1\n4\n1\n20\n177\n\nRAMOLE\n",
"5\n\... | [
"1\n1\n6\n8\n4\n",
"1\n2\n6\n8\n4\n",
"1\n2\n2\n8\n4\n",
"1\n2\n2\n8\n2\n",
"1\n4\n2\n8\n2\n",
"1\n4\n6\n8\n2\n",
"1\n4\n1\n8\n2\n",
"1\n4\n1\n4\n2\n",
"1\n4\n2\n4\n2\n",
"2\n4\n2\n8\n2\n"
] |
CodeContests | Diverta City is a new city consisting of N towns numbered 1, 2, ..., N.
The mayor Ringo is planning to connect every pair of two different towns with a bidirectional road. The length of each road is undecided.
A Hamiltonian path is a path that starts at one of the towns and visits each of the other towns exactly once... | stdin | null | 98 | 1 | [
"4\n",
"3\n"
] | [
"0 111 157 193\n111 0 224 239\n157 224 0 258\n193 239 258 0\n",
"0 6 15\n6 0 21\n15 21 0\n"
] | [
"2\n",
"6\n",
"7\n",
"8\n",
"10\n",
"1\n",
"5\n",
"9\n",
"001\n",
"010\n"
] | [
"0 1\n1 0\n",
"0 1 2 7 45 512\n1 0 4 14 90 1024\n2 4 0 28 180 2048\n7 14 28 0 315 3584\n45 90 180 315 0 6144\n512 1024 2048 3584 6144 0\n",
"0 1 2 7 45 512 9925\n1 0 4 14 90 1024 19850\n2 4 0 28 180 2048 39700\n7 14 28 0 315 3584 69475\n45 90 180 315 0 6144 119100\n512 1024 2048 3584 6144 0 198500\n9925 19850 3... |
CodeContests | We have a graph with N vertices, numbered 0 through N-1. Edges are yet to be added.
We will process Q queries to add edges. In the i-th (1≦i≦Q) query, three integers A_i, B_i and C_i will be given, and we will add infinitely many edges to the graph as follows:
* The two vertices numbered A_i and B_i will be connected... | stdin | null | 1,290 | 1 | [
"7 1\n5 2 1\n",
"2 1\n0 0 1000000000\n",
"5 3\n0 1 10\n0 2 10\n0 4 10\n"
] | [
"21\n",
"1000000001\n",
"42\n"
] | [
"7 1\n6 2 1\n",
"2 1\n0 0 1000000010\n",
"5 3\n0 0 10\n0 2 10\n0 4 10\n",
"9 1\n6 2 1\n",
"5 3\n0 0 10\n0 3 10\n0 4 10\n",
"9 1\n7 2 1\n",
"9 1\n5 2 1\n",
"7 1\n5 4 1\n",
"2 1\n0 0 0000000000\n",
"5 3\n0 1 10\n1 2 10\n0 4 10\n"
] | [
"22\n",
"1000000011\n",
"43\n",
"36\n",
"44\n",
"37\n",
"39\n",
"31\n",
"1\n",
"42\n"
] |
CodeContests | Consider a binary tree whose leaves are assigned integer weights. Such a tree is called balanced if, for every non-leaf node, the sum of the weights in its left subtree is equal to that in the right subtree. For instance, the tree in the following figure is balanced.
<image>
Figure I.1. A balanced tree
A balanced tr... | stdin | null | 4,675 | 1 | [
"9\n3 4 1 3 1 2 4 4 6\n4\n3 12 6 3\n10\n10 9 8 7 6 5 4 3 2 1\n11\n10 9 8 7 6 5 4 3 2 1 1\n8\n1 1 1 1 1 1 1 1\n0\n"
] | [
"6\n2\n1\n5\n8\n"
] | [
"9\n3 4 2 3 1 2 4 4 6\n4\n3 12 6 3\n10\n10 9 8 7 6 5 4 3 2 1\n11\n10 9 8 7 6 5 4 3 2 1 1\n8\n1 1 1 1 1 1 1 1\n0\n",
"9\n3 4 2 3 1 2 4 4 6\n4\n3 12 6 3\n10\n10 9 8 7 6 5 4 3 2 1\n11\n10 9 8 7 6 10 4 3 2 1 1\n8\n2 1 1 1 1 1 1 1\n0\n",
"9\n3 4 2 3 1 2 4 4 6\n4\n3 12 6 3\n10\n10 9 8 7 6 5 4 3 2 1\n11\n10 9 8 7 6 10... | [
"5\n2\n1\n5\n8\n",
"5\n2\n1\n5\n7\n",
"5\n2\n1\n4\n7\n",
"5\n2\n1\n1\n5\n8\n",
"5\n2\n4\n5\n7\n",
"5\n2\n1\n1\n4\n8\n",
"5\n2\n3\n5\n7\n",
"5\n2\n1\n1\n5\n1\n1\n1\n1\n",
"5\n2\n1\n1\n4\n1\n1\n1\n1\n",
"3\n2\n3\n5\n7\n"
] |
CodeContests | Create a program that inputs the test result data of the visual acuity test and outputs the number of people who apply to each judgment based on the following visual acuity judgment table for each of the left and right eyesight.
Judgment | Sight
--- | ---
A | 1.1 or above
B | 0.6 or more and less than 1.1
C | 0.2 or m... | stdin | null | 1,292 | 1 | [
"1.0 1.2\n0.8 1.5\n1.2 0.7\n2.0 2.0\n"
] | [
"2 3\n2 1\n0 0\n0 0\n"
] | [
"1.0 1.2\n0.8 1.5\n1.2 0.7\n2.0 2.1903643288076555\n",
"1.0 1.6960573379527397\n1.4596389610615816 1.5471720124202895\n1.2 0.7\n2.751284804693524 2.1903643288076555\n",
"1.4450818768746183 1.6960573379527397\n2.61268179406582 1.5471720124202895\n2.573217216239934 0.7\n4.9346769267643475 2.1903643288076555\n",
... | [
"2 3\n2 1\n0 0\n0 0\n",
"3 3\n1 1\n0 0\n0 0\n",
"4 3\n0 1\n0 0\n0 0\n",
"4 4\n0 0\n0 0\n0 0\n",
"2 3\n2 1\n0 0\n0 0\n",
"2 3\n2 1\n0 0\n0 0\n",
"2 3\n2 1\n0 0\n0 0\n",
"2 3\n2 1\n0 0\n0 0\n",
"3 3\n1 1\n0 0\n0 0\n",
"3 3\n1 1\n0 0\n0 0\n"
] |
CodeContests | There is a grid with H horizontal rows and W vertical columns. Let (i, j) denote the square at the i-th row from the top and the j-th column from the left.
In the grid, N Squares (r_1, c_1), (r_2, c_2), \ldots, (r_N, c_N) are wall squares, and the others are all empty squares. It is guaranteed that Squares (1, 1) and ... | stdin | null | 2,520 | 1 | [
"5 2 2\n2 1\n4 2\n",
"100000 100000 1\n50000 50000\n",
"3 4 2\n2 2\n1 4\n",
"5 5 4\n3 1\n3 5\n1 3\n5 3\n"
] | [
"0\n",
"123445622\n",
"3\n",
"24\n"
] | [
"5 2 0\n2 1\n4 2\n",
"100000 100000 1\n50000 23836\n",
"3 4 2\n2 2\n2 4\n",
"100000 100000 1\n50000 25003\n",
"3 4 2\n2 2\n2 8\n",
"5 4 2\n2 1\n4 2\n",
"3 4 2\n2 3\n1 4\n",
"5 5 4\n3 1\n3 5\n1 3\n4 3\n",
"9 2 0\n2 1\n4 2\n",
"100000 100000 1\n50000 29731\n"
] | [
"5\n",
"920202332\n",
"2\n",
"717307015\n",
"4\n",
"12\n",
"3\n",
"14\n",
"9\n",
"587968146\n"
] |
CodeContests | One day, Takahashi was given the following problem from Aoki:
* You are given a tree with N vertices and an integer K. The vertices are numbered 1 through N. The edges are represented by pairs of integers (a_i, b_i).
* For a set S of vertices in the tree, let f(S) be the minimum number of the vertices in a subtree of ... | stdin | null | 1,573 | 1 | [
"3\n1 2\n2 3\n",
"4\n1 2\n1 3\n1 4\n",
"7\n1 2\n2 3\n2 4\n4 5\n4 6\n6 7\n"
] | [
"3\n7\n3\n",
"4\n15\n13\n4\n",
"7\n67\n150\n179\n122\n45\n7\n"
] | [
"7\n1 4\n2 3\n2 4\n4 5\n4 6\n6 7\n",
"7\n1 4\n2 3\n2 1\n4 5\n4 6\n6 7\n",
"7\n1 2\n4 3\n2 6\n4 5\n4 6\n6 7\n",
"4\n1 2\n1 3\n2 4\n",
"3\n1 3\n2 3\n",
"7\n1 4\n4 3\n2 6\n6 5\n4 6\n6 7\n",
"7\n1 2\n2 3\n2 4\n6 5\n4 6\n6 7\n",
"7\n1 4\n2 3\n2 1\n4 5\n3 6\n4 7\n",
"7\n1 4\n2 5\n3 2\n7 5\n4 6\n6 7\n",
... | [
"7\n65\n145\n175\n121\n45\n7\n",
"7\n71\n160\n189\n127\n46\n7\n",
"7\n67\n150\n179\n122\n45\n7\n",
"4\n16\n14\n4\n",
"3\n7\n3\n",
"7\n63\n140\n169\n117\n44\n7\n",
"7\n69\n155\n183\n123\n45\n7\n",
"7\n73\n165\n193\n128\n46\n7\n",
"7\n77\n175\n203\n133\n47\n7\n",
"7\n69\n155\n185\n126\n46\n7\n"
] |
CodeContests | Chandan, our problem moderator, recently got a digital clock as a birthday present. A digital clock shows time in the format HH:MM:SS, where HH, MM, SS represents hours , minutes, and seconds respectively. It is a 24 hour clock and so the day starts at 00:00:00 hours while it ends at 23:59:59.
We all know how punctual... | stdin | null | 3,982 | 1 | [
"2\n23 59 58\n23 46 22\n\nSAMPLE\n"
] | [
"0:2\n1:408\n"
] | [
"2\n23 59 58\n23 46 22\n\nSAMPLD\n",
"2\n23 59 58\n23 46 32\n\nSAMPLD\n",
"2\n23 59 58\n23 46 27\n\nSAMPLE\n",
"2\n23 59 58\n9 46 27\n\nSAMPLE\n",
"2\n23 4 58\n9 46 27\n\nSAMPLE\n",
"2\n23 2 58\n9 46 27\n\nSAMPLE\n",
"2\n23 2 58\n9 46 45\n\nSAMPLE\n",
"2\n23 2 58\n9 46 58\n\nSAMPLE\n",
"2\n23 2 59\n... | [
"0:2\n1:408\n",
"0:2\n1:807\n",
"0:2\n1:812\n",
"0:2\n8381:42832\n",
"3:1648\n8381:42832\n",
"3:1708\n8381:42832\n",
"3:1708\n8381:42814\n",
"3:1708\n8381:42801\n",
"6:3415\n8381:42801\n",
"6:3415\n8381:42850\n"
] |
CodeContests | The hero of this story is a toddler named BooBoo. Inspired by the legendary competitive coder Gena, BooBoo has also started preparing to race to the top of the ranks.
BooBoo is going to practice N different problems in the exact given order over the next M days. For each problem, he writes down the amount of time q_i ... | stdin | null | 1,671 | 1 | [
"5 3\n1 2 2 1 3\n\nSAMPLE\n"
] | [
"3\n"
] | [
"680 478\n27436 32744 23403 9394 31389 21512 9460 3738 8344 4419 20737 2938 8741 12881 20986 23654 13084 30328 6555 23930 27450 21075 22183 7357 4469 24019 15067 22603 12685 25475 23841 10164 12260 29968 3079 21663 20367 10504 9327 9907 24237 26082 16520 9911 31991 24127 21245 7415 12441 8815 620 20202 15681 27447 ... | [
"32744\n",
"6\n",
"35910\n",
"11\n",
"42850\n",
"45819\n",
"51389\n",
"61610\n",
"71594\n",
"90844\n"
] |
CodeContests | Write a program which manipulates a sequence A = {a0, a1, . . . , an-1} with the following operations:
* find(s, t): report the minimum element in as, as+1, . . . ,at.
* update(i, x): change ai to x.
Note that the initial values of ai (i = 0, 1, . . . , n−1) are 231-1.
Constraints
* 1 ≤ n ≤ 100000
* 1 ≤ q ≤ 10000... | stdin | null | 1,033 | 1 | [
"3 5\n0 0 1\n0 1 2\n0 2 3\n1 0 2\n1 1 2\n",
"1 3\n1 0 0\n0 0 5\n1 0 0\n"
] | [
"1\n2\n",
"2147483647\n5\n"
] | [
"1 3\n1 -1 0\n0 0 5\n1 0 0\n",
"3 5\n0 0 1\n0 1 2\n0 2 3\n1 0 2\n1 1 4\n",
"1 3\n1 -1 0\n0 0 9\n1 0 0\n",
"3 5\n0 0 1\n0 2 2\n0 2 3\n1 0 2\n1 1 2\n",
"1 3\n1 -1 0\n0 0 5\n0 0 0\n",
"1 3\n1 -1 0\n0 0 15\n1 0 0\n",
"3 5\n0 0 1\n0 2 2\n0 2 3\n1 0 2\n0 1 2\n",
"3 5\n0 0 1\n0 0 2\n0 2 6\n1 0 2\n1 1 4\n",
... | [
"2147483647\n5\n",
"1\n2\n",
"2147483647\n9\n",
"1\n3\n",
"2147483647\n",
"2147483647\n15\n",
"1\n",
"2\n6\n",
"2\n",
"2147483647\n4\n"
] |
CodeContests | White Tiger University holds a programming contest every year. The contest starts with a score of 0 for all teams, and points are added according to the answer status. In this contest, rankings will be made in descending order of score. When the total number of teams is N, each team is assigned a number from 1 to N. If... | stdin | null | 463 | 1 | [
"3 11\n0 2 5\n0 1 5\n0 3 4\n1 1\n1 2\n1 3\n0 3 2\n1 1\n0 2 1\n1 2\n1 3\n",
"5 2\n1 1\n1 2\n"
] | [
"1 5\n2 5\n3 4\n3 6\n3 6\n1 5\n",
"1 0\n2 0\n"
] | [
"3 11\n0 2 5\n0 1 5\n0 3 6\n1 1\n1 2\n1 3\n0 3 2\n1 1\n0 2 1\n1 2\n1 3\n",
"3 11\n0 2 5\n0 1 5\n0 3 8\n1 1\n1 2\n1 3\n0 3 2\n1 1\n0 2 1\n1 2\n1 3\n",
"3 10\n0 2 5\n0 1 5\n0 3 6\n1 1\n1 2\n1 3\n0 3 2\n1 1\n0 2 1\n1 2\n1 3\n",
"3 11\n0 2 5\n0 1 5\n0 3 3\n1 1\n1 2\n1 3\n0 3 2\n1 1\n0 2 1\n1 2\n1 3\n",
"8 2\n1 ... | [
"3 6\n1 5\n2 5\n3 8\n2 6\n1 5\n",
"3 8\n1 5\n2 5\n3 10\n2 6\n1 5\n",
"3 6\n1 5\n2 5\n3 8\n2 6\n",
"1 5\n2 5\n3 3\n1 5\n1 5\n3 5\n",
"1 0\n2 0\n",
"3 6\n1 5\n2 5\n3 7\n2 6\n1 5\n",
"3 6\n1 5\n",
"3 6\n",
"1 5\n",
"3 8\n2 7\n1 5\n3 10\n2 8\n1 5\n"
] |
CodeContests | Everyone has got to know that HELL and Printf{} use cheats while playing Counter-Strike 1.6. Everyone decides to give them a punishment.
They are going to be made to paint all the rooms of the ground floor of the hostel.
There are a total of N rooms on the ground floor arranged in a single row side by side numbered f... | stdin | null | 2,122 | 1 | [
"2\n2 1\n3 2\n\nSAMPLE\n"
] | [
"81\n891\n"
] | [
"2\n2 1\n3 1\n\nSAMPLE\n",
"2\n2 1\n4 2\n",
"2\n2 1\n7 2\n",
"2\n4 1\n3 1\n\nS@MPLE\n",
"2\n4 1\n5 1\n\nFLPS@M\n",
"2\n2 1\n4 3\n",
"2\n4 1\n7 2\n",
"2\n4 2\n3 2\n\nSANPLE\n",
"2\n4 1\n7 1\n",
"2\n4 2\n6 2\n\nSANPLE\n"
] | [
"81\n891\n",
"81\n9801\n",
"81\n9899901\n",
"8991\n891\n",
"8991\n89991\n",
"81\n8991\n",
"8991\n9899901\n",
"9801\n891\n",
"8991\n8999991\n",
"9801\n989901\n"
] |
CodeContests | Given are N pairwise distinct non-negative integers A_1,A_2,\ldots,A_N. Find the number of ways to choose a set of between 1 and K numbers (inclusive) from the given numbers so that the following two conditions are satisfied:
* The bitwise AND of the chosen numbers is S.
* The bitwise OR of the chosen numbers is T.
C... | stdin | null | 4,777 | 1 | [
"3 3 0 3\n1 2 3\n",
"5 3 1 7\n3 4 9 1 5\n",
"5 4 0 15\n3 4 9 1 5\n"
] | [
"2\n",
"2\n",
"3\n"
] | [
"3 3 0 3\n0 2 3\n",
"5 4 0 15\n3 6 9 1 5\n",
"3 3 0 6\n0 2 3\n",
"5 4 1 15\n3 11 1 0 5\n",
"5 3 1 7\n3 4 9 0 5\n",
"5 4 0 15\n3 4 9 1 1\n",
"5 4 0 15\n3 6 1 1 8\n",
"5 5 1 7\n3 4 9 1 5\n",
"5 5 1 7\n3 4 11 1 5\n",
"5 4 1 15\n3 6 9 1 5\n"
] | [
"2\n",
"7\n",
"0\n",
"4\n",
"1\n",
"3\n",
"6\n",
"2\n",
"2\n",
"2\n"
] |
CodeContests | JOI is playing with a nail in the board. As shown in the figure below, JOI stabbed nails in the shape of an equilateral triangle with N sides. A nails are lined up in the ath line (1 ≤ a ≤ N) from the top. The bth nail (1 ≤ b ≤ a) from the left is represented by (a, b).
<image>
Figure 1: Arrangement of nails (when N =... | stdin | null | 5,021 | 1 | [
"None\n",
"5 2\n2 2 1\n2 1 3\n"
] | [
"None\n",
"12\n"
] | [
"Npne\n",
"5 2\n2 1 1\n2 1 3\n",
"Nnpe\n",
"9 2\n2 1 1\n2 1 3\n",
"Nope\n",
"1 2\n2 1 1\n2 1 3\n",
"Nopd\n",
"1 2\n2 1 1\n2 2 3\n",
"dpoN\n",
"1 2\n2 1 1\n2 2 0\n"
] | [
"0\n",
"10\n",
"0\n",
"10\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n"
] |
CodeContests | There are twelve types of tiles in Fig. 1. You were asked to fill a table with R × C cells with these tiles. R is the number of rows and C is the number of columns.
How many arrangements in the table meet the following constraints?
* Each cell has one tile.
* the center of the upper left cell (1,1) and the center of... | stdin | null | 863 | 1 | [
"3 3\n0 1 1 0 0 0 0 0 0 0 0 7\n",
"2 4\n0 0 1 1 1 2 0 1 0 0 1 1\n",
"3 3\n0 0 0 0 0 0 0 0 0 0 0 10\n",
"3 3\n4 2 2 0 0 0 0 0 0 0 0 1\n",
"5 2\n0 1 1 1 0 1 2 1 2 0 0 1\n"
] | [
"66\n",
"2012\n",
"1\n",
"2\n",
"8512\n"
] | [
"4 4\n0 0 1 1 1 2 0 1 0 0 1 1\n",
"3 3\n0 0 1 0 0 0 0 0 0 0 0 10\n",
"3 3\n0 2 1 0 0 0 0 0 0 0 0 7\n",
"2 4\n0 0 1 1 1 3 0 1 0 0 1 1\n",
"5 2\n1 1 1 1 0 1 2 1 2 0 0 1\n",
"4 2\n0 1 1 0 0 1 2 0 2 0 0 1\n",
"5 2\n1 1 1 1 0 1 2 2 2 0 0 1\n",
"2 3\n1 0 1 1 0 2 0 1 0 0 1 0\n",
"5 2\n1 0 1 1 0 1 2 2 2 0 0... | [
"0\n",
"10\n",
"306\n",
"5057\n",
"36772\n",
"94\n",
"305409\n",
"248\n",
"22867\n",
"62\n"
] |
CodeContests | After Governor's attack on prison, Rick found himself surrounded by walkers. They are coming towards him from all sides. Now, suppose Rick have infinite number of bullets with him. Suppose Rick need 1 bullet to kill each walker (yeah he is good in killing walkers. They need to be shot at head. See, how good he is). Now... | stdin | null | 1,319 | 1 | [
"2\n5\n2 4 2 5 6\n4\n2 2 2 2\n\nSAMPLE\n"
] | [
"Rick now go and save Carl and Judas\nGoodbye Rick\n2\n"
] | [
"2\n5\n2 4 2 5 6\n4\n4 2 2 2\n\nSAMPLE\n",
"2\n5\n2 4 2 5 6\n4\n4 3 2 2\n\nSAMPLE\n",
"2\n5\n0 4 2 5 6\n4\n4 3 2 2\n\nSAMPLE\n",
"2\n5\n0 4 0 5 6\n4\n4 0 2 2\n\nSAMPLE\n",
"2\n0\n0 7 1 1 37\n6\n-1 -2 0 -2\n\nSFLPLA\n",
"2\n21\n1 7 1 1 17\n8\n-1 1 0 0\n\nSFLPLA\n",
"2\n5\n2 2 2 5 6\n1\n3 2 2 1\n\nSAMPLE\... | [
"Rick now go and save Carl and Judas\nGoodbye Rick\n2\n",
"Rick now go and save Carl and Judas\nRick now go and save Carl and Judas\n",
"Goodbye Rick\n0\nRick now go and save Carl and Judas\n",
"Goodbye Rick\n0\nGoodbye Rick\n0\n",
"Rick now go and save Carl and Judas\nGoodbye Rick\n0\n",
"Goodbye Rick\n1... |
CodeContests | A young mischievous boy Harsh, got into a trouble when his mechanical workshop teacher
told him to cut Iron rods.
The rod cutting algorithm is as follows:
Step 1. If the rod can be divided into two equal parts, cut it and choose any one of them.
Step 2. Else cut the rod into two parts having non-zero integral ... | stdin | null | 5,044 | 1 | [
"2\n3\n2\n\nSAMPLE\n"
] | [
"1\n0\n"
] | [
"10\n977\n543\n252\n979\n348\n398\n876\n55\n938\n610\n",
"1000\n637440000\n497933618\n104308126\n54379600\n735895362\n146758511\n172457069\n786824866\n792402682\n2932951\n280042089\n190772473\n647479785\n613419369\n465129597\n173755079\n611820068\n311399952\n18559\n244257083\n243465884\n889140268\n511454427\n6562... | [
"8\n8\n6\n8\n7\n7\n8\n4\n8\n8\n",
"28\n27\n25\n24\n28\n26\n26\n28\n28\n20\n27\n26\n28\n28\n27\n26\n28\n27\n13\n26\n26\n28\n27\n28\n21\n25\n24\n26\n27\n27\n26\n27\n28\n26\n24\n28\n28\n25\n27\n27\n28\n23\n27\n27\n27\n27\n28\n27\n27\n28\n27\n28\n26\n28\n28\n27\n24\n28\n27\n28\n28\n28\n28\n28\n28\n26\n27\n28\n28\n28\... |
CodeContests | You want to repaint your house entirely for an upcoming occasion. The total area of your house is D units. There are a total of N workers. The i^th worker has his available time Ti, hiring cost Xi and speed Yi. This means that he is available for hiring from time Ti and remains available ever since. Once available, yo... | stdin | null | 3,946 | 1 | [
"3 3\n1 1 1\n2 2 2\n3 1 5\n\nSAMPLE\n"
] | [
"3\n"
] | [
"3 3\n1 1 1\n2 2 3\n3 1 5\n\nSAMPLE\n",
"3 3\n1 1 1\n2 2 1\n6 1 5\n\nSAMPLE\n",
"2 3\n1 2 1\n1 2 1\n6 1 5\n\nSAMPLE\n",
"3 2\n1 1 1\n2 4 2\n3 1 5\n\nSAMQEL\n",
"3 3\n1 0 1\n2 2 -1\n6 2 5\n\nSAMPLE\n",
"3 2\n1 1 0\n2 4 2\n3 1 5\n\nSAMQEL\n",
"3 3\n1 -1 1\n4 2 -1\n6 2 5\n\nSAMPLE\n",
"3 4\n0 -2 2\n4 3 -... | [
"3\n",
"1\n",
"2\n",
"5\n",
"0\n",
"4\n",
"-1\n",
"-2\n",
"10\n",
"6\n"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.