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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1408_A. Circle Coloring | "Let's call a string a phone number if it has length 11 and fits the pattern \"8xxxxxxxxxx\", where (...TRUNCATED) | {
"input": [
"1\n5 3\n200 6 9"
],
"output": [
"120"
]
} | {"input":["64 63\n11 51\n64 11\n64 39\n11 6\n24 64\n51 63\n43 51\n64 29\n6 22\n47 6\n1 47\n41 22\n41(...TRUNCATED) | {"input":["19 23\nU..U..R........L...D...\n.D.....UL.U.U........DR\n..D.U..D....L......R...\nD......(...TRUNCATED) | 6 | 0 | {"language":[2,4,2,4,1,2,2,2,2,2,3,3,2,2,3,2,4,3,2,4,2,4,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | {"language":[4,2,2,2,2,4,4,4,4,4,2,2,2,2,2,1,4,3,4,2,2,4,2,2,2,4,2,4,4,2,1,2,1,2,2,2,4,1,2,2,2,2,3,3(...TRUNCATED) | 1,165 | 0 | 3,500 | [
"math"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | ||||
272_B. Dima and Sequence | "Hackers! Hackers! Everywhere!\nSome days back your email ID was hacked. Some one read the personal (...TRUNCATED) | {
"input": [
"2 -3 4\nL 2 5\n? 3 5"
],
"output": [
"2\nL 4\nL 3"
]
} | {"input":["9\n72 49 39 50 68 35 75 94 56\n","4\n2 3 1 2\n","8\n3 4 3 1 1 3 4 1\n","1\n4\n","7\n2 1 2(...TRUNCATED) | {"input":["30 1\n19 20 10 21 9 1 20 21 30 12 25 25 2 1 10 3 19 12 18 12 30 18 22 1 18 18 30 30 12\n"(...TRUNCATED) | 2 | 8 | {"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,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) | 1,311 | F | 0 | 0 | [
"brute force",
"data structures",
"implementation"
] | false | null | 0 | |||
19_B. Checkout Assistant | "Description\nYou are given two strings S and T, such that length of S is greater than the length of(...TRUNCATED) | {"input":["3 2\n0 0 0\n1 1 1\n","4 3\n0 0 2 1\n2 0 1 1\n","5 10\n0 0 0 1 2\n2 1 0 0 0\n"],"output":[(...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) | 3 | 7 | {
"language": [],
"solution": []
} | {"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 | 0 | 900 | [
"dp",
"matrices",
"sortings"
] | false | {
"nanos": 0,
"seconds": 2
} | 512,000,000 | ||||
1281_B. Azamon Web Services | "Fox Ciel is playing a game. In this game there is an infinite long tape with cells indexed by integ(...TRUNCATED) | {"input":["3\n0 10 4\n10 0 4\n20 10 4\n"],"output":["(((0*((1-abs((t-0)))+abs((abs((t-0))-1))))+(5*((...TRUNCATED) | {"input":["5\n42665793 142698407 856080769 176604645 248258165\n10\n1 5 141156007\n2 5 5 3\n2 4 4 2\(...TRUNCATED) | {"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":[4,4,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,3,2,2,4,4,4,2,2,2,2,2,2,2,2,4,2,2,2(...TRUNCATED) | {
"language": [],
"solution": []
} | 0 | 1,000 | 0 | [
"implementation"
] | false | {
"nanos": 0,
"seconds": 8
} | 0 | ||||
p01262 Adaptive Time Slicing Quantization | "A Little Elephant from the Zoo of Lviv likes lucky strings, i.e., the strings that consist only of (...TRUNCATED) | {"input":["+Mike\nMike:hello\n+Kate\n+Dmitry\n-Dmitry\nKate:hi\n-Kate\n","+Mike\n-Mike\n+Mike\nMike:(...TRUNCATED) | {"input":["10 4\nbcaaddaacc\n1 0 1 1\n0 0 1 0\n1 1 1 0\n1 0 0 1\n","100 10\nigffabeaiaajhjaghjgfjcch(...TRUNCATED) | {"input":["100\n5\n48 141 231 554 425\n7\n0 19\n50 98\n143 30\n231 55\n342 0\n365 100\n600 10","180\(...TRUNCATED) | 1 | 7 | {"language":[2,2,2,2,2],"solution":["\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define int (...TRUNCATED) | {
"language": [],
"solution": []
} | 272 | E | 0 | 0 | [] | false | {
"nanos": 0,
"seconds": 2
} | 512,000,000 | |||
p00819 Unreliable Message | "A permutation of length n is an array consisting of n distinct integers from 1 to n in arbitrary or(...TRUNCATED) | {
"input": [
"3\n1 1 1\n",
"1\n1\n",
"2\n1 2\n",
"4\n1 2 3 4\n"
],
"output": [
"-1\n",
"-1\n",
"-1\n",
"1 2\n"
]
} | {"input":["5 0\n884430748 884430748 708433020 708433020 708433020\n","2 1\n1 1\n","2 0\n2 1\n","5 2\(...TRUNCATED) | {"input":["30\n16 3\n-334 -500 -169 -724 -478 -358 -962 -464 -705 -145 -281 -827 -961 -491 -995 -942(...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,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,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) | 0 | 0 | 2,200 | [] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | ||||
235_A. LCM Challenge | "In the rush of modern life, people often forget how beautiful the world is. The time to enjoy those(...TRUNCATED) | {
"input": [
"6\n2 3 1 3 2 4\n2\n1 0 4\n2 3 5\n\nSAMPLE"
],
"output": [
"2\n-1"
]
} | {"input":["1 10\n8\n1\n2\n3\n4\n5\n6\n7\n8\n9\n16\n","1 10\n4\n1\n2\n3\n4\n5\n6\n7\n8\n9\n16\n","1 1(...TRUNCATED) | {"input":["5\n12\n5 4 4 3 2 2 1 1 1 1 1 1\n4\n4 3 2 1\n1\n1000000\n20\n20 19 18 17 16 15 14 13 12 11(...TRUNCATED) | 2 | 7 | {"language":[2,1,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,1,2,4,1,1,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,4,2(...TRUNCATED) | {"language":[2,4,2,2,4,2,2,2,2,2,4,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,4,2,2,2,4,2,2(...TRUNCATED) | 0 | A | 0 | 3,000 | [
""
] | false | {
"nanos": 0,
"seconds": 5
} | 0 | |||
1208_A. XORinacci | "Petya and Vasya arranged a game. The game runs by the following rules. Players have a directed grap(...TRUNCATED) | {
"input": [
"5 1\nbacba",
"10 2\nbbaabbbaab"
],
"output": [
"aabca",
"aaaabbaabb"
]
} | {
"input": [],
"output": []
} | {"input":["13\n1\n>\n1\n?\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n","3\n2(...TRUNCATED) | 2 | 7 | {"language":[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,3,2,4,2,2,2,2,2,2,2,4,2,2,2,2(...TRUNCATED) | {"language":[4,4,3,2,4,1,3,2,2,3,4,4,2,1,1,2,3,4,3,2,3,2,2,2,3,3,3,3,4,4,3,2,2,4,4,2,4,3,3,2,1,2,4,2(...TRUNCATED) | 178 | 1,000 | 2,400 | [] | false | {
"nanos": 0,
"seconds": 1
} | 268,435,456 | ||||
855_D. Rowena Ravenclaw's Diadem | "You and your friend are participating in a TV show \"Run For Your Prize\".\n\nAt the start of the s(...TRUNCATED) | {"input":["8\n0 0\n3 2\n6 2\n8 6\n6 5\n7 7\n0 4\n3 4\n8\n0 0\n5 3\n5 2\n4 1\n6 1\n8 6\n6 4\n2 4\n0"](...TRUNCATED) | {"input":["1\n1\n1\n1\n1\n1\n1\n","1\n3\n2 3 1\n1 2\n2 3\n1\n1\n1\n2\n","2\n6\n5 3 2 4 1 6\n1 2\n1 3(...TRUNCATED) | {"input":["30\n10 1 8 10 2 6 37 7 3 7 1 3 1 1 14 2 5 19 4 1 13 3 5 6 1 5 1 1 23 1\n98 4 43 41 56 58 (...TRUNCATED) | 6 | 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":[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],"solut(...TRUNCATED) | 1,227 | B | 1,750 | 0 | [
"brute force",
"greedy",
"math"
] | false | {
"nanos": 0,
"seconds": 6
} | 256,000,000 | |||
609_B. The Best Gift | "You are given an array A of size N, and Q queries to deal with. For each query, you are given an in(...TRUNCATED) | {
"input": [
"4\n2 10\n0 20\n1 5\n1 3\n",
"3\n0 1\n0 10\n0 100\n"
],
"output": [
"8",
"111"
]
} | {
"input": [],
"output": []
} | {"input":["? + ? + ? + ? + ? + ? + ? + ? + ? + ? - ? = 9\n","? - ? = 2\n","? = 1000001\n","? - ? + ?(...TRUNCATED) | 5 | 10 | {"language":[2,3,4,3,3,4,1,3,3,2,4,4,3,3,1,3,2,3,3,2,3,4,3,3,3,2,3,4,4,3,3,3,2,3,3,3,2,3,2,3,3,3,3,3(...TRUNCATED) | {
"language": [],
"solution": []
} | 1,208 | A | 500 | 0 | [
"constructive algorithms",
"implementation"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 |
End of preview. Expand in Data Studio
edition_1062_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
- 16