task_id string | prompt string | starter_code string | reference_solution string | tests dict | source string | difficulty string | metadata dict |
|---|---|---|---|---|---|---|---|
1268/A | "You are given an integer $$$x$$$ of $$$n$$$ digits $$$a_1, a_2, \\ldots, a_n$$$, which make up its (...TRUNCATED) | "At first, let's set $$$a_i=a_{i-k}$$$ for all $$$i>k$$$.\nIf it is at least the initial $$$a$$$, th(...TRUNCATED) | {"kind":"stdin_stdout","inputs":["3 2\r\n353\r\n","4 2\r\n1234\r\n","5 4\r\n99999\r\n","5 4\r\n41242(...TRUNCATED) | open-r1/codeforces | 1700 | {"id":"1268/A","aliases":["1269/C"],"contest_id":"1268","contest_name":"Codeforces Round 609 (Div. 1(...TRUNCATED) | |
1268/B | "You are given a Young diagram.\n\nGiven diagram is a histogram with $$$n$$$ columns of lengths $$$a(...TRUNCATED) | "Let's color diagram into two colors as a chessboard.\nI claim that the Young diagram can be partiti(...TRUNCATED) | {"kind":"stdin_stdout","inputs":["5\r\n3 2 2 2 1\r\n","5\r\n1 1 1 1 1\r\n","3\r\n3 3 3\r\n","1\r\n1\(...TRUNCATED) | open-r1/codeforces | 2000 | {"id":"1268/B","aliases":["1269/D"],"contest_id":"1268","contest_name":"Codeforces Round 609 (Div. 1(...TRUNCATED) | |
1268/C | "You are given a permutation $$$p_1, p_2, \\ldots, p_n$$$.\n\nIn one move you can swap two adjacent (...TRUNCATED) | "At first, let's add to the answer number of inversions among numbers $$$1,2,\\ldots,k$$$.\nAfter th(...TRUNCATED) | {"kind":"stdin_stdout","inputs":["5\r\n5 4 3 2 1\r\n","3\r\n1 2 3\r\n","1\r\n1\r\n","10\r\n5 1 6 2 8(...TRUNCATED) | open-r1/codeforces | 2300 | {"id":"1268/C","aliases":["1269/E"],"contest_id":"1268","contest_name":"Codeforces Round 609 (Div. 1(...TRUNCATED) | |
819/B | "Some time ago Mister B detected a strange signal from the space, which he started to study.\n\nAfte(...TRUNCATED) | "Let's see, how pk (1 ≤ k ≤ n) affects different shifts.\nLet's denote di is deviation o(...TRUNCATED) | {"kind":"stdin_stdout","inputs":["3\r\n1 2 3\r\n","3\r\n2 3 1\r\n","3\r\n3 2 1\r\n","2\r\n1 2\r\n","(...TRUNCATED) | open-r1/codeforces | 1900 | {"id":"819/B","aliases":["820/D"],"contest_id":"819","contest_name":"Codeforces Round 421 (Div. 1)",(...TRUNCATED) | |
819/C | "Mister B has a house in the middle of a giant plain field, which attracted aliens life. For conveni(...TRUNCATED) | "There 2 stages in this task: moving of first beacon and moving of second.\nBut at first we need fac(...TRUNCATED) | {"kind":"stdin_stdout","inputs":["3\r\n2 1 1\r\n2 1 1\r\n1 1 3\r\n1 5 1\r\n2 2 1\r\n1 1 2\r\n10 6 18(...TRUNCATED) | open-r1/codeforces | 2900 | {"id":"819/C","aliases":["820/E"],"contest_id":"819","contest_name":"Codeforces Round 421 (Div. 1)",(...TRUNCATED) | |
819/D | "After studying the beacons Mister B decided to visit alien's planet, because he learned that they l(...TRUNCATED) | "Let's construct slow but clear solution and then, speed it up.\nLet's denote $$s = \\sum_{i=1}^{n} (...TRUNCATED) | {"kind":"stdin_stdout","inputs":["4 2\r\n2 3\r\n","5 4\r\n1 1 1 1\r\n","24 8\r\n3 3 3 3 3 3 3 3\r\n"(...TRUNCATED) | open-r1/codeforces | 2900 | {"id":"819/D","aliases":null,"contest_id":"819","contest_name":"Codeforces Round 421 (Div. 1)","cont(...TRUNCATED) | |
819/E | "In order to fly to the Moon Mister B just needs to solve the following problem.\n\nThere is a compl(...TRUNCATED) | "There are different constructive solutions in this problem. Here is one of them.\nConsider odd and (...TRUNCATED) | {"kind":"stdin_stdout","inputs":["3\r\n","5\r\n","299\r\n","300\r\n","4\r\n","5\r\n","6\r\n","7\r\n"(...TRUNCATED) | open-r1/codeforces | 2800 | {"id":"819/E","aliases":null,"contest_id":"819","contest_name":"Codeforces Round 421 (Div. 1)","cont(...TRUNCATED) | |
1347/D | "There are $$$n$$$ candies in a row, they are numbered from left to right from $$$1$$$ to $$$n$$$. T(...TRUNCATED) | "This is just an implementation problem and it can be solved in $$$O(n)$$$ time but we didn't ask fo(...TRUNCATED) | {"kind":"stdin_stdout","inputs":["7\r\n11\r\n3 1 4 1 5 9 2 6 5 3 5\r\n1\r\n1000\r\n3\r\n1 1 1\r\n13\(...TRUNCATED) | open-r1/codeforces | 1300 | {"id":"1347/D","aliases":["1352/D"],"contest_id":"1347","contest_name":"Kotlin Heroes: Practice 4","(...TRUNCATED) | |
1347/E | "A permutation of length $$$n$$$ is an array $$$p=[p_1,p_2,\\dots,p_n]$$$, which contains every inte(...TRUNCATED) | "If $$$n < 4$$$ then there is no answer. You can do some handwork to be sure. Otherwise, the answer (...TRUNCATED) | {"kind":"stdin_stdout","inputs":["6\r\n10\r\n2\r\n4\r\n6\r\n7\r\n13\r\n","100\r\n63\r\n71\r\n30\r\n1(...TRUNCATED) | open-r1/codeforces | 1600 | {"id":"1347/E","aliases":["1352/G"],"contest_id":"1347","contest_name":"Kotlin Heroes: Practice 4","(...TRUNCATED) | |
1223/C | "You are an environmental activist at heart but the reality is harsh and you are just a cashier in a(...TRUNCATED) | "At first, let's assume that $$$x \\ge y$$$ (otherwise, we can swap parameters of programs). Let's d(...TRUNCATED) | {"kind":"stdin_stdout","inputs":["4\r\n1\r\n100\r\n50 1\r\n49 1\r\n100\r\n8\r\n100 200 100 200 100 2(...TRUNCATED) | open-r1/codeforces | 1600 | {"id":"1223/C","aliases":["1240/A","1241/C"],"contest_id":"1223","contest_name":"Technocup 2020 - El(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 199