name stringlengths 2 82 | description stringlengths 42 10.5k | private_tests dict | public_tests dict | generated_tests dict |
|---|---|---|---|---|
p03984 Kyoto University Programming Contest 2016 - Coloring | Mikan's birthday is coming soon. Since Mikan likes graphs very much, Aroma decided to give her a undirected graph this year too.
Aroma bought a connected undirected graph, which consists of n vertices and n edges. The vertices are numbered from 1 to n and for each i(1 \leq i \leq n), vertex i and vartex a_i are connec... | {
"input": [],
"output": []
} | {
"input": [
"10 5\n2\n3\n4\n1\n1\n1\n2\n3\n3\n4",
"4 4\n2\n3\n4\n1",
"4 2\n2\n3\n1\n1"
],
"output": [
"926250",
"55",
"12"
]
} | {
"input": [],
"output": []
} |
cdva1605 | The auditorium of Stanford University is made up of L*R matrix (assume each coordinate has a chair). On the occasion of an event Chef was called as a chief guest. The auditorium was filled with males (M) and females (F), occupying one chair each. Our Chef is very curious guy, so he asks the gatekeeper some queries. The... | {
"input": [],
"output": []
} | {
"input": [
"4 3 3\nMMF\nMMM\nFFM\nFFM\n2 F\n3 M\n1 M"
],
"output": [
"yes\nno\nyes"
]
} | {
"input": [],
"output": []
} |
ignus15e | Problem description.
Tima wants to contest for Mr. Ignus. But there are many obstacles which Tima must cross to become Mr. Ignus. Tima has qualified and passed all the tests and there remains a last test for him to complete successfully. The task is as follows :
There are n judges. The ith judge have A[i] coins wi... | {
"input": [],
"output": []
} | {
"input": [
"2\n5\n1 2 3 4 5\n1\n10"
],
"output": [
"9\n10"
]
} | {
"input": [],
"output": []
} |
1297_H. Paint the String | You are given a string s of lowercase Latin letters. It is required to paint each letter of the string in one of two colors (red or blue) so that if you write all the red letters from left to right and write all the blue letters from left to right, then the lexicographically maximum of the two written strings is lexico... | {
"input": [],
"output": []
} | {
"input": [
"5\nkotlin\ncodeforces\nabacaba\nffccgc\nyz\n"
],
"output": [
"\nRRRRBB\nRRRRRRRBBB\nRRRRBBB\nRBBBBR\nRR\n"
]
} | {
"input": [],
"output": []
} |
1403_A. The Potion of Great Power | Once upon a time, in the Land of the Shamans, everyone lived on the Sky-High Beanstalk. Each shaman had a unique identifying number i between 0 and N-1, and an altitude value H_i, representing how high he lived above ground level. The distance between two altitudes is the absolute value of their difference.
All shaman... | {
"input": [],
"output": []
} | {
"input": [
"6 5 11 4\n2 42 1000 54 68 234\n0 1\n2 0\n3 4\n3 5\n3 5\n1 3\n5 3\n0 5\n3 0\n1 3\n3 5\n0 3 4\n3 0 8\n0 5 5\n3 0 11"
],
"output": [
"\n\n\n\n\n\n\n\n\n\n\n\n\n\n26\n0\n1000000000\n14"
]
} | {
"input": [],
"output": []
} |
784_E. Twisted Circuit | <image>
Input
The input consists of four lines, each line containing a single digit 0 or 1.
Output
Output a single digit, 0 or 1.
Example
Input
0
1
1
0
Output
0 | {
"input": [
"1\n0\n0\n1\n",
"0\n1\n0\n0\n",
"1\n1\n0\n1\n",
"0\n1\n0\n1\n",
"0\n0\n0\n1\n",
"0\n0\n1\n0\n",
"1\n0\n1\n1\n",
"1\n1\n1\n0\n",
"0\n1\n1\n1\n",
"1\n0\n1\n0\n",
"1\n1\n0\n0\n",
"0\n0\n0\n0\n",
"0\n0\n1\n1\n",
"1\n0\n0\n0\n",
"1\n1\n1\n1\n"
],
... | {
"input": [
"0\n1\n1\n0\n"
],
"output": [
"0\n"
]
} | {
"input": [],
"output": []
} |
921_01. Labyrinth-1 | You have a robot in a two-dimensional labyrinth which consists of N × M cells. Some pairs of cells adjacent by side are separated by a wall or a door. The labyrinth itself is separated from the outside with walls around it. Some labyrinth cells are the exits. In order to leave the labyrinth the robot should reach any e... | {
"input": [],
"output": []
} | {
"input": [
"1 1 30 30 1 1 1 1 1 1\n1 1 1 2\n2 2 2 3\n1 4\n9 0\n"
],
"output": [
"for-1111\n take\n open-up\n open-left\n open-right\n open-down\n move-left\n if-ok\n for-11\n move-left\n take\n open-up\n open-left\n open-right\n open-down\n end\n else\n move-right\n if-ok\n... | {
"input": [],
"output": []
} |
magic-pass-code-1 | Problem Description
Apparently, the key that would take Alice home from her Wonderland adventure is a magic pass code hidden in numbers.
Help her find it! It's the one with the highest sum of its digits!
Input Format
Input consists of several integer n, each separated by a newline character.
Output Format
Output ... | {
"input": [],
"output": []
} | {
"input": [
"23\n496\n\nSAMPLE"
],
"output": [
"496"
]
} | {
"input": [],
"output": []
} |
p01581 Cache Control | Mr. Haskins is working on tuning a database system. The database is a simple associative storage that contains key-value pairs. In this database, a key is a distinct identification (ID) number and a value is an object of any type.
In order to boost the performance, the database system has a cache mechanism. The cache ... | {
"input": [],
"output": []
} | {
"input": [
""
],
"output": [
""
]
} | {
"input": [],
"output": []
} |
sncht2 | For Turbo C++ Users : Read the following document before attempting the question :
Problem description.
HM has a tree-cutting facility. He also paint logs to sell them for treehouse-making. His assistant Deepsaggas is a student of IIIT-Delhi. He loves competitive programming very much. He has been working hard and... | {
"input": [],
"output": []
} | {
"input": [
"5 3\n1 2 3 4 5\n2 3\n4 4\n4 5"
],
"output": [
"10\n11\n6"
]
} | {
"input": [],
"output": []
} |
1302_G. Keep talking and nobody explodes – medium | This is an unusual problem in an unusual contest, here is the announcement: [http://codeforces.com/blog/entry/73543](//codeforces.com/blog/entry/73543)
You have the safe lock which consists of 5 decimal digits. If you rotate some digit, it increases by one, except 9 which becomes 0.
Initially, the lock contains numbe... | {
"input": [],
"output": []
} | {
"input": [
"00000\n",
"12345\n"
],
"output": [
"\n43266\n",
"\n87229\n"
]
} | {
"input": [],
"output": []
} |
345_C. Counting Fridays | Judging from the previous problem, Friday the 13th really doesn't treat you well, so you start thinking about how to minimize its impact on your life. You are a passionate participant of programming contests, so various competitions are an important part of your schedule. Naturally, you'd like as few of them to be spoi... | {
"input": [],
"output": []
} | {
"input": [
"5\n2012-01-13\n2012-09-13\n2012-11-20\n2013-09-13\n2013-09-20\n"
],
"output": [
"2\n"
]
} | {
"input": [],
"output": []
} |
is-divisible | Manku has still not learnt from KK's hard problem and continues bragging about himself. He claims that he can code problems even in his sleep. So one day Shark wakes him from sleep and asks him to solve a problem.
Shark gives him a number x and another number m and asks him to check whether any power of x is divisibl... | {
"input": [
"4\n150000 234\n111111 13\n134232 2333434\n15 2456",
"7\n12 44\n45 565\n2323 45454 \n655 123\n23 44\n77 110\n232 111"
],
"output": [
"NO\nYES\nNO\nNO",
"NO\nNO\nNO\nNO\nNO\nNO\nNO"
]
} | {
"input": [
"4\n2 10\n5 25\n6 4\n8 3\n\nSAMPLE"
],
"output": [
"NO\nYES\nYES\nNO"
]
} | {
"input": [],
"output": []
} |
abacus04 | To attain inner peace Geek Sundaram has to pass through the "Hall of Valley of Death". The floor of this hall is a square with length 100 m. It is laid with square tiles of size 1 X 1 arranged over the entire hall. But, at some places in the hall tiles are broken. The moment a person enters the hall, the underworld... | {
"input": [],
"output": []
} | {
"input": [
"2\n3\n1 0\n2 0\n3 0\n4\n1 1\n2 2\n3 3\n4 4"
],
"output": [
"1\n4"
]
} | {
"input": [],
"output": []
} |
nicequad | There are n points with integer coordinates. We can form different quadrangles out of them by taking four different points and connecting them with lines. Let’s call a quadrangle ABCD nice if and only if:
Ax > 0 and Ay > 0;
Bx > 0 and By < 0;
Cx < 0 and Cy < 0;
Dx < 0 and Dy > 0;
ABCD has an integer area.
Your task i... | {
"input": [],
"output": []
} | {
"input": [
"1\n6\n1 1\n2 2\n-1 -1\n-2 2\n2 -1\n-3 -4"
],
"output": [
"2"
]
} | {
"input": [],
"output": []
} |
409_E. Dome | <image>
Input
The input contains a single floating-point number x with exactly 6 decimal places (0 < x < 5).
Output
Output two integers separated by a single space. Each integer should be between 1 and 10, inclusive. If several solutions exist, output any of them. Solution will exist for all tests.
Examples
Input... | {
"input": [
"3.123475\n",
"2.121320\n",
"3.577709\n",
"2.408795\n",
"4.239992\n",
"2.683282\n",
"0.499376\n",
"1.940285\n",
"2.757435\n",
"2.828427\n",
"1.483405\n",
"0.499230\n",
"2.867312\n",
"0.498273\n",
"2.989637\n",
"4.472136\n",
"0.832050\n",... | {
"input": [
"4.024922\n",
"2.572479\n",
"1.200000\n"
],
"output": [
"9 9\n",
"6 5\n",
"3 2\n"
]
} | {
"input": [],
"output": []
} |
64_E. Prime Segment | Positive integer number x is called prime, if it has exactly two positive integer divisors. For example, 2, 3, 17, 97 are primes, but 1, 10, 120 are not.
You are given an integer number n, find the shortest segment [a, b], which contains n (i.e. a ≤ n ≤ b) and a, b are primes.
Input
The only given line contains an i... | {
"input": [],
"output": []
} | {
"input": [
"10\n",
"97\n"
],
"output": [
"7 11\n",
"97 97\n"
]
} | {
"input": [],
"output": []
} |
comrades-i-3 | The Humans are at war against a very powerful alien race that invaded our solar system.
The human army has n soldiers. The soldiers are numbers from 1 to n. The army has a superiority hierarchy. Every soldier has one immediate superior. The superior of a superior of a soldier is also a superior to that soldier. So, a ... | {
"input": [
"5\n10\n5 5 5 5 0 5 5 5 5 5\n5\n1 5\n5 1\n10 7\n7 10\n9 1\n10\n0 1 1 2 4 5 5 6 7 9 \n8\n10 1\n9 7\n4 6\n6 4\n7 4\n8 5\n6 5\n3 1\n10\n2 3 4 5 6 0 6 7 8 9\n7\n2 6\n5 6\n9 6\n8 6\n3 2\n6 9\n6 10\n15\n0 1 1 2 2 3 3 4 4 5 5 6 6 7 7\n20\n8 1\n1 8\n4 2\n2 4\n3 7\n7 3\n6 5\n5 6\n2 13\n13 2\n2 1\n1 2\n12 6\n6... | {
"input": [],
"output": []
} | {
"input": [],
"output": []
} |
the-road-not-taken | Robert Frost is standing on a cross-way with six roads diverging out. He decides to choose the road not taken. After travelling the pathway he reaches a similar but yet another cross-way with six another roads diverging out. He keeps on travelling like this from one cross-way to another and keeps discovering that each ... | {
"input": [
"14\n1\n7\n2\n12\n6\n10\n3\n8\n11\n13\n4\n5\n9\n14"
],
"output": [
"0\n10080\n6\n47977776\n2040\n1588356\n12\n54810\n8676360\n266378112\n90\n360\n290640\n1488801600"
]
} | {
"input": [
"2\n1\n2\n\nSAMPLE"
],
"output": [
"0\n6"
]
} | {
"input": [],
"output": []
} |
cballs | Little Churu is a naughty child, who likes to play with balls. He has N buckets. Each bucket contains one or more balls. He has numbered his buckets 1 to N (both inclusive). He has an infinite supply of extra balls, apart from the ones already in the buckets. He wants to add zero or more number of balls to each of the ... | {
"input": [],
"output": []
} | {
"input": [
"1\n3\n11 13 15"
],
"output": [
"3"
]
} | {
"input": [],
"output": []
} |
hatfact | In mathematics, the factorial of a non-negative integer N, denoted by N!, is the product of all positive integers less than or equal to N. The factorial operation is encountered in many areas of mathematics, notably in combinatorics, algebra, and mathematical analysis. Its most basic occurrence is the fact that there a... | {
"input": [],
"output": []
} | {
"input": [
"3\n5\n6\n7"
],
"output": [
"120\n720\n5040"
]
} | {
"input": [],
"output": []
} |
171_E. MYSTERIOUS LANGUAGE | You are given a mysterious language (codenamed "Secret") available in "Custom Test" tab. Find out what this language is and write a program which outputs its name. Note that the program must be written in this language.
Input
This program has only one test, and it's empty (it doesn't give your program anything to rea... | {
"input": [
"1\n"
],
"output": [
"INTERCAL"
]
} | {
"input": [],
"output": []
} | {
"input": [],
"output": []
} |
dummy-8 | As Valentines Day was approaching, some couples on the campus are upto some mischief and are sneaking around in the Campus Building. But the building has teachers roaming inside it. The teacher both blocks the way and will catch you if you fall into their line of sight. Also, everytime you take a step, each teacher tur... | {
"input": [],
"output": []
} | {
"input": [
"5\n2 5\n##^##\nS...G\n2 5\n##v##\nS...G\n1 5\nS..G<\n1 6\nS...G<\n5 5\nS....\n.....\n.>v..\n.^<..\n....G\n\nSAMPLE"
],
"output": [
"Case #1: 6\nCase #2: 4\nCase #3: 3\nCase #4: impossible\nCase #5: 8"
]
} | {
"input": [],
"output": []
} |
p02280 Binary Trees | A rooted binary tree is a tree with a root node in which every node has at most two children.
Your task is to write a program which reads a rooted binary tree T and prints the following information for each node u of T:
* node ID of u
* parent of u
* sibling of u
* the number of children of u
* depth of u
* height of... | {
"input": [],
"output": []
} | {
"input": [
"9\n0 1 4\n1 2 3\n2 -1 -1\n3 -1 -1\n4 5 8\n5 6 7\n6 -1 -1\n7 -1 -1\n8 -1 -1"
],
"output": [
"node 0: parent = -1, sibling = -1, degree = 2, depth = 0, height = 3, root\nnode 1: parent = 0, sibling = 4, degree = 2, depth = 1, height = 1, internal node\nnode 2: parent = 1, sibling = 3, degree =... | {
"input": [],
"output": []
} |
clco04 | After getting bored of the monotonous routine of college, Chahak wants go back to the golden days of her life ‘Her Childhood’ when she used to enjoy playing games and one such game is "Stapu" (Hopscotch).
Chahak wants to play the game differently now. She plays the game on marble floor consisting of N parallelly placed... | {
"input": [],
"output": []
} | {
"input": [
"2\n10 6\n2 4 8 3 6 7\n10 5\n2 4 5 7 9"
],
"output": [
"NO\nYES"
]
} | {
"input": [],
"output": []
} |
100_A. Carpeting the Room | Soroush's room is a square with side length n. Before this contest he bought k fine Persian carpets to carpet his room for celebrating the 100th contest on his favorite site. Each Persian carpet is a square of side length n1.
Soroush wants to cover all the area of his room. Carpets can be put over each other but it is... | {
"input": [],
"output": []
} | {
"input": [
"10 4 6\n",
"10 2 5\n"
],
"output": [
"YES\n",
"NO\n"
]
} | {
"input": [],
"output": []
} |
162_J. Brackets | A sequence of brackets is called balanced if one can turn it into a valid math expression by adding characters "+" and "1". For example, sequences "(())()", "()" and "(()(()))" are balanced, while ")(", "(()" and "(()))(" are not.
You are given a string which consists of opening and closing round brackets. Check wheth... | {
"input": [],
"output": []
} | {
"input": [
"(()(()))()\n",
"())()\n"
],
"output": [
"YES\n",
"NO\n"
]
} | {
"input": [],
"output": []
} |
183_A. Headquarters | Sensation, sensation in the two-dimensional kingdom! The police have caught a highly dangerous outlaw, member of the notorious "Pihters" gang. The law department states that the outlaw was driving from the gang's headquarters in his car when he crashed into an ice cream stall. The stall, the car, and the headquarters e... | {
"input": [
"10\nUR\nDR\nUL\nDR\nUL\nULDR\nUR\nUL\nULDR\nUL\n",
"6\nUL\nDL\nDL\nUL\nUL\nDL\n",
"1\nDR\n",
"1\nUR\n",
"1\nULDR\n",
"1\nUL\n",
"4\nULDR\nUR\nULDR\nUR\n",
"10\nUL\nUL\nUL\nUL\nUL\nUL\nUL\nUL\nUL\nUL\n",
"10\nUL\nUR\nUR\nDR\nDR\nDR\nDL\nDL\nDL\nDL\n",
"6\nUR\nDL\nU... | {
"input": [
"2\nDR\nDL\n",
"3\nUR\nUL\nULDR\n"
],
"output": [
"4\n",
"9\n"
]
} | {
"input": [],
"output": []
} |
987_A. Infinity Gauntlet | You took a peek on Thanos wearing Infinity Gauntlet. In the Gauntlet there is a place for six Infinity Gems:
* the Power Gem of purple color,
* the Time Gem of green color,
* the Space Gem of blue color,
* the Soul Gem of orange color,
* the Reality Gem of red color,
* the Mind Gem of yellow color.
... | {
"input": [
"4\nblue\norange\nyellow\ngreen\n",
"1\norange\n",
"2\norange\ngreen\n",
"4\ngreen\nyellow\norange\npurple\n",
"3\norange\nyellow\ngreen\n",
"3\npurple\ngreen\nblue\n",
"1\nred\n",
"0\n",
"1\nblue\n",
"3\nblue\ngreen\norange\n",
"2\npurple\norange\n",
"2\ng... | {
"input": [
"0\n",
"4\nred\npurple\nyellow\norange\n"
],
"output": [
"6\nPower\nTime\nSpace\nSoul\nReality\nMind\n",
"2\nTime\nSpace\n"
]
} | {
"input": [],
"output": []
} |
p02847 AtCoder Beginner Contest 146 - Can't Wait for Holiday | Given is a string S representing the day of the week today.
S is `SUN`, `MON`, `TUE`, `WED`, `THU`, `FRI`, or `SAT`, for Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, and Saturday, respectively.
After how many days is the next Sunday (tomorrow or later)?
Constraints
* S is `SUN`, `MON`, `TUE`, `WED`, `THU`,... | {
"input": [],
"output": []
} | {
"input": [
"SUN",
"SAT"
],
"output": [
"7",
"1"
]
} | {
"input": [],
"output": []
} |
p02227 Test | UnionFind（ランダム生成）
Example
Input
Output | {
"input": [],
"output": []
} | {
"input": [
""
],
"output": [
""
]
} | {
"input": [],
"output": []
} |
cr02 | POINTS - 30
Given an integer N, output the number of zeroes at the end of N! (factorial).
Input
The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows.
The first line of each test case contains a single integer N.
Output
For each test case... | {
"input": [],
"output": []
} | {
"input": [
"3\n60\n3\n100"
],
"output": [
"14\n0\n24"
]
} | {
"input": [],
"output": []
} |
gpyrd | Problem Description:
A pyramid has been constructed using bricks. All these bricks are made of gold. However the quality of gold varies from brick to brick. The value of the bricks has been marked equivalent to nCr. Where n is the nth row of the pyramid from the top, and r is the number of the brick in that row (Both n... | {
"input": [],
"output": []
} | {
"input": [
"2\n10\n21"
],
"output": [
"5\n43"
]
} | {
"input": [],
"output": []
} |
maxcomp | Chef Po has given an online advertisement to provide Event organizing services. Chef got a huge response for his advertisement. He got various orders to conduct the events from different organizations. In turn, Chef will receive a compensation depend upon the type of event and the total numbers of persons in the event.... | {
"input": [],
"output": []
} | {
"input": [
"2\n4\n1 2 100\n2 3 200\n3 4 1600\n1 3 2100\n3\n1 10 2000\n2 5 100\n6 9 400"
],
"output": [
"3700\n2000"
]
} | {
"input": [],
"output": []
} |
tos01 | Damon was captured by almighty Ni’klaus.
Ni’klaus was 1000 years old and have spent his life hunting innocents, so he didn’t had time to study math.
Damon, a sharp minded vampire, came across a very interesting idea. He wanted to tell his friends the address of the house he is being held captive in, so he called one o... | {
"input": [],
"output": []
} | {
"input": [
"2\n2\n15"
],
"output": [
"1\n4"
]
} | {
"input": [],
"output": []
} |
1083_C. Max Mex | Once Grisha found a tree (connected graph without cycles) with a root in node 1.
But this tree was not just a tree. A permutation p of integers from 0 to n - 1 is written in nodes, a number p_i is written in node i.
As Grisha likes to invent some strange and interesting problems for himself, but not always can solve ... | {
"input": [
"10\n2 9 3 6 7 1 0 5 8 4\n1 2 3 4 5 6 7 3 5\n10\n1 5 10\n2\n1 9 3\n2\n1 6 1\n2\n1 4 9\n2\n1 1 2\n2\n",
"2\n0 1\n1\n1\n2\n"
],
"output": [
"7\n3\n3\n6\n6\n",
"2\n"
]
} | {
"input": [
"6\n2 5 0 3 1 4\n1 1 3 3 3\n3\n2\n1 6 3\n2\n",
"6\n5 2 1 4 3 0\n1 1 1 3 3\n9\n2\n1 5 3\n2\n1 6 1\n2\n1 4 2\n2\n1 1 6\n2\n"
],
"output": [
"3\n2\n",
"3\n2\n4\n4\n2\n"
]
} | {
"input": [],
"output": []
} |
1250_M. SmartGarden | Berland Gardeners United Inc. hired you for the project called "SmartGarden". The main feature of this project is automatic garden watering.
Formally the garden can be represented as a square of n × n cells with rows numbered 1 to n from top to bottom and columns numbered 1 to n from left to right. Each cell of the ga... | {
"input": [],
"output": []
} | {
"input": [
"2",
"4"
],
"output": [
"\n2\n1 1\n1 2\n1 1\n1 2\n",
"\n4\n2 1 4\n1 2\n2 1 2\n2 3 4\n1 3\n2 1 4\n1 4\n1 1\n"
]
} | {
"input": [],
"output": []
} |
my-notepad | Students of Computer Science Department of SKIT have designed a basic Notepad for the purpose of studying the functioning and advance features in many other text editors.
It is a simple text editor that supports only the following two commands:
"type c" where c is a character: Append character c to the end of the curr... | {
"input": [],
"output": []
} | {
"input": [
"2\n4\n1 type a\n2 type b\n3 type c\n5 undo 3\n4\n1 type a\n2 type b\n3 undo 2\n4 undo 2\n\nSAMPLE"
],
"output": [
"a\na"
]
} | {
"input": [],
"output": []
} |
cubesum | Suppose there is a X x Y x Z 3D matrix A of numbers having coordinates (i, j, k) where 0 ≤ i < X, 0 ≤ j < Y, 0 ≤ k < Z. Now another X x Y x Z matrix B is defined from A such that the (i, j, k) element of B is the sum of all the the numbers in A in the cuboid defined by the (0, 0, 0) and (i, j, k) elements as the diagon... | {
"input": [],
"output": []
} | {
"input": [
"2\n3 1 1\n1 \n8 \n22 \n1 2 3\n0 9 13 \n18 45 51"
],
"output": [
"1 \n7 \n14 \n0 9 4 \n18 18 2"
]
} | {
"input": [],
"output": []
} |
hunaby | Zucky has a frog Abby. Abby is very hungry and Zucky decides to feed it by playing a little game. Abby is a special frog which can jump as far as it wants but has a special pattern: He starts at the point 0.
In his first turn, he can make a jump of 1 unit. Now for all consequent turns, if the frog is currently at a dis... | {
"input": [],
"output": []
} | {
"input": [
"1\n1"
],
"output": [
"True"
]
} | {
"input": [],
"output": []
} |
1211_A. Three Problems | Polycarp is choosing three problems for creating a programming test. Totally he has n problems in his list. The complexity of the i-th problem equals r_i. All problems are numerated from 1 to n.
Help Polycarp to choose such three problems a, b and c, so that the complexity of the first problem strictly less than the c... | {
"input": [],
"output": []
} | {
"input": [
"6\n3 1 4 1 5 9\n",
"5\n1 1000000000 1 1000000000 1\n",
"9\n10 10 11 10 10 10 10 10 1\n"
],
"output": [
"\n4 1 3 ",
"\n-1 -1 -1\n",
"\n9 8 3 "
]
} | {
"input": [],
"output": []
} |
1252_J. Tiling Terrace | Talia has just bought an abandoned house in the outskirt of Jakarta. The house has a nice and long yard which can be represented as a one-dimensional grid containing 1 × N cells. To beautify the house, Talia is going to build a terrace on the yard by tiling the cells. Each cell on the yard contains either soil (represe... | {
"input": [],
"output": []
} | {
"input": [
"6 4 10 25 40\n..#...\n",
"6 4 10 100 40\n..#...\n",
"7 2 30 10 100\n..#...#\n"
],
"output": [
"\n75\n",
"\n210\n",
"\n160\n"
]
} | {
"input": [],
"output": []
} |
35_E. Parade | No Great Victory anniversary in Berland has ever passed without the war parade. This year is not an exception. That’s why the preparations are on in full strength. Tanks are building a line, artillery mounts are ready to fire, soldiers are marching on the main square... And the air forces general Mr. Generalov is in tr... | {
"input": [
"11\n12 0 5\n12 0 5\n12 0 5\n12 0 5\n12 0 5\n12 0 5\n12 0 5\n12 0 5\n12 0 5\n12 0 5\n10 100 1000\n",
"1\n31252541 -129298960 -129298947\n",
"5\n8 9 10\n10 8 10\n7 8 9\n8 -9 -5\n4 -5 -1\n",
"10\n4 8 9\n7 6 7\n6 -9 -8\n6 1 2\n6 6 7\n10 -9 -8\n5 -5 -4\n4 3 4\n2 -7 -6\n6 3 4\n",
"10\n33 -... | {
"input": [
"5\n3 -3 0\n2 -1 1\n4 2 4\n2 3 7\n3 6 8\n",
"2\n3 0 2\n4 1 3\n"
],
"output": [
"14\n-3 0\n-3 3\n0 3\n0 2\n1 2\n1 0\n2 0\n2 4\n4 4\n4 2\n6 2\n6 3\n8 3\n8 0\n",
"6\n0 0\n0 3\n1 3\n1 4\n3 4\n3 0\n"
]
} | {
"input": [],
"output": []
} |
690_E1. Photographs (I) | The Human-Cow Confederation (HC2), led by Heidi, has built a base where people and cows can hide, guarded from zombie attacks. The entrance to the base is protected by an automated gate which performs a kind of a Turing test: it shows the entering creature a photograph and asks them whether the top and bottom halves of... | {
"input": [],
"output": []
} | {
"input": [],
"output": []
} | {
"input": [],
"output": []
} |
cdva1606 | Nanu, a Clash of Clans player is so much obsessed with the game and its new update.
She wants to win as much battles as she can. Each of the enemy clan has N troops of lowercase letters.
And for the attack she takes an army of length M.
In the new update win is given when first k troops she takes, can kill any of the k... | {
"input": [],
"output": []
} | {
"input": [
"2\n5 2 2\nabcab\nab\n5 2 1\nabccc\ncc"
],
"output": [
"2\n3"
]
} | {
"input": [],
"output": []
} |
iiti00 | Freakin' news has recently claimed that they have discovered a civilization on mars and that they have established contact with the martians. Following is a summary of the dawn hour breakin' news on freakin' news :
Occassionally, the martian ministers feel the need to please their king. For this purpose, they give th... | {
"input": [],
"output": []
} | {
"input": [
"2 0 \n-2 5",
"2 1 \n-4 -4"
],
"output": [
"-3",
"0"
]
} | {
"input": [],
"output": []
} |
1297_I. Falling Blocks | Recently, Polycarp has invented a new mobile game with falling blocks.
In the game, n blocks are falling down, one at a time, towards a flat surface with length d units. Each block can be represented as a rectangle with coordinates from l_i to r_i and unit height, dropped downwards from very high up. A block falls unt... | {
"input": [],
"output": []
} | {
"input": [
"3 3\n1 2\n2 3\n1 3\n",
"8 6\n1 2\n3 3\n2 3\n1 3\n2 4\n3 6\n1 5\n1 5\n"
],
"output": [
"\n1\n2\n1\n",
"\n1\n2\n3\n1\n2\n3\n4\n4\n"
]
} | {
"input": [],
"output": []
} |
1382_D. Unmerge | Let a and b be two arrays of lengths n and m, respectively, with no elements in common. We can define a new array merge(a,b) of length n+m recursively as follows:
* If one of the arrays is empty, the result is the other array. That is, merge(∅,b)=b and merge(a,∅)=a. In particular, merge(∅,∅)=∅.
* If both arrays a... | {
"input": [
"1\n9\n2 1 4 3 7 6 5 10 9 8 13 12 11 18 17 16 15 14\n",
"1\n16\n27 1 28 2 29 3 4 5 6 7 30 8 9 10 11 12 13 31 14 15 16 17 18 19 32 20 21 22 23 24 25 26\n"
],
"output": [
"YES\n",
"YES\n"
]
} | {
"input": [
"6\n2\n2 3 1 4\n2\n3 1 2 4\n4\n3 2 6 1 5 7 8 4\n3\n1 2 3 4 5 6\n4\n6 1 3 7 4 5 8 2\n6\n4 3 2 5 1 11 9 12 8 6 10 7\n"
],
"output": [
"YES\nNO\nYES\nYES\nNO\nNO\n"
]
} | {
"input": [],
"output": []
} |
1403_B. Spring cleaning | Spring cleanings are probably the most boring parts of our lives, except this year, when Flóra and her mother found a dusty old tree graph under the carpet.
This tree has N nodes (numbered from 1 to N), connected by N-1 edges. The edges gathered too much dust, so Flóra's mom decided to clean them.
Cleaning the edges... | {
"input": [],
"output": []
} | {
"input": [
"7 3\n1 2\n2 4\n4 5\n5 6\n5 7\n3 4\n1 4\n2 2 4\n1 1\n"
],
"output": [
"\n-1\n10\n8\n"
]
} | {
"input": [],
"output": []
} |
property-of-circle | You are given two circles C1 & C2 (centers , and radii are given), if area of circle-1 is A1 and that of circle-2 is A2 , you have to find whether area of union of these circle is the larger circle and area of intersection of these circle is smaller circle simultaneously , otherwise print "NOT SATISFIED".
Input
firs... | {
"input": [],
"output": []
} | {
"input": [
"4 \n0 0 1 \n0 0 2 \n1 2 2 \n2 2 2\n2 3 5\n3 3 1\n1 1 1\n1 1 1\n\nSAMPLE"
],
"output": [
"C2CC1\nNOT SATISFIED\nC1CC2\nC2~C1"
]
} | {
"input": [],
"output": []
} |
p00587 Binary Tree Intersection And Union | Given two binary trees, we consider the “intersection” and “union” of them. Here, we distinguish the left and right child of a node when it has only one child. The definitions of them are very simple. First of all, draw a complete binary tree (a tree whose nodes have either 0 or 2 children and leaves have the same dept... | {
"input": [],
"output": []
} | {
"input": [
"i ((,),(,)) ((,(,)),)\nu ((,),(,)) ((,(,)),)"
],
"output": [
"((,),)\n((,(,)),(,))"
]
} | {
"input": [],
"output": []
} |
p01266 Robot Communication | In the year 21xx, human beings are proliferating across the galaxy. Since the end of the last century, thousands of pioneer spaceships have been launched in order to discover new habitation planets.
The Presitener is one of those spaceships, heading toward the Andromeda galaxy. After a long, long cruise in the hypersp... | {
"input": [],
"output": []
} | {
"input": [
"4 2\n2 0 0 1\n0 4 1 0\n4 6 0 -1\n6 2 -1 0\n4 6\n2 0 0 1\n0 4 1 0\n4 6 0 -1\n6 2 -1 0\n0 0"
],
"output": [
"6.00000000\n4.24264069"
]
} | {
"input": [],
"output": []
} |
p01582 Cover Time | Let G be a connected undirected graph where N vertices of G are labeled by numbers from 1 to N. G is simple, i.e. G has no self loops or parallel edges.
Let P be a particle walking on vertices of G. At the beginning, P is on the vertex 1. In each step, P moves to one of the adjacent vertices. When there are multiple a... | {
"input": [],
"output": []
} | {
"input": [
""
],
"output": [
""
]
} | {
"input": [],
"output": []
} |
graysc | The Gray code (see wikipedia for more details) is a well-known concept.
One of its important properties is that every two adjacent numbers have exactly one different digit in their binary representation.
In this problem, we will give you n non-negative integers in a sequence A[1..n] (0<=A[i]<2^64), such that every tw... | {
"input": [],
"output": []
} | {
"input": [
"5\n1 0 2 3 7"
],
"output": [
"Yes"
]
} | {
"input": [],
"output": []
} |
802_E. Marmots (medium) | Good job! Now that Heidi is able to distinguish between Poisson and uniform distributions, she is in a good position to actually estimate the populations.
Can you help Heidi estimate each village's population?
Input
Same as the easy version.
Output
Output one line per village, in the same order as provided in the ... | {
"input": [],
"output": []
} | {
"input": [],
"output": []
} | {
"input": [],
"output": []
} |
drunk-man | A drunk person was moving from one point on the street to another point on the same street. His starting point was between two manholes on that street. He was following a systematic scheme of his movement and had a fix movement repeated after an interval of time. How much time will he take to fall in the manhole and in... | {
"input": [
"2\nF 10 15 2 3 1\nB 6 1 4 2 3"
],
"output": [
"B75\nB3"
]
} | {
"input": [
"4\nF 10 10 4 3 1\nB 10 10 3 4 2\nF 15 10 3 5 4\nF 19 12 3 3 2\n\nSAMPLE"
],
"output": [
"F46\nB92\nB160\nSURVIVED"
]
} | {
"input": [],
"output": []
} |
52_C. Circular RMQ | You are given circular array a0, a1, ..., an - 1. There are two types of operations with it:
* inc(lf, rg, v) — this operation increases each element on the segment [lf, rg] (inclusively) by v;
* rmq(lf, rg) — this operation returns minimal value on the segment [lf, rg] (inclusively).
Assume segments to be c... | {
"input": [
"2\n-1 -1\n10\n0 0\n0 0\n0 0 1\n0 0\n1 1\n0 0 -1\n0 0 0\n0 0 1\n1 1 0\n0 0 -1\n",
"1\n-1\n10\n0 0 -1\n0 0\n0 0 1\n0 0\n0 0 1\n0 0\n0 0 0\n0 0\n0 0 -1\n0 0 1\n",
"1\n1\n1\n0 0 0\n"
],
"output": [
"-1\n-1\n0\n-1\n",
"-2\n-1\n0\n0\n",
""
]
} | {
"input": [
"4\n1 2 3 4\n4\n3 0\n3 0 -1\n0 1\n2 1\n"
],
"output": [
"1\n0\n0\n"
]
} | {
"input": [],
"output": []
} |
64_H. Table Bowling | Table bowling tournament participant completed the competition according to the given final standings table. The table is given as a sequence of lines, each line has a format "name score". Your task is to prepare another table consisting of lines in the form "place name". Sort participant by score (desc.) and by the na... | {
"input": [],
"output": []
} | {
"input": [
"5\nvasya 10\nted 11\npetya 10\nkatya 33\nmike 44\n",
"3\na 1\nb 13\nc 1\n"
],
"output": [
"1 mike\n2 katya\n3 ted\n4-5 petya\n4-5 vasya\n",
"1 b\n2-3 a\n2-3 c\n"
]
} | {
"input": [],
"output": []
} |
raju-and-his-girlfriend | Raju has a very pretty girlfriend. He chats with her all day and night through his phone. His phone lacks a QWERTY keypad, instead it has a T9 keypad.
This takes a lot of time to type a message in his phone and he often fears that his girlfriend might get angry if he doesn't reply on time. So he sets a time limit to t... | {
"input": [],
"output": []
} | {
"input": [
"2\n1 1 15\nilu\n1 1 10\nilu\n\nSAMPLE"
],
"output": [
"ilu\nil"
]
} | {
"input": [],
"output": []
} |
submat | Problem description.
A matrix of dimension mxn containing only 0's and 1's as it elements is given.Determine the maximum possible sub-square matrix containing only 1's as its elements
Input
Input description.
The first line of input contains an integer T,denoting the number of test cases
First line of each test cas... | {
"input": [],
"output": []
} | {
"input": [
"3\n3 3 \n1 0 0\n0 1 0\n0 0 1\n3 3\n0 0 0\n0 0 0\n0 0 0\n4 5\n1 0 0 0 0\n1 0 1 1 0\n0 1 1 1 1\n0 1 0 0 0"
],
"output": [
"1\n0\n2"
]
} | {
"input": [],
"output": []
} |
100_F. Polynom | You are given a polynom in form p(x) = (x + a1)·(x + a2)·... (x + an). Write Pike program to print it in a standard form p(x) = xn + b1xn - 1 + ... + bn - 1x + bn. You should write each addend in form «C*X^K» (for example, 5*X^8).
Please, write the polynom in the shortest way, so you should skip unnecessary terms: som... | {
"input": [],
"output": []
} | {
"input": [
"2\n-1\n1\n",
"2\n1\n1\n"
],
"output": [
"X^2-1\n",
"X^2+2*X+1\n"
]
} | {
"input": [],
"output": []
} |
111_A. Petya and Inequiations | Little Petya loves inequations. Help him find n positive integers a1, a2, ..., an, such that the following two conditions are satisfied:
* a12 + a22 + ... + an2 ≥ x
* a1 + a2 + ... + an ≤ y
Input
The first line contains three space-separated integers n, x and y (1 ≤ n ≤ 105, 1 ≤ x ≤ 1012, 1 ≤ y ≤ 106).
Please d... | {
"input": [
"99976 664640815001 915230\n",
"7 937519681542 968262\n",
"100000 1 1\n",
"99999 681508136225 925533\n",
"100000 1000000000000 1000000\n",
"1 1 1\n",
"10 3 8\n",
"1 860113420929 927423\n",
"4 324 77\n",
"5 37 10\n",
"6 225 59\n",
"31000 819461299082 936240\... | {
"input": [
"5 15 15\n",
"1 99 11\n",
"2 3 2\n"
],
"output": [
"1\n1\n1\n1\n11\n",
"11\n",
"-1\n"
]
} | {
"input": [],
"output": []
} |
130_A. Hexagonal numbers | Hexagonal numbers are figurate numbers which can be calculated using the formula hn = 2n2 - n. You are given n; calculate n-th hexagonal number.
Input
The only line of input contains an integer n (1 ≤ n ≤ 100).
Output
Output the n-th hexagonal number.
Examples
Input
2
Output
6
Input
5
Output
45 | {
"input": [],
"output": []
} | {
"input": [
"2\n",
"5\n"
],
"output": [
"6\n",
"45\n"
]
} | {
"input": [],
"output": []
} |
683_C. Symmetric Difference | You are given two sets of numbers. Your task is to print all numbers from the sets, that both sets don't contain simultaneously.
Input
The first line contains the description of the first set, the second line contains the description of the second set. Each description begins with the number of elements in this set. ... | {
"input": [],
"output": []
} | {
"input": [
"3 1 2 3\n3 2 3 4\n",
"5 1 4 8 9 10\n4 1 2 8 10\n"
],
"output": [
"2 1 4",
"3 2 4 9"
]
} | {
"input": [],
"output": []
} |
pandaland-and-strings | Pandaland is a place full of strings. One day Panda visited Pandaland and get confused wether Pandaland is a lucky place or not. According to Panda a place is lucky if all the strings in that place follows the following property 'P' : -
P:A place is lucky if, for any string S, the prefix of S should not be present in ... | {
"input": [
"7\n83\nlrbbmqbhcdarzowkkyhiddqscdxrjmowfrxsjybldbefsarcbynecdyggxxpklorellnmpapqfwkhopkmcoqhn\nnkuewhsqmgbbuqcljjivswmdkqtbxixmvtrrbljptnsnfwzqfjmafa\nrrwsofsbcnuvqhffbsaqxwpqcaceh\nhzvfrkmlnozjkpqpxrjxkitzyxacbhhkicqcoendtomfgdwdwfcgpxiq\nkuytdlcgdewhtaciohordtqkvwcsgspqoqmsboaguwnnyqxnzlgdgwpbtrwb... | {
"input": [
"1\n3\npan\npanda\nlucky\n\nSAMPLE"
],
"output": [
"NO"
]
} | {
"input": [],
"output": []
} |
p02592 AtCoder Grand Contest 047 - Product Simulation | This is an output-only problem. You shouldn't read anything from the input.
In short, your task is to simulate multiplication by using only comparison (x < y) and addition (x + y). There is no input in this problem, you just print a sequence of operations.
Imagine that there is a big array a[0], a[1], ..., a[N-1] of ... | {
"input": [],
"output": []
} | {
"input": [
""
],
"output": [
""
]
} | {
"input": [],
"output": []
} |
chefsqua | Chef loves squares! You are given N points with integers coordinates, Chef asks you to find out how many points he should add to these set of N points, so that one could create at least one square having its vertices from the points of the resulting set. Note that the square created need not to be parallel to the axis.... | {
"input": [],
"output": []
} | {
"input": [
"5\n0 0\n100 100\n200 200\n100 0\n0 100",
"3\n0 0\n2 2\n3 3"
],
"output": [
"0",
"2"
]
} | {
"input": [],
"output": []
} |
drctnsrm | Problem description.
Sumit is enjoying his vacations alone in a 2D world (yes, he knows magic), until his GPS tracker stopped working. The great thing about his GPS tracker is that it sends the direction of his traveled path from the starting of his adventure to his best friend. Being his best friend, find Sumit's dire... | {
"input": [],
"output": []
} | {
"input": [
"3\nNEW\nNNSSE\nNE"
],
"output": [
"NORTH\nEAST\nNORTHEAST"
]
} | {
"input": [],
"output": []
} |
1302_A. Nash equilibrium | This is an unusual problem in an unusual contest, here is the announcement: [http://codeforces.com/blog/entry/73543](//codeforces.com/blog/entry/73543)
You are given a table A of integers n × m. The cell (x, y) is called Nash equilibrium if both of the following conditions hold:
* for each x_1 ≠ x A_{xy} > A_{x_1y... | {
"input": [],
"output": []
} | {
"input": [
"4 4\n1 2 3 4\n1 2 3 5\n1 2 3 6\n2 3 5 7\n",
"3 5\n7 7 7 7 7\n7 7 7 7 7\n7 7 7 7 7\n"
],
"output": [
"\n1 4\n",
"\n0 0\n"
]
} | {
"input": [],
"output": []
} |
1428_H. Rotary Laser Lock | This is an interactive problem.
To prevent the mischievous rabbits from freely roaming around the zoo, Zookeeper has set up a special lock for the rabbit enclosure. This lock is called the Rotary Laser Lock.
The lock consists of n concentric rings numbered from 0 to n-1. The innermost ring is ring 0 and the outermos... | {
"input": [
"2 2\n0\n",
"3 4\n1 7\n",
"2 20\n24\n"
],
"output": [
"10\n",
"32\n",
"48\n"
]
} | {
"input": [],
"output": []
} | {
"input": [],
"output": []
} |
530_H. Points in triangle | You are given a set of points on a plane with positive integer coordinates. Find a triangle of minimum area with vertices in points (0, 0), (A, 0) and (0, B) (A and B are unknown positive integers) that contains all the given points inside it (points on the edges count towards being inside).
Input
The first line of t... | {
"input": [],
"output": []
} | {
"input": [
"2\n1 1\n1 3\n",
"2\n2 1\n1 2\n"
],
"output": [
"6.0\n",
"4.5\n"
]
} | {
"input": [],
"output": []
} |
605_A. Sorting Railway Cars | An infinitely long railway has a train consisting of n cars, numbered from 1 to n (the numbers of all the cars are distinct) and positioned in arbitrary order. David Blaine wants to sort the railway cars in the order of increasing numbers. In one move he can make one of the cars disappear from its place and teleport it... | {
"input": [
"7\n1 3 5 7 2 4 6\n",
"7\n1 2 3 6 7 4 5\n",
"50\n1 2 3 4 5 6 7 8 43 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 50 33 34 35 36 37 38 39 40 41 42 9 44 45 46 47 48 49 32\n",
"50\n10 37 3 46 45 29 36 13 21 25 35 5 18 33 12 19 50 16 30 47 20 42 39 28 2 6 38 8 7 31 22 27 ... | {
"input": [
"5\n4 1 2 5 3\n",
"4\n4 1 3 2\n"
],
"output": [
"2\n",
"2\n"
]
} | {
"input": [],
"output": []
} |
interesting-path | On the way to Lanka, Ram and co encountered another interesting path. The path was laid with numbered rocks which were to be jumped over. The number denoted the maximum jump length that could be made by the person standing on that rock. For instance, if Ram was standing on a rock numbered 2, he could either make a jump... | {
"input": [
"5\n5\n2 3 1 1 4\n11\n1 3 5 8 9 2 6 7 6 8 9\n2\n1 1\n3\n1 2 3\n8\n1 5 2 1 6 3 4 8"
],
"output": [
"2\n3\n1\n2\n3"
]
} | {
"input": [
"2\n5\n2 3 1 1 4\n11\n1 3 5 8 9 2 6 7 6 8 9\n\nSAMPLE"
],
"output": [
"2\n3"
]
} | {
"input": [],
"output": []
} |
optimal-permutation | Miraya and her best Alice friend are now ending their studies and they are willing to work together in a software company, but before this Alice will be tested by the Miraya through the following procedure,
Miraya is obviously Computer Science person while her best friend belongs to Arts. However, as Miraya didn't want... | {
"input": [],
"output": []
} | {
"input": [
"2\n2\n7\n\nSAMPLE"
],
"output": [
"1\n23"
]
} | {
"input": [],
"output": []
} |
p00754 The Balance of the World | The Balance of the World
The world should be finely balanced. Positive vs. negative, light vs. shadow, and left vs. right brackets. Your mission is to write a program that judges whether a string is balanced with respect to brackets so that we can observe the balance of the world.
A string that will be given to the p... | {
"input": [],
"output": []
} | {
"input": [
""
],
"output": [
""
]
} | {
"input": [],
"output": []
} |
162_C. Prime factorization | You are given a positive integer n. Output its prime factorization.
If n = a1b1 a2b2 ... akbk (bi > 0), where ak are prime numbers, the output of your program should look as follows: a1*...*a1*a2*...*a2*...*ak*...*ak, where the factors are ordered in non-decreasing order, and each factor ai is printed bi times.
Input... | {
"input": [
"13\n"
],
"output": [
"13 \n"
]
} | {
"input": [
"245\n",
"19\n"
],
"output": [
"5*7*7\n",
"19\n"
]
} | {
"input": [],
"output": []
} |
253_C. Text Editor | Vasya is pressing the keys on the keyboard reluctantly, squeezing out his ideas on the classical epos depicted in Homer's Odysseus... How can he explain to his literature teacher that he isn't going to become a writer? In fact, he is going to become a programmer. So, he would take great pleasure in writing a program, b... | {
"input": [
"29\n56328 80183 27682 79083 60680 12286 34299 8015 51808 50756 82133 45930 43695 65863 25178 70825 2288 15111 39667 39637 11453 62821 81484 84216 54524 53749 8396 67712 76146\n13 10739 9 3622\n",
"18\n22746 9084 3942 1120 25391 25307 7409 1189 23473 26175 10964 13584 5541 500 24338 12272 15824 2... | {
"input": [
"3\n10 1 10\n1 10 1 1\n",
"4\n2 1 6 4\n3 4 4 2\n",
"4\n10 5 6 4\n1 11 4 2\n"
],
"output": [
"3\n",
"3\n",
"6\n"
]
} | {
"input": [],
"output": []
} |
p02077 Bombing | Problem Statement
JAG land is a country, which is represented as an $M \times M$ grid. Its top-left cell is $(1, 1)$ and its bottom-right cell is $(M, M)$.
Suddenly, a bomber invaded JAG land and dropped bombs to the country. Its bombing pattern is always fixed and represented by an $N \times N$ grid. Each symbol in ... | {
"input": [],
"output": []
} | {
"input": [
""
],
"output": [
""
]
} | {
"input": [],
"output": []
} |
tcfst07 | Consider a sequence of non- negative integers b(1), b(2) … , b(n) of length n. The given sequence is called a winning sequence if and only if there exists integers p and q between 1 and n (both inclusive) such that a(p) xor a(p+1) xor a(p+2) …. xor a(q) = 0. The xor operation is the bitwise xor operation between two in... | {
"input": [],
"output": []
} | {
"input": [
"3 2"
],
"output": [
"6"
]
} | {
"input": [],
"output": []
} |
153_B. Binary notation | You are given a positive integer n. Output its binary notation.
Input
The only line of input data contains an integer n (1 ≤ n ≤ 106).
Output
Output the binary notation of n (without any leading zeros).
Examples
Input
5
Output
101
Input
13
Output
1101
Note
In the first example 5 = 1 * 22 + 0 * 21 + 1 ... | {
"input": [
"126\n",
"101\n"
],
"output": [
"1111110\n",
"1100101\n"
]
} | {
"input": [
"5\n",
"13\n"
],
"output": [
"101\n",
"1101\n"
]
} | {
"input": [],
"output": []
} |
188_A. Hexagonal Numbers | Hexagonal numbers are figurate numbers which can be calculated using the formula hn = 2n2 - n. You are given n; calculate n-th hexagonal number.
Input
The only line of input contains an integer n (1 ≤ n ≤ 100).
Output
Output the n-th hexagonal number.
Examples
Input
3
Output
15
Input
6
Output
66 | {
"input": [],
"output": []
} | {
"input": [
"3\n",
"6\n"
],
"output": [
"15\n",
"66\n"
]
} | {
"input": [],
"output": []
} |
661_H. Rotate Matrix | You are given a square matrix of integer numbers. Rotate it 90 degrees clockwise (see examples for clarification of rotation).
Input
The input consists of n lines (1 ≤ n ≤ 10, n is not given explicitly). Each of the lines contains n space-separated integers; j-th integer in i-th line corresponds to matrix element mij... | {
"input": [],
"output": []
} | {
"input": [
"1 2 3\n4 5 6\n7 8 9\n",
"1 2 3 4\n5 6 7 8\n9 10 11 12\n13 14 15 16\n"
],
"output": [
"7 4 1\n8 5 2\n9 6 3\n",
"13 9 5 1\n14 10 6 2\n15 11 7 3\n16 12 8 4\n"
]
} | {
"input": [],
"output": []
} |
chamber-of-secrets | Its time for the Potions class. Harry absolutely HATES potions because he has to face mockery by the potions teacher Snape everytime he has a potions class. Snape never leaves any chance of insulting him in front of everyone.
Snape is not in a good mood today, which is not good for Harry. Snape challenges Harry to an... | {
"input": [
"1\n10 12\n5 18 4 7 86 3 13 4 22 21\n1 1 0 0\n1 5 0 0\n1 10 0 0\n1 1 0 9\n1 5 0 5 \n1 5 0 2\n5 1 0 0\n5 5 0 0\n5 10 0 0\n5 1 0 9\n5 5 0 5 \n5 5 0 2",
"5\n10 10\n32 32 54 12 52 56 8 30 44 94 \n60 3 3 3\n27 4 0 3\n69 3 0 3\n31 8 0 2\n36 3 3 5\n59 10 0 0\n57 10 0 0\n74 2 7 8\n38 2 2 8\n71 9 0 1\n10 ... | {
"input": [
"1\n5 2\n2 1 4 7 2\n1 1 0 2\n1 5 0 0\n\nSAMPLE"
],
"output": [
"16\n2"
]
} | {
"input": [],
"output": []
} |
roy-and-sweets | Its Diwali time and Little Roy's family is having a lot of guests. Guests come in families. Each guest family has M members. Roy's task is to serve sweets to them. Roy has N different sweets and each sweet has some specific sweetness level S and quantity Q.
Each guest family will give R rupees (as a token of gratitude... | {
"input": [],
"output": []
} | {
"input": [
"5\n5 8\n3 6\n10 7\n4 6\n2 5\n2\n5\n8\n\nSAMPLE"
],
"output": [
"100"
]
} | {
"input": [],
"output": []
} |
530_F. Jumping frogs | A rectangular swamp is inhabited by 10 species of frogs. Frogs of species i can jump from hillocks to hillock exactly i units along X-axis or Y-axis. Initially frogs of all types sit at the hillock at coordinates (0, 0). You are given coordinates of all other hillocks in the swamp. Find the largest Manhattan distance f... | {
"input": [],
"output": []
} | {
"input": [
"3\n0 1\n0 -2\n0 3\n",
"5\n0 1\n0 2\n0 3\n2 2\n2 4\n",
"1\n18 0\n"
],
"output": [
"3\n",
"6\n",
"0\n"
]
} | {
"input": [],
"output": []
} |
random-shuffle | In computer Science there is common need to generate random permutation. It can be seen as the shuffle of the numbers. Start with sorted permutation of n, at each step select the random no between 1 to n and put it at front. after doing n steps you can write shuffle sequence like {p1,p2,p3 ,...,pn} where at i th step ... | {
"input": [],
"output": []
} | {
"input": [
"1\n2\n\nSAMPLE"
],
"output": [
"2"
]
} | {
"input": [],
"output": []
} |
p00103 Baseball Simulation | Ichiro likes baseball and has decided to write a program which simulates baseball.
The program reads events in an inning and prints score in that inning. There are only three events as follows:
Single hit
* put a runner on the first base.
* the runner in the first base advances to the second base and the runner in t... | {
"input": [],
"output": []
} | {
"input": [
"2\nHIT\nOUT\nHOMERUN\nHIT\nHIT\nHOMERUN\nHIT\nOUT\nHIT\nHIT\nHIT\nHIT\nOUT\nHIT\nHIT\nOUT\nHIT\nOUT\nOUT"
],
"output": [
"7\n0"
]
} | {
"input": [],
"output": []
} |
cbars | A few days ago Chef decided to cook a new dish – chocolate. This must be something amazing. The idea is that chocolate bar will be divided into cells. It must be long, but narrow. To interest customers every bar must be unique. Bar will consist of cells of black or white chocolate. In addition every bar must be good l... | {
"input": [],
"output": []
} | {
"input": [
"2 2",
"3 3"
],
"output": [
"14",
"322"
]
} | {
"input": [],
"output": []
} |
cseq | Given three positive integers N, L and R, find the number of non-decreasing sequences of size at least 1 and at most N, such that each element of the sequence lies between L and R, both inclusive.
Print the answer modulo 10^6+3.
Input
First line of input contains T, the number of the test cases.
Each of next T lines... | {
"input": [],
"output": []
} | {
"input": [
"2\n1 4 5\n2 4 5"
],
"output": [
"2\n5"
]
} | {
"input": [],
"output": []
} |
1252_B. Cleaning Robots | The new ICPC town has N junctions (numbered from 1 to N) which are connected by N-1 roads. It is possible from one junction to go to any other junctions by going through one or more roads. To make sure all the junctions are well-maintained, the government environment agency is planning to deploy their newest advanced c... | {
"input": [],
"output": []
} | {
"input": [
"6\n1 3\n2 3\n3 4\n4 5\n4 6\n",
"5\n1 2\n2 3\n2 4\n4 5\n"
],
"output": [
"\n5\n",
"\n3\n"
]
} | {
"input": [],
"output": []
} |
dummy3 | Now after having the event list, all the participants wanted to know where to go for their respective events, for this purpose they are given a piece of paper with an n x n grid of numbers printed on it. They are told that their event would be held in a room denoted by the number which they get on finding the minimum p... | {
"input": [
"100\n921 884 423 93 887 553 723 325 991 129 1 951 554 715 515 903 717 353 945 651 181 997 912 981 778 240 532 569 312 258 843 418 895 130 326 572 215 44 25 108 802 880 985 76 363 322 784 922 675 965 986 948 397 838 218 529 342 394 404 120 467 301 426 598 811 279 84 75 147 857 787 164 921 134 842 590... | {
"input": [],
"output": []
} | {
"input": [],
"output": []
} |
problem-1-46 | Karan and Akshay love challenging each other with awesome algorithmic questions. Today, Karan decided to give Akshay a relatively easy question. Karan has string s of length N consisting entirely of lowercase latin characters and he loves double palindromes (defined below). So he asks Akshay Q questions about the strin... | {
"input": [],
"output": []
} | {
"input": [
"8\nabcdabcd\n2\n1 8\n3 5\n\nSAMPLE"
],
"output": [
"YES\nNO"
]
} | {
"input": [],
"output": []
} |
316_F1. Suns and Rays | Smart Beaver became interested in drawing. He draws suns. However, at some point, Smart Beaver realized that simply drawing suns is boring. So he decided to design a program that will process his drawings. You are given a picture drawn by the beaver. It will have two colors: one for the background and one for the suns ... | {
"input": [],
"output": []
} | {
"input": [],
"output": []
} | {
"input": [],
"output": []
} |
pythagorean-triplets-15 | Pythagorean triplet (a,b,c) satisfies:
You will be given an integer N. You have to count how many triplets a,b,c exist such that
1 ≤ a ≤ b ≤ c ≤ N.
Input:
First line contains T, the number of testcases. Each testcase consists of only one integer in one line.
Output:
For each testcase, print the required answ... | {
"input": [
"100\n1560\n2173\n711\n2318\n1379\n972\n4300\n7767\n7760\n8145\n9804\n6411\n9504\n7712\n31\n2854\n3316\n2336\n1977\n132\n7800\n1285\n7018\n1418\n7730\n9908\n6396\n2712\n4660\n7547\n9308\n2572\n6072\n19\n4890\n7451\n991\n5543\n1571\n8751\n3688\n1375\n5162\n9544\n5440\n1545\n8751\n8756\n3881\n728\n8888... | {
"input": [
"2\n5\n10\n\nSAMPLE"
],
"output": [
"1\n2"
]
} | {
"input": [],
"output": []
} |
shil-and-crazy-operation | Shil likes to perform Crazy Operation on an array A1,A2,...AN.
Given an array A1,A2,...AN and permutation P1,P2, ..,PN, a Crazy Operation consists of two parts:
Perform Operation Bi = Ai for every i in 1..N
Perform Operation Ai = BPi for every i in 1..N. Here P is a permutation from 1 to N.
Shil asks you to prin... | {
"input": [
"100 10000\n8128 2748 29043 28282 11092 17066 5611 1933 2794 26806 1433 586 28572 9508 21764 14637 16839 5996 23569 16792 10767 19250 10020 10350 11171 31096 904 23773 13250 27155 11025 15739 17023 2395 21247 31637 4289 1575 8742 18627 22413 3065 21068 704 7304 28021 211 20857 10167 21272 29336 27492... | {
"input": [
"5 3\n1 2 3 4 5\n3 4 5 2 1\n\nSAMPLE"
],
"output": [
"1 4 3 2 5"
]
} | {
"input": [],
"output": []
} |
p01590 Trading Ship | You are on board a trading ship as a crew.
The ship is now going to pass through a strait notorious for many pirates often robbing ships. The Maritime Police has attempted to expel those pirates many times, but failed their attempts as the pirates are fairly strong. For this reason, every ship passing through the stra... | {
"input": [],
"output": []
} | {
"input": [
""
],
"output": [
""
]
} | {
"input": [],
"output": []
} |
detdet | Consider a k x k matrix M with entries as the following:
M(i, i) = 1 (Diagonal is all 1s)
M(i, i+1) = 1 (Diagonal just above the main diagonal is all 1s)
M(i, i-1) = -1 (Diagonal just below the main diagonal is all -1s)
All the other elements of M are 0
Example for k = 4 would be:
1 1 0 0
-1 1 1 0
0 -1 1 1
0 0 -1 ... | {
"input": [],
"output": []
} | {
"input": [
"5\n1\n2\n3\n4\n5"
],
"output": [
"1\n3\n5\n8\n13"
]
} | {
"input": [],
"output": []
} |
iitk2p01 | Nowadays out little Chef is traveling a lot. While traveling, on one unlucky day, he lost into a mysterious country. Nearby people handed little Chef to the King for investigations. After proper investigation they found little Chef innocent. Little Chef had no money with him to return to his country Byteland, so the Ki... | {
"input": [],
"output": []
} | {
"input": [
"2\n12 2\n18 3"
],
"output": [
"2\n2"
]
} | {
"input": [],
"output": []
} |
316_F2. Suns and Rays | Smart Beaver became interested in drawing. He draws suns. However, at some point, Smart Beaver realized that simply drawing suns is boring. So he decided to design a program that will process his drawings. You are given a picture drawn by the beaver. It will have two colors: one for the background and one for the suns ... | {
"input": [],
"output": []
} | {
"input": [],
"output": []
} | {
"input": [],
"output": []
} |
697_B. Barnicle | Barney is standing in a bar and starring at a pretty girl. He wants to shoot her with his heart arrow but he needs to know the distance between him and the girl to make his shot accurate.
<image>
Barney asked the bar tender Carl about this distance value, but Carl was so busy talking to the customers so he wrote the ... | {
"input": [
"4.6329496401734172195e50\n",
"8.1089882894234341219420177467603732503076124872188628349726911362800974096687340341040683238197289136e31\n",
"8.25983e5\n",
"7.0e100\n",
"2.0629094807595491132306264747042243928486303384791951220362096240931158821630792563855724946791054152e85\n",
"... | {
"input": [
"8.549e3\n",
"0.33e0\n",
"8.549e2\n"
],
"output": [
"8549\n",
"0.33\n",
"854.9\n"
]
} | {
"input": [],
"output": []
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.