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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1455_F. String and Operations | "Your math teacher gave you the following problem:\n\nThere are n segments on the x-axis, [l_1; r_1](...TRUNCATED) | {
"input": [
"3\n",
"6\n"
],
"output": [
"*\n**\n***\n",
"*\n**\n***\n****\n*****\n******\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":["3\n3 2 0\n","3\n1 2 0\n","3\n2 0 2\n","11\n1 1 1 1 1 2 4 2 2 2 1\n","5\n1 1 2 1 2\n","5\n(...TRUNCATED) | 1 | 7 | {"language":[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,2,2,2,4,2,2,2,2,2,2,2(...TRUNCATED) | {"language":[4,2,2,2,2,2,2,2,2,1,2,2,2,1,3,2,2,2,1,2,2,3,2,3,2,2,2,2,2,2,2,2,2,2,3,2,2,4,4,3,2,2,3,2(...TRUNCATED) | 0 | 0 | 0 | [] | false | null | 1,073,741,824 | ||||
1129_D. Isolation | "There are N cubes stacked vertically on a desk.\n\nYou are given a string S of length N. The color (...TRUNCATED) | {
"input": [
"4 5 3 1 5\n",
"5 1 2 1 2\n",
"3 3 1 1 1\n"
],
"output": [
"Friendship\n",
"First\n",
"Second\n"
]
} | {"input":["72\n111101100111001110000000100010100000011011100110001010111010101011111100\n","3\n101\n(...TRUNCATED) | {"input":["5\n5 4 3 1 2\n","3\n3 2 1\n","3\n2 3 1\n","10\n5 1 6 2 8 4 3 10 9 7\n","3\n3 1 2\n","3\n2(...TRUNCATED) | 2 | 10 | {"language":[2,2,2,2,2,2,4,2,2,4,4,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2(...TRUNCATED) | {"language":[0,3,0,2,4,0,0,4,0,0,3,1,3,4,0,2,2,0,2,3,2,2,4,4,0,3,4,4,4,2,0,0,2,0,2,3,0,0,0,0,0,0,2,0(...TRUNCATED) | 1,053 | E | 0 | 2,700 | [
"binary search",
"brute force",
"dp",
"greedy",
"sortings"
] | false | {
"nanos": 0,
"seconds": 1
} | 512,000,000 | |||
chandu-and-daspal-2 | "Draco Malfoy and Hermione Granger have gotten into a \"battle of brains\". Draco was foolish enough(...TRUNCATED) | {"input":["3\n6 11 24","3\n6 11 30","3\n6 11 12"],"output":["0.090909090909","0.166666666667","0.090(...TRUNCATED) | {"input":["10\n10\n8 10\n1 1\n1 6\n4 7\n4 9\n8 8\n1 4\n2 3\n4 5\n2 2\n10\n1 1\n1 2\n1 3\n1 4\n1 5\n6(...TRUNCATED) | {
"input": [],
"output": []
} | 2 | 8 | {"language":[2,2,2,2,2,4,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,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) | 39 | 0 | 1,000 | [] | false | {
"nanos": 0,
"seconds": 5
} | 256,000,000 | ||||
p00822 Weather Forecast | "You are given a string S consisting of letters `b`, `d`, `p` and `q`. Determine whether S is a mirr(...TRUNCATED) | {
"input": [
"5 1\nbacba",
"10 2\nbbaabbbaab"
],
"output": [
"aabca",
"aaaabbaabb"
]
} | {"input":["100 10\n7 4 5 5 10 10 5 8 5 7 4 5 4 6 8 8 2 6 3 3 10 7 10 8 6 2 7 3 9 7 7 2 4 5 2 4 9 5 1(...TRUNCATED) | {
"input": [],
"output": []
} | 2 | 7 | {"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,4,4,3,2,3,2,2,3,2,3,3,4,3,4,4,4,2,2,2,4,2,4,4,3,2,3,1,4,2,3,4,3,2,2,2,2,4,2,2,3,2,2,2(...TRUNCATED) | 754 | 1,750 | 3,200 | [
"combinatorics",
"dfs and similar",
"dsu",
"graphs"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | ||||
p02705 AtCoder Beginner Contest 163 - Circle Pond | "Polycarp was dismantling his attic and found an old floppy drive on it. A round disc was inserted i(...TRUNCATED) | {"input":["5\n7\n1\n9\n7\n3\n","10\n100\n1\n100\n1\n100\n1\n100\n1\n100\n1\n"],"output":["1 3 7 7 9 (...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["2\n17 25\n4\n17 45\n4\n17 25\n7\n1 35\n0","2\n19 25\n4\n17 37\n4\n17 47\n7\n0 63\n0","2\n(...TRUNCATED) | 2 | 12 | {"language":[2,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,4,3,2,3,3,3,3,3,2,3,3,3,3,4,4,3,3,2,3,3,3,3,3,3,2,3,3,3(...TRUNCATED) | {
"language": [],
"solution": []
} | 0 | 0 | 3,000 | [
"implementation"
] | false | {
"nanos": 0,
"seconds": 2
} | 512,000,000 | ||||
ism1 | "Background\n\nThe kindergarten attached to the University of Aizu is a kindergarten where children (...TRUNCATED) | {
"input": [
"14\n",
"2128506\n",
"11\n",
"571576\n",
"61441\n"
],
"output": [
"0",
"3",
"2",
"10",
"2"
]
} | {"input":["10\n9 8 7 6 5\n","100\n41 13 29 11 25 15 6 23 28 50 48 17 3 9 44 24 5 19 34 22 33 32 20 1(...TRUNCATED) | {"input":["3703 4549\n433\n","2931 2881\n710\n","3762 947\n1073\n","4583 2774\n986\n","7 10\n1\n","1(...TRUNCATED) | 5 | 0 | {"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":[2,2,4,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2,4,2,2,1,2,2,2,2,2,2(...TRUNCATED) | 962 | A | 1,000 | 2,400 | [
""
] | false | "E - Disappear Drive / 消えるドライヴ\n\nStory\n\nDのひとはバスケットボールが好(...TRUNCATED) | null | 256,000,000 | ||
348_A. Mafia | "In a mystical TimeLand, a person's health and wealth is measured in terms of time(seconds) left. \n(...TRUNCATED) | {"input":["500 500 0 0 200 200","4 4 0 0 1 1","4 4 0 0 3 3","2 3 0 0 1 2"],"output":["34807775","2",(...TRUNCATED) | {"input":["30\n10 1 8 10 2 6 45 7 3 7 1 3 1 1 14 2 5 19 4 1 13 3 5 6 1 5 1 1 23 1\n98 4 43 41 56 58 (...TRUNCATED) | {"input":["10 1000000\n1 2 3 4 8 5 6 7 8 9\n","13 666\n84 89 29 103 128 233 190 122 117 208 119 97 3(...TRUNCATED) | 2 | 9 | {"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2],"solution":["#include<iostream>\n#include<algo(...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) | 0 | E | 0 | 2,600 | [
""
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | |||
p02120 Cluster Network | "Finally Fox Ciel arrived in front of her castle!\n\nShe have to type a password to enter her castle(...TRUNCATED) | {
"input": [
"1\n3 3\n1 2\n2 3\n1 3\n\nSAMPLE"
],
"output": [
"2\n"
]
} | {"input":["2\n1 10\n3\n2 2\n2 1\n1 1\n","2\n3922 3922\n3\n2 2\n2 1\n1 1\n","1\n1000000000\n1\n1 1\n"(...TRUNCATED) | {"input":["8\n0 -1\n3 2\n6 2\n8 6\n6 5\n7 7\n0 4\n3 4\n8\n0 0\n5 3\n5 2\n4 1\n6 1\n8 6\n6 4\n2 4\n0"(...TRUNCATED) | 2 | 10 | {"language":[2,1,3,4,1,4,1,4,2,3,4,2,4,1,2,3,2,2,4,3,2,4,2,2,2,4,4,3,2,4,4,4,4,1,1,3,2,2,2,4,1,4,1,2(...TRUNCATED) | {"language":[3,2,2,2,2,2,2,2,2,2,2,3,3,2,3,2,3,2,2,3,2,2,4,2,2,3,2,2,2,2,2,4,2,2,2,2,2,2,4,2,2,2,3,3(...TRUNCATED) | 70 | B | 0 | 0 | [
"implementation"
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | |||
805_A. Fake NP | "Wet Shark asked Rat Kwesh to generate three positive real numbers x, y and z, from 0.1 to 200.0, in(...TRUNCATED) | {"input":["4 1111\n1 10 100 1000","3 70\n20 30 10","3 10\n20 30 10","2 10\n20 20"],"output":["4","2"(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["4 3\n1 3 2 7","4 4\n1 3 2 4","4 4\n1 0 2 4","4 3\n1 3 2 8","2 4\n1 3 2 4","4 4\n1 -1 2 4"(...TRUNCATED) | 2 | 0 | {"language":[2,2,4,2,4,4,2,3,2,3,3,4,3,2,4,3,2,2,3,3,4,2,2,2,2,3,3,2,2,4,4,4,4,3,3,2,3,3,3,2,2,2,3,3(...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) | 45 | D | 0 | 0 | [
"binary search",
"dp",
"greedy",
"sortings"
] | false | null | 512,000,000 | |||
101_C. Vectors | "There are N stations in the city where JOI lives, and they are numbered 1, 2, ..., and N, respectiv(...TRUNCATED) | {
"input": [
"2 -3 4\nL 2 5\n? 3 5"
],
"output": [
"2\nL 4\nL 3"
]
} | {"input":["1 999999999 29983 29989\n","9999999 10000 29983 29989\n","808351 17767 433 509\n","197 2 (...TRUNCATED) | {"input":["20 10 3\nebebccacdb\neeebccddeT\neadebecaac\nadeeeaccbc\nbaccccdaed\nabbaecbaed\ndadbecba(...TRUNCATED) | 1 | 13 | {"language":[2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,4,2,2,2,4,2,2,2,2,2,2,1,2,2,2,2,2,4,2,2,2,2,2,2,1,4,2,2(...TRUNCATED) | {"language":[2,2,2,2,2,2,2,0,0,2,2,0,2,2,4,2,2,4,0,0,2,2,0,2,2,0,0,2,2,2,2,2,2,2,0,2,2,2,2,2,0,2,2,2(...TRUNCATED) | 1,003 | F | 0 | 1,500 | [
"games",
"graphs"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 |
End of preview. Expand in Data Studio
edition_2194_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
- 4