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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
p03771 AtCoder Grand Contest 012 - Camel and Oases | "Disclaimer: there are lots of untranslateable puns in the Russian version of the statement, so ther(...TRUNCATED) | {
"input": [
"2\n",
"3+2+1\n",
"1+1+3+1+3\n"
],
"output": [
"2\n",
"1+2+3\n",
"1+1+1+3+3\n"
]
} | {"input":["10\n669924290 408119795 804030560\n663737793 250734602 29671646\n431160679 146708815 2894(...TRUNCATED) | {"input":["3,4,5\n5,5,8\n4,5,4\n5,4,3","3,3,5\n5,5,8\n4,4,4\n5,4,3","3,4,5\n5,5,8\n4,5,4\n3,4,5","3,(...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],"solution":["#include (...TRUNCATED) | {"language":[3,1,2,2,1,2,4,3,3,2,2,4,2,4,4,4,2,2,2,1,2,4,2,1,1,4,3,3,3,2,4,2,2,2,2,3,2,4,4,2,2,4,2,2(...TRUNCATED) | 0 | A | 0 | 0 | [
""
] | false | {
"nanos": 0,
"seconds": 2
} | 0 | |||
laddu | "The HR manager was disappointed again. The last applicant failed the interview the same way as 24 p(...TRUNCATED) | {
"input": [
"4\n6 6 5 5\n",
"5\n1 2 3 1 3\n",
"4\n6 6 4 4\n"
],
"output": [
"0",
"4",
"-8"
]
} | {"input":["919536000 993098880\n","691200 583200\n","5 1000000000\n","100 10\n","537814642 537814642(...TRUNCATED) | {"input":["5\n10 50\n11 50\n10 50\n10 50\n10 50\n","3\n1000 3000\n1500 1302\n3000 1000\n","43\n75 16(...TRUNCATED) | 2 | 7 | {"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,2,2,2,2,2,2,2,4,2,2,2,2(...TRUNCATED) | {
"language": [],
"solution": []
} | 0 | 0 | 0 | [
"trees"
] | false | {
"nanos": 0,
"seconds": 2
} | 134,217,728 | ||||
662_C. Binary Table | "The King of a little Kingdom on a little island in the Pacific Ocean frequently has childish ideas.(...TRUNCATED) | {
"input": [
"3\nkek\npreceq\ncheburek\n",
"4\nmail\nai\nlru\ncf\n"
],
"output": [
"NO\n",
"cfmailru\n"
]
} | {"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) | {
"input": [],
"output": []
} | 6 | 9 | {"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2],"solution":["#include <bits/stdc++.h>\nusing n(...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) | 39 | B | 0 | 0 | [] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
556_C. Case of Matryoshkas | "Bob came to a cash & carry store, put n items into his trolley, and went to the checkout counter to(...TRUNCATED) | {
"input": [
"3\n1 2 3\n",
"5\n5 4 3 2 1\n"
],
"output": [
"0 0 0\n",
"0 1 3 6 10\n"
]
} | {
"input": [],
"output": []
} | {"input":["10\ntypedef errtype** ucywcaykzh\ntypeof &ucywcaykzh*********\ntypedef &&&&&&void********(...TRUNCATED) | 2 | 0 | {"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,4,2,2,2,2,2,2,2,2,2,2,4,4,4,1,1,2,4,2,1,2,4,2,2,2,4,2,4,2,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 820 | D | 0 | 2,800 | [
"binary search",
"greedy",
"sortings"
] | false | {
"nanos": 0,
"seconds": 2
} | 512,000,000 | |||
551_B. ZgukistringZ | "Everything got unclear to us in a far away constellation Tau Ceti. Specifically, the Taucetians cho(...TRUNCATED) | {"input":["5\n1 2\n2 1\n5 10\n10 9\n20 1\n","5\n1 2\n2 1\n5 10\n10 9\n19 1\n"],"output":["4\n","3\n"(...TRUNCATED) | {"input":["1\n17 20\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 6 10 10\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2\n"],"out(...TRUNCATED) | {"input":["5\n2 8 1 7 9\n","4\n6 2 4 5\n","3\n3 1 3\n","200\n2 1 1 1 2 1 2 1 1 1 2 1 2 2 2 1 1 2 1 2(...TRUNCATED) | 2 | 0 | {"language":[1,1],"solution":["def CheckIfProbablyPrime(x):\n return (2 << x - 2) % x\ndef primes(...TRUNCATED) | {
"language": [],
"solution": []
} | 0 | B | 2,500 | 0 | [
"combinatorics",
"dp"
] | false | {
"nanos": 0,
"seconds": 8
} | 1,073,741,824 | |||
p01086 Short Phrase | "Given the value of n, print the n'th prime number.\n\nInput : A single integer n. \nOutput : A sing(...TRUNCATED) | {
"input": [
"3\n3 1 0\n1 2 3\nXOR\n3 1 0\n1 2 3\nAND\n3 1 0\n1 2 3\nOR"
],
"output": [
"0\n0\n3\n"
]
} | {"input":["384\n87 78 16 94 36 87 93 50 22 63 28 91 60 64 27 41 27 73 37 12 69 68 30 83 31 63 24 68 (...TRUNCATED) | {"input":["3 2\n3\n2\n1","3 4\n3\n2\n1","3 0\n3\n2\n1","3 001\n3\n2\n1","5 1\n5\n3\n2\n1\n4","5 6\n1(...TRUNCATED) | 3 | 0 | {"language":[2,2,2,2,2,3,2,4,2,2,4,2,3,2,2,2,2,2,2,2,4,4,2,2,2,2,4,2,4,2,2,2,2,3,4,2,2,2,2,4,1,2,2,4(...TRUNCATED) | {"language":[2,0,3,3,2,2,3,2,3,2,3,2,3,3,2,3,2,0,2,4,2,3,2,3,3,0,2,2,2,2,2,2,0,0,2,3,0,2,2,2,2,3,2,2(...TRUNCATED) | 242 | F | 0 | 0 | [
""
] | false | {
"nanos": 0,
"seconds": 1
} | 0 | |||
p03503 AtCoder Beginner Contest 080 - Shopping Street | "You are given a string S consisting of letters `b`, `d`, `p` and `q`. Determine whether S is a mirr(...TRUNCATED) | {"input":["10 3 409693891\n","65 4 177545087\n","5 2 433416647\n"],"output":["2\n","910726\n","1\n"](...TRUNCATED) | {"input":["0\n2000000000 2000000000 1\n","22\nCleo likes Snowy\nCleo likes Troll\nChapay likes Dracu(...TRUNCATED) | {"input":["12\n1\n2\n3\n6\n5\n6\n7\n8\n9\n10\n39\n691\n","12\n1\n2\n3\n6\n5\n6\n7\n8\n9\n6\n39\n691\(...TRUNCATED) | 1 | 0 | {"language":[3,3,3,3,3,3,3,3,4,3,3,3,3,3,3,2,3,4,3,3,3,3,3,3,3,3,3,2,3,3,3,3,2,3,3,3,3,3,3,3,2,3,4,3(...TRUNCATED) | {"language":[2,2,3,2,2,2,2,2,4,4,4,2,4,2,4,2,2,3,2,2,2,2,2,2,4,4,2,3,2,2,4,2,2,2,2,2,2,3,2,4,4,2,2,4(...TRUNCATED) | 1,129 | 0 | 800 | [
""
] | false | null | 0 | ||||
38_C. Blinds | "The educational program (AHK Education) of the Aiz Broadcasting Corporation broadcasts a program ca(...TRUNCATED) | {
"input": [
"4 1 1 6\n3 2 3"
],
"output": [
"1"
]
} | {"input":["20 20\n00010110100100010111\n11110000001100101110\n01110101110001111000\n1011110100011111(...TRUNCATED) | {
"input": [],
"output": []
} | 3 | 11 | {"language":[4,2,2,2,2,3,2,1,4,4,4,2,2,4,2,4,2,2,2,4,2,3,3,4,2,2,2,2,2,4,4,2,4,4,2,2,3,4,2,3,4,3,2,2(...TRUNCATED) | {"language":[4,2,2,2,2,2,2,2,2,2,2,2,3,2,4,2,2,4,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,3,2(...TRUNCATED) | 1,149 | A | 1,500 | 0 | [
"data structures"
] | false | null | 256,000,000 | |||
1348_F. Phoenix and Memory | "Differential pulse code modulation is one of the compression methods mainly used when compressing a(...TRUNCATED) | {"input":["8 4\n7 1 1\n2 1 1\n4 0 1\n8 1 1\n1 0 1\n1 1 1\n1 0 1\n3 0 0\n","5 2\n6 0 0\n9 0 0\n1 0 1\(...TRUNCATED) | {"input":["2 313 856 964 421\n","61 464 623 89 548\n","37 261 207 1 1000\n","4 202 512 995 375\n","3(...TRUNCATED) | {"input":["9 1004498469 6\n","1 0 10\n","1944219055 33463955 1369298327\n","914835 4386500 9234739\n(...TRUNCATED) | 2 | 9 | {"language":[2,2,2,2,2,2,3,2,2,4,2,2,4,2,2,4,2,2,2,3,2,2,3,4,4,4,2,2,2,2,4,3,4,2,3,2,2,4,2,3,2,4,2,1(...TRUNCATED) | {"language":[3,4,3,4,3,2,4,4,4,3,2,3,3,2,4,1,2,4,2,4,4,4,3,4,1,3,2,2,2,3,2,4,3,3,2,3,2,2,3,1,4,2,3,3(...TRUNCATED) | 1,100 | B | 1,750 | 0 | [
"number theory"
] | false | {
"nanos": 0,
"seconds": 5
} | 1,073,741,824 | |||
702_E. Analysis of Pathes in Functional Graph | "Manao works on a sports TV. He's spent much time watching the football games of some country. After(...TRUNCATED) | {"input":["? - ? = 1\n","? + ? - ? + ? + ? = 42\n","? = 1000000\n"],"output":["Impossible\n","Possib(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["228\n1 3 1 7 1 3 1 15 1 3 1 7 1 3 1 31 1 3 1 7 1 3 1 15 1 3 1 7 1 3 1 63 1 3 1 7 1 3 1 15(...TRUNCATED) | 2 | 1 | {"language":[2,4,4,3,4,1,2,3,4,3,4,2,2,4,1,3,4,4,2,2,2,3,2,2,3,1,3,3,4,4,3,4,3,2,4,4,1,2,2,2,2,2,2,3(...TRUNCATED) | {"language":[3,2,2,4,1,2,2,2,2,4,4,2,2,2,4,4,2,3,2,1,2,2,2,4,4,2,4,2,2,1,2,2,2,2,2,2,2,2,2,4,2,2,2,2(...TRUNCATED) | 875 | C | 0 | 2,300 | [
"binary search",
"geometry",
"ternary search"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 |
End of preview. Expand in Data Studio
edition_2485_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
- 7