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 | The morning of office workers is early. When I went through the elite course, joined a first-class company, and graduated from the title of newcomer, the resignation I received was a business activity on an undeveloped planet. I have been forced to live inconveniently in a remote area, but for the time being, it is not... | stdin | null | 4,712 | 1 | [
"22 5\n0 0\n0 1\n0 2\n0 3\n0 4\n2 1\n2 2\n2 3\n2 4\n2 5\n0 5\n2 1\n0 6\n2 2\n3 3\n2 2\n2 2\n1 2\n2 2\n2 1\n2 2\n2 3\n30 5\n0 383594529\n1 1\n0 868094164\n0 708344471\n0 4102559\n0 944076771\n0 320398558\n1 1\n0 949521499\n0 1035499529\n0 585547493\n0 915496840\n0 721553343\n0 405934659\n0 814301872\n1 1\n2 3\n0 919... | [
"0\n1\n2\n3\n4\n1\n3\n4\n4\n5\n2\n5\n6\nend\n405934659\n405934659\n69231610\n373477673\n842917649\n961543702\n907959899\nend\n1\n586879203\n154183395\n435126242\n383123551\n163044554\n105612613\n725050544\n559442328\nend\n"
] | [
"22 5\n0 0\n0 1\n0 2\n0 3\n0 4\n2 1\n2 3\n2 3\n2 4\n2 5\n0 5\n2 1\n0 6\n2 2\n3 3\n2 2\n2 2\n1 2\n2 2\n2 1\n2 2\n2 3\n30 5\n0 383594529\n1 1\n0 868094164\n0 708344471\n0 4102559\n0 944076771\n0 320398558\n1 1\n0 949521499\n0 1035499529\n0 585547493\n0 915496840\n0 721553343\n0 405934659\n0 814301872\n1 1\n2 3\n0 919... | [
"0\n2\n2\n3\n4\n1\n3\n4\n4\n5\n2\n5\n6\nend\n405934659\n405934659\n69231610\n373477673\n842917649\n961543702\n907959899\nend\n1\n586879203\n154183395\n435126242\n383123551\n163044554\n105612613\n725050544\n559442328\nend\n",
"0\n1\n2\n3\n4\n1\n3\n4\n4\n5\n2\n5\n6\nend\n405934659\n405934659\n69231610\n842917649\n8... |
CodeContests | Training is indispensable for achieving good results at ICPC. Rabbit wants to win at ICPC, so he decided to practice today as well.
Today's training is to improve reflexes and memory by performing whac-a-mole many times. I want to hit the moles that come out one after another and get as many points as possible.
The p... | stdin | null | 4,048 | 1 | [
"1 7 20 90\n55 5 73\n",
"10 2 1000 2000\n400 300 1\n600 200 1\n700 800 1\n700 500 1\n900 600 1\n1000 700 1\n1300 900 1\n1400 400 1\n1500 1000 1\n2000 100 1\n",
"3 10 150 250\n100 20 123\n201 10 67\n202 10 45\n"
] | [
"73\n",
"10\n",
"190\n"
] | [
"1 7 20 64\n55 5 73\n",
"10 2 1000 2000\n400 300 1\n600 200 1\n700 800 1\n700 500 1\n900 600 1\n1000 700 1\n1300 900 1\n1400 233 1\n1500 1000 1\n2000 100 1\n",
"3 10 150 250\n100 20 123\n201 10 32\n202 10 45\n",
"1 7 20 64\n55 1 73\n",
"3 10 135 250\n100 20 146\n201 10 32\n202 10 45\n",
"3 10 135 250\n100... | [
"73\n",
"9\n",
"168\n",
"0\n",
"191\n",
"231\n",
"8\n",
"7\n",
"263\n",
"218\n"
] |
CodeContests | We have A balls with the string S written on each of them and B balls with the string T written on each of them.
From these balls, Takahashi chooses one with the string U written on it and throws it away.
Find the number of balls with the string S and balls with the string T that we have now.
Constraints
* S, T, and ... | stdin | null | 1,242 | 1 | [
"red blue\n3 4\nred\n",
"red blue\n5 5\nblue\n"
] | [
"2 4\n",
"5 4\n"
] | [
"red blue\n3 2\nred\n",
"red blte\n3 0\nred\n",
"red blue\n5 0\nred\n",
"red blue\n7 0\nred\n",
"red blue\n5 1\nred\n",
"red blue\n0 0\nred\n",
"red blte\n3 4\nred\n",
"red blue\n1 0\nred\n",
"red blue\n11 0\nred\n",
"red blue\n-1 0\nred\n"
] | [
"2 2\n",
"2 0\n",
"4 0\n",
"6 0\n",
"4 1\n",
"-1 0\n",
"2 4\n",
"0 0\n",
"10 0\n",
"-2 0\n"
] |
CodeContests | You are given a sequence of N integers: A_1,A_2,...,A_N.
Find the number of permutations p_1,p_2,...,p_N of 1,2,...,N that can be changed to A_1,A_2,...,A_N by performing the following operation some number of times (possibly zero), modulo 998244353:
* For each 1\leq i\leq N, let q_i=min(p_{i-1},p_{i}), where p_0=p_N... | stdin | null | 414 | 1 | [
"3\n1\n2\n1\n",
"8\n4\n4\n4\n1\n1\n1\n2\n2\n",
"6\n1\n1\n6\n2\n2\n2\n",
"5\n3\n1\n4\n1\n5\n"
] | [
"2\n",
"24\n",
"0\n",
"0\n"
] | [
"8\n4\n4\n4\n1\n2\n1\n2\n2\n",
"5\n3\n1\n4\n2\n5\n",
"6\n4\n1\n1\n2\n2\n4\n",
"6\n1\n1\n1\n2\n2\n2\n",
"6\n1\n1\n1\n2\n2\n1\n",
"6\n1\n1\n1\n1\n2\n1\n",
"6\n1\n1\n1\n1\n1\n1\n",
"3\n1\n1\n1\n",
"8\n4\n4\n5\n1\n1\n1\n2\n3\n",
"5\n1\n2\n2\n1\n1\n"
] | [
"0\n",
"1\n",
"2\n",
"24\n",
"72\n",
"120\n",
"720\n",
"6\n",
"18\n",
"12\n"
] |
CodeContests | Nobuo-kun and Shizuo-kun are playing a game of competing for territories on a rectangular island. As shown in Fig. 1 below, the entire island is made up of square compartments divided in a grid pattern, and the profits and losses resulting from these are indicated by integers.
<image>
In this game, move one piece t... | stdin | null | 4,313 | 1 | [
"5 4\n5 3 2 -5 2\n2 -4 2 8 -4\n2 3 -7 6 7\n3 -4 10 -3 -3\n",
"2 1\n-2 1\n",
"2 2\n2 -3\n3 -1\n"
] | [
"5\n",
"1\n",
"3\n"
] | [
"5 4\n5 6 2 -5 2\n2 -4 2 8 -4\n2 3 -7 6 7\n3 -4 10 -3 -3\n",
"0 1\n-2 1\n",
"5 4\n5 6 2 -5 2\n2 -4 2 8 -4\n2 3 -7 6 7\n1 -4 10 -3 -3\n",
"1 1\n-2 1\n",
"5 4\n5 6 2 -5 2\n2 -4 2 13 -4\n2 3 -7 6 7\n1 -4 10 -3 -3\n",
"5 4\n1 6 2 -5 2\n2 -4 2 13 -4\n2 3 -7 6 7\n1 -4 10 -3 -3\n",
"1 1\n-1 2\n",
"1 1\n-4 2\... | [
"8\n",
"0\n",
"10\n",
"2\n",
"15\n",
"11\n",
"1\n",
"4\n",
"5\n",
"9\n"
] |
CodeContests | Takahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.
A game is played by N players, numbered 1 to N. At the beginning of a game, each player has K poi... | stdin | null | 4,187 | 1 | [
"6 5 4\n3\n1\n3\n2\n",
"10 13 15\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n",
"6 3 4\n3\n1\n3\n2\n"
] | [
"Yes\nYes\nYes\nYes\nYes\nYes\n",
"No\nNo\nNo\nNo\nYes\nNo\nNo\nNo\nYes\nNo\n",
"No\nNo\nYes\nNo\nNo\nNo\n"
] | [
"6 1 4\n3\n1\n3\n2\n",
"10 8 15\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n",
"6 3 4\n3\n1\n3\n4\n",
"19 8 15\n3\n1\n4\n1\n5\n0\n2\n6\n5\n3\n5\n8\n9\n7\n9\n",
"37 8 15\n3\n0\n4\n1\n5\n0\n2\n6\n5\n6\n5\n8\n1\n7\n13\n",
"6 5 4\n3\n0\n3\n2\n",
"8 1 4\n3\n1\n0\n2\n",
"10 1 1\n3\n1\n0\n2\n",
"18 8 15\... | [
"No\nNo\nNo\nNo\nNo\nNo\n",
"No\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\n",
"No\nNo\nYes\nNo\nNo\nNo\n",
"No\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\n",
"No\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo\nNo... |
CodeContests | Today is Vasya's birthday. On this special occasion, he has organized a party for all of his friends. These friends are enumerated by integers from 1 to N. Each of Vasya's friends has a Knowledge Level. In addition, each of them knows an arbitrary number of other people at the party. This friendship is bidirectional an... | stdin | null | 3,870 | 1 | [
"5 4\n1 2 3 4 5\n1 2\n2 3\n3 4\n4 5\n\nSAMPLE\n"
] | [
"1\n"
] | [
"5 4\n1 2 3 4 5\n1 2\n2 3\n3 3\n4 5\n\nSAMPLE\n",
"5 4\n1 1 3 3 5\n1 2\n3 3\n3 3\n4 5\n\nSAMPLE\n",
"5 2\n1 1 1 0 2\n1 3\n2 3\n5 0\n0 0\n\nFLPMAS\n",
"5 4\n1 1 3 4 5\n1 2\n2 3\n3 3\n4 5\n\nSAMPLE\n",
"5 4\n1 1 3 3 5\n1 2\n2 3\n3 3\n4 5\n\nSAMPLE\n",
"5 4\n1 1 6 3 5\n1 2\n3 3\n3 3\n4 5\n\nSAMPLE\n",
"5 4... | [
"1\n",
"2\n",
"3\n",
"1\n",
"1\n",
"2\n",
"1\n",
"1\n",
"1\n",
"1\n"
] |
CodeContests | You have been given an integer array A and a number K. Now, you need to find out whether any two different elements of the array A sum to the number K. Two elements are considered to be different if they lie at different positions in the array. If there exists such a pair of numbers, print "YES" (without quotes), else ... | stdin | null | 2,355 | 1 | [
"5 9\n1 2 3 4 5\n\nSAMPLE\n"
] | [
"YES\n"
] | [
"5 9\n1 2 3 1 5\n\nSAMPLE\n",
"5 9\n2 2 3 4 5\n\nSAMPLE\n",
"5 10\n1 2 3 1 5\n\nSAMPLE\n",
"5 10\n1 2 3 2 5\n\nSAMPLE\n",
"5 10\n1 2 3 2 5\n\nSEMPLA\n",
"5 10\n1 2 0 2 5\n\nSEMPLA\n",
"1 9\n1 2 3 1 5\n\nSAMPLE\n",
"5 10\n1 2 3 1 5\n\nSBMPLE\n",
"1 9\n2 2 3 1 5\n\nSAMPLE\n",
"1 9\n0 2 3 1 5\n\nSAMP... | [
"NO\n",
"YES\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n"
] |
CodeContests | Relative B man came to A child's house. He is 3 years old and loves singing. He is singing the song "Kobutanuki Tsuneko" (written and composed by Naozumi Yamamoto), which he learned from kindergarten. In this song, the four words "kobuta," "raccoon dog," "fox," and "cat" are arranged in order, and the last and first so... | stdin | null | 1,096 | 1 | [
"5\napple\nyellow\ngeorgia\nking\nemail\n7\napple\nyellow\ngeorgia\nking\nemail\nwink\nlucky\n0\n"
] | [
"NG\nOK\n"
] | [
"5\napple\nyellow\ngeorgia\ngnik\nemail\n7\napple\nyellow\ngeorgia\nking\nemail\nwink\nlucky\n0\n",
"5\napple\nyellow\ngeorgia\ngnik\nemail\n7\napple\nzellow\ngeorgia\nking\nemail\nwink\nlucky\n0\n",
"5\napple\noellyw\ngeorgia\ngink\nlibme\n0\napplf\nzelmow\ngeorgia\nkgnj\nembil\nxink\nlkcuy\n0\n",
"5\napple\... | [
"NG\nOK\n",
"NG\nNG\n",
"NG\n",
"NG\nNG\n",
"NG\nNG\n",
"NG\nNG\n",
"NG\nNG\n",
"NG\nOK\n",
"NG\nNG\n",
"NG\nNG\n"
] |
CodeContests | There is a tree with N vertices. The vertices are numbered 1 through N. The i-th edge (1 \leq i \leq N - 1) connects Vertex x_i and y_i. For vertices v and w (1 \leq v, w \leq N), we will define the distance between v and w d(v, w) as "the number of edges contained in the path v-w".
A squirrel lives in each vertex of ... | stdin | null | 1,447 | 1 | [
"3\n1 2\n2 3\n",
"6\n1 2\n1 3\n1 4\n2 5\n2 6\n",
"7\n1 2\n6 3\n4 5\n1 7\n1 5\n2 3\n",
"4\n1 2\n1 3\n1 4\n"
] | [
"3\n",
"36\n",
"396\n",
"11\n"
] | [
"3\n1 2\n1 3\n",
"6\n1 2\n1 3\n1 4\n2 5\n2 10\n",
"6\n1 2\n1 3\n1 4\n1 5\n2 6\n",
"7\n1 2\n6 3\n4 5\n1 7\n1 5\n2 6\n",
"7\n1 3\n6 3\n4 5\n1 7\n1 5\n2 7\n",
"7\n1 2\n6 1\n4 5\n1 7\n1 5\n2 3\n",
"7\n1 3\n6 3\n4 5\n2 7\n1 5\n2 6\n",
"7\n1 2\n6 1\n4 1\n1 7\n2 5\n2 3\n",
"6\n1 2\n1 3\n1 4\n1 5\n1 6\n",
... | [
"3\n",
"36\n",
"192\n",
"396\n",
"752\n",
"1036\n",
"252\n",
"468\n",
"309\n",
"4\n"
] |
CodeContests | In the State of Takahashi in AtCoderian Federation, there are N cities, numbered 1, 2, ..., N. M bidirectional roads connect these cities. The i-th road connects City A_i and City B_i. Every road connects two distinct cities. Also, for any two cities, there is at most one road that directly connects them.
One day, it ... | stdin | null | 1,325 | 1 | [
"5 5\n1 2\n1 3\n3 4\n3 5\n4 5\n",
"5 1\n1 2\n",
"10 39\n7 2\n7 1\n5 6\n5 8\n9 10\n2 8\n8 7\n3 10\n10 1\n8 10\n2 3\n7 4\n3 9\n4 10\n3 4\n6 1\n6 7\n9 5\n9 7\n6 9\n9 4\n4 6\n7 5\n8 3\n2 5\n9 2\n10 7\n8 6\n8 9\n7 3\n5 3\n4 5\n6 3\n2 10\n5 10\n4 2\n6 2\n8 4\n10 6\n",
"4 3\n1 2\n1 3\n2 3\n"
] | [
"4\n",
"-1\n",
"21\n",
"3\n"
] | [
"5 0\n1 2\n",
"1 0\n1 2\n",
"5 5\n1 2\n2 3\n3 4\n3 5\n4 5\n",
"4 3\n1 2\n1 4\n2 3\n",
"3 1\n2 1\n",
"8 3\n1 2\n1 3\n2 3\n",
"5 0\n1 0\n",
"8 5\n1 2\n1 3\n3 4\n3 5\n4 5\n",
"9 1\n1 2\n",
"5 0\n1 -1\n"
] | [
"-1\n",
"0\n",
"4\n",
"2\n",
"1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n"
] |
CodeContests | Golu loves prime numbers . He wants to do something new with prime numbers. So Molu gives him a number and asks him to minmum number of prime numbers required such that their sum is equal to given number. This task is very diffcult for Golu so he asks you for your help.
Now your task is that you are given a number and... | stdin | null | 1,234 | 1 | [
"2\n2\n4\n\nSAMPLE\n"
] | [
"1\n2\n"
] | [
"10\n43\n5541\n6336\n646\n6243\n2798\n2214\n3504\n1108\n5074\n",
"10\n43\n18469\n6336\n26502\n19171\n15726\n20769\n29360\n26964\n24466\n",
"10\n10041\n28467\n16334\n36500\n29169\n25724\n21478\n39358\n36962\n32963\n",
"2\n3\n4\n\nSAMPLE\n",
"10\n43\n5541\n6336\n646\n8472\n2798\n2214\n3504\n1108\n5074\n",
"... | [
"1\n3\n2\n2\n3\n2\n2\n2\n2\n2\n",
"1\n3\n2\n2\n3\n2\n3\n2\n2\n2\n",
"2\n3\n2\n2\n2\n2\n2\n2\n2\n3\n",
"1\n2\n",
"1\n3\n2\n2\n2\n2\n2\n2\n2\n2\n",
"1\n3\n3\n2\n3\n2\n3\n2\n2\n2\n",
"2\n3\n2\n2\n2\n2\n2\n3\n2\n3\n",
"2\n3\n2\n2\n2\n2\n2\n2\n2\n2\n",
"1\n3\n3\n2\n2\n2\n3\n2\n2\n2\n",
"2\n3\n3\n2\n2\n... |
CodeContests | D: Two Colors Sort
problem
During the walk, umg found a sequence of length N, P_1, P_2, ..., P_N, which can be made by rearranging 1,2, ..., N.
umg can use mysterious powers to exchange places by choosing two different numbers painted in the same color.
umg wanted to be able to sort the sequence in ascending order ... | stdin | null | 2,030 | 1 | [
"3 2\n1 3 2\n"
] | [
"Yes\n"
] | [
"3 1\n1 3 2\n",
"3 0\n1 3 2\n",
"3 3\n1 3 2\n",
"2 0\n1 2 2\n",
"2 0\n1 2 3\n",
"2 0\n1 2 4\n",
"2 1\n1 2 4\n",
"2 1\n1 2 8\n",
"2 0\n1 2 8\n",
"2 1\n1 2 5\n"
] | [
"Yes\n",
"Yes\n",
"Yes\n",
"Yes\n",
"Yes\n",
"Yes\n",
"Yes\n",
"Yes\n",
"Yes\n",
"Yes\n"
] |
CodeContests | Problem Statement
Mr. Hagiwara, a witch, has a very negative personality. When she feels depressed, she uses the magic of digging to make holes and cry and fill them. The magic of digging is as follows.
She first draws N line segments on the ground. And when she casts the spell, a hole is created in the area surround... | stdin | null | 4,519 | 1 | [
"11\n0 0 10 0\n10 0 10 10\n10 10 0 10\n0 10 0 0\n1 2 9 2\n8 1 8 9\n9 8 1 8\n2 9 2 1\n8 11 11 8\n8 11 14 10\n11 8 10 14\n",
"8\n5 0 5 10\n5 10 0 5\n0 5 5 0\n10 0 10 10\n10 10 5 5\n5 5 10 0\n10 2 15 5\n15 5 10 8\n"
] | [
"1\n",
"2\n"
] | [
"11\n0 0 10 0\n10 0 10 10\n10 10 0 10\n0 10 0 0\n1 2 9 2\n8 1 8 9\n9 8 1 8\n2 9 2 1\n8 11 11 8\n8 11 14 10\n18 8 10 14\n",
"8\n5 0 5 10\n5 10 0 5\n0 5 5 0\n19 0 10 10\n10 10 3 5\n5 5 10 0\n10 2 15 8\n6 5 16 8\n",
"11\n0 1 10 -2\n10 1 10 10\n10 1 0 10\n0 5 1 1\n2 2 9 0\n9 1 8 9\n9 15 1 8\n2 3 2 1\n8 11 11 8\n6 1... | [
"1\n",
"2\n",
"0\n",
"3\n",
"4\n",
"1\n",
"1\n",
"1\n",
"1\n",
"1\n"
] |
CodeContests | Sunake is in the form of a polygonal line consisting of n vertices (without self-intersection). First, Sunake-kun's i-th vertex is at (xi, yi). You can move continuously by translating or rotating, but you cannot deform (change the length of the polygonal line or the angle between the two line segments). y = 0 is the w... | stdin | null | 3,813 | 1 | [
"4\n0 1\n1 1\n1 2\n2 2\n",
"11\n63 106\n87 143\n102 132\n115 169\n74 145\n41 177\n56 130\n28 141\n19 124\n0 156\n22 183\n"
] | [
"Possible\n",
"Impossible\n"
] | [
"4\n0 1\n1 1\n1 2\n3 2\n",
"11\n63 106\n87 143\n102 132\n115 169\n74 145\n41 177\n56 130\n28 102\n19 124\n0 156\n22 183\n",
"4\n0 2\n1 1\n1 2\n3 2\n",
"11\n63 106\n87 143\n102 132\n115 169\n74 145\n41 177\n56 130\n28 102\n19 124\n0 294\n22 183\n",
"4\n0 2\n1 1\n2 2\n3 2\n",
"11\n63 106\n87 143\n102 132\n1... | [
"Possible\n",
"Impossible\n",
"Possible\n",
"Impossible\n",
"Possible\n",
"Impossible\n",
"Impossible\n",
"Impossible\n",
"Impossible\n",
"Impossible\n"
] |
CodeContests | There are N pieces of sushi. Each piece has two parameters: "kind of topping" t_i and "deliciousness" d_i. You are choosing K among these N pieces to eat. Your "satisfaction" here will be calculated as follows:
* The satisfaction is the sum of the "base total deliciousness" and the "variety bonus".
* The base total de... | stdin | null | 3,875 | 1 | [
"6 5\n5 1000000000\n2 990000000\n3 980000000\n6 970000000\n6 960000000\n4 950000000\n",
"7 4\n1 1\n2 1\n3 1\n4 6\n4 5\n4 5\n4 5\n",
"5 3\n1 9\n1 7\n2 6\n2 5\n3 1\n"
] | [
"4900000016\n",
"25\n",
"26\n"
] | [
"6 5\n5 1000000000\n2 990000000\n3 1109665355\n6 970000000\n6 960000000\n4 950000000\n",
"7 4\n1 1\n2 1\n3 1\n4 6\n4 5\n4 5\n3 5\n",
"5 3\n1 9\n1 0\n2 6\n2 5\n3 1\n",
"7 1\n1 1\n2 1\n3 1\n4 6\n4 5\n4 5\n3 5\n",
"5 3\n1 9\n1 0\n2 6\n2 5\n3 2\n",
"6 5\n5 1000000000\n4 990000000\n3 1109665355\n8 970000000\n6... | [
"5029665371\n",
"29\n",
"25\n",
"7\n",
"26\n",
"5029665380\n",
"5019665371\n",
"4873054813\n",
"4900000016\n",
"32\n"
] |
CodeContests | Shreyan is appearing for CAT examination and is stuck at a problem to find minimum value needed to be added or subtracted to make a number perfect square.You as his friend and a good programmer agrees to help him find the answer.
INPUT:
First line will contain no of test cases T (1 < T < 10000)
Next T lines will ha... | stdin | null | 4,850 | 1 | [
"3\n25\n168\n19\n\nSAMPLE\n"
] | [
"YES\n+1\n-3\n"
] | [
"10010\n34691\n11183\n51314\n1000000\n999999\n0\n66666\n11111\n91111\n26110\n1\n2\n3\n4\n5\n6\n7\n8\n9\n10\n11\n12\n13\n14\n15\n16\n17\n18\n19\n20\n21\n22\n23\n24\n25\n26\n27\n28\n29\n30\n31\n32\n33\n34\n35\n36\n37\n38\n39\n40\n41\n42\n43\n44\n45\n46\n47\n48\n49\n50\n51\n52\n53\n54\n55\n56\n57\n58\n59\n60\n61\n62\n... | [
"-95\n+53\n+215\nYES\n+1\nYES\n-102\n-86\n+93\n+134\nYES\n-1\n+1\nYES\n-1\n-2\n+2\n+1\nYES\n-1\n-2\n-3\n+3\n+2\n+1\nYES\n-1\n-2\n-3\n-4\n+4\n+3\n+2\n+1\nYES\n-1\n-2\n-3\n-4\n-5\n+5\n+4\n+3\n+2\n+1\nYES\n-1\n-2\n-3\n-4\n-5\n-6\n+6\n+5\n+4\n+3\n+2\n+1\nYES\n-1\n-2\n-3\n-4\n-5\n-6\n-7\n+7\n+6\n+5\n+4\n+3\n+2\n+1\nYES\... |
CodeContests | “Hey, what’s up? It’s already 30 minutes past eleven!”
“I’m so sorry, but actually I got lost. I have no idea where I am now at all and I got tired wandering around. Please help!”
- Today you came to the metropolis to play with your friend. But she didn’t show up at the appointed time. What happened to her? After som... | stdin | null | 4,047 | 1 | [
"8\n1 0\n2 0\n3 1\n3 2\n2 3\n1 3\n0 2\n0 1\n1 2 3 4 5 6 7 8\n8\n1 0\n2 0\n3 1\n3 2\n2 3\n1 3\n0 2\n0 1\n4 3 2 1 8 7 6 5\n4\n0 0\n1 0\n1 1\n0 1\n1 2 3 4\n0\n"
] | [
"Case 1: 10.00000\nCase 2: No area\nCase 3: Infinity\n"
] | [
"8\n1 0\n2 0\n3 1\n3 2\n2 3\n1 3\n0 2\n0 1\n1 2 3 4 5 6 7 8\n8\n1 0\n2 0\n3 1\n3 2\n2 3\n2 3\n0 2\n0 1\n4 3 2 1 8 7 6 5\n4\n0 0\n1 0\n1 1\n0 1\n1 2 3 4\n0\n",
"8\n1 0\n1 0\n3 1\n3 2\n2 3\n1 3\n0 2\n0 1\n1 2 3 4 5 6 7 8\n8\n1 0\n2 0\n3 1\n3 2\n2 3\n2 3\n0 2\n0 1\n4 3 2 1 8 7 6 5\n4\n0 0\n1 0\n1 1\n0 1\n1 2 3 4\n0\... | [
"Case 1: 10.000000000\nCase 2: No area\nCase 3: Infinity\n",
"Case 1: 24.166666667\nCase 2: No area\nCase 3: Infinity\n",
"Case 1: No area\nCase 2: No area\nCase 3: Infinity\n",
"Case 1: 23.700000000\nCase 2: No area\nCase 3: Infinity\n",
"Case 1: No area\nCase 2: No area\nCase 3: No area\n",
"Case 1: Inf... |
CodeContests | Before the Battle of Kamino the Confederacy of Independent Systems developed the a way to communicate with the far systems. This way is very unique as every word consists of exactly L lowercase letters. Also, there are exactly D words in this.
Jedi order intercept these messages and built a dictionary out of it. Now t... | stdin | null | 2,678 | 1 | [
"3 5 4\nabc\nbca\ndac\ndbc\ncba\n(ab)(bc)(ca)\nabc\n(abc)(abc)(abc)\n(zyx)bc\n\nSAMPLE\n"
] | [
"2\n1\n3\n0\n"
] | [
"10 25 10\nnwlrbbmqbh\ncdarzowkky\nhiddqscdxr\njmowfrxsjy\nbldbefsarc\nbynecdyggx\nxpklorelln\nmpapqfwkho\npkmcoqhnwn\nkuewhsqmgb\nbuqcljjivs\nwmdkqtbxix\nmvtrrbljpt\nnsnfwzqfjm\nafadrrwsof\nsbcnuvqhff\nbsaqxwpqca\ncehchzvfrk\nmlnozjkpqp\nxyztikxjrx\nacbhhkicqc\noendtomfgd\nwdwfcgpxiq\nvkuytdlcgd\newhtacioho\nrdtqk... | [
"0\n1\n0\n1\n6\n8\n1\n8\n1\n8\n",
"3\n2\n3\n0\n",
"0\n1\n0\n1\n6\n7\n1\n8\n1\n8\n",
"2\n1\n3\n0\n",
"0\n1\n0\n1\n6\n8\n1\n8\n1\n",
"0\n1\n0\n1\n4\n8\n1\n8\n1\n8\n",
"0\n1\n0\n1\n6\n7\n1\n8\n1\n",
"0\n1\n0\n1\n2\n8\n1\n8\n1\n8\n",
"0\n1\n0\n1\n6\n6\n1\n8\n1\n",
"0\n1\n0\n1\n1\n8\n1\n8\n1\n8\n"
] |
CodeContests | A tourist is visiting Byteland. The tourist knows English very well. The language of Byteland is rather different from English. To be exact it differs in following points:
Bytelandian alphabet has the same letters as English one, but possibly different in meaning. Like 'A' in Bytelandian may be 'M' in English. However... | stdin | null | 3,460 | 1 | [
"5 qwertyuiopasdfghjklzxcvbnm\nPh\nPcssi\nBpke_kdc_epclc_jcijsc_mihyo?\nEpcf_kdc_liswhyo_EIED_hy_Vimcvpcn_Zkdvp_siyo_viyecle.\nIpp!\n"
] | [
"Hi\nHello\nWhat are these people doing?\nThey are solving TOTR in Codechef March long contest.\nOhh!\n"
] | [
"5 qwertyuiopasdfghjklzxcvbnm\nPh\nisscP\nBpke_kdc_epclc_jcijsc_mihyo?\nEpcf_kdc_liswhyo_EIED_hy_Vimcvpcn_Zkdvp_siyo_viyecle.\nIpp!\n",
"5 qwertyuiopasdfghjklzxcvbnm\nPh\nisscP\nBpke_kdc_epclc_jcij?c_mihyos\nEpcf_kdc_liswhyo_EIED_hy_Vimcvpcn_Zkdvp_siyo_viyecle.\nIpp!\n",
"5 qwertyuiopasdfghjklzxcvbnm\nPh\nisscP... | [
"Hi\nolleH\nWhat are these people doing?\nThey are solving TOTR in Codechef March long contest.\nOhh!\n",
"Hi\nolleH\nWhat are these peop?e doingl\nThey are solving TOTR in Codechef March long contest.\nOhh!\n",
"Hi\nolleH\nWhat are these peop?e doongl\nThey are solving TOTR in Codechef March long contest.\nOhh... |
CodeContests | View Russian Translation
Limak is a little polar bear.
Today he found something delicious in the snow.
It's a square bar of chocolate with N x N pieces.
Some pieces are special because there are cherries on them.
You might be surprised by cherries on a chocolate but you've never been on the Arctic Circle, have you?
L... | stdin | null | 1,554 | 1 | [
"2\n3\n###\n##.\n###\n4\n####\n.##.\n.#..\n#...\n\nSAMPLE\n"
] | [
"NO\nYES\n"
] | [
"2\n3\n###\n##.\n$##\n4\n####\n.##.\n.#..\n#...\n\nSAMPLE\n",
"2\n3\n###\n#\".\n###\n4\n####\n.\"#.\n.#..\n...#\n\nSAMFLP\n",
"2\n3\n###\n#$.\n##$\n4\n####\n.##.\n.#..\n#...\n\nELPMAS\n",
"2\n3\n$##\n#\".\n###\n4\n###\"\n.##.\n..#.\n./.#\n\nSAMFLP\n",
"2\n3\n###\n##.\n###\n4\n####\n.##.\n.#..\n#...\n\nSAMEL... | [
"NO\nYES\n",
"NO\nNO\n",
"YES\nYES\n",
"YES\nNO\n",
"NO\nYES\n",
"NO\nYES\n",
"NO\nYES\n",
"NO\nYES\n",
"NO\nYES\n",
"NO\nYES\n"
] |
CodeContests | You are given an integer n find its next greater or equal number whose binary representation must not contain consecutive ones.
For eg. given n=6 whose binary is 110 and the next number with no consecutive ones is 8 whose binary is 1000.
INPUT
First line of input contains t, the total number of test cases. Then t l... | stdin | null | 284 | 1 | [
"2\n6\n2\n\nSAMPLE\n"
] | [
"8\n2\n"
] | [
"10\n71\n8497\n6364\n6530\n9199\n5487\n1508\n9388\n6992\n4494\n",
"2\n6\n2\n\nELPMAS\n",
"10\n71\n8497\n6642\n6530\n9199\n5487\n2600\n9388\n6992\n4494\n",
"10\n71\n8497\n6642\n6530\n9199\n10823\n2600\n9388\n6992\n4494\n",
"2\n9\n2\n\nLEQMAS\n",
"10\n71\n8497\n2101\n6530\n9199\n10823\n2600\n9388\n6992\n449... | [
"72\n8512\n8192\n8192\n9216\n8192\n2048\n9472\n8192\n4608\n",
"8\n2\n",
"72\n8512\n8192\n8192\n9216\n8192\n2600\n9472\n8192\n4608\n",
"72\n8512\n8192\n8192\n9216\n10824\n2600\n9472\n8192\n4608\n",
"9\n2\n",
"72\n8512\n2112\n8192\n9216\n10824\n2600\n9472\n8192\n4608\n",
"9\n0\n",
"72\n8512\n2112\n16384... |
CodeContests | Takahashi wants to gain muscle, and decides to work out at AtCoder Gym.
The exercise machine at the gym has N buttons, and exactly one of the buttons is lighten up. These buttons are numbered 1 through N. When Button i is lighten up and you press it, the light is turned off, and then Button a_i will be lighten up. It ... | stdin | null | 973 | 1 | [
"3\n3\n1\n2\n",
"5\n3\n3\n4\n2\n4\n",
"4\n3\n4\n1\n2\n"
] | [
"2\n",
"3\n",
"-1\n"
] | [
"3\n3\n1\n3\n",
"5\n3\n3\n5\n2\n4\n",
"4\n4\n3\n1\n2\n",
"3\n2\n2\n1\n",
"5\n3\n0\n4\n2\n4\n",
"4\n3\n3\n1\n2\n",
"3\n3\n2\n3\n",
"4\n4\n3\n0\n2\n",
"4\n4\n4\n0\n2\n",
"4\n4\n7\n0\n2\n"
] | [
"-1\n",
"4\n",
"2\n",
"1\n",
"3\n",
"-1\n",
"-1\n",
"2\n",
"2\n",
"2\n"
] |
CodeContests | In Takahashi's mind, there is always an integer sequence of length 2 \times 10^9 + 1: A = (A_{-10^9}, A_{-10^9 + 1}, ..., A_{10^9 - 1}, A_{10^9}) and an integer P.
Initially, all the elements in the sequence A in Takahashi's mind are 0, and the value of the integer P is 0.
When Takahashi eats symbols `+`, `-`, `>` an... | stdin | null | 3,274 | 1 | [
"5\n+>+<-\n",
"5\n+>+-<\n",
"48\n-+><<><><><>>>+-<<>->>><<><<-+<>><+<<>+><-+->><<\n"
] | [
"3\n",
"5\n",
"475\n"
] | [
"5\n+-+<>\n",
"5\n*>+-<\n",
"48\n<<>>-+-<>+><<+<>><+-<<><<>>>-><<-+>>><><><><<>+-\n",
"5\n><+-+\n",
"5\n-<+>+\n",
"48\n-+><<><><><>>>+-<<>->>><<><<-+<>-<+<<>+><>+->><<\n",
"5\n>-+<+\n",
"5\n>-+;+\n",
"5\n>;+-+\n",
"5\n*.<>*\n"
] | [
"7\n",
"10\n",
"475\n",
"5\n",
"3\n",
"72\n",
"4\n",
"1\n",
"2\n",
"15\n"
] |
CodeContests | Students of Maharaja Agrasen Institute of Technology, are going for long trip. Along with one teacher who is programmer. In the middle of trip , he decided to ask a question to all the students as they were making a lot of noise.
There are total N students and teacher has M Candies and wants to distribute among all . ... | stdin | null | 3,028 | 1 | [
"1\n9 16 2\n\nSAMPLE\n"
] | [
"8\n"
] | [
"1\n4 16 2\n\nSAMPLE\n",
"1\n3 16 2\n\nSAMPLE\n",
"1\n6 15 2\n\nE@PMLS\n",
"1\n12 15 4\n\nD@PMLS\n",
"1\n19 15 4\n\nD@PMLS\n",
"1\n33 15 2\n\nD@PMLS\n",
"1\n33 22 2\n\nD@PMLS\n",
"1\n29 4 2\n\nM@PDLS\n",
"1\n51 6 2\n\nSLDP@M\n",
"1\n51 10 2\n\nSLDP@M\n"
] | [
"1\n",
"2\n",
"4\n",
"6\n",
"18\n",
"16\n",
"23\n",
"5\n",
"7\n",
"11\n"
] |
CodeContests | Every day, N passengers arrive at Takahashi Airport. The i-th passenger arrives at time T_i.
Every passenger arrived at Takahashi airport travels to the city by bus. Each bus can accommodate up to C passengers. Naturally, a passenger cannot take a bus that departs earlier than the airplane arrives at the airport. Also... | stdin | null | 4,977 | 1 | [
"5 3 5\n1\n2\n3\n6\n12\n",
"6 3 3\n7\n6\n2\n8\n10\n6\n"
] | [
"3\n",
"3\n"
] | [
"5 3 5\n1\n4\n3\n6\n12\n",
"5 5 5\n1\n4\n3\n6\n12\n",
"6 3 3\n7\n6\n2\n13\n17\n5\n",
"6 6 0\n7\n9\n8\n9\n19\n5\n",
"6 6 0\n7\n3\n8\n9\n19\n5\n",
"5 5 5\n1\n1\n4\n6\n4\n",
"6 3 3\n7\n6\n2\n13\n10\n6\n",
"6 3 6\n7\n6\n2\n13\n10\n6\n",
"5 5 5\n1\n1\n3\n6\n12\n",
"6 3 6\n7\n6\n2\n22\n10\n6\n"
] | [
"3\n",
"2\n",
"4\n",
"5\n",
"6\n",
"1\n",
"3\n",
"2\n",
"2\n",
"3\n"
] |
CodeContests | Today, King Trophies is on another rampage to destroy the small village controlled by Alex. Please help his soldiers.
At first, there are N individual soldiers, who haven't yet joined together; each of these soldiers is the leader of his/her own group. You have to handle 3 types of operations:
1) Two groups find each... | stdin | null | 4,059 | 1 | [
"2 2\n1 1 2\n3 1\n\nSAMPLE\n"
] | [
"2\n"
] | [
"2 2\n1 1 1\n3 1\n\nSAMPLE\n",
"2 2\n1 1 2\n3 1\n\nSALPLE\n",
"3 2\n1 1 1\n3 3\n\nRMAPLE\n",
"8 2\n1 2 4\n3 2\n\nRBMPLD\n",
"145 2\n1 2 1\n3 5\n\nCLPNSA\n",
"8 2\n1 2 6\n3 2\n\nDLPMBS\n",
"2 2\n2 1 1\n3 1\n\nSAMPLE\n",
"2 2\n1 1 1\n3 1\n\nRAMPLE\n",
"2 2\n1 1 1\n3 1\n\nRAMPLD\n",
"3 2\n2 1 1\n3 1\... | [
"1\n",
"2\n",
"3\n",
"4\n",
"5\n",
"6\n",
"1\n",
"1\n",
"1\n",
"1\n"
] |
CodeContests | Have you ever heard of the unit "○○ tsubo" that expresses the area of land? Since ancient times, one samurai has said the area for making rice to eat in a day.
There is a land of a [m] x b [m]. Enter a and b and create a program that outputs the tsubo area S [tsubo] of the land. 1 tsubo = 3.305785 [m2], and a and b ... | stdin | null | 3,240 | 1 | [
"15 25\n"
] | [
"113.437508\n"
] | [
"15 2\n",
"15 1\n",
"24 1\n",
"45 1\n",
"24 0\n",
"26 -1\n",
"6 -1\n",
"6 1\n",
"-1 -1\n",
"-1 -2\n"
] | [
"9.07500034031\n",
"4.53750017016\n",
"7.26000027225\n",
"13.6125005105\n",
"0.0\n",
"-7.86500029494\n",
"-1.81500006806\n",
"1.81500006806\n",
"0.302500011344\n",
"0.605000022688\n"
] |
CodeContests | Given is a sequence of N digits a_1a_2\ldots a_N, where each element is 1, 2, or 3. Let x_{i,j} defined as follows:
* x_{1,j} := a_j \quad (1 \leq j \leq N)
* x_{i,j} := | x_{i-1,j} - x_{i-1,j+1} | \quad (2 \leq i \leq N and 1 \leq j \leq N+1-i)
Find x_{N,1}.
Constraints
* 2 \leq N \leq 10^6
* a_i = 1,2,3 (1 \leq... | stdin | null | 1,362 | 1 | [
"10\n2311312312\n",
"4\n1231\n"
] | [
"0\n",
"1\n"
] | [
"4\n2332\n",
"4\n3121\n",
"4\n1311\n",
"10\n1806305381\n",
"4\n2465\n",
"10\n2192114600\n",
"4\n2113\n",
"10\n3104206232\n",
"4\n2121\n",
"4\n2010\n"
] | [
"0\n",
"1\n",
"2\n",
"0\n",
"1\n",
"1\n",
"1\n",
"1\n",
"0\n",
"1\n"
] |
CodeContests | Create a program that calculates and outputs the surface distance by inputting the north latitude and east longitude of two cities on the earth. However, the earth is a sphere with a radius of 6,378.1 km, and the surface distance between two points is the shortest distance along this sphere. Also, in the southern hemis... | stdin | null | 4,827 | 1 | [
"35.68 139.77 51.15 359.82\n1.37 103.92 41.78 272.25\n51.15 359.82 -34.58 301.52\n-1 -1 -1 -1\n"
] | [
"9609\n15092\n11112\n"
] | [
"35.997652258458864 139.77 51.15 359.82\n1.37 103.92 41.78 272.25\n51.15 359.82 -34.58 301.52\n-1 -1 -1 -1\n",
"35.68 139.77 51.15 359.82\n1.37 103.92 41.78 272.25\n51.15 359.82 -34.03920544232073 301.52\n-1 -1 -1 -1\n",
"35.997652258458864 139.77 51.15 359.82\n1.37 103.92 41.78 272.25\n51.15 359.82 -34.58 302.... | [
"9577\n15092\n11112\n",
"9609\n15092\n11062\n",
"9577\n15092\n11086\n",
"9609\n15025\n11062\n",
"9591\n15025\n11062\n",
"9609\n15092\n11178\n",
"9577\n15092\n11062\n",
"9609\n15069\n11062\n",
"9595\n15092\n11086\n",
"9609\n15025\n11023\n"
] |
CodeContests | Almost Identical Programs
The programming contest named Concours de Programmation Comtemporaine Interuniversitaire (CPCI) has a judging system similar to that of ICPC; contestants have to submit correct outputs for two different inputs to be accepted as a correct solution. Each of the submissions should include the pr... | stdin | null | 1,657 | 1 | [
"print\"hello\";print123\nprint\"hello\";print123\nread\"B1input\";solve;output;\nread\"B2\";solve;output;\nread\"C1\";solve;output\"C1ans\";\nread\"C2\";solve;output\"C2ans\";\n\"\"\"\"\"\"\"\"\n\"\"\"42\"\"\"\"\"\nslow\"program\"\nfast\"code\"\n\"super\"fast\"program\"\n\"super\"faster\"program\"\nX\"\"\nX\nI\"S\... | [
"IDENTICAL\nCLOSE\nDIFFERENT\nCLOSE\nDIFFERENT\nDIFFERENT\nDIFFERENT\nCLOSE\nDIFFERENT\n"
] | [
"print\"hello\";print123\nprint\"hello\";print123\nread\"B1input\";solve;output;\nread\"B2\";solve;output;\nread\"C1\";solve;output\"C1ans\";\nread\"C2\";solve;output\"C2ans\";\n\"\"\"\"\"\"\"\"\n\"\"\"42\"\"#\"\"\nslow\"program\"\nfast\"code\"\n\"super\"fast\"program\"\n\"super\"faster\"program\"\nX\"\"\nX\nI\"S\"... | [
"IDENTICAL\nCLOSE\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nCLOSE\nDIFFERENT\n",
"IDENTICAL\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nCLOSE\nDIFFERENT\n",
"DIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nCLOSE\nDIFFERENT\n",
"DIFFERENT\nDIFFE... |
CodeContests | Background
The kindergarten attached to the University of Aizu is a kindergarten where children who love programming gather. Yu-kun, one of the kindergarten children, loves drawing as much as programming. So far, Yu has drawn many pictures with circles, hexagons and arrows. One day Yu finds out that these pictures are... | stdin | null | 704 | 1 | [
"6 6\n0 1 5\n1 1 1\n0 1 5\n0 2 1\n0 5 1\n1 5 5\n0\n1\n2\n3\n4\n5\n",
"2 1\n0 0 1\n0 1 0\n0\n"
] | [
"3\n2\n3\n1\n3\n2\n",
"2\n"
] | [
"2 1\n0 0 1\n0 1 0\n1\n",
"6 6\n0 1 5\n1 1 1\n0 1 5\n0 2 0\n0 5 1\n1 5 5\n0\n1\n2\n3\n4\n5\n",
"2 1\n0 0 1\n1 1 0\n1\n",
"6 6\n0 1 5\n1 1 1\n0 1 5\n0 2 1\n0 5 0\n1 5 5\n0\n1\n2\n3\n4\n5\n",
"6 6\n0 1 5\n1 1 1\n0 2 5\n0 2 1\n0 5 1\n1 5 5\n0\n1\n2\n3\n4\n5\n",
"2 2\n1 1 1\n0 1 0\n0\n",
"2 2\n0 1 1\n0 1 0\... | [
"2\n",
"3\n2\n3\n1\n3\n2\n",
"1\n",
"2\n2\n2\n1\n1\n2\n",
"2\n2\n2\n2\n2\n2\n",
"1\n1\n",
"2\n2\n",
"1\n2\n1\n1\n1\n2\n",
"3\n2\n3\n1\n2\n2\n",
"1\n2\n2\n1\n2\n2\n"
] |
CodeContests | Problem I: Train King
Roland has been given a mission of dangerous material transfer by Train King. The material is stored in the station A and subject to being transferred to the station B. He will bring it by direct trains between A and B, one (or zero) unit per ride.
Your task is to write a program to find out the... | stdin | null | 2,144 | 1 | [
"5 5\n10 0 100\n10 200 300\n10 400 500\n10 600 700\n10 800 900\n10 100 200\n10 300 400\n10 500 600\n10 700 800\n10 900 1000\n",
"1 1\n10 100 0\n10 100 0\n"
] | [
"5\n",
"10\n"
] | [
"5 5\n20 0 100\n10 200 300\n10 400 500\n10 600 700\n10 800 900\n10 100 200\n10 300 400\n10 500 600\n10 700 800\n10 900 1000\n",
"1 1\n20 100 0\n10 100 0\n",
"2 1\n20 100 0\n10 100 0\n",
"5 5\n20 0 100\n10 200 300\n10 400 500\n10 600 700\n10 1051 900\n10 100 200\n10 300 400\n10 500 600\n10 700 800\n10 900 1001... | [
"5\n",
"11\n",
"1\n",
"14\n",
"23\n",
"22\n",
"12\n",
"4\n",
"3\n",
"15\n"
] |
CodeContests | A positive integer X is said to be a lunlun number if and only if the following condition is satisfied:
* In the base ten representation of X (without leading zeros), for every pair of two adjacent digits, the absolute difference of those digits is at most 1.
For example, 1234, 1, and 334 are lunlun numbers, while ... | stdin | null | 1,125 | 1 | [
"13\n",
"1\n",
"15\n",
"100000\n"
] | [
"21\n",
"1\n",
"23\n",
"3234566667\n"
] | [
"8\n",
"2\n",
"12\n",
"9\n",
"20\n",
"37\n",
"10\n",
"3\n",
"5\n",
"6\n"
] | [
"8\n",
"2\n",
"12\n",
"9\n",
"44\n",
"101\n",
"10\n",
"3\n",
"5\n",
"6\n"
] |
CodeContests | There are N balls in the xy-plane. The coordinates of the i-th of them is (x_i, i). Thus, we have one ball on each of the N lines y = 1, y = 2, ..., y = N.
In order to collect these balls, Snuke prepared 2N robots, N of type A and N of type B. Then, he placed the i-th type-A robot at coordinates (0, i), and the i-th t... | stdin | null | 4,545 | 1 | [
"1\n10\n2\n",
"2\n9\n3 6\n",
"5\n20\n11 12 9 17 12\n"
] | [
"4\n",
"12\n",
"74\n"
] | [
"1\n18\n2\n",
"2\n9\n2 6\n",
"5\n20\n11 12 9 17 15\n",
"1\n23\n1\n",
"1\n23\n0\n",
"1\n25\n-1\n",
"1\n10\n3\n",
"5\n20\n11 12 9 17 1\n",
"2\n9\n1 6\n",
"5\n20\n8 12 9 17 15\n"
] | [
"4\n",
"10\n",
"68\n",
"2\n",
"0\n",
"-2\n",
"6\n",
"60\n",
"8\n",
"66\n"
] |
CodeContests | After getting their Registration IDs, now the students were curious to know the names of the various events. So, this time, the volunteers told the participants that they would be given a Special Compressed String which they are supposed to Decompress to know the particular event name. Now, each Compressed string is an... | stdin | null | 2,311 | 1 | [
"2\na3\na2b3\n\nSAMPLE\n"
] | [
"aaa\naabaabaab\n"
] | [
"10\nasdada4d3\na2f3h4hh9\na2aa2\nb7d7sf7lll9\nasdWqf7\ndhfhjfmgj6hjh8\ndgdh6fhgf4sfs3\njhj7gy56e4sfh\n8kjol6ggg5f4d\no8ijh7gyhf4\n",
"2\na2\na2b3\n\nSAMPLE\n",
"10\nasdada4d3\na2f3h4hh9\na2aa2\nb7d7sf7lll9\n7fqWdsa\ndhfhjfmgj6hjh8\ndgdh6fhgf4sfs3\njhj7gy56e4sfh\n8kjol6ggg5f4d\no8ijh7gyhf4\n",
"2\na2\n3b2a\n\... | [
"asdadaasdadaasdadaasdadadasdadaasdadaasdadaasdadadasdadaasdadaasdadaasdadad\naafaafaafhaafaafaafhaafaafaafhaafaafaafhhhaafaafaafhaafaafaafhaafaafaafhaafaafaafhhhaafaafaafhaafaafaafhaafaafaafhaafaafaafhhhaafaafaafhaafaafaafhaafaafaafhaafaafaafhhhaafaafaafhaafaafaafhaafaafaafhaafaafaafhhhaafaafaafhaafaafaafhaafaafaa... |
CodeContests | Given are N integers A_1,\ldots,A_N.
We will choose exactly K of these elements. Find the maximum possible product of the chosen elements.
Then, print the maximum product modulo (10^9+7), using an integer between 0 and 10^9+6 (inclusive).
Constraints
* 1 \leq K \leq N \leq 2\times 10^5
* |A_i| \leq 10^9
Input
Inp... | stdin | null | 3,989 | 1 | [
"4 2\n1 2 -3 -4\n",
"10 10\n1000000000 100000000 10000000 1000000 100000 10000 1000 100 10 1\n",
"4 3\n-1 -2 -3 -4\n",
"2 1\n-1 1000000000\n"
] | [
"12\n",
"999983200\n",
"1000000001\n",
"1000000000\n"
] | [
"4 2\n1 2 -3 0\n",
"10 2\n1000000000 100000000 10000000 1000000 100000 10000 1000 100 10 1\n",
"4 3\n-1 -3 -3 -4\n",
"3 1\n-1 1000000000\n",
"4 2\n1 2 -3 -1\n",
"3 0\n-1 1000000000\n",
"10 2\n1000000000 100000010 10000000 1000000 100000 10000 0000 101 10 1\n",
"4 4\n1 2 -3 -4\n",
"10 10\n1000000000 ... | [
"2\n",
"300000007\n",
"999999998\n",
"1000000000\n",
"3\n",
"1\n",
"299999937\n",
"24\n",
"0\n",
"1000000006\n"
] |
CodeContests | As the Formula One Grand Prix was approaching, the officials decided to make the races a little more interesting with a new set of rules.
According to the new set of rules, each driver will be given a vehicle with different height and the driver with maximum SIGHT would win the race.
Now, SIGHT of a driver is defined ... | stdin | null | 841 | 1 | [
"2\n5\n4 1 2 1 4\n5 \n5 1 2 4 1\n\nSAMPLE\n"
] | [
"5\n4\n"
] | [
"50\n83\n2 1 2 3 7 0 5 3 4 1 3 3 5 0 5 0 4 6 1 7 3 6 5 0 9 7 2 2 7 9 2 4 4 3 3 4 5 8 5 4 7 4 8 0 3 1 3 7 6 4 0 9 9 1 1 3 7 7 4 3 1 5 5 2 8 1 3 8 1 3 9 5 2 7 3 1 8 0 4 8 2 5 2 \n10\n9 8 8 9 8 5 6 3 6 1 \n37\n6 8 9 2 3 2 3 7 4 5 9 8 8 0 6 6 4 2 4 8 5 8 7 0 2 0 2 6 5 4 7 9 8 6 1 6 9 \n3\n4 7 1 \n86\n5 4 3 5 8 2 3 4 2 ... | [
"71\n4\n32\n2\n58\n13\n12\n44\n50\n24\n29\n16\n28\n66\n69\n10\n9\n36\n94\n1\n11\n30\n44\n10\n19\n57\n78\n78\n26\n84\n45\n15\n62\n53\n42\n75\n84\n70\n75\n47\n22\n35\n62\n22\n5\n8\n62\n27\n13\n35\n",
"5\n4\n",
"71\n4\n32\n2\n58\n13\n12\n44\n50\n24\n29\n16\n28\n66\n69\n10\n9\n36\n94\n1\n11\n30\n44\n10\n19\n57\n78\... |
CodeContests | Haruna is a high school student. She must remember the seating arrangements in her class because she is a class president. It is too difficult task to remember if there are so many students.
That is the reason why seating rearrangement is depress task for her. But students have a complaint if seating is fixed.
One da... | stdin | null | 3,565 | 1 | [
"1 1\n2 2\n0 0\n"
] | [
"no\nyes\n"
] | [
"2 1\n2 2\n0 0\n",
"1 1\n2 0\n0 0\n",
"3 1\n3 1\n0 0\n",
"4 1\n1 1\n0 0\n",
"3 0\n0 0\n0 0\n",
"3 1\n0 0\n0 0\n",
"4 1\n2 2\n0 0\n",
"2 1\n2 3\n0 0\n",
"1 1\n3 0\n0 0\n",
"1 1\n4 0\n0 0\n"
] | [
"yes\nyes\n",
"no\nyes\n",
"no\nno\n",
"yes\nno\n",
"yes\n",
"no\n",
"yes\nyes\n",
"yes\nyes\n",
"no\nyes\n",
"no\nyes\n"
] |
CodeContests | Multiplication of Big Integers II
Given two integers $A$ and $B$, compute the product, $A \times B$.
Input
Two integers $A$ and $B$ separated by a space character are given in a line.
Output
Print the product in a line.
Constraints
* $-1 \times 10^{200000} \leq A, B \leq 10^{200000}$
Sample Input 1
5 8
Sa... | stdin | null | 3,618 | 1 | [
"5 8\n"
] | [
"40\n"
] | [
"2 8\n",
"4 8\n",
"0 8\n",
"1 8\n",
"1 2\n",
"2 2\n",
"2 3\n",
"1 3\n",
"-1 3\n",
"-1 4\n"
] | [
"16\n",
"32\n",
"0\n",
"8\n",
"2\n",
"4\n",
"6\n",
"3\n",
"-3\n",
"-4\n"
] |
CodeContests | Continuing from previous version of codeXplod series i.e. CodeXplod 1.0,Chandu and daspal are still fighting over a matter of MOMO's(they are very fond of Mo Mos of sector 3..:P).This time the fight became so savior that they want to kill each other.As we all know that during a fight it is most probable outcome that b... | stdin | null | 86 | 1 | [
"1\n2 3 Chandu\n\nSAMPLE\n"
] | [
"Daspal\n"
] | [
"1\n2 3 Chandu\n\nSBMPLE\n",
"1\n2 4 Chandu\n\nELPMBT\n",
"51\n8 10 Chandu\n2 2959 Daspal\n2903 6 Chandu\n9 2938 Daspal\n10 2907 Daspal\n8 2966 Daspal\n8 2938 Daspal\n4 2984 Daspal\n5 2939 Daspal\n2 2975 Daspal\n2925 10 Chandu\n4 2982 Daspal\n10 2959 Daspal\n3 2906 Daspal\n5 2904 Daspal\n2983 5 Chandu\n10 2998 ... | [
"Daspal\n",
"Chandu\n",
"Daspal\nChandu\nDaspal\nDaspal\nChandu\nChandu\nChandu\nDaspal\nDaspal\nChandu\nDaspal\nChandu\nChandu\nDaspal\nDaspal\nChandu\nDaspal\nDaspal\nChandu\nDaspal\nChandu\nDaspal\nChandu\nChandu\nDaspal\nDaspal\nDaspal\nChandu\nDaspal\nChandu\nChandu\nDaspal\nChandu\nDaspal\nChandu\nChandu\... |
CodeContests | Taro is addicted to a novel. The novel has n volumes in total, and each volume has a different thickness. Taro likes this novel so much that he wants to buy a bookshelf dedicated to it. However, if you put a large bookshelf in the room, it will be quite small, so you have to devise to make the width of the bookshelf as... | stdin | null | 2,770 | 1 | [
"3 9\n500\n300\n800\n200\n100\n600\n900\n700\n400\n4 3\n1000\n1000\n1000\n0 0\n"
] | [
"1800\n1000\n"
] | [
"3 9\n500\n300\n800\n200\n100\n600\n900\n700\n400\n4 3\n1000\n1000\n1010\n0 0\n",
"3 9\n500\n311\n800\n335\n100\n600\n900\n700\n400\n4 3\n1000\n1000\n1010\n0 0\n",
"3 9\n559\n311\n800\n335\n100\n563\n900\n700\n400\n4 3\n1000\n1000\n1010\n0 0\n",
"3 9\n500\n300\n800\n200\n100\n600\n900\n1032\n400\n4 3\n1000\n1... | [
"1800\n1010\n",
"1935\n1010\n",
"1898\n1010\n",
"1800\n1000\n",
"1700\n1010\n",
"1888\n1010\n",
"1945\n1010\n",
"1861\n1010\n",
"1871\n1000\n",
"1701\n1010\n"
] |
CodeContests | problem
Given $ N $ strings $ S_i $.
Find the maximum number of "AOR" in the string obtained by connecting $ S_i $ in any order.
output
Output the maximum number of "AOR" contained in the character string obtained by connecting $ S_i $ in any order. Also, output a line feed at the end.
Example
Input
2
AORA
OR
... | stdin | null | 514 | 1 | [
"2\nAORA\nOR\n"
] | [
"2\n"
] | [
"2\nAORA\nPR\n",
"2\nAROA\nRQ\n",
"2\nAORA\nRP\n",
"2\nAORA\nRQ\n",
"2\nAQOA\nRQ\n",
"2\nAQOA\nRP\n",
"2\nAQOA\nPR\n",
"2\nAQOA\nPQ\n",
"2\nAQOA\nQP\n",
"2\n@QOA\nPQ\n"
] | [
"1\n",
"0\n",
"1\n",
"1\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n"
] |
CodeContests | You are given a sequence with N integers: A = \\{ A_1, A_2, \cdots, A_N \\}. For each of these N integers, we will choose a color and paint the integer with that color. Here the following condition must be satisfied:
* If A_i and A_j (i < j) are painted with the same color, A_i < A_j.
Find the minimum number of col... | stdin | null | 2,560 | 1 | [
"4\n0\n0\n0\n0\n",
"5\n2\n1\n4\n5\n3\n"
] | [
"4\n",
"2\n"
] | [
"4\n0\n-1\n0\n0\n",
"4\n1\n0\n0\n0\n",
"5\n10\n-1\n1\n13\n3\n",
"5\n0\n0\n0\n0\n0\n",
"5\n1\n4\n5\n7\n14\n",
"5\n4\n1\n4\n5\n3\n",
"4\n1\n-1\n0\n0\n",
"5\n4\n1\n4\n9\n3\n",
"5\n7\n1\n4\n9\n3\n",
"4\n-1\n0\n0\n0\n"
] | [
"3\n",
"4\n",
"2\n",
"5\n",
"1\n",
"3\n",
"3\n",
"3\n",
"3\n",
"3\n"
] |
CodeContests | Utkarsh's mother recently received N piles of books as a gift from someone. The i^th pile contains Bi books.
She neither wants to keep the voluminous books with herself nor she wants to throw them away. So, she decided to distribute them to students of the nearby school. She decided to call K students to her home and... | stdin | null | 2,597 | 1 | [
"1\n2\n5 5\n\nSAMPLE\n"
] | [
"4 8\n"
] | [
"10\n1000\n772 471 331 119 775 107 645 356 638 975 867 164 316 61 22 487 523 873 955 185 28 413 742 304 317 154 702 877 682 460 393 907 687 52 696 408 323 190 134 577 402 311 347 171 761 130 106 101 236 505 562 804 672 521 814 173 978 950 396 716 757 327 448 279 724 612 27 443 721 664 961 353 227 626 315 224 324 72... | [
"4 506985\n1 495466\n1 501295\n2 508954\n1 494443\n2 492344\n2 493595\n2 500806\n4 509262\n1 483902\n",
"2 5367\n1 4251\n5 5482\n1 4647\n1 4853\n1 4878\n3 4848\n3 4604\n1 4906\n1 4441\n",
"4 506985\n1 495466\n1 501446\n2 508954\n1 494443\n2 492344\n2 493595\n2 500806\n4 509262\n1 483902\n",
"2 5367\n1 4251\n5... |
CodeContests | The brothers Hiroshi and Kenjiro came to Lake Inawashiro for fishing. The two decided to score as follows and compete with the total score of the fish they caught.
* One char is a point
* One yamame trout b points
* Add c points for every 10 chars
* Add d points for every 20 yamame trout
Create a program to determi... | stdin | null | 4,866 | 1 | [
"5 1\n3 1\n1 2 5 5\n",
"0 20\n10 0\n1 1 10 0\n",
"5 1\n4 2\n1 2 5 5\n"
] | [
"hiroshi\n",
"even\n",
"kenjiro\n"
] | [
"9 1\n3 1\n1 2 5 5\n",
"0 20\n10 0\n2 1 10 0\n",
"5 0\n4 1\n0 0 6 -1\n",
"5 1\n4 1\n1 2 5 5\n",
"9 1\n3 1\n1 2 5 3\n",
"0 13\n10 0\n2 1 10 0\n",
"5 1\n4 1\n1 2 5 1\n",
"9 2\n3 1\n1 2 5 3\n",
"0 9\n10 0\n2 1 10 0\n",
"5 1\n4 1\n1 2 5 0\n"
] | [
"hiroshi\n",
"kenjiro\n",
"even\n",
"hiroshi\n",
"hiroshi\n",
"kenjiro\n",
"hiroshi\n",
"hiroshi\n",
"kenjiro\n",
"hiroshi\n"
] |
CodeContests | Snuke found a random number generator. It generates an integer between 0 and N-1 (inclusive). An integer sequence A_0, A_1, \cdots, A_{N-1} represents the probability that each of these integers is generated. The integer i (0 \leq i \leq N-1) is generated with probability A_i / S, where S = \sum_{i=0}^{N-1} A_i. The pr... | stdin | null | 2,518 | 1 | [
"3\n1 3\n2 2\n3 1\n",
"2\n1 1\n1 1\n",
"15\n29 3\n78 69\n19 15\n82 14\n9 120\n14 51\n3 7\n6 14\n28 4\n13 12\n1 5\n32 30\n49 24\n35 23\n2 9\n"
] | [
"971485877\n",
"3\n",
"371626143\n"
] | [
"3\n1 3\n1 2\n3 1\n",
"15\n29 2\n78 69\n19 15\n82 14\n9 120\n14 51\n3 7\n6 14\n28 4\n13 12\n1 5\n32 30\n49 24\n35 23\n2 9\n",
"15\n29 3\n78 57\n19 15\n82 14\n9 120\n14 51\n3 7\n6 14\n28 4\n13 12\n1 5\n32 30\n49 24\n35 23\n2 9\n",
"3\n1 5\n1 2\n3 1\n",
"15\n29 3\n78 57\n19 15\n82 14\n9 120\n14 51\n3 7\n6 14\... | [
"433529221\n",
"887272138\n",
"988026546\n",
"443101457\n",
"823383426\n",
"27003783\n",
"653965508\n",
"325250229\n",
"117279277\n",
"851522041\n"
] |
CodeContests | Chef is very fond of horses. He enjoys watching them race. As expected, he has a stable full of horses. He, along with his friends, goes to his stable during the weekends to watch a few of these horses race. Chef wants his friends to enjoy the race and so he wants the race to be close. This can happen only if the horse... | stdin | null | 1,791 | 1 | [
"1\n5\n4 9 1 32 13\n"
] | [
"3\n"
] | [
"1\n5\n7 9 1 32 13\n",
"1\n5\n7 4 1 29 21\n",
"1\n5\n7 7 2 29 21\n",
"1\n5\n7 4 2 29 5\n",
"1\n5\n11 7 0 29 24\n",
"1\n5\n16 7 0 29 41\n",
"1\n5\n16 7 -1 29 41\n",
"1\n5\n16 7 -2 29 41\n",
"1\n5\n16 10 -2 29 41\n",
"1\n5\n7 18 1 32 13\n"
] | [
"2\n",
"3\n",
"0\n",
"1\n",
"4\n",
"7\n",
"8\n",
"9\n",
"6\n",
"5\n"
] |
CodeContests | For $n$ dynamic arrays $A_i$ ($i = 0, 1, ..., n-1$), perform a sequence of the following operations:
* pushBack($t$, $x$): Add element $x$ at the end of $A_t$.
* dump($t$): Print all elements in $A_t$.
* clear($t$): Clear $A_t$. If $A_t$ is empty, do nothing.
$A_i$ is a 0-origin array and it is empty in the initial... | stdin | null | 1,830 | 1 | [
"3 13\n0 0 1\n0 0 2\n0 0 3\n0 1 -1\n0 2 4\n0 2 5\n1 0\n1 1\n1 2\n2 1\n1 0\n1 1\n1 2\n"
] | [
"1 2 3\n-1\n4 5\n1 2 3\n\n4 5\n"
] | [
"3 13\n0 0 1\n0 0 3\n0 0 3\n0 1 -1\n0 2 4\n0 2 5\n1 0\n1 1\n1 2\n2 1\n1 0\n1 1\n1 2\n",
"3 13\n0 0 1\n0 0 2\n0 0 3\n0 1 0\n0 2 4\n0 2 5\n1 0\n1 1\n1 2\n2 1\n1 0\n1 1\n1 2\n",
"3 13\n0 0 1\n0 0 3\n0 0 3\n0 1 -1\n0 2 4\n0 2 5\n1 1\n1 1\n1 2\n2 1\n1 0\n1 1\n1 2\n",
"3 13\n0 0 1\n0 0 2\n0 0 3\n0 1 0\n0 0 4\n0 2 5... | [
"1 3 3\n-1\n4 5\n1 3 3\n\n4 5\n",
"1 2 3\n0\n4 5\n1 2 3\n\n4 5\n",
"-1\n-1\n4 5\n1 3 3\n\n4 5\n",
"1 2 3 4\n0\n5\n1 2 3 4\n\n5\n",
"1 3\n2 -1\n4 5\n1 3\n\n4 5\n",
"1 3 3\n4 5\n1 3 3\n\n4 5\n",
"-1\n1 3 3\n4 5\n1 3 3\n\n4 5\n",
"1 2 3 4\n0\n5\n1 2 3 4\n",
"1 3 3\n4 5\n\n\n4 5\n",
"1 2 4 4\n0\n5\n1 ... |
CodeContests | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`.
* The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)
* The s_i-th digit from the left is c_i. \left(i ... | stdin | null | 252 | 1 | [
"3 1\n1 0\n",
"3 3\n1 7\n3 2\n1 7\n",
"3 2\n2 1\n2 3\n"
] | [
"-1\n",
"702\n",
"-1\n"
] | [
"3 3\n1 14\n3 2\n1 7\n",
"3 0\n2 1\n2 3\n",
"3 1\n2 1\n1 3\n",
"3 1\n0 1\n1 0\n",
"3 3\n1 7\n3 4\n1 7\n",
"3 2\n2 0\n1 3\n",
"3 3\n0 2\n3 2\n1 1\n",
"3 2\n3 0\n2 6\n",
"1 1\n0 1\n1 0\n",
"2 1\n0 1\n1 0\n"
] | [
"-1\n",
"100\n",
"110\n",
"101\n",
"704\n",
"300\n",
"102\n",
"160\n",
"1\n",
"11\n"
] |
CodeContests | The phantom thief "Lupin IV" is told by the beautiful "Fujiko Mine", a descendant of the Aizu clan, that the military funds left by the Aizu clan are sleeping in Aizuwakamatsu city. According to a report by Lupine's longtime companion, "Ishikawa Koshiemon," military funds are stored in several warehouses in a Senryobak... | stdin | null | 2,609 | 1 | [
"5\n13 199 1\n51 1000 1\n37 350 10\n27 300 2\n99 200 1000\n",
"3\n11 100 1\n13 200 20\n12 300 3\n",
"2\n1 100 1\n2 200 2\n"
] | [
"51 37 27 13 99\n",
"11 12 13\n",
"1 2\n"
] | [
"5\n13 199 1\n93 1000 1\n37 350 10\n27 300 2\n99 200 1000\n",
"3\n9 100 1\n13 200 20\n12 300 3\n",
"2\n2 100 1\n2 200 2\n",
"5\n13 199 1\n93 1000 1\n37 350 10\n27 300 2\n82 200 1000\n",
"3\n9 100 1\n13 200 20\n19 300 3\n",
"5\n13 199 1\n93 1000 1\n37 350 10\n27 300 2\n123 200 1100\n",
"3\n9 100 0\n13 20... | [
"93 37 27 13 99\n",
"9 12 13\n",
"2 2\n",
"93 37 27 13 82\n",
"9 19 13\n",
"93 37 27 13 123\n",
"9 24 13\n",
"9 24 26\n",
"93 37 27 11 123\n",
"24 9 26\n"
] |
CodeContests | Given are a sequence of N positive integers A_1, A_2, \ldots, A_N and another positive integer S.
For a non-empty subset T of the set \\{1, 2, \ldots , N \\}, let us define f(T) as follows:
* f(T) is the number of different non-empty subsets \\{x_1, x_2, \ldots , x_k \\} of T such that A_{x_1}+A_{x_2}+\cdots +A_{x_k}... | stdin | null | 3,831 | 1 | [
"5 8\n9 9 9 9 9\n",
"3 4\n2 2 4\n",
"10 10\n3 1 4 1 5 9 2 6 5 3\n"
] | [
"0\n",
"6\n",
"3296\n"
] | [
"5 8\n9 15 9 9 9\n",
"10 10\n3 1 4 1 5 9 2 4 5 3\n",
"3 4\n2 2 1\n",
"10 10\n3 1 7 1 5 9 2 6 5 3\n",
"10 20\n3 1 4 1 5 9 2 4 5 3\n",
"10 10\n3 1 7 1 5 13 2 6 5 3\n",
"10 20\n3 1 4 1 5 9 4 4 5 3\n",
"10 10\n3 1 7 1 10 13 2 6 5 3\n",
"10 9\n3 1 4 1 5 9 4 4 5 3\n",
"10 10\n3 1 7 1 13 13 2 6 5 3\n"
] | [
"0\n",
"3552\n",
"2\n",
"2912\n",
"1624\n",
"2400\n",
"1496\n",
"2272\n",
"4224\n",
"1760\n"
] |
CodeContests | Artist Shinagawa was asked to exhibit n works. Therefore, I decided to exhibit the six sides of the cube colored with paint as a work. The work uses all six colors, Red, Yellow, Blue, Magenta, Green, and Cyan, and each side is filled with one color. Shinagawa changed the arrangement of colors even for cubic works with ... | stdin | null | 3,401 | 1 | [
"3\nCyan Yellow Red Magenta Green Blue\nCyan Yellow Red Magenta Green Blue\nRed Yellow Magenta Blue Green Cyan\n4\nRed Magenta Blue Green Yellow Cyan\nRed Yellow Magenta Blue Green Cyan\nMagenta Green Red Cyan Yellow Blue\nCyan Green Yellow Blue Magenta Red\n0\n"
] | [
"1\n1\n"
] | [
"3\nCyan Yellow Red Magenta Green Blue\nCyan Yellow Red Magenta Green Blue\nRed Yellow Magenta Blue Green Cyan\n4\nRed Mahenta Blue Green Yellow Cyan\nRed Yellow Magenta Blue Green Cyan\nMagenta Green Red Cyan Yellow Blue\nCyan Green Yellow Blue Magenta Red\n0\n",
"3\nCyan Yellow Red gaMenta Green Blue\nnayC Yell... | [
"1\n1\n",
"0\n1\n",
"1\n",
"1\n1\n",
"1\n1\n",
"1\n1\n",
"1\n1\n",
"1\n1\n",
"1\n1\n",
"1\n1\n"
] |
CodeContests | There are N pinholes on the xy-plane. The i-th pinhole is located at (x_i,y_i).
We will denote the Manhattan distance between the i-th and j-th pinholes as d(i,j)(=|x_i-x_j|+|y_i-y_j|).
You have a peculiar pair of compasses, called Manhattan Compass. This instrument always points at two of the pinholes. The two legs ... | stdin | null | 2,847 | 1 | [
"6 2 3\n1 3\n5 3\n3 5\n8 4\n4 7\n2 5\n",
"5 1 2\n1 1\n4 3\n6 1\n5 5\n4 8\n",
"8 1 2\n1 5\n4 3\n8 2\n4 7\n8 8\n3 3\n6 6\n4 8\n"
] | [
"4\n",
"4\n",
"7\n"
] | [
"6 2 3\n1 3\n5 3\n3 5\n8 4\n4 10\n2 5\n",
"5 1 2\n1 1\n4 1\n6 1\n5 5\n4 8\n",
"8 1 2\n1 5\n4 3\n8 2\n4 7\n7 8\n3 3\n6 6\n4 8\n",
"6 2 3\n1 3\n5 2\n3 5\n8 4\n4 10\n2 5\n",
"6 2 3\n1 3\n9 2\n3 5\n8 4\n4 10\n2 5\n",
"4 0 3\n-1 2\n23 0\n0 6\n8 10\n5 1\n1 10\n",
"6 1 3\n1 3\n5 3\n3 5\n8 4\n4 8\n2 5\n",
"6 ... | [
"4\n",
"1\n",
"6\n",
"3\n",
"2\n",
"0\n",
"5\n",
"7\n",
"8\n",
"1\n"
] |
CodeContests | Nathan O. Davis is taking a class of signal processing as a student in engineering. Today’s topic of the class was autocorrelation. It is a mathematical tool for analysis of signals represented by functions or series of values. Autocorrelation gives correlation of a signal with itself. For a continuous real function f(... | stdin | null | 4,438 | 1 | [
"3 1\n0 0\n1 1\n2 0\n11 1.5\n0 0\n2 7\n5 3\n7 8\n10 -5\n13 4\n15 -1\n17 3\n20 -7\n23 9\n24 0\n0 0\n"
] | [
"0.166666666666667\n165.213541666667\n"
] | [
"3 1\n0 0\n1 1\n2 0\n11 1.5\n0 0\n4 7\n5 3\n7 8\n10 -5\n13 4\n15 -1\n17 3\n20 -7\n23 9\n24 0\n0 0\n",
"3 1\n0 0\n1 2\n2 0\n11 1.5\n0 0\n4 7\n5 3\n7 8\n10 -5\n13 4\n15 -1\n17 3\n20 -7\n23 9\n24 0\n0 0\n",
"3 1\n0 0\n1 1\n2 0\n11 1.5\n0 0\n4 7\n5 3\n7 8\n10 -5\n13 4\n15 -1\n17 3\n20 -7\n23 3\n24 0\n0 0\n",
"3 1... | [
"0.1666666667\n154.1106770833\n",
"0.6666666667\n154.1106770833\n",
"0.1666666667\n166.5273437500\n",
"0.1666666667\n170.5551215277\n",
"1.5000000000\n154.1106770833\n",
"0.1666666667\n349.2981770833\n",
"0.1666666667\n62.5146374630\n",
"1.5000000000\n172.9231770833\n",
"0.6666666667\n165.2135416666... |
CodeContests | There are 3N participants in AtCoder Group Contest. The strength of the i-th participant is represented by an integer a_i. They will form N teams, each consisting of three participants. No participant may belong to multiple teams.
The strength of a team is defined as the second largest strength among its members. For ... | stdin | null | 2,807 | 1 | [
"2\n5 2 8 5 1 5\n",
"10\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 100... | [
"10\n",
"10000000000\n"
] | [
"2\n2 2 8 5 1 5\n",
"10\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1100000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 100... | [
"7\n",
"10000000000\n",
"10000100000\n",
"9\n",
"12\n",
"13\n",
"10100000000\n",
"10100000010\n",
"10\n",
"6\n"
] |
CodeContests | There is a puzzle to complete by combining 14 numbers from 1 to 9. Complete by adding another number to the given 13 numbers.
The conditions for completing the puzzle are
* You must have one combination of the same numbers.
* The remaining 12 numbers are 4 combinations of 3 numbers.
The combination of three numbers i... | stdin | null | 4,979 | 1 | [
"3649596966777\n6358665788577\n9118992346175\n9643871425498\n7755542764533\n1133557799246\n"
] | [
"2 3 5 8\n3 4\n1 2 3 4 5 6 7 8 9\n7 8 9\n1 2 3 4 6 7 8\n0\n"
] | [
"3649596966777\n4672433573317\n9118992346175\n9643871425498\n7755542764533\n1133557799246\n",
"3649596966777\n7685559208632\n9118992346175\n9643871425498\n7755542764533\n1133557799246\n",
"3649596966777\n4672433573317\n9118992346175\n7133209108608\n7755542764533\n704120058101\n",
"3649596966777\n2425197316228... | [
"2 3 5 8\n1 2 4 5 7\n1 2 3 4 5 6 7 8 9\n7 8 9\n1 2 3 4 6 7 8\n0\n",
"2 3 5 8\n0\n1 2 3 4 5 6 7 8 9\n7 8 9\n1 2 3 4 6 7 8\n0\n",
"2 3 5 8\n1 2 4 5 7\n1 2 3 4 5 6 7 8 9\n0\n1 2 3 4 6 7 8\n0\n",
"2 3 5 8\n1 3 4 7\n1 2 3 4 5 6 7 8 9\n0\n1 2 3 4 6 7 8\n0\n",
"2 3 5 8\n3 4\n1 2 3 4 5 6 7 8 9\n7 8 9\n0\n0\n",
"2... |
CodeContests | Shinchan and Kazama both are playing with numbers. Shinchan gives Kazama an array of numbers and asks him to tell the minimum possible last number of a non decreasing sequence of length L.
Note- Check the sample I/O for more clarity.
INPUT-
Input consists of number of test cases T. Each test case contains size of a... | stdin | null | 3,826 | 1 | [
"1\n7\n9 7 2 5 4 11 12 \n3\n\nSAMPLE\n"
] | [
"11\n"
] | [
"10\n41\n467 334 500 169 724 478 358 962 464 705 145 281 827 961 491 995 942 827 436 391 604 902 153 292 382 421 716 718 895 447 726 771 538 869 912 667 299 35 894 703 811 \n23\n333\n673 664 141 711 253 868 547 644 662 757 37 859 723 741 529 778 316 35 190 842 288 106 40 942 264 648 446 805 890 729 370 350 6 101 39... | [
"-1\n474\n58\n-1\n-1\n66\n-1\n255\n300\n-1\n",
"11\n",
"12\n",
"-1\n474\n58\n-1\n-1\n66\n-1\n232\n300\n-1\n",
"-1\n474\n58\n-1\n-1\n66\n-1\n232\n299\n-1\n",
"-1\n474\n58\n-1\n-1\n66\n-1\n232\n285\n-1\n",
"-1\n474\n43\n-1\n-1\n66\n-1\n232\n285\n-1\n",
"-1\n474\n43\n-1\n-1\n66\n-1\n232\n281\n-1\n",
"-... |
CodeContests | In the final of CODE FESTIVAL in some year, there are N participants. The height and power of Participant i is H_i and P_i, respectively.
Ringo is hosting a game of stacking zabuton (cushions).
The participants will line up in a row in some order, and they will in turn try to add zabuton to the stack of zabuton. Init... | stdin | null | 4,231 | 1 | [
"3\n2 4\n3 1\n4 1\n",
"10\n1 3\n8 4\n8 3\n9 1\n6 4\n2 3\n4 2\n9 2\n8 3\n0 1\n",
"3\n0 2\n1 3\n3 4\n"
] | [
"3\n",
"5\n",
"2\n"
] | [
"3\n2 4\n3 1\n4 2\n",
"10\n1 3\n8 4\n8 3\n10 1\n6 4\n2 3\n4 2\n9 2\n8 3\n0 1\n",
"3\n0 2\n1 0\n3 4\n",
"10\n1 3\n8 4\n8 3\n10 1\n12 4\n2 3\n4 2\n9 2\n8 3\n0 1\n",
"10\n1 3\n0 4\n15 3\n10 1\n8 4\n2 3\n4 2\n9 1\n8 3\n0 1\n",
"10\n2 3\n0 4\n15 3\n10 1\n8 4\n2 1\n4 2\n9 1\n8 0\n0 1\n",
"10\n2 3\n0 0\n15 3\n... | [
"2\n",
"5\n",
"3\n",
"6\n",
"7\n",
"8\n",
"9\n",
"1\n",
"3\n",
"3\n"
] |
CodeContests | There are cubes of the same size and a simple robot named Masato. Initially, all cubes are on the floor. Masato can be instructed to pick up a cube and put it on another cube, to make piles of cubes. Each instruction is of the form `pick up cube A and put it on cube B (or on the floor).'
When he is to pick up a cube, ... | stdin | null | 2,333 | 1 | [
"3\n1 3\n2 0\n0 0\n4\n4 1\n3 1\n1 2\n0 0\n5\n2 1\n3 1\n4 1\n3 2\n1 1\n0 0\n0\n"
] | [
"1\n2\nend\n1\n1\n2\nend\n1\n4\nend\n"
] | [
"3\n1 3\n2 0\n0 0\n4\n4 1\n3 1\n1 0\n0 0\n5\n2 1\n3 1\n4 1\n3 2\n1 1\n0 0\n0\n",
"3\n1 3\n2 0\n0 0\n4\n4 1\n3 1\n1 2\n0 0\n5\n2 2\n3 1\n4 1\n3 2\n1 1\n0 0\n0\n",
"3\n1 3\n2 0\n0 0\n4\n1 1\n3 1\n1 2\n0 0\n5\n2 1\n3 1\n4 1\n3 2\n1 1\n0 0\n0\n",
"3\n1 3\n2 0\n0 0\n4\n4 1\n3 1\n1 2\n0 0\n5\n2 2\n3 1\n4 0\n5 2\n1 ... | [
"1\n2\nend\n1\n3\nend\n1\n4\nend\n",
"1\n2\nend\n1\n1\n2\nend\n1\n1\n1\n2\nend\n",
"1\n2\nend\n1\n1\n2\nend\n1\n4\nend\n",
"1\n2\nend\n1\n1\n2\nend\n1\n2\n2\nend\n",
"1\n2\nend\n1\n3\nend\n1\n1\n1\n2\nend\n",
"1\n2\nend\n1\n1\n2\nend\n1\n1\n3\nend\n",
"1\n2\nend\n1\n3\nend\n1\n1\n1\n1\n2\nend\n",
"1\n... |
CodeContests | Alice and Bob are in love with each other, but they have difficulty going out on a date - Alice is a very busy graduate student at the ACM university.
For this reason, Bob came to the ACM university to meet her on a day. He tried to reach the meeting spot but got lost because the campus of the university was very larg... | stdin | null | 2,534 | 1 | [
"1\n3 3 7 7\n2 2 8 2\n2\n2 5 5 9\n6 1 9 5\n1 5 10 5\n2\n2 1 3 2\n2 3 3 4\n1 1 4 4\n1\n3 3 7 7\n1 5 9 5\n1\n3 3 7 7\n1 5 8 5\n1\n3 3 7 7\n1 5 10 5\n0\n"
] | [
"0.000\n0.000\n0.000\n5.657\n6.406\n4.992\n"
] | [
"1\n3 3 7 7\n2 2 8 2\n2\n2 5 5 9\n6 1 9 5\n1 5 10 3\n2\n2 1 3 2\n2 3 3 4\n1 1 4 4\n1\n3 3 7 7\n1 5 9 5\n1\n3 3 7 7\n1 5 8 5\n1\n3 3 7 7\n1 5 10 5\n0\n",
"1\n3 3 7 7\n2 2 8 2\n2\n2 5 5 9\n6 1 9 5\n1 5 10 3\n2\n2 1 3 2\n2 3 3 4\n1 1 4 4\n1\n3 3 7 7\n1 9 9 5\n1\n3 3 7 7\n1 5 8 5\n1\n3 3 7 7\n1 5 10 5\n0\n",
"1\n3 ... | [
"0.00000000000000000000\n7.57770876399966297754\n0.00000000000000000000\n5.65685424949238058190\n6.40613588874585371258\n4.99230176602706254840\n",
"0.00000000000000000000\n7.57770876399966297754\n0.00000000000000000000\n2.82842712474619029095\n6.40613588874585371258\n4.99230176602706254840\n",
"0.0000000000000... |
CodeContests | Let us define an easy Sorting Algorithm called SoftSort. SoftSort Sorting algorithm involves use of IF and ELSE decision statements only. For example :
To sort two numbers a and b. SoftSort Algorithm's Code is given below.
void print(int a,int b){
printf( "%d %d\n",a,b);
}
void sort( int a, int b){
if( b < ... | stdin | null | 3,909 | 1 | [
"3\n1\n2\n3\n\nSAMPLE\n"
] | [
"6\n9\n21\n"
] | [
"3\n1\n2\n3\n\nSALPME\n",
"3\n1\n1\n3\n\nSALPME\n",
"3\n1\n3\n3\n\nSAMPLE\n",
"3\n2\n1\n3\n\nSALPMF\n",
"3\n1\n3\n1\n\nSAMPLE\n",
"3\n2\n3\n1\n\nSAMPLE\n",
"3\n2\n3\n2\n\nSAMPLE\n",
"3\n2\n2\n2\n\nSAMPLE\n",
"3\n4\n2\n2\n\nELPMAS\n",
"3\n4\n2\n1\n\nELOMAS\n"
] | [
"6\n9\n21\n",
"6\n6\n21\n",
"6\n21\n21\n",
"9\n6\n21\n",
"6\n21\n6\n",
"9\n21\n6\n",
"9\n21\n9\n",
"9\n9\n9\n",
"75\n9\n9\n",
"75\n9\n6\n"
] |
CodeContests | We have 3N cards arranged in a row from left to right, where each card has an integer between 1 and N (inclusive) written on it. The integer written on the i-th card from the left is A_i.
You will do the following operation N-1 times:
* Rearrange the five leftmost cards in any order you like, then remove the three le... | stdin | null | 4,578 | 1 | [
"3\n1 1 2 2 2 3 3 3 1\n",
"3\n1 1 2 2 3 3 3 2 1\n",
"2\n1 2 1 2 2 1\n"
] | [
"3\n",
"1\n",
"2\n"
] | [
"3\n0 1 2 2 2 3 3 3 1\n",
"2\n1 2 1 1 2 1\n",
"3\n1 1 2 1 2 3 3 3 2\n",
"2\n3 3 1 2 2 1\n",
"3\n1 1 2 2 2 3 3 3 2\n",
"2\n2 2 1 1 2 1\n",
"2\n2 1 1 1 2 1\n",
"2\n1 2 1 0 2 1\n",
"3\n0 1 1 2 2 3 3 3 1\n",
"2\n1 2 1 0 2 2\n"
] | [
"2\n",
"1\n",
"3\n",
"0\n",
"2\n",
"2\n",
"1\n",
"1\n",
"2\n",
"1\n"
] |
CodeContests | A boy PCK is playing with N electric metronomes. The i-th metronome is set to tick every t_i seconds. He started all of them simultaneously.
He noticed that, even though each metronome has its own ticking interval, all of them tick simultaneously from time to time in certain intervals. To explore this interesting phen... | stdin | null | 2,488 | 1 | [
"3\n3\n6\n8\n",
"2\n10\n10\n"
] | [
"3\n",
"0\n"
] | [
"3\n5\n6\n8\n",
"2\n10\n4\n",
"3\n5\n5\n8\n",
"2\n10\n6\n",
"3\n8\n5\n8\n",
"2\n10\n2\n",
"2\n18\n4\n",
"2\n34\n4\n",
"2\n34\n8\n",
"2\n35\n15\n"
] | [
"5\n",
"1\n",
"6\n",
"4\n",
"3\n",
"0\n",
"2\n",
"13\n",
"9\n",
"20\n"
] |
CodeContests | There are N people standing in a row from west to east. Each person is facing east or west. The directions of the people is given as a string S of length N. The i-th person from the west is facing east if S_i = `E`, and west if S_i = `W`.
You will appoint one of the N people as the leader, then command the rest of the... | stdin | null | 4,073 | 1 | [
"12\nWEWEWEEEWWWE\n",
"5\nWEEWW\n",
"8\nWWWWWEEE\n"
] | [
"4\n",
"1\n",
"3\n"
] | [
"12\nEWWWEEEWEWEW\n",
"5\nWWEEW\n",
"12\nWWWWEEEWEWEE\n",
"8\nWEWWWEWE\n",
"8\nEEEWWWWW\n",
"5\nEWEWW\n",
"12\nEWWEWEEEWWWE\n",
"5\nWWEWE\n",
"12\nWEWWEEWWEWEE\n",
"5\nWEWEW\n"
] | [
"5\n",
"2\n",
"6\n",
"3\n",
"0\n",
"1\n",
"4\n",
"2\n",
"6\n",
"2\n"
] |
CodeContests | There is a game that involves three variables, denoted A, B, and C.
As the game progresses, there will be N events where you are asked to make a choice. Each of these choices is represented by a string s_i. If s_i is `AB`, you must add 1 to A or B then subtract 1 from the other; if s_i is `AC`, you must add 1 to A or ... | stdin | null | 2,202 | 1 | [
"2 1 3 0\nAB\nAC\n",
"1 0 9 0\nAC\n",
"8 6 9 1\nAC\nBC\nAB\nBC\nAC\nBC\nAB\nAB\n",
"3 1 0 0\nAB\nBC\nAB\n"
] | [
"Yes\nA\nC\n",
"No\n",
"Yes\nC\nB\nB\nC\nC\nB\nA\nA\n",
"No\n"
] | [
"2 1 3 1\nAB\nAC\n",
"8 6 9 1\nBC\nBC\nAB\nBC\nAC\nBC\nAB\nAB\n",
"3 1 0 -1\nAB\nBC\nAB\n",
"8 6 16 1\nAC\nBC\nAB\nBC\nAC\nBC\nAB\nAB\n",
"2 0 3 2\nAB\nAC\n",
"1 0 8 1\nAC\n",
"8 9 16 1\nAC\nBC\nAB\nBC\nAC\nBC\nAC\nAB\n",
"1 0 6 1\nBC\n",
"2 2 3 0\nAB\nAB\n",
"2 3 2 0\nAB\nAC\n"
] | [
"Yes\nA\nC\n",
"Yes\nC\nC\nA\nC\nC\nB\nA\nB\n",
"No\n",
"Yes\nC\nC\nA\nC\nC\nC\nA\nA\n",
"Yes\nA\nA\n",
"Yes\nA\n",
"Yes\nC\nC\nA\nC\nC\nC\nC\nA\n",
"Yes\nC\n",
"Yes\nA\nB\n",
"Yes\nB\nC\n"
] |
CodeContests | Our Earth is so beautiful due to the various amazing colours it contains. Now on Earth day we invited Species from Mars (called Martian) Planet to celebrate it with us and to let them know our Earth.
Martians got so much attracted with the beauty of our Earth and invited people of Earth to visit their Planet Mars.
Bu... | stdin | null | 2,389 | 1 | [
"2\n15 9 120\n255 98 174\n\nSAMPLE\n"
] | [
"Case 1: 0Z 09 78 \nCase 2: ZZ 62 UY\n"
] | [
"2\n15 9 120\n255 98 110\n\nSAMPLE\n",
"2\n15 9 120\n255 14 110\n\nSAMPLE\n",
"2\n15 11 120\n255 14 110\n\nSAMPLE\n",
"2\n15 11 137\n255 14 110\n\nSAMPLE\n",
"2\n15 11 137\n190 14 110\n\nSAMPME\n",
"2\n27 11 137\n190 14 110\n\nSAMPME\n",
"2\n15 9 140\n255 98 174\n\nSAMPLE\n",
"2\n15 9 120\n255 17 110\... | [
"Case 1: 0Z 09 78\nCase 2: ZZ 62 6Y\n",
"Case 1: 0Z 09 78\nCase 2: ZZ 0Y 6Y\n",
"Case 1: 0Z 0V 78\nCase 2: ZZ 0Y 6Y\n",
"Case 1: 0Z 0V 89\nCase 2: ZZ 0Y 6Y\n",
"Case 1: 0Z 0V 89\nCase 2: VY 0Y 6Y\n",
"Case 1: 1V 0V 89\nCase 2: VY 0Y 6Y\n",
"Case 1: 0Z 09 8W\nCase 2: ZZ 62 UY\n",
"Case 1: 0Z 09 78\nCas... |
CodeContests | Little Raju recently learnt about binary numbers. After spending some time with it, he decided to count in how many ways he can make N digit numbers that is formed by ones and zeroes. But zeroes can not be next to each other. Help him finding in how many different numbers can he make?
Example: There 5 possible ways o... | stdin | null | 405 | 1 | [
"2\n3\n7\n\nSAMPLE\n"
] | [
"5\n34\n"
] | [
"5\n2\n8\n12\n26\n34\n",
"5\n99\n44\n18\n999\n35\n",
"2\n3\n7\n\nS@MPLE\n",
"5\n2\n8\n9\n26\n34\n",
"5\n99\n71\n18\n999\n35\n",
"2\n3\n9\n\nS@MPLE\n",
"5\n2\n8\n9\n26\n13\n",
"5\n99\n71\n18\n999\n50\n",
"2\n3\n10\n\nS@MPLE\n",
"5\n1\n8\n9\n26\n13\n"
] | [
"3\n55\n377\n317811\n14930352\n",
"573147844013817084101\n1836311903\n6765\n70330367711422815821835254877183549770181269836358732742604905087154537118196933579742249494562611733487750449241765991088186363265450223647106012053374121273867339111198139373125598767690091902245245323403501\n24157817\n",
"5\n34\n",
... |
CodeContests | Roman loved diamonds. Monica decided to give him a beautiful gift on Valentine's Day. Her idea of diamonds was different though. She lit up all the windows of her rectangular building with N floors and M windows on each floor, with 2 shapes - / or \ . According to her, a diamond was made when such a shape was created:
... | stdin | null | 205 | 1 | [
"1\n2 4\n/ \\ / \\\n\\ / \\ /\n\nSAMPLE\n"
] | [
"2\n"
] | [
"1\n2 4\n/ \\ / \\\n\\ / \\ /\n\nELPMAS\n",
"1\n2 4\n/ \\ / \\\n\\ / ] /\n\nSAMPLE\n",
"1\n2 4\n. \\ / \\\n\\ / ] /\n\nSAMPLE\n",
"1\n2 2\n/ \\ / \\\n\\ / \\ /\n\nELPMAS\n",
"1\n2 4\n/ \\ / [\n\\ / ] /\n\nSAMPLE\n",
"1\n1 2\n/ \\ / \\\n\\ / \\ /\n\nELPMAS\n",
"1\n2 4\n/ \\ / [\n\\ / ^ /\n\nSAMPLE\n",
... | [
"2\n",
"1\n",
"0\n",
"1\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n",
"1\n"
] |
CodeContests | Darshak (Dark) was learning about numerals in words and he came across representation of "6743294" as shown below
.tg {border-collapse:collapse;border-spacing:0;}
.tg td{font-family:Arial, sans-serif;font-size:14px;padding:10px 5px;border-style:solid;border-width:1px;overflow:hidden;word-break:normal;}
.tg th{font-fam... | stdin | null | 3,867 | 1 | [
"3\n1005 0 2\n7347 3 1\n7777 7 4\n\nSAMPLE\n"
] | [
"1\n5\n5\n"
] | [
"6700\n3 3 1\n6 6 1\n12 1 1\n18 1 1\n24 2 1\n30 3 1\n36 3 1\n42 4 1\n48 4 1\n54 5 1\n60 6 1\n66 6 2\n72 7 1\n78 7 1\n84 8 1\n90 9 1\n96 9 1\n102 1 1\n108 1 1\n114 1 1\n120 1 1\n126 1 1\n132 1 1\n138 1 1\n144 1 1\n150 1 1\n156 1 1\n162 1 1\n168 1 1\n174 1 1\n180 1 1\n186 1 1\n192 1 1\n198 1 1\n204 2 1\n210 2 1\n216 ... | [
"5\n13\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n3\n3\n3\n2\n3\n3\n3\n3\n3\n3\n3\n3\n3\n3\n3\n3\n5\n5\n5\n5\n5\n5\n2\n5\n5\n5\n5\n5\n5\n5\n5\n5\n5\n7\n7\n7\n7\n7\n7\n7\n7\n7\n7\n7\n7\n7\n7\n7\n7\n7\n11\n11\n11\n11\n11\n11\n11\n11\n2\n2\n11\n11\n11\n11\n11\n11\n... |
CodeContests | Valentina had a birthday recently.
She got a special piano from parents.
They told her about the piano melodies and the connection with the mathematical sequences.
She got amazed and started to use piano keys to create her own musical sequences.
The piano has m keys, numbered 0 through m-1.
Valentina has already hit... | stdin | null | 2,428 | 1 | [
"3\n4 10 4\n1 3 3 7\n4 10 5\n1 3 3 7\n1 2 12345678987654321\n1\n\nSAMPLE\n"
] | [
"6\n9\n1\n"
] | [
"3\n4 5 4\n1 3 3 7\n4 10 5\n1 3 3 7\n1 2 12345678987654321\n1\n\nSAMPLE\n",
"3\n4 5 4\n1 3 3 7\n4 10 5\n2 3 3 5\n1 2 12345678987654321\n1\n\nSAMPLE\n",
"3\n4 5 4\n1 3 3 7\n4 10 2\n1 3 3 5\n1 2 12345678987654321\n1\n\nSAMPLE\n",
"3\n4 6 4\n1 3 3 7\n4 10 5\n2 3 3 5\n1 2 12345678987654321\n1\n\nSAMPLE\n",
"3\n... | [
"1\n9\n1\n",
"1\n8\n1\n",
"1\n3\n1\n",
"0\n8\n1\n",
"4\n8\n1\n",
"3\n8\n1\n",
"0\n3\n1\n",
"6\n8\n1\n",
"6\n8\n0\n",
"3\n6\n1\n"
] |
CodeContests | There are trains with 26 cars or less. Each vehicle has an identification code from lowercase a to z. No vehicle has the same symbol. However, the order in which the vehicles are connected is arbitrary. The conductor patrols the train. The conductor patrolls back and forth in the train, so he may pass through the same ... | stdin | null | 1,691 | 1 | [
"4\na->e->c->b->d\nb\n",
"4\na->e->c->b->d\nb<-c<-a<-d<-e\nb->a->c<-a->c->d<-c<-a<-b->a->c->d->e<-d\na->e<-a<-d->a->e<-a<-d<-c->d->a<-d<-c<-b->c->d<-c\n"
] | [
"aecbd\nedacb\nbacde\nbcdae\n",
"aecbd\nedacb\nbacde\nbcdae\n"
] | [
"4\na->f->c->b->d\nb\n",
"4\na->e->c->b->d\na\n",
"4\na->f->c->b->d\na\n",
"4\na->f->c->b->d\n`\n",
"4\na->e->c->b->d\nc\n",
"4\na->f->c->b->d\nc\n",
"4\n`->f->c->b->d\nc\n",
"4\n`->f->c->b->d\nd\n",
"4\na->e->c->b->d\nd\n",
"4\na->e->c->b->d\n`\n"
] | [
"afcbd\nb\nb\nb\n",
"aecbd\na\na\na\n",
"afcbd\na\na\na\n",
"afcbd\n`\n`\n`\n",
"aecbd\nc\nc\nc\n",
"afcbd\nc\nc\nc\n",
"`fcbd\nc\nc\nc\n",
"`fcbd\nd\nd\nd\n",
"aecbd\nd\nd\nd\n",
"aecbd\n`\n`\n`\n"
] |
CodeContests | Some of you might have seen instruments like the figure below.
<image>
Figure 1: Spirograph
There are a fixed circle (indicated by A in the figure) and a smaller interior circle with some pinholes (indicated by B). By putting a pen point through one of the pinholes and then rolling the circle B without slipping arou... | stdin | null | 2,179 | 1 | [
"3 2 1\n3 2 0\n0 0 0\n"
] | [
"13.36\n6.28\n"
] | [
"3 3 1\n3 2 0\n0 0 0\n",
"3 3 1\n3 2 1\n0 0 0\n",
"3 4 1\n3 2 0\n0 0 0\n",
"3 1 1\n3 2 0\n0 0 0\n",
"3 3 1\n6 2 1\n0 0 -1\n",
"3 1 2\n3 2 0\n0 0 0\n",
"3 3 1\n9 2 1\n0 0 -1\n",
"3 1 2\n3 2 1\n0 0 0\n",
"3 1 2\n3 2 2\n0 0 -1\n",
"3 3 1\n3 2 0\n1 0 0\n"
] | [
"0.00\n6.28\n",
"0.00\n13.36\n",
"25.53\n6.28\n",
"16.00\n6.28\n",
"0.00\n26.73\n",
"26.73\n6.28\n",
"0.00\n93.55\n",
"26.73\n13.36\n",
"26.73\n16.00\n",
"0.00\n6.28\nnan\n"
] |
CodeContests | Nathan O. Davis is a student at the department of integrated systems. He is now taking a class in in- tegrated curcuits. He is an idiot. One day, he got an assignment as follows: design a logic circuit that takes a sequence of positive integers as input, and that outputs a sequence of 1-bit integers from which the orig... | stdin | null | 3,054 | 1 | [
"4 4\n4 3 2 2\n4 4\n4 3 2 3\n0 0\n"
] | [
"1111001\nGoofy\n"
] | [
"4 4\n4 3 2 2\n4 4\n4 3 0 3\n0 0\n",
"4 4\n4 3 4 2\n4 4\n4 3 0 3\n0 0\n",
"4 5\n4 3 2 3\n4 8\n4 5 1 6\n0 0\n",
"4 4\n4 3 2 1\n4 4\n4 3 1 3\n0 0\n",
"4 4\n8 3 2 2\n4 4\n4 3 3 3\n0 0\n",
"4 4\n4 3 2 2\n4 4\n3 3 4 3\n0 0\n",
"4 4\n4 3 0 2\n4 4\n3 3 4 3\n0 0\n",
"4 4\n4 3 2 2\n4 4\n0 3 2 3\n0 0\n",
"4 4... | [
"1111001\nGoofy\n",
"Goofy\nGoofy\n",
"11011001\nGoofy\n",
"1111000\nGoofy\n",
"Goofy\n1111011\n",
"1111001\n1011110\n",
"Goofy\n1011110\n",
"1111001\nGoofy\n",
"Goofy\nGoofy\n",
"Goofy\nGoofy\n"
] |
CodeContests | Little Pandey is someone who is lazy, and when he's around his best friend GJ, he becomes super lazy. Pandey thinks that he is a Math-wizard, so he picks up a number S and asks GJ to throw him a challenge around that number.
GJ explains Little Pandey a property called nothingness and decides to ask him Q queries bas... | stdin | null | 3,629 | 1 | [
"10 5\n6\n5\n8\n100\n5\n\nSAMPLE\n"
] | [
"2\n5\n-1\n10\n-1\n"
] | [
"371 446\n1952\n9423\n8710\n57979\n535\n84946\n213\n8735\n4485\n7113\n6714\n78762\n500\n308\n97605\n8785\n57265\n5210\n1130\n905\n5961\n76168\n81612\n66595\n66583\n1082\n373\n9386\n28833\n41145\n2566\n239\n722\n838\n5916\n45936\n2427\n602\n38509\n3629\n2636\n7551\n743\n17463\n795\n25183\n299\n595\n7110\n2046\n6851\... | [
"1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n7\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n53\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-... |
CodeContests | problem
There is a light bulb at the grid point $ (x, y) $ that meets $ 1 \ leq x \ leq h, 1 \ leq y \ leq w $.
The power supply is installed at coordinates $ (i + 0.5, j + 0.5) (1 \ leq i <h, 1 \ leq j <w, i + j $ is even) (corrected at 14:21). Coordinates $ When the power supply installed at (i + 0.5, j + 0.5) $ is... | stdin | null | 433 | 1 | [
"4 4 10\n100 100 100 100\n100 100 100 100\n1 100 100 1\n1 1 1 1\n"
] | [
"970\n"
] | [
"4 4 10\n100 100 100 100\n100 100 100 100\n1 100 100 2\n1 1 1 1\n",
"4 4 10\n100 000 100 100\n100 100 100 100\n1 100 100 2\n1 1 1 1\n",
"4 4 10\n100 000 000 100\n100 100 100 100\n1 100 100 2\n1 1 1 1\n",
"4 4 10\n100 000 000 100\n100 110 100 100\n1 100 100 2\n1 1 1 1\n",
"4 4 10\n110 100 100 100\n100 100 10... | [
"970\n",
"870\n",
"770\n",
"780\n",
"980\n",
"680\n",
"880\n",
"990\n",
"774\n",
"1000\n"
] |
CodeContests | Queries with Six Inequeties
Given a set of four integer pairs (a, b, c, d).
The jth query determines if i exists, x_j <a_i <y_j <b_i and z_j <c_i <w_j <d_i.
input
N Q
a_1 b_1 c_1 d_1
a_2 b_2 c_2 d_2
::
a_n b_n c_n d_n
x_1 y_1 z_1 w_1
x_2 y_2 z_2 w_2
::
x_q y_q z_q w_q
output
ans_1
ans_2
::
ans_q
On line j, p... | stdin | null | 3,216 | 1 | [
"2 2\n14 86 9 121\n3 34 3 34\n1 14 5 14\n1 9 1 9\n"
] | [
"No\nYes\n"
] | [
"2 2\n14 86 9 121\n3 34 3 34\n0 14 5 14\n1 9 1 9\n",
"2 2\n14 86 9 121\n0 34 3 34\n0 14 5 18\n1 16 1 9\n",
"2 2\n0 86 9 121\n3 34 3 34\n1 14 1 14\n1 9 1 9\n",
"2 2\n2 86 9 121\n6 34 3 41\n1 14 5 14\n2 9 0 1\n",
"0 1\n14 22 0 121\n0 18 3 34\n-1 14 5 18\n1 16 1 9\n",
"2 3\n2 86 9 121\n6 20 6 74\n1 14 5 14\n... | [
"No\nYes\n",
"No\nNo\n",
"Yes\nYes\n",
"Yes\nNo\n",
"No\n",
"Yes\nNo\nNo\n",
"Yes\n",
"No\nNo\nNo\nNo\n",
"No\nNo\nNo\n",
"No\nYes\n"
] |
CodeContests | Oz is in love with number theory, so he expects you to love it too and solve his problems. The current problem which has been given by Oz to you is in the form of an array. So, he has given you N integers i.e a1,a2,..,aN to deal with. You have to find the number of divisors of the product of all these integers.
Input... | stdin | null | 4,181 | 1 | [
"2\n2 3\n\nSAMPLE\n"
] | [
"4\n"
] | [
"1000\n204 188 114 382 862 941 149 900 904 129 10 845 454 531 993 444 917 639 190 917 462 585 504 946 637 121 275 795 737 815 753 598 632 871 995 565 920 998 760 659 841 708 769 110 92 926 645 491 931 474 45 62 431 524 65 519 963 128 842 297 800 832 111 750 712 284 210 496 445 231 864 273 825 158 680 935 565 756 57... | [
"48654602\n",
"6\n",
"808887762\n",
"961976853\n",
"474590529\n",
"4\n",
"237159226\n",
"5\n",
"670852473\n",
"606773536\n"
] |
CodeContests | Iroha loves Haiku. Haiku is a short form of Japanese poetry. A Haiku consists of three phrases with 5, 7 and 5 syllables, in this order.
To create a Haiku, Iroha has come up with three different phrases. These phrases have A, B and C syllables, respectively. Determine whether she can construct a Haiku by using each of... | stdin | null | 2,369 | 1 | [
"5 5 7\n",
"7 7 5\n"
] | [
"YES\n",
"NO\n"
] | [
"5 5 14\n",
"2 7 5\n",
"5 1 14\n",
"2 7 3\n",
"2 4 3\n",
"2 4 1\n",
"2 4 0\n",
"3 4 0\n",
"4 4 0\n",
"4 4 -1\n"
] | [
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n",
"NO\n"
] |
CodeContests | You are given a string of length N. Calculate the number of distinct substrings of S.
Constraints
* 1 \leq N \leq 500,000
* S consists of lowercase English letters.
Input
Input is given from Standard Input in the following format:
S
Output
Print the answer.
Examples
Input
abcbcba
Output
21
Input
missi... | stdin | null | 2,954 | 1 | [
"abcbcba\n",
"aaaaa\n",
"ababacaca\n",
"mississippi\n"
] | [
"21\n",
"5\n",
"33\n",
"53\n"
] | [
"abcacbb\n",
"baaaa\n",
"aaabacacb\n",
"mjssissippi\n",
"abbacbb\n",
"baaba\n",
"mjssisrippi\n",
"bcacabaa`\n",
"mjssisripph\n",
"bcacabab`\n"
] | [
"24\n",
"9\n",
"37\n",
"57\n",
"23\n",
"11\n",
"61\n",
"39\n",
"62\n",
"38\n"
] |
CodeContests | We have a grid with N rows and N columns. The cell at the i-th row and j-th column is denoted (i, j).
Initially, M of the cells are painted black, and all other cells are white. Specifically, the cells (a_1, b_1), (a_2, b_2), ..., (a_M, b_M) are painted black.
Snuke will try to paint as many white cells black as poss... | stdin | null | 3,358 | 1 | [
"2 2\n1 1\n1 2\n",
"3 2\n1 2\n2 3\n",
"4 3\n1 2\n1 3\n4 4\n"
] | [
"4\n",
"3\n",
"3\n"
] | [
"2 2\n1 2\n1 2\n",
"7 3\n1 2\n1 3\n4 4\n",
"2 2\n2 1\n1 2\n",
"3 1\n1 4\n2 3\n",
"13 3\n1 2\n1 4\n4 4\n",
"2 0\n1 4\n2 3\n",
"7 3\n2 2\n1 4\n4 4\n",
"3 2\n1 4\n2 3\n",
"13 3\n1 2\n1 3\n4 4\n",
"13 3\n1 2\n1 3\n4 5\n"
] | [
"2\n",
"3\n",
"4\n",
"1\n",
"9\n",
"0\n",
"5\n",
"2\n",
"3\n",
"3\n"
] |
CodeContests | Let’s take a prime P = 200\,003. You are given N integers A_1, A_2, \ldots, A_N. Find the sum of ((A_i \cdot A_j) \bmod P) over all N \cdot (N-1) / 2 unordered pairs of elements (i < j).
Please note that the sum isn't computed modulo P.
Constraints
* 2 \leq N \leq 200\,000
* 0 \leq A_i < P = 200\,003
* All values in... | stdin | null | 2,242 | 1 | [
"4\n2019 0 2020 200002\n",
"5\n1 1 2 2 100000\n"
] | [
"474287\n",
"600013\n"
] | [
"4\n1234 0 2020 200002\n",
"5\n1 1 2 3 100000\n",
"4\n1234 0 3282 200002\n",
"5\n1 1 2 3 101000\n",
"5\n1 1 2 3 001000\n",
"5\n1 1 1 3 001000\n",
"5\n1 1 0 3 001000\n",
"5\n0 1 0 3 001000\n",
"5\n0 2 0 3 001000\n",
"5\n0 1 0 3 001100\n"
] | [
"489396\n",
"500014\n",
"445418\n",
"307011\n",
"7017\n",
"6012\n",
"5007\n",
"4003\n",
"5006\n",
"4403\n"
] |
CodeContests | Mr. Hahn, our very own DJ, was seeing Chester and Mike fighting over such questions lately. Being a geek himself, he thought of showing off his skills and gave the both of them a question.
He gave them a single positive integer, N. For all the numbers under 10^N(inclusive) they had to add the square of the digits of ... | stdin | null | 2,871 | 1 | [
"1\n\nSAMPLE\n"
] | [
"7 3\n"
] | [
"1\n\nSANPLE\n",
"1\n\nSANQLE\n",
"1\n\nSNAQLE\n",
"1\n\nSEAQLN\n",
"1\n\nSEAQNL\n",
"1\n\nSEARNL\n",
"1\n\nSEARNM\n",
"1\n\nMNRAES\n",
"1\n\nSNRAEM\n",
"1\n\nMEARNS\n"
] | [
"7 3\n",
"7 3\n",
"7 3\n",
"7 3\n",
"7 3\n",
"7 3\n",
"7 3\n",
"7 3\n",
"7 3\n",
"7 3\n"
] |
CodeContests | Mr. A and Mr. B live in an N × M rectangular grid area. Each square is either a road, a wall, or a house. Since this area is famous for the frequent occurrence of molestation damage due to the complicated and intricate roads, the boundary between this area and the outside is completely surrounded by walls and isolated.... | stdin | null | 987 | 1 | [
"4 4\n....\n.#.G\n...#\n^#..\n",
"3 3\n...\n.G.\n.>.\n",
"3 3\nG##\n.#.\n.\n",
"3 3\nG##\n.#.\n.>.\n",
"3 3\nG##\n.#.\n.<.\n"
] | [
"8\n",
"-1\n",
"4\n",
"6\n",
"4\n"
] | [
"4 4\n....\n.#.G\n...#\n..#^\n",
"3 3\nG##\n.#-\n.>.\n",
"3 3\n##G\n.#-\n.>.\n",
"4 4\n....\n.#.G\n-..#\n^#..\n",
"3 3\n##G\n#..\n<..\n",
"4 4\n./..\n.#.G\n...\"\n..#^\n",
"4 4\n-...\nG.#.\n...#\n^#..\n",
"4 4\n....\nG.#.\n...#\n..\"^\n",
"3 3\n../\nG-.\n.>.\n",
"4 3\n...\n.G.\n.>.\n"
] | [
"-1\n",
"6\n",
"4\n",
"8\n",
"5\n",
"3\n",
"13\n",
"11\n",
"7\n",
"-1\n"
] |
CodeContests | You are lost in a dense jungle and it is getting dark. There is at least one path that leads you to the city on the other side but you cannot see anything until you are right in front of it as the trees and bushes obscure the path.
Devise an algorithm that is guaranteed to find the way out. Your goal is to go out of... | stdin | null | 2,551 | 1 | [
"5\nS P P P P\nT P T P P\nT P P P P\nP T E T T\nP T P T T\n\nSAMPLE\n"
] | [
"5\n"
] | [
"14\nS P P P P P P T P T P P P P\nP P T P T P T P P E P T T P\nT T P P P T P T P T T P P T\nP P P T P T T P P P P P T P\nP P T P P P P T P T T P P T\nT T P T P T P P T P T P T P\nP P P P P T P T P P P P P P\nT P T P T P P P T P T P T T\nT T P T T P T T P P P T P T\nP P T P P P T P T P T P P P\nP T P P T T P T T P T... | [
"44\n",
"5\n",
"44\n",
"5\n",
"44\n",
"5\n",
"5\n",
"44\n",
"5\n",
"44\n"
] |
CodeContests | There are a number of ways to shuffle a deck of cards. Hanafuda shuffling for Japanese card game 'Hanafuda' is one such example. The following is how to perform Hanafuda shuffling.
There is a deck of n cards. Starting from the p-th card from the top of the deck, c cards are pulled out and put on the top of the deck, a... | stdin | null | 857 | 1 | [
"5 2\n3 1\n3 1\n10 3\n1 10\n10 1\n8 3\n0 0\n"
] | [
"4\n4\n"
] | [
"5 2\n3 1\n3 1\n10 3\n1 10\n10 1\n8 0\n0 0\n",
"5 0\n3 1\n3 1\n10 3\n1 10\n10 1\n8 0\n0 0\n",
"5 0\n3 1\n3 1\n10 2\n1 10\n10 1\n11 0\n0 0\n",
"5 2\n3 1\n3 1\n10 3\n1 11\n10 1\n8 3\n0 0\n",
"6 2\n3 1\n3 1\n10 3\n1 10\n10 1\n8 0\n0 0\n",
"5 0\n3 1\n3 1\n10 3\n2 10\n10 1\n8 0\n0 0\n",
"5 0\n3 1\n3 1\n3 3\n... | [
"4\n1\n",
"5\n1\n1\n",
"5\n1\n1\n11\n",
"4\n4\n",
"5\n1\n",
"5\n1\n10\n",
"5\n1\n3\n",
"5\n1\n7\n11\n",
"5\n1\n1\n2\n",
"1\n1\n10\n"
] |
CodeContests | Gazi is a very talented mathematician, recently he discovered the majestic power of the number '9' so he wants to play a game with you. He tells you to pick any real integer [from 10 to 10^200], then subtract sum of digits of this number from the number itself.
You will get another number, now omit any digit from this ... | stdin | null | 1,633 | 1 | [
"4\n4_1\n52_2\n63_124\n25141452_5575\n\nSAMPLE\n"
] | [
"4\n0 or 9\n2\n8\n"
] | [
"4\n4_1\n52_2\n63_124\n25141452_5575\n\nS@MPLE\n",
"4\n4_1\n52_2\n63_124\n25141452_5575\n\nR@MPLE\n",
"4\n4_1\n52_2\n63_124\n25141452_5575\n\nELPM@R\n",
"4\n4_1\n52_2\n63_124\n25141452_5575\n\nM@SPLE\n",
"4\n4_1\n52_2\n63_124\n25141452_5575\n\nR@MPME\n",
"4\n4_1\n52_2\n63_124\n25141452_5575\n\nM@SPLF\n",
... | [
"4\n0 or 9\n2\n8\n",
"4\n0 or 9\n2\n8\n",
"4\n0 or 9\n2\n8\n",
"4\n0 or 9\n2\n8\n",
"4\n0 or 9\n2\n8\n",
"4\n0 or 9\n2\n8\n",
"4\n0 or 9\n2\n8\n",
"4\n0 or 9\n2\n8\n",
"4\n0 or 9\n2\n8\n",
"4\n0 or 9\n2\n8\n"
] |
CodeContests | Katoch, a notorious boy, is always keen about getting number 1. Given a number, he squares every digit of the number and adds to the result. He repeats the process until he gets a 1 digit number. Suppose he is given a number 82, he squares 8 & 2 individually and then add the result to make it 68. Then he continues with... | stdin | null | 3,664 | 1 | [
"3\n82 \n1\n67\n\nSAMPLE\n"
] | [
"Case #1:YES\nCase #2:YES\nCase #3:NO\n"
] | [
"3\n153 \n1\n67\n\nSAMPLE\n",
"3\n153 \n2\n67\n\nELPMAS\n",
"3\n44 \n1\n67\n\nSAMPLE\n",
"3\n36 \n1\n32\n\nFLOMAS\n",
"3\n244 \n2\n44\n\nELPMAS\n",
"3\n13 \n2\n3\n\nSANPLF\n",
"3\n23 \n12\n1\n\nSOLMAE\n",
"3\n23 \n10\n1\n\nSOMMAE\n",
"3\n153 \n1\n67\n\nELPMAS\n",
"3\n153 \n2\n67\n\nFLPMAS\n"
] | [
"Case #1:NO\nCase #2:YES\nCase #3:NO\n",
"Case #1:NO\nCase #2:NO\nCase #3:NO\n",
"Case #1:YES\nCase #2:YES\nCase #3:NO\n",
"Case #1:NO\nCase #2:YES\nCase #3:YES\n",
"Case #1:NO\nCase #2:NO\nCase #3:YES\n",
"Case #1:YES\nCase #2:NO\nCase #3:NO\n",
"Case #1:YES\nCase #2:NO\nCase #3:YES\n",
"Case #1:YES\... |
CodeContests | For every string given as input, you need to tell us the number of subsequences of it that are palindromes (need not necessarily be distinct). Note that the empty string is not a palindrome.
SAMPLE INPUT
1
aab
SAMPLE OUTPUT
4
Explanation
the palindromic subsequences of "aab" are:
"a", "a", "b", "aa", and the metho... | stdin | null | 1,359 | 1 | [
"1\naab\n\nSAMPLE\n"
] | [
"4\n"
] | [
"1\nbaa\n\nSAMPLE\n",
"1\n`ab\n\nSAMPLE\n",
"1\nb`b\n\nMASPLE\n",
"1\na`b\n\nSAMPLE\n",
"1\na`b\n\nS@MPLE\n",
"1\na`b\n\nMASPLE\n",
"1\nbab\n\nMASPLE\n",
"1\nbab\n\nELPSAM\n",
"1\nbab\n\nELPSBM\n",
"1\nbab\n\nDLPSBM\n"
] | [
"4\n",
"3\n",
"5\n",
"3\n",
"3\n",
"3\n",
"5\n",
"5\n",
"5\n",
"5\n"
] |
CodeContests | In the beginning, Takahashi has A cookies, and Aoki has B cookies. They will perform the following operation alternately, starting from Takahashi:
* If the number of cookies in his hand is odd, eat one of those cookies; if the number is even, do nothing. Then, give one-half of the cookies in his hand to the other pers... | stdin | null | 3,715 | 1 | [
"3 3 3\n",
"5 4 2\n",
"314159265 358979323 84\n"
] | [
"1 3\n",
"5 3\n",
"448759046 224379523\n"
] | [
"3 2 3\n",
"5 4 1\n",
"231274241 358979323 84\n",
"0 2 3\n",
"8 4 1\n",
"377378637 358979323 84\n",
"0 0 3\n",
"8 4 2\n",
"7425724 358979323 84\n",
"10 4 2\n"
] | [
"1 2\n",
"2 6\n",
"393502366 196751183\n",
"0 1\n",
"4 8\n",
"490905292 245452646\n",
"0 0\n",
"8 4\n",
"244270020 122135010\n",
"9 4\n"
] |
CodeContests | ICPC World Finals Day 1
In programming contests, it is important to know the execution time of the program. If you make a mistake in estimating the execution time and write code that exceeds the time limit, you will lose that much time. This is especially true in team battles where only one computer can be used, such ... | stdin | null | 4,952 | 1 | [
"n T\nf(n)\n"
] | [
"101010000\n"
] | [
"n T\ng(n)\n",
"m T\ng(n)\n",
"n T\n)n(g\n",
"n S\n)n(g\n",
"n S\n)n(h\n",
"n S\nh(n)\n",
"n R\nh(n)\n",
"n R\nh(n(\n",
"n R\nh((n\n",
"m R\nh((n\n"
] | [
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n"
] |
CodeContests | C: Skewering
problem
One day, when Homura was playing with blocks, Tempura came. Homura decided to play with blocks with Tempura.
There is a rectangular parallelepiped of A \ times B \ times C, which is made by stacking A \ times B \ times C blocks of cubic blocks with a side length of 1 without any gaps. Each side ... | stdin | null | 3,215 | 1 | [
"1 1 10\n"
] | [
"Hom\n"
] | [
"2 1 10\n",
"2 1 1\n",
"2 1 2\n",
"4 1 2\n",
"2 1 0\n",
"1 2 10\n",
"2 2 10\n",
"4 1 3\n",
"2 2 0\n",
"3 2 10\n"
] | [
"Tem\n",
"Hom\n",
"Tem\n",
"Tem\n",
"Tem\n",
"Tem\n",
"Tem\n",
"Hom\n",
"Tem\n",
"Tem\n"
] |
CodeContests | In the country there are N cities numbered 1 through N, which are connected by N-1 bidirectional roads. In terms of graph theory, there is a unique simple path connecting every pair of cities. That is, the N cities form a tree. Besides, if we view city 1 as the root of this tree, the tree will be a full binary tree (a ... | stdin | null | 1,853 | 1 | [
"9\n1 2\n1 2\n3 2\n3 2\n5 2\n5 2\n7 2\n7 2\n",
"3\n1 0\n1 0\n",
"7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 1\n",
"15\n1 2\n1 5\n3 3\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n"
] | [
"6\n",
"0\n",
"4\n",
"15\n"
] | [
"9\n1 2\n1 2\n3 3\n3 2\n5 2\n5 2\n7 2\n7 2\n",
"3\n1 1\n1 0\n",
"7\n1 1\n1 1\n2 1\n2 1\n3 1\n3 0\n",
"15\n1 2\n1 5\n3 1\n4 3\n4 3\n6 5\n5 4\n5 3\n6 3\n3 2\n11 5\n11 3\n13 2\n13 1\n",
"7\n1 1\n1 2\n2 1\n2 1\n3 1\n3 1\n",
"9\n1 2\n1 3\n3 3\n3 2\n5 2\n5 2\n7 2\n7 2\n",
"3\n1 2\n1 0\n",
"3\n1 4\n1 0\n",
... | [
"7\n",
"1\n",
"3\n",
"14\n",
"5\n",
"8\n",
"2\n",
"4\n",
"6\n",
"9\n"
] |
CodeContests | Fox Jiro is one of the staffs of the ACM-ICPC 2018 Asia Yokohama Regional Contest and is responsible for designing the network for the venue of the contest. His network consists of $N$ computers, which are connected by $M$ cables. The $i$-th cable connects the $a_i$-th computer and the $b_i$-th computer, and it carries... | stdin | null | 4,091 | 1 | [
"2 1 1 2\n1 2\n",
"5 5 1 5\n1 2\n1 4\n2 3\n3 4\n3 5\n",
"3 3 1 2\n1 2\n1 3\n2 3\n",
"5 4 1 5\n1 2\n2 3\n3 4\n4 5\n"
] | [
"3\n",
"3\n",
"2\n",
"-1\n"
] | [
"5 5 1 5\n1 2\n1 4\n1 3\n3 4\n3 5\n",
"3 3 1 2\n1 2\n1 3\n1 3\n",
"5 5 1 5\n1 2\n1 4\n1 3\n3 4\n3 2\n",
"5 5 1 5\n1 1\n1 4\n2 3\n2 4\n3 5\n",
"5 4 1 2\n1 2\n2 3\n3 4\n4 5\n",
"5 5 1 5\n1 1\n1 4\n1 3\n3 4\n3 5\n",
"5 5 1 5\n1 1\n1 4\n1 3\n3 4\n1 5\n",
"5 5 1 5\n1 1\n1 4\n1 4\n3 4\n1 5\n",
"6 3 1 2\n1... | [
"2\n",
"3\n",
"-1\n",
"5\n",
"3\n",
"2\n",
"2\n",
"2\n",
"2\n",
"-1\n"
] |
CodeContests | A tutorial for this problem is now available on our blog. Click here to read it.
The following problem appeared in the CodeChef March '09 Challenge
In the mysterious country of Byteland, everything is quite different from what you'd
normally expect. In most places, if you were approached by two mobsters in a dark al... | stdin | null | 4,958 | 1 | [
"5\n3 3\n1\n1\n1\n5 11\n1\n2\n4\n8\n16\n5 23\n1\n2\n4\n8\n16\n5 13\n1\n5\n5\n10\n10\n20 132\n17\n6\n4\n998\n254\n137\n259\n153\n154\n3\n28\n19\n123\n542\n857\n23\n687\n35\n99\n999\n"
] | [
"Yes\nYes\nYes\nNo\nYes\n"
] | [
"5\n3 3\n1\n1\n1\n5 11\n1\n2\n4\n8\n16\n5 23\n1\n2\n4\n8\n16\n5 13\n1\n5\n5\n10\n10\n20 132\n17\n6\n4\n998\n254\n137\n259\n153\n154\n3\n28\n19\n123\n542\n857\n23\n687\n35\n126\n999\n",
"5\n3 3\n1\n1\n1\n5 11\n1\n2\n4\n14\n16\n5 23\n1\n2\n4\n8\n16\n5 13\n1\n0\n5\n10\n10\n20 132\n17\n6\n4\n998\n254\n137\n259\n153\n... | [
"Yes\nYes\nYes\nNo\nYes\n",
"Yes\nNo\nYes\nNo\nYes\n",
"No\nYes\nYes\nNo\nYes\n",
"Yes\nNo\nYes\nYes\nYes\n",
"Yes\nYes\nNo\nNo\nYes\n",
"Yes\nNo\nNo\nNo\nYes\n",
"No\nNo\nNo\nNo\nYes\n",
"Yes\nYes\nYes\nYes\nYes\n",
"Yes\nYes\nYes\nNo\nNo\n",
"No\nNo\nYes\nNo\nYes\n"
] |
CodeContests | Problem
If you bring an empty bottle of $ a $ milk, you can exchange it for a new bottle of $ b $ milk.
How many bottles of milk can Mr. Kawabayashi, who initially has a bottle of $ x $ milk, drink? Output the remainder after dividing by $ 1000000007 $.
Constraints
The input satisfies the following conditions.
* $ ... | stdin | null | 1,465 | 1 | [
"316250877917604 316250877917599 681260158257385\n",
"3 1 5\n",
"82 69 64\n",
"3 2 5\n"
] | [
"62687552\n",
"7\n",
"64\n",
"11\n"
] | [
"82 69 103\n",
"3 2 1\n",
"82 69 114\n",
"3 2 0\n",
"98 69 114\n",
"560118409912468 316250877917599 681260158257385\n",
"5 1 5\n",
"82 69 30\n",
"82 69 73\n",
"82 78 114\n"
] | [
"241\n",
"1\n",
"321\n",
"0\n",
"183\n",
"29192407\n",
"6\n",
"30\n",
"73\n",
"816\n"
] |
CodeContests | There are N balls and N+1 holes in a line. Balls are numbered 1 through N from left to right. Holes are numbered 1 through N+1 from left to right. The i-th ball is located between the i-th hole and (i+1)-th hole. We denote the distance between neighboring items (one ball and one hole) from left to right as d_i (1 \leq ... | stdin | null | 616 | 1 | [
"1 3 3\n",
"1000 100 100\n",
"2 1 0\n"
] | [
"4.500000000000000\n",
"649620280.957660079002380\n",
"2.500000000000000\n"
] | [
"1 6 3\n",
"1000 100 000\n",
"2 1 -1\n",
"1 6 5\n",
"1010 100 000\n",
"3 1 0\n",
"2 6 5\n",
"1010 000 000\n",
"6 1 0\n",
"2 0 5\n"
] | [
"7.500000000000\n",
"649295.633141090046\n",
"-1.250000000000\n",
"8.500000000000\n",
"656786.582121852669\n",
"4.333333333333\n",
"33.750000000000\n",
"0.000000000000\n",
"11.150000000000\n",
"18.750000000000\n"
] |
CodeContests | Snuke got positive integers s_1,...,s_N from his mother, as a birthday present. There may be duplicate elements.
He will circle some of these N integers. Since he dislikes cubic numbers, he wants to ensure that if both s_i and s_j (i ≠ j) are circled, the product s_is_j is not cubic. For example, when s_1=1,s_2=1,s_3=... | stdin | null | 1,017 | 1 | [
"10\n1\n10\n100\n1000000007\n10000000000\n1000000009\n999999999\n999\n999\n999\n",
"6\n2\n4\n8\n16\n32\n64\n",
"8\n1\n2\n3\n4\n5\n6\n7\n8\n"
] | [
"9\n",
"3\n",
"6\n"
] | [
"10\n1\n11\n100\n1000000007\n10000000000\n1000000009\n999999999\n999\n999\n999\n",
"8\n1\n2\n4\n4\n5\n6\n7\n8\n",
"8\n1\n2\n6\n4\n5\n7\n7\n3\n",
"6\n2\n4\n8\n16\n32\n54\n",
"10\n1\n11\n100\n1000000007\n10000000100\n1000000009\n999999999\n1416\n999\n999\n",
"6\n2\n4\n16\n16\n45\n54\n",
"8\n1\n2\n6\n2\n5\... | [
"9\n",
"6\n",
"7\n",
"4\n",
"10\n",
"5\n",
"8\n",
"9\n",
"6\n",
"6\n"
] |
CodeContests | Benny noticed a random property of numbers. The numbers which followed this property were called as interesting numbers by Benny. Let's dive into what Benny discovered about these numbers.
1 is an interesting number.
For every N > 1 , N is interesting if it has odd number of interesting proper divisors.
For example, ... | stdin | null | 956 | 1 | [
"5\n1\n2\n3\n4\n5\n\nSAMPLE\n"
] | [
"Yes\nYes\nYes\nNo\nYes\n"
] | [
"100\n177516\n548318\n947070\n996389\n442876\n581113\n232970\n244787\n709020\n235780\n872996\n566711\n910912\n257947\n388443\n388046\n175914\n683712\n477366\n243405\n816041\n749142\n592028\n782210\n136192\n938915\n436231\n584008\n498033\n800756\n210311\n957652\n976816\n977414\n8972\n136634\n464072\n889206\n284392\n... | [
"No\nYes\nNo\nYes\nNo\nYes\nYes\nYes\nNo\nNo\nNo\nYes\nNo\nYes\nYes\nYes\nNo\nNo\nYes\nNo\nYes\nNo\nNo\nYes\nNo\nYes\nYes\nNo\nNo\nNo\nYes\nNo\nNo\nYes\nNo\nYes\nNo\nYes\nNo\nYes\nYes\nYes\nNo\nYes\nYes\nYes\nNo\nNo\nNo\nYes\nYes\nNo\nNo\nNo\nYes\nYes\nNo\nNo\nNo\nYes\nYes\nNo\nNo\nNo\nYes\nYes\nNo\nNo\nYes\nYes\nY... |
CodeContests | The educational program (AHK Education) of the Aiz Broadcasting Corporation broadcasts a program called "Play with Tsukuro" for children. Today is the time to make a box with drawing paper, but I would like to see if the rectangular drawing paper I prepared can make a rectangular parallelepiped. However, do not cut or ... | stdin | null | 107 | 1 | [
"2 2\n2 3\n2 3\n2 3\n2 2\n3 2\n",
"2 2\n2 3\n2 3\n2 3\n2 2\n2 2\n"
] | [
"yes\n",
"no\n"
] | [
"2 2\n2 3\n2 3\n2 3\n2 2\n5 2\n",
"2 2\n2 3\n2 2\n2 3\n2 2\n2 2\n",
"2 2\n2 3\n2 3\n2 2\n2 2\n5 2\n",
"2 2\n2 3\n2 2\n2 3\n2 2\n2 3\n",
"2 2\n2 3\n2 3\n2 2\n2 2\n10 2\n",
"2 2\n2 3\n4 2\n2 3\n2 2\n2 3\n",
"2 2\n2 3\n2 2\n2 2\n2 2\n10 2\n",
"2 2\n2 3\n4 4\n2 3\n2 2\n2 3\n",
"2 2\n2 3\n4 2\n2 2\n2 2\n... | [
"no\n",
"no\n",
"no\n",
"no\n",
"no\n",
"no\n",
"no\n",
"no\n",
"no\n",
"no\n"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.