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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
990_B. Micro-World | "Innopolis University scientists continue to investigate the periodic table. There are n·m known el(...TRUNCATED) | {
"input": [
"3",
"100",
"1000000"
],
"output": [
"3",
"473",
"13969985"
]
} | {
"input": [],
"output": []
} | {"input":["3\n1000000000 1000000000 11000000\n","3\n2 2 1\n","3\n2 10 11\n","5\n1000010000 5 5 4 4\n(...TRUNCATED) | 5 | 11 | {"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,4,2,2,2,2(...TRUNCATED) | {"language":[0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,2,2],"solution":[(...TRUNCATED) | 1,361 | 0 | 1,600 | [
"bitmasks",
"brute force",
"dp",
"math"
] | false | {
"nanos": 0,
"seconds": 2
} | 512,000,000 | ||||
1170_E. Sliding Doors | "During the archaeological research in the Middle East you found the traces of three ancient religio(...TRUNCATED) | {"input":["1000 999\n10 20 30 40\n","7 11\n2 4 7 3\n"],"output":["-1","2 7 1 5 6 3 4 \n7 2 1 5 6 4 3(...TRUNCATED) | {"input":["10\n75 995991040 148627929 566366239 458028006 823890903 945174886 530827147 546010999 72(...TRUNCATED) | {"input":["5\n2 2 4 7 10","5\n1 2 22 7 0","5\n1 2 4 3 10","5\n0 2 3 7 1","5\n0 2 1 7 1","5\n1 2 4 3 (...TRUNCATED) | 5 | 8 | {"language":[3,1,1,2,2,4,2,3,4,2,3,4,1,4,1,3,3,2,1,3,3,3,3,2,4,4,2,4,2,4,4,2,4,4,3,3,3,2,4,2,2,4,4,1(...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 | 0 | 0 | [
"constructive algorithms",
"greedy",
"sortings"
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | ||||
1012_B. Chemical table | "You are given a string s consisting of n characters. These characters are among the first k lowerca(...TRUNCATED) | {"input":["2\n2 9\n","3\n3 12 6\n","7\n2 1000000000 4 6 8 4 2\n","6\n13 52 0 13 26 52\n"],"output":[(...TRUNCATED) | {"input":["1\n1 5000000\n","1\n1000000000 1\n","10\n588 12\n560 10\n593 14\n438 15\n761 11\n984 6\n5(...TRUNCATED) | {"input":["2\n1 10\n2\n2 2\n2 1\n1 1\n","2\n3922 3922\n1\n2 2\n2 1\n1 1\n","1\n1\n2\n1 1\n1 1\n1 1\n(...TRUNCATED) | 6 | 0 | {"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,4,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,4,2,2,2,2,2,2(...TRUNCATED) | {"language":[2,2,2,2,2,4,4,4,3,2,2,3,2,4,4,2,3,4,4,2,4,4,2,2,2,2,2,4,2,2,4,4,4,2,4,2,2,4,4,2,2,2,2,2(...TRUNCATED) | 1,291 | G | 0 | 0 | [
"dp",
"graphs",
"greedy",
"math",
"trees"
] | false | "りんごだいぼうけん\n\nsquare1001君とE869120君は縦 $H$ 行、横 $W$ 列のグリッ(...TRUNCATED) | null | 256,000,000 | ||
494_D. Birthday | "Step up and down\n\nKazuki, commonly known as Kerr, who attends JAG University, was invited by your(...TRUNCATED) | {
"input": [
"3\n5\n3 5 2 1 4\n1\n1\n4\n4 3 1 2\n"
],
"output": [
"\n1 0 2 3 1 \n0 \n0 1 3 2 \n"
]
} | {"input":["1 1\na\n10\n","1 20\naaaaaaaaaaaaaaaaaaaa\n924705 786913 546594 427698 741583 189683 3540(...TRUNCATED) | {"input":["1\n3 3\n1 2\n3 3\n1 3","1\n2 3\n0 0\n2 -1\n0 1\n\nSANPLE","1\n3 3\n1 2\n2 3\n1 3\n\nELPMA(...TRUNCATED) | 2 | 7 | {"language":[3,3,2,2,3,2,2,2,3,3,3,2,3,4,3,2,3,2,3,2,2,2,2,3,3,3,3,2,2,3,3,2,3,2,3,4,3,2,3,2,4,1,4,3(...TRUNCATED) | {
"language": [],
"solution": []
} | 1,421 | C | 0 | 0 | [
"bitmasks",
"brute force",
"divide and conquer",
"dp",
"fft",
"math"
] | false | {
"nanos": 0,
"seconds": 2
} | 0 | |||
867_D. Gotta Go Fast | "Your math teacher gave you the following problem:\n\nThere are n segments on the x-axis, [l_1; r_1](...TRUNCATED) | {
"input": [
"3\n2 1 3\n3 3 6\n99995 9998900031 9998900031\n"
],
"output": [
"1 2 1 \n1 3 2 3 \n1 \n"
]
} | {"input":["99\n1\n3\n2\n2\n3\n1\n1\n3\n3\n3\n3\n3\n3\n1\n1\n3\n3\n3\n3\n1\n1\n3\n2\n1\n1\n1\n1\n1\n1(...TRUNCATED) | {"input":["4\n3\n1 4 2\n1 3 1\n2\n2 4\n2 3\n2\n1 1100000000\n1 1000000000\n4\n3 10 5 8\n2 5 2 4\n","(...TRUNCATED) | 2 | 7 | {"language":[3,2,3,3,3,2,2,2,3,4,4,3,3,3,3,4,3,3,3,4,2,3,2,3,3,3,3,4,3,3,4,3,4,3,3,3,3,3,3,3,2,3,3,3(...TRUNCATED) | {"language":[2,2,2,2,2,4,2,2,1,4,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,4,2,2,2(...TRUNCATED) | 702 | I | 0 | 2,800 | [
""
] | false | {
"nanos": 0,
"seconds": 5
} | 256,000,000 | |||
765_D. Artsem and Saunders | "Grigory has n magic stones, conveniently numbered from 1 to n. The charge of the i-th stone is equa(...TRUNCATED) | {
"input": [
"4\n100 100 100 200\n",
"3\n100 200 100\n"
],
"output": [
"NO\n",
"YES\n"
]
} | {
"input": [],
"output": []
} | {
"input": [],
"output": []
} | 2 | 11 | {"language":[2,2,4,2,2,2,2,2,2,2,2,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,2,2,2(...TRUNCATED) | {"language":[2,0,2,3,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,0,0,2,2,2,2,2,3,2,2,2,2,2,2,2,3,2,2,2,2,2,2(...TRUNCATED) | 277 | 250 | 0 | [
"dp",
"implementation",
"math",
"number theory"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | ||||
p02014 Rough Sorting | "A chessboard n × m in size is given. During the zero minute we repaint all the black squares to th(...TRUNCATED) | {"input":["pozdravstaklenidodiri\nniste\ndobri\n","aaa\na\nb\n","abbbaaccca\nab\naca\n"],"output":["(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["1000 1001\n82 636 713 516\n","1000 1998\n316 681 19 233\n","4 8\n1 3 4 2\n","5 6\n4 3 2 1(...TRUNCATED) | 2 | 12 | {"language":[4,3,2,2,2,2,2,4,2,2,2,2,2,4,4,2,4,2,2,2,2,2,2,2,2,1,4,4,4,2,4,2,3,4,2,2,4,4,4,2,3,4,4,2(...TRUNCATED) | {"language":[2,2,2,2,2,2,2,0,3,2,2,4,2,2,0,2,2,2,2,4,3,2,2,3,2,0,2,2,2,0,2,0,2,2,0,4,2,2,3,2,2,2,2,2(...TRUNCATED) | 143 | F | 0 | 0 | [] | false | {
"nanos": 0,
"seconds": 1
} | 512,000,000 | |||
proposal | "Valera came to Japan and bought many robots for his research. He's already at the airport, the plan(...TRUNCATED) | {
"input": [],
"output": []
} | {
"input": [
"aaaa a",
"abcd cb",
"a abab"
],
"output": [
"4\n",
"0\n",
"0\n"
]
} | {"input":["314159\n1","25\n1","100\n2","314159\n3","999999999999999999999999999999999999999999999999(...TRUNCATED) | 6 | 0 | {"language":[1,3,2,2,2,3,4,2,4,3,3,3,2,3,1,3,3,3,3,3,3,2,3,4,3,3,4,3,3,3,3,3,4,3,4,2,3,3,2,3,4,3,3,3(...TRUNCATED) | {"language":[2,2,2,4,2,4,2,2,4,2,2,1,2,1,4,4,2,2,2,2,2,4,2,2,2,4,4,4,2,2,4,4,4,2,4,2,2,2,2,2,3,3,2,2(...TRUNCATED) | 0 | 0 | 800 | [
"binary search",
"greedy",
"math"
] | false | {
"nanos": 0,
"seconds": 1
} | 0 | ||||
323_C. Two permutations | "As usual, Sereja has array a, its elements are integers: a[1], a[2], ..., a[n]. Let's introduce not(...TRUNCATED) | {"input":["99999999999999999999999999999999999999999999999999999999999999999999999999999999999999999(...TRUNCATED) | {"input":["30 2\n-999999924 -499999902 500000091 -999999998 500000030 -999999934 500000086 -49999991(...TRUNCATED) | {"input":["2 7\n4\n2\n1\n0\n-1\n-2\n-4\n131\n137\n2 7\n4\n2\n1\n0\n-1\n-2\n-4\n124\n123\n10 7\n-4\n-(...TRUNCATED) | 5 | 0 | {"language":[1,4,2,4,2,3,4,4,2,4,3,4,2,2,4,4,3,1,2,1,1,2,4,2,4,4,4,4,2,4,4,2,2,3,2,4,2,2,2,4,1,1,2,3(...TRUNCATED) | {"language":[2,2,4,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,4,3,2,2,2,2,2,2,3,2,2,2(...TRUNCATED) | 1,257 | E | 0 | 2,700 | [
"binary search",
"dp"
] | false | {
"nanos": 0,
"seconds": 6
} | 256,000,000 | |||
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":["5 2 1\n0.1 0.2 0.3 0.4 0.5\n6 2 2\n0.1 0.2 0.3 0.4 0.5 0.6\n0 0 0"],"output":["0.01\n0.00(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["14 2 2012","14 4 2012","14 4 1177","20 4 1177","20 4 1433","20 3 1433","14 3 1433","14 3 (...TRUNCATED) | 6 | 9 | {"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],"solution":["imp(...TRUNCATED) | {"language":[2,2,2,4,2,2,4,2,4,2,4,2,2,2,1,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,4,4,2,4,2,2,2,2,2,2(...TRUNCATED) | 0 | 0 | 1,800 | [
"binary search",
"constructive algorithms",
"graphs",
"shortest paths"
] | false | {
"nanos": 0,
"seconds": 8
} | 256,000,000 |
End of preview. Expand in Data Studio
edition_1102_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
- 5