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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
938_B. Run For Your Prize | "Polycarp has recently created a new level in this cool new game Berlio Maker 85 and uploaded it onl(...TRUNCATED) | {
"input": [
"5\n3\n1\n2\n3\n4\n5\n\nSAMPLE"
],
"output": [
"2\n"
]
} | {"input":["205078485761\n","873109054817\n","518649879439\n","401021537803\n","821985629174\n","6146(...TRUNCATED) | {"input":["4 6\n1 2 101\n3 1 100\n2 4 100\n4 3 100\n1 4 100\n3 2 100","15 22\n8 13 33418\n14 15 5584(...TRUNCATED) | 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,0,2,0,2,2,2,2,2,0,2,0,1,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,0,2,2(...TRUNCATED) | 1,366 | E | 1,500 | 3,200 | [
"data structures",
"greedy",
"two pointers"
] | true | null | 256,000,000 | |||
1199_E. Matching vs Independent Set | "Let c be some positive integer. Let's call an array a_1, a_2, …, a_n of positive integers c-array(...TRUNCATED) | {
"input": [
"1\n100000 2",
"3\n2 1\n1 3\n2 2"
],
"output": [
"100002 0",
"3 0\n5 0"
]
} | {"input":["72\n909 34\n420 51\n621 76\n65 48\n82 41\n665 53\n43 33\n309 21\n942 51\n156 13\n997 11\n(...TRUNCATED) | {"input":["1 1\n5\n2 1 7\n","10 6\n10 10 10 6 6 5 5 5 3 1\n2 3 50\n2 4 10\n1 3 10\n2 2 36\n1 4 7\n2 (...TRUNCATED) | 2 | 12 | {"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,2,2,2,0,4,0,0,2,4,0,2,0,2,0,0,4,0,2,2,2,0,2,2,0,2,3,4,2,4,0,4,0,2,0,2,2,2,2,2,0,2,4(...TRUNCATED) | 530 | D | 0 | 0 | [
"bitmasks",
"brute force",
"divide and conquer",
"dp",
"fft",
"math"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
trailing-zero-problem-1 | "Our beloved detective, Sherlock is currently trying to catch a serial killer who kills a person eac(...TRUNCATED) | {"input":["3 10 10\n1\n1 1 1\n1\n3 3 3\n1\n5 5 5\n0 1 0\n1 0 0\n0 1 0","4 59 40\n1\n7 6 3\n1\n10 3 9(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["1 36 0\n-1 -1 -1","0 30 0\n-1 -1 -1","0 32 0\n-1 -1 -1","1 16 0\n-1 -1 -1","0 36 0\n-1 -1(...TRUNCATED) | 2 | 0 | {"language":[2,1,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,1,2,4,1,1,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,4,2(...TRUNCATED) | {"language":[2,2,2,2,2,2,2,2,2,4,2,4,2,1,2,2,1,2,1,4,4,2,2,2,2,2,2,2,1,2,2,2,1,2,2,2,2,4,2,3,4,2,2,2(...TRUNCATED) | 203 | C | 0 | 1,900 | [
"bitmasks",
"dp"
] | false | {
"nanos": 0,
"seconds": 3
} | 134,217,728 | |||
1369_D. TediousLee | "Nadeko's birthday is approaching! As she decorated the room for the party, a long garland of Dianth(...TRUNCATED) | {"input":["1.1 3.4 2.5\n","1.9 1.8 1.7\n","2.0 2.0 2.0\n"],"output":["z^y^x\n","(x^y)^z\n","x^y^z\n"(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["30 2\n-999999924 -499999902 500000091 -697652453 500000030 -999999934 500000086 -49999991(...TRUNCATED) | 2 | 9 | {"language":[1],"solution":["from sys import stdin\nt=stdin.readline()\na=stdin.readlines()\nfor i i(...TRUNCATED) | {"language":[2,3,4,3,3,4,2,2,3,3,2,2,2,3,3,3,2,2,3,3,3,4,2,3,2,2,3,2,3,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2(...TRUNCATED) | 1,397 | C | 1,000 | 0 | [
"constructive algorithms",
"greedy",
"sortings"
] | false | {
"nanos": 0,
"seconds": 1
} | 0 | |||
626_D. Jerry's Protest | "You have a string s — a sequence of commands for your toy robot. The robot is placed in some cell(...TRUNCATED) | {"input":["2\n3 1 9\n1 2 3\n1 1\n2 1\n3 1\n1 2\n2 2\n3 2\n1 3\n2 3\n3 3\n6 4 4\n6 5 4 3 1 2\n1 1\n3 (...TRUNCATED) | {"input":["81\n9 4\n6 8\n6 4\n4 6\n4 8\n9 10\n0 2\n5 4\n8 9\n7 7\n10 5\n4 4\n7 8\n3 7\n2 1\n5 5\n2 7(...TRUNCATED) | {"input":["0\n2130761060 2000000000 1\n","0\n1 1723177055 2000000000\n","12\nAnka likes Dracul\nDrac(...TRUNCATED) | 1 | 0 | {"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,4,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | {
"language": [],
"solution": []
} | 0 | A | 0 | 1,900 | [
"bitmasks",
"brute force",
"data structures",
"string suffix structures",
"strings"
] | false | null | 512,000,000 | |||
p02916 AtCoder Beginner Contest 140 - Buffet | "Having learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclu(...TRUNCATED) | {"input":["4\n..E.\n.AD.\nB...\n..C.\nD\n4\n..E.\n.AD.\nB...\n..C.\nDR\n3\n...\n.A.\nBC.\n((URD)3L)2(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["264193194 -448876521 716456020 -633906160 -328597212 -47935734\n","1 0 2 1 3 0\n","-35753(...TRUNCATED) | 2 | 9 | {"language":[2,2,2,2,2,2,2,2,2,2,2,2,1,2,4,2,2,2,2,4,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2(...TRUNCATED) | {"language":[1,2,2,2,2,3,2,4,2,1,2,4,2,3,4,2,2,3,3,3,4,2,4,2,2,2,2,3,2,1,4,2,2,2,2,4,2,1,2,2,2,4,4,2(...TRUNCATED) | 0 | H | 500 | 1,700 | [
"brute force",
"implementation",
"strings"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
1277_E. Two Fairs | "PowerShell had N natural numbers. He wanted to test Xenny's speed in finding the sum and difference(...TRUNCATED) | {
"input": [
"1\n4 2\n6 1 2 0\n\nSAMPLE"
],
"output": [
"3\n"
]
} | {
"input": [],
"output": []
} | {"input":["1 10\n778084 -205153\n778001 -205093\n778155 -205118\n778168 -204997\n778066 -205141\n778(...TRUNCATED) | 2 | 12 | {"language":[2,2,2,2,4,2,4,2,2,4,2,2,2,2,2,4,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,4(...TRUNCATED) | {"language":[2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,1,2,2,4,2,2,2,2,2,2,4(...TRUNCATED) | 348 | 0 | 1,400 | [
"dfs and similar",
"graphs"
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | ||||
p01691 Disappear Drive | "Kevin Sun has just finished competing in Codeforces Round #334! The round was 120 minutes long and (...TRUNCATED) | {
"input": [
"3\nAFI\n",
"6\nAFFAAA\n"
],
"output": [
"1",
"4"
]
} | {
"input": [],
"output": []
} | {"input":["25\n91 57\n2 73\n54 57\n2 57\n23 57\n2 6\n57 54\n57 23\n91 54\n91 23\n57 23\n91 57\n54 2\(...TRUNCATED) | 3 | 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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | {"language":[2,2,2,0,2,4,2,2,2,2,4,2,3,2,0,2,2,2,2,2,2,2,0,2,4,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2(...TRUNCATED) | 0 | 2,500 | 2,200 | [
"constructive algorithms",
"greedy",
"number theory"
] | false | {
"nanos": 0,
"seconds": 5
} | 256,000,000 | ||||
1244_C. The Football Season | "Bearland has n cities, numbered 1 through n. Cities are connected via bidirectional roads. Each roa(...TRUNCATED) | {"input":["6 7\n2 3\n3 4\n4 2\n1 2\n1 5\n5 6\n6 1\n","3 3\n1 2\n2 3\n3 1\n","5 6\n1 2\n2 3\n2 4\n4 3(...TRUNCATED) | {"input":["aabbaaaa\naaaaabab\n","qgiufelsfhanx\naaaaaaaaaaaaa\n","abcddd\nbacddd\n","azzz\nzzaz\n",(...TRUNCATED) | {"input":["4\nSSSSEEEECCCCEECCCC\nCCCCCSSSSEEECCCCSS\nSCCCCCCCSSEEESSSSS\nEESSSSCCCCCCSSEEEESAMPLE",(...TRUNCATED) | 2 | 12 | {"language":[2,3,2,3,4,3,2,4,4,2,2,2,4,4,3,2,3,3,2,4,4,3,2,2,2,3,4,2,3,2,2,4,2,2,4,2,4,4,3,4,3,2,2,3(...TRUNCATED) | {"language":[2,2,4,2,2,2,2,2,2,2,4,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,2,2,2,2(...TRUNCATED) | 0 | 0 | 0 | [
"constructive algorithms",
"math",
"sortings"
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | ||||
1512_G. Short Task | "You are given N positive integers a_1, a_2, ..., a_N.\n\nFor a non-negative integer m, let f(m) = ((...TRUNCATED) | {
"input": [
"2 2 1 0 0 1\n",
"2 2 10 11 0 1\n",
"2 4 3 -1 3 7\n"
],
"output": [
"1",
"5",
"2"
]
} | {
"input": [],
"output": []
} | {"input":["72\n909 34\n420 51\n621 76\n65 48\n82 41\n665 53\n43 33\n309 21\n942 51\n156 13\n997 11\n(...TRUNCATED) | 2 | 0 | {"language":[1,1],"solution":["def isvalid(s, c):\n if c.difference(s):\n return False\n (...TRUNCATED) | {"language":[4,2,2,2,1,2,1,3,2,4,3,4,2,4,2,2,2,2,4,3,4,4,4,2,2,4,1,4,4,4,2,4,2,4,2,2,2,2,3,1,2,2,2,4(...TRUNCATED) | 0 | D | 0 | 0 | [
"implementation"
] | false | {
"nanos": 0,
"seconds": 2
} | 512,000,000 |
End of preview. Expand in Data Studio
edition_0516_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