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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1101_A. Minimum Integer | "You are given a string s consisting of n characters. These characters are among the first k lowerca(...TRUNCATED) | {
"input": [
"3 3\n2 4 1 2 1\nXAX\nB.B\nXAX"
],
"output": [
"0.0000000000000"
]
} | {"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":["2\n3 6\n10 11","2\n1 3\n10 11","2\n0 6\n10 11","2\n0 6\n0 11","2\n3 6\n8 22","2\n3 6\n8 4(...TRUNCATED) | 2 | 11 | {"language":[2,2,2,2,2,2,2,2,2,3,2,2,2,2,4,2,2,2,2,2,2,4,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3(...TRUNCATED) | {"language":[4,2,2,2,2,2,2,4,2,3,2,2,4,2,2,2,2,4,4,2,2,2,2,2,2,2,2,4,2,2,4,3,3,2,2,2,2,4,3,4,2,2,2,4(...TRUNCATED) | 746 | D | 0 | 2,500 | [
"data structures",
"implementation",
"math"
] | false | null | 512,000,000 | |||
golu-and-coins-1 | "Sherlock Holmes has decided to start a new academy to some of the young lads. He has conducted seve(...TRUNCATED) | {"input":["1\n0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0\n7\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n1 0 0 0 0 0 1 0 0(...TRUNCATED) | {"input":["50 100\n1 71 96\n2 34 52\n2 16 95\n1 54 55\n1 65 85\n1 76 92\n2 19 91\n1 26 43\n2 83 95\n(...TRUNCATED) | {"input":["51\n1732111733638718702525811518175029394157760329139501\n","55\n815096522892298714932212(...TRUNCATED) | 2 | 10 | {"language":[2,2,3,2,2,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,2,2,4(...TRUNCATED) | {"language":[2,2,2,2,4,2,2,2,2,2,2,1,4,3,2,2,2,2,2,1,2,3,2,2,2,4,4,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 0 | C | 2,500 | 0 | [
""
] | false | {
"nanos": 0,
"seconds": 2
} | 268,435,456 | |||
962_F. Simple Cycles Edges | "Piet is one of the most known visual esoteric programming languages. The programs in Piet are const(...TRUNCATED) | {
"input": [
"5 10\n2 1 2 1 2\n2\n2 4\n4 5\n"
],
"output": [
"3\n3\n"
]
} | {"input":["1000\n999001\n999002\n999003\n999004\n999005\n999006\n999007\n999008\n999009\n999010\n999(...TRUNCATED) | {"input":["1\n47 1 47\n40 45 19 10 44 33 47 12 2 46 16 23 3 14 21 28 31 42 22 18 35 38 24 25 36 32 4(...TRUNCATED) | 2 | 0 | {"language":[2,4,2,4,1,2,2,2,2,2,3,3,2,2,3,2,4,3,2,4,2,4,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,2,2,2,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 | 1,400 | [
"flows",
"shortest paths"
] | true | {
"nanos": 0,
"seconds": 2
} | 1,073,741,824 | ||||
p03616 AtCoder Regular Contest 082 - Sandglass | "You are given a square board, consisting of n rows and n columns. Each tile in it should be colored(...TRUNCATED) | {
"input": [
"1\n4 2\n6 1 2 0\n\nSAMPLE"
],
"output": [
"3\n"
]
} | {
"input": [],
"output": []
} | {"input":["2\n4 INDIAN\nCONTEST_WON 1\nTOP_CONTRIBUTOR\nBUG_FOUND 100\nCONTEST_HOSTED\n1 NON_INDIAN\(...TRUNCATED) | 6 | 7 | {"language":[2,4,2,2,2,2,2,4,4,2,2,4,2,2,2,3,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,4,2,2,2,2,2(...TRUNCATED) | {"language":[3,4,3,4,4,2,4,4,3,4,4,3,2,3,4,2,2,2,2,3,4,2,4,4,1,2,4,2,2,4,4,2,3,2,3,1,2,2,4,4,3,3,3,4(...TRUNCATED) | 586 | D | 1,500 | 1,300 | [
""
] | false | {
"nanos": 0,
"seconds": 2
} | 0 | |||
730_J. Bottles | "You are given a permutation p_1,p_2,...,p_N consisting of 1,2,..,N. You can perform the following o(...TRUNCATED) | {"input":["3\n-1 -1\n1 0\n2 0\n2\n1 1 3\n2 1 3\n","3\n-1 -1\n1 0\n1 1\n2\n2 2 3\n2 3 2\n"],"output":(...TRUNCATED) | {
"input": [
"1 1\n1\n1\n1\n"
],
"output": [
"0\n"
]
} | {"input":["1\n297754\n","16\n2 2 2 3 5 3 5 5 5 7 7 7 11 11 13 17\n","16\n2 2 2 2 2 3 3 5 5 5 5 7 7 1(...TRUNCATED) | 2 | 0 | {"language":[1],"solution":["p=10**9+7;\n\ndef modpow(x,n):\n\tif(n==0):\n\t\treturn 1;\n\telif(n%2=(...TRUNCATED) | {"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 1,250 | 0 | 2,100 | [
"brute force",
"sortings"
] | false | null | 256,000,000 | ||||
p03570 CODE FESTIVAL 2017 qual C - Yet Another Palindrome Partitioning | "Polycarp has recently created a new level in this cool new game Berlio Maker 85 and uploaded it onl(...TRUNCATED) | {
"input": [
"123+456\n",
"192/5\n",
"945%19\n"
],
"output": [
"579\n",
"38\n",
"14\n"
]
} | {"input":["+-+--+-+\n","+-+--+\n","+-+++-\n","+++-\n","-++-+--++--+-++-\n","-+++--\n","-+--+-\n","+-(...TRUNCATED) | {"input":["5 2 1\n0.1 0.2 0.3 0.5915213038191143 0.5\n6 2 2\n0.1 0.2 0.3 0.4 0.5 0.6\n0 0 0","5 2 1\(...TRUNCATED) | 2 | 10 | {"language":[2,4,2,3,1,4,1,2,4,3,4,1,3,3,3,3,4,1,2,3,4,2,2,3,3,4,3,3,3,1,1,2,4,2,1,1,3,3,3,1,2,4,1,1(...TRUNCATED) | {
"language": [],
"solution": []
} | 0 | B | 0 | 0 | [
"brute force",
"implementation"
] | false | {
"nanos": 500000000,
"seconds": 1
} | 268,435,456 | |||
248_A. Cupboards | "Step up and down\n\nKazuki, commonly known as Kerr, who attends JAG University, was invited by your(...TRUNCATED) | {"input":["2\n4 INDIAN\nCONTEST_WON 1\nTOP_CONTRIBUTOR\nBUG_FOUND 100\nCONTEST_HOSTED\n4 NON_INDIAN\(...TRUNCATED) | {"input":["1 1 1 2\n5\n1000000000 1 10000\n19920401 1188 5566\n1000000000 1 10000\n1 1 10000\n5 100 (...TRUNCATED) | {"input":["2\n3 3 2\n8 3 2\n3 0\n3 7\n8 0\n5 7","2\n3 3 2\n8 3 2\n1 3\n3 7\n8 0\n8 7","1\n10 10 17\n(...TRUNCATED) | 2 | 10 | {"language":[2,2,2,2,2,2,4,4,4,2,4,2,1,4,2,2,2,2,2,2,2,2,2,4,2,2,4,2,2,2,2,2,4,2,4,2,4,2,2,2,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,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 331 | C | 1,750 | 1,500 | [
"math"
] | true | {
"nanos": 0,
"seconds": 2
} | 0 | |||
536_C. Tavas and Pashmaks | "There are n cows playing poker at a table. For the current betting phase, each player's status is e(...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":["5\ncbbbb\nbcbbb\naacbb\naaacb\naaaac\n","20\nbifcabiabgfibfccdbgd\ncffaheagahcbacafbgeb\n(...TRUNCATED) | {
"input": [],
"output": []
} | 2 | 14 | {"language":[3,2,4,3,3,3,3,3,3,2,4,3,4,4,3,2,3,2,2,3,4,2,3,2,4,4,4,3,2,3,2,4,3,2,3,4,4,3,2,2,4,2,2,4(...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) | 0 | B | 0 | 3,500 | [
"implementation"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
954_F. Runner's Problem | "Levko loves array a1, a2, ... , an, consisting of integers, very much. That is why Levko is playing(...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":["100 1 7\n83\n174\n191\n145\n167\n55\n232\n157\n51\n209\n85\n73\n216\n39\n72\n76\n132\n70\(...TRUNCATED) | {"input":["5\n2 3 0 6 8","5\n2 3 4 6 5","5\n2 3 4 6 7","5\n2 3 0 6 7","5\n2 -1 8 6 4","5\n6 0 8 5 2"(...TRUNCATED) | 2 | 6 | {"language":[2,2,1,2,2,4,3,2,4,4,2,4,2,3,2,4,2,2,4,2,4,3,2,2,2,2,4,4,4,2,2,2,2,2,2,4,2,2,2,2,4,4,2,4(...TRUNCATED) | {"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) | 1,291 | C | 1,500 | 0 | [
"ternary search"
] | false | {
"nanos": 0,
"seconds": 2
} | 0 | |||
p03153 KEYENCE Programming Contest 2019 - Connecting Cities | "In the previous problem Chandu bought some unsorted arrays and sorted them (in non-increasing order(...TRUNCATED) | {
"input": [
"7\nabacaba\n",
"6\naabcfg\n"
],
"output": [
"YES\n2 3\n",
"NO\n"
]
} | {"input":["10\n100000000 200000000 300000000 20 500000000 600000000 700000000 800000000 900000000 10(...TRUNCATED) | {"input":["4\n1 1 1 1 1 1 1 1 1 1 1 1 3 3 6 3\n","1\n53\n","1\n77\n","1\n20\n","1\n10\n","1\n11\n","(...TRUNCATED) | 2 | 7 | {"language":[2,2,4,2,4,3,4,4,2,2,3,1,4,3,3,2,3,3,2,4,2,4,2,2,2,3,3,3,3,3,3,2,4,3,2,2,3,2,2,4,3,4,4,4(...TRUNCATED) | {
"language": [],
"solution": []
} | 1,075 | C | 0 | 0 | [
""
] | false | {
"nanos": 0,
"seconds": 2
} | 512,000,000 |
End of preview. Expand in Data Studio
edition_3029_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
- 77