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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
the-competitive-class-3 | Artsem has a friend Saunders from University of Chicago. Saunders presented him with the following problem.
Let [n] denote the set {1, ..., n}. We will also write f: [x] → [y] when a function f is defined in integer points 1, ..., x, and all its values are integers from 1 to y.
Now then, you are given a function f: [... | {
"input": [
"2\n4 INDIAN\nCONTEST_WON 1\nTOP_CONTRIBUTOR\nBUG_FOUND 100\nCONTEST_HOSTED\n4 NON_INDIAN\nCONTEST_WON 1\nTOP_CONTRIBUTOR\nBUG_FOUND 100\nCONTEST_HOSTED"
],
"output": [
"3\n1\n"
]
} | {
"input": [
"6\nc armor 0 13 0 3\na weapon 23 0 0 3\nb weapon 20 0 0 4\ne orb 0 0 13 3\nd armor 0 15 0 4\nf orb 0 0 17 5\n5\nj gladiator 7 a\nh gladiator 3 f\ng gladiator 4 e\ni gladiator 7 a\nk gladiator 1 b\n",
"6\nc armor 0 13 0 3\na weapon 23 0 0 3\nb weapon 10 0 0 4\ne orb 0 0 19 3\nd armor 0 15 0 4\nf ... | {
"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 1000000000\n1000000000 300 1000000000\n1000000000 400 1000000000\n1000000000 500 1000000010\n",
"4 10 5\n1 1 1\n1 0 1\n1 5 8\n2 7 100\n",
"1 2 1000000000\n0 1 1\n",
"5 56 10\n1 1 1\n1000000000 200... | 2 | 2 | {
"language": [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
],
"solution": [
"n=int(raw_input())\nin_array=[]\nfor i in xrange(n):\n\tnum=int(raw_input())\n\tin_array.append(num)\n\nmx=max(in_array)\narr=[1,1]\n\t\n\nfor j... | {
"language": [
2,
1,
2,
2,
2,
2,
2,
2,
0,
2,
4,
2,
2,
3,
2,
2,
2,
2,
2,
2,
2,
4,
3,
2,
2,
2,
2,
0,
2,
2,
2,
2,
2,
2,
2,
2,
2,
2,
2,
2,
2,
4,
0,
... | 203 | E | 2,750 | 0 | [] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
284_B. Cows and Poker Game | "There are five people playing a game called \"Generosity\". Each person gives some non-zero number (...TRUNCATED) | {
"input": [
"5\nZZZAA\n",
"7\nABACABA\n"
],
"output": [
"ZZ\n",
"AB\n"
]
} | {
"input": [],
"output": []
} | {"input":["3\n1\n0 1\n0 -1\n1 0\n2\n0 1\n0 0\n1 0\n2\n0 0\n0 2\n2 1","3\n2\n0 1\n0 -1\n1 0\n2\n0 1\n(...TRUNCATED) | 1 | 0 | {"language":[3,1,1,2,2,4,2,3,4,2,3,4,1,4,1,3,3,2,1,3,3,3,3,2,4,4,2,4,2,4,4,2,4,4,3,3,3,2,4,2,2,4,4,1(...TRUNCATED) | {"language":[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,3,2,2,2,2,2,3,4,2,2,2,2,2,4(...TRUNCATED) | 1,304 | 0 | 2,500 | [
""
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | ||||
1512_G. Short Task | "In one well-known algorithm of finding the k-th order statistics we should divide all elements into(...TRUNCATED) | {"input":["2 2\n6 3\nMonday Tuesday Wednesday\n8 4\nThursday Friday Saturday Sunday\n2 2\n7 3\nMonda(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["100 3\n2 1 1 1 3 2 3 3 2 3 3 1 3 3 1 3 3 1 1 1 2 3 1 2 3 1 2 3 3 1 3 1 1 2 3 2 3 3 2 2 3 (...TRUNCATED) | 2 | 10 | {"language":[2,2,2,2,2,2,4,2,2,4,4,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2(...TRUNCATED) | {"language":[2,2,4,2,2,2,4,4,2,4,2,2,2,2,2,4,2,2,4,3,4,4,4,4,1,4,4,4,2,3,1,4,2,2,2,2,4,4,2,4,1,3,2,2(...TRUNCATED) | 1,382 | E | 1,500 | 1,900 | [
""
] | false | null | 256,000,000 | |||
500_C. New Year Book Reading | "Let's denote a function \n\n<image>\n\nYou are given an array a consisting of n integers. You have (...TRUNCATED) | {
"input": [
"3 2 1\n1 2\n3\n",
"10 8 2\n1 2 3 5 6 7 8 9\n3 5\n"
],
"output": [
"-1",
"2"
]
} | {"input":["11 11\n6 2\n6 2\n1 2\n2 2\n3 1\n6 2\n1 1\n1 1\n3 1\n3 1\n6 2\n","21 7\n14 1\n882797755 2\(...TRUNCATED) | {
"input": [],
"output": []
} | 5 | 6 | {"language":[1,2,4,3,2,2,2,3,4,2,3,1,2,2,4,2,4,4,2,2,1,4,4,2,4,2,2,2,2,2,3,1,2,2,4,4,4,1,2,2,3,4,2,3(...TRUNCATED) | {"language":[3,2,2,4,1,2,2,2,2,4,4,2,2,2,4,4,2,3,2,1,2,2,2,4,4,2,4,2,2,1,2,2,2,2,2,2,2,2,2,4,2,2,2,2(...TRUNCATED) | 0 | 0 | 2,400 | [
"data structures",
"greedy",
"implementation"
] | false | {
"nanos": 0,
"seconds": 5
} | 134,217,728 | ||||
new-world-11 | "You are given three sequences: a_1, a_2, …, a_n; b_1, b_2, …, b_n; c_1, c_2, …, c_n.\n\nFor e(...TRUNCATED) | {
"input": [
"ppqb",
"pdbq"
],
"output": [
"No",
"Yes"
]
} | {"input":["4\n439 79\n991800654 985952720 985538124 983840231 983710443 982377023 981242112 98021743(...TRUNCATED) | {"input":["5\n42665793 93310343 856080769 176604645 248258165\n10\n1 5 141156007\n2 5 5 3\n2 4 4 2\n(...TRUNCATED) | 6 | 2 | {"language":[3,4,4,2,2,4,2,4,4,2,4,2,4,2,4,3,2,1,3,2,3,3,2,4,3,3,3,3,2,3,3,2,3,4,2,2,3,2,4,4,4,3,3,2(...TRUNCATED) | {"language":[2,3,4,2,3,3,2,4,4,2,3,4,4,3,2,4,2,4,2,4,4,4,2,3,3,2,3,2,4,2,2,4,2,3,2,3,2,4,3,2,3,3,4,4(...TRUNCATED) | 1,291 | B | 0 | 0 | [
"implementation",
"strings"
] | false | null | 0 | |||
1547_C. Pair Programming | "You are given a string S consisting of letters `b`, `d`, `p` and `q`. Determine whether S is a mirr(...TRUNCATED) | {
"input": [
"2\n5\n2 3 5 1 2\n3\n1 2 3"
],
"output": [
"3\n3"
]
} | {
"input": [],
"output": []
} | {"input":["3\n2 3\n3 6\n1 2\n3\n2 3\n3 5\n2 2\n0","3\n2 3\n3 6\n2 2\n3\n3 3\n3 6\n2 2\n0","3\n2 1\n3(...TRUNCATED) | 3 | 9 | {"language":[3,4,4,4,4,2,2,3,4,4,2,4,2,4,1,4,2,4,3,3,1,4,4,2,2,1,4,4,4,4,4,2,2,3,4,4,4,3,4,4,2,4,4,4(...TRUNCATED) | {"language":[2,2,3,0,3,2,0,3,0,2,2,3,2,3,2,2,0,2,0,3,0,3,3,2,3,2,2,0,2,2,3,3,2,2,2,3,3,3,2,2,4,3,4,2(...TRUNCATED) | 371 | C | 0 | 1,600 | [
"data structures",
"divide and conquer",
"dp"
] | false | "あなたは友人と旅行に行きたいと考えています。ところが、浪費癖のある(...TRUNCATED) | {
"nanos": 0,
"seconds": 1
} | 0 | ||
851_B. Arpa and an exam about geometry | "Background\n\nThe kindergarten attached to the University of Aizu is a kindergarten where children (...TRUNCATED) | {"input":["4\n1000000000 1000000\n1000000000 1000000\n100000000 1000000\n1000000000 1000000\n","3\n9(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["4 50\n0 10000\n1 10000\n2 1\n10000 0","4 10001\n0 0\n1 1\n9999 0\n10000 10000","4 100\n0 (...TRUNCATED) | 3 | 0 | {"language":[3,4,3,4,3,2,2,3,3,3,4,3,3,2,3,2,1,2,3,3,2,3,3,2,4,4,4,2,3,3,3,3,3,4,3,3,2,3,3,3,2,3,3,4(...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) | 306 | E | 0 | 800 | [
"implementation"
] | false | null | 1,073,741,824 | |||
1291_E. Prefix Enlightenment | Example
Input
ACM
Output
0 | {"input":["3 2\n1 2\n2 3\n","3 3\n1 2\n2 3\n3 1\n","8 12\n1 2\n2 3\n3 4\n4 1\n1 3\n2 4\n3 5\n3 6\n5 (...TRUNCATED) | {"input":["2 1\n1 1\n","2 3\n3 1\n","100 5\n5 5 2 4 5 4 4 4 4 2 5 3 4 2 4 4 1 1 5 3 2 2 1 3 3 2 5 3 (...TRUNCATED) | {"input":["8\n1 2\n1 3\n1 4\n1 5\n1 6\n2 7\n2 8\n","10\n10 1\n1 4\n4 2\n2 3\n3 6\n6 9\n9 5\n5 8\n3 7(...TRUNCATED) | 2 | 6 | {"language":[2,3,4,3,4,3,4,3,3,3,3,2,3,3,4,4,4,3,4,3,2,3,3,4,1,2,3,4,3,2,1,3,4,3,3,4,4,3,1,1,3,3,3,3(...TRUNCATED) | {"language":[2,2,2,3,4,2,2,4,2,2,3,2,3,2,2,2,4,2,2,2,2,2,3,3,2,3,3,2,4,2,2,2,2,2,3,2,2,2,2,1,3,2,2,2(...TRUNCATED) | 893 | 500 | 0 | [
"constructive algorithms",
"greedy",
"number theory"
] | false | {
"nanos": 0,
"seconds": 3
} | 1,073,741,824 | ||||
p03343 AtCoder Regular Contest 098 - Range Minimum Queries | "There are N cubes stacked vertically on a desk.\n\nYou are given a string S of length N. The color (...TRUNCATED) | {"input":["3\n10 20 10\n6\n1 1\n2 1\n2 2\n3 1\n3 2\n3 3\n","7\n1 2 1 3 1 2 1\n9\n2 1\n2 2\n3 1\n3 2\(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["10\n3\n-15 -33 79\n16\n45 -84 19 85 69 -64 93 -70 0 -53 2 -52 -55 66 33 -60\n2\n14 -2\n4\(...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,2,2,2,2(...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) | 0 | D | 0 | 0 | [
"dp",
"flows",
"graph matchings",
"greedy"
] | false | {
"nanos": 0,
"seconds": 2
} | 134,217,728 | |||
1334_D. Minimum Euler Cycle | "Diverta City is a new city consisting of N towns numbered 1, 2, ..., N.\n\nThe mayor Ringo is plann(...TRUNCATED) | {
"input": [
"3\n12 2\n200\n50\n300\n100"
],
"output": [
"37"
]
} | {"input":["47\n169884146 730277703 8645016 732791141 331583052 25104065 895622218 478600214 92415406(...TRUNCATED) | {"input":["1 1 1000000000 1000000100\n100 1000000000\n1\n","1 1 10 18\n3 6\n5\n","4 13 400 600\n13 3(...TRUNCATED) | 2 | 10 | {"language":[2,2,4,2,4,4,2,3,2,3,3,4,3,2,4,3,2,2,3,3,4,2,2,2,2,3,3,2,2,4,4,4,4,3,3,2,3,3,3,2,2,2,3,3(...TRUNCATED) | {
"language": [],
"solution": []
} | 1,540 | B | 0 | 0 | [
"dp",
"math"
] | false | {
"nanos": 0,
"seconds": 1
} | 268,435,456 |
End of preview. Expand in Data Studio
edition_0781_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