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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
p01931 Check answers | "Nathan O. Davis is a student at the department of integrated systems. Today he learned digital quan(...TRUNCATED) | {
"input": [
"ACM"
],
"output": [
"0"
]
} | {"input":["10\n3\n-15 -33 79\n16\n45 -84 19 85 69 -64 93 -70 0 -53 2 -52 -55 66 33 -60\n2\n14 -2\n4\(...TRUNCATED) | {"input":["12\n161735902 211047202 430302156 450968417 628894325 707723857 731963982 822804784 88089(...TRUNCATED) | 3 | 7 | {"language":[2,2,2,2,2,4,2,2,2,4,2,2,2,2,4,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,2,2,2,2(...TRUNCATED) | {"language":[2,4,1,2,3,4,4,2,4,2,4,2,4,2,3,3,3,3,2,2,2,4,4,2,2,4,4,3,4,4,3,1,1,4,3,1,3,1,2,3,4,4,3,2(...TRUNCATED) | 687 | A | 0 | 1,500 | [
"graphs",
"shortest paths"
] | false | null | 256,000,000 | |||
chandu-and-his-girlfriend-returns | "Write a program which reads a sequence of integers $A = \\\\{a_0, a_1, ..., a_{n-1}\\\\}$ and swap (...TRUNCATED) | {
"input": [
"3 1 8 10\n10 8\n5 7\n11 9\n3\n",
"2 2 10 18\n10 4\n20 6\n5 3\n"
],
"output": [
"10\n",
"20\n"
]
} | {
"input": [],
"output": []
} | {"input":["3\n5\n5\n199\n","99\n3\n5\n7\n9\n11\n13\n15\n17\n19\n21\n23\n25\n27\n29\n31\n33\n35\n37\n(...TRUNCATED) | 1 | 13 | {"language":[2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,4,4(...TRUNCATED) | {"language":[2,4,0,2,2,0,2,2,2,2,2,2,2,2,2,2,2,4,2,0,2,2,2,4,2,2,2,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2,4(...TRUNCATED) | 724 | 2,500 | 0 | [] | false | {
"nanos": 0,
"seconds": 3
} | 536,870,912 | ||||
39_E. What Has Dirichlet Got to Do with That? | "Professor GukiZ doesn't accept string as they are. He likes to swap some letters in string to obtai(...TRUNCATED) | {"input":["3 3 10\n2 4 10\n3 3 9\n4 2 8\n","4 10 5\n1 1 1\n1 0 1\n0 5 8\n2 7 100\n"],"output":["2\n"(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["999 999\n1 1\n1 2\n2 1\n2 2\n1 3\n2 0\n<...>\n26 13\n26 14\n26 15\n26 16\n\n1 700 8(...TRUNCATED) | 5 | 11 | {"language":[2,2,4,4,4,4,4,3,2,2,3,2,2,3,2,4,2,2,2,4,2,2,4,4,2,2,4,2,4,3,2,2,2,2,2,3,2,2,2,2,2,2,4,2(...TRUNCATED) | {"language":[2,3,4,4,3,2,2,2,3,3,2,3,4,4,1,3,2,4,2,4,1,3,2,3,2,3,3,4,3,3,4,2,3,2,2,4,4,4,4,3,3,2,4,3(...TRUNCATED) | 0 | A | 0 | 800 | [
"math"
] | false | {
"nanos": 0,
"seconds": 2
} | 1,073,741,824 | |||
p02117 Picnic | "Pink Floyd are pulling a prank on Roger Waters. They know he doesn't like [walls](https://www.youtu(...TRUNCATED) | {"input":["1\n1 1 0 1 0 0 0 1 0 1\n3 4 5 6 7 8 9 -2 -3 4 -2","3\n1 1 1 1 1 1 0 0 1 1\n0 1 0 1 1 1 1 (...TRUNCATED) | {"input":["3 4\n1 1\n1 2\n1 3\n","1 100\n99 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22(...TRUNCATED) | {"input":["2 3\n1 0\n4 9\n","4 10\n2 2 2 1\n960 2596 3752 8303\n","6 10\n0 3 3 5 4 5\n4845 6494 579 (...TRUNCATED) | 2 | 7 | {"language":[2,4,4,2,4,2,4,2,4,4,2,2,4,4,2,2,3,4,4,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,2,2,2,2,4,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) | 1,281 | D | 500 | 2,200 | [
""
] | false | {
"nanos": 0,
"seconds": 2
} | 536,870,912 | |||
1149_B. Three Religions | "One day, Taro received a strange email with only the number \"519345213244\" in the text. The email(...TRUNCATED) | {"input":["5 2 4 13\nhhwhh\n","3 1 100 10\nwhw\n","5 2 4 1000\nhhwhh\n","4 2 3 10\nwwhw\n"],"output"(...TRUNCATED) | {"input":["50\n16 4\n17 9\n31 19\n22 10\n8 1\n40 30\n3 31\n20 29\n47 27\n22 25\n32 34\n12 15\n40 32\(...TRUNCATED) | {"input":["2\n3\n0\n","6\n2\n2\n2\n3\n1\n2\n","5\n1\n3\n3\n3\n3\n","1\n1\n","100\n2\n2\n1\n3\n1\n3\n(...TRUNCATED) | 2 | 9 | {"language":[1,1,1,1,1,1,1],"solution":["def power(x,m):\n\tglobal mod\n\tif m==0:\n\t\treturn 1\n\t(...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],"solut(...TRUNCATED) | 83 | 500 | 2,000 | [
""
] | false | {
"nanos": 0,
"seconds": 1
} | 0 | ||||
cdva1502 | "Manao works on a sports TV. He's spent much time watching the football games of some country. After(...TRUNCATED) | {"input":["1 1\n1\n1\n1\n2 1 100\n","4 6\n1 8 2 4\n3 3 6 1 5 2\n3\n1 1 1\n2 5 10\n1 1 6\n","1 1\n1\n(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["3\n","316240294332142860\n","1000001000000000000\n","1440563777463828705\n","5\n","8\n","(...TRUNCATED) | 2 | 2 | {"language":[2,4,4,4,4,4,4,2,4,4,2,2,4,4,3,3,1,4,4,3,2,2,3,4,4,2,2,4,4,4,4,2,2,4,2,2,2,2,2,2,2,4,2,4(...TRUNCATED) | {"language":[2,2,2,2,4,2,4,2,2,2,4,4,3,3,4,4,2,4,2,4,3,4,4,2,2,4,2,2,2,2,2,3,2,2,2,2,4,2,2,2,2,4,4,2(...TRUNCATED) | 0 | B | 0 | 1,600 | [
"constructive algorithms",
"math"
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | |||
list-sort | "Amr loves Geometry. One day he came up with a very interesting problem.\n\nAmr has a circle of radi(...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":["205078485761\n","873109054817\n","518649879439\n","401021537803\n","821985629174\n","6146(...TRUNCATED) | {
"input": [],
"output": []
} | 3 | 0 | {"language":[2,2,2,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,2,4,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | {"language":[3,2,2,2,4,2,3,2,4,1,4,3,4,4,4,4,3,3,3,4,4,2,4,3,2,3,3,3,2,2,3,2,2,4,2,4,4,3,2,4,2,1,2,4(...TRUNCATED) | 925 | B | 500 | 1,300 | [
"*special",
"implementation"
] | false | {
"nanos": 0,
"seconds": 1
} | 268,435,456 | |||
digital-numbers | "Bob came to a cash & carry store, put n items into his trolley, and went to the checkout counter to(...TRUNCATED) | {
"input": [
"3 5\n1 2 3\n1 3 2 3 1\n"
],
"output": [
"12\n"
]
} | {"input":["1 1\na\n10\n","1 20\naaaaaaaaaaaaaaaaaaaa\n924705 786913 546594 427698 741583 189683 3540(...TRUNCATED) | {"input":["30 1\n19 20 10 21 9 1 20 21 30 12 25 25 2 1 10 3 19 12 18 12 30 18 22 1 18 18 30 30 12\n"(...TRUNCATED) | 2 | 9 | {"language":[2,3,2,2,4,3,3,3,3,4,4,4,3,4,2,3,3,2,3,3,2,4,3,3,3,2,2,1,3,3,3,3,4,3,1,4,3,3,3,2,3,2,3,3(...TRUNCATED) | {"language":[4,1,3,2,2,4,2,4,2,4,3,1,4,3,1,2,4,4,2,1,2,4,2,2,2,2,4,2,1,2,3,2,4,4,3,4,2,2,2,3,2,2,4,1(...TRUNCATED) | 1,176 | 0 | 0 | [
"binary search",
"graphs",
"matrices"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | ||||
990_E. Post Lamps | "You have a string s — a sequence of commands for your toy robot. The robot is placed in some cell(...TRUNCATED) | {
"input": [
"3\n12 2\n200\n50\n300\n100"
],
"output": [
"37"
]
} | {"input":["0\n2000000000 2000000000 1\n","22\nCleo likes Snowy\nCleo likes Troll\nChapay likes Dracu(...TRUNCATED) | {"input":["1\n2 3 Chandu\n\nSBMPLE","1\n2 4 Chandu\n\nELPMBT","51\n8 10 Chandu\n2 2959 Daspal\n2903 (...TRUNCATED) | 2 | 8 | {"language":[2,4,3,4,4,4,1,3,3,2,4,3,2,3,1,3,3,4,4,4,3,2,4,2,3,2,3,2,2,2,2,3,2,1,1,1,4,2,3,4,4,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,4,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 0 | F | 1,000 | 0 | [
"brute force",
"sortings"
] | true | {
"nanos": 0,
"seconds": 2
} | 268,435,456 | |||
954_F. Runner's Problem | "Recently, Pari and Arya did some research about NP-Hard problems and they found the minimum vertex (...TRUNCATED) | {"input":["3\n1 0 1\n0 0 0\n","2\n1 4\n2 3\n","3\n0 0 0\n0 0 0\n"],"output":["0 0 1 \n1 0 0 ","1 3\n(...TRUNCATED) | {"input":["3 1 2\n2\n1 1\n","3 1 2\n1\n8 61\n","3 0 3\n\n334 500 1001\n","20 16 16\n1 2 3 4 5 6 8 9 (...TRUNCATED) | {"input":["1 3 0\n6 1 4\n","21 6 635\n3 4 2 1 7 7\n","3 7 20012\n1 1 1 1 1 2 10000\n","1 5 44\n2 19 (...TRUNCATED) | 2 | 10 | {"language":[2],"solution":["#include <algorithm>\n#include <cassert>\n#include <climits>\n#include (...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) | 0 | 0 | 0 | [
"binary search",
"dp",
"sortings",
"two pointers"
] | true | {
"nanos": 0,
"seconds": 2
} | 256,000,000 |
End of preview. Expand in Data Studio
edition_0903_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
- 16