name
large_stringlengths 4
70
| description
large_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
large_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
large_stringclasses 36
values | time_limit
dict | memory_limit_bytes
int64 0
1.07B
| input_file
large_stringclasses 1
value | output_file
large_stringclasses 1
value |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
p02365 Minimum-Cost Arborescence
| "In computer science, there is a method called \"Divide And Conquer By Node\" to solve some hard pro(...TRUNCATED)
|
{
"input": [
"6 5\n1 2 2 4 2 3\n",
"7 5\n3 3 2 1 1 1 3\n"
],
"output": [
"4\n",
"2\n"
]
}
|
{
"input": [],
"output": []
}
| {"input":["5 0\n884430748 884430748 182474629 708433020 708433020\n","5 2\n65390026 1454694739 65390(...TRUNCATED)
| 5
| 0
| {"language":[2,3,3,2,3,1,3,2,4,2,4,3,3,2,3,4,2,3,3,3,3,3,2,3,3,3,3,2,3,3,4,4,4,3,3,3,1,3,3,2,3,4,3,3(...TRUNCATED)
| {"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,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,4(...TRUNCATED)
| 0
| 0
| 2,500
|
[
"data structures",
"greedy"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| ||||
1361_E. James and the Chase
| "Amr loves Geometry. One day he came up with a very interesting problem.\n\nAmr has a circle of radi(...TRUNCATED)
|
{
"input": [
"1 0\n25 47 10"
],
"output": [
"96.2027355887"
]
}
| {"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":["1\n1 0 1 1\n10000 10000 10000 10000","2\n10 3 1 2\n2 4 1 3\n1 2 1 1","2\n10 3 1 2\n2 4 1 (...TRUNCATED)
| 2
| 0
| {"language":[2,3,2,3,2,4,3,2,3,2,3,4,3,2,3,3,3,4,2,4,2,2,2,3,4,4,2,2,1,3,2,3,1,4,3,2,4,2,4,2,2,4,3,3(...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,4,2,2,2,2,2,2,2,2(...TRUNCATED)
| 931
|
B
| 0
| 2,500
|
[] | false
|
{
"nanos": 0,
"seconds": 10
}
| 256,000,000
| |||
1030_E. Vasya and Good Sequences
| "You are given an equation A * X + B * Y = C, A, B, C are positive integer coefficients, X and Y are(...TRUNCATED)
|
{
"input": [
"2\n"
],
"output": [
"25\n"
]
}
|
{
"input": [],
"output": []
}
| {"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)
| 1
| 7
| {"language":[2,2,2,3,2,2,2,2,2,2,2,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,2,2,2,2(...TRUNCATED)
| {"language":[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,4,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)
| 0
| 1,000
| 1,900
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 1
}
| 134,217,728
| ||||
909_D. Colorful Points
| "In late autumn evening n robots gathered in the cheerful company of friends. Each robot has a uniqu(...TRUNCATED)
|
{
"input": [
"4 4\n1 2 -10 3\n1 3 1 -10\n2 4 -10 -1\n3 4 0 -3\n"
],
"output": [
"4\n"
]
}
| {"input":["384\n87 78 16 94 36 87 93 50 22 63 28 91 60 64 27 41 27 73 37 12 69 68 30 83 31 63 24 68 (...TRUNCATED)
| {"input":["2 2\n2 3\n2 3\n2 3\n2 2\n5 2","2 2\n2 3\n2 2\n2 3\n2 2\n2 2","2 2\n2 3\n2 3\n2 2\n2 2\n5 (...TRUNCATED)
| 2
| 2
| {"language":[4,2,2,4,2,2,2,2,4,2,3,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,1,4,2,2,2,4,2,2,4,2,2,2,2,2,2,4,2,2(...TRUNCATED)
| {"language":[2,2,3,2,2,4,4,2,2,2,4,2,2,2,2,2,3,2,2,2,4,3,3,3,2,3,3,2,3,4,2,3,2,2,2,2,4,4,3,2,2,3,2,2(...TRUNCATED)
| 0
| 0
| 2,500
|
[
"data structures",
"math"
] | false
|
{
"nanos": 0,
"seconds": 1
}
| 134,217,728
| ||||
70_C. Lucky Tickets
| "We have a sandglass consisting of two bulbs, bulb A and bulb B. These bulbs contain some amount of (...TRUNCATED)
|
{
"input": [
"5 5 10 5 4\n",
"12 4 12 4 1\n",
"15 1 100 0 0\n"
],
"output": [
"1\n",
"3\n",
"15\n"
]
}
| {"input":["5 0\n884430748 884430748 708433020 708433020 708433020\n","2 1\n1 1\n","2 0\n2 1\n","5 2\(...TRUNCATED)
| {"input":["1\n297754\n","16\n2 2 2 3 5 3 5 5 5 7 7 7 11 11 13 17\n","16\n2 2 2 2 2 3 3 5 5 5 5 7 7 1(...TRUNCATED)
| 2
| 9
| {"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],"solution":["for q in range((...TRUNCATED)
|
{
"language": [],
"solution": []
}
| 1,027
| 0
| 0
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 134,217,728
| ||||
p01356 Nearest Station
| "Rakesh have learn about vowel in school and is given an assignment by his teacher in which he has t(...TRUNCATED)
| {"input":["5 5 2\n#####\n#A#B#\n# #\n#b#a#\n#####\n16 4 3\n################\n## ########## ##\n# (...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
| 2
| {"language":[2,4,2,2,2,2,2,4,4,2,2,4,2,2,2,3,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,4,2,2,2,2,2(...TRUNCATED)
|
{
"language": [],
"solution": []
}
| 1,253
|
D
| 0
| 2,200
|
[
"dp",
"math",
"number theory"
] | true
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| |||
235_A. LCM Challenge
| "You are given an integer sequence A of length N and an integer K. You will perform the following op(...TRUNCATED)
|
{
"input": [
"3\n10 2 5\n12 4 4\n6 2 2\n\nSAMPLE"
],
"output": [
"6\n3\n5\n"
]
}
| {"input":["8\n0 1\n1 0\n0 1\n1 1\n0 1\n1 0\n0 1\n1 0\n","8\n1 0\n1 0\n1 0\n0 1\n0 1\n1 1\n1 1\n0 1\n(...TRUNCATED)
| {"input":["5\n78188 56310 33094 70050 65217\n115040 5149 128449 98357 36580\n1 451393770\n2 57404660(...TRUNCATED)
| 3
| 7
| {"language":[1,1],"solution":["from math import*\nfor i in range (input()):\n num ,k = map(int,ra(...TRUNCATED)
| {"language":[2,4,0,2,2,0,2,2,2,2,2,2,2,2,2,2,2,4,2,0,2,2,2,4,2,2,2,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2,4(...TRUNCATED)
| 500
|
H
| 0
| 1,700
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 1
}
| 256,000,000
| |||
1100_D. Dasha and Chess
| "You all know the Dirichlet principle, the point of which is that if n boxes have no less than n + 1(...TRUNCATED)
|
{
"input": [
"5 5 10\n1 2 4 8 16\n",
"3 4 11\n1 2 3 4\n"
],
"output": [
"7\n",
"6\n"
]
}
| {"input":["10 10\n.L.....R..\n.........U\n..D....D..\n.R......L.\n....L.....\n.........D\n......U...(...TRUNCATED)
| {"input":["605 297 -440074875 -366763764 -445828791 325081312\n","14 9 44 1 -50 -9\n","16 17 -260784(...TRUNCATED)
| 2
| 0
| {"language":[2,3,2,4,3,3,3,1,3,2,3,3,3,3,2,3,3,3,3,2,2,3,3,1,4,3,3,2,3,2,2,3,3,3,3,3,4,4,3,3,4,3,2,3(...TRUNCATED)
| {"language":[2,2,2,4,4,2,2,2,4,4,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,4,2,2,2,4,2,2,2,2,4,4,2,2,2,3,2,2(...TRUNCATED)
| 0
| 0
| 800
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| ||||
chsparr
| "Kevin Sun has just finished competing in Codeforces Round #334! The round was 120 minutes long and (...TRUNCATED)
| {"input":["7\nbabba\nabaac\ncodeforces\nzeroorez\nabcdcba\nbbbbbbb\na\n"],"output":["\n1\n1\n0\n1\n1(...TRUNCATED)
| {"input":["10 20 11\nisnr u eq qas gcj rnnf fpb c dz g\n","10 4 3\nuzu bl fl ou uist j lp e gkp fmo\(...TRUNCATED)
| {"input":["3 1 2\n1\n1 1\n","3 0 3\n\n334 500 0001\n","3 0 3\n\n333 187 1001\n","6 2 3\n2 3\n1 1 1\n(...TRUNCATED)
| 2
| 12
| {"language":[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,3,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)
| {"language":[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,2],"solutio(...TRUNCATED)
| 331
|
E
| 0
| 0
|
[
"binary search",
"brute force",
"chinese remainder theorem",
"math",
"number theory"
] | false
|
{
"nanos": 0,
"seconds": 1
}
| 256,000,000
| |||
1140_B. Good String
| "There are N stations in the city where JOI lives, and they are numbered 1, 2, ..., and N, respectiv(...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": [
"1\n1\n1\n1\n1 1 1 1\n"
],
"output": [
"1\n"
]
}
| {"input":["3\n77 42 77\n77 77\n77\n","3\n77 31 77\n77 77\n77\n","4\n1 5 7 12\n1 5 7\n1 5\n","3\n77 7(...TRUNCATED)
| 5
| 10
| {"language":[2,4,2,3,1,4,1,2,4,3,4,1,3,3,3,3,4,1,2,3,4,2,2,3,3,4,3,3,3,1,1,2,4,2,1,1,3,3,3,1,2,4,1,1(...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)
| 319
|
A
| 0
| 800
|
[
"greedy",
"implementation",
"sortings"
] | false
|
{
"nanos": 0,
"seconds": 1
}
| 268,435,456
|
End of preview. Expand
in Data Studio
edition_2956_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