source
int64 2
2
| cf_tags
sequencelengths 1
11
| difficulty
int64 7
19
| incorrect_solutions
dict | cf_points
float64 0
4k
| name
stringlengths 9
60
| generated_tests
dict | is_description_translated
bool 1
class | description
stringlengths 353
5.71k
| input_file
stringclasses 2
values | cf_contest_id
int64 2
1.55k
| public_tests
dict | cf_rating
int64 0
3.5k
| memory_limit_bytes
int64 32M
1.02B
| output_file
stringclasses 2
values | untranslated_description
stringclasses 1
value | solutions
dict | private_tests
dict | cf_index
stringclasses 29
values | time_limit
dict |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2 | [
"data structures",
"dp"
] | 10 | {"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 2,250 | 1129_D. Isolation | {"input":["50 1\n50 8 46 9 12 38 41 18 49 10 23 15 18 3 13 17 48 8 31 32 6 31 31 49 9 40 9 21 23 41 (...TRUNCATED) | false | "Find the number of ways to divide an array a of n integers into any number of disjoint non-empty se(...TRUNCATED) | 1,129 | {
"input": [
"5 5\n1 2 3 4 5\n",
"3 1\n1 1 2\n",
"5 2\n1 1 2 1 3\n"
],
"output": [
"16",
"3",
"14"
]
} | 2,900 | 256,000,000 | {"language":[2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | {"input":["50 1\n50 8 46 9 12 38 41 18 49 10 23 15 16 3 13 17 48 8 31 32 6 31 31 49 9 40 9 21 23 41 (...TRUNCATED) | D | {
"nanos": 0,
"seconds": 3
} |
|||
2 | [
"constructive algorithms",
"dp",
"flows",
"graph matchings",
"greedy",
"sortings"
] | 12 | {"language":[3,2,2,2,2,2,2,2,2,2,2,3,3,2,3,2,3,2,2,3,2,2,4,2,2,3,2,2,2,2,2,4,2,2,2,2,2,2,4,2,2,2,3,3(...TRUNCATED) | 0 | 1354_F. Summoning Minions | {"input":["3\n5 2\n5 3\n7 0\n5 0\n4 0\n10 0\n2 1\n10 100\n8 10\n5 5\n1 5\n2 4\n3 3\n4 2\n5 1\n","3\n(...TRUNCATED) | false | "Polycarp plays a computer game. In this game, the players summon armies of magical minions, which t(...TRUNCATED) | 1,354 | {"input":["3\n5 2\n5 3\n7 0\n5 0\n4 0\n10 0\n2 1\n10 100\n50 10\n5 5\n1 5\n2 4\n3 3\n4 2\n5 1\n"],"o(...TRUNCATED) | 2,500 | 512,000,000 | {"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,4,2,2,2,2(...TRUNCATED) | {"input":["3\n5 2\n5 3\n7 0\n5 0\n4 0\n10 0\n2 1\n10 100\n50 10\n5 5\n1 5\n2 4\n3 3\n4 2\n5 1\n"],"o(...TRUNCATED) | F | {
"nanos": 0,
"seconds": 6
} |
|||
2 | [
"dp",
"matrices"
] | 9 | {"language":[2,2,4,4,4,3,2,4,4,4,3,2,2,2,4,4,3,3,3,2,2,4,4,4,2,3,3,2,2,2,4,2,3,3,3,2,4,4,3,3,4,4,2,2(...TRUNCATED) | 1,500 | 1513_C. Add One | {"input":["5\n90 94\n26 25\n64 84\n18 6\n20 96\n","5\n1912 1\n5 6\n999 1\n88 2\n11 100\n","5\n90 94\(...TRUNCATED) | false | "You are given an integer n. You have to apply m operations to it.\n\nIn a single operation, you mus(...TRUNCATED) | 1,513 | {
"input": [
"5\n1912 1\n5 6\n999 1\n88 2\n12 100\n"
],
"output": [
"\n5\n2\n6\n4\n2115\n"
]
} | 1,600 | 256,000,000 | {"language":[3,2,4,2,2,2,2,4,3,2,2,3,2,1,4,2,4,3,4,4,2,1,4,3,2,3,4,2,3,4,2,2,4,4,2,2,4,3,3,2,4,3,4,2(...TRUNCATED) | {
"input": [
"5\n90 94\n26 25\n64 84\n14 6\n20 96\n"
],
"output": [
"1842\n12\n1015\n3\n1908\n"
]
} | C | {
"nanos": 0,
"seconds": 1
} |
|||
2 | [
"dp",
"math"
] | 9 | {"language":[2,2,2,2,2,2,1,2,2,2,4,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2(...TRUNCATED) | 1,500 | 1540_C1. Converging Array (Easy Version) | {"input":["100\n95 54 23 27 51 58 94 34 29 95 53 53 8 5 64 32 17 62 14 37 26 95 27 85 94 37 85 72 88(...TRUNCATED) | false | "This is the easy version of the problem. The only difference is that in this version q = 1. You can(...TRUNCATED) | 1,540 | {
"input": [
"3\n2 3 4\n2 1\n1\n-1\n"
],
"output": [
"56\n"
]
} | 2,700 | 256,000,000 | {"language":[2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,4,2,2,2,1,4,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | {"input":["100\n95 54 23 27 51 58 94 34 29 95 53 53 8 5 64 32 17 62 14 37 26 95 27 85 94 37 85 72 88(...TRUNCATED) | C1 | {
"nanos": 0,
"seconds": 5
} |
|||
2 | [
"dp",
"two pointers"
] | 8 | {"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 500 | 309_B. Context Advertising | {"input":["10 20 11\njsnr u eq qas gcj rnnf fpb c dz g\n","10 10 19\nlguv zi riht pf jtbo qmj qp nvh(...TRUNCATED) | false | "Advertising has become part of our routine. And now, in the era of progressive technologies, we nee(...TRUNCATED) | 309 | {"input":["9 4 12\nthis is a sample text for croc final round\n","9 1 9\nthis is a sample text for c(...TRUNCATED) | 2,100 | 256,000,000 | {"language":[2,2,2,2,2,2,2,2,4,2,2,2,2,4,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | {"input":["10 20 11\nisnr u eq qas gcj rnnf fpb c dz g\n","10 4 3\nuzu bl fl ou uist j lp e gkp fmo\(...TRUNCATED) | B | {
"nanos": 0,
"seconds": 2
} |
|||
2 | [
"constructive algorithms",
"dp"
] | 11 | {"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 50 | 331_E2. Deja Vu | {"input":["2 0\n","3 1\n1 2 0\n","3 3\n1 2 2 3 2\n1 1 2 3 3\n2 3 2 2 3\n","11 17\n1 2 5 3 4 1 2 10\n(...TRUNCATED) | false | "Everybody knows that we have been living in the Matrix for a long time. And in the new seventh Matr(...TRUNCATED) | 331 | {"input":["6 6\n1 2 2 1 2\n2 3 1 3\n3 4 2 4 5\n4 5 0\n5 3 1 3\n6 1 1 6\n","6 6\n1 2 2 1 2\n2 3 1 3\n(...TRUNCATED) | 3,100 | 256,000,000 | {"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | {"input":["1 0\n","2 1\n1 2 0\n","5 4\n1 2 3 3 1 2\n5 4 0\n4 3 0\n3 1 2 5 4\n","3 3\n1 2 2 3 2\n1 3 (...TRUNCATED) | E2 | {
"nanos": 0,
"seconds": 2
} |
|||
2 | [
"constructive algorithms",
"dfs and similar",
"dp"
] | 11 | {"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 2,500 | 354_E. Lucky Number Representation | {"input":["5\n42\n17\n444\n7\n52\n","5\n42\n17\n640\n7\n51\n","5\n42\n15\n444\n7\n52\n","5\n42\n21\n(...TRUNCATED) | false | "We know that lucky digits are digits 4 and 7, however Vasya's got another favorite digit 0 and he a(...TRUNCATED) | 354 | {"input":["5\n42\n17\n444\n7\n51\n"],"output":[" (...TRUNCATED) | 2,200 | 256,000,000 | {"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2(...TRUNCATED) | {"input":["5\n42\n17\n444\n7\n51\n"],"output":[" (...TRUNCATED) | E | {
"nanos": 0,
"seconds": 2
} |
|||
2 | [
"data structures",
"dfs and similar",
"dp",
"trees"
] | 10 | {"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 1,750 | 494_D. Birthday | {"input":["10\n3 1 278114804\n3 7 453886464\n8 7 830020662\n8 2 759298564\n9 2 147615930\n2 4 617310(...TRUNCATED) | false | "Ali is Hamed's little brother and tomorrow is his birthday. Hamed wants his brother to earn his gif(...TRUNCATED) | 494 | {"input":["8\n1 2 100\n1 3 20\n2 4 2\n2 5 1\n3 6 1\n3 7 2\n6 8 5\n6\n1 8\n2 3\n5 8\n2 6\n4 7\n6 1\n"(...TRUNCATED) | 2,700 | 256,000,000 | {"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2(...TRUNCATED) | {"input":["10\n5 1 33242121\n5 7 535463871\n9 1 202863787\n5 4 874413088\n6 1 623012241\n6 8 7866591(...TRUNCATED) | D | {
"nanos": 0,
"seconds": 2
} |
|||
2 | [
"dp",
"greedy"
] | 9 | {"language":[2,4,1,2,3,4,4,2,4,2,4,2,4,2,3,3,3,3,2,2,2,4,4,2,2,4,4,3,4,4,3,1,1,4,3,1,3,1,2,3,4,4,3,2(...TRUNCATED) | 1,750 | 545_C. Woodcutters | {"input":["2\n1 222168095\n1000000000 1000000000\n","35\n1 7\n3 11\n6 12\n7 6\n8 5\n9 11\n15 3\n16 1(...TRUNCATED) | false | "Little Susie listens to fairy tales before bed every day. Today's fairy tale was about wood cutters(...TRUNCATED) | 545 | {"input":["5\n1 2\n2 1\n5 10\n10 9\n20 1\n","5\n1 2\n2 1\n5 10\n10 9\n19 1\n"],"output":["4\n","3\n"(...TRUNCATED) | 1,500 | 256,000,000 | {"language":[3,3,3,3,4,4,2,3,3,3,4,3,3,2,1,3,3,3,2,1,3,4,4,4,2,3,4,4,3,4,3,4,2,3,3,3,4,1,2,2,3,3,3,1(...TRUNCATED) | {"input":["4\n10 4\n15 1\n19 3\n20 1\n","2\n1 999999999\n1000000000 1000000000\n","67\n1 1\n3 8\n4 1(...TRUNCATED) | C | {
"nanos": 0,
"seconds": 1
} |
|||
2 | [
"dp"
] | 16 | {"language":[2,2,2,2,2,2,4,2,2,1,3,2,2,2,2,3,2,2,1,2,2,2,4,2,2,2,2,2,4,2,3,2,2,1,4,2,2,2,3,4,1,4,4,2(...TRUNCATED) | 0 | 730_J. Bottles | {"input":["30\n10 1 8 10 2 6 37 7 3 7 1 3 1 1 14 2 5 19 4 1 13 3 5 6 1 5 1 1 23 1\n98 4 43 41 56 58 (...TRUNCATED) | false | "Nick has n bottles of soda left after his birthday. Each bottle is described by two values: remaini(...TRUNCATED) | 730 | {"input":["2\n1 1\n100 100\n","5\n10 30 5 6 24\n10 41 7 8 24\n","4\n3 3 4 3\n4 7 6 5\n"],"output":["(...TRUNCATED) | 1,900 | 512,000,000 | {"language":[2,4,2,4,2,2,2,2,2,2,2,2,4,4,2,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,2,2,2(...TRUNCATED) | {"input":["30\n10 1 8 10 2 6 45 7 3 7 1 3 1 1 14 2 5 19 4 1 13 3 5 6 1 5 1 1 23 1\n98 4 43 41 56 58 (...TRUNCATED) | J | {
"nanos": 0,
"seconds": 2
} |
End of preview. Expand
in Dataset Viewer.
README.md exists but content is empty.
Use the Edit dataset card button to edit it.
- Downloads last month
- 661