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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
920_E. Connected Components? | "You are given a matrix consisting of n rows and m columns. The matrix contains lowercase letters of(...TRUNCATED) | {"input":["9\ndo\nthe\nbest\nand\nenjoy\ntoday\nat\nacm\nicpc\n14\noh\nyes\nby\nfar\nit\nis\nwow\nso(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["728961319347 41296937719710726 52437 42819\n","567018385179 15765533940665693 70514 13819(...TRUNCATED) | 2 | 3 | {"language":[1,1,1,1,1,1,1,1],"solution":["i=1\nfor _ in xrange(input()):\n\ta,b=map(int,raw_input()(...TRUNCATED) | {"language":[2,0,2,2,2,2,2,1,2,2,2,2,2,2,2,1,2,2,2,2,0,2,0,0,2,0,0,0,4,1,2,2,0,2,0,0,2,2,2,0,2,2,2,2(...TRUNCATED) | 174 | E | 0 | 1,100 | [
""
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
730_J. Bottles | "Let us consider sets of positive integers less than or equal to n. Note that all elements of a set (...TRUNCATED) | {"input":["4 2 3 1","7834164883628 15 2189823423122 5771212644938","4 2 1 1","4 1 1 4"],"output":["0(...TRUNCATED) | {"input":["100\n591 417 888 251 792 847 685 3 182 461 102 348 555 956 771 901 712 878 580 631 342 33(...TRUNCATED) | {
"input": [],
"output": []
} | 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,2,2,2,2(...TRUNCATED) | {
"language": [],
"solution": []
} | 650 | 0 | 0 | [] | true | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | ||||
716_D. Complete The Graph | "PCK, which recycles Aizu's precious metal, Aizunium, has a network all over the country and collect(...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":["3\nooe\n","36\naaiouyaaeeiioouuyyaaeeeeiiiooouuuyyy\n","3\npoo\n","1\nb\n","4\nooee\n","5(...TRUNCATED) | 2 | 0 | {"language":[2,2,2,2,4,2,2,4,2,4,2,2,2,2,2,2,4,2,2,2,4,2,2,2,4,2,2,2,2,3,2,4,4,2,4,2,2,2,4,4,2,2,2,2(...TRUNCATED) | {"language":[2,2,2,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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4(...TRUNCATED) | 1,030 | 1,000 | 0 | [
"binary search",
"brute force",
"implementation"
] | false | {
"nanos": 0,
"seconds": 2
} | 0 | ||||
478_A. Initial Bet | "You are the God of Wind.\n\nBy moving a big cloud around, you can decide the weather: it invariably(...TRUNCATED) | {
"input": [
"3 4",
"1 21"
],
"output": [
"Even",
"Odd"
]
} | {"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":["6 1 2 3 4 7","6 106 2 3 4 5","6 2 2 3 4 7","6 159 2 3 4 5","6 200 2 3 8 8","6 159 2 3 3 5(...TRUNCATED) | 2 | 10 | {"language":[3,2,3,3,4,2,3,3,3,3,3,3,3,4,2,3,2,2,3,3,3,3,3,3,2,3,3,3,1,2,3,4,3,3,2,3,2,4,2,4,4,3,3,4(...TRUNCATED) | {"language":[2,2,2,2,0,2,0,2,2,2,2,2,0,2,0,1,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,0,2,2(...TRUNCATED) | 846 | 500 | 0 | [
""
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | ||||
316_B2. EKG | "In the rush of modern life, people often forget how beautiful the world is. The time to enjoy those(...TRUNCATED) | {"input":["4\n1 3\n2 4\n3 4\n2 3\n","4\n4 4\n1 3\n2 4\n3 4\n"],"output":["NO\n1 3 4 2\n1 2 4 3\n","Y(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["12\n161735902 211047202 430302156 450968417 628894325 707723857 731963982 822804784 88089(...TRUNCATED) | 3 | 0 | {"language":[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,2,1,2,2,2,2,2,2,2,4,2,2,2(...TRUNCATED) | {"language":[2,2,2,2,2,3,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 1,513 | C | 2,750 | 0 | [
"math"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
954_F. Runner's Problem | "In Byteland, there are two political parties fighting for seats in the Parliament in the upcoming e(...TRUNCATED) | {
"input": [
"10 3 2\n",
"13 12 1\n",
"4 1 1\n"
],
"output": [
"5\n",
"1\n",
"3\n"
]
} | {"input":["4\n39 20\n183 11\n551 27\n85 16","8\n4 65\n5 12\n7 24\n9 38\n12 24\n14 10\n65 75\n31 26"](...TRUNCATED) | {"input":["3 1\n2 100 1","12 5\n43 94 27 3 69 99 56 25 15 15 46 8","3 1000\n1 101 1","6 24\n25 171 7(...TRUNCATED) | 5 | 7 | {"language":[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,4,2,2,2,2,2,2,2,2,2,2,2,4,2,4(...TRUNCATED) | {"language":[2,2,4,2,3,4,4,3,4,1,3,3,2,3,2,2,1,3,3,3,2,3,4,3,4,2,2,3,4,3,2,4,4,3,4,4,4,3,4,2,3,4,3,2(...TRUNCATED) | 1,374 | B | 0 | 2,700 | [
""
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
1180_E. Serge and Dining Room | "We know that lucky digits are digits 4 and 7, however Vasya's got another favorite digit 0 and he a(...TRUNCATED) | {"input":["6\n3\n60\n100\n1024\n23456\n8735373\n\nSAMPLE"],"output":["0\n14\n24\n253\n5861\n2183837\(...TRUNCATED) | {
"input": [
"aaaa a",
"abcd cb",
"a abab"
],
"output": [
"4\n",
"0\n",
"0\n"
]
} | {"input":["5\n\n3 2 2\n2 0\n0 5\n\n4 3 2\n2 1 5\n0 6\n\n0 2 2\n1 0\n2 3\n\n5 4 4\n6 0 8 0\n0 7 0 9\n(...TRUNCATED) | 2 | 0 | {"language":[2,3,2,3,3,2,2,1,3,2,3,4,4,3,4,4,3,2,2,2,2,2,2,4,4,4,4,4,3,2,2,4,2,4,2,2,3,2,2,4,2,4,2,4(...TRUNCATED) | {"language":[2,2,3,2,4,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,3,3,2,2,2,2,2,2,2,2(...TRUNCATED) | 392 | A | 0 | 1,000 | [
""
] | false | {
"nanos": 0,
"seconds": 10
} | 256,000,000 | |||
545_C. Woodcutters | "Rakesh have learn about vowel in school and is given an assignment by his teacher in which he has t(...TRUNCATED) | {"input":["3 4 3 10\n3\n3 1 4\n4 5 9\n3 10 10\n","1 1 2 10\n2\n1 1 3\n2 6 10\n","5 7 6 11\n3\n5 3 8\(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["1 1 2000000000\n1\n3\n","28 3 2099\n768 115 416 934 926 65 802 980 551 213 335 202 784 91(...TRUNCATED) | 6 | 0 | {"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":[2,4,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2(...TRUNCATED) | 687 | 0 | 1,600 | [
"constructive algorithms",
"graphs",
"implementation"
] | false | {
"nanos": 0,
"seconds": 2
} | 268,435,456 | ||||
1424_N. BubbleSquare Tokens | "Petya and Vasya arranged a game. The game runs by the following rules. Players have a directed grap(...TRUNCATED) | {
"input": [
""
],
"output": [
""
]
} | {"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":["2 3\n1 1 0\n0 1 0","3 3\n0 1 0\n1 0 1\n0 1 -1","4 6\n1 0 1 1 0 1 \n0 0 1 1 1 1 \n1 1 1 1 (...TRUNCATED) | 1 | 0 | {"language":[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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,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) | 1,101 | C | 750 | 1,500 | [
"dp",
"greedy"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
178_A1. Educational Game | "You are playing a strange game with Li Chen. You have a tree with n nodes drawn on a piece of paper(...TRUNCATED) | {
"input": [
"3\n10 2 5\n12 4 4\n6 2 2\n\nSAMPLE"
],
"output": [
"6\n3\n5\n"
]
} | {"input":["50 50\n75 71 23 37 28 23 69 75 5 62 3 11 96 100 13 50 57 51 8 90 4 6 84 27 11 89 95 81 10(...TRUNCATED) | {"input":["2\n4 1\n2 15 36 43 \n3 2\n27 29 35 \n\nSAMPLE","2\n4 1\n4 15 36 43 \n3 2\n27 29 35 \n\nSA(...TRUNCATED) | 2 | 7 | {"language":[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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | {
"language": [],
"solution": []
} | 551 | B | 0 | 0 | [
"games",
"math"
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 |
End of preview. Expand in Data Studio
edition_0994_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
- 9