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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1281_B. Azamon Web Services | "Rakesh have learn about vowel in school and is given an assignment by his teacher in which he has t(...TRUNCATED) | {
"input": [
"100 5\n1\n23\n45\n67\n89",
"10 2\n4\n5",
"6 1\n3"
],
"output": [
"608200469",
"0",
"4"
]
} | {"input":["2\n2 2\nyz\n1 1\n2 2\nyz\n1 1\n","1\n11 2\nthisisatest\n3 5\n"],"output":["0 0 0 0 0 0 0 (...TRUNCATED) | {"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) | 2 | 8 | {"language":[3,3,3,3,3,3,3,3,4,3,3,3,3,3,3,2,3,4,3,3,3,3,3,3,3,3,3,2,3,3,3,3,2,3,3,3,3,3,3,3,2,3,4,3(...TRUNCATED) | {"language":[2,2,2,0,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,0,0,0,2,0,2,2,2,2,0,2,2,0,2,2,0,2,2,2,2,0,2,0,2,2(...TRUNCATED) | 1,354 | D | 2,000 | 2,500 | [
""
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
battle-of-stalingrad-1 | "You're given a simple, undirected, connected, weighted graph with n nodes and m edges.\n\nNodes are(...TRUNCATED) | {"input":["4\nsword weapon 10 2 3 2\npagstarmor armor 0 15 3 1\niceorb orb 3 2 13 2\nlongbow weapon (...TRUNCATED) | {"input":["5\n42\n17\n444\n7\n51\n"],"output":[" (...TRUNCATED) | {"input":["5\n2 8 1 7 9\n","4\n6 2 4 5\n","3\n3 1 3\n","200\n2 1 1 1 2 1 2 1 1 1 2 1 2 2 2 1 1 2 1 2(...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":[2,2,2,3,2,4,3,2,2,2,2,2,2,3,4,2,2,2,0,2,0,2,2,2,2,2,3,2,2,2,2,2,0,2,2,2,2,2,2,4,2,1,1,3(...TRUNCATED) | 814 | B | 0 | 0 | [
"data structures",
"greedy",
"trees"
] | false | {
"nanos": 0,
"seconds": 2
} | 0 | |||
p03052 diverta 2019 Programming Contest - Edge Ordering | "You are given a tree with n vertices; its root is vertex 1. Also there is a token, initially placed(...TRUNCATED) | {
"input": [
"3\n3\n5\n199\n"
],
"output": [
"1.931851653\n3.196226611\n126.687663797\n"
]
} | {"input":["8\n1 2\n1 3\n1 4\n1 5\n2 6\n2 7\n2 8\n","9\n9 2\n9 3\n9 4\n9 5\n2 6\n5 7\n7 8\n7 1\n","9\(...TRUNCATED) | {"input":["7 4\n-10 -4 -2 0 2 4 10","16 19\n-49 -48 -33 -30 -21 -14 0 15 19 23 44 55 80 81 82 84","3(...TRUNCATED) | 2 | 7 | {"language":[3,4,3,3,3,1,3,3,3,3,3,3,3,4,3,1,2,4,3,2,3,3,3,4,3,3,3,2,1,3,3,3,1,3,2,4,3,3,2,3,1,4,4,3(...TRUNCATED) | {"language":[2,2,2,2,0,2,0,2,2,2,2,2,0,2,0,1,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,0,2,2(...TRUNCATED) | 851 | B | 2,500 | 2,400 | [
"bitmasks",
"dp",
"graphs",
"trees"
] | false | {
"nanos": 0,
"seconds": 2
} | 0 | |||
even-from-end-1 | "Your math teacher gave you the following problem:\n\nThere are n segments on the x-axis, [l_1; r_1](...TRUNCATED) | {
"input": [
"2\n1\n3\n\nSAMPLE"
],
"output": [
"1\n26\n"
]
} | {
"input": [],
"output": []
} | {"input":["3\nAZAMON APPLE\nAZOMAN AAAAAAAAAAALIBABA\nAPPLE BANANA\n","3\nAZAMNO ELPPA\nAZAMON AAAAA(...TRUNCATED) | 3 | 9 | {"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,4,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,4,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],"solution":[(...TRUNCATED) | 1,211 | D | 0 | 2,400 | [
""
] | false | null | 1,073,741,824 | |||
1540_C1. Converging Array (Easy Version) | "Given the value of n, print the n'th prime number.\n\nInput : A single integer n. \nOutput : A sing(...TRUNCATED) | {
"input": [
"4\n6 6 5 5\n",
"5\n1 2 3 1 3\n",
"4\n6 6 4 4\n"
],
"output": [
"0",
"4",
"-8"
]
} | {
"input": [],
"output": []
} | {"input":["1\n2 2\n1 1\n1 3\n","1\n1 3\n3\n1 2 0\n","5\n4 5\n10 8 6 4\n1 2 3 4 5\n1 1\n3\n3\n1 1\n3\(...TRUNCATED) | 3 | 10 | {"language":[1,2,4,2,3,3,3,4,3,3,4,3,4,2,3,3,4,4,2,3,4,2,4,4,2,3,3,2,2,1,3,3,3,3,2,4,3,4,4,4,3,3,3,2(...TRUNCATED) | {"language":[2,4,2,2,2,3,4,2,2,2,4,1,4,2,4,1,4,2,2,2,2,2,2,4,2,2,2,2,2,2,2,4,4,2,2,4,2,2,1,2,2,2,2,2(...TRUNCATED) | 0 | 0 | 0 | [
"combinatorics",
"number theory"
] | false | null | 256,000,000 | ||||
560_D. Equivalent Strings | "Given integer n, find length of n! (which is factorial of n) excluding trailing zeros.\n\nInput\n\n(...TRUNCATED) | {
"input": [
"4\n1 14\n1 50\n4 28\n5 700\n\nSAMPLE"
],
"output": [
"1\n10\n3\n32491"
]
} | {
"input": [
"aaaa a",
"abcd cb",
"a abab"
],
"output": [
"4\n",
"0\n",
"0\n"
]
} | {"input":["25\n91 57\n2 73\n54 57\n2 57\n23 57\n2 6\n57 54\n57 23\n91 54\n91 23\n57 23\n91 57\n54 2\(...TRUNCATED) | 3 | 0 | {"language":[1,1,1,1,1],"solution":["n = input()\nfor i in range(n):\n str = raw_input()\n l =(...TRUNCATED) | {"language":[3,3,4,3,2,3,1,4,4,3,2,4,3,4,2,2,2,2,2,3,4,4,4,2,4,4,2,3,3,2,2,3,4,3,3,3,2,4,3,2,3,3,1,2(...TRUNCATED) | 1,466 | 1,250 | 1,600 | [] | false | {
"nanos": 0,
"seconds": 1
} | 512,000,000 | ||||
1110_E. Magic Stones | "You are given a square matrix of size n (it will be an odd integer). Rows are\nindexed 0 to n-1 fro(...TRUNCATED) | {
"input": [
"1\n4 5\n9 7 5 3\n8 6 4 2 0\n\nSAMPLE"
],
"output": [
"9 8 7 6 5 4 3 2 0\n"
]
} | {"input":["10 1\n1 1 1 1 1 1 1 1 1 1\n","3 57\n78 165 54\n","1 1\n10000\n","2 2\n2 2\n","9 13\n132 8(...TRUNCATED) | {
"input": [],
"output": []
} | 3 | 10 | {"language":[3,2,3,1,2,3,3,3,4,4,2,3,1,2,3,1,3,1,1,3,4,3,4,2,3,2,4,3,3,1,2,3,3,2,3,1,3,1,2,4,3,3,4,3(...TRUNCATED) | {"language":[4,1,4,4,2,4,4,2,4,1,3,2,3,4,3,3,3,2,2,2,4,3,3,2,4,3,1,3,3,3,2,4,3,3,1,3,3,2,2,1,4,1,2,4(...TRUNCATED) | 0 | F | 500 | 0 | [
"combinatorics",
"dfs and similar",
"dsu",
"graphs"
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | |||
1398_A. Bad Triangle | "Given an integer n and a permutation of numbers 1, 2 ... , n-1, n write a program to print the perm(...TRUNCATED) | {
"input": [
"2\n3 1 1 5\n1 6 9\n3 2 6 7\n1 6 9"
],
"output": [
"38\n36"
]
} | {"input":["384\n87 78 16 94 36 87 93 50 22 63 28 91 60 64 27 41 27 73 37 12 69 68 30 83 31 63 24 68 (...TRUNCATED) | {
"input": [],
"output": []
} | 2 | 0 | {"language":[3,4,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,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | {"language":[2,3,3,2,3,2,3,2,3,3,2,3,3,3,2,2,3,3,3,2,3,0,3,2,3,3,2,2,2,3,3,0,2,2,0,3,3,3,0,2,3,2,3,3(...TRUNCATED) | 507 | 1,000 | 1,400 | [
"math"
] | false | {
"nanos": 0,
"seconds": 1
} | 512,000,000 | ||||
p03612 AtCoder Beginner Contest 072 - Derangement | "In the rush of modern life, people often forget how beautiful the world is. The time to enjoy those(...TRUNCATED) | {"input":["4\n3 3\n1 2\n2 3\n3 1\n3 6\n1 2\n2 1\n2 3\n3 2\n1 3\n3 1\n7 10\n1 2\n2 3\n3 1\n1 4\n4 5\n(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["2\n1 1 1 1 1 0 0 0 0 0\n0 0 0 0 0 1 1 1 1 1\n0 -2 -2 -2 -2 -2 -1 -1 -1 -1 -1\n0 -2 -2 -2 (...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,4,2,2,2,2,2,2(...TRUNCATED) | {
"language": [],
"solution": []
} | 1,257 | 0 | 2,300 | [
"binary search",
"geometry",
"two pointers"
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | ||||
p01422 Beautiful Currency | "We have a string X, which has an even number of characters. Half the characters are `S`, and the ot(...TRUNCATED) | {"input":["6 5\n20 15 10 15 20 25\n","7 1\n101 53 42 102 101 55 54\n","7 1000000\n1 1 1 1 1 1 1\n"],(...TRUNCATED) | {"input":["5 3\n","1500 2000\n","500 1000\n","1000 1000\n","5 5\n","2000 2\n","1000 500\n","3 1000\n(...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 1 1 2 1\n4 10\n5 1 3 4\n1 2 1(...TRUNCATED) | 2 | 7 | {"language":[2,4,2,2,2,2,2,2,2,2,2,2,2,2,1,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,4(...TRUNCATED) | {"language":[2,2,2,0,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,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 0 | C | 0 | 0 | [
""
] | false | "Problem\n\n$n$枚のカードからなる束があり、下から$i$番目のカードには$i$が(...TRUNCATED) | {
"nanos": 0,
"seconds": 2
} | 256,000,000 |
End of preview. Expand in Data Studio
edition_1124_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