name stringlengths 2 112 | description stringlengths 29 13k | private_tests dict | public_tests dict | generated_tests dict |
|---|---|---|---|---|
p03519 CODE FESTIVAL 2017 Elimination Tournament Round 1 (Parallel) - Paired Parentheses | You are given two sequences a and b, both of length 2N. The i-th elements in a and b are a_i and b_i, respectively. Using these sequences, Snuke is doing the job of calculating the beauty of pairs of balanced sequences of parentheses (defined below) of length 2N. The beauty of a pair (s,t) is calculated as follows:
* ... | {
"input": [],
"output": []
} | {
"input": [
"2 2\n1 1 7 3\n4 2 3 3\n2 4 6\n3 2 5",
"7 7\n34 -20 -27 42 44 29 9 11 20 44 27 19 -31 -29\n46 -50 -11 20 28 46 12 13 33 -22 -48 -27 35 -17\n7 27 34\n12 -2 22\n4 -50 -12\n3 -32 15\n8 -7 23\n3 -30 11\n4 -2 23"
],
"output": [
"15\n15",
"311\n312\n260\n286\n296\n292\n327"
]
} | {
"input": [
"2 2\n1 1 6 3\n4 2 3 3\n2 4 6\n3 2 5",
"7 7\n34 -20 -27 42 44 29 9 11 20 44 27 19 -31 -29\n73 -50 -11 20 28 46 12 13 33 -22 -48 -27 35 -17\n7 27 34\n12 -2 22\n4 -50 -12\n3 -32 15\n8 -7 23\n3 -30 11\n4 -2 23",
"2 2\n1 1 6 3\n4 2 3 3\n2 1 6\n3 2 5",
"2 2\n1 1 6 3\n4 2 3 3\n2 1 6\n1 2 5",
... |
p03684 AtCoder Regular Contest 076 - Built? | There are N towns on a plane. The i-th town is located at the coordinates (x_i,y_i). There may be more than one town at the same coordinates.
You can build a road between two towns at coordinates (a,b) and (c,d) for a cost of min(|a-c|,|b-d|) yen (the currency of Japan). It is not possible to build other types of road... | {
"input": [],
"output": []
} | {
"input": [
"6\n8 3\n4 9\n12 19\n18 1\n13 5\n7 6",
"3\n1 5\n3 9\n7 8"
],
"output": [
"8",
"3"
]
} | {
"input": [
"6\n8 3\n4 9\n12 19\n2 1\n13 5\n7 6",
"3\n0 5\n3 9\n7 8",
"6\n8 3\n4 9\n12 19\n2 1\n15 5\n7 6",
"3\n0 8\n3 9\n7 8",
"6\n8 3\n4 9\n12 19\n2 2\n15 5\n7 6",
"6\n8 3\n4 9\n12 19\n2 4\n12 5\n7 6",
"6\n8 3\n4 5\n12 19\n2 4\n12 5\n7 6",
"6\n7 3\n4 5\n12 19\n2 4\n12 5\n7 6",
"... |
p03837 AtCoder Beginner Contest 051 - Candidates of No Shortest Paths | You are given an undirected connected weighted graph with N vertices and M edges that contains neither self-loops nor double edges.
The i-th (1≤i≤M) edge connects vertex a_i and vertex b_i with a distance of c_i.
Here, a self-loop is an edge where a_i = b_i (1≤i≤M), and double edges are two edges where (a_i,b_i)=(a_j,b... | {
"input": [],
"output": []
} | {
"input": [
"3 3\n1 2 1\n1 3 1\n2 3 3",
"3 2\n1 2 1\n2 3 1"
],
"output": [
"1",
"0"
]
} | {
"input": [
"3 3\n1 2 2\n1 3 1\n2 3 3",
"4 3\n1 2 1\n1 3 1\n2 3 3",
"3 2\n1 2 2\n2 3 1",
"3 2\n1 3 2\n2 3 1",
"3 2\n1 3 2\n2 0 1",
"3 2\n1 2 2\n2 0 1",
"3 2\n2 2 2\n2 0 1",
"3 2\n1 1 1\n2 3 1",
"3 3\n1 2 2\n1 3 1\n2 3 0",
"3 2\n1 3 2\n2 1 1",
"3 2\n1 2 2\n2 -1 1",
"4 3... |
p04004 AtCoder Regular Contest 061 - Card Game for Three | Alice, Bob and Charlie are playing Card Game for Three, as below:
* At first, each of the three players has a deck consisting of some number of cards. Alice's deck has N cards, Bob's deck has M cards, and Charlie's deck has K cards. Each card has a letter `a`, `b` or `c` written on it. The orders of the cards in the d... | {
"input": [],
"output": []
} | {
"input": [
"4 2 2",
"1 1 1",
"1000 1000 1000"
],
"output": [
"1227",
"17",
"261790852"
]
} | {
"input": [
"4 1 2",
"1 0 1",
"1010 1000 1000",
"4 1 0",
"1010 0000 1000",
"4 1 -1",
"1000 0000 1000",
"1001 1000 1000",
"8 2 2",
"1000 1010 1000",
"4 1 3",
"1 2 1",
"1010 1010 1000",
"1 2 0",
"1010 0010 1000",
"1000 0100 1000",
"1001 1010 1000",
... |
p00090 Overlaps of Seals | Stick n circular stickers with a radius of 1 on a square origami paper with a side length of 10. The stickers can be stacked. Create a program that reads the coordinates of the position where the stickers are to be attached and outputs the number of stickers at the place where the stickers overlap most on the origami p... | {
"input": [],
"output": []
} | {
"input": [
"15\n3.14979,8.51743\n2.39506,3.84915\n2.68432,5.39095\n5.61904,9.16332\n7.85653,4.75593\n2.84021,5.41511\n1.79500,8.59211\n7.55389,8.17604\n4.70665,4.66125\n1.63470,4.42538\n7.34959,4.61981\n5.09003,8.11122\n5.24373,1.30066\n0.13517,1.83659\n7.57313,1.58150\n0"
],
"output": [
"4"
]
} | {
"input": [
"15\n3.13979,8.51743\n2.39506,3.84915\n2.68432,5.39095\n5.61904,9.16332\n7.85653,4.75593\n2.84021,5.41511\n1.79500,8.59211\n7.55389,8.17604\n4.70665,4.66125\n1.63470,4.42538\n7.34959,4.61981\n5.09003,8.11122\n5.24373,1.30066\n0.13517,1.83659\n7.57313,1.58150\n0",
"15\n3.13979,8.51743\n2.39506,3.8... |
p00222 Prime Quadruplet | A set of four prime numbers arranged like (a, a + 2, a + 6, a + 8) is called a quadruplet prime number. Of the four prime numbers that make up a quadruplet prime, the largest number is called the size of the quadruplet prime. For example, the smallest prime quadruplet is a set of (5, 7, 11, 13), which is 13 in size. Th... | {
"input": [],
"output": []
} | {
"input": [
"13\n14\n15\n16\n17\n18\n19\n20\n10000\n0"
],
"output": [
"13\n13\n13\n13\n13\n13\n19\n19\n9439"
]
} | {
"input": [
"13\n14\n15\n16\n17\n18\n0\n20\n10000\n0",
"13\n14\n15\n16\n17\n27\n0\n20\n10000\n0",
"13\n14\n27\n16\n17\n27\n0\n-1\n11000\n0",
"13\n14\n15\n16\n17\n18\n19\n20\n00000\n0",
"13\n26\n15\n16\n17\n27\n0\n20\n10000\n0",
"13\n14\n15\n16\n32\n27\n0\n-1\n11000\n0",
"13\n14\n23\n16\n1... |
p00384 Dungeon 2 | Bob is playing a game called "Dungeon 2" which is the sequel to the popular "Dungeon" released last year. The game is played on a map consisting of $N$ rooms and $N-1$ roads connecting them. The roads allow bidirectional traffic and the player can start his tour from any room and reach any other room by way of multiple... | {
"input": [],
"output": []
} | {
"input": [
"7\n6\n1\n-1\n4\n3\n3\n1\n1 2\n2 3\n3 4\n3 5\n5 6\n5 7",
"4\n5\n0\n1\n1\n1 2\n2 3\n2 4"
],
"output": [
"10",
"5"
]
} | {
"input": [
"7\n6\n1\n-1\n5\n3\n3\n1\n1 2\n2 3\n3 4\n3 5\n5 6\n5 7",
"4\n5\n0\n1\n1\n1 2\n2 4\n2 4",
"7\n0\n1\n-1\n4\n3\n3\n1\n1 2\n2 3\n3 4\n3 5\n5 6\n5 7",
"4\n0\n0\n0\n1\n1 2\n2 3\n2 4",
"7\n8\n1\n-1\n5\n3\n3\n1\n1 2\n2 3\n3 4\n3 5\n5 6\n5 7",
"4\n2\n1\n0\n1\n1 2\n2 3\n2 4",
"7\n0\n1\n... |
p00600 Computation of Minimum Length of Pipeline | The Aizu Wakamatsu city office decided to lay a hot water pipeline covering the whole area of the city to heat houses. The pipeline starts from some hot springs and connects every district in the city. The pipeline can fork at a hot spring or a district, but no cycle is allowed. The city office wants to minimize the le... | {
"input": [],
"output": []
} | {
"input": [
"3 5\n12 8 25 19 23\n9 13 16 0 17\n20 14 16 10 22\n17 27 18 16\n9 7 0\n19 5\n21\n0 0"
],
"output": [
"38"
]
} | {
"input": [
"3 5\n12 8 25 19 44\n9 13 16 0 17\n20 14 16 10 22\n17 27 18 16\n9 7 0\n19 5\n21\n0 0",
"3 5\n12 15 70 19 44\n9 13 16 0 17\n20 14 16 10 22\n17 27 18 16\n9 7 0\n19 5\n21\n0 0",
"3 5\n12 8 25 19 23\n9 13 16 0 17\n20 9 16 10 22\n17 27 18 16\n1 7 0\n19 5\n21\n0 0",
"3 5\n12 15 70 19 44\n16 13 ... |
p00736 How can I satisfy thee? Let me count the ways... | Three-valued logic is a logic system that has, in addition to "true" and "false", "unknown" as a valid value. In the following, logical values "false", "unknown" and "true" are represented by 0, 1 and 2 respectively.
Let "-" be a unary operator (i.e. a symbol representing one argument function) and let both "*" and "+... | {
"input": [],
"output": []
} | {
"input": [
"(P*Q)\n(--R+(P*Q))\n(P*-P)\n2\n1\n(-1+(((---P+Q)*(--Q+---R))*(-R+-P)))\n."
],
"output": [
"3\n11\n0\n27\n0\n7"
]
} | {
"input": [
"(P*Q)\n(--R+(P*R))\n(P*-P)\n2\n1\n(-1+(((---P+Q)*(--Q+---R))*(-R+-P)))\n.",
"(P*Q)\n(--R+(P*Q))\n(P*-P)\n1\n1\n(-1+(((---P+Q)*(--Q+---R))*(-R+-P)))\n.",
"(P*Q)\n(--R+(P*R))\n(P*-P)\n1\n0\n(-1+(((---P+Q)*(--Q+---R))*(-R+-P)))\n.",
"(P*Q)\n(--R+(P*Q))\n(P*-P)\n1\n2\n(-1+(((---P+Q)*(--Q+---... |
p00876 Swimming Jam | Despite urging requests of the townspeople, the municipal office cannot afford to improve many of the apparently deficient city amenities under this recession. The city swimming pool is one of the typical examples. It has only two swimming lanes. The Municipal Fitness Agency, under this circumstances, settled usage rul... | {
"input": [],
"output": []
} | {
"input": [
"2\n10 30\n15 20\n2\n10 240\n15 160\n3\n2 6\n7 2\n8 2\n4\n2 4\n7 2\n8 2\n18 1\n0"
],
"output": [
"600\n4800\n36\n40"
]
} | {
"input": [
"2\n10 30\n15 20\n2\n10 240\n15 160\n3\n2 6\n7 4\n8 2\n4\n2 4\n7 2\n8 2\n18 1\n0",
"2\n5 30\n15 20\n2\n10 240\n15 160\n3\n2 6\n7 2\n8 2\n4\n2 4\n7 2\n8 2\n18 1\n0",
"2\n10 30\n15 17\n2\n10 240\n15 160\n3\n2 6\n7 3\n8 2\n4\n2 4\n7 2\n8 2\n18 1\n0",
"2\n10 30\n15 17\n2\n10 240\n15 160\n3\n2... |
p01007 Matrix Operations | Problem
Create a program that performs the following types of operations on an n × n matrix whose elements are 1 and 0.
<image>
Given the submatrix and the angle (0,90,180,270,360), rotate it clockwise by that amount.
<image>
Since a submatrix is given, the values are inverted.
<image>
Since a line is given, shif... | {
"input": [],
"output": []
} | {
"input": [
"5 2\n0 0 0 0 0\n1 0 0 0 0\n0 1 1 1 0\n0 1 1 1 0\n0 0 0 0 0\n3 2\n4 2 2",
"3 1\n1 1 0\n0 1 1\n1 0 1\n0 2 2 2 90",
"5 2\n1 1 1 0 1\n1 0 0 0 0\n0 0 0 1 1\n0 1 0 0 0\n0 1 1 1 0\n1 3 3 3\n0 1 1 5 90"
],
"output": [
"0 0 0 0 0\n0 0 0 0 0\n0 0 0 0 0\n0 0 0 0 0\n0 0 0 0 0",
"1 1 0\n0 0 1... | {
"input": [
"5 2\n0 0 0 0 0\n1 0 0 0 0\n0 1 1 1 0\n0 1 1 1 0\n0 0 0 0 0\n3 2\n4 2 4",
"5 2\n1 1 1 0 1\n1 0 0 0 0\n-1 0 0 1 1\n0 1 0 0 0\n0 1 1 1 0\n1 3 3 3\n0 1 1 5 90",
"5 2\n1 1 1 0 1\n1 0 0 0 0\n-1 0 0 1 1\n0 1 0 0 0\n0 1 1 0 0\n1 3 3 3\n0 1 1 5 90",
"5 2\n1 1 1 0 1\n1 0 0 1 0\n-1 0 0 1 1\n0 1 0 0... |
p01139 Surrounding Area | Surrounding Area
Land fence
English text is not available in this practice contest.
Two real estate agents were boarding a passenger ship to the southern island. Blue sky, refreshing breeze ... The two enjoyed a voyage with other passengers. However, one day a tornado suddenly sank a passenger ship. The other passen... | {
"input": [],
"output": []
} | {
"input": [
"10 10\n.....W....\n....W.W...\n...W...W..\n....W...W.\n.....W...W\n......W.W.\nBBB....W..\n..B..BBBBB\n..B..B....\n..B..B..W.\n5 3\n...B.\n...BB\n.....\n1 1\n.\n0 0"
],
"output": [
"6 21\n12 0\n0 0"
]
} | {
"input": [
"10 10\n.....W....\n....W.W...\n...W...W..\n....W...W.\n.....W...W\n......W.W.\nBBB....W..\n..B..BBBBB\n..B..B....\n..B..B..W.\n5 3\n.B...\n...BB\n.....\n1 1\n.\n0 0",
"10 10\n.....W....\n....W.W...\n..W...W...\n....W...W.\n.....W...W\n......W.W.\nBBB....W..\n..B..BBBBB\n..B..B....\n..B..B..W.\n5... |
p01278 Voronoi Island | Some of you know an old story of Voronoi Island. There were N liege lords and they are always involved in territorial disputes. The residents of the island were despaired of the disputes.
One day, a clever lord proposed to stop the disputes and divide the island fairly. His idea was to divide the island such that any ... | {
"input": [],
"output": []
} | {
"input": [
"3 3\n0 0\n8 0\n0 8\n2 2\n4 2\n2 4\n0 0"
],
"output": [
"9.0\n11.5\n11.5"
]
} | {
"input": [
"3 3\n0 0\n8 -1\n0 8\n2 2\n4 2\n2 4\n0 0",
"3 3\n0 0\n8 -1\n-1 8\n2 2\n4 2\n2 4\n0 0",
"3 3\n0 0\n8 0\n0 8\n2 2\n4 0\n2 4\n0 0",
"3 3\n0 0\n8 -1\n0 2\n2 2\n4 2\n2 4\n0 0",
"3 3\n0 0\n8 0\n0 8\n2 2\n7 0\n2 4\n0 0",
"3 3\n0 0\n14 0\n0 8\n2 2\n7 0\n2 4\n0 0",
"3 3\n0 0\n14 0\n0 8... |
p01448 A Way to Invite Friends | From tomorrow, the long-awaited summer vacation will begin. So I decided to invite my friends to go out to the sea.
However, many of my friends are shy. They would hate it if they knew that too many people would come with them.
Besides, many of my friends want to stand out. They will probably hate it if they know tha... | {
"input": [],
"output": []
} | {
"input": [
"5\n8 100001\n7 100001\n12 100001\n8 100001\n3 100001",
"4\n2 5\n4 7\n2 4\n3 6",
"6\n2 9\n4 8\n6 7\n6 6\n5 7\n2 100001"
],
"output": [
"0",
"3",
"5"
]
} | {
"input": [
"5\n8 100001\n14 100001\n12 100001\n8 100001\n3 100001",
"4\n2 5\n4 7\n2 4\n5 6",
"6\n2 9\n4 8\n6 7\n6 6\n5 4\n2 100001",
"4\n2 1\n4 7\n2 4\n5 6",
"5\n8 100001\n7 100001\n12 100001\n3 100001\n3 100001",
"6\n2 9\n2 8\n6 7\n6 6\n5 4\n2 100001",
"6\n4 9\n2 8\n6 7\n6 6\n5 4\n2 100... |
p01597 Nezumi's Treasure | Problem G: Nezumi's Treasure
There were a mouse and a cat living in a field. The mouse stole a dried fish the cat had loved. The theft was found soon later. The mouse started running as chased by the cat for the dried fish.
There were a number of rectangular obstacles in the field. The mouse always went straight ahea... | {
"input": [],
"output": []
} | {
"input": [
"8\n0 0 2 1\n2 2 4 3\n5 3 7 4\n7 5 9 6\n0 2 1 4\n2 4 3 6\n6 0 7 2\n8 2 9 4",
"4\n0 0 2 1\n3 0 4 2\n0 2 1 4\n2 3 4 4"
],
"output": [
"8",
"4"
]
} | {
"input": [
"8\n0 0 2 1\n2 2 4 3\n2 3 7 4\n7 5 9 6\n0 2 1 4\n2 4 3 6\n6 0 7 2\n8 2 9 4",
"4\n0 0 2 1\n0 0 4 2\n0 2 1 4\n1 3 4 4",
"4\n0 0 2 1\n3 0 4 2\n0 2 1 4\n1 3 4 4",
"8\n0 0 4 1\n2 2 4 3\n2 3 7 4\n7 5 9 6\n0 2 1 4\n2 4 3 6\n6 0 7 2\n8 2 9 4",
"8\n0 0 4 1\n2 2 4 3\n2 3 7 4\n7 5 9 6\n0 2 1 4\n... |
p01754 Dinner | In the spring of 2014, a student successfully passed the university and started living alone. The problem here is what to do with the supper. He decided to plan a supper for the next N days.
He wants to maximize the total happiness he gets in N days. Of course, the more delicious or favorite you eat, the higher your h... | {
"input": [],
"output": []
} | {
"input": [
"1 1 1\n2",
"3 2 1\n3\n3\n3",
"3 1 -1\n2\n-3\n2",
"3 1 -10\n-10\n-10\n-10"
],
"output": [
"2",
"12",
"2",
"-27"
]
} | {
"input": [
"1 0 1\n2",
"3 2 0\n3\n3\n3",
"3 1 -10\n-19\n-10\n-10",
"0 0 1\n2",
"3 2 0\n5\n3\n3",
"2 1 -10\n-19\n-10\n-10",
"3 2 1\n5\n3\n3",
"1 0 0\n4",
"3 2 0\n1\n3\n6",
"2 1 -10\n-35\n-3\n-10",
"2 1 -10\n-35\n-1\n-10",
"2 1 -6\n-35\n-1\n-10",
"2 1 -7\n-34\n-1\n-... |
p01894 DAG Trio (Easy) | This issue is the same configuration issue as G: DAG Trio (Hard), with only the constraints being different.
input
$ N \ M $
$ a_1 \ b_1 $
$ a_2 \ b_2 $
$ \ vdots $
$ a_M \ b_M $
output
Print "YES" or "NO" on the $ 1 $ line.
Example
Input
3 3
1 2
2 3
3 1
Output
YES | {
"input": [],
"output": []
} | {
"input": [
"3 3\n1 2\n2 3\n3 1"
],
"output": [
"YES"
]
} | {
"input": [
"3 3\n1 1\n2 3\n3 1",
"6 3\n1 2\n2 2\n1 1",
"3 3\n1 1\n2 3\n2 1",
"3 3\n2 2\n2 3\n3 1",
"3 3\n2 2\n2 3\n2 1",
"3 3\n1 2\n2 2\n3 1",
"3 3\n1 2\n2 3\n1 1",
"3 3\n1 2\n3 2\n3 1",
"3 3\n3 2\n2 2\n3 1",
"3 3\n2 2\n2 1\n3 1",
"3 3\n2 2\n2 1\n3 2",
"3 3\n2 2\n3 1\... |
p02031 Parentheses Number | B: Parentheses Number
problem
Define the correct parenthesis string as follows:
* The empty string is the correct parenthesis string
* For the correct parenthesis string S, `(` S `)` is the correct parenthesis string
* For correct parentheses S, T ST is the correct parentheses
Here, the permutations are associate... | {
"input": [],
"output": []
} | {
"input": [
"2\n2 1"
],
"output": [
"(())"
]
} | {
"input": [
"2\n1 2",
"2\n2 -2",
"2\n2 -4",
"2\n2 -3",
"2\n2 -6",
"2\n2 -11",
"2\n2 -5",
"2\n2 -10",
"2\n2 -7",
"2\n2 -13",
"2\n2 -16",
"2\n2 -25",
"2\n2 -20",
"2\n2 -14",
"2\n2 -12",
"2\n2 -15",
"2\n2 -36",
"2\n2 -17",
"2\n2 -23",
"2\n2... |
p02174 Power Subsequences | Problem
Define a function $ f $ that starts with $ 1 $ and takes a sequence of finite lengths as an argument as follows.
$ \ displaystyle f (\\ {a_1, a_2, \ ldots, a_n \\}) = \ sum_ {i = 1} ^ n {a_i} ^ i $
Given a sequence of length $ N $, $ X = \\ {x_1, x_2, \ ldots, x_N \\} $, $ f (X) for all subsequences $ X'$ ex... | {
"input": [],
"output": []
} | {
"input": [
"5\n100 200 300 400 500",
"3\n1 2 3"
],
"output": [
"935740429",
"64"
]
} | {
"input": [
"5\n100 325 300 400 500",
"3\n1 4 3",
"5\n101 325 300 400 500",
"3\n2 4 3",
"5\n101 325 404 400 500",
"3\n3 4 3",
"5\n101 608 404 400 500",
"3\n4 4 3",
"5\n101 608 404 772 500",
"3\n4 4 1",
"5\n101 608 404 1494 500",
"3\n6 4 1",
"5\n001 608 404 1494 500... |
p02317 Longest Increasing Subsequence | For a given sequence A = {a0, a1, ... , an-1}, find the length of the longest increasing subsequnece (LIS) in A.
An increasing subsequence of A is defined by a subsequence {ai0, ai1, ... , aik} where 0 ≤ i0 < i1 < ... < ik < n and ai0 < ai1 < ... < aik.
Constraints
* 1 ≤ n ≤ 100000
* 0 ≤ ai ≤ 109
Input
n
a0
a1
:
... | {
"input": [],
"output": []
} | {
"input": [
"5\n5\n1\n3\n2\n4",
"3\n1\n1\n1"
],
"output": [
"3",
"1"
]
} | {
"input": [
"5\n5\n1\n3\n2\n6",
"3\n1\n1\n2",
"3\n1\n1\n0",
"5\n0\n2\n1\n2\n11",
"5\n5\n1\n3\n1\n6",
"3\n0\n1\n2",
"5\n5\n1\n2\n1\n6",
"3\n0\n2\n2",
"5\n5\n1\n2\n0\n6",
"5\n5\n1\n2\n-1\n6",
"5\n5\n1\n2\n-1\n10",
"5\n5\n1\n0\n-1\n10",
"5\n5\n1\n0\n0\n10",
"5\n5\... |
p02462 Multi-Map | For a dictionary $M$ that stores elements formed by a pair of a string key and an integer value, perform a sequence of the following operations. Note that multiple elements can have equivalent keys.
* insert($key$, $x$): Insert an element formed by a pair of $key$ and $x$ to $M$.
* get($key$): Print all values with th... | {
"input": [],
"output": []
} | {
"input": [
"10\n0 blue 6\n0 red 1\n0 blue 4\n0 white 5\n1 red\n1 blue\n2 red\n1 black\n1 red\n3 w z"
],
"output": [
"1\n6\n4\nwhite 5"
]
} | {
"input": [
"10\n0 blue 6\n0 red 1\n0 blue 4\n0 white 5\n1 red\n2 blue\n2 red\n1 black\n1 red\n3 w z",
"10\n0 blue 6\n0 red 1\n0 blue 4\n0 white 10\n1 red\n1 blue\n2 red\n1 black\n1 red\n3 w z",
"10\n0 blue 6\n0 red 1\n0 blue 4\n0 white 10\n1 red\n2 blue\n2 red\n1 black\n1 red\n3 w z",
"10\n0 blue 6\... |
acmicl3 | Problem description.
In Bytelandian University, everyone has to enter his/her name on a computer when entering or leaving the library. The names are stored in a file on that computer. Assume that everyone adheres to this rule. Given the file, find out how many people are there in the library.
There will not be spaces i... | {
"input": [],
"output": []
} | {
"input": [
"1\n8\nShubham\nHasil\nShubham\nRavi\nShikhar\nHasil\nJaiwant\nHasil"
],
"output": [
"4\n"
]
} | {
"input": [
"1\n8\nShubham\nHasil\nShubham\nRavi\nShikhar\nHasil\nJaiwant\nH`sil",
"1\n8\nShubham\nHasil\nShubham\nRavi\nShikhar\nlisaH\nJaiwant\nH`sil",
"1\n8\nbhuSham\nHasil\nShubham\nRavi\nShikhar\nlisaH\ntnawhaJ\n`Hsil",
"1\n2\nmahSuhb\nHasil\nShubham\nRavi\nShikhar\nlisaH\ntnawhaJ\n`Hsil",
"... |
chefseg | Chef loves to play games. Now he plays very interesting game called "Segment". At the beginning Chef has segment [0, X] and no points on it. On each step Chef chooses the subsegment of maximal length possible such as it contains no points on it. If there are more than one such subsegment Chef chooses the one with the m... | {
"input": [],
"output": []
} | {
"input": [
"4\n10 1\n10 2\n10 3\n1000000000 1234567"
],
"output": [
"5.0000000000000000\n2.5000000000000000\n7.5000000000000000\n177375316.6198730468750000\n"
]
} | {
"input": [
"4\n10 2\n10 2\n10 3\n1000000000 1234567",
"4\n10 2\n10 3\n10 3\n1000000000 1234567",
"4\n14 2\n10 3\n10 3\n1000000000 1234567",
"4\n14 2\n10 3\n13 3\n1000000000 1234567",
"4\n10 2\n10 3\n13 3\n1000000000 1234567",
"4\n3 2\n10 3\n13 3\n1000000000 1234567",
"4\n3 2\n10 6\n13 3\... |
doors | There are N doors of a palace, all of which are operated by a set of buttons. One day, Alice, who is just 8 years old, gets access to these buttons. Having recently learnt the multiplication tables, she decides to press buttons in a particular order. First, she presses all the buttons that are multiples of 1. Next, she... | {
"input": [],
"output": []
} | {
"input": [
"4\n4\n10\n16\n27"
],
"output": [
"2\n3\n4\n5"
]
} | {
"input": [
"4\n4\n6\n16\n27",
"4\n4\n6\n12\n27",
"4\n4\n6\n12\n44",
"4\n4\n6\n12\n2",
"4\n4\n6\n30\n1",
"4\n4\n6\n19\n1",
"4\n3\n6\n10\n1",
"4\n3\n1\n10\n1",
"4\n3\n0\n10\n1",
"4\n2\n0\n10\n0",
"4\n2\n1\n10\n0",
"4\n4\n2\n10\n2",
"4\n4\n2\n1\n2",
"4\n2\n2\n1\n... |
j7 | Johnny needs to make a rectangular box for his physics class project. He has bought P cm of wire and S cm^2 of special paper. He would like to use all the wire (for the 12 edges) and paper (for the 6 sides) to make the box.
What is the largest volume of the box that Johnny can make?
Input
The first line contains t, th... | {
"input": [],
"output": []
} | {
"input": [
"2\n20 14\n20 16"
],
"output": [
"3.00\n4.15\n"
]
} | {
"input": [
"2\n20 14\n20 14",
"2\n32 14\n20 14",
"2\n20 14\n36 14",
"2\n20 8\n36 14",
"2\n28 8\n36 14",
"2\n20 16\n20 14",
"2\n32 20\n20 14",
"2\n20 14\n20 10",
"2\n20 16\n20 10",
"2\n20 4\n20 10",
"2\n32 14\n20 4",
"2\n20 8\n20 10",
"2\n16 8\n36 14",
"2\n32 2... |
notatri | You have N (3 ≤ N ≤ 2,000) wooden sticks, which are labeled from 1 to N. The i-th stick has a length of Li (1 ≤ Li ≤ 1,000,000). Your friend has challenged you to a simple game: you will pick three sticks at random, and if your friend can form a triangle with them (degenerate triangles included), he wins; otherwise, yo... | {
"input": [],
"output": []
} | {
"input": [
"3\n4 2 10\n3\n1 2 3\n4\n5 2 9 6\n0"
],
"output": [
"1\n0\n2"
]
} | {
"input": [],
"output": []
} |
seq | The number of submissions of CodeChef from Students of Graphic Era University had been growing since the day the CodeChef campus chapter, GEU_Coders had been formed here. This rise in user submissions alerted the staff members at CodeChef. They started to track user activities of students from Graphic Era University. T... | {
"input": [],
"output": []
} | {
"input": [
"2\n4\n7"
],
"output": [
"13\n107"
]
} | {
"input": [],
"output": []
} |
1301_C. Ayoub's function | Ayoub thinks that he is a very smart person, so he created a function f(s), where s is a binary string (a string which contains only symbols "0" and "1"). The function f(s) is equal to the number of substrings in the string s that contains at least one symbol, that is equal to "1".
More formally, f(s) is equal to the ... | {
"input": [],
"output": []
} | {
"input": [
"5\n3 1\n3 2\n3 3\n4 0\n5 2\n"
],
"output": [
"4\n5\n6\n0\n12\n"
]
} | {
"input": [
"5\n3 1\n3 2\n3 3\n0 0\n5 2\n",
"5\n3 1\n3 2\n3 3\n0 0\n10 2\n",
"5\n3 0\n3 2\n3 3\n0 0\n10 2\n",
"5\n3 0\n3 2\n3 3\n4 0\n5 2\n",
"5\n4 1\n3 2\n3 3\n0 0\n5 2\n",
"5\n3 0\n3 2\n3 3\n0 0\n9 2\n",
"5\n3 0\n3 2\n3 3\n4 0\n8 2\n",
"5\n3 1\n3 2\n3 3\n4 0\n8 2\n",
"5\n2 1\n3 ... |
1475_E. Advertising Agency | Masha works in an advertising agency. In order to promote the new brand, she wants to conclude contracts with some bloggers. In total, Masha has connections of n different bloggers. Blogger numbered i has a_i followers.
Since Masha has a limited budget, she can only sign a contract with k different bloggers. Of course... | {
"input": [],
"output": []
} | {
"input": [
"3\n4 3\n1 3 1 2\n4 2\n1 1 1 1\n2 1\n1 2\n"
],
"output": [
"\n2\n6\n1\n"
]
} | {
"input": [
"3\n4 3\n1 3 1 2\n4 2\n1 2 1 1\n2 1\n1 2\n",
"3\n4 3\n1 3 1 2\n4 2\n1 1 1 1\n2 1\n2 2\n",
"3\n4 3\n1 3 2 2\n4 2\n1 1 1 1\n2 1\n2 2\n",
"3\n4 3\n1 3 2 2\n4 2\n1 1 2 1\n2 1\n2 2\n",
"3\n4 3\n1 3 1 2\n4 2\n1 1 2 1\n2 1\n2 2\n",
"3\n4 3\n1 3 1 2\n4 4\n1 2 1 1\n2 1\n1 2\n",
"3\n4 3... |
295_E. Yaroslav and Points | Yaroslav has n points that lie on the Ox axis. The coordinate of the first point is x1, the coordinate of the second point is x2, ..., the coordinate of the n-th point is — xn. Now Yaroslav wants to execute m queries, each of them is of one of the two following types:
1. Move the pj-th point from position xpj to pos... | {
"input": [],
"output": []
} | {
"input": [
"8\n36 50 28 -75 40 -60 -95 -48\n20\n2 -61 29\n1 5 -53\n1 1 429\n1 5 130\n2 -101 -71\n2 -69 53\n1 1 404\n1 5 518\n2 -101 53\n2 50 872\n1 1 -207\n2 -99 -40\n1 7 -389\n1 6 -171\n1 2 464\n1 7 -707\n1 1 -730\n1 1 560\n2 635 644\n1 7 -677\n"
],
"output": [
"176\n20\n406\n1046\n1638\n156\n0\n"
]
... | {
"input": [
"8\n36 50 28 -75 40 -60 -95 -48\n20\n2 -61 29\n1 5 -53\n1 1 429\n1 5 130\n2 -101 -71\n2 -69 53\n1 1 404\n1 5 518\n2 -101 53\n2 50 872\n1 1 -207\n2 -99 -40\n1 7 -389\n1 6 -171\n1 2 464\n1 7 -707\n1 2 -730\n1 1 560\n2 635 644\n1 7 -677\n",
"8\n68 50 28 -75 40 -60 -95 -48\n20\n2 -61 29\n1 5 -53\n1 1... |
319_C. Kalila and Dimna in the Logging Industry | Kalila and Dimna are two jackals living in a huge jungle. One day they decided to join a logging factory in order to make money.
The manager of logging factory wants them to go to the jungle and cut n trees with heights a1, a2, ..., an. They bought a chain saw from a shop. Each time they use the chain saw on the tree... | {
"input": [],
"output": []
} | {
"input": [
"5\n1 2 3 4 5\n5 4 3 2 0\n",
"6\n1 2 3 10 20 30\n6 5 4 3 2 0\n"
],
"output": [
"25\n",
"138\n"
]
} | {
"input": [
"6\n2 2 3 10 20 30\n6 5 4 3 2 0\n",
"5\n1 4 3 4 5\n5 4 3 2 0\n",
"6\n1 2 3 10 20 25\n6 5 4 3 2 0\n",
"6\n1 1 2 10 20 25\n6 5 4 3 2 0\n",
"5\n1 2 3 4 5\n9 4 3 2 0\n",
"5\n1 2 3 4 5\n6 4 3 2 0\n",
"6\n2 2 3 5 20 30\n6 5 4 3 2 0\n",
"6\n1 2 3 10 20 39\n6 5 4 3 2 0\n",
"6\... |
530_D. Set subtraction | You are given a starting set consisting of all integers from 1 to 1000, inclusive. You are also given several sets which need to be subtracted from the starting set (i.e., each number which is in at least one of these sets needs to be removed from the starting set). Each subtracted set is represented as an interval of ... | {
"input": [],
"output": []
} | {
"input": [
"2\n1 900\n902 999\n",
"3\n1 500\n200 746\n150 1000\n"
],
"output": [
"2 901 1000\n",
"0\n"
]
} | {
"input": [],
"output": []
} |
bhavesh-and-colors | **
Problem Statement is Updated
**
Xenny had N colors with him, all arranged in a straight line. He was interested in picking up a particular subarray of colors.
A pre-set is a set that contains all subarrays of colors that start from the first color and do not contain the last color.
An end-set is a set that contai... | {
"input": [],
"output": []
} | {
"input": [
"1\n4\n1 2 1 2\n\nSAMPLE"
],
"output": [
"2"
]
} | {
"input": [
"1\n4\n1 2 1 2\n\nTAMPLE",
"1\n0\n1 3 1 2\n\nTAMPLE",
"1\n0\n1 3 0 3\n\nTAMPLE",
"1\n-3\n-1 -1 -1 -1\n\nANMDPL",
"1\n0\n1 2 1 2\n\nTAMPLE",
"1\n0\n1 3 1 3\n\nTAMPLE",
"1\n0\n1 3 -1 3\n\nTAMPLE",
"1\n0\n1 6 -1 3\n\nTAMPLE",
"1\n0\n1 6 -1 3\n\nTEMPLA",
"1\n-1\n1 6 -1... |
p02549 AtCoder Beginner Contest 179 - Leaping Tak | There are N cells arranged in a row, numbered 1, 2, \ldots, N from left to right.
Tak lives in these cells and is currently on Cell 1. He is trying to reach Cell N by using the procedure described below.
You are given an integer K that is less than or equal to 10, and K non-intersecting segments [L_1, R_1], [L_2, R_2... | {
"input": [],
"output": []
} | {
"input": [
"5 2\n3 3\n5 5",
"5 1\n1 2",
"60 3\n5 8\n1 3\n10 15",
"5 2\n1 1\n3 4"
],
"output": [
"0",
"5",
"221823067",
"4"
]
} | {
"input": [
"5 2\n3 3\n5 9",
"60 3\n5 4\n1 3\n10 15",
"10 2\n1 1\n3 4",
"60 3\n5 4\n1 3\n10 20",
"50 3\n5 4\n1 3\n10 20",
"5 1\n1 2\n5 9",
"60 3\n5 8\n1 0\n10 15",
"3 2\n1 1\n3 4",
"60 3\n5 4\n1 6\n10 15",
"10 2\n1 2\n3 4",
"5 2\n1 3\n5 9",
"60 3\n5 4\n1 1\n10 20",
... |
p02680 AtCoder Beginner Contest 168 - . (Single Dot) | There is a grass field that stretches infinitely.
In this field, there is a negligibly small cow. Let (x, y) denote the point that is x\ \mathrm{cm} south and y\ \mathrm{cm} east of the point where the cow stands now. The cow itself is standing at (0, 0).
There are also N north-south lines and M east-west lines drawn... | {
"input": [],
"output": []
} | {
"input": [
"6 1\n-3 -1 -2\n-3 -1 1\n-2 -1 2\n1 4 -2\n1 4 -1\n1 4 1\n3 1 4",
"5 6\n1 2 0\n0 1 1\n0 2 2\n-3 4 -1\n-2 6 3\n1 0 1\n0 1 2\n2 0 2\n-1 -4 5\n3 -2 4\n1 2 4"
],
"output": [
"INF",
"13"
]
} | {
"input": [
"6 1\n-3 -1 -4\n-3 -1 1\n-2 -1 2\n1 4 -2\n1 4 -1\n1 4 1\n3 1 4",
"5 6\n1 2 0\n0 1 1\n0 2 2\n-3 4 -1\n-2 6 3\n1 0 1\n0 1 2\n2 0 2\n-1 -4 5\n3 -2 6\n1 2 4",
"5 6\n1 1 0\n0 1 1\n0 2 2\n-3 4 -1\n-2 6 3\n1 0 1\n0 1 2\n2 0 2\n-1 -4 5\n3 -2 6\n1 2 4",
"5 6\n1 0 1\n0 1 1\n0 4 2\n-3 4 -1\n-1 6 3\n... |
p02808 Dwango Programming Contest 6th - Cookie Distribution | There are N children, numbered 1,2,\ldots,N. In the next K days, we will give them some cookies. In the i-th day, we will choose a_i children among the N with equal probability, and give one cookie to each child chosen. (We make these K choices independently.)
Let us define the happiness of the children as c_1 \times ... | {
"input": [],
"output": []
} | {
"input": [
"3 2\n3 2",
"856 16\n399 263 665 432 206 61 784 548 422 313 848 478 827 26 398 63"
],
"output": [
"12",
"337587117"
]
} | {
"input": [
"3 2\n1 2",
"856 16\n399 491 665 432 206 61 784 548 422 313 848 478 827 26 398 63",
"4 2\n1 2",
"856 16\n399 491 665 432 206 0 784 548 422 313 848 478 827 26 398 63",
"2 2\n1 2",
"856 16\n399 491 665 432 206 0 784 548 422 514 848 478 827 26 398 63",
"856 16\n399 491 665 432 20... |
p02944 AtCoder Grand Contest 037 - Counting of Subarrays | For a sequence S of positive integers and positive integers k and l, S is said to belong to level (k,l) when one of the following conditions is satisfied:
* The length of S is 1, and its only element is k.
* There exist sequences T_1,T_2,...,T_m (m \geq l) belonging to level (k-1,l) such that the concatenation of T_1,... | {
"input": [],
"output": []
} | {
"input": [
"15 3\n4 3 2 1 1 1 2 3 2 2 1 1 1 2 2",
"9 2\n2 1 1 1 1 1 1 2 3",
"9 3\n2 1 1 1 1 1 1 2 3"
],
"output": [
"31",
"41",
"22"
]
} | {
"input": [
"15 3\n4 3 2 1 2 1 2 3 2 2 1 1 1 2 2",
"9 2\n2 0 1 1 1 1 1 2 3",
"9 2\n2 1 1 1 1 1 0 2 3",
"9 3\n2 0 1 1 1 1 1 2 3",
"9 3\n4 0 1 0 1 1 1 3 3",
"15 3\n1 3 2 1 2 1 1 3 2 2 1 1 2 2 2",
"15 3\n4 3 2 1 1 1 2 3 2 2 0 1 1 2 2",
"9 2\n2 2 1 1 1 1 1 2 3",
"15 3\n4 3 2 1 2 1 2 3... |
p03081 ExaWizards 2019 - Snuke the Wizard | There are N squares numbered 1 to N from left to right. Each square has a character written on it, and Square i has a letter s_i. Besides, there is initially one golem on each square.
Snuke cast Q spells to move the golems.
The i-th spell consisted of two characters t_i and d_i, where d_i is `L` or `R`. When Snuke ca... | {
"input": [],
"output": []
} | {
"input": [
"10 15\nSNCZWRCEWB\nB R\nR R\nE R\nW R\nZ L\nS R\nQ L\nW L\nB R\nC L\nA L\nN L\nE R\nZ L\nS L",
"3 4\nABC\nA L\nB L\nB R\nA R",
"8 3\nAABCBDBA\nA L\nB R\nA R"
],
"output": [
"3",
"2",
"5"
]
} | {
"input": [
"10 15\nSNCZWRCEWB\nB R\nR R\nE R\nW R\nZ L\nS R\nQ L\nW L\nB R\nC L\nA L\nN L\nE R\nZ L\nR L",
"3 4\nACB\nA L\nB L\nB R\nA R",
"8 3\nAABBBDBA\nA L\nB R\nA R",
"3 3\nACB\nB L\nB L\nA R\n@ S",
"3 3\nBCA\nB L\nB L\nA R\n@ S",
"8 0\nAABCBDBA\nA L\nB R\n@ S",
"8 3\nAABCBDBA\nC L\n... |
p03226 Tenka1 Programmer Contest - Circular | 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... | {
"input": [],
"output": []
} | {
"input": [
"3\n1\n2\n1",
"8\n4\n4\n4\n1\n1\n1\n2\n2",
"6\n1\n1\n6\n2\n2\n2",
"5\n3\n1\n4\n1\n5"
],
"output": [
"2",
"24",
"0",
"0"
]
} | {
"input": [
"8\n4\n4\n4\n1\n2\n1\n2\n2",
"5\n3\n1\n4\n2\n5",
"6\n4\n1\n1\n2\n2\n4",
"6\n1\n1\n1\n2\n2\n2",
"6\n1\n1\n1\n2\n2\n1",
"6\n1\n1\n1\n1\n2\n1",
"6\n1\n1\n1\n1\n1\n1",
"3\n1\n1\n1",
"8\n4\n4\n5\n1\n1\n1\n2\n3",
"5\n1\n2\n2\n1\n1",
"6\n1\n1\n6\n2\n2\n4",
"5\n3\n... |
p03374 AtCoder Regular Contest 096 - Static Sushi | "Teishi-zushi", a Japanese restaurant, is a plain restaurant with only one round counter. The outer circumference of the counter is C meters. Customers cannot go inside the counter.
Nakahashi entered Teishi-zushi, and he was guided to the counter. Now, there are N pieces of sushi (vinegared rice with seafood and so on... | {
"input": [],
"output": []
} | {
"input": [
"15 10000000000\n400000000 1000000000\n800000000 1000000000\n1900000000 1000000000\n2400000000 1000000000\n2900000000 1000000000\n3300000000 1000000000\n3700000000 1000000000\n3800000000 1000000000\n4000000000 1000000000\n4100000000 1000000000\n5200000000 1000000000\n6600000000 1000000000\n8000000000... | {
"input": [
"3 20\n2 80\n5 120\n16 1",
"3 20\n2 1\n9 120\n16 1",
"3 20\n0 80\n9 1\n16 120",
"1 100100000000000\n50000000000000 1",
"15 10000000000\n400000000 1000000000\n800000000 1000000000\n1900000000 1000000000\n2400000000 1000000000\n2900000000 1000000000\n3300000000 1000000000\n3700000000 10... |
p03535 CODE FESTIVAL 2017 Final (Parallel) - Time Gap | In CODE FESTIVAL XXXX, there are N+1 participants from all over the world, including Takahashi.
Takahashi checked and found that the time gap (defined below) between the local times in his city and the i-th person's city was D_i hours. The time gap between two cities is defined as follows. For two cities A and B, if t... | {
"input": [],
"output": []
} | {
"input": [
"2\n11 11",
"3\n7 12 8",
"1\n0"
],
"output": [
"2",
"4",
"0"
]
} | {
"input": [
"2\n11 8",
"3\n7 12 11",
"2\n8 8",
"2\n10 2",
"2\n2 0",
"3\n9 12 8",
"2\n6 8",
"2\n12 8",
"2\n9 7",
"1\n11",
"1\n9",
"1\n10",
"3\n8 12 11",
"2\n8 1",
"2\n10 1",
"2\n4 2",
"2\n8 2",
"2\n2 1",
"2\n3 0",
"2\n8 6",
"3\n8 12 0... |
p03695 AtCoder Beginner Contest 064 - Colorful Leaderboard | In AtCoder, a person who has participated in a contest receives a color, which corresponds to the person's rating as follows:
* Rating 1-399 : gray
* Rating 400-799 : brown
* Rating 800-1199 : green
* Rating 1200-1599 : cyan
* Rating 1600-1999 : blue
* Rating 2000-2399 : yellow
* Rating 2400-2799 : orange
* Rating 280... | {
"input": [],
"output": []
} | {
"input": [
"4\n2100 2500 2700 2700",
"20\n800 810 820 830 840 850 860 870 880 890 900 910 920 930 940 950 960 970 980 990",
"5\n1100 1900 2800 3200 3200"
],
"output": [
"2 2",
"1 1",
"3 5"
]
} | {
"input": [
"4\n2100 2500 4217 2700",
"20\n800 810 820 830 840 850 860 870 880 890 900 1771 920 930 940 950 960 970 980 990",
"5\n1100 3348 2800 3200 3200",
"20\n800 810 820 830 840 850 860 870 880 890 900 1771 920 930 120 950 960 970 980 990",
"5\n1101 3348 2955 3200 2889",
"5\n1101 3348 230... |
p03850 AtCoder Regular Contest 066 - Addition and Subtraction Hard | Joisino has a formula consisting of N terms: A_1 op_1 A_2 ... op_{N-1} A_N. Here, A_i is an integer, and op_i is an binary operator either `+` or `-`. Because Joisino loves large numbers, she wants to maximize the evaluated value of the formula by inserting an arbitrary number of pairs of parentheses (possibly zero) in... | {
"input": [],
"output": []
} | {
"input": [
"5\n1 - 2 + 3 - 4 + 5",
"3\n5 - 1 - 3",
"5\n1 - 20 - 13 + 14 - 5"
],
"output": [
"5",
"7",
"13"
]
} | {
"input": [
"5\n1 - 2 + 2 - 4 + 5",
"5\n1 - 38 - 13 + 14 - 5",
"5\n1 - 45 - 13 + 14 - 5",
"5\n2 - 45 - 13 + 14 - 5",
"5\n2 - 80 - 13 + 14 - 5",
"5\n2 - 57 - 13 + 14 - 5",
"5\n2 - 39 - 13 + 9 - 5",
"5\n1 - 2 + 0 - 4 + 5",
"5\n1 - 6 - 13 + 14 - 5",
"5\n2 - 45 - 7 + 14 - 5",
... |
p04017 AtCoder Regular Contest 060 - Tak and Hotels | N hotels are located on a straight line. The coordinate of the i-th hotel (1 \leq i \leq N) is x_i.
Tak the traveler has the following two personal principles:
* He never travels a distance of more than L in a single day.
* He never sleeps in the open. That is, he must stay at a hotel at the end of a day.
You are ... | {
"input": [],
"output": []
} | {
"input": [
"9\n1 3 6 13 15 18 19 29 31\n10\n4\n1 8\n7 3\n6 7\n8 5"
],
"output": [
"4\n2\n1\n2"
]
} | {
"input": [
"9\n1 3 6 13 15 18 19 29 31\n10\n2\n1 8\n7 3\n6 7\n8 5",
"9\n1 6 6 13 23 18 19 29 31\n10\n3\n1 8\n7 3\n6 7\n8 10",
"9\n1 3 6 13 23 18 19 29 31\n10\n2\n1 8\n7 5\n6 7\n8 5",
"9\n1 3 6 13 23 18 19 29 31\n10\n2\n1 9\n7 3\n6 7\n8 10",
"9\n1 3 6 13 23 18 19 29 31\n12\n2\n1 8\n1 3\n9 7\n8 7"... |
p00101 Aizu PR | An English booklet has been created for publicizing Aizu to the world. When you read it carefully, you found a misnomer (an error in writing) on the last name of Masayuki Hoshina, the lord of the Aizu domain. The booklet says "Hoshino" not "Hoshina".
Your task is to write a program which replace all the words "Hoshino... | {
"input": [],
"output": []
} | {
"input": [
"3\nHoshino\nHashino\nMasayuki Hoshino was the grandson of Ieyasu Tokugawa."
],
"output": [
"Hoshina\nHashino\nMasayuki Hoshina was the grandson of Ieyasu Tokugawa."
]
} | {
"input": [
"3\nHoshimo\nHashino\nMasayuki Hoshino was the grandson of Ieyasu Tokugawa.",
"3\nHoshimo\nHashino\nMasayuki Hoshino was the grandspn of Ieyasu Tokugawa.",
"3\nHoshimo\nHashino\nMasayuki Hoshino was the grandspn of ueyasI Tokugawa.",
"3\nHoshimo\nHashino\nMasayuki onihsoH was the grandspn... |
p00234 Aizu Buried Treasure | Aizu has an ancient legend of buried treasure. You have finally found the place where the buried treasure is buried. Since we know the depth of the buried treasure and the condition of the strata to be dug, we can reach the buried treasure at the lowest cost with careful planning. So you decided to create a program tha... | {
"input": [],
"output": []
} | {
"input": [
"3 3\n100 10 10\n-100 -20 -100\n-100 -20 -100\n-100 -20 -100\n3 3\n100 10 10\n-100 -20 -100\n-100 -20 -20\n-100 -60 -20\n3 3\n100 10 3\n-100 -20 -100\n-20 -20 -20\n-20 -100 -20\n3 3\n100 3 3\n-100 -20 -30\n-100 -20 2\n-100 -20 -20\n4 5\n1500 5 4\n-10 -380 -250 -250\n-90 2 -80 8\n-250 -130 -330 -120\n... | {
"input": [
"3 3\n100 10 10\n-100 -20 -100\n-100 -20 -100\n-100 -20 -100\n3 3\n100 10 10\n-100 -20 -100\n-100 -20 -20\n-100 -60 -20\n3 3\n100 10 3\n-100 -20 -100\n-20 -20 -20\n-20 -100 -20\n3 3\n100 3 3\n-100 -20 -30\n-100 -20 2\n-100 -20 -20\n4 5\n1500 5 4\n-10 -380 -250 -250\n-90 2 -80 8\n-250 -130 -330 -120\n... |
p00396 Playing With Stones | Playing with Stones
Koshiro and Ukiko are playing a game with black and white stones. The rules of the game are as follows:
1. Before starting the game, they define some small areas and place "one or more black stones and one or more white stones" in each of the areas.
2. Koshiro and Ukiko alternately select an area ... | {
"input": [],
"output": []
} | {
"input": [
"4\n24 99\n15 68\n12 90\n95 79",
"3\n2 46\n94 8\n46 57"
],
"output": [
"0",
"1"
]
} | {
"input": [
"4\n24 99\n15 68\n12 90\n95 66",
"3\n0 46\n94 8\n46 57",
"4\n24 99\n15 44\n12 90\n95 66",
"3\n0 46\n9 8\n46 57",
"4\n18 99\n15 44\n12 90\n95 66",
"3\n1 46\n9 8\n46 57",
"4\n18 99\n15 44\n3 90\n95 66",
"3\n1 63\n9 8\n46 57",
"4\n18 99\n15 44\n3 90\n95 104",
"3\n1 63... |
p00611 Building Water Ways | In ancient times, Romans constructed numerous water ways to supply water to cities and industrial sites. These water ways were amongst the greatest engineering feats of the ancient world.
These water ways contributed to social infrastructures which improved people's quality of life. On the other hand, problems related... | {
"input": [],
"output": []
} | {
"input": [
"3 8\n########\n#P....*#\n########\n10 10\n##########\n#P.......#\n#..#*....#\n#..#*.#.*#\n#.....#*.#\n#*.......#\n#..##....#\n#...#.P..#\n#P......P#\n##########\n0 0"
],
"output": [
"5\n14"
]
} | {
"input": [
"3 8\n########\n#P....*#\n########\n10 10\n##########\n#P.......#\n#..#*....#\n#..#*.#.*#\n#.....#*.#\n#*.......#\n#..##....#\n#...#.P..#\n#P......O#\n##########\n0 0",
"3 8\n########\n#P....*#\n########\n10 10\n##########\n#O.......#\n#..#*....#\n#..#*.#.*#\n#.....#*.#\n#*.......#\n#..##....#\n#... |
p00749 Off Balance | You are working for an administration office of the International Center for Picassonian Cubism (ICPC), which plans to build a new art gallery for young artists. The center is organizing an architectural design competition to find the best design for the new building.
Submitted designs will look like a screenshot of a... | {
"input": [],
"output": []
} | {
"input": [
"4 5\n..33\n..33\n2222\n..1.\n.111\n5 7\n....1\n.1..1\n.1..1\n11..1\n.2222\n..111\n...1.\n3 6\n.3.\n233\n23.\n22.\n.11\n.11\n4 3\n2222\n..11\n..11\n4 5\n.3..\n33..\n322.\n2211\n.11.\n3 3\n222\n2.1\n111\n3 4\n11.\n11.\n.2.\n222\n3 4\n.11\n.11\n.2.\n222\n2 7\n11\n.1\n21\n22\n23\n.3\n33\n2 3\n1.\n11\n.1... | {
"input": [
"4 5\n..33\n..33\n2222\n..1.\n.111\n5 7\n....1\n.1..1\n.1..1\n11..1\n.2222\n..111\n...1.\n3 6\n.3.\n233\n23.\n22.\n.11\n.11\n4 3\n2222\n..11\n..11\n4 5\n.3..\n33..\n322.\n2211\n.11.\n3 3\n222\n2.1\n111\n3 4\n11.\n11.\n.2/\n222\n3 4\n.11\n.11\n.2.\n222\n2 7\n11\n.1\n21\n22\n23\n.3\n33\n2 3\n1.\n11\n.1... |
p00887 Awkward Lights | You are working as a night watchman in an office building. Your task is to check whether all the lights in the building are turned off after all the office workers in the building have left the office. If there are lights that are turned on, you must turn off those lights. This task is not as easy as it sounds to be be... | {
"input": [],
"output": []
} | {
"input": [
"1 1 1\n1\n2 2 1\n1 1\n1 1\n3 2 1\n1 0 1\n0 1 0\n3 3 1\n1 0 1\n0 1 0\n1 0 1\n4 4 2\n1 1 0 1\n0 0 0 1\n1 0 1 1\n1 0 0 0\n5 5 1\n1 1 1 0 1\n0 1 0 1 0\n1 0 1 0 1\n0 1 0 1 0\n1 0 1 0 1\n5 5 2\n0 0 0 0 0\n0 0 0 0 0\n0 0 1 0 0\n0 0 0 0 0\n0 0 0 0 0\n11 11 3\n0 0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0 0\n0 ... | {
"input": [
"1 1 1\n1\n2 2 1\n1 1\n1 1\n3 2 1\n1 0 1\n0 1 0\n3 3 1\n1 0 1\n0 1 0\n1 0 1\n4 4 2\n1 1 0 1\n0 0 0 1\n1 0 1 1\n1 0 0 0\n5 5 1\n1 1 1 0 1\n0 1 0 1 0\n1 0 1 0 1\n0 1 0 1 0\n1 0 1 0 1\n5 5 2\n0 0 0 0 0\n0 0 0 0 0\n0 0 1 0 0\n0 0 0 0 0\n0 0 0 0 0\n11 11 3\n0 0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0 0\n0 ... |
p01018 Warping Girl | Problem
Aizu Magic School is a school where people who can use magic gather. Haruka, one of the students of that school, can use the magic of warp on the magic team.
From her house to the school, there is a straight road of length L. There are also magic circles on this road.
She uses this road every day to go to sch... | {
"input": [],
"output": []
} | {
"input": [
"10 2\n2 3 1\n3 5 1",
"1 0",
"10 3\n2 2 1\n4 2 1\n8 1 1"
],
"output": [
"6",
"1",
"8"
]
} | {
"input": [
"10 2\n2 3 1\n1 5 1",
"10 2\n2 3 1\n1 5 0",
"10 0\n2 3 1\n1 5 1",
"18 0\n2 3 1\n1 5 1",
"0 0\n2 -1 1\n0 1 1",
"1 0\n2 0 2\n1 2 1",
"2 1\n1 0 7\n4 -1 0",
"10 3\n2 0 1\n4 2 1\n8 1 1",
"34 0\n2 3 1\n1 5 1",
"8 0\n2 0 1\n0 3 1",
"10 2\n2 6 1\n1 5 -1",
"30 0\n2 ... |
p01151 Divisor is the Conqueror | Divisor is the Conquerer is a solitaire card game. Although this simple game itself is a great way to pass one’s time, you, a programmer, always kill your time by programming. Your task is to write a computer program that automatically solves Divisor is the Conquerer games. Here is the rule of this game:
First, you ra... | {
"input": [],
"output": []
} | {
"input": [
"5\n1 2 3 3 7\n4\n2 3 3 3\n0"
],
"output": [
"3 3 1 7 2\nNo"
]
} | {
"input": [
"5\n1 2 3 6 7\n4\n2 3 3 3\n0",
"5\n1 2 6 6 7\n4\n2 3 3 3\n0",
"5\n1 3 3 4 7\n4\n2 3 3 3\n0",
"5\n1 2 3 3 7\n4\n2 3 2 3\n0",
"5\n1 2 6 6 7\n4\n2 3 2 3\n0",
"5\n1 2 3 6 7\n0\n2 5 3 3\n0",
"5\n1 2 6 6 7\n0\n2 3 2 3\n0",
"5\n1 2 3 9 7\n4\n2 5 3 3\n0",
"5\n1 2 12 6 7\n0\n2 ... |
p01290 Queen's Case | A small country called Maltius was governed by a queen. The queen was known as an oppressive ruler. People in the country suffered from heavy taxes and forced labor. So some young people decided to form a revolutionary army and fight against the queen. Now, they besieged the palace and have just rushed into the entranc... | {
"input": [],
"output": []
} | {
"input": [
"2 2\nQE\nEA\n3 1\nQAE\n3 1\nAQE\n5 5\n..E..\n.###.\nA###Q\n.###.\n..E..\n5 1\nA.E.Q\n5 5\nA....\n.\n..E..\n.####\n....Q\n0 0",
"2 2\nQE\nEA\n3 1\nQAE\n3 1\nAQE\n5 5\n..E..\n.###.\nA###Q\n.###.\n..E..\n5 1\nA.E.Q\n5 5\nA....\n####.\n..E..\n.####\n....Q\n0 0"
],
"output": [
"Queen can not ... | {
"input": [
"2 2\nQE\nEA\n3 1\nQAE\n3 1\nAQE\n5 5\n..E..\n.###.\nA###Q\n.###.\n..E..\n5 1\nA.E.Q\n5 5\nA....\n-\n..E..\n.####\n....Q\n0 0",
"2 2\nQE\nEA\n2 1\nQAE\n3 1\nAQE\n5 5\n..E..\n.###.\n##A#Q\n.###.\n..E..\n5 1\nA.E.Q\n5 5\nA....\n-\n..E..\n.####\n....Q\n0 0",
"2 2\nQE\nAE\n3 1\nQAE\n3 1\nAQE\n5 5... |
p01459 Light Road | There is an evil creature in a square on N-by-M grid (2 \leq N, M \leq 100), and you want to kill it using a laser generator located in a different square. Since the location and direction of the laser generator are fixed, you may need to use several mirrors to reflect laser beams. There are some obstacles on the grid ... | {
"input": [],
"output": []
} | {
"input": [
"3 3 1\nS#.\n...\n.#G",
"3 3 1\nS#G\n...\n.#.",
"3 3 2\nS#.\n...\n.#G",
"4 3 2\nS..\n...\n..#\n.#G"
],
"output": [
"-1",
"2",
"2",
"-1"
]
} | {
"input": [
"1 3 1\nS#G\n...\n.#.",
"3 3 2\nS#.\n...\n/#G",
"4 3 2\nS..\n...\n..#\nG#.",
"3 3 2\nS#.\n...\n.$G",
"1 3 2\nS#G\n...\n.#.",
"5 3 2\nS#.\n...\n/#G",
"3 3 0\nS#.\n...\n.#G",
"3 4 1\nS#G\n...\n.#.",
"3 3 2\nS.#\n...\n.#G",
"3 5 2\nS#.\n...\n/#G",
"1 3 2\nS\"G\n..... |
p01611 K-th String | K-th String
Problem Statement
The suffix array SA for the character string S of length N is defined as a permutation of positive integers of N or less obtained by the following procedure.
The substring from the i-th character to the j-th character of S is expressed as S [i..j]. However, the subscript is 1-indexed.
1... | {
"input": [],
"output": []
} | {
"input": [
"3 4 2\n2\n1\n3",
"18 26 10275802967\n10\n14\n9\n13\n7\n8\n2\n6\n11\n18\n12\n1\n4\n3\n16\n5\n17\n15"
],
"output": [
"bad",
"ritsumeicampdaytwo"
]
} | {
"input": [
"0 4 2\n2\n1\n3",
"1 4 2\n1\n0\n3",
"1 1 -1\n1\n2\n2",
"18 26 10275802967\n10\n14\n9\n13\n7\n8\n2\n3\n11\n18\n12\n1\n4\n3\n16\n5\n17\n15",
"0 4 2\n0\n1\n3",
"18 26 10275802967\n10\n14\n9\n13\n7\n8\n2\n3\n11\n18\n12\n1\n8\n3\n16\n5\n17\n15",
"0 4 2\n1\n1\n3",
"18 26 1027580... |
p01771 Tree | Problem statement
There is a rooted tree of size N. Each vertex is numbered from 0 to N-1, with a root of 0. For the vertices at both ends of any side, the assigned integer is smaller closer to the root. Initially, the weights of all edges are 0.
Process Q queries on this tree in sequence. There are two types of quer... | {
"input": [],
"output": []
} | {
"input": [
"9 6\n0 1\n0 2\n0 3\n1 4\n1 5\n4 6\n5 7\n5 8\n1 0 1\n1 1 2\n0 6 3\n1 5 5\n1 8 4\n0 4 3"
],
"output": [
"8\n5"
]
} | {
"input": [
"9 6\n0 1\n0 2\n0 3\n1 4\n1 5\n4 6\n5 7\n5 8\n1 0 1\n1 1 2\n0 6 3\n1 5 2\n1 8 4\n0 4 3",
"9 6\n0 1\n0 2\n0 3\n0 4\n1 5\n4 6\n5 7\n5 8\n1 0 1\n1 1 2\n0 6 3\n1 5 5\n1 8 4\n0 4 3",
"9 6\n0 1\n0 2\n0 3\n1 4\n1 5\n4 6\n4 7\n5 8\n1 0 1\n1 1 1\n0 6 3\n1 5 2\n1 8 4\n0 4 3",
"9 6\n0 1\n0 2\n0 3\n1... |
p01905 Tournament | problem
AOR Ika and you came to the tournament-style table tennis tournament singles section for reconnaissance. For AOR Ika-chan, who wants to record all the games, you decide to ask for the number of games that will be played in this tournament.
There are $ N $ players in the tournament, each with a uniform number ... | {
"input": [],
"output": []
} | {
"input": [
"2 0"
],
"output": [
"1"
]
} | {
"input": [
"2 1",
"2 2",
"2 4",
"0 4",
"-1 4",
"-1 0",
"1 -1",
"-1 2",
"-1 -4",
"-2 -7",
"-1 -7",
"-1 -5",
"1 -6",
"2 -6",
"2 -8",
"5 -10",
"5 -8",
"9 -8",
"9 -14",
"9 -25",
"9 -20",
"18 -20",
"18 -36",
"18 -33",
"18... |
p02043 Illumination | 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... | {
"input": [],
"output": []
} | {
"input": [
"4 4 10\n100 100 100 100\n100 100 100 100\n1 100 100 1\n1 1 1 1"
],
"output": [
"970"
]
} | {
"input": [
"4 4 10\n100 100 100 100\n100 100 100 100\n1 100 100 2\n1 1 1 1",
"4 4 10\n100 000 100 100\n100 100 100 100\n1 100 100 2\n1 1 1 1",
"4 4 10\n100 000 000 100\n100 100 100 100\n1 100 100 2\n1 1 1 1",
"4 4 10\n100 000 000 100\n100 110 100 100\n1 100 100 2\n1 1 1 1",
"4 4 10\n110 100 100 ... |
p02186 Cutting Subarray | E: Cut out the sum
problem
Ebi-chan has a sequence (a_1, a_2, ..., a_n). Ebi-chan is worried about the maximum value of the sum of the partial arrays (which may be empty), so please find it. Here, a subarray refers to a continuous subsequence. The sum of empty strings is 0.
In addition, Ebi-chan rewrites this sequen... | {
"input": [],
"output": []
} | {
"input": [
"5 2\n1 2 -3 4 -5\n3 3\n2 -6"
],
"output": [
"4\n10\n7"
]
} | {
"input": [
"5 2\n0 2 -3 4 -5\n3 3\n2 -6",
"7 2\n1 2 -3 4 -5\n3 3\n2 -6",
"5 2\n0 2 -3 4 -5\n4 3\n2 -6",
"5 2\n1 2 -6 4 -5\n3 3\n2 -6",
"5 0\n0 2 -4 4 -2\n4 3\n2 -6",
"5 2\n-1 2 -4 1 -2\n4 3\n2 -11",
"5 2\n1 2 -6 2 -7\n3 3\n2 -6",
"5 2\n0 2 -4 4 -4\n2 3\n2 -8",
"5 0\n-1 2 -4 1 -2\... |
p02328 Largest Rectangle in a Histogram | A histogram is made of a number of contiguous bars, which have same width.
For a given histogram with $N$ bars which have a width of 1 and a height of $h_i$ = $h_1, h_2, ... , h_N$ respectively, find the area of the largest rectangular area.
Constraints
* $1 \leq N \leq 10^5$
* $0 \leq h_i \leq 10^9$
Input
The inp... | {
"input": [],
"output": []
} | {
"input": [
"8\n2 1 3 5 3 4 2 1",
"3\n2 0 1"
],
"output": [
"12",
"2"
]
} | {
"input": [
"8\n2 1 3 5 3 7 2 1",
"3\n3 0 1",
"8\n2 1 3 5 3 7 3 1",
"3\n5 0 0",
"3\n0 0 0",
"8\n2 2 3 5 4 7 3 2",
"3\n0 0 1",
"8\n3 6 3 6 4 7 0 4",
"8\n3 6 4 6 4 7 0 4",
"3\n2 0 2",
"8\n2 1 3 2 4 7 3 1",
"8\n2 2 2 5 4 7 3 1",
"3\n6 1 0",
"8\n2 1 3 0 4 7 3 1",
... |
p02473 Difference of Big Integers | Difference of Big Integers
Given two integers $A$ and $B$, compute the difference, $A - B$.
Input
Two integers $A$ and $B$ separated by a space character are given in a line.
Output
Print the difference in a line.
Constraints
* $-1 \times 10^{100000} \leq A, B \leq 10^{100000}$
Sample Input 1
5 8
Sample O... | {
"input": [],
"output": []
} | {
"input": [
"5 8"
],
"output": [
"-3"
]
} | {
"input": [
"5 4",
"5 5",
"5 1",
"4 1",
"2 0",
"8 0",
"15 0",
"15 1",
"8 1",
"0 1",
"0 2",
"0 3",
"-1 3",
"-1 4",
"-1 7",
"-1 8",
"0 16",
"0 31",
"0 45",
"-1 45",
"0 69",
"0 55",
"0 10",
"2 16",
"-2 4",
"2 -3",
... |
carvans | Most problems on CodeChef highlight chef's love for food and cooking but little is known about his love for racing sports. He is an avid Formula 1 fan. He went to watch this year's Indian Grand Prix at New Delhi. He noticed that one segment of the circuit was a long straight road. It was impossible for a car to overtak... | {
"input": [],
"output": []
} | {
"input": [
"3\n1\n10\n3\n8 3 6\n5\n4 5 1 2 3"
],
"output": [
"1\n2\n2\n"
]
} | {
"input": [
"3\n1\n10\n3\n8 3 6\n5\n4 5 1 2 4",
"3\n1\n10\n3\n0 3 6\n5\n4 5 1 2 3",
"3\n1\n10\n3\n8 3 1\n5\n4 5 1 2 4",
"3\n1\n0\n3\n8 3 6\n5\n6 5 1 2 5",
"3\n1\n10\n3\n8 3 1\n5\n6 5 1 2 4",
"3\n1\n10\n3\n8 3 1\n5\n0 8 1 2 7",
"3\n1\n10\n3\n0 3 6\n5\n6 5 1 3 4",
"3\n1\n1\n3\n0 3 1\n5\... |
cranbrom | Seeing the current political scenario in the city of Delhi,and the clean sweep of the Aam Aadmi Party, you are wondering that its maybe time to change careers and start selling broomsticks.
Now you sell broomsticks of various lengths. You initially do not have any brooms.You decide to roam about in the city finding bro... | {
"input": [],
"output": []
} | {
"input": [
"4\nfound 3\nfound 4\ndemand 3\ndemand 4"
],
"output": [
"4"
]
} | {
"input": [],
"output": []
} |
grid | Sherlock is stuck. There is a N X N grid in which some cells are empty (denoted by ‘.’), while some cells have rocks in them (denoted by ‘#’). Sherlock is on the South of the grid. He has to watch what is happening on the East of the grid. He can place a mirror at 45 degrees on an empty cell in the grid, so that he'll ... | {
"input": [],
"output": []
} | {
"input": [
"2\n3\n#..\n#..\n#..\n3\n#.#\n#.#\n#.#"
],
"output": [
"6\n0\n"
]
} | {
"input": [
"2\n3\n#..\n..#\n#..\n3\n#.#\n#.#\n#.#",
"2\n3\n#..\n\"..\n#..\n3\n#.#\n#.#\n#.#",
"2\n3\n$..\n..#\n#..\n3\n\"-#\n#.#\n\"#.",
"2\n3\n$..\n.#.\n#..\n3\n\"-#\n#.#\n\".#",
"2\n3\n#..\n..#\n..#\n3\n#.#\n#.#\n#.#",
"2\n3\n#..\n#..\n..#\n3\n#.#\n#.#\n#.#",
"2\n3\n\"..\n#..\n#..\n3\n... |
mchairs | A new school in Byteland is now in the process of renewing some classrooms with new, stronger and better chairs, so that the students can stay still and pay attention to class :)
However, due to budget and logistic reasons, it's only possible to carry a chair at a time to the classroom, which means that for a long time... | {
"input": [],
"output": []
} | {
"input": [
"2\n1\n2"
],
"output": [
"1\n3\n"
]
} | {
"input": [
"2\n1\n4",
"2\n1\n8",
"2\n1\n0",
"2\n0\n0",
"2\n1\n6",
"2\n1\n1",
"2\n2\n0",
"2\n1\n12",
"2\n2\n1",
"2\n2\n2",
"2\n1\n5",
"2\n0\n2",
"2\n2\n4",
"2\n1\n3",
"2\n1\n7",
"2\n2\n5",
"2\n0\n5",
"2\n0\n7",
"2\n2\n8",
"2\n0\n8",
... |
rdioactv | EDIT : Please note that the user enters the whole string "Energy Level: 217" instead of just 217. You'd have to input accordingly. The output should only be the ids of radioactive elements, one id per line. Stick to the input/output format.
Note: For Turbo C++, select "Text" as your language
Problem description:
Af... | {
"input": [],
"output": []
} | {
"input": [
"4\nEnergy Level: 217\nEnergy Level: 246\nEnergy Level: 4\nEnergy Level: 349"
],
"output": [
"1\n2\n4\n"
]
} | {
"input": [
"4\nEnergy Level: 217\nEnergy Level: 246\nEnergy Level: 4\nEnergy Level: 497",
"4\nEnergy :leveL 111\nEnerhy Lfvel: 419\nEnerfy :lfveL 1\nEnergy :leveL 816",
"4\nxgdErp Lf:dlv 110\neynhDr :emveL 113\nDnfyfs Mmvff: 1\nEngrdx ueleL: 3370",
"4\nEnergy Level: 217\nEnergy Level: 419\nEnergy Le... |
tproduct | Given a complete binary tree with the height of H, we index the nodes respectively top-down and left-right from 1. The i-th node stores a positive integer Vi. Define Pi as follows: Pii if the i-th node is a leaf, otherwise Pii*PL, Vi*PR), where L and R are the indices of the left and right children of i, respectively. ... | {
"input": [],
"output": []
} | {
"input": [
"2\n1 2 3\n3\n3 1 5 2 6 4 7\n0"
],
"output": [
"3\n105\n"
]
} | {
"input": [
"2\n1 2 3\n3\n3 1 1 2 6 4 7\n0",
"2\n1 2 3\n3\n3 1 1 2 6 1 8\n0",
"2\n1 2 1\n3\n3 1 1 2 3 1 8\n0",
"2\n1 2 3\n3\n3 1 5 2 12 4 7\n0",
"2\n1 2 3\n3\n3 2 1 2 6 1 7\n0",
"2\n1 2 1\n3\n4 1 1 2 3 1 8\n0",
"2\n1 2 3\n3\n1 2 1 2 6 1 7\n0",
"2\n1 2 3\n3\n3 2 10 2 12 7 7\n0",
"2... |
1315_B. Homecoming | After a long party Petya decided to return home, but he turned out to be at the opposite end of the town from his home. There are n crossroads in the line in the town, and there is either the bus or the tram station at each crossroad.
The crossroads are represented as a string s of length n, where s_i = A, if there is... | {
"input": [],
"output": []
} | {
"input": [
"5\n2 2 1\nBB\n1 1 1\nAB\n3 2 8\nAABBBBAABB\n5 3 4\nBBBBB\n2 1 1\nABABAB\n"
],
"output": [
"2\n1\n3\n1\n6\n"
]
} | {
"input": [
"5\n2 1 1\nBB\n1 1 1\nAB\n3 2 8\nAABBBBAABB\n5 3 4\nBBBBB\n2 1 1\nABABAB\n",
"5\n2 1 1\nBB\n1 1 1\nAB\n3 0 8\nAABBBBAABB\n5 3 4\nBBBBB\n2 1 1\nABABAB\n",
"5\n3 1 0\nBB\n1 1 2\nBA\n3 0 8\nAABBBBAABB\n5 3 4\nBBBBB\n2 1 1\nABABAB\n",
"5\n2 2 0\nBB\n1 1 1\nAB\n3 2 8\nAABBBBAABB\n5 3 4\nBBBBB\... |
617_E. XOR and Favorite Number | Bob has a favorite number k and ai of length n. Now he asks you to answer m queries. Each query is given by a pair li and ri and asks you to count the number of pairs of integers i and j, such that l ≤ i ≤ j ≤ r and the xor of the numbers ai, ai + 1, ..., aj is equal to k.
Input
The first line of the input contains i... | {
"input": [],
"output": []
} | {
"input": [
"6 2 3\n1 2 1 1 0 3\n1 6\n3 5\n",
"5 3 1\n1 1 1 1 1\n1 5\n2 4\n1 3\n"
],
"output": [
"7\n0\n",
"9\n4\n4\n"
]
} | {
"input": [
"6 2 4\n1 2 1 1 0 3\n1 6\n3 5\n",
"5 3 1\n0 1 1 1 1\n1 5\n2 4\n1 3\n",
"6 2 3\n1 4 1 1 0 3\n1 6\n3 5\n",
"5 3 1\n0 1 1 1 1\n1 5\n2 4\n1 2\n",
"5 3 0\n0 1 1 1 1\n1 5\n2 4\n1 2\n",
"6 2 4\n1 2 1 1 1 5\n1 6\n3 5\n",
"5 3 1\n0 1 2 1 1\n1 5\n2 4\n1 2\n",
"5 3 1\n0 1 2 1 1\n1 5\... |
ashu-and-prime-factors-4 | Ashu is very fond of Prime numbers and he like challenging his friends by giving them various problems based on Mathematics and Prime number. One of his friend Harshit is jealous and challenges him to solve a task. Task is :Given a prime number X, you need to give the count of all numbers in range 1 to 10^6 inclusive w... | {
"input": [],
"output": []
} | {
"input": [
"2\n2\n11\n\nSAMPLE"
],
"output": [
"500000\n20779\n"
]
} | {
"input": [
"2\n2\n7\n\nSAMPLE",
"2\n2\n2\n\nSAMPLE",
"2\n2\n11\n\nSANPLE",
"2\n2\n3\n\nSAMPLE",
"2\n3\n2\n\nSAMOLE",
"2\n3\n3\n\nSAMPLE",
"2\n3\n11\n\nELPNAS",
"2\n3\n5\n\nSAMPLE",
"2\n2\n19\n\nELPNAR",
"2\n5\n2\n\nSAMOLE",
"2\n5\n5\n\nSAMPLE",
"2\n3\n7\n\nELPNAS",
... |
chiku-and-his-astrology | Little Chiku is very choosy about numbers. He considers 0 and 1 together as bad omen. So he hates 0 and 1 appearing adjacent to each other. So he wants you to remove these 0 and 1 combinations from a string. So you proceed like this : Choose any two adjacent positions in the string, and if one them contains 0, and the ... | {
"input": [],
"output": []
} | {
"input": [
"3\n11101111\n1100\n01010\n\nSAMPLE",
"3\n11101111\n1100\n01010"
],
"output": [
"6\n0\n1\n",
"6\n0\n1\n"
]
} | {
"input": [
"3\n11101111\n1100\n01110\n\nSAMPLE",
"3\n01101111\n1100\n01010",
"3\n11101111\n0100\n01110\n\nSAMPLE",
"3\n01111100\n1100\n01010",
"3\n01011100\n1100\n01010",
"3\n01011100\n1110\n01010",
"3\n01101111\n1101\n01110\n\nSAPMLE",
"3\n01011101\n1110\n01010",
"3\n01011101\n1... |
gudi-trapped-in-the-room-july-easy | Gudi enters the castle, and moves along the main path. Suddenly, a block in the ground opens and she falls into it! Gudi slides down and lands in a dark room. A mysterious voice announces:
Intruders are not allowed inside the castle. To proceed, you must
solve my puzzle. Here is a string S indexed from 1 to N,
cons... | {
"input": [],
"output": []
} | {
"input": [
"2\n31\n4 1\n160\n9 2\n\nSAMPLE"
],
"output": [
"11\n000\n"
]
} | {
"input": [
"2\n31\n4 1\n98\n9 2\n\nSAMPLE",
"2\n31\n7 1\n98\n17 2\n\nSAMOLE",
"2\n6\n7 1\n98\n17 2\n\nSAMOLE",
"2\n6\n4 2\n98\n24 3\n\nSAMOLE",
"2\n6\n4 2\n152\n24 3\n\nSAMOLE",
"2\n12\n4 1\n152\n24 3\n\nSAMOLE",
"2\n12\n4 1\n72\n24 3\n\nELOMAS",
"2\n12\n4 1\n11\n24 3\n\nEKOMAS",
... |
primed-position | Prime numbers are those numbers which have only 2 factors, 1 and the number itself. For example, 3 is a prime number have factors 1 and 3 only.
Now, all the prime numbers are arranged sequentially in ascending order. i.e:- 2, 3, 5,7...and so on. Now, your task is to calculate those prime numbers which are present at a... | {
"input": [],
"output": []
} | {
"input": [
"2\n1 2\n2 3\n\nSAMPLE"
],
"output": [
"15 \n55"
]
} | {
"input": [
"2\n1 2\n2 6\n\nSAMPLE",
"2\n1 1\n2 6\n\nSAMPLE",
"2\n2 1\n2 2\n\nSAMPLE",
"2\n2 1\n2 3\n\nSAMPLE",
"2\n2 1\n0 3\n\nSAMPLE",
"2\n2 1\n1 3\n\nELPMAS",
"2\n2 2\n1 3\n\nELPMAS",
"2\n2 2\n2 3\n\nELPMAS",
"2\n2 0\n2 3\n\nALPMES",
"2\n2 0\n2 2\n\nAPLMET",
"2\n4 0\n1 ... |
satisfaction-sets | What if we Unite against the Difference between ourselves ?
Welcome into the Brother-Hood town. Citizens of Brother-Hood town are feeling very happy that you came for their help. But what is the problem they have ?
There is one very crucial problem in the town now. Years ago people of town were living together , and w... | {
"input": [],
"output": []
} | {
"input": [
"3\n5\n1 1 2 3 7\n5\n3 5 2 1 6\n5\n1 5 7 8 9\n\nSAMPLE"
],
"output": [
"-1\n"
]
} | {
"input": [
"3\n5\n1 1 2 3 7\n5\n3 5 2 1 11\n5\n1 5 7 8 9\n\nSAMPLE",
"3\n0\n0 1 2 3 9\n-1\n3 5 1 1 12\n5\n2 5 7 8 9\n\nSAMPLE",
"3\n5\n1 1 2 3 7\n5\n3 7 2 1 11\n5\n1 5 7 8 9\n\nSAMPLE",
"3\n0\n0 1 2 3 9\n-1\n3 5 1 1 12\n5\n3 5 7 8 9\n\nSAMPLE",
"3\n0\n0 1 2 3 9\n-1\n3 5 1 2 12\n5\n2 5 7 2 9\n\nS... |
p02628 AtCoder Beginner Contest 171 - Mix Juice | A shop sells N kinds of fruits, Fruit 1, \ldots, N, at prices of p_1, \ldots, p_N yen per item, respectively. (Yen is the currency of Japan.)
Here, we will choose K kinds of fruits and buy one of each chosen kind. Find the minimum possible total price of those fruits.
Constraints
* 1 \leq K \leq N \leq 1000
* 1 \leq... | {
"input": [],
"output": []
} | {
"input": [
"1 1\n1000",
"5 3\n50 100 80 120 80"
],
"output": [
"1000",
"210"
]
} | {
"input": [
"5 3\n50 000 80 120 80",
"5 3\n83 000 80 120 80",
"5 3\n83 010 80 120 80",
"5 3\n83 000 80 120 99",
"5 3\n83 000 16 120 99",
"2 3\n83 001 16 120 99",
"1 0\n1000",
"5 3\n50 100 80 120 150",
"5 3\n28 000 80 120 80",
"5 3\n68 000 80 120 80",
"5 3\n83 010 56 120 80... |
p02759 AtCoder Beginner Contest 157 - Duplex Printing | Takahashi wants to print a document with N pages double-sided, where two pages of data can be printed on one sheet of paper.
At least how many sheets of paper does he need?
Constraints
* N is an integer.
* 1 \leq N \leq 100
Input
Input is given from Standard Input in the following format:
N
Output
Print the a... | {
"input": [],
"output": []
} | {
"input": [
"5",
"100",
"2"
],
"output": [
"3",
"50",
"1"
]
} | {
"input": [
"9",
"110",
"3",
"11",
"111",
"6",
"101",
"1",
"8",
"18",
"14",
"15",
"26",
"36",
"28",
"65",
"20",
"42",
"67",
"47",
"57",
"55",
"40",
"24",
"75",
"69",
"92",
"148",
"282",
"33",
"... |
p02894 AtCoder Grand Contest 039 - Incenters | Given are N points on the circumference of a circle centered at (0,0) in an xy-plane. The coordinates of the i-th point are (\cos(\frac{2\pi T_i}{L}),\sin(\frac{2\pi T_i}{L})).
Three distinct points will be chosen uniformly at random from these N points. Find the expected x- and y-coordinates of the center of the circ... | {
"input": [],
"output": []
} | {
"input": [
"3 4\n0\n1\n3",
"10 100\n2\n11\n35\n42\n54\n69\n89\n91\n93\n99",
"4 8\n1\n3\n5\n6"
],
"output": [
"0.414213562373095 -0.000000000000000",
"0.352886583546338 -0.109065017701873",
"-0.229401949926902 -0.153281482438188"
]
} | {
"input": [
"10 100\n2\n10\n35\n42\n54\n69\n89\n91\n93\n99",
"4 8\n1\n5\n5\n6",
"10 100\n2\n10\n35\n42\n54\n69\n87\n91\n93\n99",
"4 8\n1\n2\n5\n6",
"4 8\n1\n2\n5\n5",
"4 8\n1\n3\n5\n5",
"4 15\n1\n3\n5\n5",
"3 4\n0\n0\n3",
"10 100\n2\n11\n40\n42\n54\n69\n89\n91\n93\n99",
"10 10... |
p03029 AtCoder Beginner Contest 128 - Apple Pie | We have A apples and P pieces of apple.
We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan.
Find the maximum number of apple pies we can make with what we have now.
Constraints
* All values in input are integers.
* 0 \leq A, P \leq 100
Input
Input is g... | {
"input": [],
"output": []
} | {
"input": [
"1 3",
"32 21",
"0 1"
],
"output": [
"3",
"58",
"0"
]
} | {
"input": [
"2 3",
"53 21",
"1 1",
"2 6",
"34 21",
"0 0",
"0 6",
"47 21",
"0 -1",
"47 2",
"-1 -1",
"2 5",
"47 3",
"-1 -2",
"-2 -1",
"2 12",
"15 4",
"2 14",
"29 4",
"1 -1",
"4 14",
"58 4",
"7 14",
"58 3",
"12 14",
... |
p03170 Educational DP Contest - Stones | There is a set A = \\{ a_1, a_2, \ldots, a_N \\} consisting of N positive integers. Taro and Jiro will play the following game against each other.
Initially, we have a pile consisting of K stones. The two players perform the following operation alternately, starting from Taro:
* Choose an element x in A, and remove e... | {
"input": [],
"output": []
} | {
"input": [
"1 100000\n1",
"3 21\n1 2 3",
"2 5\n2 3",
"2 4\n2 3",
"2 7\n2 3",
"3 20\n1 2 3"
],
"output": [
"Second",
"First",
"Second",
"First",
"First",
"Second"
]
} | {
"input": [
"1 100000\n2",
"3 21\n1 1 3",
"2 3\n2 3",
"2 7\n1 3",
"1 100000\n4",
"3 21\n1 1 4",
"2 4\n2 5",
"2 1\n1 3",
"2 4\n3 5",
"2 2\n1 3",
"2 2\n2 3",
"2 5\n2 5",
"2 3\n3 3",
"3 36\n1 1 3",
"2 14\n1 3",
"0 100000\n1",
"3 21\n2 1 4",
"2 6\n2... |
p03315 AtCoder Beginner Contest 101 - Eating Symbols Easy | There is always an integer in Takahashi's mind.
Initially, the integer in Takahashi's mind is 0. Takahashi is now going to eat four symbols, each of which is `+` or `-`. When he eats `+`, the integer in his mind increases by 1; when he eats `-`, the integer in his mind decreases by 1.
The symbols Takahashi is going t... | {
"input": [],
"output": []
} | {
"input": [
"+-++",
"-+--",
"----"
],
"output": [
"2",
"-2",
"-4"
]
} | {
"input": [
"--+-",
"++-+",
"++++",
"-+-+",
"---+",
"+---",
"-+++",
"+++-",
"++--",
"+--+",
"--++",
"+-+-",
"-++-",
"--+-",
"++-+",
"---+",
"+++-",
"-+++",
"+---",
"++++",
"-++-",
"+-+-",
"++--",
"--++",
"-+-+",
"... |
p03472 AtCoder Beginner Contest 085 - Katana Thrower | You are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:
* Wield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of dam... | {
"input": [],
"output": []
} | {
"input": [
"4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999",
"1 10\n3 5",
"2 10\n3 5\n2 6",
"5 500\n35 44\n28 83\n46 62\n31 79\n40 43"
],
"output": [
"860000004",
"3",
"2",
"9"
]
} | {
"input": [
"4 1000000000\n1 1\n1 00000000\n1 30000000\n1 99999999",
"1 10\n4 5",
"2 10\n2 5\n2 6",
"5 500\n35 44\n28 83\n46 62\n31 79\n0 43",
"4 1000000000\n1 1\n1 00000000\n1 30000000\n1 164820504",
"2 19\n2 5\n2 6",
"2 19\n4 5\n2 6",
"4 1000000000\n1 1\n1 00000000\n0 30000000\n2 16... |
p03634 AtCoder Beginner Contest 070 - Transit Tree Path | You are given a tree with N vertices.
Here, a tree is a kind of graph, and more specifically, a connected undirected graph with N-1 edges, where N is the number of its vertices.
The i-th edge (1≤i≤N-1) connects Vertices a_i and b_i, and has a length of c_i.
You are also given Q queries and an integer K. In the j-th qu... | {
"input": [],
"output": []
} | {
"input": [
"5\n1 2 1\n1 3 1\n2 4 1\n3 5 1\n3 1\n2 4\n2 3\n4 5",
"7\n1 2 1\n1 3 3\n1 4 5\n1 5 7\n1 6 9\n1 7 11\n3 2\n1 3\n4 5\n6 7",
"10\n1 2 1000000000\n2 3 1000000000\n3 4 1000000000\n4 5 1000000000\n5 6 1000000000\n6 7 1000000000\n7 8 1000000000\n8 9 1000000000\n9 10 1000000000\n1 1\n9 10"
],
"out... | {
"input": [
"7\n1 2 1\n1 3 3\n1 4 5\n1 5 7\n1 6 9\n1 7 11\n3 2\n1 3\n4 5\n5 7",
"7\n1 2 1\n1 3 3\n1 4 5\n1 5 7\n1 6 9\n1 7 11\n3 2\n1 4\n4 5\n5 7",
"7\n1 2 1\n1 3 3\n1 4 5\n1 5 7\n1 6 9\n1 7 11\n3 2\n1 4\n4 5\n5 5",
"7\n1 2 1\n1 3 3\n1 4 5\n1 5 11\n1 6 9\n1 7 11\n3 2\n1 4\n4 5\n5 5",
"5\n1 2 1\n1... |
p03792 Mujin Programming Challenge 2017 - Row to Column | There is a square-shaped grid with N vertical rows and N horizontal columns. We will denote the square at the i-th row from the top and the j-th column from the left as (i,\ j).
Initially, each square is either white or black. The initial color of the grid is given to you as characters a_{ij}, arranged in a square sha... | {
"input": [],
"output": []
} | {
"input": [
"2\n..\n..",
"2\n#.\n.#",
"2",
"3\n.#.\n\n.#.",
"3\n...\n.#.\n...",
"2\n.\n.#"
],
"output": [
"-1",
"3",
"0",
"2",
"5",
"3"
]
} | {
"input": [
"2\n/.\n..",
"2\n#.\n#.",
"3\n.#.\n\n.$.",
"3\n...\n.#.\n/..",
"2\n.\n#.",
"2\n#.\n-#",
"0",
"2\n./\n..",
"2\n#.\n#-",
"3\n.\".\n\n.$.",
"3\n...\n.#/\n/..",
"2\n.\n\".",
"2\n-/\n..",
"3\n.!.\n\n.$.",
"3\n...\n.#.\n../",
"2\n.\n.\"",
"2\n... |
p03961 CODE FESTIVAL 2016 qual C - Encyclopedia of Permutations | One day Mr. Takahashi picked up a dictionary containing all of the N! permutations of integers 1 through N. The dictionary has N! pages, and page i (1 ≤ i ≤ N!) contains the i-th permutation in the lexicographical order.
Mr. Takahashi wanted to look up a certain permutation of length N in this dictionary, but he forgo... | {
"input": [],
"output": []
} | {
"input": [
"1\n0",
"5\n1 2 3 5 4",
"4\n0 2 3 0",
"10\n0 3 0 0 1 0 4 0 0 0",
"3\n0 0 0"
],
"output": [
"1",
"2",
"23",
"953330050",
"21"
]
} | {
"input": [
"1\n1",
"4\n0 1 3 0",
"3\n0 0 1",
"4\n0 1 2 0",
"3\n0 0 2",
"3\n0 0 3",
"10\n0 3 0 0 1 0 6 0 0 0",
"4\n0 1 0 0",
"4\n0 0 0 0",
"4\n0 0 0 1",
"4\n0 2 3 1",
"3\n0 1 0",
"10\n0 5 0 0 1 0 6 0 0 0",
"4\n0 0 0 2",
"4\n0 0 1 0",
"4\n0 4 3 1",
"... |
p00052 Factorial II | n! = n × (n − 1) × (n − 2) × ... × 3 × 2 × 1
Is called the factorial of n. For example, the factorial of 12
12! = 12 x 11 x 10 x 9 x 8 x 7 x 6 x 5 x 4 x 3 x 2 x 1 = 479001600
And there are two consecutive 0s at the end.
Write a program that inputs the integer n and outputs the number of consecutive 0s at the end of... | {
"input": [],
"output": []
} | {
"input": [
"2\n12\n10000\n0"
],
"output": [
"0\n2\n2499"
]
} | {
"input": [
"2\n21\n10000\n0",
"2\n21\n11000\n0",
"2\n6\n11000\n0",
"2\n6\n11100\n0",
"2\n6\n10000\n0",
"2\n42\n11000\n0",
"2\n3\n11100\n0",
"2\n6\n10101\n0",
"2\n1\n11110\n0",
"2\n12\n11000\n0",
"2\n10\n10000\n0",
"2\n3\n10100\n0",
"2\n0\n11110\n0",
"2\n12\n11... |
p00182 Beaker | Beakers of various capacities are given. First, choose one of the largest beakers and pour it through the faucet until it is full. Next, transfer the water from the beaker to another beaker according to the following rules.
* All water in the beaker must be transferred to another beaker without leaving. However, if it... | {
"input": [],
"output": []
} | {
"input": [
"10\n11 2 23 4 2 12 8 5 2 10\n8\n2 1 3 11 2 3 1 4\n9\n5 9 1 2 4 8 17 1 8\n8\n3 38 9 4 18 14 19 5\n1\n1\n0"
],
"output": [
"YES\nYES\nYES\nNO\nYES"
]
} | {
"input": [
"10\n11 2 23 4 2 12 8 5 2 10\n8\n2 1 3 11 2 3 1 4\n9\n5 9 1 2 4 8 17 1 8\n8\n3 38 9 4 24 14 19 5\n1\n1\n0",
"10\n11 2 23 4 3 12 8 5 2 10\n8\n2 1 3 11 2 3 1 4\n9\n5 9 1 2 4 8 17 1 8\n8\n3 38 9 4 24 14 19 5\n1\n1\n0",
"10\n11 2 23 4 3 12 8 5 0 10\n8\n2 1 3 11 2 3 1 4\n9\n5 9 1 2 4 8 17 1 14\n8\... |
p00338 Programming Contest II | White Tiger University holds a programming contest every year. The contest starts with a score of 0 for all teams, and points are added according to the answer status. In this contest, rankings will be made in descending order of score. When the total number of teams is N, each team is assigned a number from 1 to N. If... | {
"input": [],
"output": []
} | {
"input": [
"3 11\n0 2 5\n0 1 5\n0 3 4\n1 1\n1 2\n1 3\n0 3 2\n1 1\n0 2 1\n1 2\n1 3",
"5 2\n1 1\n1 2"
],
"output": [
"1 5\n2 5\n3 4\n3 6\n3 6\n1 5",
"1 0\n2 0"
]
} | {
"input": [
"3 11\n0 2 5\n0 1 5\n0 3 6\n1 1\n1 2\n1 3\n0 3 2\n1 1\n0 2 1\n1 2\n1 3",
"3 11\n0 2 5\n0 1 5\n0 3 8\n1 1\n1 2\n1 3\n0 3 2\n1 1\n0 2 1\n1 2\n1 3",
"3 10\n0 2 5\n0 1 5\n0 3 6\n1 1\n1 2\n1 3\n0 3 2\n1 1\n0 2 1\n1 2\n1 3",
"3 11\n0 2 5\n0 1 5\n0 3 3\n1 1\n1 2\n1 3\n0 3 2\n1 1\n0 2 1\n1 2\n1 3... |
p00529 Tower of JOIOI | Tower of JOIOI
The JOIOI Tower is a game that uses a disk to be played by one person.
This game is played using several disks with the letters J, O, and I written on them. The discs have different diameters, and at the start of the game, these discs are stacked from bottom to top in descending order of diameter. You ... | {
"input": [],
"output": []
} | {
"input": [
"6\nJOIIOI"
],
"output": [
"2"
]
} | {
"input": [
"6\nIOIIOJ",
"6\nIJIJOO",
"6\nJOIJOI",
"6\nIOIIJO",
"6\nOJIIOI",
"6\nOJJIOI",
"6\nIOIJJO",
"6\nIJIIOO",
"6\nJOIIJO",
"6\nIOOIJI",
"6\nOOIIJI",
"6\nOJKIOI",
"6\nOOJIJI",
"6\nJOIIIO",
"6\nJOIJOJ",
"6\nIJIOOI",
"6\nHJIJOO",
"6\nIOIJOJ",... |
p00696 Multi-column List | Ever since Mr. Ikra became the chief manager of his office, he has had little time for his favorites, programming and debugging. So he wants to check programs in trains to and from his office with program lists. He has wished for the tool that prints source programs as multi-column lists so that each column just fits i... | {
"input": [],
"output": []
} | {
"input": [
"6\n2\n8\n1\nAZXU5\n1GU2D4B\nK\nPO4IUTFV\nTHE\nQ34NBVC78\nT\n1961\nXWS34WQ\n\nLNGLNSNXTTPG\nED\nMN\nMLMNG\n?\n4\n2\n6\n2\nQWERTY\nFLHL\n?\n0"
],
"output": [
"AZXU5....8.......\n1GU2D4B..T.......\nK........1961....\nPO4IUTFV.XWS34WQ.\nTHE..............\nQ34NBVC7.LNGLNSNX\n\nTTPG.............\n... | {
"input": [
"6\n2\n8\n1\nAZXU5\n1GU2D4B\nK\nPO4IUTFV\nTHE\nQ34NBVC78\nT\n1961\nXWS34WQ\n\nLNGLNSNXTTPG\nED\nNM\nMLMNG\n?\n4\n2\n6\n2\nQWERTY\nFLHL\n?\n0",
"6\n2\n8\n1\nAZXU5\n1GU2D4B\nK\nPO4IUTFV\nTHE\nQ34NBVC78\nT\n1961\nQW43SWX\n\nLNGLNSNXTTPG\nED\nNM\nMLMNG\n?\n4\n2\n6\n2\nQWERTY\nFLHL\n?\n0",
"6\n2\n... |
p00837 Book Replacement | The deadline of Prof. Hachioji’s assignment is tomorrow. To complete the task, students have to copy pages of many reference books in the library.
All the reference books are in a storeroom and only the librarian is allowed to enter it. To obtain a copy of a reference book’s page, a student should ask the librarian to... | {
"input": [],
"output": []
} | {
"input": [
"2 1 1\n1\n50\n2 1 2\n1\n50\n1\n60\n2 1 2\n2\n60 61\n1\n70\n4 2 3\n3\n60 61 62\n1\n70\n2\n80 81\n3 1 2\n3\n60 61 62\n2\n70 60\n1 2 5\n2\n87 95\n3\n96 71 35\n2\n68 2\n3\n3 18 93\n2\n57 2\n2 2 1\n5\n1 2 1 3 1\n0 0 0"
],
"output": [
"4\n16\n28\n68\n58\n98\n23"
]
} | {
"input": [
"2 1 1\n1\n50\n2 2 2\n1\n50\n1\n60\n2 1 2\n2\n60 61\n1\n70\n4 2 3\n3\n60 61 62\n1\n70\n2\n80 81\n3 1 2\n3\n60 61 62\n2\n70 60\n1 2 5\n2\n87 95\n3\n96 71 35\n2\n68 2\n3\n3 18 93\n2\n57 2\n2 2 1\n5\n1 2 1 3 1\n0 0 0",
"2 1 1\n1\n50\n2 1 2\n1\n50\n1\n60\n2 1 2\n2\n60 61\n1\n70\n4 2 3\n3\n60 61 62\n1... |
p00969 Arithmetic Progressions | Arithmetic Progressions
An arithmetic progression is a sequence of numbers $a_1, a_2, ..., a_k$ where the difference of consecutive members $a_{i+1} - a_i$ is a constant ($1 \leq i \leq k-1$). For example, the sequence 5, 8, 11, 14, 17 is an arithmetic progression of length 5 with the common difference 3.
In this pro... | {
"input": [],
"output": []
} | {
"input": [
"6\n0 1 3 5 6 9"
],
"output": [
"4"
]
} | {
"input": [
"6\n0 2 3 5 6 9",
"6\n0 1 3 5 8 9",
"6\n0 1 3 5 7 9",
"6\n-1 1 3 5 7 9",
"6\n-1 2 0 8 6 9",
"6\n0 4 3 5 6 9",
"6\n0 2 3 5 6 14",
"6\n0 2 3 5 7 9",
"6\n-1 1 3 5 6 9",
"6\n-1 2 3 5 6 9",
"6\n0 4 3 5 6 10",
"6\n0 2 3 5 4 9",
"6\n0 1 3 10 6 9",
"6\n0 1 ... |
p01101 Taro's Shopping | Taro's Shopping
Mammy decided to give Taro his first shopping experience. Mammy tells him to choose any two items he wants from those listed in the shopping catalogue, but Taro cannot decide which two, as all the items look attractive. Thus he plans to buy the pair of two items with the highest price sum, not exceedin... | {
"input": [],
"output": []
} | {
"input": [
"3 45\n10 20 30\n6 10\n1 2 5 8 9 11\n7 100\n11 34 83 47 59 29 70\n4 100\n80 70 60 50\n4 20\n10 5 10 16\n0 0"
],
"output": [
"40\n10\n99\nNONE\n20"
]
} | {
"input": [
"3 45\n17 20 30\n6 10\n1 2 5 8 9 11\n7 100\n11 34 83 47 59 29 70\n4 100\n80 70 60 50\n4 20\n10 5 10 16\n0 0",
"3 45\n17 20 30\n6 10\n1 2 5 8 4 11\n7 000\n11 34 83 47 59 29 70\n4 100\n80 70 62 50\n4 20\n10 5 10 16\n0 0",
"3 45\n2 20 30\n6 10\n1 2 5 8 4 11\n7 100\n11 34 83 47 59 29 70\n4 100\n8... |
p01238 Subdividing a Land | Indigo Real-estate Company is now planning to develop a new housing complex. The entire complex is a square, all of whose edges are equally a meters. The complex contains n subdivided blocks, each of which is a b-meter square. Here both a and b are positive integers.
However the project is facing a big problem. In thi... | {
"input": [],
"output": []
} | {
"input": [
"1\n2\n0"
],
"output": [
"Case 1: 3 2\nCase 2: 2 1"
]
} | {
"input": [
"1\n0\n0",
"1\n1\n0",
"1\n4\n0",
"1\n6\n0",
"1\n8\n0",
"1\n3\n0",
"1\n12\n0",
"1\n5\n0",
"1\n11\n0",
"1\n14\n0",
"1\n25\n0",
"1\n9\n0",
"1\n7\n0",
"1\n18\n0",
"1\n22\n0",
"1\n13\n0",
"1\n36\n0",
"1\n0\n1",
"1\n0\n2",
"1\n0\n-... |
p01400 Seishun 18 Kippu | Problem C: Seishun 18 Kippu
A student at R University, sirokurostone, was about to attend a training camp at Atsu University. Other members plan to use the Shinkansen, but sirokurostone was going to use the Seishun 18 Ticket. Similarly, a person who likes 2D with a youth 18 ticket was also trying to participate in the... | {
"input": [],
"output": []
} | {
"input": [
"4 4\nA B G\nA B 40 3\nB C 80 0\nA G 40 0\nB G 80 0\n5 6\nKusatsu Tokyo Aizu\nTokyo Nagoya 120 3\nKusatsu Nagoya 40 0\nKusatsu Kanazawa 40 0\nKanazawa Aizu 40 0\nTokyo Kanazawa 40 0\nTokyo Aizu 80 4\n0 0"
],
"output": [
"5\n4"
]
} | {
"input": [
"4 4\nA B G\nA B 40 3\nB C 80 0\nA G 40 0\nB G 80 0\n5 6\nKusatsu Tokyo Aizu\nTokyo Nagoya 3 3\nKusatsu Nagoya 40 0\nKusatsu Kanazawa 40 0\nKanazawa Aizu 40 0\nTokyo Kanazawa 40 0\nTokyo Aizu 80 4\n0 0",
"4 4\nA B G\nA B 40 3\nB C 80 0\nA G 40 0\nB G 80 -1\n5 6\nKusatsu Tokyo Aizu\nTokyo Nagoya 1... |
p01553 Hakone | Hakone Ekiden is one of the Japanese New Year's traditions. In Hakone Ekiden, 10 runners from each team aim for the goal while connecting the sashes at each relay station. In the TV broadcast, the ranking change from the previous relay station is displayed along with the passing order of each team at the relay station.... | {
"input": [],
"output": []
} | {
"input": [
"3\n-\nU\nD",
"10\nU\nD\nU\nD\nU\nD\nU\nD\nU\nD",
"8\nU\nD\nD\nD\nD\nD\nD\nD",
"2\nD\nU",
"5\nU\nU\n-\nD\nD"
],
"output": [
"1",
"608",
"1",
"0",
"5"
]
} | {
"input": [
"2\nD\nT",
"2\nE\nU",
"2\nF\nU",
"2\nD\nS",
"2\nC\nU",
"2\nB\nU",
"2\nD\nV",
"2\nD\nR",
"2\nA\nU",
"2\nD\nW",
"2\nG\nU",
"2\nD\nX",
"2\nD\nY",
"2\nD\nZ",
"2\nD\nQ",
"2\nD\nP",
"2\n@\nU",
"2\nH\nU",
"2\nI\nU",
"2\nD\nO",
"... |
p01709 Color the Map Extreme | Problem Statement
You have just transferred to another world, and got a map of this world. There are several countries in this world. Each country has a connected territory, which is drawn on the map as a simple polygon consisting of its border segments in the $2$-dimensional plane.
You are strange to this world, so ... | {
"input": [],
"output": []
} | {
"input": [
"1\n3\n0 0\n1 0\n0 1\n4\n4\n0 0\n10 0\n10 10\n0 10\n4\n10 0\n20 0\n20 10\n10 10\n4\n0 10\n10 10\n10 20\n0 20\n4\n10 10\n20 10\n20 20\n10 20\n3\n4\n-10 -10\n2 2\n10 10\n-11 7\n3\n-1 -1\n1 -1\n0 0\n3\n0 0\n3 -3\n20 20\n7\n4\n46 12\n52 12\n53 15\n45 15\n32\n67 1\n70 0\n73 1\n77 3\n79 5\n80 8\n77 8\n76 5... | {
"input": [
"1\n3\n0 0\n1 0\n0 1\n4\n4\n0 0\n10 0\n10 10\n0 10\n4\n10 0\n20 0\n20 10\n10 10\n4\n0 10\n10 10\n10 20\n0 20\n4\n10 10\n20 10\n20 20\n10 20\n3\n4\n-10 -10\n2 2\n10 10\n-11 7\n3\n-1 -1\n1 -1\n0 0\n3\n0 0\n3 -3\n20 20\n7\n4\n46 12\n52 12\n53 15\n45 15\n32\n67 1\n70 0\n73 1\n77 3\n79 5\n80 8\n77 8\n76 5... |
p01854 Pots | Problem statement
Here are N mysteriously shaped vases. The i-th jar is a shape in which K_i right-sided cylinders are vertically connected in order from the bottom. The order in which they are connected cannot be changed. Mr. A has a volume of water of M. Pour this water into each jar in any amount you like. It does ... | {
"input": [],
"output": []
} | {
"input": [
"2 15\n2 3 3 7 2\n2 7 1 1 4"
],
"output": [
"6.33333333"
]
} | {
"input": [
"2 15\n2 3 3 7 2\n1 7 1 1 4",
"2 15\n2 3 5 7 2\n0 7 1 1 4",
"2 15\n2 5 5 8 2\n1 7 1 1 4",
"2 4\n2 3 3 7 1\n0 7 1 1 6",
"2 25\n2 3 3 7 2\n2 7 1 1 4",
"2 0\n2 3 5 7 2\n1 7 1 1 4",
"2 4\n2 1 3 7 1\n0 7 1 1 6",
"2 15\n2 2 5 7 3\n0 11 0 1 4",
"2 15\n2 3 2 7 3\n0 11 0 1 2",
... |
p01989 Internet Protocol Address | A: IP Address (Internet Protocol Address)
problem
Since one number string is given, find the number of valid delimiters for IPv4 IP addresses. However, the effective delimiters for IPv4 IP addresses are as follows.
* The sequence of numbers is divided into four, and each of the separated columns satisfies all of the... | {
"input": [],
"output": []
} | {
"input": [
"123456789"
],
"output": [
"1"
]
} | {
"input": [
"243960381",
"17566177",
"2154497",
"961829",
"1544196",
"373537",
"2961",
"7074896",
"1117147",
"2844628",
"11343273",
"62476594",
"1581113",
"2527273",
"2532591",
"164664",
"2642",
"3591",
"4233",
"561",
"619",
"17"... |
p02135 Tree Fragments | Problem
Ai-chan has a tree $ T $ consisting of $ N $ vertices and $ N-1 $ edges. Each vertex has a number from $ 1 $ to $ N $ and a positive integer weight.
Answer the following $ Q $ queries in order.
* $ 1 \ le a_i, b_i \ le N $ ($ a_i \ ne b_i $) is given, so you can remove the vertices on the $ a_i $-$ b_i $ pat... | {
"input": [],
"output": []
} | {
"input": [
"10\n1 2 3 4 5 6 7 8 9 10\n1 2\n2 3\n3 4\n3 5\n2 6\n6 7\n2 8\n8 9\n8 10\n3\n3 8\n7 1\n7 10",
"5\n1 2 3 4 5\n1 2\n2 3\n3 4\n4 5\n3\n1 2\n1 5\n2 4",
"15\n3 8 4 2 6 5 1 2 10 3 4 2 6 1 1\n1 2\n2 3\n3 4\n3 5\n2 6\n6 7\n6 8\n1 9\n9 10\n10 11\n10 12\n9 13\n13 14\n13 15\n5\n1 1\n2 7\n6 10\n1 15\n3 4"... | {
"input": [
"5\n2 2 3 4 5\n1 2\n2 3\n3 4\n4 5\n3\n1 2\n1 5\n2 4",
"10\n1 2 3 4 5 6 12 8 9 10\n1 2\n2 3\n3 4\n3 5\n2 6\n6 7\n2 8\n8 9\n8 10\n3\n3 8\n7 1\n7 10",
"10\n1 2 3 4 5 6 7 8 9 10\n1 2\n2 3\n3 4\n3 5\n2 6\n6 7\n2 8\n8 9\n8 10\n3\n3 8\n7 2\n7 10",
"15\n3 8 4 2 6 5 1 2 10 0 4 2 6 1 1\n1 2\n2 3\n3... |
p02276 Partition | Quick sort is based on the Divide-and-conquer approach. In QuickSort(A, p, r), first, a procedure Partition(A, p, r) divides an array A[p..r] into two subarrays A[p..q-1] and A[q+1..r] such that each element of A[p..q-1] is less than or equal to A[q], which is, inturn, less than or equal to each element of A[q+1..r]. I... | {
"input": [],
"output": []
} | {
"input": [
"12\n13 19 9 5 12 8 7 4 21 2 6 11"
],
"output": [
"9 5 8 7 4 2 6 [11] 21 13 19 12"
]
} | {
"input": [
"12\n13 19 9 5 12 8 7 4 21 2 10 11",
"12\n13 19 9 5 12 8 7 4 21 2 10 18",
"12\n13 19 9 5 12 8 7 4 21 0 10 18",
"12\n13 19 9 5 12 8 7 4 37 0 10 18",
"12\n13 19 9 5 12 8 7 4 13 0 10 18",
"12\n25 19 9 5 12 8 7 4 13 0 10 18",
"12\n25 19 9 5 12 8 7 4 13 -1 10 18",
"12\n25 19 9 ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.