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 | John loves prime numbers. One day he was playing a game "primcia" with his wife alicia. The game is as follows, John write a number N on a table.
The number is of the form:
N = (P1^A1) * (P2^A2) * .............. * (Px^Ax).
Where Pi are prime numbers and Ai are its corresponding powers.
Now, he asks Alicia to find ... | stdin | null | 4,096 | 1 | [
"1\n3\n2 3 5\n2 1 1\n\nSAMPLE\n"
] | [
"90\n"
] | [
"1\n3\n2 3 5\n2 2 1\n\nSAMPLE\n",
"1\n3\n2 3 5\n0 2 1\n\nSAMPLE\n",
"1\n3\n2 3 4\n2 1 1\n\nSAMPLE\n",
"1\n3\n2 3 2\n2 2 1\n\nSAMPLE\n",
"1\n2\n2 2 2\n1 -1 2\n\nMLSECP\n",
"1\n2\n2 2 2\n-1 -1 2\n\nMLPEBS\n",
"1\n3\n2 2 4\n2 1 1\n\nSAMPLE\n",
"1\n0\n4 -1 2\n-1 1 1\n\nSBEPLM\n",
"1\n0\n2 3 3\n1 -1 2\n\... | [
"360\n",
"0\n",
"72\n",
"144\n",
"999999995\n",
"6\n",
"48\n",
"2\n",
"999999983\n",
"12\n"
] |
CodeContests | Takahashi will do a tap dance. The dance is described by a string S where each character is `L`, `R`, `U`, or `D`. These characters indicate the positions on which Takahashi should step. He will follow these instructions one by one in order, starting with the first character.
S is said to be easily playable if and onl... | stdin | null | 766 | 1 | [
"RUDLUDR\n",
"DULL\n",
"RDULULDURURLRDULRLR\n",
"UUUUUUUUUUUUUUU\n",
"ULURU\n"
] | [
"Yes\n",
"No\n",
"Yes\n",
"Yes\n",
"No\n"
] | [
"RDULDUR\n",
"LLUD\n",
"RDULULDURURLLDULRRR\n",
"ULURV\n",
"EULL\n",
"RCULULDURURLLDULRRR\n",
"UKURU\n",
"EULM\n",
"RCVLULDURURLLDULRRR\n",
"UJURU\n"
] | [
"Yes\n",
"No\n",
"No\n",
"No\n",
"No\n",
"No\n",
"No\n",
"No\n",
"No\n",
"No\n"
] |
CodeContests | Addition of Big Integers
Given two integers $A$ and $B$, compute the sum, $A + B$.
Input
Two integers $A$ and $B$ separated by a space character are given in a line.
Output
Print the sum in a line.
Constraints
* $-1 \times 10^{100000} \leq A, B \leq 10^{100000}$
Sample Input 1
5 8
Sample Output 1
13
S... | stdin | null | 199 | 1 | [
"5 8\n"
] | [
"13\n"
] | [
"9 8\n",
"17 8\n",
"17 12\n",
"17 16\n",
"21 16\n",
"41 16\n",
"58 16\n",
"58 30\n",
"109 30\n",
"195 30\n"
] | [
"17\n",
"25\n",
"29\n",
"33\n",
"37\n",
"57\n",
"74\n",
"88\n",
"139\n",
"225\n"
] |
CodeContests | There are K items placed on a grid of squares with R rows and C columns. Let (i, j) denote the square at the i-th row (1 \leq i \leq R) and the j-th column (1 \leq j \leq C). The i-th item is at (r_i, c_i) and has the value v_i.
Takahashi will begin at (1, 1), the start, and get to (R, C), the goal. When he is at (i, ... | stdin | null | 5,047 | 1 | [
"2 5 5\n1 1 3\n2 4 20\n1 2 1\n1 3 4\n1 4 2\n",
"2 2 3\n1 1 3\n2 1 4\n1 2 5\n",
"4 5 10\n2 5 12\n1 5 12\n2 3 15\n1 2 20\n1 1 28\n2 4 26\n3 2 27\n4 5 21\n3 5 10\n1 3 10\n"
] | [
"29\n",
"8\n",
"142\n"
] | [
"2 5 5\n1 1 3\n2 4 20\n2 2 1\n1 3 4\n1 4 2\n",
"4 5 3\n2 5 12\n1 5 12\n2 3 15\n1 2 20\n1 1 28\n2 4 26\n3 2 27\n4 5 21\n3 5 10\n1 3 10\n",
"4 5 3\n2 5 10\n1 5 12\n2 3 15\n1 2 20\n1 1 28\n2 4 26\n3 2 27\n4 5 21\n3 5 10\n1 3 10\n",
"4 5 5\n2 5 10\n1 5 12\n2 3 15\n1 2 20\n1 1 28\n2 4 26\n3 2 27\n4 5 25\n7 5 10\n1... | [
"29\n",
"27\n",
"25\n",
"73\n",
"53\n",
"5\n",
"142\n",
"24\n",
"21\n",
"22\n"
] |
CodeContests | You are enthusiastically participating in Virtual Boot Camp-14 and want to seriously learn programming. To be a good programmer you not only need to solve a problem, but also need to solve it as quickly as possible.
You are participating in this "Week02 Contest" and want to win it. You are sure that you will be able ... | stdin | null | 2,200 | 1 | [
"5 0 0 100000000\n\nSAMPLE\n"
] | [
"2000005760\n"
] | [
"5 0 -1 100000000\n",
"5 0 0 100000000\n\nSANPLE\n",
"5 0 -1 100000100\n",
"5 0 -1 100000101\n",
"9 0 0 100000000\n\nSAEPLN\n",
"5 0 -2 100000101\n",
"9 0 -1 100000000\n\nSAEPLN\n",
"5 0 -2 101000101\n",
"5 0 -2 101000001\n",
"9 -1 -1 100000000\n\nNLPEAS\n"
] | [
"2000005759\n",
"2000005760\n",
"2000007759\n",
"2000007779\n",
"2000011520\n",
"2000007778\n",
"2000011519\n",
"2020007778\n",
"2020005778\n",
"2000011459\n"
] |
CodeContests | Red bold fonts show the difference from C1.
There is an infinitely large triangular grid, as shown below. Each point with integer coordinates contains a lamp.
<image>
Initially, only the lamp at (X, Y) was on, and all other lamps were off. Then, Snuke performed the following operation zero or more times:
* Choose t... | stdin | null | 4,150 | 1 | [
"4\n-2 1\n-2 2\n0 1\n1 0\n"
] | [
"-1 0\n"
] | [
"4\n-2 1\n-2 0\n0 1\n1 0\n",
"4\n-2 1\n-2 0\n0 1\n2 0\n",
"4\n-2 1\n-2 0\n-1 1\n2 0\n",
"4\n-2 1\n-2 0\n-1 2\n2 0\n",
"4\n-2 1\n-2 1\n0 1\n1 0\n",
"4\n-2 1\n-2 0\n1 1\n2 0\n",
"4\n-2 1\n-2 -1\n0 1\n2 0\n",
"4\n-2 1\n-2 0\n-1 2\n1 1\n",
"4\n-2 2\n-2 0\n0 1\n1 -1\n",
"4\n-2 1\n-2 0\n-1 3\n2 0\n"
] | [
"-1 1\n",
"-1 3\n",
"0 2\n",
"1 1\n",
"0 0\n",
"-1 2\n",
"3 -1\n",
"2 0\n",
"2 -1\n",
"0 1\n"
] |
CodeContests | Once Algorithm guru gave a simple problem to his students.He gave a list of n integers say, A={a1,a2,a3...an} and another integer, x representing the expected sum.
He said students to select numbers from array list(0 or more numbers) such that the sum of these numbers is as close as possible but not exceeding to the su... | stdin | null | 1,114 | 1 | [
"2\n3 12\n1 6 9\n5 9\n3 4 4 4 8\n\nSAMPLE\n"
] | [
"12\n9\n"
] | [
"2\n3 12\n1 6 9\n5 9\n3 4 4 4 8\n\nEAMPLS\n",
"2\n3 22\n1 6 9\n5 9\n3 4 4 4 8\n\nEAMPLS\n",
"2\n5 22\n1 10 9\n5 3\n3 4 8 4 8\n\nEAMPLS\n",
"2\n5 22\n1 10 9\n5 6\n3 4 8 4 8\n\nEAMPLS\n",
"2\n5 22\n2 12 3\n17 11\n2 4 8 4 8\n\nE@MPLS\n",
"2\n5 22\n4 12 3\n17 11\n2 4 8 3 8\n\nE@MPLS\n",
"2\n5 22\n4 12 3\n17... | [
"12\n9\n",
"22\n9\n",
"22\n3\n",
"22\n6\n",
"22\n10\n",
"22\n11\n",
"22\n8\n",
"22\n16\n",
"12\n15\n",
"14\n9\n"
] |
CodeContests | You are given nonnegative integers a and b (a ≤ b), and a positive integer x. Among the integers between a and b, inclusive, how many are divisible by x?
Constraints
* 0 ≤ a ≤ b ≤ 10^{18}
* 1 ≤ x ≤ 10^{18}
Input
The input is given from Standard Input in the following format:
a b x
Output
Print the number of th... | stdin | null | 1,212 | 1 | [
"4 8 2\n",
"9 9 2\n",
"1 1000000000000000000 3\n",
"0 5 1\n"
] | [
"3\n",
"0\n",
"333333333333333333\n",
"6\n"
] | [
"16 9 2\n",
"1 1000010000000000000 3\n",
"0 5 2\n",
"16 9 1\n",
"1 1000010100000000000 3\n",
"15 9 1\n",
"0 1000010100000000000 3\n",
"-1 7 2\n",
"0 1000010100000100000 3\n",
"-2 7 2\n"
] | [
"-3\n",
"333336666666666666\n",
"3\n",
"-6\n",
"333336700000000000\n",
"-5\n",
"333336700000000001\n",
"4\n",
"333336700000033334\n",
"5\n"
] |
CodeContests | Let's solve the puzzle by programming.
The numbers n x n are arranged in a grid pattern. Some of the numbers are circled and we will call them the starting point. The rules of the puzzle are as follows:
* Draw one line that goes vertically and horizontally from each starting point (cannot be drawn diagonally).
* Exte... | stdin | null | 1,217 | 1 | [
"3\n-3 1 1\n2 -4 1\n2 1 -1\n3\n-4 1 1\n1 1 -6\n1 -5 3\n4\n-8 6 -2 1\n2 -7 -2 1\n1 -1 1 1\n1 1 1 -5\n6\n2 2 3 -7 3 2\n1 -10 1 1 3 2\n2 6 5 2 -6 1\n3 4 -23 2 2 5\n3 3 -6 2 3 7\n-7 2 3 2 -5 -13\n6\n2 2 3 -7 3 2\n1 -10 1 1 3 2\n2 6 5 2 -6 1\n3 4 -23 2 2 5\n3 3 -6 2 3 7\n-7 2 3 2 -5 -12\n0\n"
] | [
"YES\nNO\nNO\nYES\nNO\n"
] | [
"3\n-3 1 1\n2 -4 1\n2 1 -1\n3\n-4 1 1\n1 1 -6\n1 -5 3\n4\n-8 6 -2 1\n2 -7 -2 1\n1 -1 1 1\n1 1 1 -5\n6\n2 2 3 -7 3 2\n1 -10 1 1 3 2\n2 6 5 2 -6 0\n3 4 -23 2 2 5\n3 3 -6 2 3 7\n-7 2 3 2 -5 -13\n6\n2 2 3 -7 3 2\n1 -10 1 1 3 2\n2 6 5 2 -6 1\n3 4 -23 2 2 5\n3 3 -6 2 3 7\n-7 2 3 2 -5 -12\n0\n",
"3\n-3 1 1\n2 -2 1\n2 1 ... | [
"YES\nNO\nNO\nNO\nNO\n",
"NO\nNO\nNO\nNO\nNO\n",
"YES\nNO\nNO\nYES\nNO\n",
"YES\n",
"NO\nNO\nNO\n",
"NO\nNO\nNO\nYES\nNO\n",
"NO\n",
"YES\nNO\nNO\nNO\nNO\n",
"YES\nNO\nNO\nNO\nNO\n",
"YES\nNO\nNO\nNO\nNO\n"
] |
CodeContests | A certain grade of steel is graded according to the following conditions.
Hardness must be greater than 50.
Carbon content must be less than 0.7.
Tensile strength must be greater than 5600.
The grades are as follows:
Grade is 10 if all three conditions are met.
Grade is 9 if conditions (i) and (ii) are met.
Grade ... | stdin | null | 3,023 | 1 | [
"3 \n53 0.6 5602\n45 0 4500\n0 0 0\n"
] | [
"10\n6\n6\n"
] | [
"3 \n67 0.6 5602\n45 0 4500\n0 0 0\n",
"3 \n67 0.6 5602\n78 0 4500\n0 0 0\n",
"3 \n74 0.7029782275732623 13440\n78 -1 4466\n0 -1 0\n",
"3 \n127 1.5460478864469624 13440\n71 -1 8462\n1 -1 0\n",
"3 \n127 1.5460478864469624 13440\n16 -1 8462\n1 -1 0\n",
"3 \n000 4.094246707215373 13440\n16 0 15277\n1 -2 0\n"... | [
"10\n6\n6\n",
"10\n9\n6\n",
"7\n9\n6\n",
"7\n10\n6\n",
"7\n8\n6\n",
"6\n8\n6\n",
"6\n6\n6\n",
"7\n6\n6\n",
"6\n5\n6\n",
"7\n5\n6\n"
] |
CodeContests | Mr. Morishita was in trouble ... I had Mr. Anehara write a program, but the program crashed.
Mr. Anehara wrote a program that reads the formula in Reverse Polish Notation and outputs the calculation result. According to the crash log, it seems that the cause was that it was divided by 0. This may be because Mr. Morish... | stdin | null | 3,369 | 1 | [
"1\na 0 255\n7\n1 a 2 * 1 + /\n",
"1\na 1 10\n3\n10 a /\n",
"2\na 1 10\nb 1 10\n5\n1 a b - /\n"
] | [
"correct\n",
"correct\n",
"error\n"
] | [
"1\na 1 10\n3\n15 a /\n",
"2\na 1 10\nb 1 10\n5\n1 b b - /\n",
"2\nb 1 10\nb 1 10\n5\n1 b b - /\n",
"1\na 0 255\n7\n1 a 2 * 1 * /\n",
"1\na 1 11\n3\n10 a /\n",
"1\na 0 255\n7\n1 a 2 * 1 * 0\n",
"1\na 1 11\n3\n9 a /\n",
"1\na 0 206\n7\n1 a 2 * 1 * 0\n",
"1\na 0 212\n7\n1 a 2 * 1 * 0\n",
"1\na 0 255... | [
"correct\n",
"error\n",
"error\n",
"error\n",
"correct\n",
"correct\n",
"correct\n",
"correct\n",
"correct\n",
"correct\n"
] |
CodeContests | 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... | stdin | null | 409 | 1 | [
"5 2\n3 3\n5 5\n",
"5 1\n1 2\n",
"60 3\n5 8\n1 3\n10 15\n",
"5 2\n1 1\n3 4\n"
] | [
"0\n",
"5\n",
"221823067\n",
"4\n"
] | [
"5 2\n3 3\n5 9\n",
"60 3\n5 4\n1 3\n10 15\n",
"10 2\n1 1\n3 4\n",
"60 3\n5 4\n1 3\n10 20\n",
"50 3\n5 4\n1 3\n10 20\n",
"5 1\n1 2\n5 9\n",
"60 3\n5 8\n1 0\n10 15\n",
"3 2\n1 1\n3 4\n",
"60 3\n5 4\n1 6\n10 15\n",
"10 2\n1 2\n3 4\n"
] | [
"0\n",
"903929718\n",
"40\n",
"917017175\n",
"614976987\n",
"5\n",
"742066\n",
"1\n",
"980971792\n",
"208\n"
] |
CodeContests | B: Cram School Schedule / Cram School Timetable
story
You are the owner of a cram school. Your cram school is a private lesson system with one student and one teacher. The teachers at this cram school are very good and can teach all classes regardless of the subject. Also, because teachers and students are very tough... | stdin | null | 3,732 | 1 | [
"2 10:00-11:30 12:00-13:00\n2\n1 10:00-15:00\n2 09:00-12:00 18:10-18:55\n2\n2 10:00-13:00 15:30-16:40\n3 06:00-08:00 12:00-13:10 15:00-17:00\n"
] | [
"2\n"
] | [
"2 10:00-11:30 12:00-13:00\n2\n1 10:00-15:00\n2 09:00-12:00 18:10-18:55\n2\n2 10:00-13:00 15:30-16:40\n3 06:80-00:00 12:00-13:10 15:00-17:00\n",
"2 10:00-11:30 00:31-00:21\n2\n1 10:00-15:00\n2 09:00-12:00 18:10-18:55\n2\n2 10:00-13:00 15:30-16:40\n3 06:00-08:00 12:00-13:10 15:00-17:00\n",
"2 10:00-11:30 10:31-0... | [
"2\n",
"1\n",
"3\n",
"0\n",
"2\n",
"2\n",
"2\n",
"2\n",
"2\n",
"2\n"
] |
CodeContests | We have N integers. The i-th integer is A_i.
Find \sum_{i=1}^{N-1}\sum_{j=i+1}^{N} (A_i \mbox{ XOR } A_j), modulo (10^9+7).
What is \mbox{ XOR }?
The XOR of integers A and B, A \mbox{ XOR } B, is defined as follows:
* When A \mbox{ XOR } B is written in base two, the digit in the 2^k's place (k \geq 0) is 1 if eith... | stdin | null | 292 | 1 | [
"3\n1 2 3\n",
"10\n3 14 159 2653 58979 323846 2643383 27950288 419716939 9375105820\n",
"10\n3 1 4 1 5 9 2 6 5 3\n"
] | [
"6\n",
"103715602\n",
"237\n"
] | [
"3\n1 2 1\n",
"10\n1 14 159 2653 58979 323846 2643383 27950288 419716939 9375105820\n",
"10\n3 1 4 1 5 9 2 6 5 6\n",
"3\n1 4 1\n",
"10\n1 14 159 2653 58979 376446 2643383 27950288 419716939 9375105820\n",
"10\n3 1 4 1 5 9 2 6 5 2\n",
"10\n1 14 159 2653 58979 376446 2643383 33596518 419716939 9375105820\... | [
"6\n",
"103715608\n",
"244\n",
"10\n",
"104328928\n",
"240\n",
"144630974\n",
"243\n",
"144630991\n",
"190239349\n"
] |
CodeContests | Let's write a program related to an unsolved math problem called "Happy End Problem". Create a program to find the smallest convex polygon formed by connecting exactly k points from the N points given on the plane. However, after being given the coordinates of N points, the question is given the number k of the angles ... | stdin | null | 2,610 | 1 | [
"5\n0 0\n3 0\n5 2\n1 4\n0 3\n3\n3\n4\n5\n"
] | [
"1 4 5\n1 2 4 5\n1 2 3 4 5\n"
] | [
"5\n0 0\n3 -1\n5 2\n1 4\n0 3\n3\n3\n4\n5\n",
"5\n1 0\n3 -1\n5 2\n1 1\n0 3\n3\n3\n4\n5\n",
"5\n0 0\n2 0\n5 2\n1 4\n0 3\n3\n3\n4\n5\n",
"5\n1 0\n3 -1\n5 2\n1 1\n0 3\n3\n3\n4\n4\n",
"5\n0 0\n2 0\n5 1\n1 4\n0 3\n3\n3\n4\n5\n",
"5\n1 0\n3 0\n5 2\n1 1\n0 3\n3\n3\n4\n4\n",
"5\n1 0\n3 0\n5 2\n1 1\n0 3\n2\n3\n4\... | [
"1 4 5\n2 4 5 1\n2 3 4 5 1\n",
"1 4 5\n2 3 4 1\nNA\n",
"1 4 5\n1 2 4 5\n1 2 3 4 5\n",
"1 4 5\n2 3 4 1\n2 3 4 1\n",
"1 2 3\n1 2 4 5\n1 2 3 4 5\n",
"1 4 5\n1 2 3 4\n1 2 3 4\n",
"1 4 5\n1 2 3 4\n",
"1 5 4\n2 3 4 5\nNA\n",
"3 4 5\n2 4 5 1\n2 3 4 5 1\n",
"2 4 5\n2 4 5 1\nNA\n"
] |
CodeContests | G: Tree
problem
Given a tree consisting of N vertices. Each vertex of the tree is numbered from 1 to N. Of the N-1 edges, the i \ (= 1, 2, ..., N-1) edge connects the vertex u_i and the vertex v_i.
Write a program to find the number of K non-empty subgraph sets of this tree, each of which is concatenated and no two ... | stdin | null | 4,522 | 1 | [
"3 2\n1 2\n1 3\n"
] | [
"5\n"
] | [
"3 4\n1 2\n1 3\n",
"3 2\n1 2\n2 3\n",
"3 2\n2 2\n1 3\n",
"3 1\n1 2\n2 3\n",
"3 1\n1 2\n3 3\n",
"1 2\n1 2\n2 3\n",
"3 4\n1 2\n2 3\n",
"1 1\n1 2\n2 3\n",
"1 1\n2 2\n2 3\n",
"1 1\n2 3\n2 3\n"
] | [
"0\n",
"5\n",
"1\n",
"6\n",
"3\n",
"0\n",
"0\n",
"1\n",
"1\n",
"1\n"
] |
CodeContests | A mysterious device was discovered in an ancient ruin. The device consists of a disc with integers inscribed on both sides, a bundle of cards with an integer written on each of them and a pedestal within which the cards are placed. The disc rotates when the bundle of cards is put into the pedestal. Only one side of the... | stdin | null | 2,136 | 1 | [
"5 3 1\n1 -2 0\n2 3\n",
"5 7 5\n0 0 3 3 3 3 3\n1 2\n2 3\n3 4\n4 5\n5 6\n"
] | [
"-3\n",
"1\n2\n3\n4\n5\n"
] | [
"5 3 1\n1 -4 0\n2 3\n",
"5 3 1\n1 -4 1\n2 3\n",
"15 3 1\n1 0 1\n2 3\n",
"5 7 5\n0 0 3 3 3 3 3\n1 2\n2 3\n3 5\n4 5\n5 6\n",
"2 3 1\n1 -4 0\n2 3\n",
"10 3 1\n0 -4 1\n2 3\n",
"5 7 5\n0 0 3 3 3 3 3\n1 2\n1 3\n3 5\n4 5\n5 6\n",
"9 3 1\n1 -2 0\n2 3\n",
"10 3 1\n1 -7 1\n2 3\n",
"15 3 1\n2 0 1\n2 3\n"
] | [
"-1\n",
"3\n",
"-14\n",
"1\n2\n4\n3\n3\n",
"-2\n",
"-8\n",
"1\n1\n3\n2\n2\n",
"-7\n",
"6\n",
"-13\n"
] |
CodeContests | Let us define F(N,K) be number of subsets of K distinct elements of S where N is the size of S. Given a P( ≤ N), let Sum = F(N,0) + F(N,1) + ... + F(N,P).
You have to print Sum modulo 1000000007.
Input:
First line contains, T, the number of testcases. Each testcase consists of N and P in one line.
Output:
Pri... | stdin | null | 3,182 | 1 | [
"2\n2 2\n2 0\n\nSAMPLE\n"
] | [
"4\n1\n"
] | [
"1000\n1000 0\n1000 1\n1000 2\n1000 3\n1000 4\n1000 5\n1000 6\n1000 7\n1000 8\n1000 9\n1000 10\n1000 11\n1000 12\n1000 13\n1000 14\n1000 15\n1000 16\n1000 17\n1000 18\n1000 19\n1000 20\n1000 21\n1000 22\n1000 23\n1000 24\n1000 25\n1000 26\n1000 27\n1000 28\n1000 29\n1000 30\n1000 31\n1000 32\n1000 33\n1000 34\n1000... | [
"1\n1001\n500501\n166667501\n583791964\n874984414\n164398696\n261227447\n155096080\n234838822\n537344501\n762855422\n98713693\n623942646\n152583570\n368580526\n415893037\n566217185\n886696990\n608337320\n454795601\n289515430\n434547873\n427666493\n314203650\n844614294\n735013304\n262740578\n351263465\n111409862\n64... |
CodeContests | There are N cards placed on a grid with H rows and W columns of squares.
The i-th card has an integer A_i written on it, and it is placed on the square at the R_i-th row from the top and the C_i-th column from the left.
Multiple cards may be placed on the same square.
You will first pick up at most one card from eac... | stdin | null | 968 | 1 | [
"1 100000 100000\n1 1 1\n",
"13 5 6\n1 3 35902\n4 6 19698\n4 6 73389\n3 6 3031\n3 1 4771\n1 4 4784\n2 1 36357\n2 1 24830\n5 6 50219\n4 6 22645\n1 2 30739\n1 4 68417\n1 5 78537\n",
"6 2 2\n2 2 2\n1 1 8\n1 1 5\n1 2 9\n1 2 7\n2 1 4\n"
] | [
"1\n",
"430590\n",
"28\n"
] | [
"13 5 6\n1 3 35902\n4 6 19698\n4 6 73389\n3 6 3031\n3 1 4771\n1 4 4784\n2 1 36357\n2 1 24830\n5 6 50219\n4 6 22645\n0 2 30739\n1 4 68417\n1 5 78537\n",
"6 2 2\n2 2 2\n1 1 8\n1 1 5\n1 2 9\n1 2 2\n2 1 4\n",
"13 5 6\n1 3 35902\n4 6 19698\n4 6 73389\n3 6 3031\n3 1 4771\n1 4 4784\n2 1 36357\n2 1 24830\n5 6 50219\n4 ... | [
"430590\n",
"26\n",
"447028\n",
"30\n",
"22\n",
"480918\n",
"495832\n",
"495845\n",
"431410\n",
"445504\n"
] |
CodeContests | problem
A mysterious $ X $ [cm] plant grows in one place. This plant has the following mysterious properties.
* Say "nobiro" to this plant and it will grow $ A $ [cm].
* Say "tidime" to this plant and it will grow $ B $ [cm].
* If you say "karero" to this plant, it will be $ 0 $ [cm].
However, this plant does not ... | stdin | null | 2,148 | 1 | [
"10 30 10\n3\nnobiro\nnobiro\ntidime\n"
] | [
"80\n"
] | [
"10 30 10\n0\nnobiro\nnobiro\ntidime\n",
"18 30 10\n0\nnobiro\nnobiro\ntidime\n",
"15 30 9\n0\nnoairo\noribon\nmidite\n",
"23 30 9\n0\nnoairo\noribon\nmidite\n",
"44 30 5\n0\nnoairo\nnobiro\ntidime\n",
"59 30 5\n0\noriaon\nnobiro\ntieimd\n",
"83 48 5\n0\norioan\nnobiro\ndmifit\n",
"31 48 5\n0\norioan\... | [
"10\n",
"18\n",
"15\n",
"23\n",
"44\n",
"59\n",
"83\n",
"31\n",
"19\n",
"8\n"
] |
CodeContests | Broken crypto generator
JAG (Japanese Alumni Group) is a mysterious organization composed of many programmers, and in order to enter the building where the headquarters of this organization is located, it is necessary to solve the ciphertext generated by a certain machine every time. This ciphertext consists of the sy... | stdin | null | 5,029 | 1 | [
"A+A++A\nZ-Z--Z+-Z\n[ESREVER]\nJ---?---J\n++++++++A+++Z-----------A+++Z\n[[++-+--?[--++-?++-+++L]][-+-----+-O]]++++---+L\n.\n"
] | [
"ABC\nZYXZ\nREVERSE\nJAG\nICPC\nJAPAN\n"
] | [
"A+A++A\nZ-Z--Z+-Z\n[ESRVEER]\nJ---?---J\n++++++++A+++Z-----------A+++Z\n[[++-+--?[--++-?++-+++L]][-+-----+-O]]++++---+L\n.\n",
"A+A++A\nZ-ZZ--+-Z\n[ESRVEER]\nJ---?---J\n++++++++A+++Z-----------A+++Z\n[[++-+--?[--++-?++-+++L]][-+-----+-O]]++++---+L\n.\n",
"A+A++A\nZ-Z--Z+-Z\n[ESRVEER]\nJ---?---J\n+++-++++A+++Z-... | [
"ABC\nZYXZ\nREEVRSE\nJAG\nICPC\nJAPAN\n",
"ABC\nZYZX\nREEVRSE\nJAG\nICPC\nJAPAN\n",
"ABC\nZYXZ\nREEVRSE\nJAG\nGCRC\nJAPAN\n",
"ABC\nZYXZ\nREEVQSE\nJAG\nGCRC\nJAPAN\n",
"ABC\nZYXZ\nREVERSE\nJGA\nICPC\nJAPAN\n",
"ABC\nZZXY\nREVERSE\nJGA\nICPC\nJAPAN\n",
"ABD\nZYXZ\nREVERSE\nJAG\nICPC\nJAPAN\n",
"ACB\nZY... |
CodeContests | Two strings are said to be anagrams of each other if the letters of one string may be rearranged to make the other string. For example, the words 'elvis' and 'lives' are anagrams.
In this problem you’ll be given two strings. Your job is to find if the two strings are anagrams of each other or not. If they are not anag... | stdin | null | 203 | 1 | [
"5\nComputer programmer\nmature germ romp crop\nAwaaay\naway\ninternet\nweb\nabc221\nabcdede\nthe terminator\nI?m rotten hater\n\nSAMPLE\n"
] | [
"YES\naa\nNO LUCK\ndeed\nYES\n"
] | [
"2\nhello\nhelalo\na quick brown fox jumps over the lazy dog a quick brown fox jumps over the lazy eeddccbbaagod\na\n",
"2\nhello\nhelalo\na quick brown fox jumps over the lazy dof a quick brown fox jumps over the lazy eeddccbbaagod\na\n",
"2\nhello\nhfllao\na quick brown fxo jumps over the mazy dof a quick nwo... | [
"a\naabbccddeeefghijklmnoooopqrrstuuvwxyzazyxwvuutsrrqpoooonmlkjihgfeeeddccbbaa\n",
"a\nNO LUCK\n",
"NO LUCK\nNO LUCK\n",
"a\nNO LUCK\n",
"a\nNO LUCK\n",
"a\nNO LUCK\n",
"a\nNO LUCK\n",
"a\nNO LUCK\n",
"a\nNO LUCK\n",
"NO LUCK\nNO LUCK\n"
] |
CodeContests | We have a FULL binary tree i.e. each node except leaves has two children.
The magic sum between any two leaf nodes (both possibly same) is the number obtained after adding values of all the nodes (including starting and ending nodes) in a unique path from first leaf to the later one.
Your task is to find the maximu... | stdin | null | 3,424 | 1 | [
"1\n7\n2 4 5 8 -4 3 -6\n\nSAMPLE\n"
] | [
"22\n"
] | [
"1\n7\n2 3 5 8 -4 3 -6\n\nSAMPLE\n",
"1\n7\n2 3 8 8 -4 3 -6\n\nSANPLE\n",
"1\n7\n2 0 5 8 -4 3 -6\n\nSAMPLE\n",
"1\n7\n2 5 5 8 -4 3 -6\n\nSANPLE\n",
"1\n7\n2 3 6 8 -4 3 -6\n\nSANPLE\n",
"1\n7\n2 5 7 8 -1 3 -7\n\nSANPLE\n",
"1\n7\n2 1 5 8 -4 3 -6\n\nSAMPLE\n",
"1\n7\n2 3 11 8 -4 3 -6\n\nSANPLE\n",
"1\... | [
"21\n",
"24\n",
"18\n",
"23\n",
"22\n",
"25\n",
"19\n",
"27\n",
"26\n",
"16\n"
] |
CodeContests | There is a sequence of length 2N: A_1, A_2, ..., A_{2N}. Each A_i is either -1 or an integer between 1 and 2N (inclusive). Any integer other than -1 appears at most once in {A_i}.
For each i such that A_i = -1, Snuke replaces A_i with an integer between 1 and 2N (inclusive), so that {A_i} will be a permutation of 1, 2... | stdin | null | 3,117 | 1 | [
"3\n1 -1 -1 3 6 -1\n",
"4\n7 1 8 3 5 2 6 4\n",
"10\n7 -1 -1 -1 -1 -1 -1 6 14 12 13 -1 15 -1 -1 -1 -1 20 -1 -1\n",
"20\n-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 6 -1 -1 -1 -1 -1 7 -1 -1 -1 -1 -1 -1 -1 -1 -1 34 -1 -1 -1 -1 31 -1 -1 -1 -1 -1 -1 -1 -1\n"
] | [
"5\n",
"1\n",
"9540576\n",
"374984201\n"
] | [
"3\n1 -1 -1 3 5 -1\n",
"10\n7 -1 -1 -1 -1 -1 -1 6 14 12 13 -1 15 -1 -1 -1 -1 5 -1 -1\n",
"10\n1 -1 -1 -1 -1 -1 -1 6 14 12 13 -1 15 -1 -1 -1 -1 20 -1 -1\n",
"10\n7 -1 -1 -1 -1 -1 -1 6 20 12 13 -1 15 -1 -1 -1 -1 5 -1 -1\n",
"3\n1 -1 -1 5 6 -1\n",
"10\n7 -1 -1 -1 -1 -1 -1 6 14 12 13 -1 15 -1 -1 -1 -1 16 -1 -... | [
"5\n",
"2416248\n",
"5209920\n",
"2693160\n",
"6\n",
"7019568\n",
"7448736\n",
"10\n",
"4943568\n",
"5022240\n"
] |
CodeContests | Tom gives a number N to Roy and ask him to tell the total number of even divisors of the number N. Help Roy to answer the question of Tom.
INPUT:
First line contains the number of testcases T, followed by T lines each containing an integer N.
OUTPUT:
For each testcase, print the required answer in a singlr line.
... | stdin | null | 4,060 | 1 | [
"2\n9\n8\n\nSAMPLE\n"
] | [
"0\n3\n"
] | [
"100\n2\n4\n8\n16\n32\n64\n128\n256\n512\n1024\n2048\n4096\n8192\n16384\n32768\n65536\n131072\n262144\n524288\n1048576\n2097152\n4194304\n8388608\n16777216\n33554432\n67108864\n134217728\n268435456\n536870912\n397453457\n442566979\n265107982\n780169103\n183899109\n444753183\n990164631\n199710138\n533937305\n2631185... | [
"1\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\n0\n0\n8\n0\n0\n0\n0\n8\n0\n0\n0\n0\n60\n8\n0\n0\n0\n24\n0\n0\n0\n0\n0\n0\n12\n16\n0\n24\n4\n4\n0\n0\n0\n24\n0\n0\n0\n16\n12\n0\n0\n0\n24\n64\n0\n8\n8\n0\n0\n16\n0\n0\n4\n16\n0\n16\n2\n4\n24\n0\n2\n0\n0\n0\n18... |
CodeContests | The problem set at CODE FESTIVAL 20XX Finals consists of N problems.
The score allocated to the i-th (1≦i≦N) problem is i points.
Takahashi, a contestant, is trying to score exactly N points. For that, he is deciding which problems to solve.
As problems with higher scores are harder, he wants to minimize the highest... | stdin | null | 2,607 | 1 | [
"4\n",
"7\n",
"1\n"
] | [
"1\n3\n",
"1\n2\n4\n",
"1\n"
] | [
"14\n",
"2\n",
"3\n",
"8\n",
"12\n",
"21\n",
"5\n",
"9\n",
"17\n",
"31\n"
] | [
"2\n3\n4\n5\n",
"2\n",
"1\n2\n",
"1\n3\n4\n",
"1\n2\n4\n5\n",
"1\n2\n3\n4\n5\n6\n",
"2\n3\n",
"2\n3\n4\n",
"1\n2\n3\n5\n6\n",
"1\n2\n3\n4\n6\n7\n8\n"
] |
CodeContests | A Boolean expression is given. In the expression, each variable appears exactly once. Calculate the number of variable assignments that make the expression evaluate to true.
Input
A data set consists of only one line. The Boolean expression is given by a string which consists of digits, x, (, ), |, &, and ~. Other ... | stdin | null | 2,858 | 1 | [
"(x1&x2)\n",
"(x1&x2)|(x3&x4)|(~(x5|x6)&(x7&x8))\n"
] | [
"1\n",
"121\n"
] | [
"(x1&x3)|(x2&x4)|(~(x5|x6)&(x7&x8))\n",
"(x1&x3)\n",
"(x1|x2)&(x3&x4)|(~(x5|x6)&(x6&x8))\n",
"(x2&x35|(x2&x4)|(~(x)|x8)&(x6&x6))\n",
"(x1&x3)|(x2&x4)|(~(x)|x65&(x6&x8))\n",
"(x2&x3)|(x2&x4)|(~(x5|x86&(x)&x6))\n",
"(x1&x3)|(x2&x4)|(~(x5|x6)&(x6&x8))\n",
"(x1&x2)|(x3&x4)|(~(x4|x6)&(x7&x8))\n",
"(x2&x3... | [
"121\n",
"1\n",
"61\n",
"139\n",
"193\n",
"175\n",
"121\n",
"121\n",
"1\n",
"121\n"
] |
CodeContests | Little Monty is very fond of Fibonacci numbers and challenges his friend Lopa
that he can solve any question regarding the same. Lopa however is jealous
and after thinking for a long time came up with a problem.
She says given
N(the number of fibonacci numbers) one has to count all the multiples of all
the fibon... | stdin | null | 3,465 | 1 | [
"3\n1\n2\n3\n\nSAMPLE\n"
] | [
"1\n4\n7\n"
] | [
"3\n1\n2\n4\n\nSAMPLE\n",
"3\n1\n4\n4\n\nSAMPLE\n",
"3\n1\n4\n7\n\nSALPME\n",
"3\n1\n2\n5\n\nSAMPLE\n",
"3\n1\n1\n4\n\nSAMPLE\n",
"3\n1\n4\n1\n\nSALPME\n",
"3\n1\n4\n6\n\nSALPME\n",
"3\n1\n2\n9\n\nSAMPLE\n",
"3\n2\n1\n4\n\nSAMPLE\n",
"3\n2\n4\n1\n\nSALPME\n"
] | [
"1\n4\n10\n",
"1\n10\n10\n",
"1\n10\n20\n",
"1\n4\n13\n",
"1\n1\n10\n",
"1\n10\n1\n",
"1\n10\n17\n",
"1\n4\n28\n",
"4\n1\n10\n",
"4\n10\n1\n"
] |
CodeContests | E869120 defined a sequence $a$ like this:
* $a_1=a_2=1$, $a_{k+2}=a_{k+1}+a_k \ (k \ge 1)$
He also defined sequences $d_1, d_2, d_3, \dots , d_n$, as the following recurrence relation :
* $d_{1, j} = a_j$
* $d_{i, j} = \sum_{k = 1}^j d_{i - 1, k} \ (i \ge 2)$
You are given integers $n$ and $m$. Please calculate... | stdin | null | 2,808 | 1 | [
"4 7\n",
"12 20\n",
"16 30\n"
] | [
"176\n",
"174174144\n",
"102292850\n"
] | [
"6 7\n",
"12 2\n",
"16 38\n",
"1 7\n",
"12 1\n",
"16 25\n",
"2 7\n",
"12 0\n",
"16 29\n",
"2 9\n"
] | [
"709\n",
"12\n",
"764202521\n",
"13\n",
"1\n",
"378000346\n",
"33\n",
"0\n",
"396835115\n",
"88\n"
] |
CodeContests | In Poornima college, PIET CS Deparment is shifting from basement to the third floor. The HOD of the department is trying to finding the number ways to reach the third floor. You are given the number of stairs, and you have to help HOD to find out number of ways in which he can climb the stairs.
The HOD is capable of cl... | stdin | null | 3,143 | 1 | [
"3\n1\n2\n4\n\nSAMPLE\n"
] | [
"1\n2\n5\n"
] | [
"20\n1\n2\n3\n4\n1\n6\n7\n8\n9\n10\n11\n12\n13\n14\n15\n16\n17\n18\n19\n20\n",
"3\n1\n2\n4\n\nMASPLE\n",
"20\n1\n2\n3\n4\n1\n6\n7\n8\n9\n4\n11\n12\n13\n14\n15\n16\n17\n18\n19\n20\n",
"20\n1\n2\n3\n2\n1\n6\n7\n8\n9\n4\n11\n12\n13\n14\n15\n16\n17\n18\n19\n20\n",
"20\n1\n1\n3\n2\n1\n6\n7\n8\n9\n4\n11\n12\n13\n... | [
"1\n2\n3\n5\n1\n13\n21\n34\n55\n89\n144\n233\n377\n610\n987\n1597\n2584\n4181\n6765\n10946\n",
"1\n2\n5\n",
"1\n2\n3\n5\n1\n13\n21\n34\n55\n5\n144\n233\n377\n610\n987\n1597\n2584\n4181\n6765\n10946\n",
"1\n2\n3\n2\n1\n13\n21\n34\n55\n5\n144\n233\n377\n610\n987\n1597\n2584\n4181\n6765\n10946\n",
"1\n1\n3\n2\... |
CodeContests | Nikhil has written N binary integers (i.e. eithim zero or one) on a copy. He recently learned about XOR operation. Now He wants to erase exactly one integer in the array so that the XOR of the remaining N - 1 numbers is zero. Please help him to calculate the number of ways of doing so.
Input
The first line of the inp... | stdin | null | 1,559 | 1 | [
"2\n5\n1 0 0 0 0\n5\n1 1 1 1 1\n\nSAMPLE\n"
] | [
"1\n5\n"
] | [
"2\n5\n1 0 0 0 0\n5\n1 0 1 1 1\n\nSAMPLE\n",
"2\n5\n1 0 0 1 0\n5\n1 0 1 1 1\n\nSAMPLE\n",
"2\n5\n1 0 0 1 0\n5\n1 0 1 1 0\n\nSAMPLD\n",
"2\n2\n1 0 0 0 0\n5\n1 1 1 1 1\n\nSAMPLE\n",
"2\n5\n1 0 0 1 0\n5\n1 1 1 1 1\n\nSAMPLE\n",
"2\n5\n0 0 0 1 0\n5\n1 0 1 0 0\n\nSAMPLD\n",
"2\n5\n0 0 0 0 0\n5\n1 0 0 1 1\n\n... | [
"1\n1\n",
"3\n1\n",
"3\n3\n",
"1\n5\n",
"3\n5\n",
"1\n3\n",
"5\n3\n",
"5\n1\n",
"1\n1\n",
"1\n1\n"
] |
CodeContests | You can obtain profits from foreign exchange margin transactions. For example, if you buy 1000 dollar at a rate of 100 yen per dollar, and sell them at a rate of 108 yen per dollar, you can obtain (108 - 100) × 1000 = 8000 yen.
Write a program which reads values of a currency $R_t$ at a certain time $t$ ($t = 0, 1, 2,... | stdin | null | 1,869 | 1 | [
"3\n4\n3\n2\n",
"6\n5\n3\n1\n3\n4\n3\n"
] | [
"-1\n",
"3\n"
] | [
"3\n4\n1\n2\n",
"6\n5\n3\n0\n3\n4\n3\n",
"3\n4\n1\n3\n",
"6\n5\n3\n0\n2\n0\n3\n",
"3\n5\n0\n6\n",
"3\n5\n0\n10\n",
"6\n5\n2\n-1\n4\n1\n3\n",
"6\n5\n2\n-1\n7\n1\n3\n",
"3\n3\n0\n9\n",
"6\n5\n2\n-1\n14\n1\n3\n"
] | [
"1\n",
"4\n",
"2\n",
"3\n",
"6\n",
"10\n",
"5\n",
"8\n",
"9\n",
"15\n"
] |
CodeContests | Snuke lives in another world, where slimes are real creatures and kept by some people. Slimes come in N colors. Those colors are conveniently numbered 1 through N. Snuke currently has no slime. His objective is to have slimes of all the colors together.
Snuke can perform the following two actions:
* Select a color i ... | stdin | null | 338 | 1 | [
"4 10\n1 2 3 4\n",
"2 10\n1 100\n",
"3 10\n100 1 100\n"
] | [
"10\n",
"12\n",
"23\n"
] | [
"4 10\n1 1 3 4\n",
"2 10\n1 101\n",
"3 12\n100 1 100\n",
"3 12\n000 1 100\n",
"3 12\n010 1 100\n",
"3 12\n011 1 100\n",
"3 18\n011 1 100\n",
"3 18\n011 2 100\n",
"3 35\n011 2 100\n",
"3 35\n011 4 100\n"
] | [
"9\n",
"12\n",
"27\n",
"13\n",
"24\n",
"25\n",
"31\n",
"33\n",
"50\n",
"54\n"
] |
CodeContests | G: Dungeon of Cards
story
This is a wonderland hydrangea. It is said that gold and silver treasures sleep in the labyrinth of cards located in the remote area of Ajifurai. As soon as the curious Aizu Nyan heard this legend, he decided to take his friend Wi and go on a journey to the Labyrinth of Cards.
The next da... | stdin | null | 3,097 | 1 | [
"4\nD 1\nD 2\nA 3\nD 4\n4\nA 1 7\nD 4 5\nD 3 6\nB 3 3\n"
] | [
"6\n"
] | [
"4\nD 1\nD 2\nA 3\nD 4\n4\nA 1 7\nD 4 5\nD 3 6\nA 3 3\n",
"4\nD 1\nD 2\nA 2\nD 8\n4\nA 1 7\nD 4 5\nD 3 6\nA 3 3\n",
"4\nC 1\nD 2\nA 2\nD 8\n4\nA 1 7\nD 4 5\nD 3 6\nA 0 3\n",
"4\nC 1\nD 2\nA 2\nD 8\n1\nA 1 7\nD 4 5\nD 3 6\nA 0 3\n",
"4\nC 1\nD 2\nA 2\nD 8\n2\nA 1 7\nD 6 3\nD 3 11\nA 0 3\n",
"4\nC 1\nD 2\nA... | [
"6\n",
"8\n",
"12\n",
"-1\n",
"10\n",
"16\n",
"11\n",
"7\n",
"2\n",
"26\n"
] |
CodeContests | Write a program which reads a sequence of integers $A = \\{a_0, a_1, ..., a_{n-1}\\}$ and reverse specified elements by a list of the following operation:
* reverse($b, e$): reverse the order of $a_b, a_{b+1}, ..., a_{e-1}$
Constraints
* $1 \leq n \leq 1,000$
* $-1,000,000,000 \leq a_i \leq 1,000,000,000$
* $1 \leq ... | stdin | null | 3,139 | 1 | [
"8\n1 2 3 4 5 6 7 8\n2\n1 6\n3 8\n"
] | [
"1 6 5 8 7 2 3 4\n"
] | [
"8\n1 2 3 4 5 6 7 8\n2\n1 6\n1 8\n",
"8\n1 1 3 4 5 6 7 8\n2\n1 6\n1 8\n",
"8\n1 1 3 4 5 5 7 8\n2\n1 6\n1 8\n",
"8\n1 4 3 4 5 6 7 8\n2\n1 6\n3 8\n",
"8\n1 2 3 4 5 0 7 8\n2\n1 6\n1 8\n",
"8\n1 1 4 4 5 6 7 8\n2\n1 6\n1 8\n",
"8\n1 1 3 4 7 5 7 8\n2\n1 6\n1 8\n",
"8\n1 4 3 4 5 6 7 8\n2\n1 6\n3 7\n",
"8\n... | [
"1 8 7 2 3 4 5 6\n",
"1 8 7 1 3 4 5 6\n",
"1 8 7 1 3 4 5 5\n",
"1 6 5 8 7 4 3 4\n",
"1 8 7 2 3 4 5 0\n",
"1 8 7 1 4 4 5 6\n",
"1 8 7 1 3 4 7 5\n",
"1 6 5 7 4 3 4 8\n",
"1 8 7 1 3 4 5 0\n",
"1 8 7 1 4 4 5 2\n"
] |
CodeContests | There are N gems. The value of the i-th gem is V_i.
You will choose some of these gems, possibly all or none, and get them.
However, you need to pay a cost of C_i to get the i-th gem.
Let X be the sum of the values of the gems obtained, and Y be the sum of the costs paid.
Find the maximum possible value of X-Y.
Co... | stdin | null | 4,109 | 1 | [
"4\n13 21 6 19\n11 30 6 15\n",
"3\n10 2 5\n6 3 4\n",
"1\n1\n50\n"
] | [
"6\n",
"5\n",
"0\n"
] | [
"4\n13 21 6 19\n11 30 6 10\n",
"3\n10 2 5\n6 5 4\n",
"1\n1\n45\n",
"4\n13 21 6 19\n0 30 6 10\n",
"3\n10 2 5\n12 5 4\n",
"4\n13 21 11 19\n0 30 6 10\n",
"4\n13 21 11 19\n-1 30 6 10\n",
"3\n10 1 5\n12 5 1\n",
"4\n13 21 11 26\n-1 30 6 10\n",
"4\n13 21 11 26\n-1 30 11 10\n"
] | [
"11\n",
"5\n",
"0\n",
"22\n",
"1\n",
"27\n",
"28\n",
"4\n",
"35\n",
"30\n"
] |
CodeContests | Xsquare get bored playing with the arrays all the time. So,he decided to buy a new character set to play with. Xsquare's character set contains only lower case alphabets more specifically characters from 'a' to 'z' (both inclusive). Xsquare was playing with this new character set and formed some interesting continuous ... | stdin | null | 1,563 | 1 | [] | [] | [
"10\n2\n15\n6\n5\n12\n1\n6\n9\n17\n2\n",
"100\n72713\n11616\n48480\n17711\n50866\n26101\n28904\n49492\n7702\n63553\n51227\n85076\n47354\n60383\n31428\n41015\n53638\n55936\n71827\n73915\n43513\n84974\n6824\n49391\n92128\n36466\n95630\n27232\n7280\n39065\n15934\n75448\n72679\n83217\n54753\n73285\n67220\n2965\n77265... | [
"26\n827062704\n17576\n17576\n308915776\n26\n17576\n11881376\n503630115\n26\n",
"621393937\n453440078\n418377780\n834011106\n182258480\n227043906\n671311825\n330907874\n909483204\n188581374\n757781365\n845057570\n902539330\n146835219\n538481548\n573361540\n616531687\n401512121\n301760556\n767085298\n583553734\n45... |
CodeContests | We have a grid with N rows and M columns of squares. Each integer from 1 to NM is written in this grid once. The number written in the square at the i-th row from the top and the j-th column from the left is A_{ij}.
You need to rearrange these numbers as follows:
1. First, for each of the N rows, rearrange the number... | stdin | null | 531 | 1 | [
"3 2\n2 6\n4 3\n1 5\n",
"3 4\n1 4 7 10\n2 5 8 11\n3 6 9 12\n"
] | [
"2 6\n4 3\n5 1\n2 1\n4 3\n5 6\n",
"1 4 7 10\n5 8 11 2\n9 12 3 6\n1 4 3 2\n5 8 7 6\n9 12 11 10\n"
] | [
"3 2\n2 5\n4 3\n1 5\n",
"3 2\n2 6\n4 3\n2 5\n",
"3 2\n1 6\n4 3\n2 5\n",
"3 2\n1 6\n4 4\n2 5\n",
"3 4\n1 4 7 10\n2 6 8 11\n3 6 9 12\n",
"3 2\n2 5\n3 3\n1 5\n",
"3 2\n2 6\n4 3\n2 6\n",
"3 2\n1 6\n4 3\n2 6\n",
"3 2\n1 6\n4 3\n1 5\n",
"3 4\n1 4 8 10\n2 5 8 11\n3 6 9 12\n"
] | [
"5 2 \n3 4 \n1 5 \n1 2 \n3 4 \n5 5\n",
"6 2 \n3 4 \n2 5 \n2 2 \n3 4 \n6 5\n",
"6 1 \n3 4 \n2 5 \n2 1 \n3 4 \n6 5\n",
"6 1 \n4 4 \n2 5 \n2 1 \n4 4 \n6 5\n",
"10 4 7 1 \n8 11 2 6 \n3 6 12 9 \n3 4 2 1 \n8 6 7 6 \n10 11 12 9\n",
"5 2 \n3 3 \n1 5 \n1 2 \n3 3 \n5 5\n",
"6 2 \n3 4 \n2 6 \n2 2 \n3 4 \n6 6\n",
... |
CodeContests | Taro came to a square to look for treasure. There are many treasures buried in this square, but Taro has the latest machines, so he knows everything about where the treasures are buried. Since the square is very wide Taro decided to look for the treasure to decide the area, but the treasure is what treasure does not kn... | stdin | null | 5,028 | 1 | [
"5 5\n10 5\n-3 -8\n2 11\n6 0\n-1 3\n-3 1 3 13\n-1 -1 9 5\n-3 -8 10 11\n0 0 5 5\n-10 -9 15 10\n",
"3 1\n1 1\n2 4\n5 3\n0 0 5 5\n",
"4 2\n-1 1\n0 3\n4 0\n2 1\n-3 1 5 1\n4 0 4 0\n",
"2 3\n0 0\n0 0\n-1 -1 1 1\n0 0 2 2\n1 1 4 4\n"
] | [
"2\n2\n5\n0\n4\n",
"3\n",
"2\n1\n",
"2\n2\n0\n"
] | [
"5 5\n10 5\n-3 -8\n2 11\n6 0\n-1 3\n-3 1 3 13\n-1 -1 9 9\n-3 -8 10 11\n0 0 5 5\n-10 -9 15 10\n",
"3 1\n1 1\n2 4\n5 3\n-1 0 5 5\n",
"4 2\n-1 1\n0 1\n4 0\n2 1\n-3 1 5 1\n4 0 4 0\n",
"2 3\n0 0\n0 0\n-1 -1 1 1\n0 0 2 2\n1 2 4 4\n",
"4 2\n-1 1\n0 1\n4 0\n2 1\n-3 1 5 1\n4 0 4 -1\n",
"3 1\n1 1\n2 4\n5 4\n-1 0 0 ... | [
"2\n2\n5\n0\n4\n",
"3\n",
"3\n1\n",
"2\n2\n0\n",
"3\n0\n",
"0\n",
"2\n0\n",
"1\n",
"0\n0\n",
"2\n"
] |
CodeContests | Takahashi has N cards. The i-th of these cards has an integer A_i written on it.
Takahashi will choose an integer K, and then repeat the following operation some number of times:
* Choose exactly K cards such that the integers written on them are all different, and eat those cards. (The eaten cards disappear.)
For... | stdin | null | 3,351 | 1 | [
"5\n1 2 3 4 5\n",
"4\n1 3 3 3\n",
"3\n2 1 2\n"
] | [
"5\n2\n1\n1\n1\n",
"4\n1\n0\n0\n",
"3\n1\n0\n"
] | [
"4\n1 3 1 3\n",
"4\n1 3 3 2\n",
"3\n2 2 2\n",
"4\n2 3 2 2\n",
"5\n1 2 3 3 5\n",
"5\n2 2 3 3 5\n",
"4\n2 3 4 1\n",
"4\n2 2 2 2\n",
"5\n4 2 2 4 4\n",
"3\n2 2 1\n"
] | [
"4\n2\n0\n0\n",
"4\n2\n1\n0\n",
"3\n0\n0\n",
"4\n1\n0\n0\n",
"5\n2\n1\n1\n0\n",
"5\n2\n1\n0\n0\n",
"4\n2\n1\n1\n",
"4\n0\n0\n0\n",
"5\n2\n0\n0\n0\n",
"3\n1\n0\n"
] |
CodeContests | A grid of r × c is given.
Numbers from 1 to 8 are written on some squares on the grid.
<image>
It is necessary to connect the squares with numbers and the squares with other numbers with a line.
For the squares with numbers written on them, it is necessary to connect lines with other squares as many as the number wr... | stdin | null | 3,168 | 1 | [
"7 7\n2.3.1.1\n.......\n2......\n.......\n..3.3..\n.......\n2.2.4.3\n",
"3 3\n.1.\n1.1\n.1.\n",
"1 3\n1.1\n",
"3 3\n4.2\n...\n2..\n"
] | [
"10\n",
"0\n",
"1\n",
"1\n"
] | [
"7 7\n2.3.1/1\n.......\n2......\n.......\n..3.3..\n.......\n2.2.4.3\n",
"0 3\n.0.\n1.1\n-1.\n",
"3 3\n.1.\n1.1\n-1.\n",
"1 3\n1.9901574718685544\n",
"2 3\n4.2\n...\n2..\n",
"7 7\n2.3.1/1\n.......\n2......\n.......\n..3.3..\n...-...\n2.2.4.3\n",
"3 3\n.0.\n1.1\n-1.\n",
"1 3\n2.775309924887026\n",
"2 ... | [
"0\n",
"1\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n"
] |
CodeContests | Captain America needs to lead his soldiers in his war against the Red Skull. He organized his team in such a way that he can estimate his soldiers’ energy-levels and capacity at any moment, which would help him make crucial decisions as to whom to dispatch to which areas of the war.
He organized his army in the form o... | stdin | null | 3,027 | 1 | [
"5 8\n7 2 0 5 8\n1 2\n2 3\n2 4\n1 5\nQ 1\nQ 2\nU 2 4\nQ 1\nQ 2\nU 5 3\nQ 1\nQ 2\n\nSAMPLE\n"
] | [
"22\n7\n24\n9\n19\n9\n"
] | [
"5 8\n7 2 0 5 8\n1 2\n2 3\n2 4\n1 5\nQ 1\nQ 2\nU 2 4\nQ 1\nQ 2\nU 5 3\nQ 1\nQ 2\n\nELPMAS\n",
"5 5\n7 2 0 5 8\n1 2\n2 3\n2 4\n1 5\nQ 1\nQ 2\nU 2 4\nQ 1\nQ 2\nU 5 3\nQ 1\nQ 2\n\nELPMAS\n",
"5 5\n7 2 0 5 8\n1 2\n2 3\n2 4\n1 5\nQ 1\nQ 2\nU 2 5\nQ 1\nQ 2\nU 5 3\nQ 1\nQ 2\n\nELPMAS\n",
"5 8\n7 2 0 5 8\n1 2\n2 3\n2... | [
"22\n7\n24\n9\n19\n9\n",
"22\n7\n24\n9\n",
"22\n7\n25\n10\n",
"22\n7\n24\n9\n20\n9\n",
"22\n7\n20\n7\n",
"21\n6\n19\n6\n",
"27\n6\n25\n6\n",
"22\n7\n20\n5\n15\n5\n",
"22\n7\n",
"20\n5\n22\n7\n17\n7\n"
] |
CodeContests | Alice and Bob are going to drive from their home to a theater for a date. They are very challenging - they have no maps with them even though they don’t know the route at all (since they have just moved to their new home). Yes, they will be going just by their feeling.
The town they drive can be considered as an undir... | stdin | null | 191 | 1 | [
"5 1 5\n1 0 1 0 0\n0 2 1 0 0\n2 0 0 1 0\n1 0 0 1 0\n0 1 1 0 1\n0 0 0 1 0\n0 0 0\n"
] | [
"8.50000000\n"
] | [
"5 1 5\n0 0 1 0 0\n0 2 1 0 0\n2 0 0 1 0\n1 0 0 1 0\n0 1 1 0 1\n0 0 0 1 0\n0 0 0\n",
"5 1 5\n1 0 1 0 1\n0 2 1 0 0\n2 0 0 1 0\n1 0 0 1 0\n0 1 1 0 1\n0 0 0 1 0\n0 0 0\n",
"5 1 5\n1 0 1 0 1\n0 2 1 0 0\n2 0 0 1 0\n1 0 0 1 0\n0 2 1 0 1\n0 0 0 1 0\n0 0 0\n",
"5 1 5\n1 1 1 0 1\n0 2 1 0 0\n2 0 0 1 0\n1 0 0 1 0\n0 1 1 ... | [
"11.0000000000\n",
"8.5000000000\n",
"9.5000000000\n",
"8.0000000000\n",
"10.0000000000\n",
"3.0000000000\n",
"2.0000000000\n",
"9.0000000000\n",
"6.0000000000\n",
"13.0000000000\n"
] |
CodeContests | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller?
Constraints
* 1 \leq a \leq 9
* 1 \leq b \leq 9
* a and b are integers.
Input
Input is given from Stan... | stdin | null | 3,793 | 1 | [
"7 7\n",
"4 3\n"
] | [
"7777777\n",
"3333\n"
] | [
"7 2\n",
"4 6\n",
"7 4\n",
"7 8\n",
"5 7\n",
"1 3\n",
"5 2\n",
"6 6\n",
"6 7\n",
"4 5\n"
] | [
"2222222\n",
"444444\n",
"4444444\n",
"77777777\n",
"5555555\n",
"111\n",
"22222\n",
"666666\n",
"6666666\n",
"44444\n"
] |
CodeContests | Takahashi has A untasty cookies containing antidotes, B tasty cookies containing antidotes and C tasty cookies containing poison.
Eating a cookie containing poison results in a stomachache, and eating a cookie containing poison while having a stomachache results in a death. As he wants to live, he cannot eat one in su... | stdin | null | 1,445 | 1 | [
"3 1 4\n",
"8 8 1\n",
"5 2 9\n"
] | [
"5\n",
"9\n",
"10\n"
] | [
"0 1 4\n",
"14 8 1\n",
"9 2 9\n",
"0 0 4\n",
"14 8 2\n",
"3 2 9\n",
"11 15 2\n",
"11 15 4\n",
"3 0 12\n",
"0 2 0\n"
] | [
"3\n",
"9\n",
"11\n",
"1\n",
"10\n",
"8\n",
"17\n",
"19\n",
"4\n",
"2\n"
] |
CodeContests | In his childhood, Utkarsh had a Graph having N nodes and N-1 edges. It was always possible to go from any node to any other node via a path.
Now after so many years he has discovered the same Graph in the store room of his house. But many edges of the Graph are now destroyed. Formally now Utkarsh has only M edges of... | stdin | null | 1,280 | 1 | [
"4 3\n4 2\n2 1\n3 2\n\nSAMPLE\n"
] | [
"3\n"
] | [
"60763 1494\n52004 12938\n18442 7602\n43931 22561\n48729 11667\n38628 28838\n44614 9005\n38681 20584\n51510 5055\n37897 2682\n43654 9484\n30586 27863\n58148 26139\n38459 13617\n54141 6829\n57425 16687\n59078 1031\n30625 1543\n24716 4165\n14692 10813\n50670 17418\n50132 21555\n26626 7797\n33024 11923\n57318 18568\n3... | [
"1845979941\n",
"3\n",
"1845979941\n",
"1845979941\n",
"1845979941\n",
"1845979941\n",
"1845979941\n",
"1845979941\n",
"1845979941\n",
"1845979941\n"
] |
CodeContests | Problem
There is a grid of $ N \ times N $ cells. Initially all cells are white. Follow the steps below to increase the number of black squares.
Select one white cell from the cells that are even-numbered from the top and even-numbered from the left. The selected square turns black. Further, the adjacent white square... | stdin | null | 4,013 | 1 | [
"3\noxx\noxx\nooo\n",
"5\noxooo\noxooo\noxooo\nxxxxx\noxooo\n",
"9\noxoooooxo\noxxxxxxxx\noxoooooxo\nxxxxxxxxx\noxoxooooo\noxxxxxxxx\noxoxoxooo\noxoxxxxxx\noxoxoxooo\n"
] | [
"-1\n",
"1\n4\n2\n",
"4\n4\n2\n2\n8\n6\n4\n8\n6\n"
] | [
"3\noxx\nowx\nooo\n",
"9\noxoooooxo\noxxxxxxxx\noxoooooxo\nxxxxxxxxx\noxoxooooo\noxxxxxxxx\noxoxoxooo\noxoxxxxxx\noxoxoxpoo\n",
"3\nyyn\nwup\npnp\n",
"5\noxooo\noxooo\noxooo\nxxxxx\noxoop\n",
"3\noxy\nowx\nooo\n",
"3\nyxo\nowx\nooo\n",
"3\nyxo\novx\nooo\n",
"3\nyxo\novx\noop\n",
"3\nyxo\npvx\noop\n"... | [
"-1\n",
"4\n4\n2\n2\n8\n6\n4\n8\n6\n",
"0\n",
"1\n4\n2\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n",
"-1\n"
] |
CodeContests | Manu is a very bright student and had learned c++ Programming on her own.She has covered loops and if/else.She is a very inquisitive child and always love to discover new things.Same applies to programming she learns various syntax.One day while reading the documentation of a cstdlib library she came across a function ... | stdin | null | 406 | 1 | [
"2\n4 10\n7 6\n\nSAMPLE\n"
] | [
"0.496000000\n1.000000000\n"
] | [
"1000\n17 277\n35 390\n37 682\n12 133\n43 991\n37 381\n29 865\n32 1084\n23 352\n7 210\n16 245\n54 558\n57 1062\n5 451\n2 233\n17 445\n69 691\n38 823\n103 1071\n62 976\n28 955\n2 136\n51 670\n18 578\n40 984\n14 398\n11 447\n10 753\n51 573\n16 239\n37 632\n94 1070\n20 569\n43 745\n75 898\n17 456\n3 127\n55 1074\n16 2... | [
"0.394090224\n0.792521896\n0.630070327\n0.400221195\n0.603275578\n0.835803231\n0.377869648\n0.370016865\n0.520289781\n0.096110280\n0.393750863\n0.929394464\n0.783509377\n0.022001420\n0.004291845\n0.266161893\n0.970198031\n0.579986988\n0.993712417\n0.861865594\n0.329456299\n0.007352941\n0.858107259\n0.234647314\n0.5... |
CodeContests | At the school where the twins Ami and Mami attend, the summer vacation has already begun, and a huge amount of homework has been given this year as well. However, the two of them were still trying to go out without doing any homework today. It is obvious that you will see crying on the last day of summer vacation as it... | stdin | null | 3,612 | 1 | [
"4\n1 1\n3 1\n4 1\n2 1\n3\n5 3\n1 2\n1 2\n1\n1000 1000\n10\n5 62\n10 68\n15 72\n20 73\n25 75\n30 77\n35 79\n40 82\n45 100\n815 283\n6\n74 78\n53 55\n77 77\n12 13\n39 42\n1 1\n0\n"
] | [
"14\n15\n3000\n2013\n522\n"
] | [
"4\n1 1\n3 1\n4 1\n2 1\n3\n5 2\n1 2\n1 2\n1\n1000 1000\n10\n5 62\n10 68\n15 72\n20 73\n25 75\n30 77\n35 79\n40 82\n45 100\n815 283\n6\n74 78\n53 55\n77 77\n12 13\n39 42\n1 1\n0\n",
"4\n1 1\n3 1\n4 1\n2 1\n3\n5 2\n1 2\n1 2\n1\n1000 1001\n10\n5 62\n10 68\n15 72\n20 73\n25 75\n30 77\n35 79\n40 82\n45 100\n815 283\n6... | [
"14\n14\n3000\n2013\n522\n",
"14\n14\n3001\n2013\n522\n",
"14\n14\n3001\n1880\n522\n",
"16\n14\n3001\n1880\n522\n",
"15\n14\n3000\n2013\n522\n",
"17\n14\n3001\n1880\n522\n",
"15\n14\n3000\n2013\n581\n",
"15\n14\n3000\n2013\n465\n",
"15\n14\n3000\n2013\n480\n",
"15\n14\n3000\n2013\n484\n"
] |
CodeContests | ICP city has an express company whose trucks run from the crossing S to the crossing T. The president of the company is feeling upset because all the roads in the city are one-way, and are severely congested. So, he planned to improve the maximum flow (edge disjoint paths) from the crossing S to the crossing T by rever... | stdin | null | 4,087 | 1 | [
"2 1\n2 1\n2 1\n",
"2 1\n1 2\n2 1\n",
"3 3\n3 2\n1 2\n3 1\n1 3\n"
] | [
"1\n0\n",
"1\n1\n1\n",
"2\n2\n1\n3\n"
] | [
"4 1\n1 2\n2 1\n",
"4 1\n1 3\n2 1\n",
"4 1\n2 1\n2 1\n",
"4 1\n2 3\n2 1\n",
"2 0\n1 2\n2 1\n",
"4 0\n2 3\n2 1\n",
"2 0\n1 2\n3 1\n",
"4 0\n2 3\n2 0\n",
"4 0\n2 3\n1 0\n",
"3 1\n1 2\n2 1\n"
] | [
"1\n1\n1\n",
"0\n0\n",
"1\n0\n",
"0\n0\n",
"0\n0\n",
"0\n0\n",
"0\n0\n",
"0\n0\n",
"0\n0\n",
"1\n1\n1\n"
] |
CodeContests | Two experienced climbers are planning a first-ever attempt: they start at two points of the equal altitudes on a mountain range, move back and forth on a single route keeping their altitudes equal, and finally meet with each other at a point on the route. A wise man told them that if a route has no point lower than the... | stdin | null | 4,356 | 1 | [
"6\n0 0\n3 4\n9 12\n17 6\n21 9\n33 0\n5\n0 0\n10 0\n20 0\n30 0\n40 0\n10\n0 0\n1 2\n3 0\n6 3\n9 0\n11 2\n13 0\n15 2\n16 2\n18 0\n7\n0 0\n150 997\n300 1\n450 999\n600 2\n750 998\n900 0\n0\n"
] | [
"52.5\n40.0\n30.3356209304689\n10078.072814085803\n"
] | [
"6\n0 0\n3 4\n9 12\n17 6\n21 0\n33 0\n5\n0 0\n10 0\n20 0\n30 0\n40 0\n10\n0 0\n1 2\n3 0\n6 3\n9 0\n11 2\n13 0\n15 2\n16 2\n18 0\n7\n0 0\n150 997\n300 1\n450 999\n600 2\n750 998\n900 0\n0\n",
"6\n0 -1\n3 4\n9 12\n17 6\n21 9\n33 0\n5\n0 0\n10 0\n20 0\n30 0\n40 0\n10\n0 0\n1 2\n3 0\n6 3\n9 0\n11 2\n13 0\n15 2\n16 2\... | [
"44.211102550928\n40.000000000000\n30.335620930469\n10078.072814085803\n",
"53.330951894845\n40.000000000000\n30.335620930469\n10078.072814085803\n",
"44.211102550928\n40.000000000000\n31.095505013449\n10078.072814085803\n",
"53.951451246659\n40.000000000000\n30.335620930469\n10078.072814085803\n",
"44.2111... |
CodeContests | There are N positive integers written on a blackboard: A_1, ..., A_N.
Snuke can perform the following operation when all integers on the blackboard are even:
* Replace each integer X on the blackboard by X divided by 2.
Find the maximum possible number of operations that Snuke can perform.
Constraints
* 1 \leq N... | stdin | null | 770 | 1 | [
"6\n382253568 723152896 37802240 379425024 404894720 471526144\n",
"4\n5 6 8 10\n",
"3\n8 12 40\n"
] | [
"8\n",
"0\n",
"2\n"
] | [
"6\n382253568 723152896 37802240 379425024 590201381 471526144\n",
"3\n10 12 40\n",
"3\n16 36 16\n",
"4\n5 6 13 10\n",
"6\n382253568 723152896 32183854 379425024 590201381 471526144\n",
"4\n5 6 22 10\n",
"3\n10 12 27\n",
"6\n348324507 723152896 32183854 379425024 590201381 471526144\n",
"4\n5 6 24 1... | [
"0\n",
"1\n",
"2\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n",
"0\n"
] |
CodeContests | We say that a odd number N is similar to 2017 when both N and (N+1)/2 are prime.
You are given Q queries.
In the i-th query, given two odd numbers l_i and r_i, find the number of odd numbers x similar to 2017 such that l_i ≤ x ≤ r_i.
Constraints
* 1≤Q≤10^5
* 1≤l_i≤r_i≤10^5
* l_i and r_i are odd.
* All input values ... | stdin | null | 3,275 | 1 | [
"1\n3 7\n",
"4\n13 13\n7 11\n7 11\n2017 2017\n",
"6\n1 53\n13 91\n37 55\n19 51\n73 91\n13 49\n"
] | [
"2\n",
"1\n0\n0\n1\n",
"4\n4\n1\n1\n1\n2\n"
] | [
"1\n3 9\n",
"1\n5 9\n",
"1\n9 9\n",
"4\n13 13\n7 0\n7 11\n2017 2017\n",
"6\n1 53\n7 91\n37 55\n19 51\n73 91\n13 49\n",
"4\n11 13\n7 1\n7 13\n2017 2017\n",
"6\n1 53\n7 91\n37 55\n19 51\n73 169\n13 49\n",
"4\n11 13\n7 0\n7 13\n1181 2017\n",
"6\n1 53\n13 91\n37 55\n19 51\n11 91\n13 49\n",
"1\n3 13\n"... | [
"2\n",
"1\n",
"0\n",
"1\n-2\n0\n1\n",
"4\n4\n1\n1\n1\n2\n",
"1\n-2\n1\n1\n",
"4\n4\n1\n1\n2\n2\n",
"1\n-2\n1\n13\n",
"4\n4\n1\n1\n4\n2\n",
"3\n"
] |
CodeContests | Alice and Bob are playing One Card Poker.
One Card Poker is a two-player game using playing cards.
Each card in this game shows an integer between `1` and `13`, inclusive.
The strength of a card is determined by the number written on it, as follows:
Weak `2` < `3` < `4` < `5` < `6` < `7` < `8` < `9` < `10` < `11` < `... | stdin | null | 2,444 | 1 | [
"8 6\n",
"1 1\n",
"13 1\n"
] | [
"Alice\n",
"Draw\n",
"Bob\n"
] | [
"8 7\n",
"2 1\n",
"0 0\n",
"8 3\n",
"3 1\n",
"7 3\n",
"4 1\n",
"7 1\n",
"7 2\n",
"5 6\n"
] | [
"Alice\n",
"Bob\n",
"Draw\n",
"Alice\n",
"Bob\n",
"Alice\n",
"Bob\n",
"Bob\n",
"Alice\n",
"Bob\n"
] |
CodeContests | Taro and Hanako have numbers of cards in their hands. Each of the cards has a score on it. Taro and Hanako wish to make the total scores of their cards equal by exchanging one card in one's hand with one card in the other's hand. Which of the cards should be exchanged with which?
Note that they have to exchange their ... | stdin | null | 980 | 1 | [
"2 2\n1\n5\n3\n7\n6 5\n3\n9\n5\n2\n3\n3\n12\n2\n7\n3\n5\n4 5\n10\n0\n3\n8\n1\n9\n6\n0\n6\n7 4\n1\n1\n2\n1\n2\n1\n4\n2\n3\n4\n3\n2 3\n1\n1\n2\n2\n2\n0 0\n"
] | [
"1 3\n3 5\n-1\n2 2\n-1\n"
] | [
"2 2\n1\n5\n4\n7\n6 5\n3\n9\n5\n2\n3\n3\n12\n2\n7\n3\n5\n4 5\n10\n0\n3\n8\n1\n9\n6\n0\n6\n7 4\n1\n1\n2\n1\n2\n1\n4\n2\n3\n4\n3\n2 3\n1\n1\n2\n2\n2\n0 0\n",
"2 2\n1\n5\n4\n7\n6 5\n3\n9\n5\n2\n3\n3\n12\n2\n7\n3\n5\n4 5\n10\n0\n3\n8\n1\n9\n6\n0\n6\n7 4\n1\n1\n2\n1\n2\n1\n4\n2\n3\n4\n6\n2 3\n1\n1\n2\n2\n2\n0 0\n",
... | [
"-1\n3 5\n-1\n2 2\n-1\n",
"-1\n3 5\n-1\n-1\n-1\n",
"-1\n2 3\n-1\n-1\n-1\n",
"-1\n2 3\n0 1\n-1\n-1\n",
"-1\n-1\n0 1\n-1\n-1\n",
"-1\n-1\n-1\n-1\n-1\n",
"1 3\n-1\n0 1\n-1\n-1\n",
"1 3\n-1\n0 1\n1 2\n-1\n",
"1 7\n-1\n0 1\n-1\n-1\n",
"1 3\n-1\n0 1\n1 2\n1 4\n"
] |
CodeContests | Given a string S which contains only lowercase characters ['a'-'z'] and an integer K you have to find number of substrings having weight equal to K.
Weight of characters is defined as :
Weight['a']=1
Weight['b']=2
Weight['c']=3
Weight['d']=4
Weight['e']=5
Weight['f']=6
Weight['g']=7
Weight['h']=8
Weight['i']=9
W... | stdin | null | 1,720 | 1 | [
"2\n5\nabcdef\n4\nabcdefSAMPLE\n"
] | [
"2\n1\n"
] | [
"2\n6\nabcdef\n4\nabcdefSAMPLE\n",
"2\n10\nabcdef\n4\nabcdefLAMPSE\n",
"2\n10\nabbdef\n4\nabcdefKAMPSE\n",
"2\n6\nabcdef\n3\nabcdefSAMPLE\n",
"2\n6\nabcdeg\n3\nabcdefSAMPLE\n",
"2\n1\nabcdef\n8\nabcdefLAMPSE\n",
"2\n8\nabcdeg\n3\nabcdefSAMPLE\n",
"2\n3\nabcdeg\n9\naLcdffSAMPbE\n",
"2\n7\needaab\n30\... | [
"2\n1\n",
"1\n1\n",
"0\n1\n",
"2\n2\n",
"1\n2\n",
"1\n0\n",
"0\n2\n",
"2\n0\n",
"0\n0\n",
"3\n1\n"
] |
CodeContests | Darth Vader, the lord of the dark side has created a Death-Star (it can destroy any star). You have to deactivate the Death-star. To deactivate the death-star one must find the unique most powerful Lightsaber. Lightsaber’s power is associated with a number. You ask for Lightsaber from your friendly Jedis(person). You... | stdin | null | 4,023 | 1 | [
"5\n9 8 8 9 5\n\nSAMPLE\n"
] | [
"5\n"
] | [
"5\n9 8 8 9 5\n\nELPMAS\n",
"5\n9 8 5 9 5\n\nTAEPLM\n",
"5\n9 8 5 9 10\n\nMLPEAT\n",
"5\n10 8 5 9 10\n\nMLPEAT\n",
"5\n17 8 5 9 10\n\nMLPETA\n",
"5\n17 18 10 11 1\n\nMLPETA\n",
"5\n17 17 4 11 1\n\nMPLETA\n",
"5\n4 27 4 11 0\n\nNOKETA\n",
"5\n4 36 4 11 0\n\nNOKETA\n",
"5\n4 48 4 16 0\n\nNOLETA\n"
] | [
"5\n",
"8\n",
"10\n",
"9\n",
"17\n",
"18\n",
"11\n",
"27\n",
"36\n",
"48\n"
] |
CodeContests | In this problem, we consider a simple programming language that has only declarations of one- dimensional integer arrays and assignment statements. The problem is to find a bug in the given program.
The syntax of this language is given in BNF as follows:
<image>
where <new line> denotes a new line character (LF).
C... | stdin | null | 2,491 | 1 | [
"a[3]\na[0]=a[1]\n.\nx[1]\nx[0]=x[0]\n.\na[0]\na[0]=1\n.\nb[2]\nb[0]=2\nb[1]=b[b[0]]\nb[0]=b[1]\n.\ng[2]\nG[10]\ng[0]=0\ng[1]=G[0]\n.\na[2147483647]\na[0]=1\nB[2]\nB[a[0]]=2\na[B[a[0]]]=3\na[2147483646]=a[2]\n.\n.\n"
] | [
"2\n2\n2\n3\n4\n0\n"
] | [
"a[3]\na[0]=a[1]\n.\nx[1]\nx[0]=x[0]\n.\na[0]\na[0]=1\n.\nb[2]\nb[0]=2\nb[1]=b[b[0]]\nb[0]=b[1]\n.\ng[2]\nG[10]\ng[0]=0\ng[1]=G[0]\n.\na[2147483647]\na[0]=1\nB[2]\nB[a[0]]=2\na[B[a[0]]]=3\na[2147483646]=b[2]\n.\n.\n",
"a[3]\na[0]=a[1]\n.\nx[1]\nx[0]=x[0]\n.\na[0]\na[0]=1\n.\nb[2]\nb[0]=2\nb[1]=b[b[0]]\nb[0]=b[1]\... | [
"2\n2\n2\n3\n4\n6\n",
"2\n2\n2\n3\n4\n2\n",
"2\n2\n2\n3\n4\n0\n",
"2\n2\n2\n3\n3\n2\n",
"2\n2\n2\n3\n4\n5\n",
"2\n2\n2\n3\n4\n4\n",
"2\n2\n2\n2\n4\n6\n",
"2\n2\n2\n3\n3\n0\n",
"2\n2\n2\n3\n3\n4\n",
"2\n2\n2\n3\n3\n6\n"
] |
CodeContests | You have N cards. On the i-th card, an integer A_i is written.
For each j = 1, 2, ..., M in this order, you will perform the following operation once:
Operation: Choose at most B_j cards (possibly zero). Replace the integer written on each chosen card with C_j.
Find the maximum possible sum of the integers written o... | stdin | null | 4,304 | 1 | [
"10 3\n1 8 5 7 100 4 52 33 13 5\n3 10\n4 30\n1 4\n",
"3 2\n5 1 4\n2 3\n1 5\n",
"3 2\n100 100 100\n3 99\n3 99\n",
"11 3\n1 1 1 1 1 1 1 1 1 1 1\n3 1000000000\n4 1000000000\n3 1000000000\n"
] | [
"338\n",
"14\n",
"300\n",
"10000000001\n"
] | [
"10 3\n1 8 5 7 100 4 7 33 13 5\n3 10\n4 30\n1 4\n",
"3 2\n5 1 1\n2 3\n1 5\n",
"3 2\n100 100 100\n0 99\n3 99\n",
"11 3\n1 1 1 1 1 1 1 1 1 1 1\n3 1000000000\n4 1000000000\n3 1000000001\n",
"10 2\n0 8 5 7 100 4 7 33 24 5\n3 10\n4 30\n1 4\n",
"3 2\n5 1 1\n2 3\n1 7\n",
"10 2\n0 8 5 7 100 4 7 33 24 5\n3 15\n4... | [
"296\n",
"13\n",
"300\n",
"10000000004\n",
"307\n",
"15\n",
"322\n",
"14\n",
"17\n",
"331\n"
] |
CodeContests | Description
KULASIS is the name of a system developed and operated by the Higher Education Research and Development Promotion Organization for the purpose of providing information on common subjects throughout the university on the Web, supporting students and faculty members, and improving services. KULASIS started w... | stdin | null | 706 | 1 | [
"5\n\n1 1 0 3 3\n1 1 0 3 3\n0 0 0 0 0\n2 2 0 4 4\n2 2 0 4 4\n\n1 1 1 0 0\n1 1 1 1 0\n1 0 1 1 0\n0 0 1 1 1\n1 1 1 1 1\n\n0 0 0 0 0\n0 0 0 0 0\n0 0 0 0 0\n0 0 0 0 0\n0 0 0 0 0\n\n4 3 4 3 4\n3 4 3 4 3\n4 3 4 3 4\n3 4 3 4 3\n4 3 4 3 4\n\n2 2 2 2 2\n0 0 0 2 0\n2 2 0 2 0\n2 2 0 2 0\n0 0 0 2 0\n"
] | [
"1280\n1420\n0\n1920\n1020\n"
] | [
"5\n\n1 1 0 3 3\n1 1 0 3 3\n0 0 0 0 0\n2 2 0 4 4\n2 2 0 4 4\n\n1 1 1 0 0\n1 1 1 1 0\n1 0 0 1 0\n0 0 1 1 1\n1 1 1 1 1\n\n0 0 0 0 0\n0 0 0 0 0\n0 0 0 0 0\n0 0 0 0 0\n0 0 0 0 0\n\n4 3 4 3 4\n3 4 3 4 3\n4 3 4 3 4\n3 4 3 4 3\n4 3 4 3 4\n\n2 2 2 2 2\n0 0 0 2 0\n2 2 0 2 0\n2 2 0 2 0\n0 0 0 2 0\n",
"5\n\n1 1 0 3 3\n1 1 0... | [
"1280\n1350\n0\n1920\n1020\n",
"1280\n1350\n80\n1920\n1020\n",
"1280\n1270\n80\n1920\n1020\n",
"1280\n1270\n80\n1940\n1020\n",
"1280\n1270\n80\n1960\n1020\n",
"1350\n1420\n0\n1920\n1020\n",
"1280\n1340\n80\n1940\n1020\n",
"1350\n1420\n0\n1930\n1020\n",
"1280\n1340\n80\n1940\n1010\n",
"1280\n1420\n... |
CodeContests | Aniruddha and Andrew are playing a Game on Christmas Eve named "Christmas-Gamecon". In this they are given a list of numbers.
In each turn alternatively one will select any one number from the list and decrease it by 1,2,3 or 4.
The last person who is unable to decrease the number loses the game.
At last all the number... | stdin | null | 3,381 | 1 | [
"2\n2\n1 1\n2\n1 2\n\nSAMPLE\n"
] | [
"Andrew\nAniruddha\n"
] | [
"2\n2\n1 1\n2\n1 2\n\nSAMOLE\n",
"2\n2\n1 2\n2\n1 2\n\nSAMOLE\n",
"2\n2\n1 2\n2\n1 1\n\nSAMOLE\n",
"2\n2\n0 0\n2\n0 0\n\nSAPEKM\n",
"2\n2\n2 2\n2\n1 2\n\nSAMOLE\n",
"2\n2\n0 2\n2\n1 2\n\nSAMOLE\n",
"2\n2\n4 2\n2\n1 2\n\nSAMOLE\n",
"2\n2\n0 2\n2\n1 1\n\nSAMOLE\n",
"2\n2\n1 2\n1\n1 2\n\nSAMOLE\n",
"... | [
"Andrew\nAniruddha\n",
"Aniruddha\nAniruddha\n",
"Aniruddha\nAndrew\n",
"Andrew\nAndrew\n",
"Andrew\nAniruddha\n",
"Aniruddha\nAniruddha\n",
"Aniruddha\nAniruddha\n",
"Aniruddha\nAndrew\n",
"Aniruddha\nAniruddha\n",
"Aniruddha\nAniruddha\n"
] |
CodeContests | An intergallactic war is on. Aliens are throwing fire-balls at our planet and this fire is so deadly that whichever nation it hits, it will wipe out not only that nation, but also spreads to any other nation which lies adjacent to it.
Given an NxM map which has N x M cells. Each cell may have a country or else it may... | stdin | null | 3,988 | 1 | [
"3 3 3\n0 0 0\n1 0 1\n0 1 1\n1 2\n2 2\n3 3\n\nSAMPLE\n"
] | [
"4\n4\n1\n"
] | [
"3 3 3\n0 0 0\n1 0 1\n0 1 1\n1 1\n2 2\n3 3\n\nSAMPLE\n",
"3 3 3\n0 0 0\n1 0 1\n1 1 1\n1 2\n2 2\n3 3\n\nSAMPLE\n",
"3 3 3\n0 0 1\n1 0 1\n1 1 1\n1 2\n2 2\n3 3\n\nSAMPLE\n",
"3 3 3\n0 0 0\n1 0 1\n0 1 1\n1 0\n2 2\n3 1\n\nSAMPLE\n",
"3 3 3\n0 0 0\n1 0 1\n0 1 1\n1 0\n2 2\n2 1\n\nSAMPLE\n",
"3 3 3\n1 0 0\n1 0 1\... | [
"4\n4\n1\n",
"5\n5\n0\n",
"6\n6\n0\n",
"4\n4\n4\n",
"4\n4\n3\n",
"5\n5\n3\n",
"3\n3\n0\n",
"5\n0\n0\n",
"5\n5\n5\n",
"2\n2\n0\n"
] |
CodeContests | You are a magician and have a large farm to grow magical fruits.
One day, you saw a horde of monsters, approaching your farm. They would ruin your magical farm once they reached your farm. Unfortunately, you are not strong enough to fight against those monsters. To protect your farm against them, you decided to build ... | stdin | null | 2,496 | 1 | [
"4\n0 0\n0 3\n1 1\n3 0\n",
"5\n2 0\n0 1\n1 3\n4 2\n3 4\n"
] | [
"3.0\n",
"7.5\n"
] | [
"4\n0 1\n0 3\n1 1\n3 0\n",
"5\n2 -1\n0 1\n1 3\n4 2\n3 4\n",
"4\n0 2\n0 3\n1 1\n3 0\n",
"5\n3 -1\n0 1\n1 3\n4 2\n3 4\n",
"4\n0 2\n0 3\n1 1\n2 0\n",
"5\n6 -1\n0 1\n1 3\n4 0\n3 4\n",
"5\n6 -1\n0 0\n1 3\n4 0\n3 4\n",
"5\n6 -1\n0 0\n1 3\n6 1\n3 4\n",
"5\n6 -1\n0 0\n1 3\n6 2\n3 4\n",
"5\n6 -1\n0 0\n1 3\... | [
"2.5\n",
"9.5\n",
"2.0\n",
"10.0\n",
"1.0\n",
"13.5\n",
"16.0\n",
"16.5\n",
"18.0\n",
"21.0\n"
] |
CodeContests | Problem F: Farey Sequence
slip likes to look at the numbers. Just looking at the remaining time while downloading the file is enough to kill the time. Such a slip was taught an interesting sequence by a friend. The definition of the sequence is as follows.
The general term is expressed as Fn. Fn is an arrangement of ... | stdin | null | 1,339 | 1 | [
"2\n3\n5\n"
] | [
"5\n11\n"
] | [
"2\n5\n5\n",
"2\n5\n2\n",
"2\n2\n5\n",
"2\n4\n5\n",
"2\n2\n2\n",
"2\n2\n7\n",
"2\n1\n5\n",
"2\n1\n2\n",
"2\n3\n7\n",
"2\n7\n5\n"
] | [
"11\n11\n",
"11\n3\n",
"3\n11\n",
"7\n11\n",
"3\n3\n",
"3\n19\n",
"2\n11\n",
"2\n3\n",
"5\n19\n",
"19\n11\n"
] |
CodeContests | Problem statement
There is a positive integer sequence $ X_1, X_2, ..., X_N $. Select the subsequence $ S $ from the sequence $ \\ {1,2, ..., N \\} $. However, $ S $ must meet the following conditions.
* $ T = \\ {X_s | s \ in S \\} $. At this time, for any $ x \ in T $, divisors of $ x $ (excluding $ x $) are not in... | stdin | null | 3,211 | 1 | [
"3\n6 3 2\n",
"10\n10 9 8 7 6 5 4 3 2 1\n",
"3\n25 125 5\n"
] | [
"2 3\n",
"1 2 3 4 5\n",
"1\n"
] | [
"3\n6 4 2\n",
"10\n10 9 8 7 6 5 4 1 2 1\n",
"3\n59 17 2\n",
"3\n6 3 1\n",
"3\n25 125 9\n",
"10\n13 9 8 7 6 5 4 1 2 1\n",
"10\n13 9 8 12 6 5 4 1 2 1\n",
"10\n16 9 8 12 6 5 4 1 2 2\n",
"10\n16 9 8 13 6 5 4 1 2 2\n",
"3\n1 17 3\n"
] | [
"1 2\n",
"1 2 3 4 5\n",
"1 2 3\n",
"1\n",
"1 3\n",
"1 2 3 4 5 6\n",
"1 2 3 4 6\n",
"1 2 4 6\n",
"1 2 4 5 6\n",
"2 3\n"
] |
CodeContests | An SNS has N users - User 1, User 2, \cdots, User N.
Between these N users, there are some relationships - M friendships and K blockships.
For each i = 1, 2, \cdots, M, there is a bidirectional friendship between User A_i and User B_i.
For each i = 1, 2, \cdots, K, there is a bidirectional blockship between User C_i... | stdin | null | 1,321 | 1 | [
"4 4 1\n2 1\n1 3\n3 2\n3 4\n4 1\n",
"5 10 0\n1 2\n1 3\n1 4\n1 5\n3 2\n2 4\n2 5\n4 3\n5 3\n4 5\n",
"10 9 3\n10 1\n6 7\n8 2\n2 5\n8 4\n7 3\n10 9\n6 4\n5 8\n2 6\n7 5\n3 1\n"
] | [
"0 1 0 1\n",
"0 0 0 0 0\n",
"1 3 5 4 3 3 3 3 1 0\n"
] | [
"5 10 0\n1 2\n1 3\n1 4\n1 5\n3 2\n2 4\n2 5\n4 3\n1 3\n4 5\n",
"5 10 0\n1 2\n1 3\n2 4\n1 5\n3 2\n2 4\n2 5\n4 3\n1 3\n4 5\n",
"5 10 0\n1 2\n1 3\n2 4\n1 5\n3 2\n2 4\n2 5\n4 1\n1 3\n4 5\n",
"5 10 0\n1 2\n1 3\n2 5\n1 5\n3 2\n2 4\n2 5\n4 1\n1 3\n4 5\n",
"5 10 0\n1 2\n1 3\n2 5\n1 5\n3 2\n2 4\n2 3\n4 1\n1 3\n4 5\n"... | [
"-1 0 0 0 1\n",
"0 -1 0 0 1\n",
"-1 -1 1 0 1\n",
"-1 -1 1 1 0\n",
"-1 -1 0 1 1\n",
"0 0 -1 0 1\n",
"1 1 0 2 2 0 0 1 1 0\n",
"-1 -2 2 0 1\n",
"0 0 3 2 1\n",
"6 4 0 5 5 4 0 4 6 4\n"
] |
CodeContests | I decided to create a program that displays a "round and round pattern". The "round and round pattern" is as follows.
* If the length of one side is n, it is displayed as a character string with n rows and n columns.
* A spiral pattern that rotates clockwise with the lower left corner as the base point.
* The part wit... | stdin | null | 737 | 1 | [
"2\n5\n6\n"
] | [
"#####\n# #\n# # #\n# # #\n# ###\n\n######\n# #\n# ## #\n# # #\n# # #\n# ####\n"
] | [
"2\n5\n5\n",
"2\n8\n5\n",
"2\n12\n5\n",
"2\n12\n3\n",
"2\n5\n9\n",
"2\n5\n7\n",
"2\n8\n9\n",
"2\n16\n3\n",
"2\n9\n9\n",
"2\n10\n7\n"
] | [
"#####\n# #\n# # #\n# # #\n# ###\n\n#####\n# #\n# # #\n# # #\n# ###\n",
"########\n# #\n# #### #\n# # # #\n# # # #\n# # ## #\n# # #\n# ######\n\n#####\n# #\n# # #\n# # #\n# ###\n",
"############\n# #\n# ######## #\n# # # #\n# # #### # #\n# # # # # #\n# # # # # #\n# # # ## # #\n# ... |
CodeContests | Maga and Alex are good at string manipulation problems. Just now they have faced a problem related to string. But it is not a standard string problem. They have no idea to solve it. They need your help.
A string is called unique if all characters of string are distinct.
String s_1 is called subsequence of string s_2 ... | stdin | null | 171 | 1 | [
"5\nabvzx\n\nSAMPLE\n"
] | [
"zx\n"
] | [
"5\nabvzx\n\nSAMOLE\n",
"5\nxbvza\n\nSAMOLE\n",
"5\nxbvya\n\nSAMOLE\n",
"5\nabvxz\n\nSAMOLE\n",
"5\nayvbx\n\nSAMOLE\n",
"5\nzavbw\n\nSAMOLE\n",
"5\nazwaw\n\nSOMALF\n",
"5\nbywaw\n\nSOMALF\n",
"5\nwawyb\n\nSOMALG\n",
"5\nxywab\n\nDTALON\n"
] | [
"zx\n",
"za\n",
"ya\n",
"z\n",
"yx\n",
"zw\n",
"zwa\n",
"ywa\n",
"yb\n",
"ywb\n"
] |
CodeContests | J: Horizontal-Vertical Permutation
Problem Statement
You are given a positive integer N. Your task is to determine if there exists a square matrix A whose dimension is N that satisfies the following conditions and provide an example of such matrices if it exists. A_{i, j} denotes the element of matrix A at the i-th r... | stdin | null | 2,266 | 1 | [
"4\n"
] | [
"Yes\n2 6 3 7\n4 5 2 1\n1 7 5 6\n5 3 4 2\n"
] | [
"3\n",
"2\n",
"0\n",
"1\n",
"10\n",
"30\n",
"22\n",
"6\n",
"12\n",
"24\n"
] | [
"No\n",
"Yes\n3 2\n1 3\n",
"Yes\n",
"Yes\n1\n",
"Yes\n19 11 12 13 14 15 16 17 18 10\n2 19 13 14 15 16 17 18 10 12\n3 4 19 15 16 17 18 10 11 14\n4 5 6 19 17 18 10 11 12 16\n5 6 7 8 19 10 11 12 13 18\n6 7 8 9 1 19 12 13 14 11\n7 8 9 1 2 3 19 14 15 13\n8 9 1 2 3 4 5 19 16 15\n9 1 2 3 4 5 6 7 19 17\n1 3 5 7 9 2... |
CodeContests | N: Mail order
Mr. Komozawa bought building blocks toys from Makai mail order.
The building blocks are in the shape of a cube with a side length of 1, and are stacked on squares divided into $ H $ pieces vertically and $ W $ pieces horizontally.
Seen from the side, $ A_1, A_2, A_3, \ dots, A_H $ blocks were stacked i... | stdin | null | 4,481 | 1 | [
"2 2\n1 5\n1 5\n"
] | [
"8\n"
] | [
"2 2\n0 5\n1 5\n",
"2 2\n0 2\n1 5\n",
"2 2\n0 4\n1 5\n",
"2 2\n-1 2\n1 5\n",
"2 2\n0 3\n1 5\n",
"2 2\n0 5\n2 5\n",
"2 2\n0 5\n3 5\n",
"2 2\n0 1\n1 5\n",
"2 2\n-1 0\n1 5\n",
"2 2\n2 5\n1 5\n"
] | [
"6\n",
"3\n",
"5\n",
"1\n",
"4\n",
"7\n",
"8\n",
"2\n",
"-2\n",
"9\n"
] |
CodeContests | Now our heroes - Maga and Alex are working for Oil Company as developers. Recently they have faced a great problem.
They couldn’t find the correct solution. Could you help them?
We are given r – radius of lower base and s – slant height. The figure can be cylinder or truncated cone. You have to find as largest volum... | stdin | null | 4,848 | 1 | [
"1 1\n\nSAMPLE\n"
] | [
"4.33\n"
] | [
"97 21\n",
"54 95\n",
"78 70\n",
"1 2\n\nSAMPLE\n",
"184 21\n",
"54 181\n",
"54 70\n",
"2 2\n\nSAMPLE\n",
"184 0\n",
"54 91\n"
] | [
"634924.24\n",
"1706898.12\n",
"1759980.78\n",
"13.71\n",
"2248036.15\n",
"6168918.71\n",
"1015894.52\n",
"34.66\n",
"0.00\n",
"1581107.70\n"
] |
CodeContests | Example
Input
3 2
1 2 1
2 3 2
1 10 100
Output
320 | stdin | null | 4,640 | 1 | [
"3 2\n1 2 1\n2 3 2\n1 10 100\n"
] | [
"320\n"
] | [
"1 2\n1 2 1\n2 3 2\n1 10 100\n",
"3 2\n1 2 0\n2 3 2\n1 10 100\n",
"2 4\n1 2 2\n0 6 2\n2 10 100\n",
"3 4\n1 2 1\n2 3 2\n1 10 100\n",
"2 4\n1 2 2\n-1 6 2\n2 19 100\n",
"3 4\n1 2 1\n2 3 2\n1 13 100\n",
"2 4\n1 2 2\n-2 6 2\n2 19 100\n",
"2 4\n1 2 1\n0 1 1\n-1 4 100\n",
"2 4\n1 2 1\n1 1 1\n-1 2 100\n",
... | [
"0\n",
"220\n",
"12\n",
"333\n",
"10\n",
"342\n",
"8\n",
"1\n",
"2\n",
"0\n"
] |
CodeContests | The unlucky Ikta-kun has rewritten the important character string T that he had to a different character string T'by the virus. It is known that the virus has rewritten one letter of T to a different letter. That is, T and T'are different by exactly one character. In order to restore T, Ikta prepared a document S in wh... | stdin | null | 2,937 | 1 | [
"aaaaaa\naaaaaa\n",
"abcbcdbc\nabc\n",
"baaaaaaaa\nb\n"
] | [
"0\n",
"2\n",
"8\n"
] | [
"aaaaaa\naaaaab\n",
"bbcbcdbc\nabc\n",
"aaaaaa\nbbaaaa\n",
"bbcbcdbc\nbca\n",
"aaaaaa\nbaaaaa\n",
"bbcbcdbc\nacb\n",
"aaaaaa\nbbaa`a\n",
"cbdcbcbb\nbca\n",
"aaaaaa\nbaba`a\n",
"cbdcbcbb\nbda\n"
] | [
"1\n",
"3\n",
"0\n",
"2\n",
"1\n",
"1\n",
"0\n",
"1\n",
"0\n",
"1\n"
] |
CodeContests | ABC Gene
There is a gene sequence represented by the string `ABC`. You can rewrite this gene sequence by performing the following operations several times.
* Choose one of the letters `A`,` B`, `C`. Let this be x. Replace all x in the gene sequence with `ABC` at the same time.
Given a string S consisting only of `... | stdin | null | 748 | 1 | [
"ABC\n"
] | [
"Yes\n"
] | [
"BAC\n",
"ACB\n",
"CAB\n",
"CBA\n",
"ACA\n",
"BCA\n",
"BAB\n",
"ABA\n",
"BAA\n",
"AAB\n"
] | [
"No\n",
"No\n",
"No\n",
"No\n",
"No\n",
"No\n",
"No\n",
"No\n",
"No\n",
"No\n"
] |
CodeContests | Example
Input
4 3
1000 1
2000 2
3000 3
Output
2 3 4 4 | stdin | null | 3,887 | 1 | [
"4 3\n1000 1\n2000 2\n3000 3\n"
] | [
"2 3 4 4\n"
] | [
"8 3\n1000 1\n2000 2\n3000 3\n",
"8 3\n1010 1\n2889 2\n3000 5\n",
"9 3\n1010 1\n2889 2\n4734 5\n",
"9 3\n1010 2\n2889 2\n4734 5\n",
"4 3\n1000 1\n2000 2\n3000 1\n",
"8 3\n1000 1\n2889 2\n439 3\n",
"16 3\n1010 1\n2889 2\n3000 3\n",
"8 3\n1010 1\n2889 2\n4734 4\n",
"9 3\n1010 2\n2889 2\n4734 7\n",
"... | [
"2 3 4 4 1 1 1 1\n",
"2 3 3 1 2 2 1 1\n",
"2 3 3 1 2 2 1 1 1\n",
"1 2 2 1 2 2 1 1 1\n",
"3 3 3 1\n",
"2 4 4 2 1 1 1 1\n",
"2 3 4 4 1 1 1 1 1 1 1 1 1 1 1 1\n",
"2 3 3 2 2 1 1 1\n",
"1 2 2 1 1 1 2 2 1\n",
"2 2 1 2 3 3 1 1\n"
] |
CodeContests | Example
Input
3 3 1
0 0
Output
4 | stdin | null | 4,166 | 1 | [
"3 3 1\n0 0\n"
] | [
"4\n"
] | [
"3 5 1\n0 0\n",
"3 1 1\n0 0\n",
"3 4 1\n0 0\n",
"3 5 1\n0 1\n",
"3 6 1\n0 0\n",
"3 7 1\n0 1\n",
"3 6 0\n0 0\n",
"3 6 1\n0 1\n",
"3 6 1\n0 2\n",
"3 6 1\n1 2\n"
] | [
"48\n",
"0\n",
"18\n",
"66\n",
"100\n",
"230\n",
"120\n",
"132\n",
"148\n",
"153\n"
] |
CodeContests | A Darie is a special circle. Numbers 1, 2, ..., n are written clockwise around this circle in order. You can stand on a number! Initially Rasta is on number 1. In each step, he jumps exactly p numbers clockwise. For example if n = 3 and he is standing on number 1:
If p = 1 then he jumps to number 2.
Or if p = 2 he ju... | stdin | null | 3,188 | 1 | [
"3\n12 5 3\n12 3 2\n3 2 2\n\nSAMPLE\n"
] | [
"3\n4\n2\n"
] | [
"3\n12 5 3\n12 3 2\n3 2 0\n\nSAMPLE\n",
"3\n18 5 3\n12 3 2\n6 2 0\n\nSAMPLE\n",
"3\n18 5 2\n12 3 2\n6 2 0\n\nSAMPLE\n",
"3\n15 5 2\n12 3 2\n6 2 0\n\nSAMPLE\n",
"3\n15 5 2\n12 3 3\n6 2 0\n\nSAMPLE\n",
"3\n15 5 2\n12 3 3\n3 2 0\n\nSAMPLE\n",
"3\n15 5 2\n12 1 3\n3 2 0\n\nSAMLPE\n",
"3\n15 10 2\n21 1 6\n3... | [
"3\n4\n0\n",
"3\n4\n-1\n",
"2\n4\n-1\n",
"6\n4\n-1\n",
"6\n7\n-1\n",
"6\n7\n0\n",
"6\n3\n0\n",
"6\n6\n0\n",
"6\n0\n0\n",
"6\n0\n-1\n"
] |
CodeContests | Leha is playing a very interesting game. The game will be played on a rectangular grid consisting of N rows and M columns. Initially all the cells of the grid are uncolored.
Leha's initial score is zero. At each turn, he chooses some cell that is yet not colored, and colors that cell. The score obtained in this step w... | stdin | null | 2,189 | 1 | [
"1\n2 2\n"
] | [
"4\n"
] | [
"1\n3 2\n",
"1\n6 2\n",
"1\n3 3\n",
"1\n3 6\n",
"1\n6 6\n",
"1\n0 6\n",
"1\n-1 6\n",
"1\n0 5\n",
"1\n0 3\n",
"1\n0 0\n"
] | [
"7\n",
"16\n",
"12\n",
"27\n",
"60\n",
"-6\n",
"-17\n",
"-5\n",
"-3\n",
"0\n"
] |
CodeContests | Taro is very good at 8 puzzles and always has his friends sort them out during breaks. At that time, my friend asked me, "Can you solve more complicated puzzles?", But I have never done other puzzles. Apparently the friend made 11 puzzles by himself. The puzzle has the following shape.
<image>
11 The puzzle is done ... | stdin | null | 4,040 | 1 | [
"2\n1 0 3\n4 5 6 7 8\n9 0 11\n10\n0\n1 2 3\n4 5 6 7 8\n9 10 11\n0\n0\n11 10 9\n8 7 6 5 4\n3 2 1\n0\n-1\n"
] | [
"2\n0\nNA\n"
] | [
"2\n1 0 3\n4 5 6 7 8\n9 0 11\n10\n0\n1 2 3\n4 5 6 7 8\n9 10 11\n0\n0\n11 10 9\n3 7 6 5 4\n3 2 1\n0\n-1\n",
"2\n1 0 3\n4 5 6 7 8\n9 0 11\n10\n0\n0 2 3\n4 5 8 7 8\n9 10 11\n0\n0\n3 10 9\n11 7 6 5 5\n3 0 1\n0\n-1\n",
"2\n1 0 3\n4 5 6 7 8\n9 0 11\n10\n0\n1 2 3\n4 5 6 7 8\n9 10 11\n0\n0\n11 10 9\n8 7 4 5 4\n3 2 1\n0... | [
"2\n0\nNA\n",
"2\nNA\nNA\n",
"2\n0\nNA\n",
"2\n0\nNA\n",
"2\n0\nNA\n",
"2\n0\nNA\n",
"2\n0\nNA\n",
"2\n0\nNA\n",
"2\n0\nNA\n",
"2\n0\nNA\n"
] |
CodeContests | Takahashi and Aoki will play a game. They will repeatedly play it until one of them have N wins in total.
When they play the game once, Takahashi wins with probability A %, Aoki wins with probability B %, and the game ends in a draw (that is, nobody wins) with probability C %. Find the expected number of games that wi... | stdin | null | 3,352 | 1 | [
"4 50 50 0\n",
"1 25 25 50\n",
"1 100 0 0\n",
"100000 31 41 28\n"
] | [
"312500008\n",
"2\n",
"1\n",
"104136146\n"
] | [
"8 50 50 0\n",
"1 000 0 0\n",
"2 100 0 0\n",
"6 50 50 0\n",
"1 101 0 -1\n",
"100001 31 41 28\n",
"1 100 -1 1\n",
"000001 31 41 28\n",
"000011 31 41 28\n",
"2 25 25 50\n"
] | [
"127441420\n",
"0\n",
"2\n",
"386718762\n",
"59405942\n",
"904789367\n",
"646464652\n",
"388888893\n",
"339871354\n",
"5\n"
] |
CodeContests | Thomson is very weak in set theory. Recently, he came across the following problem:
Given a set X with N distinct elements, in how many ways can you select two sets A and B such that both A and B are subsets of X and A is also a subset of B.
Help Thomson solve the above problem. As the answer can be very large, print i... | stdin | null | 2,078 | 1 | [
"2\n9\n50\n\nSAMPLE\n"
] | [
"19683\n710104287\n"
] | [
"2\n9\n50\n\nSALPLE\n",
"2\n9\n75\n\nSBLPLE\n",
"2\n9\n121\n\nSBLPLD\n",
"2\n9\n173\n\nSBLPLD\n",
"2\n9\n270\n\nELQLBS\n",
"2\n17\n270\n\nELQLBS\n",
"2\n3\n270\n\nELQLBS\n",
"2\n4\n270\n\nELQLBS\n",
"2\n8\n270\n\nELQLBS\n",
"2\n8\n155\n\nELQLBS\n"
] | [
"19683\n710104287\n",
"19683\n100094381\n",
"19683\n772286045\n",
"19683\n553545706\n",
"19683\n519544111\n",
"129140163\n519544111\n",
"27\n519544111\n",
"81\n519544111\n",
"6561\n519544111\n",
"6561\n146754675\n"
] |
CodeContests | Taro got a driver’s license with a great effort in his campus days, but unfortunately there had been no opportunities for him to drive. He ended up obtaining a gold license.
One day, he and his friends made a plan to go on a trip to Kyoto with you. At the end of their meeting, they agreed to go around by car, but ther... | stdin | null | 4,872 | 1 | [
"2 1\nKarasumaKitaoji 0 6150\nKarasumaNanajo 0 0\nKarasumaNanajo KarasumaKitaoji\nKarasumaKitaoji KarasumaNanajo\n3 2\nKujoOmiya 0 0\nKujoAburanokoji 400 0\nOmiyaNanajo 0 1150\nKujoOmiya KujoAburanokoji\nKujoOmiya OmiyaNanajo\nKujoAburanokoji OmiyaNanajo\n10 12\nKarasumaGojo 745 0\nHorikawaShijo 0 870\nShijoKarasum... | [
"2\nimpossible\n13\n4\n"
] | [
"2 1\nKarasumaKitaoji 0 6150\nKarasumaNanajo 0 0\nKarasumaNanajo KarasumaKitaoji\nKarasumaKitaoji KarasumaNanajo\n3 2\nKujoOmiya 0 0\nKujoAburanokoji 400 0\nOmiyaNanajo 0 1150\nKujoOmiya KujoAburanokoji\nKujoOmiya OmiyaNanajo\nKujoAburanokoji OmiyaNanajo\n10 12\nKarasumaGojo 745 0\nHorikawaShijo 0 870\nShijoKarasum... | [
"2\nimpossible\n13\n4\n",
"2\nimpossible\n13\nimpossible\n",
"2\nimpossible\n9\n4\n",
"2\nimpossible\nimpossible\n4\n",
"2\nimpossible\nimpossible\nimpossible\n",
"2\nimpossible\n9\nimpossible\n",
"2\nimpossible\n13\n4\n",
"2\nimpossible\n13\n4\n",
"2\nimpossible\n13\n4\n",
"2\nimpossible\n13\n4\n... |
CodeContests | Emergency Evacuation
The Japanese government plans to increase the number of inbound tourists to forty million in the year 2020, and sixty million in 2030. Not only increasing touristic appeal but also developing tourism infrastructure further is indispensable to accomplish such numbers.
One possible enhancement on t... | stdin | null | 1,656 | 1 | [
"5 2 7\n1 1\n1 2\n1 3\n2 3\n2 4\n4 4\n5 2\n"
] | [
"9\n"
] | [
"5 2 7\n1 1\n1 2\n1 3\n2 3\n2 4\n4 0\n5 2\n",
"5 2 7\n1 1\n1 2\n1 3\n3 3\n2 4\n4 4\n5 2\n",
"5 6 5\n1 1\n1 3\n1 3\n2 3\n2 4\n4 0\n5 3\n",
"5 8 7\n2 1\n1 2\n1 3\n5 3\n2 7\n4 4\n5 2\n",
"5 8 7\n2 1\n1 2\n0 3\n5 3\n2 7\n4 4\n5 2\n",
"5 6 5\n0 1\n1 3\n1 3\n2 3\n2 4\n3 0\n5 2\n",
"5 3 3\n1 1\n0 12\n1 3\n4 1\... | [
"10\n",
"9\n",
"11\n",
"13\n",
"14\n",
"12\n",
"15\n",
"16\n",
"22\n",
"17\n"
] |
CodeContests | Princess, a Cryptanalyst
Decryption of the princess
English text is not available in this practice contest.
A brave princess in a poor country's tomboy got an old document written in Japanese, a town she went out in stealth. The princess can speak Japanese, so I immediately read this old document. Then I found somet... | stdin | null | 3,527 | 1 | [
"4\napple\nlength\nthings\nthin\n2\nicp\ncpc\n3\nzeta\neta\nalphabet\n2\nuntil\ntill\n0\n"
] | [
"applengthings\nicpc\nzetalphabet\nuntill\n"
] | [
"4\napple\nlength\ntiings\nthin\n2\nicp\ncpc\n3\nzeta\neta\nalphabet\n2\nuntil\ntill\n0\n",
"4\napple\nlength\ntiings\nthin\n2\nicp\ncpc\n3\nzeta\neta\nalphacet\n2\nuntil\ntill\n0\n",
"4\napple\nhtgnel\ntiings\nthin\n2\nicp\ncpc\n3\nzeta\neta\nalphacet\n2\nuntil\ntill\n0\n",
"4\napple\nhtgnel\ntiings\nthin\n2... | [
"applengthintiings\nicpc\nzetalphabet\nuntill\n",
"applengthintiings\nicpc\nzetalphacet\nuntill\n",
"applehtgnelthintiings\nicpc\nzetalphacet\nuntill\n",
"applehtgnelthintiings\nicpc\ntecahplazeta\nuntill\n",
"applehtgneltiingsuhin\nicpc\ntecahplazeta\nuntill\n",
"applehtgneltiingsuiin\nicpc\ntecahplazeta... |
CodeContests | The city of Kyoto is well-known for its Chinese plan: streets are either North-South or East-West. Some streets are numbered, but most of them have real names.
Crossings are named after the two streets crossing there, e.g. Kawaramachi-Sanjo is the crossing of Kawaramachi street and Sanjo street. But there is a problem:... | stdin | null | 4,199 | 1 | [
"7\nShijo-Kawaramachi\nKarasuma-Imadegawa\nKawaramachi-Imadegawa\nNishioji-Shijo\nKarasuma-Gojo\nTorimaru-Rokujo\nRokujo-Karasuma\n6\nShijo-Karasuma\nImadegawa-Nishioji\nNishioji-Gojo\nShijo-Torimaru\nTorimaru-Gojo\nShijo-Kawabata\n4\n1jo-Midosuji\nMidosuji-2jo\n2jo-Omotesando\nOmotesando-1jo\n4\nMidosuji-1jo\n1jo-... | [
"8\nYES\nNO\nYES\nNO\nYES\nNO\n4\nYES\nYES\nNO\nNO\n"
] | [
"7\nShijo-Kawaramachi\nKbrasuma-Imadegawa\nKawaramachi-Imadegawa\nNishioji-Shijo\nKarasuma-Gojo\nTorimaru-Rokujo\nRokujo-Karasuma\n6\nShijo-Karasuma\nImadegawa-Nishioji\nNishioji-Gojo\nShijo-Torimaru\nTorimaru-Gojo\nShijo-Kawabata\n4\n1jo-Midosuji\nMidosuji-2jo\n2jo-Omotesando\nOmotesando-1jo\n4\nMidosuji-1jo\n1jo-... | [
"9\nNO\nNO\nNO\nNO\nYES\nNO\n4\nYES\nYES\nNO\nNO\n",
"9\nNO\nNO\nNO\nNO\nYES\nNO\n4\nNO\nYES\nNO\nNO\n",
"9\nNO\nNO\nNO\nNO\nYES\nNO\n5\nNO\nNO\nNO\nNO\n",
"9\nNO\nNO\nNO\nNO\nYES\nNO\n6\nNO\nNO\nNO\nNO\n",
"9\nNO\nNO\nNO\nNO\nYES\nNO\n4\nNO\nNO\nNO\nNO\n",
"10\nNO\nNO\nNO\nNO\nYES\nNO\n5\nNO\nNO\nNO\nNO\... |
CodeContests | Yoko’s math homework today was to calculate areas of polygons in the xy-plane. Vertices are all aligned to grid points (i.e. they have integer coordinates).
Your job is to help Yoko, not good either at math or at computer programming, get her home- work done. A polygon is given by listing the coordinates of its vertic... | stdin | null | 1,178 | 1 | [
"4\n5 -3\n1 0\n1 7\n-7 -1\n3\n5 5\n18 5\n5 10\n3\n-5 -5\n-5 -10\n-18 -10\n5\n0 0\n20 2\n11 1\n21 2\n2 0\n0\n"
] | [
"55\n41\n41\n23\n"
] | [
"4\n5 -3\n1 0\n1 7\n-7 -1\n3\n5 5\n18 5\n5 10\n3\n-7 -5\n-5 -10\n-18 -10\n5\n0 0\n20 2\n11 1\n21 2\n2 0\n0\n",
"4\n5 -3\n1 0\n1 7\n-7 -1\n3\n5 5\n27 5\n5 10\n3\n-7 -5\n-5 -10\n-18 -10\n5\n0 0\n20 2\n11 1\n21 2\n2 0\n0\n",
"4\n5 -3\n1 0\n1 7\n-7 -1\n3\n5 5\n27 5\n5 10\n3\n-7 -5\n-5 -10\n-18 -10\n5\n0 0\n14 2\n11... | [
"55\n41\n43\n23\n",
"55\n68\n43\n23\n",
"55\n68\n43\n26\n",
"55\n68\n43\n31\n",
"55\n76\n43\n31\n",
"17\n76\n43\n31\n",
"17\n76\n43\n59\n",
"17\n76\n43\n58\n",
"14\n76\n43\n58\n",
"14\n76\n21\n58\n"
] |
CodeContests | Let's play a puzzle using eight cubes placed on a 3 × 3 board leaving one empty square.
Faces of cubes are painted with three colors. As a puzzle step, you can roll one of the cubes to the adjacent empty square. Your goal is to make the specified color pattern visible from above by a number of such steps.
The rules o... | stdin | null | 2,931 | 1 | [
"1 2\nW W W\nE W W\nW W W\n2 1\nR B W\nR W W\nE W W\n3 3\nW B W\nB R E\nR B R\n3 3\nB W R\nB W R\nB E R\n2 1\nB B B\nB R B\nB R E\n1 1\nR R R\nW W W\nR R E\n2 1\nR R R\nB W B\nR R E\n3 2\nR R R\nW E W\nR R R\n0 0\n"
] | [
"0\n3\n13\n23\n29\n30\n-1\n-1\n"
] | [
"1 2\nW W W\nE W W\nW W W\n2 1\nR B W\nR W W\nE W W\n3 3\nW B W\nB R E\nR B R\n3 3\nB W R\nB W R\nB E R\n2 1\nB B B\nB R B\nB R E\n1 1\nR R R\nW W W\nR R E\n2 1\nR R R\nB W B\nR R E\n3 2\nR R R\nW E V\nR R R\n0 0\n",
"1 2\nW W W\nE W W\nW W W\n2 1\nR B W\nR W W\nE W W\n1 3\nW B W\nB R E\nR B R\n3 3\nB W R\nB W R\... | [
"0\n3\n13\n23\n29\n30\n-1\n-1\n",
"0\n3\n9\n23\n29\n30\n-1\n-1\n",
"0\n3\n13\n-1\n29\n30\n-1\n-1\n",
"0\n3\n13\n23\n-1\n30\n-1\n-1\n",
"0\n3\n-1\n23\n29\n30\n-1\n-1\n",
"0\n3\n13\n24\n29\n30\n-1\n-1\n",
"0\n-1\n13\n23\n29\n30\n-1\n-1\n",
"0\n3\n13\n23\n29\n-1\n-1\n-1\n",
"0\n3\n9\n-1\n29\n30\n-1\n-1... |
CodeContests | A triple of numbers is said to be poor when two of those numbers are equal but the other number is different from those two numbers.
You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`.
Constraints
* A, B, and C are all integers between 1 and 9 (inclusive).
Input... | stdin | null | 844 | 1 | [
"3 3 4\n",
"4 4 4\n",
"5 7 5\n",
"4 9 6\n"
] | [
"Yes\n",
"No\n",
"Yes\n",
"No\n"
] | [
"2 3 4\n",
"1 4 4\n",
"10 7 5\n",
"7 9 6\n",
"4 3 4\n",
"1 4 8\n",
"10 2 5\n",
"7 4 6\n",
"4 5 4\n",
"0 4 8\n"
] | [
"No\n",
"Yes\n",
"No\n",
"No\n",
"Yes\n",
"No\n",
"No\n",
"No\n",
"Yes\n",
"No\n"
] |
CodeContests | F: Transparent mahjong tiles
You will play mahjong against Mr. Takanosu, a gambler who is rumored to have fallen into the darkness. Mr. Takanosu has been rumored to be a natural disaster, so he has proposed a game using a bizarre mahjong tile called Takanosu tile.
Mahjong is a game in which players hold multiple tile... | stdin | null | 1,864 | 1 | [
"4\n1 1 1 3 3 3 5 5 5 7 7 7 9\n"
] | [
"8\n9\n"
] | [
"4\n1 1 2 3 3 3 5 5 5 7 7 7 9\n",
"4\n1 1 1 3 3 3 5 5 5 7 7 7 7\n",
"4\n1 1 2 3 2 3 5 5 5 7 7 7 9\n",
"4\n1 1 2 3 3 1 5 6 5 7 7 7 7\n",
"4\n1 1 2 3 3 1 2 6 5 7 7 7 7\n",
"4\n1 1 2 3 3 2 2 6 5 7 7 7 7\n",
"4\n2 1 2 3 3 1 5 6 5 7 7 7 7\n",
"4\n1 1 2 3 3 3 2 11 10 2 7 7 7\n",
"4\n1 1 3 3 3 1 5 5 5 7 7 ... | [
"-1\n",
"6\n",
"8\n9\n",
"4\n",
"1\n2\n3\n4\n",
"1\n2\n3\n",
"5\n6\n8\n",
"9\n12\n",
"2\n4\n",
"5\n6\n8\n9\n"
] |
CodeContests | Did you hear about the Nibiru collision ? It is a supposed disastrous encounter between the earth and a large planetary object. Astronomers reject this idea. But why listen to other people's beliefs and opinions. We are coders above all, so what better way than to verify it by a small code. The earth and N asteroids ar... | stdin | null | 1,831 | 1 | [
"3\n0 0 R\n2\n1 -2 U\n2 2 D\n1 1 U\n1\n1 0 U\n0 0 R\n1\n3 0 L\n"
] | [
"2.0\nSAFE\n1.5\n"
] | [
"3\n0 0 R\n2\n2 -2 U\n2 2 D\n1 1 U\n1\n1 0 U\n0 0 R\n1\n3 0 L\n",
"3\n0 0 R\n2\n1 -4 U\n1 2 D\n1 1 U\n1\n1 0 U\n0 0 R\n1\n3 0 L\n",
"3\n0 0 R\n2\n1 -4 U\n2 2 D\n1 1 U\n1\n1 0 U\n0 0 R\n1\n3 1 L\n",
"3\n0 0 R\n2\n1 -4 U\n1 2 D\n1 1 U\n1\n1 0 U\n0 0 R\n1\n4 0 L\n",
"3\n0 0 R\n2\n1 -4 U\n2 3 D\n1 1 U\n1\n1 0 U... | [
"2.0\nSAFE\n1.5\n",
"SAFE\nSAFE\n1.5\n",
"2.0\nSAFE\nSAFE\n",
"SAFE\nSAFE\n2.0\n",
"SAFE\nSAFE\nSAFE\n",
"3.0\nSAFE\nSAFE\n",
"1.0\nSAFE\n1.5\n",
"1.0\nSAFE\n2.0\n",
"2.0\nSAFE\n1.0\n",
"SAFE\nSAFE\n1.0\n"
] |
CodeContests | Alice decides to challenge Bob to a problem. She gives him a number.
Bob can rearrange the digits of this number by applying pair-wise swaps between any 2 digits in the number as many times as he wants. Now Alice asks him to write down all the distinct numbers that he can form and sort them. Of these she wants him to... | stdin | null | 2,828 | 1 | [
"3\n123\n4\n1232\n\nSAMPLE\n"
] | [
"213 231\nNot possible!\n1322 3122\n"
] | [
"3\n123\n4\n1232\n\nSAMOLE\n",
"3\n123\n4\n974\n\nSAMPLE\n",
"3\n123\n4\n2257\n\nSAMOLE\n",
"3\n42\n2\n1232\n\nSAMOLE\n",
"3\n123\n2\n1846\n\nSBMOLD\n",
"3\n123\n4\n547\n\nSAMPLE\n",
"3\n42\n2\n943\n\nSAMOLE\n",
"3\n42\n2\n1285\n\nSAMOLE\n",
"3\n154\n1\n1846\n\nSBMOLD\n",
"3\n123\n2\n613\n\nSAMOLD... | [
"213 231\nNot possible!\n1322 3122\n",
"213 231\nNot possible!\n749 794\n",
"213 231\nNot possible!\n2527 7225\n",
"Not possible!\nNot possible!\n1322 3122\n",
"213 231\nNot possible!\n1648 8461\n",
"213 231\nNot possible!\n547 574\n",
"Not possible!\nNot possible!\n439 493\n",
"Not possible!\nNot pos... |
CodeContests | bhargav has dream to study his MS is foreign country. So, He started his preparation for GRE. There are huge number of words that he has to prepare for. So, firs he wanted to group all synonyms and antonyms. As there are huge number of words that he has to group. So, he asked help to group all synonyms and antonyms of ... | stdin | null | 519 | 1 | [
"hasrfk\n4\nheyfgs\njhajyrbf\nkayufs\nhetinf\n\nSAMPLE\n"
] | [
"2 1\n"
] | [
"ashtrick\n25\namberhed\ndouglasb\nashmartin\nroogle\neglownasht\ndutterwo\naverists\ndueglors\naeufahef\neutifhre\naedsqntf\naleifksc\nalejfisj\neshmarin\naksiefjs\ndharanis\nqueofjsl\ndileeeep\nprashant\naravinds\nakhilesh\ndheufncs\najeufjvjs\naeuigvsr\naskhtakuen\n",
"hasrfk\n4\nheyfgs\nfbryjahj\nkayufs\nheti... | [
"10 6\n",
"2 1\n",
"9 6\n",
"1 0\n",
"7 4\n",
"0 0\n",
"6 4\n",
"6 5\n",
"5 5\n",
"4 6\n"
] |
CodeContests | Divide and rule
Taro, Hanako, and Jiro rule the JAG Kingdom together. There are N cities in the JAG Kingdom, some of which are connected by two-way roads. You can always reach all the other cities from any city via one or more roads.
One day, Taro and Hanako finally made a mistake and decided to share the city and go... | stdin | null | 3,372 | 1 | [
"6 7\n1 2\n1 4\n2 3\n2 5\n3 4\n4 5\n4 6\n2 1\n1 2\n3 3\n1 2\n1 3\n2 3\n4 3\n1 2\n2 3\n3 4\n5 4\n1 2\n2 3\n3 4\n4 5\n0 0\n"
] | [
"2\n1\n2\n0\n0\n1\n1\n1\n1\n"
] | [
"6 7\n1 2\n1 4\n2 3\n2 5\n3 4\n4 5\n4 6\n2 1\n1 2\n3 3\n1 2\n2 3\n2 3\n4 3\n1 2\n2 3\n3 4\n5 4\n1 2\n2 3\n3 4\n4 5\n0 0\n",
"6 7\n1 4\n1 4\n2 3\n2 5\n3 4\n4 5\n4 6\n2 1\n1 2\n3 3\n1 2\n1 3\n2 3\n4 3\n1 2\n2 3\n3 4\n5 4\n1 2\n2 3\n3 4\n4 5\n0 0\n",
"6 7\n1 4\n1 4\n2 3\n2 5\n3 4\n4 5\n4 6\n2 1\n1 2\n3 3\n1 2\n1 3... | [
"2\n1\n2\n0\n1\n1\n1\n1\n1\n1\n",
"2\n1\n2\n0\n0\n1\n1\n1\n1\n",
"2\n1\n2\n0\n0\n0\n1\n1\n",
"0\n0\n0\n1\n1\n1\n1\n",
"0\n0\n1\n1\n1\n1\n1\n1\n",
"0\n0\n0\n0\n1\n1\n",
"0\n0\n1\n1\n1\n1\n0\n",
"0\n0\n1\n1\n1\n1\n",
"2\n1\n2\n0\n0\n0\n0\n",
"2\n1\n2\n0\n1\n1\n0\n1\n1\n"
] |
CodeContests | Along a road running in an east-west direction, there are A shrines and B temples. The i-th shrine from the west is located at a distance of s_i meters from the west end of the road, and the i-th temple from the west is located at a distance of t_i meters from the west end of the road.
Answer the following Q queries:
... | stdin | null | 4,386 | 1 | [
"2 3 4\n100\n600\n400\n900\n1000\n150\n2000\n899\n799\n",
"1 1 3\n1\n10000000000\n2\n9999999999\n5000000000\n"
] | [
"350\n1400\n301\n399\n",
"10000000000\n10000000000\n14999999998\n"
] | [
"2 3 4\n110\n600\n400\n900\n1000\n150\n2000\n899\n799\n",
"2 3 4\n110\n608\n400\n900\n1000\n150\n2000\n899\n799\n",
"2 3 4\n110\n608\n400\n900\n1000\n150\n2000\n899\n1571\n",
"2 3 4\n110\n608\n400\n900\n1000\n155\n2000\n899\n1571\n",
"2 3 4\n110\n608\n400\n900\n1000\n155\n2000\n1530\n1571\n",
"1 1 3\n1\n1... | [
"330\n1400\n301\n399\n",
"330\n1392\n293\n393\n",
"330\n1392\n293\n963\n",
"335\n1392\n293\n963\n",
"335\n1392\n922\n963\n",
"10000100000\n10000200000\n15000099998\n",
"322\n1400\n301\n399\n",
"330\n1392\n293\n",
"455\n1392\n293\n963\n",
"335\n1392\n293\n994\n"
] |
CodeContests | Snuke has N dogs and M monkeys. He wants them to line up in a row.
As a Japanese saying goes, these dogs and monkeys are on bad terms. ("ken'en no naka", literally "the relationship of dogs and monkeys", means a relationship of mutual hatred.) Snuke is trying to reconsile them, by arranging the animals so that there a... | stdin | null | 3,002 | 1 | [
"100000 100000\n",
"3 2\n",
"1 8\n",
"2 2\n"
] | [
"530123477\n",
"12\n",
"0\n",
"8\n"
] | [
"100010 100000\n",
"3 4\n",
"1 2\n",
"4 4\n",
"2 3\n",
"000011 000010\n",
"001010 001011\n",
"000101 000101\n",
"000110 000111\n",
"001111 001110\n"
] | [
"0\n",
"144\n",
"2\n",
"1152\n",
"12\n",
"82826050\n",
"931093537\n",
"414723868\n",
"399920258\n",
"292820538\n"
] |
CodeContests | We have caught N sardines. The deliciousness and fragrantness of the i-th sardine is A_i and B_i, respectively.
We will choose one or more of these sardines and put them into a cooler. However, two sardines on bad terms cannot be chosen at the same time.
The i-th and j-th sardines (i \neq j) are on bad terms if and o... | stdin | null | 173 | 1 | [
"3\n1 2\n-1 1\n2 -1\n",
"10\n3 2\n3 2\n-1 1\n2 -1\n-3 -9\n-8 12\n7 7\n8 1\n8 2\n8 4\n"
] | [
"5\n",
"479\n"
] | [
"3\n1 4\n-1 1\n2 -1\n",
"10\n3 2\n3 2\n-1 1\n2 -1\n-3 -6\n-8 12\n7 7\n8 1\n8 2\n8 4\n",
"3\n2 4\n-1 1\n2 -1\n",
"10\n3 2\n3 2\n-1 1\n2 -1\n-3 -6\n-8 12\n7 1\n8 1\n8 2\n8 4\n",
"3\n2 4\n-2 1\n2 -1\n",
"10\n3 2\n3 0\n-1 1\n2 -1\n-3 -6\n-8 12\n7 1\n8 1\n8 2\n15 5\n",
"10\n3 2\n3 0\n-2 2\n2 -2\n-3 -6\n-8 12... | [
"7\n",
"359\n",
"5\n",
"479\n",
"4\n",
"575\n",
"767\n",
"1023\n",
"512\n",
"384\n"
] |
CodeContests | There is an arithmetic progression with L terms: s_0, s_1, s_2, ... , s_{L-1}.
The initial term is A, and the common difference is B. That is, s_i = A + B \times i holds.
Consider the integer obtained by concatenating the terms written in base ten without leading zeros. For example, the sequence 3, 7, 11, 15, 19 woul... | stdin | null | 5,011 | 1 | [
"4 8 1 1000000\n",
"107 10000000000007 1000000000000007 998244353\n",
"5 3 4 10007\n"
] | [
"891011\n",
"39122908\n",
"5563\n"
] | [
"6 8 1 1000000\n",
"107 10000000000007 1000000000000007 1055093371\n",
"5 5 4 10007\n",
"4 8 1 1001000\n",
"107 10000000000007 1000000000000007 498250141\n",
"2 5 4 10007\n",
"3 8 1 1001000\n",
"107 17664785118816 1000000000000007 498250141\n",
"2 1 4 10007\n",
"3 7 1 1001000\n"
] | [
"111213\n",
"58425676\n",
"358\n",
"891011\n",
"152045046\n",
"59\n",
"8910\n",
"240202539\n",
"15\n",
"789\n"
] |
CodeContests | Xavier asks his friend to perform a particular task.The task is to find out the ASCII value of each character of a given STRING and then add them up to find the weight of the given string as 'W',now after finding out the weight his task is to divide the weight of string W with the length of string 'L'such that the fina... | stdin | null | 1,803 | 1 | [
"1\nxyzabc\n\nSAMPLE\n"
] | [
"cbazyx\n"
] | [
"1\ncbazyx\n\nSAMPLE\n",
"1\ncba{yx\n\nMASPEL\n",
"1\nxy{abc\n\nLASPEK\n",
"1\nxya{bc\n\nMASPEK\n",
"1\nxy`{bc\n\nKEPSAM\n",
"1\nxy`cb{\n\nAEPMKS\n",
"1\n{bc`yx\n\nAEPMKS\n",
"1\n{ac`yx\n\nAEPNKS\n",
"1\n{ac_yx\n\nAEPNKS\n",
"1\n{ac_yw\n\nAEPNKS\n"
] | [
"xyzabc\n",
"xy{abc\n",
"cba{yx\n",
"cb{ayx\n",
"cb{`yx\n",
"{bc`yx\n",
"xy`cb{\n",
"xy`ca{\n",
"xy_ca{\n",
"wy_ca{\n"
] |
CodeContests | The very famous football club Manchester United decided to popularize football in India by organizing a football fest. The fest had many events for different sections of people.
For the awesome coders of Hacker Earth, there was an event called PASS and BACK. In this event, the coders were given N passes and players hav... | stdin | null | 1,562 | 1 | [
"1\n10 23\nP 86\nP 63\nP 60\nB\nP 47\nB\nP 99\nP 9\nB\nB\n\nSAMPLE\n"
] | [
"Player 9\n"
] | [
"1\n10 23\nP 42\nP 63\nP 60\nB\nP 47\nB\nP 99\nP 9\nB\nB\n\nSAMPLE\n",
"1\n1 23\nP 42\nQ 63\nP 60\nB\nP 47\nB\nP 99\nP 9\nB\nB\n\nSAMPLE\n",
"1\n10 24\nP 42\nO 63\nQ 60\nB\nP 47\nB\nQ 99\nP 15\nB\nB\n\nSBMPLE\n",
"1\n7 24\nP 42\nP 63\nP 60\nB\nP 47\nB\nP 99\nP 9\nB\nB\n\nSAMPEL\n",
"1\n10 23\nP 86\nP 18\nO ... | [
"Player 9\n",
"Player 42\n",
"Player 15\n",
"Player 99\n",
"Player 18\n",
"Player 8\n",
"Player 13\n",
"Player 14\n",
"Player 10\n",
"Player 16\n"
] |
CodeContests | > Kyoto University Programming Contest is a programming contest voluntarily held by some Kyoto University students. This contest is abbreviated as Kyoto University Programming Contest and called KUPC.
>
> source: Kyoto University Programming Contest Information
The problem-preparing committee met to hold this year's K... | stdin | null | 2,525 | 1 | [
"9 3\nAPPLE\nANT\nATCODER\nBLOCK\nBULL\nBOSS\nCAT\nDOG\nEGG\n",
"3 2\nKU\nKYOUDAI\nKYOTOUNIV\n"
] | [
"3\n",
"0\n"
] | [
"9 3\nAPPLE\nANT\nATCODER\nBLOCK\nBULL\nBOSS\nCAT\nGOD\nEGG\n",
"3 2\nUK\nKYOUDAI\nKYOTOUNIV\n",
"3 4\nUK\nKYOVDAI\nKYOTOUNIV\n",
"9 3\nAPPLE\nBNT\nATCODER\nBLOCK\nBULL\nBOSS\nCTA\nDOG\nEGG\n",
"9 1\nELQPA\nUNB\nATCODER\nLCOLB\nKLUB\nOSSB\nTCA\nGCO\nGGE\n",
"9 2\nLAPPE\nBNT\nRCDOETA\nKCOLC\nUBLM\nBOSS\nCT... | [
"3\n",
"1\n",
"0\n",
"2\n",
"9\n",
"4\n",
"3\n",
"1\n",
"3\n",
"3\n"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.