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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1189_A. Keanu Reeves | "At the big break Nastya came to the school dining room. There are n pupils in the school, numbered (...TRUNCATED) | {
"input": [
"1\n3\n1 3 2\n\nSAMPLE"
],
"output": [
"1 2 3"
]
} | {"input":["993 992 991\n","100 1 10\n","960 935 994\n","99 8 99\n","60 16 1\n","759 10 258\n","24 19(...TRUNCATED) | {"input":["20 20\n1 9\n11 9\n3 5\n15 13\n1 20\n11 18\n10 6\n10 8\n10 19\n12 16\n10 3\n9 18\n8 7\n15 (...TRUNCATED) | 2 | 9 | {"language":[2,2,2,2,2,4,2,2,2,2,1,4,4,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,2,2,2(...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) | 0 | C | 0 | 1,900 | [
"dp",
"greedy"
] | false | {
"nanos": 0,
"seconds": 2
} | 0 | |||
p03150 KEYENCE Programming Contest 2019 - KEYENCE String | "To improve the boomerang throwing skills of the animals, Zookeeper has set up an n × n grid with s(...TRUNCATED) | {
"input": [
"4\naaa\nabc\nabdbca\nabba"
],
"output": [
"YES\nNO\nYES\nYES\n"
]
} | {"input":["z\na\n","abc\naaac\n","bcbcdddbbd\nbcbcdbdbbd\n","aaabccadac\nacabbbabaa\n","a\nb\n","aca(...TRUNCATED) | {"input":["4\n47\n47\n477\n4747477","4\n7\n47\n477\n4747477","4\n4\n47\n477\n4747477","4\n7\n7\n477\(...TRUNCATED) | 3 | 0 | {"language":[1],"solution":["T = int(raw_input())\nfor ti in xrange(T):\n\ta,b,c = map(int,raw_input(...TRUNCATED) | {"language":[3,4,2,4,4,2,1,4,2,4,2,2,2,4,2,4,4,1,2,4,2,2,4,1,4,2,4,4,2,4,4,4,2,4,4,2,2,4,2,3,2,4,4,2(...TRUNCATED) | 920 | 0 | 0 | [
"dp",
"flows",
"graph matchings",
"greedy"
] | false | {
"nanos": 0,
"seconds": 2
} | 1,073,741,824 | ||||
p02971 AtCoder Beginner Contest 134 - Exception Handling | "There are N slimes standing on a number line. The i-th slime from the left is at position x_i.\n\nI(...TRUNCATED) | {"input":["3 4 2\n#..#\n..#.\n#...\n","5 4 5\n#...\n#.#.\n.#..\n...#\n.#.#\n"],"output":["#..#\n..#X(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["3\ncan you meet me ouuside ccd today\na\nthis year hard kaur is coming to entertain us","(...TRUNCATED) | 6 | 7 | {"language":[4,2,2,2,2,2,2,2,2,4,4,2,2,4,4,2,2,2,4,2,2,4,2,4,2,2,2,2,3,2,2,2,2,2,2,2,2,4,2,2,4,4,2,2(...TRUNCATED) | {"language":[3,2,3,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) | 203 | A | 500 | 0 | [
"*special",
"binary search",
"constructive algorithms",
"interactive"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
stadium | "In this problem, we only consider strings consisting of lowercase English letters.\n\nStrings s and(...TRUNCATED) | {
"input": [
"3 6\n2 3 5\n",
"6 7\n1 2 3 4 5 6\n"
],
"output": [
"2\n",
"7\n"
]
} | {"input":["6 4 3\n0 1 2\n1 3 0\n0 4 5\n1 4 4\n1 2 2\n0 4 2\n","50 69 6\n62 91 5\n35 35 53\n85 26 1\n(...TRUNCATED) | {"input":["aa\n2\nbb\nbc\n","th\n1\nht\n","bb\n1\nab\n","bn\n100\ndf\nyb\nze\nml\nyr\nof\nnw\nfm\ndw(...TRUNCATED) | 6 | 10 | {"language":[4,2,2,2,2,2,4,4,2,2,4,4,2,4,2,2,2,2,2,2,2,4,4,2,4,2,4,4,2,2,2,4,4,2,2,2,4,2,4,2,2,2,2,4(...TRUNCATED) | {"language":[2,2,2,3,4,2,2,4,2,2,3,2,3,2,2,2,4,2,2,2,2,2,3,3,2,3,3,2,4,2,2,2,2,2,3,2,2,2,2,1,3,2,2,2(...TRUNCATED) | 0 | I | 1,500 | 2,000 | [
""
] | false | {
"nanos": 0,
"seconds": 2
} | 512,000,000 | |||
p02405 Print a Chessboard | "An elementary school student Takahashi has come to a variety store.\n\nHe has two coins, A-yen and (...TRUNCATED) | {
"input": [
"5 5 10 5 4\n",
"12 4 12 4 1\n",
"15 1 100 0 0\n"
],
"output": [
"1\n",
"3\n",
"15\n"
]
} | {
"input": [],
"output": []
} | {"input":["1\n7\n.......\n.*.....\n.......\n.......\n.......\n.......\n.......\n\nSAMQLE","1\n5\n...(...TRUNCATED) | 2 | 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,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | {"language":[2,2,2,2,4,2,4,2,4,2,2,2,2,4,2,4,2,4,2,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2(...TRUNCATED) | 101 | G | 0 | 2,000 | [
""
] | false | null | 256,000,000 | |||
p02943 AtCoder Grand Contest 037 - Reversing and Concatenating | "Bosky is a very curious child who turned 13 yesterday. His parents gifted him a digital watch which(...TRUNCATED) | {"input":["3\n10 20 10\n6\n1 1\n2 1\n2 2\n3 1\n3 2\n3 3\n","7\n1 2 1 3 1 2 1\n9\n2 1\n2 2\n3 1\n3 2\(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["30 2\n-999999924 -499999902 500000091 -697652453 500000030 -999999934 500000086 -49999991(...TRUNCATED) | 3 | 0 | {"language":[2,4,3,4,4,2,2,2,4,2,2,2,4,4,4,3,2,2,2,2,4,3,4,4,2,2,4,4,4,3,3,1,2,2,3,3,2,4,2,4,4,3,2,1(...TRUNCATED) | {"language":[2,2,4,3,2,3,3,0,3,2,2,0,3,4,1,3,2,2,0,0,2,2,3,3,3,3,0,3,4,2,0,3,0,2,0,2,2,2,3,3,4,3,2,2(...TRUNCATED) | 0 | C | 0 | 0 | [
"ternary search"
] | true | null | 512,000,000 | |||
25_D. Roads not only in Berland | "Imagine a game played on a line. Initially, the player is located at position 0 with N candies in h(...TRUNCATED) | {
"input": [
"5\n1 2\n1 3\n3 4\n2 5"
],
"output": [
"1"
]
} | {
"input": [],
"output": []
} | {"input":["4\nRBRR","4\nBBRR","4\nRRCR","4\nRRAR","4\nRARR","4\nBQBR","4\nRCRR","4\nBPBR","4\nRRRC",(...TRUNCATED) | 2 | 11 | {"language":[1,1,1],"solution":["for _ in range(input()):\n try:\n eval(raw_input())\n (...TRUNCATED) | {"language":[2,2,2,4,2,4,2,2,4,2,2,2,2,4,2,4,2,2,2,4,2,2,2,4,2,2,2,4,2,4,4,2,2,3,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 0 | F | 1,500 | 0 | [
"binary search",
"math"
] | false | null | 64,000,000 | |||
p02613 AtCoder Beginner Contest 173 - Judge Status Summary | "Emily's birthday is next week and Jack has decided to buy a present for her. He knows she loves boo(...TRUNCATED) | {
"input": [
"5\n1 2 0\n1 3 0\n3 5 0\n3 4 0\n5\n3\n4\n1\n3\n4\n"
],
"output": [
"3\n2\n3\n3\n2\n"
]
} | {"input":["188\n762\n","352\n445\n","596\n777\n","1000\n999\n","1000\n2\n","773\n70\n","1\n1000\n","(...TRUNCATED) | {"input":["1 3 0\n6 1 4\n","21 6 635\n3 4 2 1 7 7\n","3 7 20012\n1 1 1 1 1 2 10000\n","1 5 44\n2 19 (...TRUNCATED) | 6 | 8 | {"language":[4,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,1,2,2,2,2,2,2,4,2,4,2,2,2,4,2,2,2,2,2,2,2,2,4,4,2,1,2,2(...TRUNCATED) | {"language":[4,0,0,0,2,0,0,4,2,2,0,0,2,2,0,4,4,2,0,0,2,2,2,4,2,2,0,0,2,4,2,2,4,2,0,4,4,0,0,0,0,0,0,2(...TRUNCATED) | 1,451 | C | 0 | 1,300 | [
"bitmasks",
"dp",
"graphs",
"number theory"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
309_B. Context Advertising | "Greg has a pad. The pad's screen is an n × m rectangle, each cell can be either black or white. We(...TRUNCATED) | {"input":["8\n1 2 100\n1 3 20\n2 4 2\n2 5 1\n3 6 1\n3 7 2\n6 8 5\n6\n1 8\n2 3\n5 8\n2 6\n4 7\n6 1\n"(...TRUNCATED) | {
"input": [],
"output": []
} | {
"input": [],
"output": []
} | 2 | 0 | {"language":[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,2,2,2,2,2,2,2,4,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) | 331 | B | 0 | 2,200 | [] | false | {
"nanos": 0,
"seconds": 3
} | 256,000,000 | |||
348_A. Mafia | "There is little time left before the release of the first national operating system BerlOS. Some of(...TRUNCATED) | {"input":["5\n0.50 0.29 0.49 0.95 0.83\n2 3\n0 3\n3 4\n2 1\n3\n4 0.66\n1 0.69\n0 0.36\n"],"output":[(...TRUNCATED) | {
"input": [],
"output": []
} | {"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 | 0 | {"language":[4,2,2,2,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,4,4,2,2,2,2,4,4,2,2,2,2,4,2,2,2,2,2,2,4,2,2,2,4,1(...TRUNCATED) | {"language":[2,4,2,2,3,3,4,3,3,4,1,3,2,3,2,4,2,3,4,2,3,3,2,2,2,4,3,2,3,4,2,2,4,4,3,2,4,2,3,2,4,3,4,3(...TRUNCATED) | 0 | 0 | 0 | [
"implementation"
] | false | {
"nanos": 0,
"seconds": 2
} | 268,435,456 |
End of preview. Expand
in Data Studio
edition_3124_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
- 14