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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
donuts | "You are working for an amusement park as an operator of an obakeyashiki, or a haunted house, in whi(...TRUNCATED) | {"input":["5 4\n#.##\n.##.\n#...\n..##\n...#","13 27\n......#.........#.......#..\n...#.....###..\n.(...TRUNCATED) | {
"input": [
"1 1 2 1 1\n2 1\n"
],
"output": [
"0\n"
]
} | {"input":["2 1\n7 1 1\n2 0 1\n","5 1\n2 1 1\n2 0 1\n1 0 1\n1 1 0\n1 0 1\n","6 1\n6 0 0\n11 1 0\n9 0 (...TRUNCATED) | 2 | 0 | {"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],"solution":["def solve():\n\(...TRUNCATED) | {"language":[2,2,2,2,4,2,2,1,2,1,2,2,4,1,4,2,2,2,1,2,2,2,2,4,4,2,2,2,4,1,4,2,2,2,2,2,2,4,2,3,1,1,3,2(...TRUNCATED) | 0 | 0 | 1,900 | [
"brute force",
"greedy"
] | false | {
"nanos": 0,
"seconds": 1
} | 32,000,000 | ||||
p01222 Walk under a Scorching Sun | "In the game Lizard Era: Beginning the protagonist will travel with three companions: Lynn, Meliana (...TRUNCATED) | {
"input": [
"3\n2 3 3\n",
"4\n0 1 2 3\n",
"6\n5 2 0 5 2 1\n"
],
"output": [
"0\n",
"10\n",
"53\n"
]
} | {"input":["20\n76 86 70 7 16 24 10 62 26 29 40 65 55 49 34 55 92 47 43 100\n","100\n6591 1074 3466 3(...TRUNCATED) | {"input":["+--+-+\n","+--+--+------+++++++-+-+++--++---+--+-+---+--+++-+++-------+++++-+-++++--+-+-+(...TRUNCATED) | 5 | 11 | {"language":[3,2,2,4,3,4,4,3,3,3,2,1,1,2,3,2,4,4,3,4,3,4,3,2,3,4,1,3,1,3,3,3,1,2,3,1,2,4,3,4,1,3,3,3(...TRUNCATED) | {"language":[2,2,2,3,3,4,2,3,3,3,2,3,3,2,3,3,0,2,3,2,2,2,0,2,3,2,0,2,2,0,2,2,2,3,3,2,3,2,2,2,3,3,0,2(...TRUNCATED) | 903 | E | 0 | 1,700 | [
"implementation"
] | false | {
"nanos": 0,
"seconds": 1
} | 0 | |||
p01484 Icy Composer | "Sorting algorithms for sorting data are basic algorithms indispensable in computer science. For exa(...TRUNCATED) | {"input":["5\nAJMP\naB23d\nE\n86AE\nAM\n6\nJPEM\nWaEaETC302Q\nCP\nrTurnAGundam1isdefferentf"],"outpu(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["78 78\n-645462 -187679 693035 927066 431506 16023 -173045 698159 -995400 -687770 -747462 (...TRUNCATED) | 2 | 0 | {"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":[2,0,2,3,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,0,0,2,2,2,2,2,3,2,2,2,2,2,2,2,3,2,2,2,2,2,2(...TRUNCATED) | 0 | K | 1,000 | 900 | [
"math",
"number theory",
"sortings"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
167_C. Wizards and Numbers | "Your task is very simple. Given K numbers A1, A2, ..., AK. You need to find f(N) mod max(A1, A2, .(...TRUNCATED) | {
"input": [
"3\n3 2 2\n",
"4\n2 2 2 2\n"
],
"output": [
"4\n",
"3\n"
]
} | {
"input": [],
"output": []
} | {"input":["42 28\n7 19\n15 24\n3 42\n18 5\n32 27\n26 20\n40 30\n35 2\n14 8\n22 8\n36 4\n16 14\n21 29(...TRUNCATED) | 2 | 10 | {"language":[2,3,4,2,3,2,3,4,3,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,3,4,2,2,2,2,2,2,4,2,2,2,3,3,2,3,2,3(...TRUNCATED) | {"language":[2,4,0,2,2,0,2,2,2,2,2,2,2,2,2,2,2,4,2,0,2,2,2,4,2,2,2,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2,4(...TRUNCATED) | 1,144 | 0 | 0 | [] | false | {
"nanos": 0,
"seconds": 2
} | 1,073,741,824 | ||||
p00638 Old Bridges | "Everybody knows that Balázs has the fanciest fence in the whole town. It's built up from N fancy s(...TRUNCATED) | {"input":["3 3\n1 3\n2 3\n3 3\n","3 1\n1 1\n2 2\n3 3\n","7 3\n1 7\n3 8\n4 5\n6 7\n1 3\n5 10\n8 9\n",(...TRUNCATED) | {"input":["85 30 123\n","100000 100000 1320777\n","94728 36278 300352\n","70386 4182 113682\n","6518(...TRUNCATED) | {"input":["6 8\nabbaab\n+ 1 a\n+ 3 a\n+ 3 a\n+ 1 b\n+ 2 b\n+ 3 b\n- 1\n+ 2 z\n","6 8\nabdabc\n+ 2 a\(...TRUNCATED) | 3 | 12 | {"language":[2,2,2,1,4,2,4,2,4,3,4,1,4,4,2,4,2,2,2,3,4,3,2,2,2,2,2,4,2,4,2,4,2,2,3,2,4,4,2,2,4,2,2,4(...TRUNCATED) | {"language":[2,2,0,2,1,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,2,2,2,2,0,2,2,2(...TRUNCATED) | 223 | B | 500 | 1,600 | [
"*special",
"data structures",
"dsu",
"implementation",
"math",
"sortings"
] | false | {
"nanos": 0,
"seconds": 2
} | 512,000,000 | |||
1408_A. Circle Coloring | "Given 2 numbers n1 and n2, following operations can be performed:\n1) Decrement n1 by 1(if n1>1)\n2(...TRUNCATED) | {
"input": [
"7\n1 1 2 2 3 3 3\n",
"10\n1 1 1 5 4 1 3 1 2 2\n",
"1\n1\n"
],
"output": [
"6\n",
"7\n",
"0\n"
]
} | {"input":["1 1\n0\n10000\n","2 3\n1 0\n4 7\n","1 2\n0\n10000\n","3 10\n0 1 2\n9240 5331 6721\n","4 1(...TRUNCATED) | {"input":["5 5\n-993655555 -758584352 -725954642 -696391700 -649643547\n-591473088 -568010221 -43211(...TRUNCATED) | 2 | 0 | {
"language": [],
"solution": []
} | {"language":[2,0,2,0,3,2,0,2,2,2,2,2,0,3,2,2,2,3,2,2,4,2,2,2,2,2,2,2,0,3,4,2,2,2,2,2,2,2,2,0,2,0,0,2(...TRUNCATED) | 0 | A | 0 | 0 | [
"data structures",
"greedy"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
235_A. LCM Challenge | "Polycarp was dismantling his attic and found an old floppy drive on it. A round disc was inserted i(...TRUNCATED) | {"input":["3\n3 0 2 5\n1 1 1 6\n3 2 1 10\n1 -2 3 6\n2\n1 2\n3 3\n1\n2\n3\n0\n3 0 2 5\n1 1 1 6\n3 2 1(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["2\naaba\n","2\nabaaaababb\n","2\naabbbccccbccdddddddd\n","3\naaaaadaaacccddddad\n","2\naa(...TRUNCATED) | 6 | 0 | {"language":[3,3,3,1,2,3,1,4,3,4,3,2,3,2,4,4,3,4,1,1,1,3,3,3,3,1,3,1,1,4,4,3,3,4,4,4,4,3,4,3,4,3,3,1(...TRUNCATED) | {"language":[2,2,2,2,2,2,2,2,2,2,2,2,4,3,2,2,3,2,2,2,2,2,2,2,2,4,3,2,2,2,2,1,2,4,2,2,2,2,2,4,2,2,3,1(...TRUNCATED) | 0 | 3,000 | 0 | [
""
] | false | null | 0 | ||||
760_F. Bacterial Melee | "Modern researches has shown that a flock of hungry mice searching for a piece of cheese acts as fol(...TRUNCATED) | {
"input": [
"4\n4 4 4\n",
"5\n2 3 5 5\n"
],
"output": [
"6\n",
"17\n"
]
} | {
"input": [],
"output": []
} | {"input":["6 1 2 3 4 7","6 106 2 3 4 5","6 2 2 3 4 7","6 159 2 3 4 5","6 200 2 3 8 8","6 159 2 3 3 5(...TRUNCATED) | 2 | 8 | {"language":[2,4,3,3,3,1,3,4,2,2,3,3,3,3,3,3,3,3,3,3,3,4,3,3,2,3,4,4,3,3,3,4,3,3,4,3,3,4,2,4,3,3,3,3(...TRUNCATED) | {"language":[3,2,2,2,2,2,2,2,0,2,2,2,2,2,0,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,2(...TRUNCATED) | 379 | 0 | 1,500 | [
"binary search",
"data structures",
"dfs and similar",
"dsu",
"shortest paths",
"two pointers"
] | false | {
"nanos": 0,
"seconds": 8
} | 256,000,000 | ||||
1195_D2. Submarine in the Rybinsk Sea (hard edition) | "Panda has a thing for palindromes. Hence he was a given a problem by his master. The master will g(...TRUNCATED) | {
"input": [
"2\n\nSAMPLE"
],
"output": [
"3\n"
]
} | {
"input": [],
"output": []
} | {"input":["byeybe","zyxwvutsrqponmlkjihgfedcba","aabwyyzz","axcabcbabcx","zyxwvutsrqponmlkjihgfedbba(...TRUNCATED) | 2 | 0 | {"language":[1,4,2,4,2,3,4,4,2,4,3,4,2,2,4,4,3,1,2,1,1,2,4,2,4,4,4,4,2,4,4,2,2,3,2,4,2,2,2,4,1,1,2,3(...TRUNCATED) | {"language":[2,2,2,2,2,2,2,2,2,2,1,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,4,2,2,2,2,2(...TRUNCATED) | 0 | D | 0 | 1,600 | [] | false | {
"nanos": 0,
"seconds": 2
} | 268,435,456 | |||
1291_E. Prefix Enlightenment | "Problem\n\nA large-scale cluster † type supercomputer (commonly known as \"SAKURA\") cluster at M(...TRUNCATED) | {
"input": [
"1\n4 2 1\n1 1 2 2\n1 1\n1 1\n1 1\n3 1\n0 1\n0 1\n1 0\n1 0"
],
"output": [
"5"
]
} | {"input":["49 749442\n8888888\n8888888\n8888888\n5777777\n5777777\n5777777\n5777777\n5777777\n577777(...TRUNCATED) | {"input":["2 0\n1 2\n","2 1\n1 3\n","3 3\n1 2\n1 5\n2 3\n","2 0\n1 0\n","4 0\n1 0\n","4 0\n1 -1\n","(...TRUNCATED) | 3 | 7 | {"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": [],
"solution": []
} | 80 | 0 | 0 | [
"data structures",
"greedy",
"implementation"
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 |
End of preview. Expand in Data Studio
edition_0500_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
- 17