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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
83_C. Track | "Chandan gave his son a cube with side N. The N X N X N cube is made up of small 1 X 1 X 1 cubes.\n(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["1 10\n700282491 332230980 954401907 59481241 188256336 995466811 463183048 725322957 8929(...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) | 2 | 0 | {"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,4,2,2,2,2,2,2,4,2,2,2,4(...TRUNCATED) | {"language":[4,4,3,2,2,4,3,1,4,2,4,2,1,2,4,2,2,4,2,4,4,2,2,3,2,3,2,4,4,4,2,2,4,2,2,4,2,4,4,2,2,3,3,2(...TRUNCATED) | 0 | C | 0 | 2,200 | [
"binary search",
"data structures",
"math"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
p00167 Bubble Sort | "There are N cubes stacked vertically on a desk.\n\nYou are given a string S of length N. The color (...TRUNCATED) | {
"input": [
"3\n4251\n52310\n00006\n\nSAMPLE"
],
"output": [
"12\n56\nunlucky"
]
} | {
"input": [],
"output": []
} | {"input":["1\n47 1 47\n40 45 19 10 44 33 47 12 2 46 16 23 3 14 21 28 31 42 22 18 35 38 24 25 36 32 4(...TRUNCATED) | 2 | 0 | {"language":[1,1,1,1,1,1,1,1,1,1,1],"solution":["input()\nans=''\ninp=raw_input()\ninit=0\nfor j in (...TRUNCATED) | {"language":[4,4,4,3,2,4,4,2,2,4,2,4,2,4,4,3,4,2,2,4,2,2,4,1,2,4,2,4,4,2,2,2,2,2,3,4,3,4,2,3,2,3,3,4(...TRUNCATED) | 1,096 | A | 0 | 0 | [
"implementation"
] | true | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | |||
p00781 Lattice Practices | "Problem Statement\n\nYou are given a list of $N$ intervals. The $i$-th interval is $[l_i, r_i)$, wh(...TRUNCATED) | {
"input": [
"8\n1 2 3 4 5 6 7 8\n",
"4\n1 0 1 2\n"
],
"output": [
"1\n3\n6\n10\n16\n24\n40\n",
"1\n1\n3\n"
]
} | {"input":["5 1\n3 2\n","3 3\n1 2\n1 2\n1 2\n","5 3\n2 4\n5 4\n3 2\n","20 5\n3 12\n5 20\n16 4\n13 3\n(...TRUNCATED) | {"input":["3\n2\n1 5 10\n2 15 5\n3\n2 93 78\n1 71 59\n3 57 96\n19\n19 23 16\n5 90 13\n12 85 70\n19 6(...TRUNCATED) | 5 | 0 | {"language":[2,2,2,2,2,4,2,2,2,2,1,4,4,2,2,2,2,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(...TRUNCATED) | {"language":[2,2,2,2,2,3,4,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,4,2,3,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 1,043 | D | 3,000 | 2,500 | [
""
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | |||
cost-of-data-11 | "Xenia the beginner mathematician is a third year student at elementary school. She is now learning (...TRUNCATED) | {
"input": [
"3\n3 4 5\n1 0 5\n5 3 2\n"
],
"output": [
"9\n0\n6\n"
]
} | {"input":["2 313 856 964 421\n","61 464 623 89 548\n","37 261 207 1 1000\n","4 202 512 995 375\n","3(...TRUNCATED) | {"input":["1 1\n5\n2 1 7\n","10 6\n10 10 10 6 6 5 5 5 3 1\n2 3 50\n2 4 10\n1 3 10\n2 2 36\n1 4 7\n2 (...TRUNCATED) | 2 | 0 | {"language":[3,4,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,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | {
"language": [],
"solution": []
} | 754 | C | 3,750 | 0 | [
"greedy"
] | false | {
"nanos": 0,
"seconds": 10
} | 256,000,000 | |||
p02405 Print a Chessboard | "Edward R. Nelson is visiting a strange town for some task today. This city is built on a two-dimens(...TRUNCATED) | {
"input": [
"4 4\n1 2 -10 3\n1 3 1 -10\n2 4 -10 -1\n3 4 0 -3\n"
],
"output": [
"4\n"
]
} | {
"input": [],
"output": []
} | {"input":["3 4\n10 10\n-10 -10\n3 3\n1 2\n2 3\n3 5\n3 10","2 2\n2 0\n0 0\n-1 -1\n1 0","3 4\n10 10\n-(...TRUNCATED) | 5 | 8 | {"language":[2,3,3,2,4,1,3,2,4,2,2,3,2,3,4,4,3,3,3,4,2,3,3,2,2,3,4,2,3,2,4,3,4,2,3,4,2,2,3,2,4,4,2,3(...TRUNCATED) | {"language":[2,2,3,1,4,3,4,4,3,3,2,2,2,1,4,4,2,3,4,3,4,2,2,2,4,4,4,3,3,3,2,3,2,4,1,2,3,3,3,4,1,2,3,4(...TRUNCATED) | 0 | C | 1,500 | 2,400 | [
""
] | true | {
"nanos": 0,
"seconds": 3
} | 256,000,000 | |||
1269_B. Modulo Equality | "Vasilisa the Wise from the Kingdom of Far Far Away got a magic box with a secret as a present from (...TRUNCATED) | {
"input": [
"14 3 2012"
],
"output": [
"Wednesday"
]
} | {
"input": [],
"output": []
} | {"input":["3\n1 4\n-1 1\n2 -1","10\n3 2\n3 2\n-1 1\n2 -1\n-3 -6\n-8 12\n7 7\n8 1\n8 2\n8 4","3\n2 4\(...TRUNCATED) | 5 | 7 | {"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,4,2,2,2,2,2,2,2,2,2(...TRUNCATED) | {"language":[4,2,4,3,3,4,3,4,4,4,2,2,3,3,2,2,4,4,4,2,3,3,2,3,3,2,2,2,4,2,2,4,2,3,4,4,3,4,1,2,1,4,4,4(...TRUNCATED) | 867 | 500 | 0 | [
""
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | ||||
1208_D. Restore Permutation | "Everything got unclear to us in a far away constellation Tau Ceti. Specifically, the Taucetians cho(...TRUNCATED) | {
"input": [
"5 10 25 12 4 1 \n3 16 28 100\n\nSAMPLE"
],
"output": [
"4 12 10 \n100 28 16"
]
} | {
"input": [],
"output": []
} | {"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) | 2 | 6 | {"language":[2,2,4,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,1,2,2,2,2,2,2,2,4,2,2,2,2,4,2(...TRUNCATED) | {
"language": [],
"solution": []
} | 0 | D2 | 0 | 1,100 | [
"constructive algorithms",
"graphs",
"greedy",
"sortings"
] | false | {
"nanos": 0,
"seconds": 1
} | 134,217,728 | |||
1325_B. CopyCopyCopyCopyCopy | "We have N balance beams numbered 1 to N. The length of each beam is 1 meters. Snuke walks on Beam i(...TRUNCATED) | {"input":["5\n0 0\n0 2\n2 0\n2 2\n1 1\n","9\n0 0\n1 1\n2 2\n0 1\n1 0\n0 2\n2 0\n1 2\n2 1\n"],"output(...TRUNCATED) | {"input":["1\n10 2 20\n8 5 2 4 10 3 9 7 1 6\n5 10\n3 17\n6 31\n3 46\n10 42\n7 19\n9 36\n7 3\n3 13\n8(...TRUNCATED) | {"input":["12 11\n11 12\n25 7\n","12 17\n6 19\n13 16\n","9 12\n3 17\n10 20\n","2 4\n1 3\n3 3\n","3 7(...TRUNCATED) | 2 | 10 | {"language":[4,2,1,1,3,2,3,3,4,2,4,4,2,3,4,3,2,4,1,2,2,3,1,2,2,2,4,1,2,4,3,3,2,4,4,4,1,3,1,4,4,1,2,4(...TRUNCATED) | {"language":[3,2,4,4,2,2,2,4,1,4,4,2,2,4,2,2,4,4,4,2,2,2,2,2,1,2,4,4,2,2,2,2,2,2,2,3,2,2,2,3,2,2,2,2(...TRUNCATED) | 1,081 | I | 0 | 0 | [
""
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | |||
161_B. Discounts | "There are N slimes standing on a number line. The i-th slime from the left is at position x_i.\n\nI(...TRUNCATED) | {"input":["4 6 0\n0 1 3\n0 2 2\n2 0 1\n2 3 1\n3 0 1\n3 1 5","6 10 0\n0 2 7\n0 1 1\n0 3 5\n1 4 9\n2 1(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["10 7\n1 10\n2 10\n3 19\n4 10\n5 10\n1 2\n1 3\n1 4\n1 5\n1 6\n","20 7\n6047 35038\n15816 3(...TRUNCATED) | 2 | 10 | {"language":[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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | {
"language": [],
"solution": []
} | 1,189 | E | 0 | 2,200 | [
"brute force",
"dp",
"math",
"number theory"
] | false | {
"nanos": 0,
"seconds": 3
} | 64,000,000 | |||
643_B. Bear and Two Paths | "Polycarpus enjoys studying Berland hieroglyphs. Once Polycarp got hold of two ancient Berland pictu(...TRUNCATED) | {
"input": [
"3\n0 1 1\n1 0 4\n1 4 0\n",
"4\n0 1 2 3\n1 0 4 5\n2 4 0 6\n3 5 6 0\n"
],
"output": [
"2",
"5"
]
} | {
"input": [],
"output": []
} | {"input":["3\n3 3\n1 -3 4\n1 5 2\n2 2\n-4 0\n1 2\n2 2\n0 1\n1 2\n","3\n3 3\n1 -3 4\n1 5 2\n2 2\n-2 0(...TRUNCATED) | 5 | 8 | {"language":[1,1],"solution":["import datetime\ndt='21/03/2012'\nday, month, year = (int(x) for x in(...TRUNCATED) | {"language":[2,0,0,2,2,2,2,2,2,2,0,0,0,0,2,2,0,3,0,0,0,0,2,2,0,2,2,2,2,0,2,2,2,0,0],"solution":["#in(...TRUNCATED) | 1,227 | 1,250 | 2,500 | [] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 |
End of preview. Expand in Data Studio
edition_0527_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
- 5