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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1012_E. Cycle sort
| "Employees of JebTrains are on their way to celebrate the 256-th day of the year! There are n employ(...TRUNCATED)
|
{
"input": [
"ppqb",
"pdbq"
],
"output": [
"No",
"Yes"
]
}
| {"input":["7\n","2000000000000000000\n","1000000000000000000\n","987654321012345678\n"],"output":["2(...TRUNCATED)
| {"input":["1 5000 2732\n","2 2 0\n","83 4122 123\n","19 862 387\n","100 843 30\n","45 1296 245\n","9(...TRUNCATED)
| 6
| 7
| {"language":[1,1,1],"solution":["t = int(input())\nfor i in range(t):\n n = int(input())\n pri(...TRUNCATED)
| {"language":[3,2,3,3,2,2,2,3,1,2,2,3,2,4,3,4,3,1,4,3,4,3,3,4,4,4,4,4,3,3,4,3,3,4,4,2,4,3,2,4,3,4,4,2(...TRUNCATED)
| 0
| 0
| 2,100
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 1
}
| 256,000,000
| ||||
p02834 AtCoder Beginner Contest 148 - Playing Tag on Tree
| "You are given a table consisting of n rows and m columns. Each cell of the table contains either 0 (...TRUNCATED)
|
{
"input": [
"5 10\n-1 -1 -1 -1 -1\n",
"10 2\n10 -1 2 2 2 2 2 2 -1 10\n"
],
"output": [
"-1\n",
"32\n"
]
}
| {"input":["1\n1\n","100\n98 52 63 2 18 96 31 58 84 40 41 45 66 100 46 71 26 48 81 20 73 91 68 76 13 (...TRUNCATED)
| {"input":["9 1004498469 6\n","1 0 10\n","1944219055 33463955 1369298327\n","914835 4386500 9234739\n(...TRUNCATED)
| 5
| 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":[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)
| 0
|
B
| 0
| 1,800
|
[
"ternary search"
] | false
| "\n\n問題\n\n$N$ 個の相違なる自然数 $a_i$ が与えられる。与えられた自然数(...TRUNCATED)
|
{
"nanos": 0,
"seconds": 1
}
| 256,000,000
| ||
1101_A. Minimum Integer
| "Luba thinks about watering her garden. The garden can be represented as a segment of length k. Luba(...TRUNCATED)
|
{
"input": [
"2 3\n",
"1 1\n",
"49 1808\n"
],
"output": [
"6\n",
"0\n",
"359087121\n"
]
}
|
{
"input": [],
"output": []
}
| {"input":["5 7\n2 2\n2 3\n3 4\n1 5\n2 5\n3 5\n4 5\n","4 0\n","6 9\n1 2\n1 4\n1 5\n2 6\n2 5\n2 6\n3 5(...TRUNCATED)
| 5
| 11
| {"language":[1,3,3,4,1,1,4,3,3,2,3,2,4,3,1,4,2,2,2,3,4,4,3,3,4,3,1,2,4,3,1,3,2,1,3,3,1,4,4,1,3,2,3,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)
| 0
|
B
| 0
| 0
|
[
""
] | false
| null | 268,435,456
| |||
19_B. Checkout Assistant
| "You have a string s of length n consisting of only characters > and <. You may do some operations w(...TRUNCATED)
|
{
"input": [
"10 3 2\n",
"13 12 1\n",
"4 1 1\n"
],
"output": [
"5\n",
"1\n",
"3\n"
]
}
|
{
"input": [
"5\n1 14\n1 50\n4 28\n5 700\n3 147"
],
"output": [
"1\n10\n3\n32491\n739"
]
}
|
{
"input": [],
"output": []
}
| 2
| 8
| {"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": []
}
| 760
|
A
| 0
| 0
|
[
"constructive algorithms"
] | false
|
{
"nanos": 0,
"seconds": 6
}
| 268,435,456
| |||
571_E. Geometric Progressions
| "Peter got a new snow blower as a New Year present. Of course, Peter decided to try it immediately. (...TRUNCATED)
| {"input":["10 3 409693891\n","65 4 177545087\n","5 2 433416647\n"],"output":["2\n","910726\n","1\n"](...TRUNCATED)
|
{
"input": [],
"output": []
}
| {"input":["5 6\n#.##\n.##.\n#...\n..##\n...#","13 27\n......#.........#.......#..\n...#.....###..\n.(...TRUNCATED)
| 2
| 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,3,4,2,4,2,2,3,1,2,3,2,4,2,3,3,4,2,2,4,4,2,2,4,3,2,2,4,4,4,3,4,4,2,2,4,4,3,2,3,2,4,2,1(...TRUNCATED)
| 45
| 1,000
| 900
|
[
"constructive algorithms",
"graphs"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 0
| ||||
702_E. Analysis of Pathes in Functional Graph
| "A permutation — is a sequence of length n integers from 1 to n, in which all the numbers occur ex(...TRUNCATED)
| {"input":["1500 2000 1600 3 2","1500 2000 500 90000 100000","1500 2000 1900 3 2"],"output":["7900","(...TRUNCATED)
|
{
"input": [],
"output": []
}
|
{
"input": [],
"output": []
}
| 2
| 2
| {"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,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,540
| 1,250
| 0
|
[
"constructive algorithms"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 268,435,456
| ||||
vowel
| "Having learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclu(...TRUNCATED)
| {"input":["6 2\n100 1 10 40 10 40\n","5 1\n5 10 7 3 20\n","3 0\n1 2 3\n"],"output":["97\n","3\n","0\(...TRUNCATED)
|
{
"input": [],
"output": []
}
|
{
"input": [],
"output": []
}
| 6
| 7
| {"language":[2,2,2,2,4,2,4,2,2,4,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,2,2,2,4(...TRUNCATED)
| {"language":[2,1,2,2,3,2,2,2,2,2,2,3,3,2,2,2,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,3,0,2,2,2,2(...TRUNCATED)
| 0
|
B
| 0
| 2,400
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 512,000,000
| |||
p01970 The Diversity of Prime Factorization
| "A rabbit is playing a role-playing game. Just before entering the castle, he was ambushed by an ene(...TRUNCATED)
|
{
"input": [
"3\n1\n0 1\n0 0\n1 0\n2\n0 1\n0 0\n1 0\n2\n0 0\n0 2\n2 1"
],
"output": [
"yes\nyes\nno\n"
]
}
| {"input":["3\n2 2 3\n","5\n1 4 5 4 5\n","4\n2 2 4 4\n","3\n1 1 2\n","4\n1 2 1 2\n","4\n4 2 2 4\n","6(...TRUNCATED)
| {"input":["3\n((()))\n(())()\n()())","3\n((()()\n(())()\n()(()","3\n((()))\n(())))\n()())","3\n)))(((...TRUNCATED)
| 2
| 8
| {"language":[3,2,4,4,2,4,4,4,3,3,3,2,3,3,4,3,3,2,4,4,2,4,4,1,3,1,4,3,1,1,2,3,3,4,2,1,2,2,4,2,2,4,2,2(...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)
| 675
|
E
| 500
| 0
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 8
}
| 256,000,000
| |||
hermione-vs-draco
| "Please note the non-standard memory limit.\n\nThere are n problems numbered with integers from 1 to(...TRUNCATED)
|
{
"input": [],
"output": []
}
| {"input":["6 4 3\n0 1 2\n1 3 0\n0 4 5\n1 4 4\n1 2 2\n0 4 2\n","50 69 6\n62 91 5\n35 35 53\n85 26 1\n(...TRUNCATED)
| {"input":["7\n5\n-1 10 -1 12 -1\n5\n-1 40 35 -1 35\n6\n-1 -1 9 -1 3 -1\n2\n-1 -1\n2\n0 -1\n4\n1 -1 3(...TRUNCATED)
| 2
| 3
| {"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],"solut(...TRUNCATED)
|
{
"language": [],
"solution": []
}
| 1,439
| 750
| 0
|
[] | false
| null | 256,000,000
| ||||
p01356 Nearest Station
| "You are given an equation A * X + B * Y = C, A, B, C are positive integer coefficients, X and Y are(...TRUNCATED)
|
{
"input": [
"5\n3 2 1 6 5\n",
"4\n3 3 3 3\n"
],
"output": [
"8",
"0"
]
}
| {"input":["3 1\nerase -1\nerase 0\nerase -2147483648\n","26 25\ndefragment\nerase 1\nerase -15602008(...TRUNCATED)
| {"input":["188\n99\n","352\n139\n","596\n845\n","285\n2\n","892\n319\n","138\n293\n","967\n102\n","9(...TRUNCATED)
| 2
| 7
| {"language":[2,2,2,2,2,4,2,2,2,2,1,4,4,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,4,4,2,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,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)
| 846
|
B
| 3,750
| 0
|
[
"implementation"
] | false
|
{
"nanos": 0,
"seconds": 3
}
| 268,435,456
|
End of preview. Expand
in Data Studio
edition_1760_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
- 10