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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
526_A. King of Thieves | "Rakesh have learn about vowel in school and is given an assignment by his teacher in which he has t(...TRUNCATED) | {
"input": [
"4\naaa\nabc\nabdbca\nabba"
],
"output": [
"YES\nNO\nYES\nYES\n"
]
} | {"input":["1000\n999001\n999002\n999003\n999004\n999005\n999006\n999007\n999008\n999009\n999010\n999(...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) | 6 | 0 | {"language":[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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | {"language":[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,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 0 | E | 1,500 | 2,100 | [
"ternary search"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
79_D. Password | "You happened to get a special bicycle. You can run with it incredibly fast because it has a turbo e(...TRUNCATED) | {
"input": [
"3 2 0 2\n0 1 3\n2 5\n"
],
"output": [
"1\n"
]
} | {
"input": [],
"output": []
} | {"input":["2\n5\n4","3\n1\n0\n3","2\n3\n4","3\n1\n0\n2","2\n4\n4","3\n1\n0\n1","2\n4\n0","3\n1\n2\n1(...TRUNCATED) | 6 | 0 | {"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2],"solution":["#include <bits/stdc++.h>\nusing n(...TRUNCATED) | {"language":[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,2,2,2,2,2,2,2,2(...TRUNCATED) | 0 | 2,750 | 0 | [] | true | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | ||||
371_B. Fox Dividing Cheese | "Malek has recently found a treasure map. While he was looking for a treasure he found a locked door(...TRUNCATED) | {"input":["5\n10 20 30 40 50\n1 1 1 1 1\n","8\n4264 4921 6321 6984 2316 8432 6120 1026\n4264 4921 63(...TRUNCATED) | {"input":["4 5\n1 2 3 1\n2 1 2 8\n2 3 4 7\n1 1 3 3\n2 3 4 8\n","1 4\n1 1 1 2\n2 1 1 6\n1 1 1 1\n2 1 (...TRUNCATED) | {"input":["1\n782058266\n","7\n1\n2\n4\n12\n12345\n15116544\n387420489\n","7\n1\n2\n4\n24\n12345\n23(...TRUNCATED) | 2 | 7 | {"language":[3,3,3,3,4,4,2,3,3,3,4,3,3,2,1,3,3,3,2,1,3,4,4,4,2,3,4,4,3,4,3,4,2,3,3,3,4,1,2,2,3,3,3,1(...TRUNCATED) | {"language":[2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 0 | A | 2,000 | 900 | [] | false | {
"nanos": 0,
"seconds": 2
} | 0 | |||
295_D. Greg and Caves | "In the intergalactic empire Bubbledom there are N planets, of which some pairs are directly connect(...TRUNCATED) | {"input":["2\n4 INDIAN\nCONTEST_WON 1\nTOP_CONTRIBUTOR\nBUG_FOUND 100\nCONTEST_HOSTED\n4 NON_INDIAN\(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["5 6\n3 1 2 6\n3 1 2 6\n1 1\n2 3 6\n3 1 5 6\n","5 7\n2 6 7\n5 1 1 1 1 1\n3 6 5 5\n0\n4 4 3(...TRUNCATED) | 1 | 11 | {"language":[2,3,2,4,3,3,3,1,3,2,3,3,3,3,2,3,3,3,3,2,2,3,3,1,4,3,3,2,3,2,2,3,3,3,3,3,4,4,3,3,4,3,2,3(...TRUNCATED) | {"language":[2,2,3,2,4,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,3,3,2,2,2,2,2,2,2,2(...TRUNCATED) | 0 | 500 | 1,100 | [
"number theory"
] | false | null | 268,435,456 | ||||
83_C. Track | "Takahashi is participating in a programming contest called AXC002, and he has just submitted his co(...TRUNCATED) | {"input":["20 40 60 80 100\n0 1 2 3 4\n1 0\n","119 119 119 119 119\n0 0 0 0 0\n10 0\n"],"output":["4(...TRUNCATED) | {"input":["1\n1\n1\n1\n1\n1\n1\n","1\n3\n2 3 1\n1 2\n2 3\n1\n1\n1\n2\n","2\n6\n5 3 2 4 1 6\n1 2\n1 3(...TRUNCATED) | {"input":["3\n5\n3 5 1 2 4\n1\n1\n4\n4 3 1 2\n","3\n5\n4 5 2 1 3\n1\n1\n4\n4 3 1 2\n","3\n5\n3 4 2 1(...TRUNCATED) | 5 | 8 | {"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,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,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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 0 | 0 | 1,900 | [
"trees"
] | false | {
"nanos": 0,
"seconds": 4
} | 256,000,000 | ||||
p01974 Pigeonhole principle | "Lee tried so hard to make a good div.2 D problem to balance his recent contest, but it still doesn'(...TRUNCATED) | {
"input": [
"2\n2 999995\n",
"3\n2 3 9\n"
],
"output": [
"5\n",
"8\n"
]
} | {"input":["541\n54 98 68 63 83 94 55 35 12 63 30 17 97 62 96 26 63 76 91 19 52 42 55 95 8 97 6 18 96(...TRUNCATED) | {"input":["0?0?","00??","??00????0??1????0?0??00??1???11?1?1???1?11?111???1","1???11??11?1???1?1?11?(...TRUNCATED) | 2 | 11 | {"language":[2,2,2,2,2,4,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,4,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2(...TRUNCATED) | {"language":[2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,4,2,2,2,1,2,2,4,2,2,2,2,4,4,4,2,2,2,3,2,4,2(...TRUNCATED) | 949 | 0 | 0 | [] | false | "JOI 君が住む都市にはN 個の駅があり，それぞれ1, 2, ..., N の番号が付けら(...TRUNCATED) | {
"nanos": 0,
"seconds": 6
} | 256,000,000 | |||
1144_B. Parity Alternated Deletions | "Computation of the date either previous or forthcoming dates is quiet easy. But it is quiet difficu(...TRUNCATED) | {"input":["9 10\n1 2 3 4 5 6 7 8 9\n1 2\n2 3\n2 4\n3 4\n4 5\n4 6\n2 7\n7 8\n7 9\n9 1","2 1\n1 2\n1 2(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["10 7\n1 10\n2 10\n3 19\n4 10\n5 10\n1 2\n1 3\n1 4\n1 5\n1 6\n","20 7\n6047 35038\n15816 3(...TRUNCATED) | 6 | 0 | {"language":[2,2,2,2,4,2,2,2,4,4,4,2,4,4,2,2,4,2,4,4,2,2,4,4,2,2,2,2,4,2,4,4,2,2,2,2,2,2,2,4,2,4,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) | 0 | 1,000 | 2,100 | [
"data structures",
"greedy",
"implementation"
] | false | {
"nanos": 0,
"seconds": 2
} | 268,435,456 | ||||
1470_E. Strange Permutation | "Piet is one of the most known visual esoteric programming languages. The programs in Piet are const(...TRUNCATED) | {
"input": [
"4 1 2 3 4\n",
"5 5 46 372 81 9\n"
],
"output": [
"5 3 5 7 ",
"14 51 418 453 90 "
]
} | {"input":["15\nMIRZOYANOVECLOX\n","23\nAABBBAAACCCCCAAADDDDDDD\n","2\nQA\n","11\nGGRRAATTZZZ\n","6\n(...TRUNCATED) | {"input":["2\nacxz\nzxcb","2\nzxda\nzxcb\n\nSAMPLE","2\nzwac\nbcyz","2\nywac\nbcyz","2\nzxca\nbcxz\n(...TRUNCATED) | 1 | 10 | {"language":[2,2,2,3,2,2,2,3,4,3,2,2,3,2,4,3,2,2,2,3,3,3,2,3,3,2,2,3,2,2,1,2,3,2,3,4,4,3,2,2,2,2,3,3(...TRUNCATED) | {
"language": [],
"solution": []
} | 702 | F | 1,500 | 1,300 | [
"*special",
"strings"
] | false | {
"nanos": 0,
"seconds": 3
} | 256,000,000 | |||
1027_E. Inverse Coloring | "Polycarp plays a computer game. In this game, the players summon armies of magical minions, which t(...TRUNCATED) | {
"input": [
"2\n5 10\n3 4 6 1 9\n3 2\n1 3 4"
],
"output": [
"1\n0"
]
} | {
"input": [],
"output": []
} | {"input":["10\n-405 -230 252 -393 -271 -259 97 163 81 -129\n","10\n1 10 2 9 6 8 4 7 5 6\n","4\n1 2 5(...TRUNCATED) | 1 | 8 | {"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],"solution":["#include <bits/stdc(...TRUNCATED) | {"language":[2,2,2,2,2,2,2,2,3,2,2,1,4,2,2,2,2,2,2,2,2,3,4,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,1,2,4,2,2,2(...TRUNCATED) | 425 | A | 500 | 1,500 | [
""
] | false | {
"nanos": 0,
"seconds": 2
} | 268,435,456 | |||
p01316 Differential Pulse Code Modulation | "Let us denote by d(n) the sum of all divisors of the number n, i.e. d(n) = ∑_{k | n} k.\n\nFor ex(...TRUNCATED) | {"input":["3 4\n10 10\n-10 -10\n3 3\n1 2\n2 3\n3 5\n3 5","2 2\n2 0\n0 0\n-1 0\n1 0","5 5\n-100000000(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["36\n2 2 2 8 9 4 8 5\n9 1 7 6 10 6 9 3\n10 2 4 6 6 2 1 1\n9 6 2 3 5 7 7 3\n6 6 3 9 10 9 1 (...TRUNCATED) | 2 | 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],"solution":["#include<bits/std(...TRUNCATED) | {"language":[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,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 0 | 1,000 | 1,700 | [
"constructive algorithms",
"dsu",
"math"
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 |
End of preview. Expand
in Data Studio
edition_3126_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
- 8