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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
p02943 AtCoder Grand Contest 037 - Reversing and Concatenating | "you are given an array of size N. You need to select K elements from the array such that the differ(...TRUNCATED) | {
"input": [
"2\n2 9 17\n1 1\n\nSAMPLE"
],
"output": [
"Yes\nNo\n"
]
} | {"input":["3 1\n-2 3\n-2 -2\n","-8916 9282\n2666 2344\n9109 -2730\n","0 45\n42 -47\n-51 -82\n","45 6(...TRUNCATED) | {"input":["5\n10\nbb\nbb\nab\naa\nbb\nbb\nba\naa\nbb\nab\n10\nbb\nab\nba\nab\nba\nba\nab\nba\nba\nba(...TRUNCATED) | 2 | 8 | {"language":[1,1,2,2,2,2,2,2,2,3,2,4,4,2,2,2,2,4,2,2,2,2,2,2,4,2,4,1,4,2,2,2,2,2,4,2,4,4,4,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,0,2,2,3,2,1,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 195 | C | 0 | 3,500 | [
"binary search",
"dp",
"greedy",
"sortings"
] | false | "JOI 君が住む都市にはN 個の駅があり，それぞれ1, 2, ..., N の番号が付けら(...TRUNCATED) | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | ||
153_E. Euclidean Distance | "Everybody knows that Balázs has the fanciest fence in the whole town. It's built up from N fancy s(...TRUNCATED) | {"input":["24\n1 2 3 4\n1 2 4 3\n1 3 2 4\n1 3 4 2\n1 4 2 3\n1 4 3 2\n2 1 3 4\n2 1 4 3\n2 3 1 4\n2 3 (...TRUNCATED) | {"input":["51\n8 10 Chandu\n2 2959 Daspal\n2903 6 Chandu\n9 2938 Daspal\n10 2907 Daspal\n8 2966 Dasp(...TRUNCATED) | {"input":["11\nadd 1\nsum\nadd 2\nsum\nadd 3\nsum\nadd 4\nsum\nadd 6\nsum\nadd 6\n","6\nadd 4\nadd 7(...TRUNCATED) | 2 | 0 | {"language":[2,4,2,4,2,2],"solution":["#include <cstdio>\n#include <iostream>\n#include <sstream>\n#(...TRUNCATED) | {"language":[2,4,4,3,2,2,2,2,3,4,4,4,4,2,2,4,3,4,2,3,4,2,2,4,1,2,2,1,2,4,4,3,2,3,2,4,4,2,4,2,1,4,1,2(...TRUNCATED) | 0 | 2,000 | 0 | [
"constructive algorithms",
"greedy",
"implementation",
"math"
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | ||||
765_D. Artsem and Saunders | "You are given an undirected graph, consisting of n vertices and m edges. The graph does not necessa(...TRUNCATED) | {"input":["3\n3 3 4\n3 3 5\n3 3 3\n"],"output":["***\n*.*\n***\n\n***\n**.\n...\n\n***\n*.*\n**.\n\n(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["6 2 3 1","7834164883628 15 2189823423122 7725883688276","4 2 1 4","7 1 3 2","4 3 3 1","4 (...TRUNCATED) | 2 | 0 | {"language":[2,2,3,2,4,4,2,2,1,4,2,2,4,2,4,4,3,3,3,3,4,3,1,4,4,1,3,2,4,4,4,3,3,2,3,2,3,2,3,3,3,3,4,4(...TRUNCATED) | {"language":[3,2,4,4,2,2,2,4,1,4,4,2,2,4,2,2,4,4,4,2,2,2,2,2,1,2,4,4,2,2,2,2,2,2,2,3,2,2,2,3,2,2,2,2(...TRUNCATED) | 0 | 0 | 1,700 | [] | true | {
"nanos": 0,
"seconds": 1
} | 134,217,728 | ||||
963_B. Destruction of a Tree | "There are N+1 lights. Lights are placed at (0, 0), (1, 0), (2, 0) ... (N, 0). Initially all the li(...TRUNCATED) | {"input":["3\n1 0 1\n0 0 0\n","2\n1 4\n2 3\n","3\n0 0 0\n0 0 0\n"],"output":["0 0 1 \n1 0 0 ","1 3\n(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["1\n100010 2","3\n2 1\n1 3\n2 0","1\n100010 3","3\n2 1\n1 3\n2 1","1\n100011 3","3\n2 1\n1(...TRUNCATED) | 6 | 2 | {"language":[3,3,2,2,3,2,2,2,3,3,3,2,3,4,3,2,3,2,3,2,2,2,2,3,3,3,3,2,2,3,3,2,3,2,3,4,3,2,3,2,4,1,4,3(...TRUNCATED) | {"language":[2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,0,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(...TRUNCATED) | 1,398 | A | 0 | 0 | [] | false | {
"nanos": 0,
"seconds": 6
} | 256,000,000 | |||
903_D. Almost Difference | "You are given a string s consisting of n characters. These characters are among the first k lowerca(...TRUNCATED) | {"input":["5 4 10 1 6\n1 1 5\n1 5 5\n1 3 2\n1 5 2\n2 1\n2 2\n","5 2 2 1 8\n1 1 2\n1 5 3\n1 2 1\n2 2\(...TRUNCATED) | {"input":["5\n42665793 142698407 856080769 176604645 248258165\n10\n1 5 141156007\n2 5 5 3\n2 4 4 2\(...TRUNCATED) | {"input":["3\n3 1 0\n1 2 6\nXOR\n3 1 0\n1 2 3\nAND\n3 1 0\n1 2 3\nOR","3\n3 1 0\n1 2 3\nXOR\n3 1 0\n(...TRUNCATED) | 2 | 7 | {"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,0,2,2,4,2,2,2,2,0,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,0(...TRUNCATED) | 1,382 | 0 | 2,200 | [
"binary search",
"brute force",
"chinese remainder theorem",
"math",
"number theory"
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | ||||
p02679 AtCoder Beginner Contest 168 - ∙ (Bullet) | "Vasya is currently at a car rental service, and he wants to reach cinema. The film he has bought a (...TRUNCATED) | {
"input": [
"3\n12 2\n200\n50\n300\n100"
],
"output": [
"37"
]
} | {"input":["3 1\n1 2 5\n","1 1\n100000\n","5 1\n2 2 4 6 1\n","3 10\n5 5 10\n","1 1\n1\n","3 4\n1 2 5\(...TRUNCATED) | {"input":["2\n\nSBMPLE","2\n\nSBPMLE","2\n\nELMPBS","2\n\nELMPAS","2\n\nSAPMLE","2\n\nSAQMLE","2\n\n(...TRUNCATED) | 2 | 0 | {"language":[2,3,4,2,2,3,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,3,2,2,3,2,2,2,3,2,3,2,3,4,1,2,3(...TRUNCATED) | {
"language": [],
"solution": []
} | 1,081 | 0 | 0 | [
"divide and conquer",
"fft",
"greedy",
"math",
"number theory"
] | false | "差分パルス符号変調は主に音声信号を圧縮する際に用いられる圧縮手法の(...TRUNCATED) | null | 256,000,000 | |||
p01797 Kimagure Cleaner | "Yash is finally tired of computing the length of the longest Fibonacci-ish sequence. He now plays a(...TRUNCATED) | {
"input": [
"aabb\n",
"aabcaa\n"
],
"output": [
"2\n",
"1\n"
]
} | {"input":["50 5000\n2 35 46\n2 43 92\n2 16 88\n2 67 99\n2 36 93\n2 12 20\n2 33 96\n2 55 82\n2 18 32\(...TRUNCATED) | {"input":["728961319347 41296937719710726 52437 42819\n","567018385179 15765533940665693 70514 13819(...TRUNCATED) | 2 | 9 | {"language":[4,4,2,1,2,2,2,2,4,2,2,4,2,4,2,2,2,4,4,4,4,4,3,2,4,2,2,4,4,2,2,2,2,2,2,4,2,2,4,2,2,4,2,2(...TRUNCATED) | {"language":[2,2,4,4,4,3,2,4,4,4,3,2,2,2,4,4,3,3,3,2,2,4,4,4,2,3,3,2,2,2,4,2,3,3,3,2,4,4,3,3,4,4,2,2(...TRUNCATED) | 1,219 | 1,000 | 900 | [
"greedy",
"two pointers"
] | false | {
"nanos": 0,
"seconds": 2
} | 0 | ||||
1046_D. Interstellar battle | "The Berland capital (as you very well know) contains n junctions, some pairs of which are connected(...TRUNCATED) | {
"input": [
"1\n",
"6\n",
"30\n"
],
"output": [
"1\n0",
"2",
"1\n6"
]
} | {"input":["3\n7\n4 6 11 11 15 18 20\n4\n10 10 10 11\n3\n1 1 1000000000\n","1\n6\n1 1 1 2 2 3\n","1\n(...TRUNCATED) | {"input":["3\n1\n2 3\n2\n4 5\n5 6\n2\n2 3\n1 5","3\n1\n2 3\n2\n4 5\n5 6\n1\n2 3\n3 5","3\n1\n1 3\n2\(...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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2],"solut(...TRUNCATED) | {"language":[2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,4,4,2,2,2,2,2,4,2,2,2,4,2,2,2,2,4,2,2,2,2,2,2,2,2(...TRUNCATED) | 219 | E | 1,250 | 0 | [
""
] | true | {
"nanos": 0,
"seconds": 6
} | 256,000,000 | |||
p01538 Kakezan | "You are given an array a of n integers and an integer s. It is guaranteed that n is odd.\n\nIn one (...TRUNCATED) | {"input":["9 3 23\n9 3 22\n10 3 28\n16 10 107\n20 8 102\n20 10 105\n20 10 155\n3 4 3\n4 2 11\n0 0 0"(...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":["10 4\n0 1 4 2 3 0 10 0 5 8\n","6 3\n0 0 1 0 4 5\n","6 1\n0 0 4 0 6 0\n","4 1\n0 1 0 0\n",(...TRUNCATED) | 6 | 3 | {"language":[2,2,4,2,4,3,4,4,2,2,3,1,4,3,3,2,3,3,2,4,2,4,2,2,2,3,3,3,3,3,3,2,4,3,2,2,3,2,2,4,3,4,4,4(...TRUNCATED) | {"language":[2,2,2,2,2,2,2,0,4,2,2,2,4,2,2,2,2,2,2,3,2,2,3,3,2,2,2,2,2,3,0,2,2,0,2,2,0,0,2,3,2,3,3,2(...TRUNCATED) | 604 | 500 | 0 | [
"binary search",
"geometry",
"two pointers"
] | false | {
"nanos": 0,
"seconds": 2
} | 0 | ||||
p03013 AtCoder Beginner Contest 129 - Typical Stairs | "This is the hard version of the problem. The difference between the versions is in the constraints (...TRUNCATED) | {
"input": [
"4 4\n1 2 -10 3\n1 3 1 -10\n2 4 -10 -1\n3 4 0 -3\n"
],
"output": [
"4\n"
]
} | {
"input": [
"3\n1234567\n1268501\n1268499\n"
],
"output": [
"788765312\n999997375\n999999350\n"
]
} | {
"input": [],
"output": []
} | 6 | 0 | {"language":[2,2,4,2,2,3,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,4,4,2,2,4,2,2,2,2,2,4,2,2,2,2,2,2(...TRUNCATED) | {"language":[2,2,2,3,2,4,3,2,2,2,2,2,2,3,4,2,2,2,0,2,0,2,2,2,2,2,3,2,2,2,2,2,0,2,2,2,2,2,2,4,2,1,1,3(...TRUNCATED) | 0 | 3,000 | 1,100 | [
""
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 |
End of preview. Expand in Data Studio
edition_2311_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