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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
simple-prime-factorization | "You are given a square with 'n' points on each side of the square. None of these points co-incide w(...TRUNCATED) | {
"input": [
"3\n2 3 4\n2 1\n1\n-1\n"
],
"output": [
"56\n"
]
} | {
"input": [],
"output": []
} | {"input":["252662256 275638265\n","10 10\n","38 38\n","141650963 236544475\n","9 12\n","1002523 1700(...TRUNCATED) | 2 | 10 | {"language":[2,2,2,2,2,2,2,2],"solution":["#include <iostream>\n#include <iomanip>\n#include <comple(...TRUNCATED) | {"language":[2,2,2,1,1,2,2,2,2,4,2,2,2,4,2,4,4,2,3,2,2,2,2,1,4,2,2,2,4,2,4,2,2,2,2,2,2,2,2,2,2,1,2,4(...TRUNCATED) | 0 | F | 0 | 0 | [
"data structures",
"greedy",
"sortings"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
p03052 diverta 2019 Programming Contest - Edge Ordering | "Ilya is an experienced player in tic-tac-toe on the 4 × 4 field. He always starts and plays with X(...TRUNCATED) | {
"input": [
"3\nAFI\n",
"6\nAFFAAA\n"
],
"output": [
"1",
"4"
]
} | {
"input": [],
"output": []
} | {"input":["8\n0 1\n1 0\n0 1\n1 1\n0 0\n1 0\n0 1\n1 0\n","3\n0 1\n1 1\n1 0\n","8\n0 1\n1 1\n0 1\n1 1\(...TRUNCATED) | 2 | 0 | {"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":[2,2,4,2,2,2,2,2,2,1,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) | 789 | E | 0 | 0 | [] | false | {
"nanos": 0,
"seconds": 2
} | 512,000,000 | |||
donuts | "There are N integers a_1, a_2, ..., a_N not less than 1. The values of a_1, a_2, ..., a_N are not k(...TRUNCATED) | {
"input": [
"1\n4 2\n6 1 2 0\n\nSAMPLE"
],
"output": [
"3\n"
]
} | {"input":["1000\nspnogbxcrp\nbaukbqnmyu\nogxdxhtcwz\nbsjufplykz\nkhicdrdixl\nzookiqggel\nfczygjfhfa\(...TRUNCATED) | {"input":["3\nAZAMON APPLE\nAZOMAN AAAAAAAAAAALIBABA\nAPPLE BANANA\n","3\nAZAMNO ELPPA\nAZAMON AAAAA(...TRUNCATED) | 2 | 0 | {"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": [],
"solution": []
} | 1,386 | 0 | 1,800 | [
""
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | ||||
nopc10 | "Problem\n\nTomorrow is finally the day of the excursion to Maizu Elementary School. Gatcho, who att(...TRUNCATED) | {
"input": [
"30 60 3 1\n",
"20 0 15 5\n",
"10 51 5 4\n"
],
"output": [
"20 0 10\n",
"0 0 20\n",
"-1\n"
]
} | {"input":["1\n2\n3\n2\n","8\n190409007 190409007 352375776 190409007 352375776 352375776 352375776 3(...TRUNCATED) | {"input":["100 1 7\n83\n174\n191\n145\n167\n55\n232\n157\n51\n209\n85\n73\n216\n39\n72\n76\n132\n70\(...TRUNCATED) | 2 | 8 | {
"language": [],
"solution": []
} | {"language":[2,2,2,3,2,2,4,4,2,2,2,2,4,2,2,4,4,2,2,4,2,2,2,2,2,2,4,4,2,4,2,2,2,4,2,2,4,2,2,3,3,3,2,2(...TRUNCATED) | 0 | D | 2,500 | 1,500 | [
""
] | false | {
"nanos": 0,
"seconds": 2
} | 0 | |||
p00950 Infallibly Crack Perplexing Cryptarithm | "You are given an undirected graph, consisting of n vertices and m edges. The graph does not necessa(...TRUNCATED) | {
"input": [
"7\n1\n2\n3\n4\n5\n100\n2000000\n"
],
"output": [
"0\n0\n4\n4\n12\n990998587\n804665184\n"
]
} | {"input":["20 18 1 2\n-9999944 -9999861 -9999850 -9999763 -9999656 -9999517 -9999375 -9999275 -99992(...TRUNCATED) | {"input":["2 2 1\n1 1 1 1\n","5 5 20\n3 1 3 3\n1 2 2 2\n4 3 4 2\n3 2 2 2\n3 4 2 4\n4 1 4 5\n4 3 5 3\(...TRUNCATED) | 2 | 0 | {"language":[2,2,4,2,3,2,2,2,4,2,4,3,2,4,2,2,2,1,2,2,2,2,2,2,4,2,3,2,2,2,2,1,3,4,4,2,2,2,2,2,2,2,2,4(...TRUNCATED) | {"language":[2,2,2,2,2,2,2,2,2,2,2,4,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,4,0,2,3,2,3,2(...TRUNCATED) | 0 | 3,000 | 2,100 | [] | false | {
"nanos": 0,
"seconds": 3
} | 256,000,000 | ||||
277_C. Game | "To improve the boomerang throwing skills of the animals, Zookeeper has set up an n × n grid with s(...TRUNCATED) | {"input":["5\nAJMP\naB23d\nE\n86AE\nAM\n6\nJPEM\nWaEaETC302Q\nCP\nrTurnAGundam1isdefferentf"],"outpu(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["9\ndo\nhte\nbest\nand\nenjoy\ntoday\nat\nacm\nicpc\n14\noh\nyes\nby\nfar\nit\nis\nwow\nso(...TRUNCATED) | 5 | 1 | {"language":[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,2,2,2,2,2,2,2,2(...TRUNCATED) | {"language":[2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,4,4,1,1,2,4,2,1,2,4,2,2,2,4,2,4,2,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 1,129 | C | 1,000 | 2,300 | [
"*special",
"binary search"
] | false | {
"nanos": 0,
"seconds": 1
} | 0 | |||
737_A. Road to Cinema | "There are N cubes stacked vertically on a desk.\n\nYou are given a string S of length N. The color (...TRUNCATED) | {
"input": [
"3\n12 3 45\n",
"2\n123 456\n"
],
"output": [
"12330\n",
"1115598\n"
]
} | {
"input": [],
"output": []
} | {"input":["2\n5\n6 5 4 3 2\n5\n3 4 6 1 1","2\n5\n6 5 4 3 2\n5\n3 7 9 1 1","2\n5\n6 5 4 3 3\n5\n3 7 9(...TRUNCATED) | 2 | 7 | {"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,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,4,2,2(...TRUNCATED) | {"language":[3,4,3,3,2,3,3,3,3,2,3,3,4,2,2,2,2,4,3,3,2,4,2,3,4,2,4,4,2,3,2,3,4,2,4,2,2,4,3,2,3,2,2,4(...TRUNCATED) | 0 | A | 1,750 | 0 | [
""
] | false | null | 512,000,000 | |||
914_F. Substrings in a String | "Awruk is taking part in elections in his school. It is the final round. He has only one opponent (...TRUNCATED) | {"input":["3 5 4\nabacc\nccbba\nccabc\nabacc\nacbbc\nababa\nacbbc\n","6 4 4\ndaac\nbcba\nacad\ncbdc\(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["6\n5 2 4 6 1 0","6\n5 6 4 4 1 3","6\n6 2 4 6 1 0","6\n5 6 4 4 1 2","6\n6 2 4 6 0 0","6\n5(...TRUNCATED) | 1 | 12 | {"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,4,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2(...TRUNCATED) | {
"language": [],
"solution": []
} | 0 | 0 | 2,200 | [] | false | "JOI 君が住む都市にはN 個の駅があり，それぞれ1, 2, ..., N の番号が付けら(...TRUNCATED) | null | 512,000,000 | |||
378_C. Maze | "A recently found Ancient Prophesy is believed to contain the exact Apocalypse date. The prophesy is(...TRUNCATED) | {"input":["2\n3 3 2\n8 3 2\n3 0\n3 7\n8 0\n8 7","2\n3 3 2\n8 3 2\n0 3\n3 7\n8 0\n8 7","1\n10 10 10\n(...TRUNCATED) | {"input":["10\n100000000 200000000 300000000 20 500000000 600000000 700000000 800000000 900000000 10(...TRUNCATED) | {
"input": [],
"output": []
} | 5 | 0 | {"language":[4,2,4,2,4,2,2,2,2,2,2,4,2,2,2,2,2,2,4,2,1,4,4,2,2,4,3,4,4,4,3,2,2,2,2,2,2,2,2,2,2,4,2,2(...TRUNCATED) | {"language":[4,2,2,2,2,1,4,2,3,3,4,1,4,1,2,2,2,2,2,2,3,2,1,3,3,2,2,1,2,2,4,3,1,4,1,1,3,4,4,3,2,3,4,3(...TRUNCATED) | 0 | 0 | 0 | [
"binary search",
"brute force",
"dp",
"greedy",
"sortings"
] | false | {
"nanos": 500000000,
"seconds": 2
} | 0 | ||||
etmx05 | "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": [],
"output": []
} | {"input":["3\n9 5 8\n8 9 3\n9 5 2\n","50\n48 45 42\n32 45 8\n15 41 47\n32 29 38\n7 16 48\n19 9 21\n1(...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,4,4,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,4,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,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) | 7 | D | 0 | 0 | [
""
] | false | null | 1,073,741,824 |
End of preview. Expand in Data Studio
edition_2821_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
- 10