info stringlengths 120 50k | question stringlengths 504 10.4k | avg@8_qwen3_4b_instruct_2507 float64 0 0.88 |
|---|---|---|
{"tests": "{\"inputs\": [\"3 2\\n1 2\\n420 421\\n420420 420421\\n\", \"3 5\\n1 4\\n2 3\\n11 14\\n\", \"6 7\\n8 13\\n14 14\\n8 13\\n14 14\\n8 13\\n14 14\\n\", \"9 41\\n40 42\\n42 44\\n44 46\\n82 84\\n82 83\\n80 83\\n40 83\\n40 82\\n42 82\\n\", \"3 5\\n99535 124440\\n24114 662840\\n529335 875935\\n\", \"6 7\\n984774 9848... | There are n sharks who grow flowers for Wet Shark. They are all sitting around the table, such that sharks i and i + 1 are neighbours for all i from 1 to n - 1. Sharks n and 1 are neighbours too.
Each shark will grow some number of flowers si. For i-th shark value si is random integer equiprobably chosen in range from... | 0.625 |
{"tests": "{\"inputs\": [\"10 5 3\\n\", \"10 5 7\\n\", \"10 5 12\\n\", \"17 15 18\\n\", \"984295813 427551190 84113823\\n\", \"8 5 10\\n\", \"100000000 10000000 100005000\\n\", \"757183104 590795077 709609355\\n\", \"100 3 7\\n\", \"13 12 15\\n\", \"10 5 14\\n\", \"4745 4574 4757\\n\", \"200000 10 200005\\n\", \"8 4 4\... | Arpa is researching the Mexican wave.
There are n spectators in the stadium, labeled from 1 to n. They start the Mexican wave at time 0.
* At time 1, the first spectator stands.
* At time 2, the second spectator stands.
* ...
* At time k, the k-th spectator stands.
* At time k + 1, the (k + 1)-th specta... | 0.375 |
{"tests": "{\"inputs\": [\"512 4\\n\", \"1000000000 9\\n\", \"900000000 16\\n\", \"131203 11\\n\", \"131203 9\\n\", \"999999999 50\\n\", \"909090909 50\\n\", \"999999999 49\\n\", \"2 1\\n\", \"5 2\\n\", \"1001 2\\n\", \"1747026028 16\\n\", \"102926 11\\n\", \"131203 5\\n\", \"999999999 54\\n\", \"2 0\\n\", \"9 2\\n\", ... | Little girl Tanya is learning how to decrease a number by one, but she does it wrong with a number consisting of two or more digits. Tanya subtracts one from a number by the following algorithm:
* if the last digit of the number is non-zero, she decreases the number by one;
* if the last digit of the number is ze... | 0.5 |
{"tests": "{\"inputs\": [\"1\\n6\\n291 292 295 297 298 299\\n\\nSAMPLE\", \"1\\n6\\n291 292 295 297 158 299\\n\\nSAMPLE\", \"1\\n6\\n559 292 295 297 158 299\\n\\nSAMPLE\", \"1\\n6\\n291 292 529 297 298 299\\n\\nSAMPLE\", \"1\\n6\\n559 292 295 297 158 115\\n\\nSAMPLE\", \"1\\n6\\n559 292 295 297 158 115\\n\\nPAMSLE\", \... | Today Oz is playing a new game. He has an array arr[] of N distinct integers . In each turn he is will follow two actions -
1) He select a random number from arr[]. Say value of this element is X.
2) He will remove X from arr[]. if X-1 is present in arr[] then he will remove it. if X+1 is present in arr[] then he will... | 0.5 |
{"tests": "{\"inputs\": [\"2\\n3 3\\n1 2\\n2 3\\n1 3\\n4 2\\n1 2\\n3 4\\n\\nSAMPLE\", \"2\\n3 3\\n1 2\\n2 3\\n1 3\\n4 2\\n1 2\\n3 4\", \"2\\n3 3\\n2 2\\n2 3\\n1 3\\n4 2\\n1 2\\n3 4\\n\\nSAMPLE\", \"2\\n3 3\\n1 2\\n2 3\\n1 3\\n8 2\\n1 2\\n3 3\", \"2\\n3 3\\n1 3\\n2 3\\n1 3\\n8 2\\n1 2\\n3 3\", \"2\\n3 3\\n1 3\\n2 3\\n1 ... | Professor Hatim is researching the sexual behavior of a rare species of lizard. He assumes that they feature two different genders and that they only interact with lizard of the opposite gender. Each lizard has a integer printed on their back.
Given the details of lizard interactions, decide whether the experiment sup... | 0 |
{"tests": "{\"inputs\": [\"5 4\\na a a a a a\\na a a a a a\\nb b b b b b\\nc c c c c c\\nd d d d d d\\nabcd\\n\\nSAMPLE\", \"9 9\\nd e b a e g\\nd a e f a e\\na b a e g c\\nb c b f b g\\ne a c e c a\\nf d b d a a\\nd d g f b b\\nb b b e e a\\nb c e a e g\\nddabefdbb\", \"10 7\\nf a b d g a\\nc g e f a g\\nf c c a c c\\... | Xenny had N cubes. Each cube had six faces and each face had a Latin character on each of it's sides.
Xenny's friend Asdoc had an interesting activity in mind. He gave Xenny a string S and asked him to use the cubes to form that string. Xenny being a very lazy person, just wanted to randomly roll the cubes and then ar... | 0.125 |
{"tests": "{\"inputs\": [\"2\", \"1\", \"4\", \"0\", \"3\", \"-1\", \"5\", \"-2\", \"-4\", \"-3\", \"8\", \"-5\", \"11\", \"-6\", \"6\", \"-7\", \"10\", \"-9\", \"13\", \"-16\", \"24\", \"-12\", \"31\", \"-13\", \"18\", \"9\", \"19\", \"16\", \"7\", \"17\", \"12\", \"20\", \"22\", \"15\", \"43\", \"-8\", \"33\", \"-11\... | Takahashi is going to set a 3-character password.
How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?
Constraints
* 1 \leq N \leq 9
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the number of possibl... | 0.75 |
{"tests": "{\"inputs\": [\"148\", \"57\", \"12\", \"112\", \"28\", \"21\", \"30\", \"224\", \"1\", \"295\", \"2\", \"56\", \"358\", \"3\", \"60\", \"133\", \"6\", \"67\", \"162\", \"8\", \"89\", \"190\", \"109\", \"171\", \"151\", \"294\", \"72\", \"375\", \"71\", \"65\", \"104\", \"33\", \"86\", \"51\", \"70\", \"85\"... | An integer X is called a Harshad number if X is divisible by f(X), where f(X) is the sum of the digits in X when written in base 10.
Given an integer N, determine whether it is a Harshad number.
Constraints
* 1?N?10^8
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output... | 0.75 |
{"tests": "{\"inputs\": [\"4\\n1 4\\n4 2\\n2 3\", \"7\\n3 6\\n1 2\\n3 1\\n7 4\\n5 7\\n1 4\", \"4\\n1 4\\n4 3\\n2 3\", \"7\\n3 6\\n2 2\\n3 1\\n7 4\\n5 7\\n1 4\", \"7\\n3 6\\n2 2\\n3 1\\n7 4\\n4 7\\n1 4\", \"7\\n3 6\\n1 2\\n3 2\\n7 4\\n5 7\\n1 4\", \"7\\n3 6\\n2 2\\n3 1\\n5 4\\n4 7\\n1 4\", \"4\\n1 2\\n4 2\\n2 3\", \"4\\... | Fennec and Snuke are playing a board game.
On the board, there are N cells numbered 1 through N, and N-1 roads, each connecting two cells. Cell a_i is adjacent to Cell b_i through the i-th road. Every cell can be reached from every other cell by repeatedly traveling to an adjacent cell. In terms of graph theory, the g... | 0.25 |
{"tests": "{\"inputs\": [\"3 10\\n6 4\\n4 2\\n3 2\", \"3 10\\n6 4\\n4 2\\n3 4\", \"3 10\\n6 4\\n10 2\\n3 1\", \"3 10\\n6 4\\n2 2\\n3 2\", \"3 4\\n6 4\\n5 2\\n3 4\", \"3 10\\n6 4\\n10 2\\n0 1\", \"3 10\\n6 7\\n11 2\\n2 1\", \"3 8\\n6 8\\n10 2\\n3 1\", \"3 10\\n2 4\\n4 4\\n3 4\", \"3 10\\n7 8\\n11 2\\n2 1\", \"1 10\\n5 4... | A project is underway to build a new viewing tower in Bange town called “Bange Hills Tower” whose selling point will be the gorgeous view of the entire main keep of Wakamatsu Castle from top to bottom. Therefore, the view line from the top of the tower must reach the bottom of the keep without being hindered by any of ... | 0 |
{"tests": "{\"inputs\": [\"3 4 3 1 4\\n3 1 2\\n1 2 10\\n2 3 30\\n3 4 20\\n2 4 4 2 1\\n3 1\\n2 3 3\\n1 3 3\\n4 1 2\\n4 2 5\\n2 4 3 4 1\\n5 5\\n1 2 10\\n2 3 10\\n3 4 10\\n1 2 0 1 2\\n1\\n8 5 10 1 5\\n2 7 1 8 4 5 6 3\\n1 2 5\\n2 3 4\\n3 4 7\\n4 5 3\\n1 3 25\\n2 4 23\\n3 5 22\\n1 4 45\\n2 5 51\\n1 5 99\\n0 0 0 0 0\", \"3 4... | Once upon a time, there was a traveler.
He plans to travel using stagecoaches (horse wagons). His starting point and destination are fixed, but he cannot determine his route. Your job in this problem is to write a program which determines the route for him.
There are several cities in the country, and a road network ... | 0 |
{"tests": "{\"inputs\": [\"5\\n5*57*\\n2\\n3 9\", \"15\\n2***9*2*6*1199*\\n9\\n0 1 2 3 4 6 7 8 9\", \"5\\n5*57*\\n2\\n3 5\", \"5\\n5*57*\\n2\\n6 9\", \"5\\n57*6*\\n2\\n5 2\", \"5\\n5*58*\\n2\\n3 5\", \"5\\n5*57*\\n2\\n0 5\", \"5\\n5*58*\\n2\\n3 7\", \"5\\n5*57*\\n2\\n6 3\", \"5\\n5*57*\\n2\\n0 2\", \"5\\n5*58*\\n2\\n6 ... | At University A, there were many mistakes in entering IDs.
Therefore, University A decided to issue a new ID to prevent typos.
There is a way to check if the new ID is correct to prevent typos.
・ Calculate the sum of all digits.
・ However, the number of even-numbered digits is doubled, with the rightmost digit as th... | 0 |
{"tests": "{\"inputs\": [\"3 1\\nRRL\\n5 5 1\\n3 1 10\", \"5 5\\nRLRLL\\n9 5 1 3 10\\n1 3 5\\n2 4 9\\n4 2 16\\n1 5 2\\n3 5 10\", \"3 1\\nRRL\\n5 5 1\\n3 1 3\", \"5 5\\nRLRLL\\n9 5 1 3 10\\n1 3 5\\n2 4 9\\n4 2 7\\n1 5 2\\n3 5 10\", \"5 5\\nRLRLL\\n9 5 1 3 10\\n1 4 5\\n2 4 9\\n2 2 7\\n1 5 2\\n3 5 10\", \"5 5\\nRLRLL\\n9 ... | Problem
Ghosts line up in a straight line from left to right with $ N $ people.
At first, the $ i $ th ghost from the left is facing left if $ U_i $ is'L', and facing right if it is'R'.
They are so timid that I don't want to see scary ghosts as much as possible.
You can instruct each ghost to look back.
It's scary t... | 0 |
{"tests": "{\"inputs\": [\"11\\n1 2 3 4 5 6 7 8 9 10 11\\n1\\n2 6 9\", \"11\\n1 2 3 4 5 6 7 8 18 10 11\\n1\\n2 6 9\", \"11\\n1 2 3 4 5 6 7 8 18 10 11\\n1\\n4 6 9\", \"11\\n1 2 3 4 5 6 7 5 18 10 11\\n1\\n4 6 9\", \"11\\n1 2 3 4 5 6 7 5 18 10 10\\n1\\n4 6 9\", \"11\\n1 2 3 4 5 9 7 5 18 10 10\\n1\\n4 6 9\", \"11\\n2 2 3 4... | Write a program which reads a sequence of integers $A = \\{a_0, a_1, ..., a_{n-1}\\}$ and rotate specified elements by a list of the following operation:
* rotate($b, m, e$): For each integer $k$ ($0 \leq k < (e - b)$), move element $b + k$ to the place of element $b + ((k + (e - m)) \mod (e - b))$.
Constraints
* $1... | 0 |
{"tests": "{\"inputs\": [\"3\\n1 1\\n1 4\\n2 5\\n\", \"1\\n370 123\\n\", \"1\\n371 123\\n\", \"1\\n123 370\\n\", \"1\\n123 371\\n\", \"1\\n99998 33332\\n\", \"1\\n33332 99998\\n\", \"1\\n390 123\\n\", \"1\\n123 124\\n\", \"3\\n1 1\\n1 4\\n3 5\\n\", \"1\\n163 123\\n\", \"1\\n123 149\\n\", \"3\\n1 1\\n1 4\\n3 1\\n\", \"1... | You are given two integers b and w. You have a chessboard of size 10^9 × 10^9 with the top left cell at (1; 1), the cell (1; 1) is painted white.
Your task is to find a connected component on this chessboard that contains exactly b black cells and exactly w white cells. Two cells are called connected if they share a s... | 0 |
{"tests": "{\"inputs\": [\"3\\n4 4\\n1 1 1 1\\n3 1\\n1 2 3\\n3 3\\n1 2 3\\n\", \"3\\n4 4\\n1 1 1 1\\n3 1\\n1 2 3\\n3 3\\n1 2 3\\n\", \"10\\n3 2\\n3 6 1\\n3 3\\n9 0 2\\n3 3\\n8 8 2\\n4 2\\n9 0 0 1\\n4 4\\n5 3 0 2\\n4 4\\n2 8 6 0\\n5 3\\n7 3 8 9 8\\n5 5\\n6 3 9 6 7\\n5 5\\n1 0 5 9 8\\n5 5\\n1 5 4 6 1\\n\", \"10\\n2 2\\n4... | Hanh lives in a shared apartment. There are n people (including Hanh) living there, each has a private fridge.
n fridges are secured by several steel chains. Each steel chain connects two different fridges and is protected by a digital lock. The owner of a fridge knows passcodes of all chains connected to it. A fridg... | 0 |
{"tests": "{\"inputs\": [\"3\\n\\n5 2\\n2 2\\n1 4\\n\\n3 2\\n2 1\\n2 3\\n\\n6 4\\n2 1\\n2 3\\n2 4\\n2 6\\n\", \"3\\n\\n5 2\\n2 2\\n1 4\\n\\n3 2\\n2 1\\n2 3\\n\\n6 4\\n2 1\\n1 3\\n2 4\\n2 6\\n\", \"3\\n\\n5 2\\n2 2\\n1 4\\n\\n3 2\\n2 2\\n2 3\\n\\n6 4\\n1 1\\n1 5\\n2 4\\n2 6\\n\", \"3\\n\\n5 2\\n2 3\\n1 4\\n\\n3 2\\n2 1\... | Every year Santa Claus gives gifts to all children. However, each country has its own traditions, and this process takes place in different ways. For example, in Berland you need to solve the New Year's puzzle.
Polycarp got the following problem: given a grid strip of size 2 × n, some cells of it are blocked. You need... | 0 |
{"tests": "{\"inputs\": [\"6 2\\n\\n2\\n\\n2\\n\\n1\\n\\n1\\n\\n0\\n\\n1\\n\\n0\", \"10000 4\\n1\\n1\\n2\\n1\\n\", \"00000 5\\n3\\n2\\n3\\n1\\n1\\n\", \"10 1\\n1\\n\", \"0000 4\\n4\\n2\\n2\\n1\\n\", \"10110 2\\n2\\n1\\n\", \"000 3\\n3\\n2\\n1\\n\", \"101 1\\n1\\n\", \"0011 2\\n1\\n1\\n\", \"101101 2\\n2\\n1\\n\", \"10 ... | This is an interactive problem.
This is a hard version of the problem. The difference from the easy version is that in the hard version 1 ≤ t ≤ min(n, 10^4) and the total number of queries is limited to 6 ⋅ 10^4.
Polycarp is playing a computer game. In this game, an array consisting of zeros and ones is hidden. Polyc... | 0 |
{"tests": "{\"inputs\": [\"0 2 0 1\\n\", \"0 2 1 1\\n\", \"0 2 0 4\\n\", \"637107829 -403198378 -2 -2\\n\", \"847094637 -152905363 -1000000000 -1000000000\\n\", \"2408736 -3517525 413342 557733\\n\", \"20 1 -5 -1\\n\", \"-186611 -745388 -776721 -308073\\n\", \"1234577 1234573 -3 3\\n\", \"0 10 -1 1\\n\", \"44789577 447... | The King of Flatland will organize a knights' tournament! The winner will get half the kingdom and the favor of the princess of legendary beauty and wisdom. The final test of the applicants' courage and strength will be a fencing tournament. The tournament is held by the following rules: the participants fight one on o... | 0 |
{"tests": "{\"inputs\": [\"3 3\\n1 2 1\\n2 3 1\\n3 1 1\\n\", \"3 2\\n1 2 3\\n2 3 4\\n\", \"2 10\\n1 2 9\\n1 2 9\\n2 1 9\\n1 2 8\\n2 1 9\\n1 2 9\\n1 2 9\\n1 2 11\\n1 2 9\\n1 2 9\\n\", \"4 4\\n1 3 1953\\n3 2 2844\\n1 3 2377\\n3 2 2037\\n\", \"2 1\\n2 2 44\\n\", \"4 8\\n1 2 4824\\n3 1 436\\n2 2 3087\\n2 4 2955\\n2 4 2676\... | You are given undirected weighted graph. Find the length of the shortest cycle which starts from the vertex 1 and passes throught all the edges at least once. Graph may contain multiply edges between a pair of vertices and loops (edges from the vertex to itself).
Input
The first line of the input contains two integer... | 0 |
{"tests": "{\"inputs\": [\"2\\n\", \"720\\n\", \"13\\n\", \"111111111\\n\", \"0\\n\", \"331\\n\", \"9\\n\", \"987654321\\n\", \"10\\n\", \"999999999\\n\", \"234567890\\n\", \"123456789\\n\", \"987\\n\", \"984218523\\n\", \"45165125\\n\", \"555\\n\", \"660\\n\", \"118\\n\", \"7\\n\", \"1\\n\", \"100000000\\n\", \"6\\n\"... | You know that Japan is the country with almost the largest 'electronic devices per person' ratio. So you might be quite surprised to find out that the primary school in Japan teaches to count using a Soroban — an abacus developed in Japan. This phenomenon has its reasons, of course, but we are not going to speak about ... | 0.375 |
{"tests": "{\"inputs\": [\"110\\n101\\n\", \"00100\\n11\\n\", \"1000\\n111\\n\", \"1\\n1\\n\", \"1000000000000000000000000000000011111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111000000000000000000000000... | Piegirl got bored with binary, decimal and other integer based counting systems. Recently she discovered some interesting properties about number <image>, in particular that q2 = q + 1, and she thinks it would make a good base for her new unique system. She called it "golden system". In golden system the number is a no... | 0 |
{"tests": "{\"inputs\": [\"6\\ndouble\\nbundle\\n\", \"4\\npetr\\negor\\n\", \"6\\nwookie\\ncookie\\n\", \"9\\npergament\\npermanent\\n\", \"4\\nyydd\\ndxyz\\n\", \"2\\nzz\\nzz\\n\", \"2\\nzz\\nzx\\n\", \"2\\nab\\ncb\\n\", \"2\\nzx\\nxz\\n\", \"4\\nabba\\nabca\\n\", \"10\\ncdcddbacdb\\naababacabc\\n\", \"3\\nabc\\nbca\... | Ford Prefect got a job as a web developer for a small company that makes towels. His current work task is to create a search engine for the website of the company. During the development process, he needs to write a subroutine for comparing strings S and T of equal length to be "similar". After a brief search on the In... | 0 |
{"tests": "{\"inputs\": [\"3+5*7+8*4\\n\", \"2+3*5\\n\", \"3*4*5\\n\", \"5+3+5+9+3+9+1+3+1*7+7+1+9+3+7+7+6+6+3+7+4+3+6+4+5+1+2*3+6*5+5+6+2+8+3+3+9+9+1+1+2+8+4+8+9+3*7+3+2*8+9+8+1*9+9+7+4+8+6+7+3+5+6+4+4+9+2+2+8+6+7+1+5+4+4+6+6+6+9+8+7+2+3+5+4+6+1+8+8+9+1+9+6+3+8+5*7+3+1+6+7+9+1+6+2+2+8+8+9+3+7+7+2+5+8+6+7+9+7+2+4+9+8+3... | Vanya is doing his maths homework. He has an expression of form <image>, where x1, x2, ..., xn are digits from 1 to 9, and sign <image> represents either a plus '+' or the multiplication sign '*'. Vanya needs to add one pair of brackets in this expression so that to maximize the value of the resulting expression.
Inpu... | 0 |
{"tests": "{\"inputs\": [\"0 0 4\\n6 0 4\\n\", \"0 0 5\\n11 0 5\\n\", \"100 10 10\\n100 20 10\\n\", \"0 1000000000 1\\n0 0 1000000000\\n\", \"-13563 -6901 22958\\n-19316 -16534 18514\\n\", \"44721 999999999 400000000\\n0 0 600000000\\n\", \"0 0 2\\n2 2 2\\n\", \"-999999999 0 1000000000\\n999999999 0 1000000000\\n\", \"... | You are given two circles. Find the area of their intersection.
Input
The first line contains three integers x1, y1, r1 ( - 109 ≤ x1, y1 ≤ 109, 1 ≤ r1 ≤ 109) — the position of the center and the radius of the first circle.
The second line contains three integers x2, y2, r2 ( - 109 ≤ x2, y2 ≤ 109, 1 ≤ r2 ≤ 109) — the... | 0 |
{"tests": "{\"inputs\": [\"6\\nabacba\\n2\\naba 6\\nba 3\\n3\\n\", \"7\\nafxfxfg\\n3\\nf 3\\nx 2\\nfxf 6\\n1\\n\", \"11\\nfghdgrakmnq\\n8\\nfgh 4\\ngh 3\\nh 10\\nhdg 6\\nhdgra 7\\nakm 12\\nrakm 5\\na 15\\n3\\n\", \"6\\nabacba\\n5\\naba 6\\nba 3\\nbac 4\\ncb 3\\nc 6\\n1\\n\", \"8\\naxghcdex\\n5\\naxgh 13\\nhc 35\\ncde 1... | You have recently fallen through a hole and, after several hours of unconsciousness, have realized you are in an underground city. On one of your regular, daily walks through the unknown, you have encountered two unusually looking skeletons called Sanz and P’pairus, who decided to accompany you and give you some puzzle... | 0 |
{"tests": "{\"inputs\": [\"8 1\\n\", \"5 2\\n\", \"10 10000\\n\", \"5 4\\n\", \"4 5\\n\", \"500000000500004245 4242\\n\", \"1 1\\n\", \"925155772916259712 1929889\\n\", \"3 200\\n\", \"762078938126917525 107528\\n\", \"3 7\\n\", \"262133108161 256256256256\\n\", \"1000000000 1000000000000000\\n\", \"1000000000000000000... | Anton likes to listen to fairy tales, especially when Danik, Anton's best friend, tells them. Right now Danik tells Anton a fairy tale:
"Once upon a time, there lived an emperor. He was very rich and had much grain. One day he ordered to build a huge barn to put there all his grain. Best builders were building that ba... | 0 |
{"tests": "{\"inputs\": [\"3\\n5 2\\n12 0\\n61 3\\n\\nSAMPLE\", \"3\\n5 1\\n12 0\\n61 3\\n\\nSAMPLE\", \"3\\n7 1\\n12 0\\n61 3\\n\\nSAMPLE\", \"3\\n7 1\\n12 0\\n18 3\\n\\nSAMPLE\", \"3\\n7 1\\n12 0\\n33 3\\n\\nELPMAS\", \"3\\n5 1\\n12 0\\n33 3\\n\\nELPMAS\", \"3\\n5 1\\n12 0\\n14 3\\n\\nELPMAS\", \"3\\n5 1\\n12 0\\n14 ... | Statement: Sourav and his friends are in kolkata city and they are
planning for a city tour. So, they booked a TUBER cab
(Stop Giggling). Please help them to find the estimated fare
according to the fare evaluator system of TUBER cabs.
How to evaluate fare?
For first 2 Kilometers, Fare is 50 units (i.e., Base Charge ... | 0.375 |
{"tests": "{\"inputs\": [\"3 3\\n1 4 5 \\n6 7 8 \\n4 0 5 \\n90\\n180\\n450\\n\\nSAMPLE\", \"3 3\\n1 4 5 \\n7 7 8 \\n4 0 5 \\n90\\n180\\n450\\n\\nSAMPLE\", \"3 3\\n1 4 5 \\n7 9 8 \\n4 0 5 \\n90\\n180\\n450\\n\\nSAMPLE\", \"3 3\\n1 2 5 \\n6 7 8 \\n4 0 5 \\n90\\n180\\n450\\n\\nSAMPLE\", \"3 3\\n1 4 5 \\n6 2 8 \\n4 0 5 \\n... | Mahabir loves matrix and likes to rotate things a lot.
Today he is rotating an array in clock-wise direction. He gives you an array of size N X N and an positive integer Q.
Each Q number of integers contains an angle A (angle is always multiple of 90 or can be zero).
You have to rotate the array ( clock-wise only )... | 0.75 |
{"tests": "{\"inputs\": [\"3 3\", \"1 1\", \"3 2\", \"4 3\", \"0 0\", \"1 0\", \"3 4\", \"4 1\", \"2 0\", \"3 7\", \"4 0\", \"2 1\", \"2 7\", \"6 0\", \"0 1\", \"4 7\", \"6 -1\", \"0 2\", \"4 -1\", \"2 -1\", \"1 -1\", \"2 -2\", \"0 -1\", \"5 -1\", \"2 -3\", \"0 -2\", \"5 0\", \"2 -5\", \"-1 1\", \"-2 1\", \"1 -5\", \"-... | Takahashi is participating in a programming contest, AXC001. He has just submitted his code to Problem A.
The problem has N test cases, all of which must be passed to get an AC verdict.
Takahashi's submission has passed M cases out of the N test cases.
Determine whether Takahashi's submission gets an AC.
Constraints
... | 0.625 |
{"tests": "{\"inputs\": [\"codefestival\\n100\", \"xyz\\n4\", \"a\\n25\", \"codefestival\\n101\", \"xyz\\n1\", \"zyx\\n1\", \"cdoeffstival\\n101\", \"zyx\\n2\", \"cdoeffstival\\n111\", \"zyx\\n3\", \"lavitsffeodc\\n111\", \"xyz\\n2\", \"caoeffstivdl\\n111\", \"xyz\\n3\", \"xyz\\n5\", \"xyz\\n8\", \"zyx\\n0\", \"zyx\\n4... | Mr. Takahashi has a string s consisting of lowercase English letters. He repeats the following operation on s exactly K times.
* Choose an arbitrary letter on s and change that letter to the next alphabet. Note that the next letter of `z` is `a`.
For example, if you perform an operation for the second letter on `aa... | 0 |
{"tests": "{\"inputs\": [\"2 3 1 4 0 1 0 1\\n4 2 3 2 2 2 1 1\", \"2 3 1 4 0 1 1 1\\n4 2 3 2 2 2 1 1\", \"2 3 1 2 0 1 1 1\\n4 2 3 2 2 2 1 1\", \"0 3 1 3 0 0 -1 2\\n1 1 5 2 -1 3 0 0\", \"0 3 1 1 0 1 -1 2\\n1 1 5 2 -1 3 0 0\", \"0 3 1 1 0 -1 -1 2\\n1 1 5 3 -1 3 0 -1\", \"0 2 0 1 0 -1 -1 2\\n1 1 5 3 -1 3 0 -1\", \"0 2 1 1 ... | <image>
You know the merry-go-round in the amusement park. Vehicles such as horses and carriages are fixed on a large disk, and it is a standard playset that the vehicle swings up and down at the same time as the disk rotates. A merry-go-round in an amusement park has two four-seater carriages, two two-seater cars, f... | 0 |
{"tests": "{\"inputs\": [\"3\\n1\\n0 0 0 1 1 1 1 0\\n2\\n0 0 0 1 1 1 1 0\\n100 100 100 200 200 200 200 100\\n2\\n0 0 0 100 100 100 100 0\\n10 10 10 20 20 20 20 10\\n2\\n1\\n30 40 40 50 40 20 20 10\\n1\\n30 40 40 50 40 20 20 10\\n0\", \"3\\n1\\n0 0 0 1 1 1 1 0\\n2\\n0 0 0 1 1 1 1 0\\n100 100 100 200 200 200 200 100\\n2\... | In Square Town, where many people who love squares live, a festival is held to color the town with illuminations that combine square lightning boards. This electric board emits light when electricity is applied, and the plate in contact with the light emitting plate also emits light. Therefore, no matter how many elect... | 0 |
{"tests": "{\"inputs\": [\"70 100 340 4 200\\n1 1 4\\n70 100 340 4 200\\n0 1 3\\n70 100 340 4 200\\n1 1 2\\n0 0 0 0 0\", \"70 100 340 4 200\\n1 1 4\\n70 100 340 4 200\\n0 1 3\\n70 100 340 6 200\\n1 1 2\\n0 0 0 0 0\", \"135 100 340 4 200\\n1 1 4\\n70 100 340 4 200\\n0 1 3\\n70 100 340 6 200\\n1 1 2\\n0 0 0 0 0\", \"135 ... | Problem
I started a part-time job at the rental DVD shop "NEO". First of all, I decided to study the fee system of this store.
There are three types of rental DVDs, old, semi-new, and new, and the rental fee for one DVD is a yen, b yen, and c yen, respectively. The set rental shown below can be applied multiple times... | 0 |
{"tests": "{\"inputs\": [\"5\\n20\\n220\\n222220\\n44033055505550666011011111090666077705550301110\\n000555555550000330000444000080000200004440000\", \"5\\n40\\n220\\n222220\\n44033055505550666011011111090666077705550301110\\n000555555550000330000444000080000200004440000\", \"5\\n40\\n30\\n222220\\n44033055505550666011... | Alice wants to send an email to Miku on her mobile phone.
The only buttons that can be used for input on mobile phones are number buttons. Therefore, in order to input characters, the number buttons are pressed several times to input characters. The following characters are assigned to the number buttons of the mobile... | 0.125 |
{"tests": "{\"inputs\": [\"6\\nW 0 2\\nW 1 2\\nD 0\\nW 2 4\\nR 3\\nR 1\\n1\\nR 1000000000\\n0\", \"6\\nW 0 2\\nW 1 2\\nD 0\\nW 2 4\\nR 3\\nR 2\\n1\\nR 1000000000\\n0\", \"6\\nW 0 2\\nW 0 2\\nD 0\\nW 2 4\\nR 3\\nR 2\\n1\\nR 1000000000\\n0\", \"6\\nW 0 2\\nW 0 2\\nD -1\\nW 2 4\\nR 2\\nR 2\\n1\\nR 0000000000\\n0\", \"6\\n... | You are a programmer on the development team for new recording media. This recording medium can be randomly accessed for reading and erasing data. On the other hand, when writing data, access is always performed in order from the beginning, and only the first free space found can be written.
You have begun to build a ... | 0 |
{"tests": "{\"inputs\": [\"4\\n1 2 2 4\\n3\\n2\\n3\\n5\", \"4\\n1 2 2 6\\n3\\n2\\n3\\n5\", \"4\\n1 0 2 6\\n3\\n2\\n3\\n5\", \"4\\n1 0 2 6\\n4\\n2\\n3\\n5\", \"4\\n1 0 2 4\\n3\\n2\\n3\\n5\", \"4\\n1 0 2 4\\n3\\n2\\n6\\n6\", \"4\\n1 0 0 4\\n3\\n2\\n6\\n6\", \"4\\n1 0 0 4\\n3\\n4\\n12\\n0\", \"4\\n1 0 0 5\\n3\\n7\\n23\\n0... | For a given sequence $A = \\{a_0, a_1, ..., a_{n-1}\\}$ which is sorted by ascending order, find the lower bound for a specific value $k$ given as a query.
* lower bound: the place pointing to the first element greater than or equal to a specific value, or $n$ if there is no such element.
Constraints
* $1 \leq n \le... | 0 |
{"tests": "{\"inputs\": [\"2\\n2 4\\n4 2\", \"2\\n3 4\\n4 2\", \"2\\n3 4\\n4 3\", \"2\\n3 1\\n4 2\", \"2\\n3 1\\n4 3\", \"2\\n6 1\\n4 3\", \"2\\n6 2\\n4 3\", \"2\\n6 2\\n4 1\", \"2\\n5 2\\n4 1\", \"2\\n5 2\\n4 2\", \"2\\n3 2\\n4 2\", \"2\\n3 4\\n4 1\", \"2\\n3 1\\n4 5\", \"2\\n3 1\\n5 3\", \"2\\n3 1\\n8 3\", \"2\\n5 4\... | As we all know, F.C. Barcelona is the best soccer team of our era! Their entangling and mesmerizing game style usually translates into very high ball possession, consecutive counter-attack plays and goals. Lots of goals, thanks to the natural talent of their attacker and best player in history, Lionel Andres Messi.
How... | 0 |
{"tests": "{\"inputs\": [\"MyNameIsLifeIAmForeverByYourSideMyNameIsLife\\n\", \"tourist\\n\", \"uvkxATqVwsCaAJeBaBGXZKiktZFHbzywaqNdrGSNfgTIwOBFzKDv\\n\", \"aoNtJAeHshvQrvwRgZHkrdxwyaaHOIsyEMxtRNkMifYfRoRbampjmPoUVpNJvSvEyaQjEvGcRAJJSPORp\\n\", \"yWptRMTHCgVSOpLWshusRuXELfcnMUbustgmNXUOGkdTwafvAcGyFUtIvCoaYIPZqcJGzGmcc... | At many competitions that have a word «cup» in its official name the winner is presented with an actual cup. This time the organizers of one unusual programming competition have decided to please the winner even more and to add a nameplate to the cup with the handle of the winner.
The nameplate is to be rectangular an... | 0 |
{"tests": "{\"inputs\": [\"0\\n\", \"-1\\n\", \"1\\n\", \"-2\\n\", \"-4\\n\", \"-3\\n\", \"-5\\n\", \"-7\\n\", \"-6\\n\", \"2\\n\", \"3\\n\", \"4\\n\", \"7\\n\", \"5\\n\", \"9\\n\", \"17\\n\", \"25\\n\", \"8\\n\", \"-10\\n\", \"-15\\n\", \"-9\\n\", \"10\\n\", \"6\\n\", \"12\\n\", \"16\\n\", \"11\\n\", \"13\\n\", \"-11\... | In this problem you have to solve a simple classification task: given an image, determine whether it depicts a Fourier doodle.
You are given a set of 50 images with ids 1 through 50. You are also given a text file labels.txt containing the labels for images with ids 1 through 20, which comprise the learning data set.... | 0 |
{"tests": "{\"inputs\": [\"4\\nhello\\nhello\\nhello\\nhelloo\\nhello\\nhlllloo\\nhello\\nhelo\\n\", \"5\\naa\\nbb\\ncodeforces\\ncodeforce\\npolycarp\\npoolycarpp\\naaaa\\naaaab\\nabcdefghijklmnopqrstuvwxyz\\nzabcdefghijklmnopqrstuvwxyz\\n\", \"10\\naaaa\\naaaab\\naaaa\\nbaaaa\\na\\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa... | Methodius received an email from his friend Polycarp. However, Polycarp's keyboard is broken, so pressing a key on it once may cause the corresponding symbol to appear more than once (if you press a key on a regular keyboard, it prints exactly one symbol).
For example, as a result of typing the word "hello", the follo... | 0 |
{"tests": "{\"inputs\": [\"3\\n1 2 3\\n\", \"2\\n2 6\\n\", \"1\\n129338991123760547\\n\", \"10\\n29709 386918 207259 554633 397723 410736 152700 825806 76191 433807\\n\", \"10\\n221998069488770316 954736809508793543 598658276983441394 74222410330038206 823279423814526176 807704234927978303 752441720796406299 8729833541... | Boy Dima gave Julian a birthday present — set B consisting of positive integers. However, he didn't know, that Julian hates sets, but enjoys bipartite graphs more than anything else!
Julian was almost upset, but her friend Alex said, that he can build an undirected graph using this set in such a way: let all integer n... | 0 |
{"tests": "{\"inputs\": [\"14 9\\n\", \"2 1\\n\", \"3 2\\n\", \"7 1867300\\n\", \"240338 1389081\\n\", \"5 1159248\\n\", \"9 708093\\n\", \"1999992 1999927\\n\", \"1999968 1999941\\n\", \"1492240 6\\n\", \"314 33\\n\", \"156914 1840237\\n\", \"2000000 1\\n\", \"1999913 1999918\\n\", \"42 77\\n\", \"1 2000000\\n\", \"14... | zscoder has a deck of n+m custom-made cards, which consists of n cards labelled from 1 to n and m jokers. Since zscoder is lonely, he wants to play a game with himself using those cards.
Initially, the deck is shuffled uniformly randomly and placed on the table. zscoder has a set S which is initially empty.
Every s... | 0 |
{"tests": "{\"inputs\": [\"3\\n0110?11\\n6\\n5 1\\n6 ?\\n7 ?\\n1 ?\\n5 ?\\n1 1\\n\", \"3\\n0110?11\\n6\\n5 1\\n6 ?\\n7 ?\\n2 ?\\n5 ?\\n1 1\\n\", \"3\\n0110?11\\n6\\n5 1\\n6 ?\\n6 ?\\n1 ?\\n5 ?\\n1 1\\n\", \"3\\n11?0110\\n6\\n5 1\\n6 ?\\n7 ?\\n2 ?\\n5 ?\\n1 1\\n\", \"3\\n0110?11\\n6\\n5 1\\n7 ?\\n7 ?\\n2 ?\\n5 ?\\n1 1\\... | 2^k teams participate in a playoff tournament. The tournament consists of 2^k - 1 games. They are held as follows: first of all, the teams are split into pairs: team 1 plays against team 2, team 3 plays against team 4 (exactly in this order), and so on (so, 2^{k-1} games are played in that phase). When a team loses a g... | 0 |
{"tests": "{\"inputs\": [\"5\\n-3 -4 -2 -3 3\\n\", \"5\\n2 -3 -1 -4 3\\n\", \"7\\n-1 -2 -4 -10 6 6 5\\n\", \"50\\n-67 -84 -89 80 40 42 -38 30 74 -12 -66 27 1 11 -45 -44 2 -70 -59 -70 -59 -59 62 100 -5 1 91 79 47 -64 -51 -88 -5 37 82 87 79 46 76 47 60 57 59 -24 47 -49 -63 24 -84 -54\\n\", \"10\\n-10 3 -16 -15 14 -16 13 ... | The Physical education teacher at SESC is a sort of mathematician too. His most favorite topic in mathematics is progressions. That is why the teacher wants the students lined up in non-decreasing height form an arithmetic progression.
To achieve the goal, the gym teacher ordered a lot of magical buns from the dining ... | 0 |
{"tests": "{\"inputs\": [\"4 3\\n3 2 1 1\\n\", \"3 2\\n1 1 1\\n\", \"5 1\\n1 1 1 1 1\\n\", \"3 2\\n1 0 1\\n\", \"19 10\\n10 9 8 7 6 5 4 3 2 10 2 3 4 5 6 7 8 9 10\\n\", \"19 11\\n10 9 8 7 6 5 4 3 3 3 3 3 4 5 6 7 8 9 10\\n\", \"3 2\\n2 1 1\\n\", \"1 2000\\n2000\\n\", \"3 6\\n5 6 5\\n\", \"99 1999\\n1999 1998 1997 1996 19... | Peter has a sequence of integers a1, a2, ..., an. Peter wants all numbers in the sequence to equal h. He can perform the operation of "adding one on the segment [l, r]": add one to all elements of the sequence with indices from l to r (inclusive). At that, Peter never chooses any element as the beginning of the segment... | 0 |
{"tests": "{\"inputs\": [\"2\\n+ 1\\n- 1\\n\", \"2\\n- 1\\n- 2\\n\", \"6\\n+ 12001\\n- 12001\\n- 1\\n- 1200\\n+ 1\\n+ 7\\n\", \"6\\n+ 1\\n+ 2\\n- 1\\n+ 3\\n- 2\\n+ 4\\n\", \"50\\n- 1\\n- 2\\n- 3\\n- 4\\n- 5\\n- 6\\n- 7\\n- 8\\n- 9\\n- 10\\n- 11\\n- 12\\n- 13\\n- 14\\n- 15\\n- 16\\n- 17\\n- 18\\n- 19\\n- 20\\n- 21\\n- 2... | Berland National Library has recently been built in the capital of Berland. In addition, in the library you can take any of the collected works of Berland leaders, the library has a reading room.
Today was the pilot launch of an automated reading room visitors' accounting system! The scanner of the system is installed... | 0 |
{"tests": "{\"inputs\": [\"6\\nRRULDD\\n\", \"3\\nRLL\\n\", \"26\\nRRRULURURUULULLLDLDDRDRDLD\\n\", \"4\\nLRLR\\n\", \"4\\nRURD\\n\", \"5\\nLRDLR\\n\", \"10\\nDDRDUULUDD\\n\", \"1\\nD\\n\", \"5\\nLRRLD\\n\", \"6\\nDDLURR\\n\", \"5\\nRLDRL\\n\", \"10\\nLDRDUUDUDD\\n\", \"26\\nDLDRDRDDLDLLLULUURURULURRR\\n\", \"26\\nRURU... | Santa Claus has Robot which lives on the infinite grid and can move along its lines. He can also, having a sequence of m points p1, p2, ..., pm with integer coordinates, do the following: denote its initial location by p0. First, the robot will move from p0 to p1 along one of the shortest paths between them (please not... | 0 |
{"tests": "{\"inputs\": [\"7 3 4\\n3 4 6\\n1 2\\n2 5\\n5 7\\n7 1\\n\", \"5 1 2\\n2\\n1 2\\n2 4\\n\", \"203948 2 14\\n203948 203947\\n39 38\\n4959 3030\\n1 203947\\n2929 9292\\n203944 203948\\n203947 203944\\n203944 203922\\n203922 203948\\n2495 20495\\n29419 5959\\n12949 12\\n49 29292\\n1 94\\n1 203\\n\", \"5 2 9\\n2 4... | Zane the wizard is going to perform a magic show shuffling the cups.
There are n cups, numbered from 1 to n, placed along the x-axis on a table that has m holes on it. More precisely, cup i is on the table at the position x = i.
The problematic bone is initially at the position x = 1. Zane will confuse the audience b... | 0.875 |
{"tests": "{\"inputs\": [\"1 1\\n\", \"3 2\\n\", \"493 4847\\n\", \"999999376 642\\n\", \"4278 3849\\n\", \"3281 4798\\n\", \"522 4575\\n\", \"20 5\\n\", \"731963982 4784\\n\", \"880895728 3537\\n\", \"602436426 4445\\n\", \"982631932 902\\n\", \"3506 4679\\n\", \"2775 4325\\n\", \"137 4733\\n\", \"2156 3417\\n\", \"86... | You have a team of N people. For a particular task, you can pick any non-empty subset of people. The cost of having x people for the task is xk.
Output the sum of costs over all non-empty subsets of people.
Input
Only line of input contains two integers N (1 ≤ N ≤ 109) representing total number of people and k (1 ≤... | 0.125 |
{"tests": "{\"inputs\": [\"2\\n5 5 -5 5 \\n4\\n1 2 3 4\\n5\\n\\nSAMPLE\", \"2\\n5 3 -5 5 \\n4\\n1 2 3 4\\n5\\n\\nSAMPLE\", \"2\\n5 4 -5 5 \\n4\\n1 2 0 4\\n5\\n\\nSAMPLE\", \"2\\n5 8 -9 5 \\n1\\n1 2 0 4\\n1\\n\\nSAMPLE\", \"2\\n13 8 -9 5 \\n1\\n0 1 0 6\\n0\\n\\nSAMPLE\", \"2\\n31 1 -1 1 \\n1\\n0 1 1 6\\n0\\n\\nRAMPME\",... | Brio got his house constructed near the National Highway. The Construction and Planning Committee has planned to construct a road near his house. Brio is worried about the Committee's plan as he fears that his house might come on the way of the road being constructed.
In such a case, he needs to request the Committee m... | 0.75 |
{"tests": "{\"inputs\": [\"2\\n#A#B#B# A###B#B\\n#A#B# #B#A#\\n\\nSAMPLE\", \"2\\n#A#B#A# A###B#B\\n#A#B# #B#A#\\n\\nSAMPLE\", \"2\\n#A#B#B# A###B#B\\n#A#B# #B#A#\\n\\nS@MPLE\", \"2\\n#A#B#A# A###B#B\\n#@#B# #B#A#\\n\\nSAMPLE\", \"2\\n#A#B#A# A#$#B#B\\n#@#B# #B#A#\\n\\nSAMPLE\", \"2\\n#A#B#A# A#$#B#B\\n#@#B# #B#A\\\"\\... | There are two kind of bots in the game BOT A and BOT B. Both are designed so as to move only in one direction in a 1-D array. Bot A can move towards left whereas bot B is constrained to move rightwards. Both are constrained to move only to the empty elements and one cannot jump over another bot. Now, a particular state... | 0.625 |
{"tests": "{\"inputs\": [\"2 3 3\\n10 20 30\\n7 14 100\\n11 7\\n35 13\\n100 1002\\n\\nSAMPLE\", \"2 3 3\\n10 20 30\\n3 14 100\\n11 7\\n35 13\\n100 1002\\n\\nSAMPLE\", \"2 3 1\\n10 20 18\\n3 14 100\\n11 7\\n45 7\\n100 1002\\n\\nSAMQLE\", \"2 3 2\\n10 20 30\\n7 14 100\\n11 7\\n35 13\\n100 1002\\n\\nSAMPLE\", \"2 3 3\\n10... | Every one is now a days playing games on their smartphones for passing free time. Because of which there are number of game developing companies growing in the market. Not only that, each company is now flooding the market with a lot of games. With such a huge number of games in the market, for each company, with milli... | 0.625 |
{"tests": "{\"inputs\": [\"4\\n3141 59\\n26535 897\\n93 23\\n8462 64\", \"3\\n28 3\\n16 4\\n19 2\", \"3\\n3 2\\n4 3\\n5 1\", \"2\\n5 2\\n3 3\", \"4\\n3141 59\\n26535 897\\n73 23\\n8462 64\", \"2\\n7 2\\n3 6\", \"3\\n28 3\\n16 4\\n22 2\", \"3\\n3 2\\n4 3\\n6 1\", \"4\\n3141 59\\n51840 897\\n73 23\\n8462 64\", \"3\\n28 3... | Takahashi and Aoki are playing a stone-taking game. Initially, there are N piles of stones, and the i-th pile contains A_i stones and has an associated integer K_i.
Starting from Takahashi, Takahashi and Aoki take alternate turns to perform the following operation:
* Choose a pile. If the i-th pile is selected and th... | 0.125 |
{"tests": "{\"inputs\": [\"7\\n1010101\", \"50\\n10101000010011011110001001111110000101010111100110\", \"7\\n1010001\", \"50\\n10101000010011011110001001111110001101010111100110\", \"7\\n1000001\", \"50\\n10101000010011011010001001111110001101010111100100\", \"50\\n10101000010011011010001001111110001101010111000100\", ... | N cells are arranged in a row. Some of them may contain tokens. You are given a string s that consists of `0`s and `1`s. If the i-th character of s is `1`, the i-th cell (from left) contains a token. Otherwise, it doesn't contain a token.
Snuke wants to perform the following operation as many times as possible. In eac... | 0 |
{"tests": "{\"inputs\": [\"5 2 3\\n10 2 8 10 2\", \"10 3 5\\n3 7 2 6 9 4 8 5 1 1000000000\", \"5 5 2\\n5 2 10 5 9\", \"5 2 3\\n10 2 11 10 2\", \"10 3 5\\n0 7 2 6 9 4 8 5 1 1000000000\", \"5 5 2\\n1 2 10 5 9\", \"10 3 5\\n0 7 2 6 9 4 2 5 1 1000000000\", \"5 5 2\\n1 2 5 5 9\", \"5 2 2\\n10 2 11 10 1\", \"5 2 2\\n5 2 11 1... | There are N panels arranged in a row in Takahashi's house, numbered 1 through N. The i-th panel has a number A_i written on it. Takahashi is playing by throwing balls at these panels.
Takahashi threw a ball K times. Let the panel hit by a boll in the i-th throw be panel p_i. He set the score for the i-th throw as i \t... | 0 |
{"tests": "{\"inputs\": [\"6 7\\n1 2 3\\n1 4 1\\n2 3 5\\n4 3 1\\n3 6 2\\n4 5 2\\n5 6 1\\n1 6 6\\n1 6\\n4 3\\n4 6\\n5 6\\n2 6\\n2 5\", \"6 3\\n1 2 3\\n1 4 1\\n2 3 5\\n4 3 1\\n3 6 2\\n4 5 2\\n5 6 1\\n1 6 6\\n1 6\\n4 3\\n4 6\\n5 6\\n2 6\\n2 5\", \"6 3\\n1 2 3\\n1 4 1\\n2 3 5\\n4 3 2\\n3 1 2\\n1 5 2\\n5 6 1\\n1 6 6\\n1 6\\... | We have decided to introduce an automatic ticket gate to the railway network of a certain country. One of the difficult issues to implement is determining whether a given ticket can move between designated stations. Each ticket has a boarding station and a getting-off station. With this ticket, you can not only "get on... | 0 |
{"tests": "{\"inputs\": [\"3 3 3 6\\n1 0 1 1\\n2 2 1 1 2 2\\n3 1 1 1\\n4 0 2 1\\n5 2 1 1 2 2\\n6 2 2 1 3 3\", \"3 3 3 6\\n1 0 1 1\\n2 2 1 1 2 2\\n3 1 1 1\\n4 0 2 1\\n5 2 2 1 2 2\\n6 2 2 1 3 3\", \"3 3 3 6\\n1 0 1 1\\n2 2 1 1 2 2\\n3 1 1 1\\n4 0 2 1\\n5 2 2 1 2 2\\n6 2 3 1 3 3\", \"3 3 3 6\\n1 0 1 1\\n2 2 1 0 2 2\\n3 1 ... | E: Taiyaki-Master and Eater
story
Tsuta is very good at making Taiyaki. Ebi-chan loves Taiyaki made by Tsuta-san. The two are happy to make and eat Taiyaki every week, but Tsuta-san's recent worries are that Ebi-chan, who is in the middle of eating, eats the food while making Taiyaki.
Mr. Tsuta, who decided to make ... | 0 |
{"tests": "{\"inputs\": [\"4\\n1 1\\n1 2\\n1 3\\n0\\n6\\n0 3 1000\\n0 2 1000\\n0 1 1000\\n1 1\\n1 2\\n1 3\", \"6\\n2 1 2\\n2 3 5\\n0\\n0\\n0\\n1 4\\n7\\n1 1\\n0 3 10\\n1 2\\n0 4 20\\n1 3\\n0 5 40\\n1 4\", \"4\\n1 1\\n1 2\\n1 3\\n0\\n6\\n0 3 1000\\n0 2 1000\\n0 1 1001\\n1 1\\n1 2\\n1 3\", \"4\\n1 1\\n1 2\\n1 3\\n0\\n6\\... | Write a program which manipulates a weighted rooted tree $T$ with the following operations:
* $add(v,w)$: add $w$ to all edges from the root to node $u$
* $getSum(u)$: report the sum of weights of all edges from the root to node $u$
The given tree $T$ consists of $n$ nodes and every node has a unique ID from $0$ t... | 0 |
{"tests": "{\"inputs\": [\"6\\n1 2\\n1 6\\n3 1\\n1 5\\n4 1\\n4\\n6 1 1\\n3 4 3\\n6 5 3\\n1 2 4\\n\", \"6\\n1 2\\n1 6\\n3 1\\n1 5\\n4 1\\n4\\n6 1 3\\n3 4 1\\n6 5 2\\n1 2 5\\n\", \"4\\n1 2\\n3 2\\n3 4\\n2\\n1 2 5\\n1 3 3\\n\", \"9\\n9 4\\n7 5\\n4 1\\n6 5\\n5 2\\n3 1\\n2 1\\n8 3\\n3\\n9 7 2\\n1 6 4\\n8 4 1\\n\", \"7\\n3 4... | There are n railway stations in Berland. They are connected to each other by n-1 railway sections. The railway network is connected, i.e. can be represented as an undirected tree.
You have a map of that network, so for each railway section you know which stations it connects.
Each of the n-1 sections has some integer... | 0.25 |
{"tests": "{\"inputs\": [\"3 2\\n0 5 3 5 1 5 2\\n\", \"1 1\\n0 2 0\\n\", \"1 1\\n5 7 2\\n\", \"3 1\\n1 3 2 3 1 3 1\\n\", \"24 7\\n3 4 2 4 1 4 3 4 3 5 1 3 1 3 0 3 0 3 1 4 0 3 0 1 0 1 0 3 2 3 2 3 1 2 1 3 2 5 1 3 0 1 0 2 0 3 1 3 1\\n\", \"3 1\\n0 1 0 1 0 2 0\\n\", \"3 2\\n0 4 3 5 2 5 2\\n\", \"3 1\\n8 10 9 10 3 5 1\\n\", ... | Little Bolek has found a picture with n mountain peaks painted on it. The n painted peaks are represented by a non-closed polyline, consisting of 2n segments. The segments go through 2n + 1 points with coordinates (1, y1), (2, y2), ..., (2n + 1, y2n + 1), with the i-th segment connecting the point (i, yi) and the point... | 0 |
{"tests": "{\"inputs\": [\"5 6\\n1 2\\n2 3\\n3 5\\n1 4\\n4 5\\n1 3\\n\", \"3 3\\n1 2\\n2 3\\n1 3\\n\", \"4 4\\n1 2\\n2 3\\n3 4\\n1 4\\n\", \"4 3\\n1 2\\n2 3\\n3 4\\n1 4\\n\", \"4 4\\n1 2\\n2 3\\n3 4\\n1 3\\n\", \"4 2\\n1 2\\n2 4\\n3 4\\n1 4\\n\", \"4 3\\n1 2\\n2 3\\n3 4\\n1 3\\n\", \"4 3\\n1 2\\n2 3\\n3 4\\n2 3\\n\", \... | LiLand is a country, consisting of n cities. The cities are numbered from 1 to n. The country is well known because it has a very strange transportation system. There are many one-way flights that make it possible to travel between the cities, but the flights are arranged in a way that once you leave a city you will ne... | 0 |
{"tests": "{\"inputs\": [\"5\\n1 1 0 3\\n10 1 2 1\\n2 2 1 1\\n10 1 1 2\\n3 1 3 0\\n\", \"5\\n1 1 0 3\\n1 1 1 2\\n1 1 2 1\\n1 1 3 0\\n2 1 3 0\\n\", \"4\\n2 1 0 3\\n3 3 0 1\\n2 2 1 1\\n1 1 3 0\\n\", \"1\\n1 1 1 1\\n\", \"10\\n4053 1 0 13\\n6467 2 1 11\\n3901 1 3 10\\n4711 2 4 8\\n838 1 6 7\\n7938 2 7 5\\n7241 1 9 4\\n843... | A motorcade of n trucks, driving from city «Z» to city «З», has approached a tunnel, known as Tunnel of Horror. Among truck drivers there were rumours about monster DravDe, who hunts for drivers in that tunnel. Some drivers fear to go first, others - to be the last, but let's consider the general case. Each truck is de... | 0 |
{"tests": "{\"inputs\": [\"2 5\\n0 1\\n3 5\\n\", \"1 48\\n5 7\\n\", \"30 189\\n0 8\\n3 8\\n5 8\\n2 2\\n7 7\\n2 8\\n7 8\\n2 5\\n1 7\\n0 1\\n3 4\\n1 7\\n1 6\\n5 6\\n3 7\\n4 7\\n4 7\\n4 7\\n5 5\\n0 5\\n4 7\\n3 5\\n0 6\\n4 8\\n2 5\\n5 6\\n5 6\\n2 8\\n0 7\\n7 8\\n\", \"30 71\\n1 3\\n0 6\\n3 5\\n3 6\\n2 4\\n2 8\\n2 4\\n3 8\\... | Tomorrow Peter has a Biology exam. He does not like this subject much, but d days ago he learnt that he would have to take this exam. Peter's strict parents made him prepare for the exam immediately, for this purpose he has to study not less than minTimei and not more than maxTimei hours per each i-th day. Moreover, th... | 0 |
{"tests": "{\"inputs\": [\"3\\naAbB\\n\", \"4\\naBaCaB\\n\", \"5\\nxYyXzZaZ\\n\", \"10\\nhNcMeXsSlHsUwYeMcA\\n\", \"5\\naArRaRaR\\n\", \"26\\nzAyBxCwDvEuFtGsHrIqJpKoLnMmNlOkPjQiRhSgTfUeVdWcXbY\\n\", \"2\\ndE\\n\", \"2\\ndD\\n\", \"2\\ndA\\n\", \"3\\ndDdD\\n\", \"3\\ndEeF\\n\", \"100\\nqDpInBmCrFwXpDbFgOzVvOcEmJrUcToAdE... | After a hard day Vitaly got very hungry and he wants to eat his favorite potato pie. But it's not that simple. Vitaly is in the first room of the house with n room located in a line and numbered starting from one from left to right. You can go from the first room to the second room, from the second room to the third ro... | 0 |
{"tests": "{\"inputs\": [\"8\\n1 2 1 1 1 3 3 4\\n\", \"5\\n1 2 1 2 1\\n\", \"1\\n2\\n\", \"10\\n1 2 3 4 5 6 7 8 9 10\\n\", \"10\\n10 9 8 7 6 5 4 3 2 1\\n\", \"100\\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 1 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 ... | Little Petya often travels to his grandmother in the countryside. The grandmother has a large garden, which can be represented as a rectangle 1 × n in size, when viewed from above. This rectangle is divided into n equal square sections. The garden is very unusual as each of the square sections possesses its own fixed h... | 0 |
{"tests": "{\"inputs\": [\"1 7\\n\", \"1 1\\n\", \"11 6\\n\", \"3 1\\n\", \"11 3\\n\", \"1 2\\n\", \"6 4\\n\", \"3 5\\n\", \"4 4\\n\", \"9 7\\n\", \"4 5\\n\", \"2 6\\n\", \"7 5\\n\", \"10 6\\n\", \"12 1\\n\", \"9 1\\n\", \"5 1\\n\", \"12 2\\n\", \"6 5\\n\", \"1 3\\n\", \"12 6\\n\", \"4 7\\n\", \"4 2\\n\", \"5 2\\n\", \... | Petr wants to make a calendar for current month. For this purpose he draws a table in which columns correspond to weeks (a week is seven consequent days from Monday to Sunday), rows correspond to weekdays, and cells contain dates. For example, a calendar for January 2017 should look like on the picture:
<image>
Petr ... | 0.625 |
{"tests": "{\"inputs\": [\"43\\n\", \"125\\n\", \"1000000000\\n\", \"31\\n\", \"265145\\n\", \"82655\\n\", \"2521\\n\", \"1\\n\", \"1132\\n\", \"671704\\n\", \"152541908\\n\", \"5\\n\", \"27035533\\n\", \"24403439\\n\", \"22717528\\n\", \"74\\n\", \"6364\\n\", \"7\\n\", \"719\\n\", \"668439837\\n\", \"91402248\\n\", \"... | Allen has a LOT of money. He has n dollars in the bank. For security reasons, he wants to withdraw it in cash (we will not disclose the reasons here). The denominations for dollar bills are 1, 5, 10, 20, 100. What is the minimum number of bills Allen could receive after withdrawing his entire balance?
Input
The first... | 0.875 |
{"tests": "{\"inputs\": [\"3\\n-2 5 -1\", \"2\\n-1 -3\", \"5\\n0 0 0 0 0\", \"2\\n-2 -3\", \"2\\n1 -11\", \"3\\n-3 5 -1\", \"2\\n0 0\", \"2\\n1 0\", \"2\\n2 -1\", \"3\\n-2 5 0\", \"2\\n0 -3\", \"2\\n0 -4\", \"2\\n0 -7\", \"2\\n0 -14\", \"2\\n0 -27\", \"2\\n0 -22\", \"2\\n-1 -22\", \"2\\n0 -11\", \"2\\n1 -19\", \"2\\n1 ... | Snuke has an integer sequence, a, of length N. The i-th element of a (1-indexed) is a_{i}.
He can perform the following operation any number of times:
* Operation: Choose integers x and y between 1 and N (inclusive), and add a_x to a_y.
He would like to perform this operation between 0 and 2N times (inclusive) so ... | 0 |
{"tests": "{\"inputs\": [\"3\\n1 2 3\\n1 2\\n2 3\", \"5\\n5 4 1 2 3\\n1 2\\n1 3\\n2 4\\n2 5\", \"3\\n1 1 1\\n1 2\\n2 3\", \"5\\n2 4 1 2 3\\n1 2\\n1 3\\n2 4\\n2 5\", \"3\\n1 2 1\\n1 2\\n2 3\", \"3\\n1 2 3\\n1 2\\n1 3\", \"5\\n5 4 1 2 3\\n1 2\\n1 3\\n1 4\\n3 5\", \"3\\n1 2 2\\n1 4\\n1 3\", \"3\\n0 1 1\\n1 0\\n1 3\", \"5\... | There is a tree with N vertices, numbered 1 through N. The i-th of the N-1 edges connects vertices a_i and b_i.
Currently, there are A_i stones placed on vertex i. Takahashi and Aoki will play a game using this tree.
First, Takahashi will select a vertex and place a piece on it. Then, starting from Takahashi, they wi... | 0 |
{"tests": "{\"inputs\": [\"5\\n2\\n3\\n9\\n1010\\n1001\\n0100\\n1001\\n0010\\n1000\\n0100\\n0101\\n1010\\n0\", \"5\\n2\\n3\\n9\\n1010\\n1001\\n0100\\n1001\\n0010\\n1000\\n0000\\n0101\\n1010\\n0\", \"5\\n2\\n3\\n9\\n1010\\n1001\\n0100\\n1001\\n0010\\n1000\\n0000\\n0101\\n1000\\n0\", \"5\\n2\\n3\\n9\\n1010\\n1001\\n0000\... | There are n vertical lines in the Amidakuji. This Amidakuji meets the following conditions.
* Draw a horizontal line right next to it. Do not pull diagonally.
* Horizontal lines always connect adjacent vertical lines. In other words, the horizontal line does not cross the vertical line.
* For any vertical line, horizo... | 0.125 |
{"tests": "{\"inputs\": [\"8\\nwood 3000\\nstring 800\\nrice 36\\nwater 0\\nracket 5000\\nmicrophone 9800\\nonigiri 140\\nguitar 98000\\n3\\nracket 2 wood string\\nonigiri 2 rice water\\nguitar 3 racket microphone onigiri\\nguitar\\n1\\ncomputer 300000\\n0\\ncomputer\\n0\", \"8\\nwood 3000\\nstring 800\\nrice 36\\nwate... | You finally got a magic pot, an alchemy pot. You can create a new item by putting multiple items in the alchemy pot. Newly created items can also be placed in alchemy pots to make other items. A list of items needed to make an item will be called an alchemy recipe. The following three are examples of alchemy recipes.
... | 0.125 |
{"tests": "{\"inputs\": [\"4 6\", \"4 4\", \"2 4\", \"1 8\", \"5 6\", \"1 0\", \"9 6\", \"4 13\", \"9 3\", \"6 1\", \"2 13\", \"7 1\", \"2 29\", \"17 2\", \"20 2\", \"21 1\", \"1 3\", \"2 2\", \"2 22\", \"17 1\", \"15 1\", \"33 1\", \"27 1\", \"11 1\", \"2 25\", \"1 1\", \"29 1\", \"61 1\", \"9 17\", \"5 1\", \"13 1\",... | I am a craftsman specialized in interior works. A customer asked me to perform wiring work on a wall whose entire rectangular surface is tightly pasted with pieces of panels. The panels are all of the same size (2 m in width, 1 m in height) and the wall is filled with an x (horizontal) by y (vertical) array of the pane... | 0 |
{"tests": "{\"inputs\": [\"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-Omotesand... | 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:... | 0 |
{"tests": "{\"inputs\": [\"3 9\\nABCDEFGHI\\nJKLMNOPQR\\nSTUVWXYZ_\\nICPC\\n5 11\\n___________\\n____A______\\n________M__\\n___________\\n_C_________\\nACM\\n4 21\\n1_2_3_4_5_6_7_8_9_0_-\\nQqWwEeRrTtYyUuIiOoPp@\\nAaSsDdFfGgHhJjKkLl;_:\\nZzXxCcVvBbNnMm,_._/__\\nICPC2019,AsiaYokohamaRegional,QualificationRound\\n0 0\", ... | <!--
Problem B
-->
On-Screen Keyboard
You are to input a string with an OSK (on-screen keyboard). A remote control with five buttons, four arrows and an OK (Fig. B-1), is used for the OSK. Find the minimum number of button presses required to input a given string with the given OSK.
<image> Fig. B-1 Remote control... | 0.25 |
{"tests": "{\"inputs\": [\"2\\n1 1 2\\n2 2 3\", \"2\\n1 1 4\\n2 2 3\", \"2\\n1 1 3\\n2 2 3\", \"2\\n1 1 4\\n2 0 0\", \"2\\n0 1 1\\n2 0 0\", \"2\\n1 1 2\\n2 0 0\", \"2\\n1 1 0\\n3 0 0\", \"2\\n1 1 2\\n3 2 3\", \"2\\n1 1 4\\n2 2 5\", \"2\\n1 0 5\\n2 1 3\", \"2\\n1 1 4\\n4 2 5\", \"2\\n1 0 8\\n1 -1 3\", \"2\\n1 1 7\\n2 2 ... | Ievan Ritola is a researcher of behavioral ecology. Her group visited a forest to analyze an ecological system of some kinds of foxes.
The forest can be expressed as a two-dimensional plane. With her previous research, foxes in the forest are known to live at lattice points. Here, lattice points are the points whose x... | 0 |
{"tests": "{\"inputs\": [\"?12345678901\", \"?123456789/1\", \"1/987654321?\", \"1.987654321?\", \"1.687954321?\", \"1/587954321?\", \"1/687954321?\", \"6/478851321?\", \"?1/315887426\", \"634788413/1?\", \"?12345678900\", \"?123456789.1\", \"1.587954321?\", \"4/687951321?\", \"4/678951321?\", \"6/478951321?\", \"?1231... | A: My Number-My Number-
problem
I'm sorry! Late late!
Ah! I'm starting to work for this company I've been longing for today!
Even so, I've been oversleeping since the first day ...! ??
Today is an important day when I have to tell my number to the company ...!
I think everyone knows, but I'll explain my number fo... | 0 |
{"tests": "{\"inputs\": [\"7\\n8 3 7 1 9 1 4\\n3\\n0 0 3\\n0 1 5\\n1 0 7\", \"7\\n8 3 0 1 9 1 4\\n3\\n0 0 3\\n0 1 5\\n1 0 7\", \"7\\n8 3 0 0 9 1 4\\n3\\n0 0 3\\n1 1 5\\n1 0 7\", \"7\\n8 3 0 0 9 1 4\\n6\\n0 0 3\\n1 1 5\\n1 0 7\", \"7\\n8 3 0 1 14 1 4\\n3\\n0 1 3\\n0 1 5\\n1 0 7\", \"7\\n2 2 -1 2 9 1 0\\n3\\n0 0 3\\n0 1 ... | Write a program which manipulates a sequence $A = \\{a_0, a_1, ..., a_{n-1}\\}$ by the following operations:
* min($b, e$): report the minimum element in $a_b, a_{b+1}, ..., a_{e-1}$
* max($b, e$): report the maximum element in $a_b, a_{b+1}, ..., a_{e-1}$
Constraints
* $1 \leq n \leq 1,000$
* $-1,000,000,000 \leq a... | 0 |
{"tests": "{\"inputs\": [\"40\\n3 3 -1 -1 4 4 -1 -1 -1 -1 -1 10 10 10 10 10 10 4 20 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 3 3 3 3 3 3 3 3\\n\", \"2\\n2 -1\\n\", \"3\\n-1 -1 -1\\n\", \"10\\n-1 6 6 6 -1 -1 -1 -1 6 -1\\n\", \"10\\n-1 -1 -1 -1 -1 -1 -1 -1 -1 -1\\n\", \"10\\n3 -1 -1 -1 -1 -1 -1 -1 2 2\\n\", \"10\\n7 7 7 7 ... | There are n startups. Startups can be active or acquired. If a startup is acquired, then that means it has exactly one active startup that it is following. An active startup can have arbitrarily many acquired startups that are following it. An active startup cannot follow any other startup.
The following steps happen ... | 0 |
{"tests": "{\"inputs\": [\"2\\n2 5\\n-6 4\\n7 -2\\n-1 -3\\n\", \"4\\n2 2\\n8 2\\n-7 0\\n-2 6\\n1 -14\\n16 -12\\n11 -18\\n7 -14\\n\", \"4\\n5 -10\\n-7 7\\n1 0\\n8 3\\n7 -6\\n0 -9\\n15 -13\\n3 4\\n\", \"10\\n-52 25\\n21 25\\n76 -22\\n-98 -56\\n87 22\\n-20 95\\n45 -7\\n30 89\\n82 -97\\n2 -3\\n-144 32\\n-70 13\\n-98 -79\\n... | Bob is a pirate looking for the greatest treasure the world has ever seen. The treasure is located at the point T, which coordinates to be found out.
Bob travelled around the world and collected clues of the treasure location at n obelisks. These clues were in an ancient language, and he has only decrypted them at hom... | 0.625 |
{"tests": "{\"inputs\": [\"6\\nLRLRRLL\\nL\\nLLR\\nRRRR\\nLLLLLL\\nR\\n\", \"6\\nRRLRLLL\\nL\\nLLR\\nRRRR\\nLLLLLL\\nR\\n\", \"6\\nMRLRRLL\\nL\\nLLR\\nRRRR\\nLLLLLL\\nR\\n\", \"6\\nLLLRLRR\\nL\\nLRL\\nRRRR\\nLLLLLL\\nR\\n\", \"6\\nLRLRLRL\\nL\\nLLR\\nRRRR\\nLLLLLL\\nR\\n\", \"6\\nLLLLRRR\\nL\\nLRL\\nRRRR\\nLLLLLL\\nR\\... | There is a frog staying to the left of the string s = s_1 s_2 … s_n consisting of n characters (to be more precise, the frog initially stays at the cell 0). Each character of s is either 'L' or 'R'. It means that if the frog is staying at the i-th cell and the i-th character is 'L', the frog can jump only to the left. ... | 0 |
{"tests": "{\"inputs\": [\"4\\n2\\n1 0\\n2\\n0 0\\n4\\n0 1 1 1\\n4\\n1 1 0 0\\n\", \"4\\n2\\n1 0\\n2\\n0 0\\n4\\n0 1 1 1\\n4\\n1 1 0 0\\n\", \"4\\n2\\n1 0\\n2\\n0 0\\n4\\n0 1 1 0\\n4\\n1 1 0 0\\n\", \"4\\n2\\n1 0\\n2\\n0 0\\n4\\n0 1 1 0\\n4\\n1 1 1 0\\n\", \"4\\n2\\n1 1\\n2\\n0 0\\n4\\n0 1 1 1\\n4\\n1 1 0 0\\n\", \"4\\... | Alexandra has an even-length array a, consisting of 0s and 1s. The elements of the array are enumerated from 1 to n. She wants to remove at most n/2 elements (where n — length of array) in the way that alternating sum of the array will be equal 0 (i.e. a_1 - a_2 + a_3 - a_4 + ... = 0). In other words, Alexandra wants s... | 0 |
{"tests": "{\"inputs\": [\"abcdef\\nklmnopq\\n\", \"aaaaa\\naaa\\n\", \"abcabc\\nbcd\\n\", \"a\\na\\n\", \"bwhvaanyxupicwobeevcwewhcriwowfovnylalpuhxzqxtzyjrzlxcmejujvliomdfedgtaioauwrcluhfxtzu\\nplinvtsvytepojsecnjisxlmqkfhgknitvuw\\n\", \"ladfasxt\\ncpvtd\\n\", \"ibdjtvgaveujdyidqldrxgwhsammmfpgxwljkptmeyejdvudhctmqj... | Dr. Moriarty is about to send a message to Sherlock Holmes. He has a string s.
String p is called a substring of string s if you can read it starting from some position in the string s. For example, string "aba" has six substrings: "a", "b", "a", "ab", "ba", "aba".
Dr. Moriarty plans to take string s and cut out som... | 0 |
{"tests": "{\"inputs\": [\"50 50 35 45\\n90 50 35 45\\n\", \"60 60 45 55\\n80 60 15 25\\n\", \"60 60 45 55\\n80 80 8 32\\n\", \"70 92 20 40\\n99 92 9 49\\n\", \"0 73 20 40\\n59 73 39 100\\n\", \"39 90 20 40\\n47 90 28 31\\n\", \"-46 55 20 40\\n-17 55 7 11\\n\", \"31 40 37 76\\n48 65 66 98\\n\", \"-81 -55 20 40\\n19 20 ... | A renowned abstract artist Sasha, drawing inspiration from nowhere, decided to paint a picture entitled "Special Olympics". He justly thought that, if the regular Olympic games have five rings, then the Special ones will do with exactly two rings just fine.
Let us remind you that a ring is a region located between two... | 0 |
{"tests": "{\"inputs\": [\"4 3\\n2 5 10 20\\n100 1 3\\n\", \"3 2\\n100 5 2\\n50 10\\n\", \"2 3\\n50 10\\n100 5 2\\n\", \"1 5\\n99\\n3 55 18 1 19\\n\", \"5 3\\n16 24 36 54 81\\n4 6 9\\n\", \"3 2\\n100 5 2\\n10 100\\n\", \"5 5\\n2 9 8 3 5\\n5 7 8 1 1\\n\", \"10 11\\n7 43 39 13 25 23 33 40 5 2\\n42 22 39 1 23 37 12 48 46 ... | To confuse the opponents, the Galactic Empire represents fractions in an unusual format. The fractions are represented as two sets of integers. The product of numbers from the first set gives the fraction numerator, the product of numbers from the second set gives the fraction denominator. However, it turned out that t... | 0 |
{"tests": "{\"inputs\": [\"6 5\\n3 4 U\\n6 1 L\\n2 5 L\\n1 6 U\\n4 3 U\\n\", \"10 6\\n2 9 U\\n10 1 U\\n1 10 U\\n8 3 L\\n10 1 L\\n6 5 U\\n\", \"15 7\\n8 8 U\\n6 10 L\\n9 7 L\\n3 13 L\\n15 1 L\\n13 3 U\\n1 15 L\\n\", \"1000000000 1\\n117117117 882882884 U\\n\", \"10 10\\n5 6 U\\n4 7 U\\n8 3 L\\n8 3 L\\n1 10 U\\n9 2 U\\n1... | Andrewid the Android is a galaxy-known detective. Now he does not investigate any case and is eating chocolate out of boredom.
A bar of chocolate can be presented as an n × n table, where each cell represents one piece of chocolate. The columns of the table are numbered from 1 to n from left to right and the rows are ... | 0 |
{"tests": "{\"inputs\": [\"5\\n\", \"11\\n\", \"4\\n\", \"33\\n\", \"110401\\n\", \"1738464936\\n\", \"9009890098\\n\", \"189108\\n\", \"9012332098\\n\", \"3031371285404035821731303\\n\", \"643303246\\n\", \"230021\\n\", \"970068\\n\", \"10000000000\\n\", \"891297\\n\", \"4602332064\\n\", \"1094093901\\n\", \"614901941... | Vitya is studying in the third grade. During the last math lesson all the pupils wrote on arithmetic quiz. Vitya is a clever boy, so he managed to finish all the tasks pretty fast and Oksana Fillipovna gave him a new one, that is much harder.
Let's denote a flip operation of an integer as follows: number is considered... | 0 |
{"tests": "{\"inputs\": [\"6\\n1 0 0 1 0 1\\n\", \"6\\n1 0 1 1 1 0\\n\", \"3\\n1 1 1\\n\", \"6\\n0 1 0 0 0 0\\n\", \"7\\n1 1 1 1 1 1 1\\n\", \"10\\n1 0 1 1 1 0 1 0 1 0\\n\", \"7\\n0 0 1 0 0 0 1\\n\", \"30\\n1 0 0 0 1 0 1 1 1 1 0 0 1 0 0 0 1 0 1 0 0 0 0 1 0 0 1 0 0 0\\n\", \"113\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1... | There are n knights sitting at the Round Table at an equal distance from each other. Each of them is either in a good or in a bad mood.
Merlin, the wizard predicted to King Arthur that the next month will turn out to be particularly fortunate if the regular polygon can be found. On all vertices of the polygon knights ... | 0.25 |
{"tests": "{\"inputs\": [\"5\\n1 4 2 3 1\\n\", \"4\\n1 5 4 7\\n\", \"4\\n1000000000 0 0 -1000000000\\n\", \"10\\n1000000000 -1000000000 -1000000000 1000000000 1000000000 -1000000000 -1000000000 1000000000 1000000000 -1000000000\\n\", \"5\\n0 10 20 30 40\\n\", \"9\\n1000000000 0 0 1000000000 1000000000 0 0 1000000000 10... | Something happened in Uzhlyandia again... There are riots on the streets... Famous Uzhlyandian superheroes Shean the Sheep and Stas the Giraffe were called in order to save the situation. Upon the arriving, they found that citizens are worried about maximum values of the Main Uzhlyandian Function f, which is defined as... | 0 |
{"tests": "{\"inputs\": [\"4\\n1 1 1 1 1\\n3 2 5 4 5\\n1 1 5 5 10000\\n1 4 2 5 2\\n\", \"10\\n1 1 1000000000 1000000000 1477070720\\n1 1 1000000000 1000000000 1378704784\\n1 1 1000000000 1000000000 782520772\\n1 1 1000000000 1000000000 1377211731\\n1 1 1000000000 1000000000 623332716\\n1 1 1000000000 1000000000 4976305... | After a wonderful evening in the restaurant the time to go home came. Leha as a true gentlemen suggested Noora to give her a lift. Certainly the girl agreed with pleasure. Suddenly one problem appeared: Leha cannot find his car on a huge parking near the restaurant. So he decided to turn to the watchman for help.
Form... | 0 |
{"tests": "{\"inputs\": [\"3 5 3\\naba\\nzbzbz\\n\\nSAMPLE\", \"35 106 401\\nhegghdhehhfjhbhhakkkfgbmrfotpflicgg\\nfirkfcbishdehfjbhffedhlargbkhffilgaalfeijffxhgchctnkjlglbfifhgckeheikaghjiexhljbffhgjaaleicjlgikgalhfjdtbf\", \"45 106 401\\nhegghdhehhfjhbhhakkkfgbmrfotpflicgg\\nfirkfcbishdehfjbhffedhlargbkhffilgaalfeijf... | Benny is given two strings S and T. The length of the string S is N and the length of the string T is M respectively.
Also, imagine that alphabets are cyclic in nature: a-b-c-…-x-y-z-a-b.. and so on. The distance between two letters is the minimal distance between them in the alphabet cycle. For example, distance be... | 0 |
{"tests": "{\"inputs\": [\"5 3\\n1 2 4 7 8\\n2\\n1 5\\n1 2\", \"15 220492538\\n4452279 12864090 23146757 31318558 133073771 141315707 263239555 350278176 401243954 418305779 450172439 560311491 625900495 626194585 891960194\\n5\\n6 14\\n1 8\\n1 13\\n7 12\\n4 12\", \"5 3\\n1 2 4 4 8\\n2\\n1 5\\n1 2\", \"5 3\\n1 4 4 4 8\... | There are N points on a number line, i-th of which is placed on coordinate X_i. These points are numbered in the increasing order of coordinates. In other words, for all i (1 \leq i \leq N-1), X_i < X_{i+1} holds. In addition to that, an integer K is given.
Process Q queries.
In the i-th query, two integers L_i and R... | 0 |
{"tests": "{\"inputs\": [\"123456789123456789\", \"2\", \"26\", \"4\", \"3\", \"13\", \"119107271329329921\", \"27\", \"5\", \"9\", \"7\", \"8\", \"11\", \"6\", \"10\", \"12\", \"20\", \"33213408621377322\", \"45\", \"26939847318901699\", \"12809773843701327\", \"15368855316243065\", \"15\", \"5452054052106793\", \"18\... | There are N people (with different names) and K clubs. For each club you know the list of members (so you have K unordered lists). Each person can be a member of many clubs (and also 0 clubs) and two different clubs might have exactly the same members. The value of the number K is the minimum possible such that the fol... | 0 |
{"tests": "{\"inputs\": [\"2 3\", \"10 100\", \"1 1000000000000000000\", \"3 3\", \"10 110\", \"1 1000000100000000000\", \"3 0\", \"10 111\", \"4 110\", \"4 100\", \"6 110\", \"6 111\", \"5 111\", \"9 111\", \"16 111\", \"1 011\", \"3 100\", \"6 100\", \"2 5\", \"15 100\", \"1 1000000000010000000\", \"3 4\", \"1 100\",... | Given are integers L and R. Find the number, modulo 10^9 + 7, of pairs of integers (x, y) (L \leq x \leq y \leq R) such that the remainder when y is divided by x is equal to y \mbox{ XOR } x.
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 writte... | 0 |
{"tests": "{\"inputs\": [\"19 2\\n1 3\\n2 3\\n0 1\\n1 1\\n2 1\\n3 1\\n4 4\\n5 4\\n6 4\\n7 4\\n8 4\\n8 3\\n8 2\\n8 1\\n8 0\\n7 0\\n6 0\\n5 0\\n4 0\", \"3 1\\n0 0\\n1 0\\n2 0\", \"8 3\\n0 0\\n0 3\\n3 0\\n3 3\\n2 2\\n2 5\\n5 2\\n5 5\", \"19 2\\n1 3\\n2 3\\n0 1\\n1 1\\n2 1\\n3 1\\n4 4\\n5 4\\n6 4\\n7 4\\n8 4\\n8 1\\n8 2\\n... | Niwango-kun, an employee of Dwango Co., Ltd., likes Niconico TV-chan, so he collected a lot of soft toys of her and spread them on the floor.
Niwango-kun has N black rare soft toys of Niconico TV-chan and they are spread together with ordinary ones. He wanted these black rare soft toys to be close together, so he deci... | 0 |
{"tests": "{\"inputs\": [\"15 409904902\\n94198000 15017\\n117995501 7656764\\n275583856 313263626\\n284496300 356635175\\n324233841 607\\n360631781 148\\n472103717 5224\\n497641071 34695\\n522945827 816241\\n554305668 32\\n623788284 22832\\n667409501 124410641\\n876731548 12078\\n904557302 291749534\\n918215789 5\", \... | There are N apartments along a number line, numbered 1 through N. Apartment i is located at coordinate X_i. Also, the office of AtCoder Inc. is located at coordinate S. Every employee of AtCoder lives in one of the N apartments. There are P_i employees who are living in Apartment i.
All employees of AtCoder are now le... | 0.125 |
{"tests": "{\"inputs\": [\"2 4 1 2\", \"3 4 2 3\", \"3 3 2 2\", \"0 4 1 2\", \"3 4 4 3\", \"4 3 2 2\", \"4 3 3 2\", \"3 6 4 2\", \"3 10 4 2\", \"5 10 6 2\", \"5 10 2 2\", \"2 4 4 1\", \"4 2 3 2\", \"1 4 4 2\", \"3 11 4 2\", \"3 15 4 2\", \"3 2 6 2\", \"9 10 6 2\", \"5 10 2 4\", \"2 5 1 4\", \"3 3 2 3\", \"4 2 3 3\", \"... | You are given four integers: H, W, h and w (1 ≤ h ≤ H, 1 ≤ w ≤ W). Determine whether there exists a matrix such that all of the following conditions are held, and construct one such matrix if the answer is positive:
* The matrix has H rows and W columns.
* Each element of the matrix is an integer between -10^9 and 10^... | 0 |
{"tests": "{\"inputs\": [\"5\\n5 4 3 2 1\\n5\\n7 7 7 7 7\\n10\\n186 8 42 24 154 40 10 56 122 72\\n0\", \"5\\n5 4 3 2 1\\n5\\n7 7 7 7 7\\n10\\n186 8 42 24 154 40 10 56 122 141\\n0\", \"5\\n5 4 3 2 1\\n5\\n7 12 2 0 7\\n10\\n372 8 42 18 154 40 10 56 122 141\\n0\", \"5\\n5 4 3 4 1\\n5\\n7 11 7 7 14\\n0\\n186 8 42 24 154 21... | A linear congruential generator produces a series R(⋅) of pseudo-random numbers by the following for- mulas:
<image>
where S, A, C, and M are all parameters. In this problem, 0 ≤ S, A, C ≤ 15 and M = 256.
Now suppose we have some input string I(⋅), where each character in the string is an integer between 0 and (M - ... | 0.5 |
{"tests": "{\"inputs\": [\"8 6\\n########\\n#..##g.#\\n#*#.*#.#\\n#......#\\n#*s#*.*#\\n########\", \"8 6\\n\\n..##g.#\\n*#.*#.#\\n......#\\n*s#*.*#\", \"21 11\\n\\n*#*.*.*.*.*.*.*.*#*#\\n*#...............#*#\\n*#.#.#.#.#.#.#.#.#*#\\n.#.#.#.#.#.#.#.#.##\\n...................#\\n.#.#.#.#.#.#.#.#.##\\ns#.#.#.#.#.#.#.#.#g... | One morning when you woke up, it was in a springy labyrinth.
I don't know why I'm in such a strange place. You have the option of waiting for help here, but you know from experience that if you stay in a labyrinth like this for a long time, a gust of wind will surely blow you away. It was. However, the time until the ... | 0 |
{"tests": "{\"inputs\": [\"5 130\\n130 170 100 120 140\", \"5 130\\n130 170 100 122 140\", \"3 130\\n130 170 100 122 140\", \"1 130\\n130 170 100 122 86\", \"1 58\\n60 60 010 102 86\", \"1 58\\n68 60 010 102 166\", \"6 130\\n130 170 100 120 140\", \"5 130\\n130 170 100 138 140\", \"1 48\\n68 5 100 72 104\", \"1 53\\n68... | B: Yamanote-line Game-Yamanote-line Game-
Bean (?) Knowledge
The Yamanote line is convenient. The reason is that you can ride as many laps as time allows just by paying 130 yen. However, if you board with a ticket, you must be careful about the valid time of the ticket. It seems safe with an IC card. Taking advantage... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.