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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1386_A. Colors | "Sarah is a girl who likes reading books.\n\nOne day, she wondered about the relationship of a famil(...TRUNCATED) | {
"input": [
"3\nDSAWWAW\nD\nWA\n"
],
"output": [
"8\n2\n4\n"
]
} | {"input":["30\n16 3\n-334 -500 -169 -724 -478 -358 -962 -464 -705 -145 -281 -827 -961 -491 -995 -942(...TRUNCATED) | {"input":["1 5000 2732\n","2 2 0\n","83 4122 123\n","19 862 387\n","100 843 30\n","45 1296 245\n","9(...TRUNCATED) | 2 | 0 | {"language":[1,1,1,1,1],"solution":["import math\nfor _ in xrange(int(raw_input())):\n\tn = int(raw_(...TRUNCATED) | {"language":[4,1,2,2,2,1,2,2,2,4,2,3,2,4,4,2,4,2,4,2,2,4,4,2,4,3,2,2,2,2,4,2,4,2,1,2,2,4,2,2,2,2,2,2(...TRUNCATED) | 248 | 0 | 0 | [
""
] | false | {
"nanos": 0,
"seconds": 3
} | 512,000,000 | ||||
p01538 Kakezan | "Innopolis University scientists continue to investigate the periodic table. There are n·m known el(...TRUNCATED) | {
"input": [
"4 4\n1 2\n2 3\n2 4\n3 4\n",
"4 3\n1 2\n2 3\n3 4\n"
],
"output": [
"1\n1 3\n",
"1\n1 4\n"
]
} | {
"input": [],
"output": []
} | {
"input": [],
"output": []
} | 3 | 0 | {"language":[2,2,2,4,2,4,2,4,2,2,2,2,4,2,2,2,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(...TRUNCATED) | {"language":[1,2,2,2,2,3,2,4,2,1,2,4,2,3,4,2,2,3,3,3,4,2,4,2,2,2,2,3,2,1,4,2,2,2,2,4,2,1,2,2,2,4,4,2(...TRUNCATED) | 0 | A | 0 | 1,600 | [] | false | {
"nanos": 0,
"seconds": 1
} | 134,217,728 | |||
1500_B. Two chandeliers | "Stepan likes to repeat vowel letters when he writes words. For example, instead of the word \"pobed(...TRUNCATED) | {"input":["9 10\n1 2 3 4 5 6 7 8 9\n1 2\n2 3\n2 4\n3 4\n4 5\n4 6\n2 7\n7 8\n7 9\n9 1","2 1\n1 2\n1 2(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["21\n11 19 4 19 6 0 13 7 6 2 5 3 16 16 1 9 15 21 9 21 2\n","100\n57 85 27 81 41 27 73 10 7(...TRUNCATED) | 5 | 9 | {"language":[4,4,4,4,2,4,2,2,2,2,4,2,1,2,2,2,2,2,2,4,3,2,2,2,2,2,4,2,2,2,2,2,4,4,4,2,2,4,2,2,2,4,2,4(...TRUNCATED) | {"language":[2,4,2,2,4,2,2,2,2,2,2,4,2,2,4,2,4,2,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,4,2,2(...TRUNCATED) | 851 | D | 0 | 0 | [] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | |||
1227_D1. Optimal Subsequences (Easy Version) | "Gildong was hiking a mountain, walking by millions of trees. Inspired by them, he suddenly came up (...TRUNCATED) | {
"input": [
"8 2\n1 1 2 3 4 5 5\n",
"7 1\n1 1 3 3 4 4\n"
],
"output": [
"2",
"4"
]
} | {
"input": [],
"output": []
} | {
"input": [],
"output": []
} | 2 | 0 | {"language":[2,4,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,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | {"language":[2,2,2,2,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,0,2,2,2,0,0,2,4,2,2,3,2(...TRUNCATED) | 0 | 500 | 1,000 | [
"dfs and similar",
"dp",
"trees"
] | false | {
"nanos": 0,
"seconds": 8
} | 256,000,000 | ||||
1446_D2. Frequency Problem (Hard Version) | "Roy is looking for Wobbly Numbers. \n\nAn N-length wobbly number is of the form \"ababababab...\" (...TRUNCATED) | {
"input": [
"1\n9\n10\n1\n\nSAMPLE"
],
"output": [
"10"
]
} | {"input":["10\n9 8 7 6 5\n","100\n41 13 29 11 25 15 6 23 28 50 48 17 3 9 44 24 5 19 34 22 33 32 20 1(...TRUNCATED) | {"input":["010\n"],"output":["1 2 3 4 5 6 7 8 9 \n2 4 6 8 10 12 14 16 18 \n3 6 9 12 15 18 21 24 27 \(...TRUNCATED) | 2 | 7 | {"language":[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,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2(...TRUNCATED) | {"language":[2,2,2,2,2,0,4,0,0,2,4,0,2,0,2,0,0,4,0,2,2,2,0,2,2,0,2,3,4,2,4,0,4,0,2,0,2,2,2,2,2,0,2,4(...TRUNCATED) | 0 | E | 0 | 2,700 | [
""
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
277_C. Game | "Easy and hard versions are actually different problems, so read statements of both problems complet(...TRUNCATED) | {"input":["5 2 4 13\nhhwhh\n","3 1 100 10\nwhw\n","5 2 4 1000\nhhwhh\n","4 2 3 10\nwwhw\n"],"output"(...TRUNCATED) | {"input":["1 1\n1\n2\n","6 3\n1 2 3 4 5 6\n3 5 1\n","5 5\n5 6 3 2 1\n4 3 1 5 6\n","1 1\n1\n1\n","10 (...TRUNCATED) | {"input":["3\n77 42 77\n77 77\n77\n","3\n77 31 77\n77 77\n77\n","4\n1 5 7 12\n1 5 7\n1 5\n","3\n77 7(...TRUNCATED) | 6 | 7 | {"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) | {"language":[2,2,2,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,4,2,2,4,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 1,081 | E | 1,000 | 1,800 | [
"binary search",
"brute force",
"math"
] | false | {
"nanos": 0,
"seconds": 6
} | 134,217,728 | |||
muffins3 | "Bob is travelling from one city to another. In his way, he sees many other cities pass by. What he (...TRUNCATED) | {"input":["100\n5\n48 141 231 314 425\n7\n0 19\n50 98\n143 30\n231 55\n342 0\n365 100\n600 10","180\(...TRUNCATED) | {"input":["93 10\n6 47 6 89 21 91 51 72 32 48 54 89 36 12 25 38 58 62 54 16 5 52 52 85 67 33 81 72 6(...TRUNCATED) | {"input":["3\n10 2 5\n12 4 8\n6 2 2\n\nSAMPLE","3\n7 2 5\n12 4 8\n6 2 2\n\nSAMPLF","3\n7 2 5\n12 4 8(...TRUNCATED) | 2 | 0 | {"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) | {"language":[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,4,2,2,2,2,2,2,3,2,4,2,2(...TRUNCATED) | 544 | 1,000 | 1,600 | [] | false | {
"nanos": 0,
"seconds": 4
} | 256,000,000 | ||||
p03010 diverta 2019 Programming Contest 2 - Diverta City | "In a simplified version of a \"Mini Metro\" game, there is only one subway line, and all the trains(...TRUNCATED) | {"input":["2\n3 3 2\n8 3 2\n3 0\n3 7\n8 0\n8 7","2\n3 3 2\n8 3 2\n0 3\n3 7\n8 0\n8 7","1\n10 10 10\n(...TRUNCATED) | {"input":["5 2 4 12\nhhhwh\n","2 5 5 1000000000\nwh\n","16 1 1000 2100\nhhhwwwhhhwhhhwww\n","1 2 3 3(...TRUNCATED) | {"input":["10\n1\n248618\n3\n12 10 8\n6\n100 11 15 9 2 8\n4\n0 1 1 0\n2\n0 0\n2\n0 1\n2\n1 0\n2\n1 1(...TRUNCATED) | 5 | 2 | {"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],"solution":["for _ i(...TRUNCATED) | {"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,4,4,4,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2(...TRUNCATED) | 83 | D2 | 2,500 | 0 | [
"graphs"
] | false | {
"nanos": 0,
"seconds": 8
} | 0 | |||
1269_E. K Integers | "The year of 2012 is coming...\n\nAccording to an ancient choradrican legend in this very year, in 2(...TRUNCATED) | {
"input": [
"2\n2\n5"
],
"output": [
"2\n3\n"
]
} | {"input":["51\n882889888888689888850888388887688788888888888858888\n","55\n7271714707719515303911625(...TRUNCATED) | {"input":["1","0010","11011010001001","11001010001001","11001000001001","1010","01001000101000","110(...TRUNCATED) | 5 | 7 | {"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":[4,2,2,2,2,2,4,2,2,4,2,2,4,2,4,2,2,2,2,4,2,2,4,2,4,2,4,4,4,3,4,2,2,2,2,2,2,2,3,2,2,2,2,1(...TRUNCATED) | 0 | 500 | 1,800 | [
"dfs and similar",
"dsu",
"graphs"
] | false | {
"nanos": 500000000,
"seconds": 0
} | 512,000,000 | ||||
professor-sharma | "You have a string s of length n consisting of only characters > and <. You may do some operations w(...TRUNCATED) | {
"input": [
"2\nSHILPA\nAAMIR\nMATT\nDENISE"
],
"output": [
"ENEMIES\nLOVE"
]
} | {"input":["10 23\n6 9 8 10 4 3 7 1 5 2\n7 2\n3 2\n2 4\n2 3\n7 5\n6 4\n10 7\n7 1\n6 8\n6 2\n8 10\n3 5(...TRUNCATED) | {"input":["4 6\n1 2 101\n3 1 100\n2 4 100\n4 3 100\n1 4 100\n3 2 100","15 22\n8 13 33418\n14 15 5584(...TRUNCATED) | 3 | 8 | {"language":[1,1,1,1,1,1,1,1],"solution":["a=[]\nt,k=input(),input()\nfor _ in xrange(t):\n\ta.appen(...TRUNCATED) | {"language":[2,4,4,3,4,2,3,4,1,2,4,2,4,4,4,4,2,3,4,3,3,2,3,4,3,3,3,2,4,2,2,4,4,2,4,4,2,3,2,2,4,2,2,3(...TRUNCATED) | 0 | 0 | 0 | [
"brute force",
"data structures",
"dsu",
"graphs",
"sortings"
] | false | {
"nanos": 0,
"seconds": 4
} | 268,435,456 |
End of preview. Expand in Data Studio
edition_2355_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