name large_stringlengths 4 70 | description large_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 large_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 large_stringclasses 36
values | time_limit dict | memory_limit_bytes int64 0 1.07B | input_file large_stringclasses 1
value | output_file large_stringclasses 1
value |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
p03080 ExaWizards 2019 - Red or Blue | "New Year is coming, and Jaehyun decided to read many books during 2015, unlike this year. He has n (...TRUNCATED) | {"input":["3 1 4\n","2 2 10\n","5 5 16808\n","1 4 10\n"],"output":["Stas\n\n","Masha\n\n","Masha\n\n(...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":["4\nlu ru ld rd\n4\nlu ld lu ru\n0\nlu\n10\nru lu ld rd ru rd ru lu rd ld\n0","4\nlu ru ld(...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,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | {"language":[2,4,4,3,4,2,3,4,1,2,4,2,4,4,4,4,2,3,4,3,3,2,3,4,3,3,3,2,4,2,2,4,4,2,4,4,2,3,2,2,4,2,2,3(...TRUNCATED) | 1,397 | 0 | 2,100 | [
"data structures",
"math"
] | false | {
"nanos": 0,
"seconds": 2
} | 0 | ||||
p01694 Step Aerobics | "You want to perform the combo on your opponent in one popular fighting game. The combo is the strin(...TRUNCATED) | {
"input": [
"5 4\n3 1 8 9 7\n",
"3 2\n2 3 4\n"
],
"output": [
"5\n",
"3\n"
]
} | {"input":["1 0\n","2 1\n1 2 0\n","5 4\n1 2 3 3 1 2\n5 4 0\n4 3 0\n3 1 2 5 4\n","3 3\n1 2 2 3 2\n1 3 (...TRUNCATED) | {"input":["4\n3 3\n1 2\n2 3\n3 1\n3 6\n1 2\n2 1\n2 3\n3 2\n1 3\n3 1\n7 10\n1 2\n2 3\n3 1\n1 4\n4 5\n(...TRUNCATED) | 2 | 11 | {"language":[3,4,3,4,3,2,2,3,3,3,4,3,3,2,3,2,1,2,3,3,2,3,3,2,4,4,4,2,3,3,3,3,3,4,3,3,2,3,3,3,2,3,3,4(...TRUNCATED) | {"language":[2,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,4,2,2,4,2,2,2,2,2,2,1,2,2,4,2,2,2,2,2,2,2,4,2,4(...TRUNCATED) | 0 | A | 2,000 | 0 | [] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | |||
p02157 Shuffle 2 | "On Children's Day, the child got a toy from Delayyy as a present. However, the child is so naughty (...TRUNCATED) | {
"input": [
"3\n2 3 4\n2 1\n1\n-1\n"
],
"output": [
"56\n"
]
} | {
"input": [],
"output": []
} | {"input":["5 6\n#.##\n.##.\n#...\n..##\n...#","13 27\n......#.........#.......#..\n...#.....###..\n.(...TRUNCATED) | 5 | 13 | {"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":[1,4,2,4,3,2,1,1,1,4,3,4,2,4,2,4,2,3,4,1,4,1,2,2,1,4,4,4,1,2,4,1,2,2,4,1,3,2,2,4,1,3,4,2(...TRUNCATED) | 1,257 | E | 0 | 0 | [] | false | {
"nanos": 0,
"seconds": 2
} | 0 | |||
963_B. Destruction of a Tree | "Takahashi is participating in a programming contest called AXC002, and he has just submitted his co(...TRUNCATED) | {"input":["4\n2 1 2 3 4 3 2 6 1 1 2 2 1 2 3 2\n","1\n42\n","2\n1 1 1 1\n"],"output":["6 4 3 2 ","42 (...TRUNCATED) | {"input":["4\n14723\n5512\n100\n28436\n33903\n100\n84816\n75747\n100\n92281\n31380\n100","1\n45819\n(...TRUNCATED) | {"input":["3\n6 5 15","3\n4 4 2","3\n4 3 1","3\n4 4 5","3\n4 8 2","3\n8 8 2","3\n4 4 1","3\n4 4 4","(...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,2,2(...TRUNCATED) | {"language":[3,2,2,2,2,2,2,2,0,2,2,2,2,2,0,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,2(...TRUNCATED) | 1,081 | C | 0 | 2,200 | [
""
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
chsparr | "A certain business maintains a list of all its customers' names. The list is arranged in order of i(...TRUNCATED) | {"input":["3 2\n1 3\n1 1\n0\n2\n","2 2\n1 2\n1 1\n1\n","5 6\n2 2 3\n2 4 5\n1 4\n1 5\n0\n1\n"],"outpu(...TRUNCATED) | {"input":["2 1\n1 1\n","4 1\n2 2 1 1\n","10 1\n2 6 3 4 2 4 4 3 2 1\n","2 1\n999152 999153\n","8 1000(...TRUNCATED) | {"input":["15 6\n1 6 6 5 2 10 4 4 14 8 7 3 5 1 2\n","65 7\n1 5 4 1 4 11 9 1 11 7 6 11 9 4 2 6 10 11 (...TRUNCATED) | 3 | 8 | {"language":[2,2,2,2,2,2,2,2,2,2,4,2,4,4,4,2,2,2,2,2,4,2,4,2,2,2,2,2,2,2,2,4,4,4,4,2,2,4,2,4,2,2,2,4(...TRUNCATED) | {
"language": [],
"solution": []
} | 724 | C1 | 0 | 2,200 | [
"math",
"number theory",
"sortings"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
235_A. LCM Challenge | "For skilled programmers, it is very easy to implement a sorting function. Moreover, they often avoi(...TRUNCATED) | {
"input": [
"1\n5 3\n200 6 9"
],
"output": [
"120"
]
} | {
"input": [],
"output": []
} | {"input":["1 36 0\n-1 -1 -1","0 30 0\n-1 -1 -1","0 32 0\n-1 -1 -1","1 16 0\n-1 -1 -1","0 36 0\n-1 -1(...TRUNCATED) | 2 | 7 | {"language":[2,4,2,4,2,2,2,2,2,2,2,2,4,4,2,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,2,2,2(...TRUNCATED) | {"language":[2,2,2,2,2,3,2,2,3,2,2,2,2,4,3,3,2,4,2,2,2,2,4,2,3,4,2,2,2,2,2,2,4,2,2,2,2,2,3,2,2,2,2,2(...TRUNCATED) | 0 | 0 | 3,500 | [] | true | {
"nanos": 0,
"seconds": 2
} | 268,435,456 | ||||
p02548 AtCoder Beginner Contest 179 - A x B + C | "You're trying to set the record on your favorite video game. The game consists of N levels, which m(...TRUNCATED) | {"input":["3 8\n10 20\n0 0\n20 40\n300 600\n30 60\n170 340\n50 100\n28 56\n90 180\n-4 -8\n-1 -2\n","(...TRUNCATED) | {"input":["3 14\n8 9\n10 7\n","12 11\n11 12\n16 7\n","12 17\n10 19\n13 16\n","9 12\n3 17\n10 10\n","(...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 | 2 | {"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,2,4,2,2,2,2,2,2,2,4,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(...TRUNCATED) | 7 | A | 2,500 | 0 | [] | false | {
"nanos": 0,
"seconds": 8
} | 256,000,000 | |||
656_E. Out of Controls | "Everything got unclear to us in a far away constellation Tau Ceti. Specifically, the Taucetians cho(...TRUNCATED) | {
"input": [
"3 2\n3\n1 2 1\n2 3 2\n3 3 1"
],
"output": [
"1"
]
} | {"input":["1000\nspnogbxcrp\nbaukbqnmyu\nogxdxhtcwz\nbsjufplykz\nkhicdrdixl\nzookiqggel\nfczygjfhfa\(...TRUNCATED) | {"input":["1\n4 5\n9 7 5 3\n8 6 4 1 0\n\nSAMPLE","1\n4 5\n9 7 5 3\n16 6 4 2 0\n\nSAMPLE","1\n4 5\n9 (...TRUNCATED) | 6 | 0 | {"language":[2,2,2,2,4,2,2,4,4,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,4,2,2,2,4,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) | 958 | E | 0 | 1,000 | [
"bitmasks",
"dp"
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | |||
167_C. Wizards and Numbers | "You are given an integer sequence A of length N and an integer K. You will perform the following op(...TRUNCATED) | {"input":["15 22\n8 13 33418\n14 15 55849\n7 10 15207\n4 6 64328\n6 9 86902\n15 7 46978\n8 14 53526\(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["3 10 10\n1\n1 1 1\n1\n3 3 3\n1\n5 5 5\n0 1 1\n1 0 0\n0 1 0","1 10 3\n3\n1 10 1\n2 20 2\n3(...TRUNCATED) | 2 | 10 | {"language":[2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2,2,4,2,4(...TRUNCATED) | {"language":[2,2,2,2,4,2,4,2,4,2,2,2,4,2,2,2,3,2,2,2,2,2,0,2,2,2,4,2,2,4,2,0,2,2,2,2,1,0,2,2,1,2,2,2(...TRUNCATED) | 361 | E | 500 | 2,100 | [
"binary search",
"brute force",
"math"
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | |||
1311_C. Perform the Combo | "Panda has a thing for palindromes. Hence he was a given a problem by his master. The master will g(...TRUNCATED) | {
"input": [
"3\ncode\ncoder\ncoding\n2\n1 3 code\n1 3 co\n\nSAMPLE"
],
"output": [
"2 \n3"
]
} | {"input":["3\n1 2 6\n","10\n7 7 7 7 7 7 7 7 7 7\n","76\n13 13 5 6 20 20 6 1 18 18 13 15 20 3 9 11 3 (...TRUNCATED) | {"input":["10000 01000 00100 11000 01100 11111 01110 11100 10110 11110\n10101 01000 00000 11001 0110(...TRUNCATED) | 2 | 8 | {"language":[1,1,1,1],"solution":["'''\n# Read input from stdin and provide input before running cod(...TRUNCATED) | {
"language": [],
"solution": []
} | 5 | 0 | 0 | [
""
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 |
End of preview. Expand in Data Studio
edition_2873_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
- 15