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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
168_A. Wizards and Demonstration | "After playing Neo in the legendary \"Matrix\" trilogy, Keanu Reeves started doubting himself: maybe(...TRUNCATED) | {
"input": [
"4 4\nDRLD\nU.UL\n.UUR\nRDDL\n",
"3 5\n.D...\nRRRLL\n.U...\n"
],
"output": [
"10 1\n",
"6 2\n"
]
} | {
"input": [],
"output": []
} | {"input":["9\n53 138 94 41 58 49 88 24 42\n85 11 32 64 40 56 63 95 73\n17 85 60 41 13 71 54 67 87\n3(...TRUNCATED) | 1 | 0 | {"language":[4,2,2,2,2,3,4,2,4,3,2,4,1,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,3,4,2,2,2,2,2,2,2,2,2,2,4,2,4(...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) | 530 | 0 | 0 | [
""
] | false | {
"nanos": 0,
"seconds": 3
} | 512,000,000 | ||||
560_D. Equivalent Strings | "Julia is conducting an experiment in her lab. She placed several luminescent bacterial colonies in (...TRUNCATED) | {
"input": [
"1\n\n7\n\n1\n\n1\n\n0\n\n0\n\n1\n"
],
"output": [
"? 3\n? 6\n? 5\n? 7\n= 3\n"
]
} | {
"input": [],
"output": []
} | {"input":["3\nooe\n","36\naaiouyaaeeiioouuyyaaeeeeiiiooouuuyyy\n","3\npoo\n","1\nb\n","4\nooee\n","5(...TRUNCATED) | 2 | 10 | {"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],"solution":["t = int(raw_input())\nf(...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,3,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 730 | 0 | 1,500 | [
"dp",
"implementation"
] | true | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | ||||
colarr | "A smile house is created to raise the mood. It has n rooms. Some of the rooms are connected by door(...TRUNCATED) | {"input":["2\n2 2\n3 3\n","2\n2 2\n4 1\n"],"output":[" (...TRUNCATED) | {"input":["3\n5 2\n5 3\n7 0\n5 0\n4 0\n10 0\n2 1\n10 100\n50 10\n5 5\n1 5\n2 4\n3 3\n4 2\n5 1\n"],"o(...TRUNCATED) | {"input":["34 20 1\n17 13\n","1 0 0\n","10000 9999 1\n8594 9264\n","98 100 25\n96 100\n97 100\n97 99(...TRUNCATED) | 2 | 0 | {"language":[2,1,3,4,1,4,1,4,2,3,4,2,4,1,2,3,2,2,4,3,2,4,2,2,2,4,4,3,2,4,4,4,4,1,1,3,2,2,2,4,1,4,1,2(...TRUNCATED) | {"language":[2,4,2,2,2,2,2,2,2,2,3,0,2,3,2,2,0,2,2,3,0,2,2,2,2,3,3,2,3,4,3,3,2,3,2,0,2,2,2,0,3,4,0,2(...TRUNCATED) | 0 | A | 500 | 1,600 | [
"binary search",
"constructive algorithms",
"graphs",
"shortest paths"
] | false | null | 256,000,000 | |||
9_E. Interesting Graph and Apples | "You are given a huge decimal number consisting of n digits. It is guaranteed that this number has n(...TRUNCATED) | {"input":["5 2\n3 1 5 4 2\n5 2\n5 4\n","3 3\n3 1 2\n1 2\n3 1\n3 2\n","2 1\n1 2\n1 2\n"],"output":["1(...TRUNCATED) | {"input":["0 1073741823\n","10 5\n","16384 36739846\n","727373493 346368330\n","62914844 1044381411\(...TRUNCATED) | {"input":["36 102 73 101 19\n5 9 2 4 6\n4 13\n","0 0 119 0 1\n0 0 2 0 0\n5 5\n","0 0 0 0 0\n10 10 10(...TRUNCATED) | 2 | 9 | {"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,3,2(...TRUNCATED) | {"language":[2,0,2,0,3,2,0,2,2,2,2,2,0,3,2,2,2,3,2,2,4,2,2,2,2,2,2,2,0,3,4,2,2,2,2,2,2,2,2,0,2,0,0,2(...TRUNCATED) | 0 | A1 | 0 | 2,400 | [
"binary search",
"data structures",
"math"
] | false | {
"nanos": 0,
"seconds": 2
} | 536,870,912 | |||
1291_E. Prefix Enlightenment | "There is little time left before the release of the first national operating system BerlOS. Some of(...TRUNCATED) | {
"input": [
"3 1 2 3\n",
"1 3 2 3\n"
],
"output": [
"5\n",
"4\n"
]
} | {
"input": [],
"output": []
} | {"input":["1 1\n5\n2 1 7\n","10 6\n10 10 10 6 6 5 5 5 3 1\n2 3 50\n2 4 10\n1 3 10\n2 2 36\n1 4 7\n2 (...TRUNCATED) | 5 | 6 | {"language":[2,3,2,2,2,2,2,4,2,2,2,2,4,2,2,2,2,2,2,3,2,4,2,4,2,3,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,1,2(...TRUNCATED) | {"language":[4,2,3,3,4,4,2,3,3,2,2,4,4,3,3,2,3,4,2,4,2,3,3,1,2,2,2,3,3,4,2,4,3,4,2,2,2,4,2,4,1,3,4,4(...TRUNCATED) | 260 | C2 | 500 | 2,500 | [
"dp",
"math",
"number theory"
] | false | {
"nanos": 0,
"seconds": 3
} | 536,870,912 | |||
87_B. Vasya and Types | "G: Destiny Draw-\n\nproblem\n\nMr. D will play a card game. This card game uses a pile of N cards. (...TRUNCATED) | {"input":["5 6 5\n5 4 86\n5 1 0\n1 3 38\n2 1 33\n2 4 28\n2 3 40\n3 5\n2 6\n1 3\n2 3\n1 6\n"],"output(...TRUNCATED) | {"input":["1 0\n23333\n","3 3\n1 1 1\n1 2\n2 3\n3 1\n","5 4\n1 2 2 2 2\n1 2\n1 3\n1 4\n1 5\n","10 30(...TRUNCATED) | {"input":["50\n16 4\n17 9\n31 19\n3 10\n8 1\n40 30\n3 31\n20 29\n47 27\n22 25\n32 34\n12 15\n40 32\n(...TRUNCATED) | 2 | 10 | {"language":[2,2,2,2,2,2,2,2,4,4,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,4,3,2(...TRUNCATED) | {
"language": [],
"solution": []
} | 167 | B | 0 | 1,600 | [
"combinatorics",
"dp",
"trees"
] | false | {
"nanos": 0,
"seconds": 1
} | 512,000,000 | |||
p03150 KEYENCE Programming Contest 2019 - KEYENCE String | "Everybody knows that Balázs has the fanciest fence in the whole town. It's built up from N fancy s(...TRUNCATED) | {"input":["5 2 4 13\nhhwhh\n","3 1 100 10\nwhw\n","5 2 4 1000\nhhwhh\n","4 2 3 10\nwwhw\n"],"output"(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["5 6\n#.##\n.##.\n#...\n..##\n...#","13 27\n......#.........#.......#..\n...#.....###..\n.(...TRUNCATED) | 2 | 0 | {"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":[3,2,3,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,3,3,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,3(...TRUNCATED) | 1,421 | 1,000 | 1,900 | [] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | ||||
687_A. NP-Hard Problem | "Manao works on a sports TV. He's spent much time watching the football games of some country. After(...TRUNCATED) | {
"input": [
"2 5\n1 3 4\n2 2 3\n"
],
"output": [
"2\n"
]
} | {"input":["2\n-492673762 -496405053\n","13\n-958184557 -577042357 -616514099 -553646903 -719490759 -(...TRUNCATED) | {"input":["2\n11 3\n2 3 4\n6 3\n3 2 1","2\n22 3\n2 0 3\n4 3\n3 2 1","2\n22 3\n0 0 3\n4 3\n3 2 1","2\(...TRUNCATED) | 2 | 7 | {"language":[2,2,4,2,4,4,2,3,2,3,3,4,3,2,4,3,2,2,3,3,4,2,2,2,2,3,3,2,2,4,4,4,4,3,3,2,3,3,3,2,2,2,3,3(...TRUNCATED) | {
"language": [],
"solution": []
} | 0 | F | 2,000 | 0 | [
""
] | false | {
"nanos": 0,
"seconds": 10
} | 268,435,456 | |||
p01422 Beautiful Currency | "Vasya's telephone contains n photos. Photo number 1 is currently opened on the phone. It is allowed(...TRUNCATED) | {
"input": [
"3\n2 3 4\n2 1\n1\n-1\n"
],
"output": [
"56\n"
]
} | {
"input": [],
"output": []
} | {"input":["cba\naaac\n","bcbcdddbbd\ndbbdbdcbcb\n","cadaccbaaa\nacabbbabaa\n","b\nb\n","acaccaaadz\n(...TRUNCATED) | 6 | 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,4,2,2,2,2,2,2,2,2,2(...TRUNCATED) | {"language":[2,2,2,4,2,3,4,4,2,2,4,4,1,1,4,4,2,4,4,2,1,2,2,2,2,2,4,2,2,2,2,4,2,3,4,3,1,4,2,2,2,2,2,3(...TRUNCATED) | 0 | A | 2,000 | 1,300 | [] | false | {
"nanos": 0,
"seconds": 2
} | 1,073,741,824 | |||
38_C. Blinds | "There are N cities in Republic of AtCoder. The size of the i-th city is A_{i}. Takahashi would like(...TRUNCATED) | {"input":["5 6\n1 2 3 4\n4 0 0 1 0\n1 5 2 3 -5 -1\n","7 8\n4 5 1 1 5 5\n0 0 0 1 2 0 0\n2 6 3 7 -2 4 (...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["1\n5 3\n200 12 9","1\n9 3\n200 12 9","1\n7 3\n200 12 9","1\n7 3\n141 12 9","1\n9 0\n141 1(...TRUNCATED) | 6 | 7 | {"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,3,0,3,2,0,3,0,2,2,3,2,3,2,2,0,2,0,3,0,3,3,2,3,2,2,0,2,2,3,3,2,2,2,3,3,3,2,2,4,3,4,2(...TRUNCATED) | 1,202 | 0 | 2,600 | [
"brute force",
"dp",
"math",
"number theory"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 |
End of preview. Expand in Data Studio
edition_1200_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