name stringlengths 4 70 | description stringlengths 31 8.62k | public_tests dict | private_tests dict | generated_tests dict | source int64 1 6 | difficulty int64 0 21 | solutions dict | incorrect_solutions dict | cf_contest_id int64 0 1.55k | cf_index stringclasses 23
values | cf_points float64 0 3.75k | cf_rating int64 0 3.5k | cf_tags listlengths 0 7 | is_description_translated bool 2
classes | untranslated_description stringclasses 36
values | time_limit dict | memory_limit_bytes int64 0 1.07B | input_file stringclasses 1
value | output_file stringclasses 1
value |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
p03052 diverta 2019 Programming Contest - Edge Ordering | "Kitahara Haruki has bought n apples for Touma Kazusa and Ogiso Setsuna. Now he wants to divide all (...TRUNCATED) | {"input":["8\n0 0\n3 2\n6 2\n8 6\n6 5\n7 7\n0 4\n3 4\n8\n0 0\n5 3\n5 2\n4 1\n6 1\n8 6\n6 4\n2 4\n0"](...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["5\n78188 56310 33094 70050 65217\n115040 5149 128449 98357 36580\n1 451393770\n2 57404660(...TRUNCATED) | 6 | 0 | {"language":[2,2,2,2,2,2,2,4,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,4,2,2,2,2,2,2,2,2,2(...TRUNCATED) | {"language":[2,2,3,2,2,4,4,2,2,2,4,2,2,2,2,2,3,2,2,2,4,3,3,3,2,3,3,2,3,4,2,3,2,2,2,2,4,4,3,2,2,3,2,2(...TRUNCATED) | 1,012 | 0 | 0 | [
""
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | ||||
348_A. Mafia | "Nathan O. Davis is a student at the department of integrated systems. Today he learned digital quan(...TRUNCATED) | {
"input": [
""
],
"output": [
""
]
} | {"input":["997 6 680633279\n","989 8 990767311\n","999 2 750160753\n","1 4 904448911\n","1000 3 7501(...TRUNCATED) | {"input":["6\n4 2\nbbab\n7 5\ncceddda\n6 5\necdaed\n7 8\ndcdbdaa\n8 3\nccabbaca\n5 7\neabba\n","6\n4(...TRUNCATED) | 3 | 0 | {"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,3,2,2,2,2,2,2],"solutio(...TRUNCATED) | {"language":[2,3,3,3,4,1,2,2,2,4,1,4,3,3,2,3,4,4,2,1,2,3,4,3,2,3,3,4,1,4,2,4,3,4,3,3,2,4,2,2,3,4,1,3(...TRUNCATED) | 0 | D | 0 | 2,000 | [
"graphs"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
bogosort | "You are playing a computer card game called Splay the Sire. Currently you are struggling to defeat (...TRUNCATED) | {"input":["10000\n5000 3150\n5000 5000\n0 0\n5000 1050\n5000 3980\n5000 210\n5000 5000\n5000 5000\n0(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["3\n184427 500001 500002\n","1\n413243\n","1\n256223\n","2\n3 999999\n","1\n576559\n","2\n(...TRUNCATED) | 2 | 15 | {"language":[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(...TRUNCATED) | {"language":[0,4,0,0,0,0,0,0,4,2,0,2,2,3,2,0,2,0,3,0,0,0,0,2,0,2,1,1,2,0,3,2,0,0,3,0,0,4,2,2,2,0,0,2(...TRUNCATED) | 167 | 500 | 1,200 | [] | false | null | 512,000,000 | ||||
855_D. Rowena Ravenclaw's Diadem | "D: The Diversity of Prime Factorization\n\nProblem\n\nEbi-chan has the FACTORIZATION MACHINE, which(...TRUNCATED) | {
"input": [
"5\n3 2 1 6 5\n",
"4\n3 3 3 3\n"
],
"output": [
"8",
"0"
]
} | {"input":["6\nbabcdc\n","5\nbadec\n","3\naba\n","7\nbaaaccb\n","3\naaa\n","4\npara\n","3\nbac\n","7\(...TRUNCATED) | {"input":["6 4 3\n0 1 2\n2 3 0\n0 4 5\n1 4 4\n1 2 2\n0 4 2\n","5 1 7\n0 4 1\n0 10 5\n9 0 2\n9 0 0\n9(...TRUNCATED) | 5 | 10 | {"language":[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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | {"language":[2,2,2,2,2,2,2,0,4,2,2,2,4,2,2,2,2,2,2,3,2,2,3,3,2,2,2,2,2,3,0,2,2,0,2,2,0,0,2,3,2,3,3,2(...TRUNCATED) | 319 | E | 0 | 2,400 | [
"implementation"
] | true | {
"nanos": 0,
"seconds": 4
} | 1,073,741,824 | |||
p01738 Gravity Point | "There are N oases on a number line. The coordinate of the i-th oases from the left is x_i.\n\nCamel(...TRUNCATED) | {
"input": [
"2\n2 1\n5 4\n3 2\n1 0 2\n\nSAMPLE"
],
"output": [
"9\n1\n"
]
} | {"input":["100 3\n45 1 2 3 4 5 6 7 8 9 19 21 24 27 28 30 34 35 37 39 40 41 42 43 46 47 48 51 52 55 5(...TRUNCATED) | {"input":["xkbvkadjec gqjlhxpnsx 10\n2 7 1 0 0\n2 5 8 0 0\n4 7 8 0 4\n0 4 7 3 6\n5 5 9 3 7\n7 9 5 0 (...TRUNCATED) | 3 | 11 | {"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,4,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,4,2,2,2,2,2,2(...TRUNCATED) | {"language":[2,2,2,2,4,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,2,2,2,2,2,2,2(...TRUNCATED) | 188 | A | 0 | 1,800 | [
""
] | false | {
"nanos": 0,
"seconds": 2
} | 1,073,741,824 | |||
87_B. Vasya and Types | "Let's consider the following game. We have a rectangular field n × m in size. Some squares of the (...TRUNCATED) | {"input":["3\n4\nS010\n0001\n1000\n111F\n3\nS10\n101\n01F\n5\nS0101\n00000\n01111\n11111\n0001F\n"],(...TRUNCATED) | {"input":["85 30 123\n","100000 100000 1320777\n","94728 36278 300352\n","70386 4182 113682\n","6518(...TRUNCATED) | {"input":["1 2 101 42 99 -1","1 2 101 42 33 -1","1 2 101 36 33 -1","1 2 101 36 50 -1","0 2 101 36 50(...TRUNCATED) | 2 | 2 | {
"language": [],
"solution": []
} | {"language":[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,4,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2(...TRUNCATED) | 1,117 | 0 | 0 | [
"dsu",
"graphs",
"shortest paths",
"sortings"
] | false | {
"nanos": 0,
"seconds": 6
} | 512,000,000 | ||||
1408_A. Circle Coloring | "Lee tried so hard to make a good div.2 D problem to balance his recent contest, but it still doesn'(...TRUNCATED) | {"input":["6 2\n2 3 0 5 6 0\n","6 2\n0 0 1 0 4 5\n","6 1\n2 0 4 0 6 0\n","4 1\n0 0 0 0\n"],"output":(...TRUNCATED) | {"input":["3\n7\n4 6 11 11 15 18 20\n4\n10 10 10 11\n3\n1 1 1000000000\n","1\n6\n1 1 1 2 2 3\n","1\n(...TRUNCATED) | {"input":["11\nadd 1\nsum\nadd 2\nsum\nadd 3\nsum\nadd 4\nsum\nadd 6\nsum\nadd 6\n","6\nadd 4\nadd 7(...TRUNCATED) | 3 | 7 | {"language":[2,2,2,4,4,2,2,2,2,2,4,2,2,2,4,2,4,2,4,4,2,4,2,4,2,2,4,2,2,2,4,2,2,4,4,4,2,4,2,4,4,1,4,4(...TRUNCATED) | {"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) | 0 | A | 0 | 0 | [
""
] | false | {
"nanos": 0,
"seconds": 1
} | 134,217,728 | |||
143_A. Help Vasilisa the Wise 2 | "Nick has n bottles of soda left after his birthday. Each bottle is described by two values: remaini(...TRUNCATED) | {
"input": [
"16\n.**.*..*.***.**.\n",
"11\n.*.*...*.*.\n"
],
"output": [
"yes",
"no"
]
} | {
"input": [],
"output": []
} | {"input":["3\n3 1 0\n1 2 6\nXOR\n3 1 0\n1 2 3\nAND\n3 1 0\n1 2 3\nOR","3\n3 1 0\n1 2 3\nXOR\n3 1 0\n(...TRUNCATED) | 2 | 0 | {"language":[2,4,2,4,4,2,2,2,4,4,3,2,4,3,3,4,2,4,2,4,3,4,3,4,3,2,1,4,3,1,3,3,2,2,3,3,2,4,2,3,2,2,4,4(...TRUNCATED) | {"language":[4,2,3,4,3,2,4,4,4,2,2,4,2,4,4,4,2,4,2,2,4,2,2,3,3,4,3,3,2,4,2,3,3,4,3,2,2,3,3,2,4,3,4,3(...TRUNCATED) | 1,366 | 0 | 0 | [
"brute force",
"data structures",
"implementation"
] | false | {
"nanos": 0,
"seconds": 2
} | 0 | ||||
playing-with-substrings | "Mole decided to live in an abandoned mine. The structure of the mine is represented by a simple con(...TRUNCATED) | {"input":["4\n10 4\n4 5\n5 2\n2 1\n1 3\n1 9\n9 10\n2 7\n7 8\n5 6\n4 3\n1 2\n2 3\n3 4\n5 3\n1 2\n1 3\(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["3\n1000000000 1000000000 11000000\n","3\n2 2 1\n","3\n2 10 11\n","5\n1000010000 5 5 4 4\n(...TRUNCATED) | 2 | 9 | {"language":[3,4,4,4,4,2,2,3,4,4,2,4,2,4,1,4,2,4,3,3,1,4,4,2,2,1,4,4,4,4,4,2,2,3,4,4,4,3,4,4,2,4,4,4(...TRUNCATED) | {"language":[2,3,4,3,0,2,2,4,2,0,3,0,3,0,3,3,2,0,2,2,2,2,2,0,0,3,2,2,2,2,2,2,3,2,3,2,4,2,2,3,0,2,2,3(...TRUNCATED) | 0 | 2,500 | 2,000 | [
"dfs and similar",
"dp",
"games",
"graphs"
] | false | {
"nanos": 0,
"seconds": 2
} | 64,000,000 | ||||
776_A. A Serial Killer | "George is getting tired of the decimal number system. He intends to switch and use the septenary ((...TRUNCATED) | {"input":["3\n-1 -1\n1 0\n2 0\n2\n1 1 3\n2 1 3\n","3\n-1 -1\n1 0\n1 1\n2\n2 2 3\n2 3 2\n"],"output":(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["4\naaa\nabc\nabdbca\nabca","4\naaa\nabc\nabdbc`\naaca","4\naab\nacc\n`bd`cb\naaad","4\nba(...TRUNCATED) | 2 | 0 | {"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) | {"language":[2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,1,4,2,2,2,2(...TRUNCATED) | 25 | 0 | 2,500 | [
"brute force",
"sortings"
] | false | {
"nanos": 0,
"seconds": 1
} | 1,073,741,824 |
End of preview. Expand in Data Studio
edition_1409_deepmind-code_contests-readymade
A Readymade by TheFactoryX
Original Dataset
Process
This dataset is a "readymade" - inspired by Marcel Duchamp's concept of taking everyday objects and recontextualizing them as art.
What we did:
- Selected the original dataset from Hugging Face
- Shuffled each column independently
- Destroyed all row-wise relationships
- Preserved structure, removed meaning
The result: Same data. Wrong order. New meaning. No meaning.
Purpose
This is art. This is not useful. This is the point.
Column relationships have been completely destroyed. The data maintains its types and values, but all semantic meaning has been removed.
Part of the Readymades project by TheFactoryX.
"I am a machine." — Andy Warhol
- Downloads last month
- 4