Dataset Preview
The full dataset viewer is not available (click to read why). Only showing a preview of the rows.
502 Server Error: Bad Gateway for url: https://huggingface.co/api/datasets/TheFactoryX/edition_1972_deepmind-code_contests-readymade/commits/main
Error code: UnexpectedError
Need help to make the dataset viewer work? Make sure to review how to configure the dataset viewer, and open a discussion for direct support.
name string | description string | public_tests dict | private_tests dict | generated_tests dict | source int64 | difficulty int64 | solutions dict | incorrect_solutions dict | cf_contest_id int64 | cf_index string | cf_points float64 | cf_rating int64 | cf_tags list | is_description_translated bool | untranslated_description string | time_limit dict | memory_limit_bytes int64 | input_file string | output_file string |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
846_B. Math Show | "An established group of scientists are working on finding solution to NP hard problems. They claim (...TRUNCATED) | {
"input": [
"5 3\n5 5 7 3 1\n",
"4 2\n1 2 3 4\n",
"2 3\n1 2\n"
],
"output": [
"15\n",
"8\n",
"0\n"
]
} | {"input":["1\n9\n>>>>>>>><\n","13\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\(...TRUNCATED) | {"input":["5\nFFFAF\n","5\nIIAAF\n","5\nAAFFA\n","6\nAAAFFA\n","2\nAF\n","8\nIFFFIAAI\n","3\nFFA\n",(...TRUNCATED) | 2 | 9 | {"language":[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,4,2,2,2,2,2,2,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 | 2,300 | [
"brute force"
] | false | null | 256,000,000 | ||||
161_B. Discounts | "An elementary school student Takahashi has come to a variety store.\n\nHe has two coins, A-yen and (...TRUNCATED) | {
"input": [
"1\n3 3\n1 2\n2 3\n1 3\n\nSAMPLE"
],
"output": [
"2\n"
]
} | {
"input": [],
"output": []
} | {"input":["500 500 0 0 107 200","4 1 0 0 1 1","4 4 1 0 3 3","2 3 0 0 1 1","500 500 0 0 107 239","2 1(...TRUNCATED) | 2 | 9 | {"language":[2,2,2,2,2,2,2,2],"solution":["#include <iostream>\n#include <iomanip>\n#include <comple(...TRUNCATED) | {
"language": [],
"solution": []
} | 702 | 500 | 1,100 | [
"binary search",
"brute force",
"geometry",
"math"
] | false | {
"nanos": 0,
"seconds": 1
} | 1,073,741,824 | ||||
monks-birthday-party | "Snuke has decided to play a game, where the player runs a railway company. There are M+1 stations o(...TRUNCATED) | {
"input": [
"3\n0 0 0\n",
"5\n0 1 1 1 10\n",
"2\n0 1\n"
],
"output": [
"3 2 1 ",
"1 4 3 2 5 ",
"1 2 "
]
} | {
"input": [],
"output": []
} | {"input":["7 7 19\n#.....#\n..#.#..\n.#...#.\n...#...\n.#...#.\n..#.#..\n#.....#\n","4 6 3\n#.....\n(...TRUNCATED) | 2 | 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,3,2,2,3,2,2,3,2,2,2,3,2,2,2,2,2,2(...TRUNCATED) | {
"language": [],
"solution": []
} | 1,402 | D | 2,500 | 0 | [
"dfs and similar",
"graphs"
] | true | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
p02548 AtCoder Beginner Contest 179 - A x B + C | "You are given three sequences: a_1, a_2, …, a_n; b_1, b_2, …, b_n; c_1, c_2, …, c_n.\n\nFor e(...TRUNCATED) | {"input":["18\naeiouyaaeeiioouuyy\n","22\niiiimpleeemeentatiioon\n","13\npobeeeedaaaaa\n","24\naaaoo(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["0\n2130761060 2000000000 1\n","0\n1 1723177055 2000000000\n","12\nAnka likes Dracul\nDrac(...TRUNCATED) | 6 | 10 | {"language":[2,2,2,3,2,2,4,2,2,3,2,2,2,2,2,2,3,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,3,2,2,2,2(...TRUNCATED) | {"language":[2,2,2,2,2,2,4,2,1,4,2,2,2,2,2,2,2,4,2,4,2,2,2,2,2,2,2,4,2,3,2,2,1,2,4,2,2,2,2,2,4,2,2,1(...TRUNCATED) | 343 | 0 | 0 | [] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | ||||
582_A. GCD Table | "You are working for an amusement park as an operator of an obakeyashiki, or a haunted house, in whi(...TRUNCATED) | {
"input": [
"5 3 \n1 2 3 4 5\n2 1 5\n1 2 5\n2 1 5"
],
"output": [
"9 \n10"
]
} | {
"input": [],
"output": []
} | {"input":["4\ncbcc\n12\n4 b\n4 c\n1 b\n2 a\n3 b\n2 c\n4 a\n1 a\n2 b\n3 a\n1 b\n3 c\n","100\ndddddccc(...TRUNCATED) | 2 | 9 | {"language":[2,4,4,4,2,4,4,4,4,4,2,3,2,3,4,2,2,2,2,2,4,4,2,4,2,4,2,2,2,4,2,2,2,2,2,3,2,4,2,4,4,2,2,1(...TRUNCATED) | {
"language": [],
"solution": []
} | 1,354 | A | 0 | 2,500 | [
"*special",
"strings"
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | |||
39_H. Multiplication Table | "There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on(...TRUNCATED) | {
"input": [
"5 3 2\naaaaa\naaa\naab"
],
"output": [
"1 6"
]
} | {"input":["15\n0 1\n1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n7 8\n8 9\n9 10\n10 11\n11 12\n12 13\n13 14\n14 0\n(...TRUNCATED) | {"input":["3\n2 3\n3 6\n1 2\n3\n2 3\n3 5\n2 2\n0","3\n2 3\n3 6\n2 2\n3\n3 3\n3 6\n2 2\n0","3\n2 1\n3(...TRUNCATED) | 6 | 0 | {"language":[2,2,2,2,2,2],"solution":["#include <stdio.h>\n#include <stdlib.h>\n#include <assert.h>\(...TRUNCATED) | {"language":[3,2,2,2,2,1,2,2,2,4,1,2,3,4,2,2,3,1,2,2,2,2,2,3,2,1,4,3,2,4,3,1,2,4,3,2,4,3,2,3,2,2,4,2(...TRUNCATED) | 0 | C | 0 | 2,000 | [] | false | "E: マークアップ言語は衰退しました\n\nわたしたち人類がゆるやかな衰退(...TRUNCATED) | {
"nanos": 0,
"seconds": 2
} | 1,073,741,824 | ||
1088_D. Ehab and another another xor problem | "There are N people standing on the x-axis. Let the coordinate of Person i be x_i. For every i, x_i (...TRUNCATED) | {"input":["4\n2 1 2 3 4 3 2 6 1 1 2 2 1 2 3 2\n","1\n42\n","2\n1 1 1 1\n"],"output":["6 4 3 2 ","42 (...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["10\n75 995991040 148627929 566366239 458028006 823890903 945174886 530827147 546010999 72(...TRUNCATED) | 2 | 14 | {"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": []
} | 0 | 1,500 | 0 | [
""
] | false | null | 134,217,728 | ||||
1101_A. Minimum Integer | "You have a Petri dish with bacteria and you are preparing to dive into the harsh micro-world. But, (...TRUNCATED) | {"input":["4\n4 3 2 1\n2 3 4 1\n3\n1 2 3 4\n1 3 2 1\n1 4 2 3\n","3\n3 1 2\n3 2 1\n1\n1 2 3 3\n"],"ou(...TRUNCATED) | {
"input": [
"1\n3 3\n1 2\n2 3\n1 3"
],
"output": [
"2\n"
]
} | {
"input": [],
"output": []
} | 2 | 7 | {"language":[2,2,2],"solution":["#include<bits/stdc++.h>\nusing namespace std;\ndouble EPS=1e-9;\nst(...TRUNCATED) | {"language":[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,4,2,2,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2(...TRUNCATED) | 1,202 | F | 1,500 | 1,900 | [
"data structures",
"greedy",
"trees"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
536_C. Tavas and Pashmaks | "We know that lucky digits are digits 4 and 7, however Vasya's got another favorite digit 0 and he a(...TRUNCATED) | {"input":["+Mike\nMike:hello\n+Kate\n+Dmitry\n-Dmitry\nKate:hi\n-Kate\n","+Mike\n-Mike\n+Mike\nMike:(...TRUNCATED) | {"input":["5\n\n3 2 2\n2 0\n0 5\n\n4 3 2\n2 0 5\n0 6\n\n0 2 2\n1 0\n2 3\n\n5 4 4\n6 0 8 0\n0 7 0 9\n(...TRUNCATED) | {"input":["3\n230967221047542071272908186525868331398921682471308664253988778356539397562182960087 3(...TRUNCATED) | 2 | 9 | {"language":[1,1,1,1,1,1,1,1,1,1,1,1],"solution":["import math\nimport sys\ndef checkpal(s):\n re(...TRUNCATED) | {"language":[2,2],"solution":["#include <bits/stdc++.h>\n \n#define _overload(_1,_2,_3,name,...) nam(...TRUNCATED) | 500 | 0 | 2,100 | [
"brute force",
"implementation",
"strings"
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | ||||
chandu-and-daspal-2 | "Sherlock Holmes loves mind palaces! We all know that.\n\nA mind palace, according to Mr. Holmes is (...TRUNCATED) | {"input":["5\n8 5\n6 4\n4 3\n7 10\n0 10\n10\n10 5\n2 7\n9 7\n8 10\n10 2\n1 2\n8 1\n6 7\n6 0\n0 9\n5\(...TRUNCATED) | {"input":["1 0\n1 1 0\n1 446844829 77109657 780837560\n1 754808995 539371459\n","1 1\n1 1\n2 2 0\n1 (...TRUNCATED) | {"input":["3\n3 3\n1 -3 4\n1 5 2\n2 2\n-4 0\n1 2\n2 2\n0 1\n1 2\n","3\n3 3\n1 -3 4\n1 5 2\n2 2\n-2 0(...TRUNCATED) | 2 | 0 | {"language":[4,3,2,4,3,2,3,2,2,4,2,4,3,3,2,3,2,2,2,3,3,3,3,3,3,3,3,2,4,3,3,4,3,3,3,4,3,3,3,4,3,3,3,3(...TRUNCATED) | {"language":[2,2,2,2,2,3,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 1,311 | 0 | 0 | [
"binary search",
"bitmasks",
"combinatorics",
"data structures",
"divide and conquer"
] | true | "Problem\n\nKND君は会津大学に在籍する学生プログラマである。彼の住む町の(...TRUNCATED) | {
"nanos": 0,
"seconds": 1
} | 134,217,728 |
End of preview.
edition_1972_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