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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
219_A. k-String | "Julia is conducting an experiment in her lab. She placed several luminescent bacterial colonies in (...TRUNCATED) | {
"input": [
"5\n2 3 1 5 5\n4\n2 2 3 2\n2 1 5 3\n1 3 5\n2 1 5 3\n"
],
"output": [
"5\n26\n38\n"
]
} | {
"input": [],
"output": []
} | {"input":["7\n5\n-1 10 -1 12 -1\n5\n-1 40 35 -1 35\n6\n-1 -1 9 -1 3 -1\n2\n-1 -1\n2\n0 -1\n4\n1 -1 3(...TRUNCATED) | 2 | 8 | {"language":[2,2,4,4,2,2,2,2,2,2,4,4,4,4,2,2,2,2,2,2,2,4,2,2,2,4,4,4,4,4,4,2,4,2,2,2,2,4,4,4,4,2,2,2(...TRUNCATED) | {"language":[2,2,4,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,4,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(...TRUNCATED) | 1,155 | B | 1,000 | 0 | [
"greedy",
"implementation"
] | true | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
76_B. Mice | "Let c be some positive integer. Let's call an array a_1, a_2, …, a_n of positive integers c-array(...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":["4\n889308 0\n110692 0\n0 461939\n146447 815492\n","5\n0 4\n3 4\n2 2\n2 0\n0 0\n","5\n0 10(...TRUNCATED) | {"input":["10 1000000\n1 2 3 4 8 5 6 7 8 9\n","13 666\n84 89 29 103 128 233 190 122 117 208 119 97 3(...TRUNCATED) | 2 | 0 | {"language":[1,1,1,1,1,1,1,1,1,1,1,1],"solution":["import math\nimport sys\ndef checkpal(s):\n re(...TRUNCATED) | {
"language": [],
"solution": []
} | 1,354 | 0 | 2,100 | [
""
] | false | {
"nanos": 0,
"seconds": 1
} | 0 | ||||
44_B. Cola | "Apple adventure\n\nsquare1001 and E869120 got lost in the grid world of $ H $ rows and $ W $ rows!\(...TRUNCATED) | {"input":["ababababa\n3\n2 1 7 aba\n1 5 c\n2 1 7 aba\n","abcdcbc\n5\n2 1 7 bc\n1 4 b\n2 4 7 bc\n1 2 (...TRUNCATED) | {
"input": [],
"output": []
} | {
"input": [],
"output": []
} | 2 | 0 | {"language":[4,2,2,2,2,3,4,2,4,3,2,4,1,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,3,4,2,2,2,2,2,2,2,2,2,2,4,2,4(...TRUNCATED) | {"language":[4,2,4,2,2,2,2,2,2,1,4,2,2,2,2,1,4,2,2,3,2,2,2,2,2,2,4,2,2,2,1,2,1,2,2,2,2,2,2,4,2,2,2,2(...TRUNCATED) | 586 | B | 3,000 | 900 | [
"strings"
] | false | null | 1,073,741,824 | |||
663_A. Rebus | "Chef and his girlfriend are going to have a promenade. They are walking along the straight road whi(...TRUNCATED) | {"input":["3 2\n? 1 2\n","5 1\n-10 -9 ? -7 -6\n","5 3\n4 6 7 2 9\n"],"output":["0 1 2\n","-10 -9 -8 (...TRUNCATED) | {"input":["11\n54 91 4 6 88 23 38 71 77 26 84\n","20\n11 37 81 56 61 2 26 27 59 69 24 7 71 76 45 54 (...TRUNCATED) | {"input":["81\n9 4\n6 8\n6 4\n4 6\n4 8\n9 10\n0 2\n5 4\n8 9\n7 7\n10 5\n4 4\n7 8\n3 7\n2 1\n5 5\n2 7(...TRUNCATED) | 2 | 7 | {"language":[1],"solution":["T=input()\nbest=-1\nbound=10**12\nboundS=str(bound)\ndef findBest(s,off(...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) | 990 | 0 | 1,100 | [
"*special",
"binary search",
"constructive algorithms",
"interactive"
] | false | {
"nanos": 0,
"seconds": 1
} | 0 | ||||
p03940 AtCoder Grand Contest 007 - Shik and Game | "Polycarp has n coins, the value of the i-th coin is a_i. It is guaranteed that all the values are i(...TRUNCATED) | {"input":["1 5 3\n1 3\n1 1\n1 5\n","2 2 3\n1 2\n2 2\n2 1\n","4 3 6\n1 2\n1 3\n2 2\n2 3\n3 1\n3 3\n"](...TRUNCATED) | {"input":["9 13\n6 14 19 5 -5 6 -10 20 8\n","8 9\n6 -1 5 -5 -8 -7 -8 -7\n","10 7\n-9 3 -4 -22 4 -17 (...TRUNCATED) | {"input":["5\n2 1\n5 2\n10 3\n25 4\n25479 33\n","5\n2 1\n9 1\n10 3\n25 4\n25479 33\n","5\n1 1\n9 1\n(...TRUNCATED) | 3 | 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) | {"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 | 0 | 0 | [
"implementation"
] | false | {
"nanos": 0,
"seconds": 2
} | 134,217,728 | ||||
p02781 AtCoder Beginner Contest 154 - Almost Everywhere Zero | "James Bond has a new plan for catching his enemy. There are some cities and directed roads between (...TRUNCATED) | {"input":["3 5 10\nred\n0 0 0\n5 0 0\ngreen\n0 5 5\n5 6 1\nblue\n0 40 5\n5 0 0\n3 10 5\natom\n0 47 3(...TRUNCATED) | {"input":["1\n1\n","100\n98 52 63 2 18 96 31 58 84 40 41 45 66 100 46 71 26 48 81 20 73 91 68 76 13 (...TRUNCATED) | {"input":["100 5\n1\n23\n45\n47\n89","10 2\n4\n1","4 1\n3","100 3\n1\n23\n45\n47\n89","100 0\n1\n23\(...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],"solution":["c(...TRUNCATED) | {
"language": [],
"solution": []
} | 0 | 500 | 1,900 | [
"binary search",
"brute force",
"math"
] | false | {
"nanos": 0,
"seconds": 1
} | 0 | ||||
235_D. Graph Game | "Some days ago, I learned the concept of LCM (least common multiple). I've played with it for severa(...TRUNCATED) | {
"input": [
"0 1 1 1 1 0\n",
"1 1 0 0 1000 1000\n"
],
"output": [
"Yes\n",
"No\n"
]
} | {"input":["10 1 4 10 0\n","100 1 2 1000 0\n","1 11 12 0 10\n","1 2 3 0 0\n","8 6 13 2 5\n","8 3 5 1 (...TRUNCATED) | {"input":["5 10\n2 1 2 2 2\n2\n2 4\n4 5\n","5 10\n2 1 2 2 1\n2\n2 4\n4 5\n","5 10\n3 1 4 2 1\n2\n2 4(...TRUNCATED) | 3 | 9 | {"language":[2,2,2,2,2,2,2,2,2,2,2,3,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,4,2,2,4,4,2,2,2,2,4,2,4,2,2,2,4,2,2,2,3,2,2,2,2,2,2,4,2,2,4,2,2,2,4,2,2,2,2,2,2(...TRUNCATED) | 19 | 1,750 | 2,200 | [] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | ||||
1547_C. Pair Programming | "For skilled programmers, it is very easy to implement a sorting function. Moreover, they often avoi(...TRUNCATED) | {
"input": [
"10 5 5 5\n",
"3 0 0 2\n"
],
"output": [
"9\n",
"0\n"
]
} | {
"input": [],
"output": []
} | {"input":["2 3\n1 1 0\n0 1 0","3 3\n0 1 0\n1 0 1\n0 1 -1","4 6\n1 0 1 1 0 1 \n0 0 1 1 1 1 \n1 1 1 1 (...TRUNCATED) | 2 | 8 | {"language":[2,2,2,1,2,3,2,4,2,4,4,4,2,4,2,4,2,2,2,2,4,2,4,3,2,4,2,2,4,4,2,4,3,4,3,2,4,4,1,4,3,2,4,4(...TRUNCATED) | {"language":[2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,3,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) | 996 | 0 | 900 | [
"binary search",
"constructive algorithms",
"graphs",
"shortest paths"
] | false | null | 1,073,741,824 | ||||
bhavanas-and-bhuvanas-bet | "Tavak and Seyyed are good friends. Seyyed is very funny and he told Tavak to solve the following pr(...TRUNCATED) | {
"input": [
"100 5\n1\n23\n45\n67\n89",
"10 2\n4\n5",
"6 1\n3"
],
"output": [
"608200469",
"0",
"4"
]
} | {
"input": [],
"output": []
} | {"input":["1000\nspnogbxcrp\nbaukbqnmyu\nogxdxhtcwz\nbsjufplykz\nkhicdrdixl\nzookiqggel\nfczygjfhfa\(...TRUNCATED) | 1 | 9 | {"language":[2,4,4,2,3,4,4,4,4,2,2,3,4,3,3,3,3,3,4,2,2,4,3,3,4,3,2,3,4,2,3,3,2,3,3,4,3,3,2,2,3,4,3,2(...TRUNCATED) | {"language":[3,3,2,2,2,3,2,3,4,3,3,2,4,4,2,2,4,4,4,3,4,3,3,2,1,4,4,1,1,3,4,2,3,4,3,2,2,1,3,3,3,2,4,2(...TRUNCATED) | 85 | 0 | 0 | [] | false | {
"nanos": 0,
"seconds": 1
} | 134,217,728 | ||||
p01353 Rabbit Plays Games! | "Now that Chef has finished baking and frosting his cupcakes, it's time to package them. Chef has N (...TRUNCATED) | {
"input": [
"4 1 1 6\n3 2 3"
],
"output": [
"1"
]
} | {
"input": [],
"output": []
} | {"input":["5\n3\n1 1\n1 1\n1 1\n3\n1 1\n1 1\n1 1\n3\n1 1\n1 1\n1 1\n3\n1 2\n1 1\n1 1\n3\n1 100\n1 1\(...TRUNCATED) | 5 | 0 | {"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":[1,2,2,2,2,2,2,2,4,4,2,4,2,2,4,2,4,2,2,2,2,4,4,2,3,2,4,2,2,2,4,2,2,2,3,4,4,2,2,2,4,4,4,3(...TRUNCATED) | 0 | D | 2,000 | 2,500 | [
"brute force",
"data structures",
"dsu",
"graphs",
"sortings"
] | false | {
"nanos": 0,
"seconds": 2
} | 0 |
End of preview. Expand in Data Studio
edition_0572_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
- 11