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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
309_B. Context Advertising | "Pink Floyd are pulling a prank on Roger Waters. They know he doesn't like [walls](https://www.youtu(...TRUNCATED) | {"input":["1\n-1\n0"],"output":["? 0 0\n? 536870912 0\n? 0 536870912\n? 805306368 536870912\n? 53687(...TRUNCATED) | {"input":["1 1 2 2\n1000000000 1000000000\n1\n","1 1 1000000000 1000000000\n100 1000000000\n1\n","1 (...TRUNCATED) | {"input":["2 2\n6 3\nMonday Tuesday Wednesday\n8 4\nThursday Friday Saturday Sunday\n2 2\n7 3\nMonda(...TRUNCATED) | 2 | 0 | {"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": [],
"solution": []
} | 0 | 2,500 | 2,100 | [
""
] | true | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | ||||
cdva1502 | "A Little Elephant from the Zoo of Lviv likes lucky strings, i.e., the strings that consist only of (...TRUNCATED) | {"input":["5 3\n00011\n3\n1 2 3\n1\n4\n3\n3 4 5\n","8 6\n00110011\n3\n1 3 8\n5\n1 2 5 6 7\n2\n6 8\n2(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["3\nnxx","3\nnwx","3\nxxo","3\nxwn","3\nowx","3\npxx","3\npyx","3\npzx","3\npzw","3\npwz",(...TRUNCATED) | 2 | 9 | {"language":[3,2,2,2,3,3,4,3,3,4,2,3,2,4,2,2,4,2,2,2,2,4,3,2,3,2,2,4,4,4,2,2,2,3,3,2,3,3,2,3,2,2,3,2(...TRUNCATED) | {"language":[2,0,2,2,2,2,2,1,2,2,2,2,2,2,2,1,2,2,2,2,0,2,0,0,2,0,0,0,4,1,2,2,0,2,0,0,2,2,2,0,2,2,2,2(...TRUNCATED) | 0 | 1,250 | 2,100 | [
"greedy",
"sortings"
] | false | {
"nanos": 500000000,
"seconds": 1
} | 512,000,000 | ||||
1081_G. Mergesort Strikes Back | "We are definitely not going to bother you with another generic story when Alice finds about an arra(...TRUNCATED) | {
"input": [
"3",
"100",
"1000000"
],
"output": [
"3",
"473",
"13969985"
]
} | {
"input": [],
"output": []
} | {"input":["3 9 1\n2 3 8","2 1000000000 1000000000\n1 199586132","3 9 3\n1 3 7","3 9 3\n1 0 7","2 100(...TRUNCATED) | 6 | 8 | {"language":[3,2,2,2,4,2,2,2,3,3,2,2,4,2,2,2,2,4,2,2,2,2,2,4,2,4,4,2,2,2,2,4,2,4,3,2,2,2,4,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,155 | B | 0 | 0 | [] | false | {
"nanos": 0,
"seconds": 2
} | 1,073,741,824 | |||
1320_F. Blocks and Sensors | "A rabbit is playing a role-playing game. Just before entering the castle, he was ambushed by an ene(...TRUNCATED) | {
"input": [
"2\n3\n10"
],
"output": [
"1\n3"
]
} | {"input":["3\n5 2\n5 3\n7 0\n5 0\n4 0\n10 0\n2 1\n10 100\n50 10\n5 5\n1 5\n2 4\n3 3\n4 2\n5 1\n"],"o(...TRUNCATED) | {"input":["5\n12\n5 4 4 3 2 2 1 1 1 1 1 1\n4\n4 3 2 1\n1\n1000000\n20\n20 19 18 17 16 15 14 13 12 11(...TRUNCATED) | 2 | 12 | {"language":[2,2,2,2,2,2,4,2,3,2,2,2,4,2,2,4,4,2,2,2,3,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":[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) | 519 | B | 2,000 | 2,500 | [
"data structures",
"greedy",
"two pointers"
] | false | "うさぎがある電車のチケットをn 枚持っている. チケットにはそれぞれ0 か(...TRUNCATED) | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | ||
663_A. Rebus | "Polycarp plays a computer game. In this game, the players summon armies of magical minions, which t(...TRUNCATED) | {"input":["6\n3 1\n3 2\n3 100\n4 3\n4 4\n5 2\n\nSAMPLE"],"output":["101\n121\n-1\n1313\n1414\n12121\(...TRUNCATED) | {"input":["7\n576460752303423487 2\n82 9\n101 104\n10 21\n31 10\n0 1\n10 30\n","1\n12881797281728299(...TRUNCATED) | {"input":["20\n9 4 8\n10 6 7\n4 6 0\n7 7 6\n3 6 10\n4 2 1\n4 4 0\n2 0 0\n8 8 7\n3 1 7\n3 10 7\n1 7 3(...TRUNCATED) | 6 | 0 | {"language":[4,3,2,2,2,2,2,4,2,2,2,2,2,4,4,2,4,2,2,2,2,2,2,2,2,1,4,4,4,2,4,2,3,4,2,2,4,4,4,2,3,4,4,2(...TRUNCATED) | {"language":[2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,1,4,2,2,2,2(...TRUNCATED) | 0 | E | 0 | 0 | [
"implementation"
] | false | null | 256,000,000 | |||
633_H. Fibonacci-ish II | "problem\n\nAOR Ika is studying to pass the test.\n\nAOR Ika-chan solved the $ N $ question. After t(...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\n1000000000000000000 352839520853234088 175235832528365792 753467583475385837 895062156(...TRUNCATED) | {"input":["16 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n9 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 1(...TRUNCATED) | 2 | 8 | {"language":[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,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | {"language":[2,2,2,2,2,2,2,2,2,4,2,4,2,1,2,2,1,2,1,4,4,2,2,2,2,2,2,2,1,2,2,2,1,2,2,2,2,4,2,3,4,2,2,2(...TRUNCATED) | 1,391 | 500 | 1,600 | [] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | ||||
laddu | "Leonard has decided to quit living with Dr. Sheldon Cooper and has started to live with Penny. Yes,(...TRUNCATED) | {"input":["6 8\nabdabc\n+ 1 a\n+ 1 d\n+ 2 b\n+ 2 c\n+ 3 a\n+ 3 b\n+ 1 c\n- 2\n","6 8\nabbaab\n+ 1 a\(...TRUNCATED) | {"input":["80\n72 66 82 46 44 22 63 92 71 65 5 30 45 84 29 73 9 90 25 19 26 15 12 29 33 19 85 92 91 (...TRUNCATED) | {"input":["81\n9 4\n6 8\n6 4\n4 6\n4 8\n9 10\n0 2\n5 4\n8 9\n7 7\n10 5\n4 4\n7 8\n3 7\n2 1\n5 5\n2 7(...TRUNCATED) | 3 | 8 | {"language":[2,2,2],"solution":["#include<bits/stdc++.h>\nusing namespace std;\n\nint N,K;\nint dp[2(...TRUNCATED) | {"language":[2,2,4,2,1,4,3,4,4,2,4,2,4,2,2,2,3,4,3,3,2,4,2,4,2,3,4,3,2,3,4,4,4,2,1,4,3,3,1,3,4,3,3,4(...TRUNCATED) | 0 | I | 500 | 2,200 | [
"math"
] | false | {
"nanos": 0,
"seconds": 3
} | 256,000,000 | |||
219_A. k-String | "Berland Government decided to improve relations with neighboring countries. First of all, it was de(...TRUNCATED) | {"input":["3 1 4\n","2 2 10\n","5 5 16808\n","1 4 10\n"],"output":["Stas\n\n","Masha\n\n","Masha\n\n(...TRUNCATED) | {"input":["2 1\n1000000000 1000000000\n2 1\n","3 2\n123 345 567\n1 2\n3 2\n","3 0\n4 1 4\n","3 2\n1 (...TRUNCATED) | {"input":["10\n3 1 278114804\n3 7 453886464\n8 7 830020662\n8 2 759298564\n9 2 147615930\n2 4 617310(...TRUNCATED) | 2 | 0 | {"language":[2,4,3,3,3,2,2,4,3,3,3,3,3,2,4,3,4,4,3,3,3,3,3,4,2,4,1,4,3,2,1,3,4,3,3,2,3,3,2,4,3,3,3,3(...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) | 0 | A | 0 | 0 | [
"math"
] | false | {
"nanos": 0,
"seconds": 1
} | 268,435,456 | |||
xenny-and-range-sums | "Chouti thought about his very first days in competitive programming. When he had just learned to wr(...TRUNCATED) | {
"input": [
"5\n5\n3\n2\n1\n4\n6\n1\n2\n3\n4\n5\n6\n3\n3\n2\n1\n0"
],
"output": [
"7\n0\n3"
]
} | {"input":["5\n81 125 16\n19683 15625 8192\n59049 15630 32768\n59050 78125 131072\n177147 390625 1310(...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) | 2 | 12 | {"language":[2,2,2,2,2,2,2,2,2,2],"solution":["#include <bits/stdc++.h>\nusing namespace std;\n#defi(...TRUNCATED) | {"language":[4,2,2,2,2,4,2,2,2,4,2,4,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,3,2,2,2,4,2,2,2,2,2,2,2(...TRUNCATED) | 0 | A | 0 | 2,300 | [
"constructive algorithms",
"math"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
brcktsrm | "Recently, Pari and Arya did some research about NP-Hard problems and they found the minimum vertex (...TRUNCATED) | {"input":["2\n3 1 9\n1 2 3\n1 1\n2 1\n3 1\n1 2\n2 2\n3 2\n1 3\n2 3\n3 3\n6 4 4\n6 5 4 3 1 2\n1 1\n3 (...TRUNCATED) | {
"input": [],
"output": []
} | {
"input": [],
"output": []
} | 5 | 9 | {"language":[3,2,2,4,3,4,4,3,3,3,2,1,1,2,3,2,4,4,3,4,3,4,3,2,3,4,1,3,1,3,3,3,1,2,3,1,2,4,3,4,1,3,3,3(...TRUNCATED) | {"language":[2,1,4,2,2,2,4,2,3,2,2,2,2,4,2,2,2,2,2,2,3,4,2,4,4,4,2,3,4,3,2,3,4,3,2,2,3,2,2,4,2,2,4,2(...TRUNCATED) | 1,208 | C | 500 | 0 | [
"greedy",
"strings"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 |
End of preview. Expand in Data Studio
edition_1931_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