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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1424_N. BubbleSquare Tokens | "You are given an undirected graph consisting of n vertices and <image> edges. Instead of giving you(...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":["7879 2590 2818\n","78 28 27\n","9178 2255 7996\n","6571 6449 8965\n","6151 6148 3746\n","(...TRUNCATED) | {"input":["4 0 1\n1 -1\n1 3\n3 3\n3 -1\n","3 0 0\n-10 1\n1 2\n1 1\n","20 -999719 -377746\n-999718 -3(...TRUNCATED) | 6 | 0 | {"language":[2,2,2,2,4,2,2,2,4,4,4,2,4,4,2,2,4,2,4,4,2,2,4,4,2,2,2,2,4,2,4,4,2,2,2,2,2,2,2,4,2,4,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) | 290 | 0 | 800 | [
"constructive algorithms",
"dp",
"flows",
"graph matchings",
"greedy",
"sortings"
] | false | {
"nanos": 0,
"seconds": 8
} | 0 | ||||
691_D. Swaps in Permutation | "Some time ago Mister B detected a strange signal from the space, which he started to study.\n\nAfte(...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":["4\n10 4\n15 1\n19 3\n20 1\n","2\n1 999999999\n1000000000 1000000000\n","67\n1 1\n3 8\n4 1(...TRUNCATED) | {"input":["4\nlu ru ld rd\n4\nlu ld lu ru\n0\nlu\n10\nru lu ld rd ru rd ru lu rd ld\n0","4\nlu ru ld(...TRUNCATED) | 2 | 11 | {"language":[2,2,4,2,3,2,2,2,4,2,4,3,2,4,2,2,2,1,2,2,2,2,2,2,4,2,3,2,2,2,2,1,3,4,4,2,2,2,2,2,2,2,2,4(...TRUNCATED) | {"language":[2,2,2,2,2,4,2,2,1,4,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,4,2,2,2(...TRUNCATED) | 0 | A | 0 | 0 | [
""
] | false | {
"nanos": 0,
"seconds": 6
} | 256,000,000 | |||
p01219 Private Teacher | "Vasya wants to turn on Christmas lights consisting of m bulbs. Initially, all bulbs are turned off.(...TRUNCATED) | {
"input": [
"10\n2 3 1 5 6 4 2 10 7 7\n5\n10 1\n5 7\n10 6\n1 1\n10 8\n"
],
"output": [
"3\n0\n1\n1\n0\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":["4\nSSSSEEEECCCCEECCCC\nCCCCCSSSSEEECCCCSS\nSCCCCCCCSSEEESSSSS\nEESSSSCCCCCCSSEEEESAMPLE",(...TRUNCATED) | 2 | 12 | {"language":[4,1,4,3,3,3,3,4,3,2,3,2,3,3,3,3,4,3,2,3,3,2,2,2,2,2,3,4,3,4,2,1,4,3,2,2,2,3,2,4,3,2,3,3(...TRUNCATED) | {"language":[2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,4,4,2,2,2,2,2,4,2,2,2,4,2,2,2,2,4,2,2,2,2,2,2,2,2(...TRUNCATED) | 272 | 2,000 | 0 | [
""
] | false | {
"nanos": 0,
"seconds": 8
} | 256,000,000 | ||||
etmx05 | "You've got array A, consisting of n integers and a positive integer k. Array A is indexed by intege(...TRUNCATED) | {"input":["7 6 6\n3 2\n1 7\n5 7\n3 7\n6 4\n8 9\n8 5\n","5 2 2\n1 1\n4 1\n2 3\n3 2\n3 4\n"],"output":(...TRUNCATED) | {"input":["5 5\n-993655555 -758584352 -725954642 -696391700 -649643547\n-591473088 -568010221 -43211(...TRUNCATED) | {"input":["4 4","1 15","2 4","2 15","3 0","2 26","3 -1","2 32","0 -1","1 32","0 -2","1 17","-1 -2","(...TRUNCATED) | 2 | 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,1,1,1,1,1,1,1,1,1,1,1(...TRUNCATED) | {"language":[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,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 1,497 | 2,000 | 0 | [
"implementation"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | ||||
124_D. Squares | "The Smart Beaver from ABBYY began to develop a new educational game for children. The rules of the (...TRUNCATED) | {
"input": [
"-++-\n",
"++\n",
"+-\n",
"-\n"
],
"output": [
"YES\n",
"YES\n",
"NO\n",
"NO\n"
]
} | {
"input": [],
"output": []
} | {"input":["10\n75 995991040 148627929 566366239 458028006 823890903 945174886 530827147 546010999 72(...TRUNCATED) | 2 | 0 | {
"language": [],
"solution": []
} | {"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) | 886 | D | 0 | 0 | [
""
] | false | {
"nanos": 0,
"seconds": 2
} | 134,217,728 | |||
1088_D. Ehab and another another xor problem | "BCPC stands for Byteforces Collegiate Programming Contest, and is the most famous competition in By(...TRUNCATED) | {
"input": [
"3\n6 4 1\n",
"4\n20 6 3 4\n"
],
"output": [
"0\n",
"2\n"
]
} | {"input":["1\n2\n999999997 999999998\n999999999 1000000000\n","4\n1\n1 1000000000\n5\n1 1\n12 18\n10(...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 | 0 | {"language":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"solution":["_ = int(raw_input())\nfor __ in range(...TRUNCATED) | {
"language": [],
"solution": []
} | 44 | D | 0 | 0 | [
"brute force",
"greedy"
] | false | {
"nanos": 0,
"seconds": 8
} | 256,000,000 | |||
1466_F. Euclid's nightmare | "Tavas is a cheerleader in the new sports competition named \"Pashmaks\".\n\n<image>\n\nThis competi(...TRUNCATED) | {
"input": [
"5\n0 0\n2 0\n1 1\n2 2\n0 2",
"4\n0 0\n3 1\n2 3\n0 3"
],
"output": [
"0",
"1"
]
} | {"input":["3\n7\n4 6 11 11 15 18 20\n4\n10 10 10 11\n3\n1 1 1000000000\n","1\n6\n1 1 1 2 2 3\n","1\n(...TRUNCATED) | {"input":["8 12\n1 2\n2 3\n4 5\n5 6\n6 7\n7 8\n1 4\n4 7\n2 5\n5 8\n3 6\n6 9\n","7 3\n3 2\n2 1\n1 4\n(...TRUNCATED) | 2 | 8 | {"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,2,2,2,2,3,4,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,4,2,3,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 0 | 0 | 1,200 | [
"math"
] | true | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | ||||
309_B. Context Advertising | "An established group of scientists are working on finding solution to NP hard problems. They claim (...TRUNCATED) | {
"input": [
"3 1 2 3\n",
"1 3 2 3\n"
],
"output": [
"5\n",
"4\n"
]
} | {
"input": [],
"output": []
} | {"input":["2\n1\n4","2\n2\n4","2\n2\n1","2\n0\n1","2\n0\n2","2\n2\n2","2\n4\n2","2\n2\n3","2\n3\n2",(...TRUNCATED) | 2 | 7 | {"language":[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,4,2,2,2,2,2,2,2,2,2,4,4,2,2(...TRUNCATED) | {"language":[1,2,4,1,4,3,2,2,3,4,2,4,2,1,1,3,4,3,4,4,2,3,1,3,4,3,3,4,4,2,3,2,4,1,4,2,3,3,1,4,2,2,4,2(...TRUNCATED) | 0 | C | 0 | 1,500 | [
""
] | false | {
"nanos": 0,
"seconds": 2
} | 0 | |||
1110_E. Magic Stones | "After playing Neo in the legendary \"Matrix\" trilogy, Keanu Reeves started doubting himself: maybe(...TRUNCATED) | {"input":["5\n1 2\n2 1\n5 10\n10 9\n20 1\n","5\n1 2\n2 1\n5 10\n10 9\n19 1\n"],"output":["4\n","3\n"(...TRUNCATED) | {"input":["10 20 10 5\n","20 1 2 3\n","7 2 2 2\n","25 10 5 10\n","999 999 899 299\n","10000 5000 0 5(...TRUNCATED) | {"input":["10\n669924290 408119795 283272835\n663737793 250734602 29671646\n431160679 146708815 2894(...TRUNCATED) | 2 | 0 | {"language":[4,3,4,4,3,3,3,3,3,3,3,4,4,3,3,3,4,3,3,3,3,2,2,3,2,3,3,4,3,2,3,4,2,4,3,4,3,3,3,3,3,4,3,3(...TRUNCATED) | {"language":[4,3,3,4,4,4,2,2,4,4,4,2,4,2,2,2,2,2,1,2,4,2,2,2,2,2,3,4,2,4,2,2,2,4,4,2,2,4,1,4,2,2,2,2(...TRUNCATED) | 361 | B | 1,000 | 0 | [
"data structures",
"greedy"
] | false | {
"nanos": 0,
"seconds": 2
} | 1,073,741,824 | |||
p03771 AtCoder Grand Contest 012 - Camel and Oases | "Linda likes to change her hair color from time to time, and would be pleased if her boyfriend Archi(...TRUNCATED) | {"input":["ababababa\n3\n2 1 7 aba\n1 5 c\n2 1 7 aba\n","abcdcbc\n5\n2 1 7 bc\n1 4 b\n2 4 7 bc\n1 2 (...TRUNCATED) | {
"input": [],
"output": []
} | {"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) | 2 | 0 | {"language":[2,2,3,3,1,3,4,3,2,2,4,3,2,4,2,4,4,4,3,3,2,4,3,2,2,2,3,2,3,4,2,3,2,2,4,4,3,3,2,3,4,3,3,2(...TRUNCATED) | {"language":[4,2,3,2,4,2,2,4,4,2,2,2,1,2,2,2,4,2,3,4,2,4,2,4,2,4,2,1,2,3,2,2,2,1,4,3,2,4,2,2,4,4,2,2(...TRUNCATED) | 1,490 | 0 | 2,100 | [
""
] | true | {
"nanos": 0,
"seconds": 4
} | 256,000,000 |
End of preview. Expand in Data Studio
edition_0529_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
- 5