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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
hermione-vs-draco | "You are given a string s consisting of n lowercase Latin letters.\n\nLet's define a substring as a (...TRUNCATED) | {"input":["4\n1 3\n2 4\n3 4\n2 3\n","4\n4 4\n1 3\n2 4\n3 4\n"],"output":["NO\n1 3 4 2\n1 2 4 3\n","Y(...TRUNCATED) | {"input":["51\n882889888888689888850888388887688788888888888858888\n","55\n7271714707719515303911625(...TRUNCATED) | {"input":["4000 4000 2\n","3 300 167\n","3 300 2\n","4 4 2\n","3 2 70\n","1625 3998 2\n","300 403 30(...TRUNCATED) | 2 | 13 | {"language":[4,2,2,2,4,2,2,4,2,3,4,3,2,4,2,2,2,3,4,4,2,2,2,3,4,4,4,2,3,1,4,4,2,2,2,4,2,3,4,2,2,2,3,2(...TRUNCATED) | {
"language": [],
"solution": []
} | 977 | F | 2,000 | 1,400 | [
"implementation"
] | true | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
1227_D1. Optimal Subsequences (Easy Version) | "Don't put up with what you're sick of! The Smart Beaver decided to escape from the campus of Beaver(...TRUNCATED) | {
"input": [
"16\n.**.*..*.***.**.\n",
"11\n.*.*...*.*.\n"
],
"output": [
"yes",
"no"
]
} | {
"input": [],
"output": []
} | {"input":["36 102 73 101 19\n5 9 2 4 6\n4 13\n","0 0 119 0 1\n0 0 2 0 0\n5 5\n","0 0 0 0 0\n10 10 10(...TRUNCATED) | 2 | 7 | {"language":[1,1,1],"solution":["t=input()\nfrom fractions import gcd\nfor x in range(t):\n\tn1=inpu(...TRUNCATED) | {"language":[2,2,3,2,0,3,0,3,2,0,3,4,3,4,3,3,0,2,3,2,2,2,2,2,3,4,3,2,3,0,3,2,2,0,2,3,3,3,2,3,4,3,0,3(...TRUNCATED) | 0 | D | 500 | 0 | [
"combinatorics",
"dp",
"math",
"probabilities"
] | false | {
"nanos": 0,
"seconds": 8
} | 0 | |||
p00781 Lattice Practices | "An elementary school student Takahashi has come to a variety store.\n\nHe has two coins, A-yen and (...TRUNCATED) | {
"input": [
"2 2\n2 3\n2 3\n2 3\n2 2\n3 2",
"2 2\n2 3\n2 3\n2 3\n2 2\n2 2"
],
"output": [
"yes",
"no"
]
} | {
"input": [],
"output": []
} | {"input":["3\n6 13 24","3\n6 4 30","3\n12 11 12","3\n6 20 24","3\n6 7 30","3\n11 20 24","3\n10 7 30"(...TRUNCATED) | 6 | 0 | {
"language": [],
"solution": []
} | {"language":[2,3,4,2,3,3,2,4,4,2,3,4,4,3,2,4,2,4,2,4,4,4,2,3,3,2,3,2,4,2,2,4,2,3,2,3,2,4,3,2,3,3,4,4(...TRUNCATED) | 1,136 | E | 0 | 2,100 | [
"binary search",
"geometry",
"ternary search"
] | true | {
"nanos": 0,
"seconds": 6
} | 0 | |||
p02405 Print a Chessboard | "Friends Alex and Bob live in Bertown. In this town there are n crossroads, some of them are connect(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["3\n500000 500001 500002\n","1\n505050\n","2\n999998 999999\n","2\n500000 500001\n","1\n99(...TRUNCATED) | {"input":["53812 5 967428361\n","12 2 400166453\n","27203 10 802338989\n","59715 12 196344479\n","14(...TRUNCATED) | 3 | 0 | {"language":[2,2,2,4,4,3,4,2,2,4,3,2,2,2,2,2,1,4,2,2,2,2,2,2,2,4,4,4,4,4,4,4,4,4,2,2,2,4,2,2,2,4,4,2(...TRUNCATED) | {"language":[2,2,4,2,2,2,2,3,3,2,3,3,4,2,2,3,2,3,2,2,2,2,2,2,2,3,2,4,2,4,1,2,4,3,2,4,4,2,2,3,4,2,2,2(...TRUNCATED) | 0 | 0 | 0 | [
"data structures",
"dfs and similar",
"dp",
"graphs",
"greedy",
"trees"
] | false | {
"nanos": 0,
"seconds": 2
} | 512,000,000 | ||||
battle-of-stalingrad-1 | "Today Peter has got an additional homework for tomorrow. The teacher has given three integers to hi(...TRUNCATED) | {
"input": [
"7\n1\n2\n3\n4\n5\n100\n2000000\n"
],
"output": [
"0\n0\n4\n4\n12\n990998587\n804665184\n"
]
} | {"input":["20\nadd 17\nadd 18\nadd 19\nsum\nadd 20\nadd 21\nadd 22\nsum\nadd 23\nadd 24\nadd 25\nsum(...TRUNCATED) | {"input":["5\n0 968804136\n0 736567537\n2 343136264\n0 259899572\n1 103950505\n","5\n0 51690939\n0 6(...TRUNCATED) | 2 | 12 | {"language":[3,2,2,4,3,4,4,3,3,3,2,1,1,2,3,2,4,4,3,4,3,4,3,2,3,4,1,3,1,3,3,3,1,2,3,1,2,4,3,4,1,3,3,3(...TRUNCATED) | {"language":[2,2,2,2,2,4,2,2,4,4,2,2,2,2,2,2,1,4,2,2,4,2,2,2,2,2,2,2,4,2,2,2,3,2,2,2,3,2,3,2,2,2,2,2(...TRUNCATED) | 0 | A | 3,000 | 0 | [
""
] | true | null | 256,000,000 | |||
405_E. Graph Cutting | "You are given a chessboard of size 1 × n. It is guaranteed that n is even. The chessboard is paint(...TRUNCATED) | {"input":["5\n4\n1 2 3 4\n5 10 15 20\n4\n1 2 1 2\n5 10 15 20\n4\n2 2 4 1\n2 8 19 1\n2\n1 1\n6 9\n1\n(...TRUNCATED) | {"input":["4 10\n1 333333333 666666666 1000000000\n1000000000 1000000000 1000000000 1000000000\n1 1\(...TRUNCATED) | {"input":["0 -2 -1\n","563 -23532 1232\n","0 2 0\n","0 10 20\n","-50000 100001 -50000\n","50000 1100(...TRUNCATED) | 2 | 7 | {
"language": [],
"solution": []
} | {"language":[2,4,2,2,3,3,4,3,3,4,1,3,2,3,2,4,2,3,4,2,3,3,2,2,2,4,3,2,3,4,2,2,4,4,3,2,4,2,3,2,4,3,4,3(...TRUNCATED) | 741 | 0 | 3,500 | [
"binary search",
"greedy",
"math"
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | ||||
147_B. Smile House | "Let's denote a function \n\n<image>\n\nYou are given an array a consisting of n integers. You have (...TRUNCATED) | {
"input": [
"3\n2\n<>\n3\n><<\n1\n>\n"
],
"output": [
"0\n0\n0\n"
]
} | {"input":["6 4 3\n0 1 2\n1 3 0\n0 4 5\n1 4 4\n1 2 2\n0 4 2\n","50 69 6\n62 91 5\n35 35 53\n85 26 1\n(...TRUNCATED) | {
"input": [],
"output": []
} | 2 | 9 | {"language":[2,2,2,2,2,2,2,4,2,2,1,4,2,2,2,2,4,2,4,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2(...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) | 242 | 0 | 0 | [] | false | {
"nanos": 0,
"seconds": 2
} | 268,435,456 | ||||
p03294 AtCoder Beginner Contest 103 - Modulo Summation | "A chessboard n × m in size is given. During the zero minute we repaint all the black squares to th(...TRUNCATED) | {"input":["3\n1 3 2\n-100 2 3\n","2\n2 1\n-3 0\n","5\n2 1 4 3 5\n2 2 2 3 4\n"],"output":["3\n","0\n"(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["3 2\n123 87 567\n1 2\n3 2\n","3 0\n4 1 8\n","3 2\n1 0 2\n3 2\n2 1\n","2 0\n1000000000 110(...TRUNCATED) | 2 | 11 | {"language":[2,2,2,2,4,2,2,4,4,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,4,2,2,2,4,2,2(...TRUNCATED) | {"language":[2,4,2,2,0,2,4,2,3,2,3,2,2,2,2,2,2,0,2,2,2,3,2,2,2,2,2,3,2,0,0,2,2,0,3,0,2,2,2,2,2,2,2,2(...TRUNCATED) | 500 | B | 2,000 | 0 | [
"binary search",
"math"
] | false | {
"nanos": 0,
"seconds": 3
} | 0 | |||
592_E. BCPC | "A prime number is a natural number which has exactly two distinct natural number divisors: 1 and it(...TRUNCATED) | {
"input": [
"4 4\nDRLD\nU.UL\n.UUR\nRDDL\n",
"3 5\n.D...\nRRRLL\n.U...\n"
],
"output": [
"10 1\n",
"6 2\n"
]
} | {"input":["3 1\n1 2 5\n","1 1\n100000\n","5 1\n2 2 4 6 1\n","3 10\n5 5 10\n","1 1\n1\n","3 4\n1 2 5\(...TRUNCATED) | {"input":["50 100\n3 24 49\n2 10 12\n1 87 92\n2 19 60\n2 53 79\n3 65 82\n3 10 46\n1 46 86\n2 55 84\n(...TRUNCATED) | 2 | 0 | {"language":[2,4,4,2,3,4,4,4,4,2,2,3,4,3,3,3,3,3,4,2,2,4,3,3,4,3,2,3,4,2,3,3,2,3,3,4,3,3,2,2,3,4,3,2(...TRUNCATED) | {
"language": [],
"solution": []
} | 1,311 | 500 | 2,100 | [
"combinatorics",
"dfs and similar",
"dsu",
"graphs"
] | false | null | 268,435,456 | ||||
p02741 Panasonic Programming Contest 2020 - Kth Term | "Kitahara Haruki has bought n apples for Touma Kazusa and Ogiso Setsuna. Now he wants to divide all (...TRUNCATED) | {
"input": [
"??00????0??0????0?0??00??1???11?1?1???1?11?111???1",
"0??0",
"0??"
],
"output": [
"4",
"2",
"1"
]
} | {
"input": [],
"output": []
} | {"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 | 11 | {"language":[2,2,2,2,2],"solution":["#include<cmath>\n#include<cstdio>\n#include<vector>\n\n#define (...TRUNCATED) | {"language":[4,4,2,2,2,4,2,2,2,2,2,2,2,4,4,4,4,2,2,4,3,2,4,4,2,1,4,2,4,4,2,3,3,4,2,2,2,2,4,2,2,4,2,2(...TRUNCATED) | 737 | E | 0 | 1,600 | [
"games",
"math"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 |
End of preview. Expand
in Data Studio
edition_3064_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
- 3