name large_stringlengths 4 70 | description large_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 large_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 large_stringclasses 36 values | time_limit dict | memory_limit_bytes int64 0 1.07B | input_file large_stringclasses 1 value | output_file large_stringclasses 1 value |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
621_D. Rat Kwesh and Cheese | "Problem\n\nA large-scale cluster † type supercomputer (commonly known as \"SAKURA\") cluster at M(...TRUNCATED) | {"input":["1\n1\n","2\n1 2\n3 4\n","4\n5 7 8 4\n9 5 3 2\n1 6 6 4\n9 5 7 3\n"],"output":["0\n","2\n",(...TRUNCATED) | {"input":["brtakoktrosttttttttttosafasfkalsfkodfdasiofhadfhasdsajfdsafoasodsafahaihfdisoadspapsapios(...TRUNCATED) | {"input":["5\n0 968804136\n0 736567537\n2 343136264\n0 259899572\n1 103950505\n","5\n0 51690939\n0 6(...TRUNCATED) | 2 | 11 | {"language":[2,4,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,2,4,2,2,2,4,2,2,2,2,2,2(...TRUNCATED) | {"language":[0,2,2,2,0,2,2,2,2,2,2,2,2,2,2,0,2,2,0,2,2,2,2,0,0,2,0,2,2,2,2,0,0,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 1,428 | 1,750 | 0 | [
""
] | false | {
"nanos": 0,
"seconds": 3
} | 256,000,000 | ||||
1301_B. Motarack's Birthday | "Arpa is taking a geometry exam. Here is the last problem of the exam.\n\nYou are given three points(...TRUNCATED) | {
"input": [
"5\n5\n3\n2\n1\n4\n6\n1\n2\n3\n4\n5\n6\n3\n3\n2\n1\n0"
],
"output": [
"7\n0\n3"
]
} | {"input":["7879 2590 2818\n","78 28 27\n","9178 2255 7996\n","6571 6449 8965\n","6151 6148 3746\n","(...TRUNCATED) | {"input":["100\n303\n5","100\n256\n5","100\n407\n5","100\n407\n2","100\n407\n3","100\n407\n6","100\n(...TRUNCATED) | 2 | 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,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | {"language":[2,1,4,2,4,2,2,4,2,2,4,4,3,2,2,4,2,2,4,3,2,2,4,3,1,4,2,4,4,2,2,3,4,1,3,4,4,4,2,2,2,2,4,4(...TRUNCATED) | 0 | E | 0 | 2,200 | [
"math"
] | false | {
"nanos": 0,
"seconds": 1
} | 268,435,456 | |||
425_D. Sereja and Squares | "Snuke is conducting an optical experiment using mirrors and his new invention, the rifle of Mysteri(...TRUNCATED) | {
"input": [
"AprilFool\n14\n"
],
"output": [
"AprILFooL"
]
} | {"input":["1 5000 4999\n","2 1 0\n","83 2813 123\n","93 2364 2364\n","100 1 0\n","21 862 387\n","1 1(...TRUNCATED) | {"input":["100\n92 53 86 41 77 68 80 54 17 96 89 53 64 55 2 80 28 58 77 43 70 91 71 71 78 3 25 2 15 (...TRUNCATED) | 2 | 9 | {"language":[4,1,4,3,3,3,3,4,3,2,3,2,3,3,3,3,4,3,2,3,3,2,2,2,2,2,3,4,3,4,2,1,4,3,2,2,2,3,2,4,3,2,3,3(...TRUNCATED) | {"language":[2,4,2,2,0,2,4,2,3,2,3,2,2,2,2,2,2,0,2,2,2,3,2,2,2,2,2,3,2,0,0,2,2,0,3,0,2,2,2,2,2,2,2,2(...TRUNCATED) | 633 | C | 2,750 | 0 | [
"brute force",
"combinatorics",
"dp",
"string suffix structures"
] | false | null | 256,000,000 | |||
1311_F. Moving Points | "The bustling town of Siruseri has just one sports stadium. There\nare a number of schools, colleges(...TRUNCATED) | {"input":["6\n4 2\nbbab\n7 5\ncceddda\n6 5\necdaed\n7 4\ndcdbdaa\n8 3\nccabbaca\n5 7\neabba\n"],"out(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["aaaa b","dcba cb","aa`a a","dcac dc","a``a a","b abab","aaaa c","dcba bc","b baba","aaa` (...TRUNCATED) | 6 | 11 | {"language":[1],"solution":["import sys\n\nfor __ in range(input()) :\n n , k = map(int,sys.stdin(...TRUNCATED) | {"language":[2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,1,2,2,2,2,2,2,2,2,2,4,4,2,2,2,2,4,2,2,2,2,2,1,2,4,2,2,1,2(...TRUNCATED) | 820 | A | 1,000 | 800 | [
""
] | false | {
"nanos": 0,
"seconds": 2
} | 268,435,456 | |||
p03455 AtCoder Beginner Contest 086 - Product | "You are given a square board, consisting of n rows and n columns. Each tile in it should be colored(...TRUNCATED) | {"input":["1500 2000 1600 3 2","1500 2000 500 90000 100000","1500 2000 1900 3 2"],"output":["7900","(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["51\n1732111733638718702525811518175029394157760329139501\n","55\n815096522892298714932212(...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,1,4,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,4,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,4,2,2(...TRUNCATED) | 0 | E | 1,000 | 1,300 | [
"implementation"
] | false | null | 256,000,000 | |||
980_E. The Number Games | "Given a string s, process q queries, each having one of the following forms:\n\n * 1 i c — Chang(...TRUNCATED) | {
"input": [
"16\n.**.*..*.***.**.\n",
"11\n.*.*...*.*.\n"
],
"output": [
"yes",
"no"
]
} | {"input":["#(#(#((##((()))(((#)(#()#(((()()(()#(##(((()(((()))#(((((()(((((((()#((#((()(#(((()(()##((...TRUNCATED) | {"input":["3\nDSAWWAW\nD\nAW\n","3\nWSAWDAW\nD\nAW\n","3\nDAAWWSW\nD\nAW\n","3\nWAWWASD\nD\nWA\n","3(...TRUNCATED) | 2 | 10 | {"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,4,2,2,2,4,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | {"language":[0,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,2,2,2,2,0,2,2,2,2,2],"solution":[(...TRUNCATED) | 1,189 | B | 2,500 | 0 | [
"dfs and similar",
"divide and conquer",
"implementation"
] | false | null | 268,435,456 | |||
bobs-journey-5 | "Tree is a connected acyclic graph. Suppose you are given a tree consisting of n vertices. The verte(...TRUNCATED) | {"input":["3\n4\nS010\n0001\n1000\n111F\n3\nS10\n101\n01F\n5\nS0101\n00000\n01111\n11111\n0001F\n"],(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["4\n3\n1 4 2\n1 3 1\n2\n2 4\n2 3\n2\n1 1100000000\n1 1000000000\n4\n3 10 5 8\n2 5 2 4\n","(...TRUNCATED) | 6 | 7 | {"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":[4,4,4],"solution":["import java.io.IOException;\nimport java.io.InputStream;\nimport ja(...TRUNCATED) | 937 | G | 0 | 1,800 | [
""
] | true | null | 0 | |||
675_E. Trains and Statistic | "Tavas is a cheerleader in the new sports competition named \"Pashmaks\".\n\n<image>\n\nThis competi(...TRUNCATED) | {
"input": [
"5 3 2\naaaaa\naaa\naab"
],
"output": [
"1 6"
]
} | {
"input": [
"abcdabcdab\n5\n2 2 8 ab\n2 1 10 ab\n1 3 a\n1 4 b\n2 1 4 ab\n"
],
"output": [
"1\n3\n2\n"
]
} | {"input":["3\n2 3 6","3\n2 3 11","3\n3 2 3","3\n2 5 3","3\n2 2 3","3\n2 2 11","3\n3 2 6","3\n2 2 13"(...TRUNCATED) | 2 | 9 | {"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":["d(...TRUNCATED) | {
"language": [],
"solution": []
} | 0 | 1,250 | 2,400 | [
"binary search",
"data structures",
"hashing"
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | ||||
1144_B. Parity Alternated Deletions | "Pink Floyd are pulling a prank on Roger Waters. They know he doesn't like [walls](https://www.youtu(...TRUNCATED) | {"input":["4 4 2\n2 3\n1 2\n1 3\n1 4\n","5 8 2\n2 1\n4 2\n5 4\n5 2\n4 3\n5 1\n4 1\n3 2\n","5 7 2\n1 (...TRUNCATED) | {"input":["42 28\n7 19\n15 24\n3 42\n18 5\n32 27\n26 20\n40 30\n35 2\n14 8\n22 10\n36 4\n16 14\n21 2(...TRUNCATED) | {"input":["1 1\n-1\n","5 1\n-3 -2 -1 0 0\n","7 1\n-7 ? ? ? ? ? 2\n","3 2\n-5 ? 0\n","7 4\n-10 0 ? 1 (...TRUNCATED) | 2 | 12 | {"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":[3,1,3,2,1,2,2,2,4,2,3,4,2,4,2,4,2,3,1,3,4,3,2,2,4,3,2,2,1,2,4,2,4,3,4,2,4,2,4,4,4,3,2,4(...TRUNCATED) | 0 | C | 1,500 | 0 | [
"implementation"
] | false | null | 256,000,000 | |||
551_B. ZgukistringZ | "Ori and Sein have overcome many difficult challenges. They finally lit the Shrouded Lantern and fou(...TRUNCATED) | {
"input": [
"1\n9\n10\n1\n\nSAMPLE"
],
"output": [
"10"
]
} | {"input":["1\n5 39\n1 2\n3 4\n5 6\n7 8\n1 9\n3 10\n3 11\n5 12\n5 13\n7 14\n7 15\n9 2\n10 2\n11 2\n12(...TRUNCATED) | {"input":["1\n0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0\n7\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n1 0 0 0 0 0 1 0 0(...TRUNCATED) | 2 | 0 | {"language":[4,2,2,2,2,2,3,4,2,4,4,2,3,4,4,2,4,2,1,2,4,2,4,2,2,4,4,2,2,2,4,4,2,4,3,4,2,4,4,3,2,1,4,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 | A | 0 | 2,000 | [
""
] | false | null | 256,000,000 |
End of preview. Expand
in Data Studio
edition_2888_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
- 18