info stringlengths 120 50k | question stringlengths 504 10.4k | avg@8_qwen3_4b_instruct_2507 float64 0 0.88 |
|---|---|---|
{"tests": "{\"inputs\": [\"4\\n4\\n0011\\n6\\n111111\\n5\\n10101\\n8\\n01010000\\n\", \"4\\n4\\n0011\\n6\\n111111\\n5\\n10101\\n8\\n01000000\\n\", \"4\\n4\\n1011\\n6\\n111111\\n5\\n10101\\n8\\n01000000\\n\", \"4\\n4\\n1011\\n6\\n111111\\n5\\n10101\\n8\\n01010000\\n\", \"4\\n4\\n0001\\n6\\n111111\\n5\\n10101\\n8\\n01000... | You are given a binary string s consisting of n zeros and ones.
Your task is to divide the given string into the minimum number of subsequences in such a way that each character of the string belongs to exactly one subsequence and each subsequence looks like "010101 ..." or "101010 ..." (i.e. the subsequence should no... | 0 |
{"tests": "{\"inputs\": [\"3\\n2\\n4\\n6\\n\", \"1\\n200040002\\n\", \"1\\n1458\\n\", \"1\\n999939200\\n\", \"1\\n200000000\\n\", \"1\\n92888450\\n\", \"1\\n100000001\\n\", \"1\\n536870913\\n\", \"1\\n9060100\\n\", \"1\\n500101938\\n\", \"1\\n114514\\n\", \"3\\n131073\\n262148\\n9266\\n\", \"3\\n524304\\n61032704\\n615... | Phoenix is playing with a new puzzle, which consists of n identical puzzle pieces. Each puzzle piece is a right isosceles triangle as shown below.
<image> A puzzle piece
The goal of the puzzle is to create a square using the n pieces. He is allowed to rotate and move the pieces around, but none of them can overlap an... | 0.75 |
{"tests": "{\"inputs\": [\"4\\n2 1\\n3 1\\n4 1\\n\", \"2\\n1 2\\n\", \"3\\n1 2\\n2 3\\n\", \"23\\n10 19\\n11 2\\n15 18\\n8 14\\n15 7\\n23 6\\n21 5\\n14 1\\n10 13\\n8 23\\n19 16\\n12 3\\n8 10\\n8 21\\n14 11\\n6 22\\n7 8\\n4 15\\n9 12\\n15 9\\n1 20\\n11 17\\n\", \"23\\n10 19\\n11 2\\n15 18\\n8 14\\n15 7\\n23 6\\n21 5\\n1... | You've got a undirected tree s, consisting of n nodes. Your task is to build an optimal T-decomposition for it. Let's define a T-decomposition as follows.
Let's denote the set of all nodes s as v. Let's consider an undirected tree t, whose nodes are some non-empty subsets of v, we'll call them xi <image>. The tree t i... | 0 |
{"tests": "{\"inputs\": [\"3 3 3 1 1 9\\n1 1\\n1 2\\n1 3\\n2 1\\n2 2\\n2 3\\n3 1\\n3 2\\n3 3\\n\", \"85 26 48272945 423830401 423026164 3\\n35 1\\n50 17\\n55 2\\n\", \"67 61 443905131 226973811 158369983 1\\n52 51\\n\", \"1 1 0 1 0 2\\n1 1\\n1 1\\n\", \"2 2 0 0 1 4\\n1 1\\n1 2\\n2 2\\n2 1\\n\", \"25 45 20761261 8578166... | Inna and Dima decided to surprise Sereja. They brought a really huge candy matrix, it's big even for Sereja! Let's number the rows of the giant matrix from 1 to n from top to bottom and the columns β from 1 to m, from left to right. We'll represent the cell on the intersection of the i-th row and j-th column as (i, j).... | 0 |
{"tests": "{\"inputs\": [\"0 -1\\n2\\n\", \"2 3\\n3\\n\", \"1 2\\n6\\n\", \"-976992569 -958313041\\n1686580818\\n\", \"-1000000000 1000000000\\n6\\n\", \"2 3\\n6\\n\", \"0 -1\\n6\\n\", \"-474244697 -745885656\\n1517883612\\n\", \"875035447 -826471373\\n561914518\\n\", \"83712471 -876177148\\n1213284777\\n\", \"84450933... | Jzzhu has invented a kind of sequences, they meet the following property:
<image>
You are given x and y, please calculate fn modulo 1000000007 (109 + 7).
Input
The first line contains two integers x and y (|x|, |y| β€ 109). The second line contains a single integer n (1 β€ n β€ 2Β·109).
Output
Output a single integer... | 0.625 |
{"tests": "{\"inputs\": [\"3\\ngennady korotkevich\\npetr mitrichev\\ngaoyuan chen\\n3 1 2\\n\", \"2\\ngalileo galilei\\nnicolaus copernicus\\n2 1\\n\", \"10\\nrean schwarzer\\nfei claussell\\nalisa reinford\\neliot craig\\nlaura arseid\\njusis albarea\\nmachias regnitz\\nsara valestin\\nemma millstein\\ngaius worzel\\... | A way to make a new task is to make it nondeterministic or probabilistic. For example, the hard task of Topcoder SRM 595, Constellation, is the probabilistic version of a convex hull.
Let's try to make a new task. Firstly we will use the following task. There are n people, sort them by their name. It is just an ordina... | 0.25 |
{"tests": "{\"inputs\": [\"3\\n3 3 3\\n1 1 1\\n\", \"6\\n1 2 3 2 1 4\\n6 7 1 2 3 2\\n\", \"17\\n714413739 -959271262 714413739 -745891378 926207665 -404845105 -404845105 -959271262 -189641729 -670860364 714413739 -189641729 192457837 -745891378 -670860364 536388097 -959271262\\n-417715348 -959271262 -959271262 71441373... | Mike and !Mike are old childhood rivals, they are opposite in everything they do, except programming. Today they have a problem they cannot solve on their own, but together (with you) β who knows?
Every one of them has an integer sequences a and b of length n. Being given a query of the form of pair of integers (l, r... | 0.75 |
{"tests": "{\"inputs\": [\"4\\n1 1 1 1\\n1 1 0 1\\n1 1 1 1\\n1 1 1 1\\n\", \"3\\n4 0 2\\n3 5 7\\n8 1 6\\n\", \"4\\n1 1 1 1\\n1 1 0 1\\n1 1 2 1\\n1 1 1 1\\n\", \"11\\n5 5 5 5 5 5 5 5 5 5 5\\n5 5 5 5 5 5 5 5 5 5 5\\n5 5 5 5 5 5 5 5 5 5 5\\n5 5 5 5 5 5 5 5 5 5 5\\n5 5 5 5 5 5 5 5 5 5 5\\n5 5 5 5 5 5 5 5 5 5 5\\n5 5 5 5 5 ... | ZS the Coder and Chris the Baboon arrived at the entrance of Udayland. There is a n Γ n magic grid on the entrance which is filled with integers. Chris noticed that exactly one of the cells in the grid is empty, and to enter Udayland, they need to fill a positive integer into the empty cell.
Chris tried filling in ran... | 0.375 |
{"tests": "{\"inputs\": [\"4\\n1 1\\n1 4\\n1 5\\n2\\n\", \"6\\n1 3\\n2\\n1 4\\n2\\n1 8\\n2\\n\", \"9\\n1 35\\n2\\n2\\n1 45\\n1 58\\n2\\n2\\n2\\n1 100\\n\", \"88\\n1 1411\\n2\\n1 1783\\n1 2132\\n2\\n2\\n1 2799\\n2\\n2\\n1 7856\\n1 10551\\n2\\n2\\n1 10868\\n1 15159\\n1 16497\\n2\\n1 20266\\n2\\n2\\n2\\n1 21665\\n2\\n2\\n... | You are given a multiset S consisting of positive integers (initially empty). There are two kind of queries:
1. Add a positive integer to S, the newly added integer is not less than any number in it.
2. Find a subset s of the set S such that the value <image> is maximum possible. Here max(s) means maximum value ... | 0 |
{"tests": "{\"inputs\": [\"10 4\\n#....##...\\n.#...#....\\n..#..#..#.\\n...#.#....\\n.#..##.#..\\n.....#...#\\n...#.##...\\n.#...#.#..\\n.....#..#.\\n...#.#...#\\n\", \"19 6\\n##..............###\\n#......#####.....##\\n.....#########.....\\n....###########....\\n...#############...\\n..###############..\\n.##########... | Arkady is playing Battleship. The rules of this game aren't really important.
There is a field of n Γ n cells. There should be exactly one k-decker on the field, i. e. a ship that is k cells long oriented either horizontally or vertically. However, Arkady doesn't know where it is located. For each cell Arkady knows if... | 0.75 |
{"tests": "{\"inputs\": [\"2\\n1 4\\n1 2\\n\\nSAMPLE\", \"2\\n1 1\\n1 2\\n\\nSAMPLE\", \"2\\n1 1\\n2 2\\n\\nSAMPLE\", \"2\\n1 0\\n2 2\\n\\nSAEPLM\", \"2\\n1 1\\n1 0\\n\\nSAMPLE\", \"2\\n2 1\\n2 2\\n\\nSAEPLM\", \"2\\n2 4\\n1 2\\n\\nELPMAS\", \"2\\n2 1\\n4 2\\n\\nSAEPLM\", \"2\\n1 0\\n3 3\\n\\nSAMPLE\", \"2\\n3 7\\n1 2\... | Kuldeep is tired from all the fun he's having with Christie, so now all he needs is a good night's sleep to get some rest.
Being a math nerd, he even dreams about maths.
But in this dreamland some mathematical entities have slightly different definition. For example factorial of a number n in dreamland is defined a... | 0.375 |
{"tests": "{\"inputs\": [\"2\\n3 1\\n4 3\\n\\nSAMPLE\", \"2\\n3 1\\n4 3\\n\\nSLMPAE\", \"2\\n3 1\\n6 3\\n\\nEAPMLS\", \"2\\n3 1\\n6 1\\n\\nSLMPAE\", \"2\\n3 1\\n9 1\\n\\nLSMOAE\", \"2\\n3 1\\n9 0\\n\\nLSMOAE\", \"2\\n6 1\\n9 1\\n\\nLSMOAE\", \"2\\n0 1\\n9 1\\n\\nKSMAOE\", \"2\\n-1 1\\n9 1\\n\\nEOAMSK\", \"2\\n-2 1\\n9 ... | Ashima has brought home n cats. Now, being a cat lover, she is taking care of the cats and has asked me to bring cat food for them. Being a guy with no idea what to buy, I brought some n packets of cat food (I atleast knew that each and every cat being a good junkie will completely eat a whole packet of cat food and wo... | 0.75 |
{"tests": "{\"inputs\": [\"2\\n2+3*5\\n1*2*3\\n\\nSAMPLE\", \"2\\n2+3+5\\n1*2*3\\n\\nSAMPLE\", \"2\\n2+3*5\\n1*2*3\\n\\nSALPME\", \"2\\n2+3+5\\n1+2*3\\n\\nSAMPLE\", \"2\\n2+4+5\\n1*3*2\\n\\nSAMPLE\", \"2\\n2+4+5\\n1*3+2\\n\\nSAMQLE\", \"2\\n2+3+5\\n1*3*3\\n\\nSAMPLE\", \"2\\n2+3*5\\n1*3*3\\n\\nSALPME\", \"2\\n2+5*3\\n1... | In the Mathematical world of Dr. Ramanujam, every new student must have to pass a exam to take the classes of Advance mathematics from Dr. Ramanujam.
One day Ram wants to have classes of Advance mathematics, so he arrived at class of Dr. Ramanujam. He asked ram to solve a given mathematical expression then only he will... | 0.625 |
{"tests": "{\"inputs\": [\"5 4 1\\n1000000000 1000000000 1000000000 1000000000 1000000000\\n1000000000 1000000000 1000000000 1000000000\", \"3 4 240\\n60 90 120\\n80 150 80 150\", \"3 4 730\\n60 90 120\\n80 150 80 150\", \"5 4 1\\n1000000000 1000000000 1000000000 1000000000 1000000000\\n1000000000 1000000000 1000000010... | We have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.
It takes us A_i minutes to read the i-th book from the top on Desk A (1 \leq i \leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \leq i \leq M).
Consider the following action:
* Ch... | 0 |
{"tests": "{\"inputs\": [\"oxoxoxoxoxoxox\", \"xxxxxxxx\", \"xoxoxoxoxoxoxo\", \"oxoxowoxoxoxox\", \"oxoxowoooxoxxx\", \"xxxoxooowoxoxo\", \"xoxoxooxwoxoxo\", \"xoxoyoxoxoxoxo\", \"xxxoxoooooxwxo\", \"xoxowooxwoxoxo\", \"oxoxoxoxoyoxox\", \"xoxoxoxoxoyoxo\", \"xxxoxooovoxoxo\", \"xoxowooxwoxowo\", \"oxoxoyoxoyoxox\", \... | Takahashi is competing in a sumo tournament. The tournament lasts for 15 days, during which he performs in one match per day. If he wins 8 or more matches, he can also participate in the next tournament.
The matches for the first k days have finished. You are given the results of Takahashi's matches as a string S cons... | 0.875 |
{"tests": "{\"inputs\": [\"abracadabra\\navadakedavra\", \"a\\nz\", \"axyb\\nabyxb\", \"aa\\nxayaz\", \"abracadabra\\navaeakedavra\", \"`xyb\\nabyxb\", \"aa\\nxaybz\", \"byx`\\nabyxb\", \"`yxb\\nabyxb\", \"`yxb\\nzbaxb\", \"bxy`\\nzbaxb\", \"xy_c\\nzbaxb\", \"abracbdaara\\navadakedavra\", \"axya\\nabyxb\", \"aa\\nxayay... | You are given strings s and t. Find one longest string that is a subsequence of both s and t.
Constraints
* s and t are strings consisting of lowercase English letters.
* 1 \leq |s|, |t| \leq 3000
Input
Input is given from Standard Input in the following format:
s
t
Output
Print one longest string that is a su... | 0.875 |
{"tests": "{\"inputs\": [\"7\\n21 12 1 16 13 6 7\\n20 11 2 17 14 5 8\\n19 10 3 18 15 4 9\", \"5\\n9 6 15 12 1\\n8 5 14 11 2\\n7 4 13 10 3\", \"6\\n15 10 3 4 9 16\\n14 11 2 5 8 17\\n13 12 1 6 7 18\", \"5\\n1 4 7 10 13\\n2 5 8 11 14\\n3 6 9 12 15\", \"5\\n1 2 3 4 5\\n6 7 8 9 10\\n11 12 13 14 15\", \"7\\n21 12 1 16 13 6 7... | We have a grid with 3 rows and N columns. The cell at the i-th row and j-th column is denoted (i, j). Initially, each cell (i, j) contains the integer i+3j-3.
<image>
A grid with N=5 columns
Snuke can perform the following operation any number of times:
* Choose a 3Γ3 subrectangle of the grid. The placement of inte... | 0 |
{"tests": "{\"inputs\": [\"27 6 1\", \"10 20 5\", \"9 6 1\", \"10 20 9\", \"10 20 16\", \"4 11 1\", \"8 20 16\", \"6 11 1\", \"8 20 11\", \"3 11 1\", \"2 1 11\", \"3 3 1\", \"2 0 11\", \"3 3 2\", \"2 -1 18\", \"2 -1 23\", \"2 -1 43\", \"3 -1 43\", \"3 -1 1\", \"3 -1 2\", \"5 -1 2\", \"5 -1 1\", \"4 -1 1\", \"7 -1 1\", ... | In Aizu prefecture, we decided to create a new town to increase the population. To that end, we decided to cultivate a new rectangular land and divide this land into squares of the same size. The cost of developing this land is proportional to the number of plots, but the prefecture wants to minimize this cost.
Create... | 0.625 |
{"tests": "{\"inputs\": [\"4\\n1 1 1\\n1 1 1\\n1 1 1\\n2 2 2\\n2 2 2\\n2 2 2\\n4 3 3\\n5 2 2\\n4 3 3\\n6 1 1\\n6 1 1\\n6 1 0\\n1 0 0\\n0 2 0\\n0 0 0\\n5 1 2\\n5 1 2\\n0 0 0\\n2 0 0\\n0 3 0\\n0 0 0\\n0 0 0\\n0 0 0\\n3 0 1\", \"4\\n1 1 1\\n1 1 1\\n1 1 1\\n2 2 2\\n2 2 2\\n2 2 2\\n4 3 3\\n5 2 2\\n4 3 3\\n6 1 1\\n6 1 1\\n6 ... | Letβs try a dice puzzle. The rules of this puzzle are as follows.
1. Dice with six faces as shown in Figure 1 are used in the puzzle.
<image>
Figure 1: Faces of a die
2. With twenty seven such dice, a 3 Γ 3 Γ 3 cube is built as shown in Figure 2.
<image>
Figure 2: 3 Γ 3 Γ 3 cube
3. When building up a cube made o... | 0 |
{"tests": "{\"inputs\": [\"3\\n10\\n4 3 4 10\\n5 4 5 20\\n6 5 6 30\\n3\\n7\\n-4 3 4 -10\\n5 4 5 20\\n6 5 6 30\\n3\\n1\\n-4 3 4 -10\\n-5 4 5 -20\\n6 5 6 30\\n3\\n10\\n-4 3 4 -10\\n-5 4 5 -20\\n-6 5 6 -30\\n0\", \"3\\n10\\n5 3 4 10\\n5 4 5 20\\n6 5 6 30\\n3\\n7\\n-4 3 4 -10\\n5 4 5 20\\n6 5 6 30\\n3\\n1\\n-4 3 4 -10\\n-5... | Problem Statement
We have planted $N$ flower seeds, all of which come into different flowers. We want to make all the flowers come out together.
Each plant has a value called vitality, which is initially zero. Watering and spreading fertilizers cause changes on it, and the $i$-th plant will come into flower if its vi... | 0.125 |
{"tests": "{\"inputs\": [\"1\\n2\\n3\\n390\\n1124\\n1546\\n314159265358979323\\n0\", \"1\\n2\\n3\\n390\\n216\\n1546\\n314159265358979323\\n0\", \"1\\n2\\n2\\n390\\n1124\\n1546\\n314159265358979323\\n0\", \"1\\n2\\n3\\n390\\n216\\n1546\\n31125328462643205\\n0\", \"1\\n2\\n2\\n390\\n1124\\n1546\\n211760204581026131\\n0\"... | Number of tanka
Wishing to die in the spring under the flowers
This is one of the famous tanka poems that Saigyo Hoshi wrote. Tanka is a type of waka poem that has been popular in Japan for a long time, and most of it consists of five phrases and thirty-one sounds of 5, 7, 5, 7, and 7.
By the way, the number 57577 c... | 0 |
{"tests": "{\"inputs\": [\"10 7 12\\n34 70\\n36 0\\n12 50\\n76 46\\n33 45\\n61 21\\n0 1\\n24 3\\n98 41\\n23 84\", \"5 3 5\\n7 2\\n13 1\\n1 1\\n2 9\\n2 4\", \"10 7 12\\n34 70\\n36 0\\n12 50\\n76 46\\n33 45\\n61 21\\n0 0\\n24 3\\n98 41\\n23 84\", \"5 3 4\\n7 2\\n13 1\\n1 1\\n2 9\\n2 4\", \"10 7 12\\n34 70\\n36 0\\n12 50\... | Problem
Given $ N $ a pair of non-negative integers $ (a_i, b_i) $ and non-negative integers $ A $, $ B $.
I want to do as many of the following operations as possible.
* $ | a_i --b_i | \ leq A $ or $ B \ leq | a_i --b_i | \ leq Take out and delete the element $ i $ that satisfies 2A $
* $ | (a_i + a_j)-(b_i + b_j)... | 0.375 |
{"tests": "{\"inputs\": [\"5\\n1 5 7 10 21\\n8\\n2 4 17 8 22 21 100 35\", \"5\\n1 5 7 10 21\\n8\\n2 4 17 10 22 21 100 35\", \"5\\n1 5 7 3 21\\n8\\n2 4 17 10 22 21 100 42\", \"5\\n1 5 7 3 21\\n8\\n0 4 17 10 22 21 100 42\", \"5\\n1 5 7 3 21\\n8\\n0 4 17 11 22 21 010 42\", \"5\\n0 5 7 3 21\\n8\\n0 4 17 11 22 21 010 42\", ... | Write a program which reads a sequence A of n elements and an integer M, and outputs "yes" if you can make M by adding elements in A, otherwise "no". You can use an element only once.
You are given the sequence A and q questions where each question contains Mi.
Notes
You can solve this problem by a Burte Force appro... | 0 |
{"tests": "{\"inputs\": [\"vanceknowledgetoad\\nadvance\", \"vanceknowledgetoad\\nadvanced\", \"vanceknowledgetoad\\nedvanca\", \"vanceknowledgetoad\\nbdvanced\", \"vanceknowledgetoad\\nedvamca\", \"vanceknowledgetoad\\ncdvanced\", \"daotegdelwonkecnav\\nedvamca\", \"vanceknowmedgetoad\\ncdvanced\", \"daotegdelwonkecna... | Write a program which finds a pattern $p$ in a ring shaped text $s$.
<image>
Constraints
* $1 \leq $ length of $p \leq $ length of $s \leq 100$
* $s$ and $p$ consists of lower-case letters
Input
In the first line, the text $s$ is given.
In the second line, the pattern $p$ is given.
Output
If $p$ is in $s$, prin... | 0.875 |
{"tests": "{\"inputs\": [\"3 5\\n\", \"15 6\\n\", \"30931310 20\\n\", \"51400703 5644\\n\", \"96865066 63740710\\n\", \"75431019 54776881\\n\", \"64345128 22\\n\", \"98979868 1\\n\", \"53904449 44920372\\n\", \"99784030 7525\\n\", \"1 100000000\\n\", \"90201151 4851\\n\", \"92314891 81228036\\n\", \"58064619 65614207\\... | Petya is having a party soon, and he has decided to invite his n friends.
He wants to make invitations in the form of origami. For each invitation, he needs two red sheets, five green sheets, and eight blue sheets. The store sells an infinite number of notebooks of each color, but each notebook consists of only one co... | 0 |
{"tests": "{\"inputs\": [\"7\\n1\\n2\\n6\\n13\\n14\\n3620\\n10000\\n\", \"1\\n450283905890997363\\n\", \"100\\n1\\n8\\n4\\n6\\n5\\n4\\n4\\n6\\n8\\n3\\n9\\n5\\n7\\n8\\n8\\n5\\n9\\n6\\n9\\n4\\n5\\n6\\n4\\n4\\n7\\n1\\n2\\n2\\n5\\n6\\n1\\n5\\n10\\n9\\n10\\n9\\n3\\n1\\n2\\n3\\n2\\n6\\n9\\n2\\n9\\n5\\n7\\n7\\n2\\n6\\n9\\n5\\... | The only difference between easy and hard versions is the maximum value of n.
You are given a positive integer number n. You really love good numbers so you want to find the smallest good number greater than or equal to n.
The positive integer is called good if it can be represented as a sum of distinct powers of 3 (... | 0 |
{"tests": "{\"inputs\": [\"6\\n1 1 2 2 2 3\\n\", \"4\\n1 2 3 2\\n\", \"6\\n2 4 1 1 2 2\\n\", \"10\\n10 11 10 11 10 11 10 11 10 11\\n\", \"20\\n2 3 4 5 6 7 8 9 8 7 6 5 4 3 2 1 5 6 5 6\\n\", \"8\\n1 2 2 2 2 3 3 3\\n\", \"4\\n294368194 294368194 294368194 294368195\\n\", \"3\\n1 2 1000000000\\n\", \"5\\n650111756 65011175... | One day Anna got the following task at school: to arrange several numbers in a circle so that any two neighboring numbers differs exactly by 1. Anna was given several numbers and arranged them in a circle to fulfill the task. Then she wanted to check if she had arranged the numbers correctly, but at this point her youn... | 0 |
{"tests": "{\"inputs\": [\"2 2 1 1\\n\", \"1 2 1 2\\n\", \"2 2 3 4\\n\", \"290186487 840456810 858082702 987072033\\n\", \"646353335 282521795 600933409 772270276\\n\", \"763237207 414005655 302120151 421405724\\n\", \"692 210 44175861 843331069\\n\", \"3 2 2 4\\n\", \"2 2 1 998244353\\n\", \"1 2 1 86583718\\n\", \"707... | Alice has got addicted to a game called Sirtet recently.
In Sirtet, player is given an n Γ m grid. Initially a_{i,j} cubes are stacked up in the cell (i,j). Two cells are called adjacent if they share a side. Player can perform the following operations:
* stack up one cube in two adjacent cells;
* stack up two ... | 0.625 |
{"tests": "{\"inputs\": [\"MIKE:MAX.,ARTEM:MIKE..,DMITRY:DMITRY.,DMITRY...\\n\", \"A:C:C:C:C.....\\n\", \"A:A..\\n\", \"VEEMU:VEEMU:GTE:GTE:KZZEDTUECE:VEEMU:GTE:CGOZKO:CGOZKO:GTE:ZZNAY.,GTE:MHMBC:GTE:VEEMU:CGOZKO:VEEMU:VEEMU.,CGOZKO:ZZNAY..................\\n\", \"V:V:V.,V.,V.,V.,V.,V.,V.,V.,V.,V.,V.,V.,V.,V.,V.,V.,V.,... | The Beroil corporation structure is hierarchical, that is it can be represented as a tree. Let's examine the presentation of this structure as follows:
* employee ::= name. | name:employee1,employee2, ... ,employeek.
* name ::= name of an employee
That is, the description of each employee consists of his name,... | 0 |
{"tests": "{\"inputs\": [\"199\\n60\\n40\\n\", \"100\\n50\\n50\\n\", \"978\\n467\\n371\\n\", \"101\\n11\\n22\\n\", \"349\\n478\\n378\\n\", \"600\\n221\\n279\\n\", \"425\\n458\\n118\\n\", \"961\\n173\\n47\\n\", \"961\\n443\\n50\\n\", \"133\\n53\\n124\\n\", \"1000\\n500\\n1\\n\", \"690\\n499\\n430\\n\", \"539\\n61\\n56\\... | Harry Potter and He-Who-Must-Not-Be-Named engaged in a fight to the death once again. This time they are located at opposite ends of the corridor of length l. Two opponents simultaneously charge a deadly spell in the enemy. We know that the impulse of Harry's magic spell flies at a speed of p meters per second, and the... | 0.625 |
{"tests": "{\"inputs\": [\"6\\n1 1 1 1 1 3\\n\", \"1\\n3\\n\", \"4\\n4 2 2 3\\n\", \"30\\n4 1 3 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5\\n\", \"4\\n4 2 4 1\\n\", \"30\\n1 3 4 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5\\n\", \"30\\n2 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5\\n\"... | One tradition of welcoming the New Year is launching fireworks into the sky. Usually a launched firework flies vertically upward for some period of time, then explodes, splitting into several parts flying in different directions. Sometimes those parts also explode after some period of time, splitting into even more par... | 0 |
{"tests": "{\"inputs\": [\"((1?(5?7))?((6?2)?7))\\n3 2\\n\", \"(1?1)\\n1 0\\n\", \"((1?(5?7))?((6?2)?7))\\n2 3\\n\", \"(2?(1?2))\\n1 1\\n\", \"(((6?((2?(9?(3?(2?((3?((1?(1?(6?(9?(((6?((3?(((((6?(1?(1?((((2?(1?(1?((6?(6?(4?(8?((9?(((7?((5?(9?(3?((((7?((9?(4?(8?(((((9?(1?(((8?(6?(6?((5?(((5?(7?((((1?((1?(4?((7?(8?(((3?((... | Ancient Egyptians are known to have understood difficult concepts in mathematics. The ancient Egyptian mathematician Ahmes liked to write a kind of arithmetic expressions on papyrus paper which he called as Ahmes arithmetic expression.
An Ahmes arithmetic expression can be defined as:
* "d" is an Ahmes arithmetic ... | 0 |
{"tests": "{\"inputs\": [\"5\\n0 0\\n0 1\\n1 1\\n1 -1\\n2 2\\n\", \"5\\n0 0\\n1 0\\n2 1\\n1 1\\n2 3\\n\", \"5\\n0 0\\n2 0\\n1 1\\n0 2\\n5 1\\n\", \"5\\n0 0\\n-1 0\\n-1 1\\n1 0\\n1 -1\\n\", \"8\\n0 0\\n1 0\\n2 0\\n3 0\\n0 1\\n1 1\\n2 1\\n3 1\\n\", \"11\\n-2 -2\\n2 3\\n3 -2\\n1 -2\\n2 -2\\n2 0\\n2 2\\n-3 -2\\n-1 -2\\n2 -... | You are given n points on Cartesian plane. Every point is a lattice point (i. e. both of its coordinates are integers), and all points are distinct.
You may draw two straight lines (not necessarily distinct). Is it possible to do this in such a way that every point lies on at least one of these lines?
Input
The firs... | 0.375 |
{"tests": "{\"inputs\": [\"3\\n1\\n6\\n8\\n\\nSAMPLE\", \"100\\n200\\n201\\n202\\n203\\n204\\n205\\n206\\n207\\n208\\n209\\n210\\n211\\n212\\n213\\n214\\n215\\n216\\n217\\n218\\n219\\n220\\n221\\n222\\n223\\n224\\n225\\n226\\n227\\n228\\n229\\n230\\n231\\n232\\n233\\n234\\n235\\n236\\n237\\n238\\n239\\n240\\n241\\n242\... | As we have seen our little Vaishanavi playing with the plywood, her brother Vaishnav was playing
with numbers.
Read about Factorial
As we all know this kid always thinks in a different way than others think. He have some numbers with him. He wants to find out that if he finds the factorial of the numbers that he ha... | 0.875 |
{"tests": "{\"inputs\": [\"40\", \"3\", \"11\", \"17\", \"22\", \"1\", \"19\", \"2\", \"9\", \"18\", \"4\", \"6\", \"15\", \"7\", \"30\", \"25\", \"48\", \"41\", \"81\", \"-1\", \"55\", \"-2\", \"57\", \"-3\", \"95\", \"-5\", \"94\", \"-6\", \"8\", \"-11\", \"5\", \"-14\", \"12\", \"-28\", \"-4\", \"-18\", \"10\", \"-2... | La Confiserie d'ABC sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes.
Constraints
* N is an integer between 1 and 10... | 0.875 |
{"tests": "{\"inputs\": [\"2\\n0 1\", \"5\\n0 1\\n0 2\\n0 3\\n3 4\", \"10\\n2 8\\n6 0\\n4 1\\n7 6\\n2 3\\n8 6\\n6 9\\n2 4\\n5 8\", \"2\\n0 2\", \"2\\n0 4\", \"2\\n0 5\", \"2\\n0 9\", \"2\\n0 18\", \"2\\n0 12\", \"2\\n0 17\", \"2\\n1 17\", \"2\\n1 21\", \"2\\n2 21\", \"2\\n2 27\", \"2\\n2 8\", \"2\\n0 8\", \"2\\n0 3\", ... | We have a tree with N vertices. The vertices are numbered 0 through N - 1, and the i-th edge (0 β€ i < N - 1) comnnects Vertex a_i and b_i. For each pair of vertices u and v (0 β€ u, v < N), we define the distance d(u, v) as the number of edges in the path u-v.
It is expected that one of the vertices will be invaded by ... | 0.75 |
{"tests": "{\"inputs\": [\"7 5\\n3 1 4 1 5 9 2\", \"15 10\\n1 5 6 10 11 11 11 20 21 25 25 26 99 99 99\", \"7 5\\n3 1 4 1 5 9 3\", \"15 10\\n1 5 6 10 11 11 11 20 21 25 25 26 99 83 99\", \"15 10\\n1 5 6 10 11 11 11 20 21 25 25 26 99 83 56\", \"15 10\\n1 5 6 10 11 11 11 20 21 25 25 26 99 124 99\", \"7 5\\n3 1 4 1 5 8 3\",... | Takahashi is playing with N cards.
The i-th card has an integer X_i on it.
Takahashi is trying to create as many pairs of cards as possible satisfying one of the following conditions:
* The integers on the two cards are the same.
* The sum of the integers on the two cards is a multiple of M.
Find the maximum numb... | 0 |
{"tests": "{\"inputs\": [\"1\\n11\\n111111\\n111111111111\\n12345\\n11111111119999999999\\n11111111113333333333\\n11111111118888888888\\n11111111112222222222111111111\\n11111111110000000000444444444\\n11224111122411\\n888888888888999999999999888888888888999999999999999999\\n666666666666666777333333333338888888888\\n111... | My arm is stuck and I can't pull it out.
I tried to pick up something that had rolled over to the back of my desk, and I inserted my arm while illuminating it with the screen of my cell phone instead of a flashlight, but I accidentally got caught in something and couldn't pull it out. It hurts if you move it forcibly.... | 0 |
{"tests": "{\"inputs\": [\"4\\n10.00000 10.00000 10.00000\\n20.00000 10.00000 10.00000\\n20.00000 20.00000 10.00000\\n10.00000 20.00000 10.00000\\n4\\n10.00000 10.00000 10.00000\\n10.00000 50.00000 50.00000\\n50.00000 10.00000 50.00000\\n50.00000 50.00000 10.00000\\n0\", \"4\\n10.00000 10.00000 10.00000\\n20.00000 10.0... | During a voyage of the starship Hakodate-maru (see Problem A), researchers found strange synchronized movements of stars. Having heard these observations, Dr. Extreme proposed a theory of "super stars". Do not take this term as a description of actors or singers. It is a revolutionary theory in astronomy.
According to... | 0 |
{"tests": "{\"inputs\": [\"4\\n1010\\n\", \"20\\n10101010101010\\n\", \"2\\n0\\n\", \"5\\n1\\n\", \"40\\n0010\\n\", \"39\\n00111\\n\", \"40\\n1010100001001010110011000110001\\n\", \"38\\n11111010100111100011\\n\", \"40\\n0001\\n\", \"40\\n1111\\n\", \"37\\n1111110000000000000000000000000000000\\n\", \"37\\n100110111000... | You are given a binary string s.
Find the number of distinct cyclical binary strings of length n which contain s as a substring.
The cyclical string t contains s as a substring if there is some cyclical shift of string t, such that s is a substring of this cyclical shift of t.
For example, the cyclical string "00011... | 0 |
{"tests": "{\"inputs\": [\"3 5\\n1 2 4\\n\", \"5 6\\n3 3 3 3 3\\n\", \"5 5\\n2 3 1 4 4\\n\", \"3 3\\n3 1 1\\n\", \"1 1000\\n548\\n\", \"9 12\\n3 3 3 3 3 5 8 8 11\\n\", \"5 4\\n4 2 2 2 2\\n\", \"10 100\\n1 1 1 1 1 1 1 1 1 6\\n\", \"5 100\\n3 1 1 1 3\\n\", \"50 1000000000\\n824428839 821375880 831521735 868908015 8699085... | You came to the exhibition and one exhibit has drawn your attention. It consists of n stacks of blocks, where the i-th stack consists of a_i blocks resting on the surface.
The height of the exhibit is equal to m. Consequently, the number of blocks in each stack is less than or equal to m.
There is a camera on the cei... | 0 |
{"tests": "{\"inputs\": [\"5 5 6\\n1 2 6 10 3\\n\", \"6 3 2\\n2 3 1 3 4 2\\n\", \"5 3 3\\n1 2 4 2 3\\n\", \"1 2 3\\n3\\n\", \"69 2 3\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\\n\", \"100 1 2\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1... | You are policeman and you are playing a game with Slavik. The game is turn-based and each turn consists of two phases. During the first phase you make your move and during the second phase Slavik makes his move.
There are n doors, the i-th door initially has durability equal to a_i.
During your move you can try to br... | 0 |
{"tests": "{\"inputs\": [\"5\\n1 1\\n5 5\\n00001\\n11111\\n00111\\n00110\\n00110\\n\", \"3\\n1 3\\n3 1\\n010\\n101\\n010\\n\", \"5\\n4 5\\n1 1\\n01111\\n11111\\n11110\\n11010\\n11000\\n\", \"10\\n9 9\\n2 2\\n1111111111\\n1000111111\\n1000111111\\n1111111111\\n1111000001\\n1111011111\\n1111010001\\n1111010101\\n11110001... | Alice lives on a flat planet that can be modeled as a square grid of size n Γ n, with rows and columns enumerated from 1 to n. We represent the cell at the intersection of row r and column c with ordered pair (r, c). Each cell in the grid is either land or water.
<image> An example planet with n = 5. It also appears i... | 0.875 |
{"tests": "{\"inputs\": [\"1\\n6 3 4\\n\", \"1\\n5 1 3\\n\", \"25\\n5 1 1\\n5 2 3\\n5 5 5\\n5 5 1\\n5 4 4\\n10 1 2\\n10 3 7\\n10 10 10\\n10 3 1\\n10 7 6\\n1000000 21232 1234\\n999999 999999 999999\\n1000000 300001 701321\\n1000000 290001 679121\\n500000 98765 123456\\n100 1 1\\n1000000000 1 1000000000\\n1000000000 1 50... | Nikolay has only recently started in competitive programming, but already qualified to the finals of one prestigious olympiad. There going to be n participants, one of whom is Nikolay. Like any good olympiad, it consists of two rounds. Tired of the traditional rules, in which the participant who solved the largest numb... | 0.25 |
{"tests": "{\"inputs\": [\"6\\n8\\n1 1 2 2 3 2 1 1\\n3\\n1 3 3\\n4\\n1 10 10 1\\n1\\n26\\n2\\n2 1\\n3\\n1 1 1\\n\", \"6\\n8\\n1 1 2 2 3 2 1 1\\n3\\n1 3 3\\n4\\n1 10 10 1\\n1\\n26\\n2\\n2 2\\n3\\n1 1 1\\n\", \"6\\n8\\n1 1 2 2 3 2 1 1\\n3\\n1 3 2\\n4\\n1 10 10 1\\n1\\n26\\n2\\n2 1\\n3\\n1 1 1\\n\", \"6\\n8\\n1 1 2 2 1 2 ... | The only difference between easy and hard versions is constraints.
You are given a sequence a consisting of n positive integers.
Let's define a three blocks palindrome as the sequence, consisting of at most two distinct elements (let these elements are a and b, a can be equal b) and is as follows: [\underbrace{a, a, ... | 0.25 |
{"tests": "{\"inputs\": [\"6\\n4 5\\n2 6\\n3 2\\n1 2\\n2 4\\n\", \"4\\n2 4\\n4 1\\n3 4\\n\", \"15\\n12 13\\n12 2\\n2 6\\n4 9\\n2 15\\n5 4\\n4 11\\n8 4\\n1 4\\n1 2\\n10 6\\n3 2\\n7 4\\n2 14\\n\", \"15\\n5 8\\n5 12\\n4 10\\n1 2\\n6 1\\n5 14\\n11 4\\n4 15\\n3 1\\n5 3\\n4 3\\n7 5\\n9 1\\n13 5\\n\", \"5\\n5 3\\n3 4\\n1 3\\n... | You are given a tree with n vertices. You are allowed to modify the structure of the tree through the following multi-step operation:
1. Choose three vertices a, b, and c such that b is adjacent to both a and c.
2. For every vertex d other than b that is adjacent to a, remove the edge connecting d and a and add t... | 0 |
{"tests": "{\"inputs\": [\"3\\n8\\n1 2 7 3 2 1 2 3\\n2\\n2 1\\n7\\n4 1 5 2 6 3 7\\n\", \"3\\n8\\n1 2 7 3 2 1 2 5\\n2\\n2 1\\n7\\n4 1 5 2 6 3 7\\n\", \"3\\n8\\n1 2 7 6 2 1 1 3\\n2\\n2 1\\n7\\n4 1 5 2 6 3 7\\n\", \"3\\n8\\n1 2 7 1 2 1 1 3\\n2\\n2 1\\n7\\n4 1 5 2 6 3 7\\n\", \"3\\n8\\n1 2 7 6 2 1 4 4\\n2\\n2 1\\n7\\n7 3 3... | Let's call a sequence b_1, b_2, b_3 ..., b_{k - 1}, b_k almost increasing if $$$min(b_1, b_2) β€ min(b_2, b_3) β€ ... β€ min(b_{k - 1}, b_k).$$$ In particular, any sequence with no more than two elements is almost increasing.
You are given a sequence of integers a_1, a_2, ..., a_n. Calculate the length of its longest alm... | 0.25 |
{"tests": "{\"inputs\": [\"2 4 2\\n\", \"1 4 3\\n\", \"6 13 1\\n\", \"10000 1000000 60000\\n\", \"1 3 1\\n\", \"11 11 6\\n\", \"2 1000000 10000\\n\", \"1 1000000 78498\\n\", \"999953 999953 2\\n\", \"404430 864261 6\\n\", \"690059 708971 10000\\n\", \"1 1 1000000\\n\", \"1 1000000 10000\\n\", \"100000 1000000 7821\\n\"... | You've decided to carry out a survey in the theory of prime numbers. Let us remind you that a prime number is a positive integer that has exactly two distinct positive integer divisors.
Consider positive integers a, a + 1, ..., b (a β€ b). You want to find the minimum integer l (1 β€ l β€ b - a + 1) such that for any int... | 0 |
{"tests": "{\"inputs\": [\"3\\n1 2 3\\n\", \"3\\n1 1 1\\n\", \"3\\n1 2 1000\\n\", \"2\\n1 1\\n\", \"30\\n6 7 7 6 7 7 7 7 7 7 7 7 7 7 7 5 7 7 7 7 2 1 5 3 7 3 2 7 5 1\\n\", \"20\\n4 4 3 4 4 4 4 4 4 4 4 3 3 2 1 4 4 3 3 3\\n\", \"3\\n1 1 2\\n\", \"200\\n11 23 6 1 15 6 5 9 8 9 13 11 7 21 14 17 8 8 12 6 18 4 9 20 3 9 6 9 9 1... | Berland scientists know that the Old Berland language had exactly n words. Those words had lengths of l1, l2, ..., ln letters. Every word consisted of two letters, 0 and 1. Ancient Berland people spoke quickly and didnβt make pauses between the words, but at the same time they could always understand each other perfect... | 0 |
{"tests": "{\"inputs\": [\"3 4\\n\", \"4 4\\n\", \"1 1\\n\", \"100 100\\n\", \"997167959139 7344481199252\\n\", \"20000000 10000000\\n\", \"1666199186071 28985049\\n\", \"2213058376259 2126643910770\\n\", \"7244641009859 6300054748096\\n\", \"4690824608515 2078940751563\\n\", \"8451941492387 3119072235422\\n\", \"99999... | Calculate the value of the sum: n mod 1 + n mod 2 + n mod 3 + ... + n mod m. As the result can be very large, you should print the value modulo 109 + 7 (the remainder when divided by 109 + 7).
The modulo operator a mod b stands for the remainder after dividing a by b. For example 10 mod 3 = 1.
Input
The only line co... | 0.375 |
{"tests": "{\"inputs\": [\"10\\n\", \"1\\n\", \"8\\n\", \"149344197\\n\", \"13\\n\", \"1000000000000000\\n\", \"4\\n\", \"999999999999999\\n\", \"998749999999991\\n\", \"49729446417673\\n\", \"57857854\\n\", \"550368702711851\\n\", \"7\\n\", \"151269640772354\\n\", \"6\\n\", \"99999\\n\", \"116003\\n\", \"81258\\n\", \... | Bad news came to Mike's village, some thieves stole a bunch of chocolates from the local factory! Horrible!
Aside from loving sweet things, thieves from this area are known to be very greedy. So after a thief takes his number of chocolates for himself, the next thief will take exactly k times more than the previous o... | 0.625 |
{"tests": "{\"inputs\": [\"5\\n1 4 3 2 5\\n\", \"5\\n1 2 2 2 1\\n\", \"7\\n10 20 40 50 70 90 30\\n\", \"2\\n1 15\\n\", \"4\\n36 54 55 9\\n\", \"5\\n984181411 215198610 969039668 60631313 85746445\\n\", \"10\\n12528139 986722043 1595702 997595062 997565216 997677838 999394520 999593240 772077 998195916\\n\", \"1\\n1\\n\... | Polycarp plans to conduct a load testing of its new project Fakebook. He already agreed with his friends that at certain points in time they will send requests to Fakebook. The load testing will last n minutes and in the i-th minute friends will send ai requests.
Polycarp plans to test Fakebook under a special kind of... | 0 |
{"tests": "{\"inputs\": [\"1 3 5\\n\", \"1 1 1\\n\", \"6 2 9\\n\", \"1 2 2\\n\", \"84 29 61\\n\", \"2048 4096 1024\\n\", \"1 2 3\\n\", \"1171 2989 2853\\n\", \"1158 506 4676\\n\", \"5000 1 1\\n\", \"4756 775 3187\\n\", \"28 47 1\\n\", \"2 1 1\\n\", \"4998 4998 4998\\n\", \"17 46 45\\n\", \"3238 2923 4661\\n\", \"5 9 4\... | β This is not playing but duty as allies of justice, Nii-chan!
β Not allies but justice itself, Onii-chan!
With hands joined, go everywhere at a speed faster than our thoughts! This time, the Fire Sisters β Karen and Tsukihi β is heading for somewhere they've never reached β water-surrounded islands!
There are three... | 0.125 |
{"tests": "{\"inputs\": [\"3\\nabb\\ndad\\n\", \"8\\ndrpepper\\ncocacola\\n\", \"3\\nabb\\ndad\\n\", \"10\\ndaefcecfae\\nccdaceefca\\n\", \"100\\npfkskdknmbxxslokqdliigxyvntsmaziljamlflwllvbhqnzpyvvzirhhhglsskiuogfoytcxjmospipybckwmkjhnfjddweyqqi\\nakvzmboxlcfwccaoknrzrhvqcdqkqnywstmxinqbkftnbjmahrvexoipikkqfjjmasnxofh... | Valya and Tolya are an ideal pair, but they quarrel sometimes. Recently, Valya took offense at her boyfriend because he came to her in t-shirt with lettering that differs from lettering on her pullover. Now she doesn't want to see him and Tolya is seating at his room and crying at her photos all day long.
This story c... | 0 |
{"tests": "{\"inputs\": [\"2\\n4\\n3 1\\n3\\n2 1\\n\\nSAMPLE\", \"10\\n38\\n4 34\\n90\\n67 23\\n54\\n25 29\\n56\\n23 33\\n97\\n74 23\\n48\\n9 39\\n98\\n52 46\\n31\\n5 26\\n11\\n5 6\\n96\\n36 60\", \"10\\n57\\n4 53\\n90\\n82 8\\n85\\n5 80\\n28\\n14 14\\n74\\n29 45\\n64\\n13 51\\n97\\n56 41\\n24\\n22 2\\n3\\n3 0\\n88\\n6... | Little Jhool was was the most intelligent kid of his school. But he did NOT like his class teacher, his school, and the way he was taught things in school. Well, he was a rebel, to say the least. Like most of us, he hated being punished by his teacher - specially, when the punishment was to sit beside someone of the o... | 0 |
{"tests": "{\"inputs\": [\"1\\n2 3 2 5 50 25\\n\\nSAMPLE\", \"10\\n2 3 327 123 7 18\\n8 5 29 132 18 17\\n2 2 69 28 12 6\\n8 10 81 77 16 0\\n5 9 82 182 1 8\\n7 4 92 133 15 17\\n1 3 55 56 3 17\\n3 9 37 160 4 14\\n5 3 11 109 10 9\\n5 9 82 182 1 8\", \"10\\n2 3 327 123 7 18\\n8 5 29 132 18 17\\n2 2 69 28 12 6\\n0 10 81 77 ... | Samu is playing a shooting game in play station. There are two apples to aim in this shooting game. Hitting first apple will provide her X points and hitting second apple will provide her Y points. And if she misses the apple she chose to hit, she wont get any point.
Now she is having N coins and each shoot will cost... | 0.125 |
{"tests": "{\"inputs\": [\"2\\n1 3 4\\n0 3 5\\n\\nSAMPLE\", \"2\\n1 3 5\\n0 3 5\\n\\nSAMPLE\", \"2\\n1 3 5\\n0 5 5\\n\\nSAMPLE\", \"2\\n0 3 5\\n0 5 5\\n\\nSAMPLE\", \"2\\n0 3 5\\n-1 5 5\\n\\nSAMPLE\", \"2\\n1 3 5\\n-1 5 5\\n\\nSAMPLE\", \"2\\n1 2 1\\n-1 0 3\\n\\nNASOLE\", \"2\\n1 2 1\\n-1 0 6\\n\\nNASOLE\", \"2\\n1 2 1... | Sunny, Arpit and Kunal are playing a game. All three of them are standing on a number line, each occupying a different integer.
The rules are as follows:
Two of them cannot be at the same integer at same time.
In one move, one of them, who is not between the other two, can jump to a integer ( if there is any space )... | 0.125 |
{"tests": "{\"inputs\": [\"6\\n250 240 230 220 210 211\\n5000 4500 4000 3500 3000 3000\\n50000\\n\\nSAMPLE\", \"6\\n250 437 230 220 210 211\\n5000 4500 4000 3500 3000 3000\\n50000\\n\\nSAMPLE\", \"6\\n250 763 230 220 210 211\\n4704 4500 4000 3500 3166 3000\\n50000\\n\\nSAMPLE\", \"6\\n51 763 220 31 114 555\\n6141 4500 ... | You have to go on a trip in your car which can hold a limited amount of fuel. You know how many liters of fuel your car uses per hour for certain speeds and you have to find out how far a certain amount of fuel will take you when travelling at the optimal speed.
You will be given a set of speeds, a corresponding set ... | 0 |
{"tests": "{\"inputs\": [\"ABA\", \"BBA\", \"BBB\", \"AAB\", \"AAA\", \"ABB\", \"BAA\", \"BAB\", \"BAA\", \"BAB\", \"AAA\", \"AAB\", \"ABB\"], \"outputs\": [\"Yes\", \"Yes\", \"No\", \"Yes\\n\", \"No\\n\", \"Yes\\n\", \"Yes\\n\", \"Yes\\n\", \"Yes\\n\", \"Yes\\n\", \"No\\n\", \"Yes\\n\", \"Yes\\n\"]}", "source": "prime... | In AtCoder City, there are three stations numbered 1, 2, and 3.
Each of these stations is operated by one of the two railway companies, A and B. A string S of length 3 represents which company operates each station. If S_i is `A`, Company A operates Station i; if S_i is `B`, Company B operates Station i.
To improve t... | 0.875 |
{"tests": "{\"inputs\": [\"3\", \"100\", \"5\", \"000\", \"9\", \"001\", \"7\", \"110\", \"101\", \"2\", \"111\", \"-1\", \"4\", \"8\", \"11\", \"-2\", \"-3\", \"-6\", \"6\", \"10\", \"-4\", \"-8\", \"-16\", \"-32\", \"-57\", \"-60\", \"-91\", \"-48\", \"-39\", \"-35\", \"-67\", \"-102\", \"-161\", \"-151\", \"-46\", \... | Given an integer N not less than 3, find the sum of the interior angles of a regular polygon with N sides.
Print the answer in degrees, but do not print units.
Constraints
* 3 \leq N \leq 100
Input
Input is given from Standard Input in the following format:
N
Output
Print an integer representing the sum of th... | 0.875 |
{"tests": "{\"inputs\": [\"#ffe085\\n#787878\\n#decade\\n#ff55ff\\n0\", \"ffe085\\n787878\\ndecade\\nff55ff\\n0\", \"ffe085\\n787878\\ndfcade\\nff55ff\\n0\", \"#ffe085\\n#787878\\n\\\"decade\\n#ff55ff\\n0\", \"8fe0f5\\n976991\\ndebade\\nff55ff\\n0\", \"8fe0f5\\n1006397\\ndebade\\nff55ff\\n0\", \"#ffe075\\n#787878\\n#de... | Taro, who aims to become a web designer, is currently training. My senior at the office tells me that the background color of this page is # ffe085, which is a color number peculiar to web design, but I can't think of what kind of color it is.
This color number represents the intensity of each of the three primary col... | 0 |
{"tests": "{\"inputs\": [\"None\", \"10\\n4\\n7\\n9\\n10\\n12\\n13\\n16\\n17\\n19\\n20\", \"enoN\", \"10\\n4\\n7\\n9\\n10\\n12\\n13\\n20\\n17\\n19\\n20\", \"10\\n8\\n7\\n8\\n10\\n12\\n13\\n20\\n17\\n19\\n20\", \"10\\n8\\n0\\n8\\n10\\n12\\n13\\n20\\n17\\n19\\n20\", \"10\\n8\\n0\\n18\\n10\\n0\\n13\\n20\\n17\\n19\\n2\", \... | IOI Real Estate rents condominiums. The apartment room handled by this company is 1LDK, and the area is 2xy + x + y as shown in the figure below. However, x and y are positive integers.
Figure_Madori
In the IOI real estate catalog, the areas of condominiums are listed in ascending order (in ascending order), but it... | 0 |
{"tests": "{\"inputs\": [\"6 5\\n 1 3 10\\n 2 3 12\\n 3 4 2\\n 4 5 13\\n 4 6 11\\n10 10\\n 1 2 11\\n 2 3 25\\n 2 5 81\\n 2 6 82\\n 4 5 58\\n 5 9 68\\n 6 7 80\\n 6 9 67\\n 8 9 44\\n 9 10 21\\n 0 0\", \"6 5\\n1 3 10\\n2 3 12\\n3 4 2\\n4 5 13\\n4 6 11\\n10 10\\n1 2 11\\n2 3 ... | Travelling by train is fun and exciting. But more than that indeed. Young challenging boys often tried to purchase the longest single tickets and to single ride the longest routes of various railway systems. Route planning was like solving puzzles. However, once assisted by computers, and supplied with machine readable... | 0.375 |
{"tests": "{\"inputs\": [\"8\\n2\\nomura\\ntoshio\\nraku\\ntanaka\\nimura\\nyoshoi\\nhayashi\\nmiura\\n3\\n1\\ntasaka\\nnakata\\ntanaka\\n1\\n1\\nfoo\\n5\\n2\\npsqt\\nabcdef\\nabzdefa\\npqrst\\nabdxcef\\n0\", \"8\\n2\\nomura\\ntoshio\\nraku\\ntanaka\\ninura\\nyoshoi\\nhayashi\\nmiura\\n3\\n1\\ntasaka\\nnakata\\ntanaka\... | Meikyokan University is very famous for its research and education in the area of computer science. This university has a computer center that has advanced and secure computing facilities including supercomputers and many personal computers connected to the Internet.
One of the policies of the computer center is to le... | 0.125 |
{"tests": "{\"inputs\": [\"4 5\\n1 3 5\\n3 4 6\\n4 2 7\\n2 1 18\\n2 3 12\", \"4 5\\n1 3 5\\n3 4 6\\n4 2 7\\n2 1 18\\n2 3 17\", \"4 5\\n1 3 5\\n3 4 6\\n4 2 7\\n2 1 6\\n2 3 17\", \"4 5\\n1 3 5\\n3 2 6\\n4 2 7\\n2 1 18\\n2 3 12\", \"4 5\\n1 3 5\\n3 4 6\\n4 2 13\\n2 1 6\\n2 3 17\", \"4 1\\n1 3 5\\n3 2 6\\n4 2 7\\n2 1 18\\n... | Problem F Pizza Delivery
Alyssa is a college student, living in New Tsukuba City. All the streets in the city are one-way. A new social experiment starting tomorrow is on alternative traffic regulation reversing the one-way directions of street sections. Reversals will be on one single street section between two adjac... | 0 |
{"tests": "{\"inputs\": [\"3 1\\n3 4\\n10 20\\n100 50\\n2 500000\\n0 0\", \"3 2\\n3 4\\n10 20\\n100 50\\n2 500000\\n0 0\", \"3 2\\n3 4\\n13 20\\n100 50\\n2 500000\\n0 0\", \"3 2\\n3 4\\n22 20\\n100 50\\n2 500000\\n0 0\", \"3 1\\n3 4\\n10 20\\n100 50\\n3 500000\\n0 0\", \"3 2\\n3 4\\n13 20\\n100 50\\n4 500000\\n0 0\", \... | Bamboo Blossoms
The bamboos live for decades, and at the end of their lives, they flower to make their seeds. Dr. ACM, a biologist, was fascinated by the bamboos in blossom in his travel to Tsukuba. He liked the flower so much that he was tempted to make a garden where the bamboos bloom annually. Dr. ACM started resea... | 0 |
{"tests": "{\"inputs\": [\"[+c[+a[^bd]]]\\n0404\\n[*b[*[*cd]a]]\\n7777\\n[^[^ab][^cd]]\\n1295\\na\\n9876\\n[^dd]\\n9090\\n.\", \"[+c[+a[^bd]]]\\n0404\\n[*b[*[*cd]a]]\\n7777\\n[^[^ab][^cd]]\\n2570\\na\\n9876\\n[^dd]\\n9090\\n.\", \"[+c[*a[^bd]]]\\n0404\\n[*b[*[*cd]a]]\\n7777\\n[^[^ab][^cd]]\\n2570\\na\\n9876\\n[^dd]\\n9... | Proof of knowledge
The entrance door of the apartment you live in has a password-type lock. This password consists of exactly four digits, ranging from 0 to 9, and you always use the password P given to you by the apartment manager to unlock this door.
One day, you wondered if all the residents of the apartment were ... | 0 |
{"tests": "{\"inputs\": [\"3\\n2 0 0\\n1 1\\n5 1 0 0 1 0\", \"2\\n1 1\\n1 0\", \"3\\n2 0 0\\n1 1\\n10 1 0 0 1 0\", \"2\\n1 1\\n3 0\", \"2\\n1 1\\n2 0\", \"3\\n2 0 0\\n1 1\\n10 1 0 0 2 0\", \"2\\n1 0\\n2 0\", \"3\\n3 0 0\\n1 1\\n10 1 0 0 2 0\", \"2\\n1 1\\n2 -1\", \"3\\n3 0 0\\n1 1\\n10 2 0 0 2 0\", \"2\\n1 1\\n2 -2\", ... | Problem
There are $ N $ Amidakuji with 3 vertical lines.
No matter which line you start from, the Amidakuji that ends at the starting line is considered a good Amidakuji.
You can select one or more Amidakuji and connect them vertically in any order.
Output "yes" if you can make a good Amidakuji, otherwise output "no".... | 0.25 |
{"tests": "{\"inputs\": [\"1\\n4 2 3 10\\n7 7 7\\n4 6 10\\n7 10 9\\n9 9\", \"1\\n4 2 3 10\\n9 7 7\\n4 6 10\\n7 10 9\\n9 9\", \"1\\n4 3 3 10\\n9 7 7\\n4 6 10\\n7 10 9\\n9 9\", \"1\\n4 3 3 10\\n9 7 7\\n4 6 9\\n2 10 9\\n9 9\", \"1\\n4 2 3 10\\n7 7 7\\n2 6 10\\n7 10 9\\n9 9\", \"1\\n4 2 3 14\\n7 7 7\\n10 6 10\\n7 10 9\\n9 ... | The faculty of application management and consulting services (FAMCS) of the Berland State University (BSU) has always been popular among Berland's enrollees. This year, N students attended the entrance exams, but no more than K will enter the university. In order to decide who are these students, there are series of e... | 0.375 |
{"tests": "{\"inputs\": [\"2\\nabcDCE\\nhtQw27\\n\", \"1\\nA00\\n\", \"1\\na00\\n\", \"1\\n825\\n\", \"1\\nNV641\\n\", \"1\\naAbAcDeF\\n\", \"1\\n000\\n\", \"6\\n11b\\n4bh\\nBeh\\nTuY\\n1YJ\\nP28\\n\", \"1\\nM62H\\n\", \"3\\nafd\\n142\\nTRE\\n\", \"2\\nabcDCE\\nhtQw27\\n\", \"4\\nYtG3\\n33Yo\\n123n\\nm23m\\n\", \"1\\n0... | Vasya came up with a password to register for EatForces β a string s. The password in EatForces should be a string, consisting of lowercase and uppercase Latin letters and digits.
But since EatForces takes care of the security of its users, user passwords must contain at least one digit, at least one uppercase Latin l... | 0 |
{"tests": "{\"inputs\": [\"4\\n0 0 0 0\\n2\\n2 3\\n1\\n2\\n3\\n2 4 1\\n4\\n3 1 2 1\\n6\\n1 0\\n2 0\\n3 -1\\n4 -2\\n1 1\\n1 5\\n\", \"4\\n4 -5 -3 -1\\n2\\n2 3\\n1\\n2\\n3\\n2 4 1\\n4\\n3 1 2 1\\n6\\n1 0\\n2 0\\n3 -1\\n4 -2\\n1 1\\n1 5\\n\", \"1\\n0\\n1\\n1\\n1\\n1 0\\n\", \"4\\n0 0 0 0\\n2\\n2 3\\n1\\n2\\n3\\n2 4 1\\n4\... | Gildong is experimenting with an interesting machine Graph Traveler. In Graph Traveler, there is a directed graph consisting of n vertices numbered from 1 to n. The i-th vertex has m_i outgoing edges that are labeled as e_i[0], e_i[1], β¦, e_i[m_i-1], each representing the destination vertex of the edge. The graph can h... | 0.125 |
{"tests": "{\"inputs\": [\"5\\nababa\\ncodedoca\\nabcda\\nzxzytyz\\nabcdefghijklmnopqrstuvwxyza\\n\", \"5\\nababa\\ncodedoca\\nabcda\\nzxzytyz\\nabcdefghjjklmnopqrstuvwxyza\\n\", \"5\\nababa\\ncodedoca\\nabcda\\nzxtyzyz\\nazyxwvutsrqponmlkjjhgfedcba\\n\", \"5\\nababa\\ncodfdoca\\nabcda\\nzxzytyz\\nabcdefghjjklmnopqrstu... | Polycarp wants to assemble his own keyboard. Layouts with multiple rows are too complicated for him β his keyboard will consist of only one row, where all 26 lowercase Latin letters will be arranged in some order.
Polycarp uses the same password s on all websites where he is registered (it is bad, but he doesn't care)... | 0 |
{"tests": "{\"inputs\": [\"3\\n4\\n1 3 4 2\\n1 2 2 3\\n5\\n2 3 4 5 1\\n1 2 3 4 5\\n8\\n7 4 5 6 1 8 3 2\\n5 3 6 4 7 5 8 4\\n\", \"3\\n4\\n1 3 4 2\\n1 2 2 3\\n5\\n2 3 4 5 1\\n1 2 3 4 5\\n8\\n7 4 5 6 1 8 3 2\\n5 3 6 8 7 5 8 4\\n\", \"3\\n4\\n1 3 4 2\\n1 2 2 3\\n5\\n2 3 4 5 1\\n1 2 5 4 5\\n8\\n7 4 5 6 1 8 3 2\\n5 3 6 4 7 5... | You are given a colored permutation p_1, p_2, ..., p_n. The i-th element of the permutation has color c_i.
Let's define an infinite path as infinite sequence i, p[i], p[p[i]], p[p[p[i]]] ... where all elements have same color (c[i] = c[p[i]] = c[p[p[i]]] = ...).
We can also define a multiplication of permutations a a... | 0.125 |
{"tests": "{\"inputs\": [\"7\\n19 20 1\\n13 15 2\\n6 11 2\\n4 10 1\\n14 17 1\\n13 13 2\\n5 9 1\\n\", \"5\\n5 8 1\\n1 3 2\\n3 4 2\\n6 6 1\\n2 10 2\\n\", \"3\\n1 3 1\\n4 6 2\\n2 5 1\\n\", \"10\\n1 20 1\\n11 17 2\\n3 15 2\\n3 9 2\\n3 14 1\\n16 18 2\\n6 9 2\\n13 17 2\\n10 17 2\\n7 13 1\\n\", \"12\\n1 2 2\\n6 7 2\\n2 4 1\\n... | You are given n segments [l_1, r_1], [l_2, r_2], ..., [l_n, r_n]. Each segment has one of two colors: the i-th segment's color is t_i.
Let's call a pair of segments i and j bad if the following two conditions are met:
* t_i β t_j;
* the segments [l_i, r_i] and [l_j, r_j] intersect, embed or touch, i. e. there ex... | 0 |
{"tests": "{\"inputs\": [\"7\\n1 2 3 4 5 6 7\\n\", \"3\\n2 2 3\\n\", \"6\\n1 2 2 3 4 5\\n\", \"12\\n1 1 1 2 2 2 3 3 3 4 4 4\\n\", \"20\\n7 6 6 7 2 2 2 2 2 6 1 5 3 4 5 7 1 6 1 4\\n\", \"6\\n1 1 2 2 2 2\\n\", \"12\\n4 4 4 3 3 3 2 2 2 1 1 1\\n\", \"20\\n4 2 2 2 5 2 4 2 2 3 5 2 1 3 1 2 2 5 4 3\\n\", \"12\\n2 2 2 3 3 3 4 4 ... | As meticulous Gerald sets the table and caring Alexander sends the postcards, Sergey makes snowmen. Each showman should consist of three snowballs: a big one, a medium one and a small one. Sergey's twins help him: they've already made n snowballs with radii equal to r1, r2, ..., rn. To make a snowman, one needs any thr... | 0 |
{"tests": "{\"inputs\": [\"5 4\\n1 2 1\\n2 3 1\\n1 3 6\\n4 5 8\\n\", \"3 2\\n2 1 4\\n1 3 2\\n\", \"5 5\\n1 2 1\\n2 3 1\\n3 4 1\\n1 5 1\\n5 4 10\\n\", \"18 27\\n3 16 55467\\n17 11 829\\n5 12 15831\\n14 6 24056\\n5 2 63216\\n15 6 38762\\n2 6 10654\\n12 6 51472\\n11 9 79384\\n1 6 67109\\n5 13 86794\\n7 6 74116\\n10 3 4403... | You are given a directed acyclic graph (a directed graph that does not contain cycles) of n vertices and m arcs. The i-th arc leads from the vertex x_i to the vertex y_i and has the weight w_i.
Your task is to select an integer a_v for each vertex v, and then write a number b_i on each arcs i such that b_i = a_{x_i} -... | 0 |
{"tests": "{\"inputs\": [\"121\\n\", \"5\\n\", \"768617061415848\\n\", \"6816793298\\n\", \"634\\n\", \"7\\n\", \"1\\n\", \"33388991\\n\", \"513\\n\", \"98596326741327\\n\", \"973546235465729\\n\", \"1079175250322\\n\", \"30272863\\n\", \"21\\n\", \"2\\n\", \"11472415\\n\", \"82415\\n\", \"185\\n\", \"2038946593\\n\", ... | Prof. Vasechkin wants to represent positive integer n as a sum of addends, where each addends is an integer number containing only 1s. For example, he can represent 121 as 121=111+11+β1. Help him to find the least number of digits 1 in such sum.
Input
The first line of the input contains integer n (1 β€ n < 1015).
Ou... | 0 |
{"tests": "{\"inputs\": [\"4 8\\n7 8 7 5 4 6 4 10\\n1 6\\n1 2\\n5 8\\n1 3\\n3 5\\n6 7\\n3 4\\n\", \"0 3\\n1 2 3\\n1 2\\n2 3\\n\", \"1 4\\n2 1 3 2\\n1 2\\n1 3\\n3 4\\n\", \"18 29\\n18 2 24 10 8 10 19 12 16 2 2 23 15 17 29 13 10 14 21 8 2 13 23 29 20 3 18 16 22\\n11 23\\n10 19\\n14 22\\n14 17\\n25 26\\n7 25\\n7 11\\n6 13... | As you know, an undirected connected graph with n nodes and n - 1 edges is called a tree. You are given an integer d and a tree consisting of n nodes. Each node i has a value ai associated with it.
We call a set S of tree nodes valid if following conditions are satisfied:
1. S is non-empty.
2. S is connected. In ... | 0 |
{"tests": "{\"inputs\": [\"4\\n1 1\\n5 1\\n5 3\\n1 3\\n\", \"4\\n0 2\\n2 0\\n3 5\\n5 3\\n\", \"10\\n1 0\\n1 -3\\n1 5\\n1 -2\\n1 5\\n1 -2\\n1 -2\\n1 -2\\n1 -2\\n1 -2\\n\", \"60\\n-20 179\\n-68 0\\n-110 68\\n-22 177\\n47 140\\n-49 -4\\n-106 38\\n-23 22\\n20 193\\n47 173\\n-23 22\\n-100 32\\n-97 29\\n47 124\\n-49 -4\\n20 ... | The Happy Farm 5 creators decided to invent the mechanism of cow grazing. The cows in the game are very slow and they move very slowly, it can even be considered that they stand still. However, carnivores should always be chased off them.
For that a young player Vasya decided to make the shepherd run round the cows a... | 0 |
{"tests": "{\"inputs\": [\"3\\n10 200 300\\n4\\n1 2 2 3\\n\", \"3\\n1 2 3\\n4\\n1 2 2 3\\n\", \"6\\n2 3 5 7 11 13\\n5\\n3 4 5 5 6\\n\", \"6\\n2 3 5 7 11 13\\n9\\n1 2 2 3 3 4 5 5 6\\n\", \"3\\n1 3 11\\n6\\n1 2 2 2 3 3\\n\", \"4\\n2 3 5 7\\n8\\n1 2 2 2 3 3 3 4\\n\", \"3\\n1 3 11\\n3\\n1 2 3\\n\", \"2\\n1 1000000000\\n4\\... | In Berland a bus travels along the main street of the capital. The street begins from the main square and looks like a very long segment. There are n bus stops located along the street, the i-th of them is located at the distance ai from the central square, all distances are distinct, the stops are numbered in the orde... | 0 |
{"tests": "{\"inputs\": [\"5 2\\n1 5\\n5 1\\n\", \"100000 1\\n300 400\\n\", \"3 3\\n1 1\\n3 1\\n2 2\\n\", \"99999 1\\n54016 16192\\n\", \"99991 9\\n80814 65974\\n12100 98787\\n9390 76191\\n5628 47659\\n80075 25361\\n75330 1630\\n38758 99962\\n33848 40352\\n43732 52281\\n\", \"1 1\\n1 1\\n\", \"330 17\\n259 262\\n146 20... | Vasya has the square chessboard of size n Γ n and m rooks. Initially the chessboard is empty. Vasya will consequently put the rooks on the board one after another.
The cell of the field is under rook's attack, if there is at least one rook located in the same row or in the same column with this cell. If there is a roo... | 0.5 |
{"tests": "{\"inputs\": [\"4 2\\n1 2 3 2\\n\", \"7 3\\n1 3 2 2 2 2 1\\n\", \"4 4\\n1000000000 100 7 1000000000\\n\", \"10 4\\n1 1 2 2 3 3 4 4 4 4\\n\", \"1 1\\n381183829\\n\", \"10 2\\n1 1 1 1 1 1 3 4 5 6\\n\", \"7 3\\n2 2 2 1 3 7 6\\n\", \"7 2\\n2 2 2 2 2 2 3\\n\", \"10 2\\n20515728 1 580955166 856585851 1 738372422 1... | Polycarp is a music editor at the radio station. He received a playlist for tomorrow, that can be represented as a sequence a1, a2, ..., an, where ai is a band, which performs the i-th song. Polycarp likes bands with the numbers from 1 to m, but he doesn't really like others.
We define as bj the number of songs the g... | 0 |
{"tests": "{\"inputs\": [\"2 2\\n.X\\nXX\\n\", \"5 5\\n.....\\n..X..\\n.....\\n.....\\n.....\\n\", \"2 3\\nXXX\\nXXX\\n\", \"5 5\\nXXX..\\n.XXX.\\n..XXX\\nXXX..\\n.XXX.\\n\", \"4 4\\nXX..\\n.XX.\\n..XX\\n....\\n\", \"3 3\\n.XX\\nXX.\\nXX.\\n\", \"10 1\\n.\\n.\\n.\\n.\\nX\\n.\\n.\\n.\\n.\\n.\\n\", \"6 8\\nXXXXXX..\\nXXX... | Hongcow likes solving puzzles.
One day, Hongcow finds two identical puzzle pieces, with the instructions "make a rectangle" next to them. The pieces can be described by an n by m grid of characters, where the character 'X' denotes a part of the puzzle and '.' denotes an empty part of the grid. It is guaranteed that th... | 0.125 |
{"tests": "{\"inputs\": [\"1 1\\n1\\n\", \"2 2\\n1\\n2\\n\", \"1 1\\n1000\\n\", \"3 5\\n1\\n4\\n20\\n50\\n300\\n\", \"5 6\\n1\\n2\\n3\\n4\\n5\\n6\\n\", \"8 10\\n50\\n150\\n250\\n350\\n450\\n550\\n650\\n750\\n850\\n950\\n\", \"6 6\\n10\\n20\\n30\\n40\\n50\\n60\\n\", \"990 1\\n990\\n\", \"7 10\\n100\\n200\\n300\\n400\\n5... | Jon Snow is on the lookout for some orbs required to defeat the white walkers. There are k different types of orbs and he needs at least one of each. One orb spawns daily at the base of a Weirwood tree north of the wall. The probability of this orb being of any kind is equal. As the north of wall is full of dangers, he... | 0 |
{"tests": "{\"inputs\": [\"10\\n\", \"11\\n\", \"1033\\n\", \"100020001\\n\", \"100000000000000000222\\n\", \"8008\\n\", \"10000555\\n\", \"20020201\\n\", \"7\\n\", \"10001\\n\", \"2000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002\\n\", \"8059\\n\", \"100000001\\n\", \... | A positive integer number n is written on a blackboard. It consists of not more than 105 digits. You have to transform it into a beautiful number by erasing some of the digits, and you want to erase as few digits as possible.
The number is called beautiful if it consists of at least one digit, doesn't have leading zer... | 0 |
{"tests": "{\"inputs\": [\"22\\n\", \"11\\n\", \"4\\n\", \"9\\n\", \"1024\\n\", \"718351\\n\", \"246206\\n\", \"2\\n\", \"6\\n\", \"3751\\n\", \"3607\\n\", \"101\\n\", \"1000000\\n\", \"59637\\n\", \"8\\n\", \"5\\n\", \"3\\n\", \"607443\\n\", \"10\\n\", \"19\\n\", \"23\\n\", \"999999\\n\", \"31\\n\", \"15\\n\", \"34788... | Your security guard friend recently got a new job at a new security company. The company requires him to patrol an area of the city encompassing exactly N city blocks, but they let him choose which blocks. That is, your friend must walk the perimeter of a region whose area is exactly N blocks. Your friend is quite lazy... | 0 |
{"tests": "{\"inputs\": [\"6 2\\n5 5 6 8 3 12\\n\", \"1 1\\n5\\n\", \"3 10\\n1 100 1000\\n\", \"5 300\\n939 465 129 611 532\\n\", \"5 1\\n416 387 336 116 81\\n\", \"2 1\\n2 20\\n\", \"3 2\\n10 10 100\\n\", \"1 1\\n1\\n\", \"3 10\\n1 000 1000\\n\", \"5 300\\n939 465 246 611 532\\n\", \"5 1\\n416 387 230 116 81\\n\", \"2... | Carol is currently curling.
She has n disks each with radius r on the 2D plane.
Initially she has all these disks above the line y = 10100.
She then will slide the disks towards the line y = 0 one by one in order from 1 to n.
When she slides the i-th disk, she will place its center at the point (xi, 10100). She w... | 0 |
{"tests": "{\"inputs\": [\"6\\naaabc\\naaade\\nbacd\\ncde\\ncda\\ncca\\n\\nSAMPLE\", \"2\\nba\\nab\", \"3\\nabc\\naca\\nca\", \"5\\nzc\\ncca\\ndfazc\\nfcaff\\naaaaaaaaa\", \"5\\nzc\\ncca\\ndfazc\\nfdaff\\naaaaaaaaa\", \"6\\naaabc\\naaade\\nbcad\\ncde\\ncda\\ncca\\n\\nSAMPLE\", \"2\\nab\\nab\", \"3\\nabc\\n`ca\\nca\", \... | Consider a new order of english alphabets (a to z), that we are not aware of.
What we have though, dictionary of words, ordered according to the new order.
Our task is to give each alphabet a rank, ordered list of words.
The rank of an alphabet is the minimum integer R that can be given to it, such that:
if alphabet ... | 0 |
{"tests": "{\"inputs\": [\"3\\n1\\n1\\n2\\n1 2\\n3\\n1 2 3\\n\\nSAMPLE\", \"3\\n1\\n1\\n2\\n1 2\\n3\\n1 2 3\\n\\nSAMPKE\", \"3\\n1\\n1\\n2\\n1 2\\n3\\n1 2 4\\n\\nSAMPKE\", \"3\\n1\\n1\\n2\\n1 0\\n3\\n1 2 4\\n\\nSAMPKE\", \"3\\n1\\n0\\n2\\n1 0\\n3\\n1 2 4\\n\\nSAMPKE\", \"3\\n1\\n0\\n2\\n1 2\\n3\\n1 2 3\\n\\nSAMPLE\", \... | Mike has a huge guitar collection which the whole band is jealous of. Brad, the lead guitarist of the band, gave Mike a challenge so that he can't use all his guitars. The band is on a world tour and Brad told Mike to assign numbers to all his guitars. After that, he told Mike that he can use the guitars in such a mann... | 0 |
{"tests": "{\"inputs\": [\"aa\\naaaaaaa\", \"aba\\nbaaab\", \"abcabab\\nab\", \"aa\\nabaaaaa\", \"abcaabb\\nab\", \"aba\\naaaab\", \"aa\\naaaaaba\", \"aba\\naa`ab\", \"accaabb\\nab\", \"ab\\naaaaaba\", \"`ba\\naa`ab\", \"acdaabb\\nab\", \"ab\\nabaaaaa\", \"`ab\\naa`ab\", \"acda`bb\\nab\", \"ab\\nabaaaba\", \"ab`\\naa`a... | Given are two strings s and t consisting of lowercase English letters. Determine if the number of non-negative integers i satisfying the following condition is finite, and find the maximum value of such i if the number is finite.
* There exists a non-negative integer j such that the concatenation of i copies of t is a... | 0 |
{"tests": "{\"inputs\": [\"2 4\", \"5 14\", \"3 2\", \"0 4\", \"8 14\", \"0 14\", \"1 14\", \"2 14\", \"2 1\", \"0 1\", \"2 5\", \"2 26\", \"2 2\", \"0 5\", \"9 14\", \"0 28\", \"2 10\", \"0 2\", \"3 1\", \"1 5\", \"2 11\", \"0 3\", \"9 12\", \"1 28\", \"1 10\", \"4 2\", \"1 4\", \"3 11\", \"9 18\", \"1 7\", \"2 6\", \... | In Finite Encyclopedia of Integer Sequences (FEIS), all integer sequences of lengths between 1 and N (inclusive) consisting of integers between 1 and K (inclusive) are listed.
Let the total number of sequences listed in FEIS be X. Among those sequences, find the (X/2)-th (rounded up to the nearest integer) lexicograph... | 0 |
{"tests": "{\"inputs\": [\"10 10\\n*****@\\n@#@@@@#*#*\\n@##***@@@*\\n****#*@**\\n@*#@@*##\\n*@@@@*@@@#\\n***#@*@##*\\n*@@@*@@##@\\n*@*#*@##**\\n@****#@@#@\\n0 0\", \"10 10\\n####*****@\\n@#@@@@#*#*\\n@##***@@@*\\n#****#*@**\\n##@*#@@*##\\n*@@@@*@@@#\\n***#@*@##*\\n*@@@*@@##@\\n*@*#*@##**\\n@****#@@#@\\n0 0\", \"10 10\... | Mr. Tanaka died leaving the orchard of HW Earl. The orchard is divided into H x W plots in the north, south, east, and west directions, and apples, oysters, and oranges are planted in each plot. Mr. Tanaka left such a will.
Divide the orchard into as many relatives as possible on a parcel basis. However, if the same k... | 0 |
{"tests": "{\"inputs\": [\"3 6\\n3 1\\n1 2 1\\n2 3 1\\n3 2 1\\n2 1 1\\n1 3 4\\n3 1 4\\n3 6\\n5 1\\n1 2 1\\n2 3 1\\n3 2 1\\n2 1 1\\n1 3 4\\n3 1 4\\n4 5\\n3 1\\n3 1\\n1 2 5\\n2 3 5\\n3 4 5\\n4 2 5\\n3 1 5\\n2 1\\n2 1 1\\n0 0\", \"3 6\\n3 1\\n1 2 1\\n2 3 1\\n3 2 1\\n2 1 1\\n1 3 4\\n3 1 4\\n3 6\\n5 1\\n2 2 1\\n2 3 1\\n3 2 ... | Jim is planning to visit one of his best friends in a town in the mountain area. First, he leaves his hometown and goes to the destination town. This is called the go phase. Then, he comes back to his hometown. This is called the return phase. You are expected to write a program to find the minimum total cost of this t... | 0 |
{"tests": "{\"inputs\": [\"1 2 2 1\\n4 1\\n0 0\\n5 0\\n5 5\\n0 5\", \"1 2 2 1\\n4 1\\n0 0\\n2 0\\n2 2\\n0 2\", \"1 10 10 1\\n4 10\\n0 0\\n1 0\\n1 1\\n0 1\", \"4 3 3 2\\n3 1\\n1 1\\n3 3\\n1 5\\n4 2\\n2 0\\n5 0\\n4 2\\n3 2\\n3 3\\n4 3\\n6 1\\n6 5\\n4 4\\n3 4\\n4 4\\n5 6\\n2 6\", \"1 2 2 1\\n4 1\\n-1 0\\n5 0\\n5 5\\n0 5\"... | Background
The kindergarten attached to the University of Aizu is a kindergarten where children who love programming gather. Yu, one of the kindergarten children, loves darts as much as programming. Yu-kun was addicted to darts recently, but he got tired of ordinary darts, so he decided to make his own darts board.
S... | 0 |
{"tests": "{\"inputs\": [\"7\\n12.3 kilo meters\\n0.45 mega watts\\n0.000000000000000000000001 yotta grams\\n1000000000000000000000000 yocto seconds\\n42 amperes\\n0.42 joules\\n1234.56789012345678901234567890 hecto pascals\", \"7\\n12.3 kilo meters\\n0.45 mega watts\\n0.000000000000000000000001 yotta grams\\n100000000... | In the International System of Units (SI), various physical quantities are expressed in the form of "numerical value + prefix + unit" using prefixes such as kilo, mega, and giga. For example, "3.5 kilometers", "5.1 milligrams", and so on.
On the other hand, these physical quantities can be expressed as "3.5 * 10 ^ 3 m... | 0 |
{"tests": "{\"inputs\": [\"R 100 L 20 E 10 \\\\$\\nR 5 L 10 \\\\$\\nX 20 \\\\$\", \"R 100 L 20 E 10 \\\\$\\nR 5 L 6 \\\\$\\nX 20 \\\\$\", \"R 100 L 20 E 6 \\\\$\\nR 5 L 10 \\\\$\\nX 20 $\\\\\", \"R 100 L 23 E 10 \\\\$\\nR 5 L 6 \\\\$\\nX 20 $\\\\\", \"R 100 K 20 E 10 \\\\$\\nS 1 L 11 \\\\#\\nX 20 \\\\$\", \"R 100 L 20 ... | H - RLE Replacement
Problem Statement
In JAG Kingdom, ICPC (Intentionally Compressible Programming Code) is one of the common programming languages. Programs in this language only contain uppercase English letters and the same letters often appear repeatedly in ICPC programs. Thus, programmers in JAG Kingdom prefer t... | 0 |
{"tests": "{\"inputs\": [\"4\\n1 1000 1\\n2 500 2\\n3 250 3\\n4 125 4\\n\", \"7\\n1 100000 1\\n1 100000 2\\n1 100000 2\\n4 50000 3\\n3 50000 4\\n4 50000 4\\n3 50000 3\\n\", \"6\\n2 1 4\\n1 2 4\\n3 4 4\\n2 8 3\\n3 16 3\\n1 32 2\\n\", \"34\\n1 91618 4\\n4 15565 2\\n1 27127 3\\n3 71241 1\\n1 72886 4\\n3 67359 2\\n4 91828 ... | You are given n blocks, each of them is of the form [color_1|value|color_2], where the block can also be flipped to get [color_2|value|color_1].
A sequence of blocks is called valid if the touching endpoints of neighboring blocks have the same color. For example, the sequence of three blocks A, B and C is valid if th... | 0 |
{"tests": "{\"inputs\": [\"5 2\\n2 1 1 2 1\\n\", \"5 2\\n3 2 1 2 3\\n\", \"4 2\\n1 2 2 3\\n\", \"5 5\\n1 1 2 2 3\\n\", \"6 6\\n1 2 1 2 4 5\\n\", \"6 2\\n100 100 101 101 102 102\\n\", \"5 1\\n5 2 3 4 5\\n\", \"5 4\\n25 2 3 2 2\\n\", \"9 9\\n1 1 1 1 2 2 2 2 2\\n\", \"10 10\\n1 2 3 1 2 3 1 2 4 5\\n\", \"10 10\\n1 2 3 3 2 ... | You are given an array a consisting of n integer numbers.
You have to color this array in k colors in such a way that:
* Each element of the array should be colored in some color;
* For each i from 1 to k there should be at least one element colored in the i-th color in the array;
* For each i from 1 to k al... | 0 |
{"tests": "{\"inputs\": [\"6 7\\n1 2\\n2 3\\n1 3\\n4 5\\n4 6\\n5 6\\n2 4\\n\", \"6 8\\n1 2\\n2 3\\n1 3\\n4 5\\n4 6\\n5 6\\n2 4\\n3 5\\n\", \"18 75\\n17 1\\n13 18\\n15 11\\n6 3\\n18 16\\n9 18\\n6 15\\n6 14\\n10 7\\n17 16\\n12 6\\n15 13\\n5 1\\n4 13\\n8 1\\n11 5\\n16 9\\n3 2\\n4 16\\n4 18\\n12 9\\n8 11\\n5 18\\n5 3\\n7 1... | Bertown has n junctions and m bidirectional roads. We know that one can get from any junction to any other one by the existing roads.
As there were more and more cars in the city, traffic jams started to pose real problems. To deal with them the government decided to make the traffic one-directional on all the roads,... | 0 |
{"tests": "{\"inputs\": [\"5 4\\n1 2\\n4 3\\n1 4\\n3 4\\n\", \"6 5\\n2 3\\n2 1\\n3 4\\n6 5\\n4 5\\n\", \"4 2\\n1 3\\n2 4\\n\", \"100000 12\\n8 7\\n1 9\\n5 4\\n11 12\\n7 8\\n3 4\\n3 5\\n12 15\\n15 13\\n13 14\\n7 8\\n11 14\\n\", \"4 2\\n1 2\\n2 3\\n\", \"2 1\\n1 2\\n\", \"10 15\\n1 2\\n2 3\\n3 4\\n4 5\\n5 1\\n1 6\\n2 7\\... | The legendary Farmer John is throwing a huge party, and animals from all over the world are hanging out at his house. His guests are hungry, so he instructs his cow Bessie to bring out the snacks! Moo!
There are n snacks flavors, numbered with integers 1, 2, β¦, n. Bessie has n snacks, one snack of each flavor. Every g... | 0.125 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.