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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1037_B. Reach Median | "Sarah is a girl who likes reading books.\n\nOne day, she wondered about the relationship of a famil(...TRUNCATED) | {
"input": [
"4\n2 10\n0 20\n1 5\n1 3\n",
"3\n0 1\n0 10\n0 100\n"
],
"output": [
"8",
"111"
]
} | {
"input": [],
"output": []
} | {"input":["10\n1\n248618\n3\n12 10 8\n6\n100 11 15 9 2 8\n4\n0 1 1 0\n2\n0 0\n2\n0 1\n2\n1 0\n2\n1 1(...TRUNCATED) | 6 | 0 | {"language":[1,2,2,2,2,4,4,4,3,2,4,2,4,2,4,2,3,2,2,2,3,4,2,1,3,2,3,4,3,2,1,4,3,2,2,2,1,2,4,2,4,4,2,2(...TRUNCATED) | {"language":[2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 0 | C | 500 | 0 | [
""
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
p00493 Zig-Zag Numbers | "E --Disappear Drive\n\nStory\n\nThe person in D likes basketball, but he likes shooting, so other t(...TRUNCATED) | {
"input": [
"1000 352 146\n",
"10 1 14\n",
"20 10 50\n"
],
"output": [
"1108\n",
"1\n",
"0\n"
]
} | {"input":["100 10000\n337491026 878382762 942177429 998998997 292784016 407647544 813626083 20338593(...TRUNCATED) | {
"input": [],
"output": []
} | 5 | 9 | {"language":[2,2,3,2,2,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,2,2,4(...TRUNCATED) | {"language":[4,2,2,2,1,2,2,2,2,2,2,4,2,2,4,2,4,3,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2,0,4,2(...TRUNCATED) | 147 | E | 1,000 | 1,600 | [
"data structures",
"dfs and similar",
"dp",
"graphs",
"greedy",
"trees"
] | false | {
"nanos": 0,
"seconds": 2
} | 0 | |||
1398_A. Bad Triangle | "As technologies develop, manufacturers are making the process of unlocking a phone as user-friendly(...TRUNCATED) | {
"input": [
"3\n2\n<>\n3\n><<\n1\n>\n"
],
"output": [
"0\n0\n0\n"
]
} | {"input":["7\n","2000000000000000000\n","1000000000000000000\n","987654321012345678\n"],"output":["2(...TRUNCATED) | {"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 | 8 | {"language":[1],"solution":["for _ in xrange(input()):\n n= input()\n a=map(int,raw_input().sp(...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,269 | D | 0 | 1,100 | [
"brute force",
"implementation"
] | false | {
"nanos": 0,
"seconds": 5
} | 0 | |||
343_B. Alternating Current | "Mister B once received a gift: it was a book about aliens, which he started read immediately. This (...TRUNCATED) | {"input":["22\n0011223344556677889988\n","11\n00000000008\n","11\n31415926535\n"],"output":["2\n","1(...TRUNCATED) | {"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) | {"input":["6\n3\n60\n100\n1024\n23456\n8735373\n\nELPMAS","6\n5\n60\n100\n1024\n23456\n8735373\n\nEL(...TRUNCATED) | 5 | 12 | {"language":[2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,4,2,2,4,2,4,2,4,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2(...TRUNCATED) | {"language":[2,2,2,2,4,2,2,2,2,2,2,1,4,3,2,2,2,2,2,1,2,3,2,2,2,4,4,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 980 | 1,750 | 1,400 | [
"dp",
"greedy",
"strings"
] | false | {
"nanos": 0,
"seconds": 3
} | 536,870,912 | ||||
1037_E. Trips | "A string is called a k-string if it can be represented as k concatenated copies of some string. For(...TRUNCATED) | {
"input": [
"3 2\n3\n1 2 1\n2 3 2\n3 3 1"
],
"output": [
"1"
]
} | {"input":["100\n0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 (...TRUNCATED) | {"input":["10 7\n3 4\n8 6\n7 8\n3 1\n9 10\n10 6\n9 4\n","10 16\n9 8\n1 2\n9 5\n5 4\n9 2\n3 2\n1 6\n5(...TRUNCATED) | 6 | 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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | {"language":[2,2,3,2,2,2,2,2,4,4,4,2,4,2,4,2,2,3,2,2,2,2,2,2,4,4,2,3,2,2,4,2,2,2,2,2,2,3,2,4,4,2,2,4(...TRUNCATED) | 1,165 | A | 500 | 0 | [
"implementation"
] | false | {
"nanos": 0,
"seconds": 2
} | 268,435,456 | |||
p03013 AtCoder Beginner Contest 129 - Typical Stairs | "The time has arrived when the world is going to end. But don't worry, because the new world yuga wi(...TRUNCATED) | {
"input": [
"1\n2 3 Chandu\n\nSAMPLE"
],
"output": [
"Daspal\n"
]
} | {
"input": [],
"output": []
} | {"input":["8\n0 1\n1 0\n0 1\n1 1\n0 0\n1 0\n0 1\n1 0\n","3\n0 1\n1 1\n1 0\n","8\n0 1\n1 1\n0 1\n1 1\(...TRUNCATED) | 2 | 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,2,2,2,2,2,2,2,2],"solut(...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,2,2,2,2,2,2,4,2,2,2,2,2,2,3,2,4,2,2(...TRUNCATED) | 925 | D | 1,000 | 0 | [
""
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
425_A. Sereja and Swaps | "Print the circumference of a circle of radius R.\n\nConstraints\n\n* 1 \\leq R \\leq 100\n* All val(...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": [],
"output": []
} | {"input":["10000 01000 00100 11000 01100 11111 01110 11100 10110 11110\n10101 01000 00000 11001 0110(...TRUNCATED) | 2 | 0 | {"language":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1(...TRUNCATED) | {"language":[4,4,4],"solution":["import java.io.IOException;\nimport java.io.InputStream;\nimport ja(...TRUNCATED) | 1,189 | A | 0 | 2,300 | [] | false | {
"nanos": 500000000,
"seconds": 0
} | 256,000,000 | |||
1361_E. James and the Chase | "You are given a permutation of the numbers 1, 2, ..., n and m pairs of positions (aj, bj).\n\nAt ea(...TRUNCATED) | {
"input": [
"3\n6 4 1\n",
"4\n20 6 3 4\n"
],
"output": [
"0\n",
"2\n"
]
} | {"input":["3 3 1\n","300 2 300\n","4000 4000 1\n","4000 4000 100\n","4 2 3\n","3 300 300\n","4000 10(...TRUNCATED) | {"input":["5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\(...TRUNCATED) | 6 | 11 | {"language":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"solution":["for _ i(...TRUNCATED) | {"language":[2,2,2,2,4,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,2,2,2(...TRUNCATED) | 366 | E | 0 | 800 | [
"bitmasks",
"dp",
"graphs",
"trees"
] | false | null | 0 | |||
p01353 Rabbit Plays Games! | "Julia is conducting an experiment in her lab. She placed several luminescent bacterial colonies in (...TRUNCATED) | {"input":["7\nbabba\nabaac\ncodeforces\nzeroorez\nabcdcba\nbbbbbbb\na\n"],"output":["\n1\n1\n0\n1\n1(...TRUNCATED) | {
"input": [],
"output": []
} | {
"input": [],
"output": []
} | 2 | 7 | {"language":[3,4,3,1,3,1,2,3,4,3,3,2,3,2,4,3,2,2,2,1,1,2,3,3,3,3,3,2,4,4,4,2,4,4,2,4,3,3,4,1,3,4,1,2(...TRUNCATED) | {"language":[4,4,2,1,2,3,2,4,3,4,3,3,4,2,3,3,3,3,2,4,3,3,3,4,4,2,3,2,3,4,2,2,2,4,2,3,2,3,4,3,2,3,3,3(...TRUNCATED) | 578 | A | 0 | 3,500 | [
""
] | false | {
"nanos": 0,
"seconds": 5
} | 256,000,000 | |||
p00781 Lattice Practices | "Your friend Jeff Zebos has been trying to run his new online company, but it's not going very well.(...TRUNCATED) | {"input":["5\n5 7\n5 3 2 1 4\n2 1 1 2 1\n1 3\n2\n1\n5 10\n2 3 2 3 2\n1 2 1 2 1\n4 10\n5 1 3 4\n1 2 1(...TRUNCATED) | {"input":["1 1\n1\n2\n","6 3\n1 2 3 4 5 6\n3 5 1\n","5 5\n5 6 3 2 1\n4 3 1 5 6\n","1 1\n1\n1\n","10 (...TRUNCATED) | {"input":["5 3\n00011\n3\n1 2 3\n1\n4\n3\n2 4 5\n","1 1\n0\n1\n1\n","1 0\n1\n1\n1\n","8 6\n00100011\(...TRUNCATED) | 2 | 2 | {"language":[2,2,2],"solution":["#include<bits/stdc++.h>\nusing namespace std;\ndouble EPS=1e-9;\nst(...TRUNCATED) | {"language":[4,4,3,3,1,1,1,3,2,4,2,3,2,4,1,3,1,4,4,2,4,4,2,1,3,2,2,4,1,2,4,2,3,4,4,3,3,4,3,3,4,2,3,4(...TRUNCATED) | 0 | B | 0 | 0 | [
"math",
"probabilities"
] | false | "うさぎがある電車のチケットをn 枚持っている. チケットにはそれぞれ0 か(...TRUNCATED) | {
"nanos": 0,
"seconds": 1
} | 256,000,000 |
End of preview. Expand in Data Studio
edition_0706_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
- 6