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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1129_A2. Toy Train | You are given a set of points on a straight line. Each point has a color assigned to it. For point a, its neighbors are the points which don't have any other points between them and a. Each point has at most two neighbors - one from the left and one from the right.
You perform a sequence of operations on this set of p... | {
"input": [
"5 0\n3 14 15 92 6\n",
"3 1\n1 2 3\n"
],
"output": [
"3 14 15 92 6 ",
"1 3 6 "
]
} | {
"input": [],
"output": []
} | {
"input": [
"3\nAZAMON APPLE\nAZOMAN AAAAAAAAAAALIBABA\nAPPLE BANANA\n",
"3\nAZAMNO ELPPA\nAZAMON AAAAAAAAAAALIBABA\nAPPLE BANANA\n",
"3\nAZAMON APPLE\nAZAMON AAAAAAAAAAALIBABA\nAPPLF ANANAB\n",
"3\nAZAMON ALPPE\nAZOMAN AAAAAAAAAAALIBABA\nEPPLA BANANA\n",
"3\nAZAMON ALPPE\nAZOMAN AAAAAAAAAAALIBAB... | 3 | 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,
... | {
"language": [],
"solution": []
} | 260 | 0 | 1,400 | [] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | ||||
687_D. Dividing Kingdom II | "Draw a chessboard which has a height of H cm and a width of W cm. For example, the following figure(...TRUNCATED) | {"input":["+Mike\nMike:hello\n+Kate\n+Dmitry\n-Dmitry\nKate:hi\n-Kate\n","+Mike\n-Mike\n+Mike\nMike:(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["2 5 1\n0 4 6\n0 2 7\n","1 1 1000000000\n0 0 1\n","5 200 10\n1 1 1\n1000000000 200 1000000(...TRUNCATED) | 5 | 7 | {"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,4,2,2,2,2,2,2,2,2(...TRUNCATED) | {"language":[1,3,2,2,2,4,4,2,2,2,2,2,2,2,4,2,2,4,2,2,2,2,2,4,4,2,4,3,1,2,1,2,1,2,4,4,2,2,2,4,4,2,4,4(...TRUNCATED) | 0 | 0 | 2,100 | [
"strings"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | ||||
1030_E. Vasya and Good Sequences | "Sherlock Holmes has decided to start a new academy to some of the young lads. He has conducted seve(...TRUNCATED) | {
"input": [
"5\n2 3 4 6 8"
],
"output": [
"1"
]
} | {"input":["47\n169884146 730277703 8645016 732791141 331583052 25104065 895622218 478600214 92415406(...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 | 0 | {"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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2],"solution":["#include <bits/stdc++.h>\nusing n(...TRUNCATED) | 361 | D | 0 | 0 | [
"brute force",
"implementation",
"strings"
] | false | {
"nanos": 0,
"seconds": 1
} | 268,435,456 | |||
sherlock-and-kgb | "Chef and his girlfriend are going to have a promenade. They are walking along the straight road whi(...TRUNCATED) | {
"input": [
"3\n2 3\n3 6\n1 2\n3\n2 3\n3 5\n1 2\n0"
],
"output": [
"Yes\nNo"
]
} | {"input":["1000\n999001\n999002\n999003\n999004\n999005\n999006\n999007\n999008\n999009\n999010\n999(...TRUNCATED) | {
"input": [],
"output": []
} | 2 | 0 | {"language":[4,3,2,4,3,2,3,2,2,4,2,4,3,3,2,3,2,2,2,3,3,3,3,3,3,3,3,2,4,3,3,4,3,3,3,4,3,3,3,4,3,3,3,3(...TRUNCATED) | {"language":[4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,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) | 5 | D | 0 | 0 | [
""
] | false | {
"nanos": 0,
"seconds": 1
} | 0 | |||
724_F. Uniformly Branched Trees | "A rabbit is playing a role-playing game. Just before entering the castle, he was ambushed by an ene(...TRUNCATED) | {
"input": [
"7\n",
"9\n"
],
"output": [
"210\n",
"504\n"
]
} | {
"input": [],
"output": []
} | {"input":["280 2\n","0 2\n","99900 2\n","79086 1\n","1 5\n","100000 96\n","2523 22\n","100000 2\n","(...TRUNCATED) | 2 | 0 | {
"language": [],
"solution": []
} | {"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 | 0 | 2,500 | [
"number theory"
] | false | {
"nanos": 0,
"seconds": 5
} | 0 | ||||
650_B. Image Preview | "Polycarp often uses his smartphone. He has already installed n applications on it. Application with(...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": [],
"output": []
} | {
"input": [],
"output": []
} | 3 | 7 | {"language":[2,4,4,4,2,2,2,4,3,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,3,2,2,2,2,2,2,3,2(...TRUNCATED) | {
"language": [],
"solution": []
} | 1,110 | E | 500 | 0 | [] | false | null | 0 | |||
once-upon-a-time-in-time-land | "Anastasia loves going for a walk in Central Uzhlyandian Park. But she became uninterested in simple(...TRUNCATED) | {
"input": [
"3\n2 3 3"
],
"output": [
"2"
]
} | {
"input": [],
"output": []
} | {"input":["4\n4 3 2 1\n2 3 4 1\n3\n1 2 3 4\n1 3 2 1\n2 4 2 3\n","4\n4 3 2 1\n2 3 4 1\n3\n1 2 3 4\n1 (...TRUNCATED) | 2 | 12 | {"language":[2,4,3,2,2,2,4,3,2,2,2,3,4,1,1,4,3,3,4,4,2,4,4,1,4,3,1,3,4,4,2,4,3,2,2,4,2,3,3,4,1,3,3,4(...TRUNCATED) | {"language":[3,2,2,2,2,2,2,2,0,2,2,2,2,2,0,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,2(...TRUNCATED) | 1,027 | 500 | 1,500 | [] | false | {
"nanos": 0,
"seconds": 1
} | 0 | ||||
1291_E. Prefix Enlightenment | "Ali is Hamed's little brother and tomorrow is his birthday. Hamed wants his brother to earn his gif(...TRUNCATED) | {"input":["6\n3\n0 0\n1 1\n1 2\n2\n1 0\n1000 3\n4\n10 1\n15 2\n10 2\n15 2\n1\n765 432\n2\n4 4\n4 3\n(...TRUNCATED) | {"input":["50 1\n50 8 46 9 12 38 41 18 49 10 23 15 16 3 13 17 48 8 31 32 6 31 31 49 9 40 9 21 23 41 (...TRUNCATED) | {"input":["20\n.*..*...*....*.../.*\n","97\n.*****.**.***.*.**.*..*.***.*.***.*.**.***.*......*..*..(...TRUNCATED) | 6 | 0 | {"language":[2,3,3,2,4,1,3,2,4,2,2,3,2,3,4,4,3,3,3,4,2,3,3,2,2,3,4,2,3,2,4,3,4,2,3,4,2,2,3,2,4,4,2,3(...TRUNCATED) | {
"language": [],
"solution": []
} | 915 | E | 0 | 2,000 | [
"constructive algorithms",
"implementation"
] | true | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | |||
p01838 Optimal Tournament | "In the town of Aalam-Aara (meaning the Light of the Earth), previously there was no crime, no crimi(...TRUNCATED) | {
"input": [
"100 5\n1\n23\n45\n67\n89",
"10 2\n4\n5",
"6 1\n3"
],
"output": [
"608200469",
"0",
"4"
]
} | {
"input": [],
"output": []
} | {"input":["6 4 3\n0 1 2\n2 3 0\n0 4 5\n1 4 4\n1 2 2\n0 4 2\n","5 1 7\n0 4 1\n0 10 5\n9 0 2\n9 0 0\n9(...TRUNCATED) | 2 | 8 | {"language":[2,2,2,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,2,2,2,2,2,2,2,2,2,2,2,4,2(...TRUNCATED) | {"language":[2,4,2,2,2,4,2,1,4,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,4,2,2,2(...TRUNCATED) | 0 | C2 | 0 | 2,200 | [
"data structures",
"dfs and similar",
"dsu",
"graphs"
] | false | null | 512,000,000 | |||
chsparr | "The HR manager was disappointed again. The last applicant failed the interview the same way as 24 p(...TRUNCATED) | {"input":["4\n3\n1 4 2\n1 3 1\n2\n2 4\n2 3\n2\n1 1000000000\n1 1000000000\n4\n3 10 5 8\n2 5 2 4\n"],(...TRUNCATED) | {"input":["20\nadd 17\nadd 18\nadd 19\nsum\nadd 20\nadd 21\nadd 22\nsum\nadd 23\nadd 24\nadd 25\nsum(...TRUNCATED) | {"input":["5\nAJMP\naB33d\nE\n86AE\nAM\n6\nJPEM\nWaEaETC302Q\nCP\nrTurnAGundam1isdefferentf","5\nAJM(...TRUNCATED) | 2 | 7 | {"language":[2,2,2,3,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,3,2,4,2,2,2,2,2,2,2,4,2,2,2,2(...TRUNCATED) | {"language":[2,2,2,2,2,4,2,2,4,4,2,2,2,2,2,2,1,4,2,2,4,2,2,2,2,2,2,2,4,2,2,2,3,2,2,2,3,2,3,2,2,2,2,2(...TRUNCATED) | 371 | A | 750 | 0 | [
""
] | true | {
"nanos": 0,
"seconds": 2
} | 268,435,456 |
End of preview. Expand in Data Studio
edition_1250_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