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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
p03254 AtCoder Grand Contest 027 - Candy Distribution Again
| "Let us consider sets of positive integers less than or equal to n. Note that all elements of a set (...TRUNCATED)
| {"input":["6 7\n1 2\n2 3\n3 4\n4 6\n6 5\n4 4\n3 6\n4 2 2\n1 10 2 5\n3 8 2 7\n5 1 0 2\n6 5 4 1\n3 7 6(...TRUNCATED)
| {"input":["brtakoktrosttttttttttosafasfkalsfkodfdasiofhadfhasdsajfdsafoasodsafahaihfdisoadspapsapios(...TRUNCATED)
| {"input":["80\n72 66 82 46 44 22 63 92 71 65 5 30 45 84 29 73 9 90 25 19 26 15 12 40 33 19 85 92 91 (...TRUNCATED)
| 6
| 6
| {"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],"solution":["for _ i(...TRUNCATED)
| {"language":[2,4,2,2,2,3,4,2,2,2,4,1,4,2,4,1,4,2,2,2,2,2,2,4,2,2,2,2,2,2,2,4,4,2,2,4,2,2,1,2,2,2,2,2(...TRUNCATED)
| 0
| 0
| 1,900
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| ||||
990_E. Post Lamps
|
Example
Input
ACM
Output
0
| {"input":["17\ntypedef void* b\ntypedef b* c\ntypeof b\ntypeof c\ntypedef &b b\ntypeof b\ntypeof(...TRUNCATED)
|
{
"input": [],
"output": []
}
| {"input":["2\n4 1\n2 15 36 43 \n3 2\n27 29 35 \n\nSAMPLE","2\n4 1\n4 15 36 43 \n3 2\n27 29 35 \n\nSA(...TRUNCATED)
| 2
| 10
| {"language":[2,2,4,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,4,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)
| {"language":[2,2,3,2,3,2,2,0,4,0,0,2,2,4,2,3,2,2,3,3,3,2,0,2,3,2,2,2,3,2,0,0,2,3,2,3,3,0,2,0,2,0,3,3(...TRUNCATED)
| 0
| 1,000
| 0
|
[
"implementation"
] | false
|
{
"nanos": 0,
"seconds": 3
}
| 256,000,000
| ||||
19_B. Checkout Assistant
| "You have two friends. You want to present each of them several positive integers. You want to prese(...TRUNCATED)
|
{
"input": [
"4\n",
"583291\n"
],
"output": [
"16\n",
"135712853\n"
]
}
| {"input":["6\n0 41 48 86 94 14\n41 0 1 30 59 39\n48 1 0 9 31 49\n86 30 9 0 48 30\n94 59 31 48 0 33\n(...TRUNCATED)
| {"input":["5 2 4 15\nhhhwh\n","2 8 5 1000000000\nwh\n","1 3 3 3\nw\n","10 2 3 32\nhwwhwhwwhh\n","7 1(...TRUNCATED)
| 1
| 0
| {"language":[2,2,2,2,4,2,2,4,2,4,2,2,2,2,2,2,4,2,2,2,4,2,2,2,4,2,2,2,2,3,2,4,4,2,4,2,2,2,4,4,2,2,2,2(...TRUNCATED)
| {"language":[2,2,4,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,2,2,2,2,2,2,2,2(...TRUNCATED)
| 0
|
C
| 1,000
| 1,800
|
[
"brute force",
"greedy"
] | true
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| |||
1211_I. Unusual Graph
| "In code world all genders are considered equal ( It means their is nothing like male or female). No(...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":["1 10\n700282491 332230980 954401907 59481241 188256336 995466811 463183048 725322957 8929(...TRUNCATED)
| {"input":["777 20\n","110 4\n","12 4\n","500 2\n","11 4\n","1 8\n","26 11\n","91 4\n","20 4\n","123 (...TRUNCATED)
| 6
| 0
| {"language":[2,3,4,2,3,2,3,4,3,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,3,4,2,2,2,2,2,2,4,2,2,2,3,3,2,3,2,3(...TRUNCATED)
|
{
"language": [],
"solution": []
}
| 656
|
D
| 1,000
| 2,400
|
[
"brute force",
"constructive algorithms",
"math"
] | false
| "アイヅ放送協会の教育番組(ＡＨＫ教育)では、子供向けの工作番組「あそ(...TRUNCATED)
|
{
"nanos": 0,
"seconds": 6
}
| 256,000,000
| ||
720_C. Homework
| "A prime number is a natural number which has exactly two distinct natural number divisors: 1 and it(...TRUNCATED)
|
{
"input": [
"3 4",
"1 21"
],
"output": [
"Even",
"Odd"
]
}
| {"input":["3\n3 2 3\n","3\n1 3 1\n","5\n1 1 2 1 1\n","5\n1 1 1 1 2\n","4\n562617869 562617869 562617(...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)
| 6
| 9
|
{
"language": [],
"solution": []
}
| {"language":[2,3,4,4,3,2,2,2,3,3,2,3,4,4,1,3,2,4,2,4,1,3,2,3,2,3,3,4,3,3,4,2,3,2,2,4,4,4,4,3,3,2,4,3(...TRUNCATED)
| 1,176
|
D
| 2,500
| 0
|
[
"dp"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 0
| |||
p03986 AtCoder Grand Contest 005 - STring
| "Polycarp is working on a new project called \"Polychat\". Following modern tendencies in IT, he dec(...TRUNCATED)
|
{
"input": [
"4\n6 6 5 5\n",
"5\n1 2 3 1 3\n",
"4\n6 6 4 4\n"
],
"output": [
"0",
"4",
"-8"
]
}
|
{
"input": [],
"output": []
}
| {"input":["5\n2 3 0 6 8","5\n2 3 4 6 5","5\n2 3 4 6 7","5\n2 3 0 6 7","5\n2 -1 8 6 4","5\n6 0 8 5 2"(...TRUNCATED)
| 2
| 9
| {"language":[2,2,2,2,2,2,2,2,3,3,4,2,2,2,4,4,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,4,2,2,2,2,4,1,3,4,4,2,2,4(...TRUNCATED)
| {"language":[4,3,2,3,0,2,2,3,0,2,3,3,2,3,0,0,2,2,3,2,0,3,0,3,2,2,3,2,3,3,2,3,3,0,3,4,0,2,3,3,2,3,2,0(...TRUNCATED)
| 0
| 0
| 0
|
[
"dfs and similar"
] | false
| null | 256,000,000
| ||||
1506_F. Triangular Paths
| "Note that this is the first problem of the two similar problems. You can hack this problem only if (...TRUNCATED)
| {"input":["6\n4 2\nbbab\n7 5\ncceddda\n6 5\necdaed\n7 4\ndcdbdaa\n8 3\nccabbaca\n5 7\neabba\n"],"out(...TRUNCATED)
| {"input":["5 2 5\n3 5 2 1\n2 3 1 4\n1 4 3 1\n2 3 1 2\n2 3 1 5\n","2 1 1\n1 2 1 1\n","1 2 1\n1 1 3 1\(...TRUNCATED)
| {"input":["6\nbabddc\n","7\nbd`dccd\n","2\nab\n","7\nxxyzyyy\n","6\naagcfb\n","7\nbbbcdbc\n","4\npbr(...TRUNCATED)
| 2
| 11
| {"language":[3,3,1,4,2,4,2,4,3,3,4,3,2,2,2,3,1,3,2,4,1,4,3,3,3,1,3,2,3,3,2,2,4,4,3,4,2,2,3,3,3,3,3,2(...TRUNCATED)
| {"language":[2,2,2,2,2,2,4,2,1,4,2,2,2,2,2,2,2,4,2,4,2,2,2,2,2,2,2,4,2,3,2,2,1,2,4,2,2,2,2,2,4,2,2,1(...TRUNCATED)
| 687
|
E
| 0
| 800
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 268,435,456
| |||
p01797 Kimagure Cleaner
| "Vasily the Programmer loves romance, so this year he decided to illuminate his room with candles.\n(...TRUNCATED)
|
{
"input": [
"eggegg\n\nSAMPLE"
],
"output": [
"egg"
]
}
|
{
"input": [
"5\n90 94\n26 25\n64 84\n14 6\n20 96\n"
],
"output": [
"1842\n12\n1015\n3\n1908\n"
]
}
|
{
"input": [],
"output": []
}
| 2
| 8
| {"language":[4,3,3,3,3,3,3,3,3,2,3,3,4,3,3,3,4,4,3,3,4,3,3,3,3,3,3,3,4,2,3,1,3,3,3,3,3,3,3,3,3,3,4,3(...TRUNCATED)
| {"language":[2,2,2,3,0,2,2,3,2,2,3,2,3,2,3,3,2,3,2,0,3,2,2,3,3,0,0,2,3,2,2,2,2,2,2,2,2,2,3,3,0,2,2,3(...TRUNCATED)
| 0
| 0
| 0
|
[
"greedy"
] | false
|
{
"nanos": 0,
"seconds": 1
}
| 0
| ||||
716_D. Complete The Graph
| "Pink Floyd are pulling a prank on Roger Waters. They know he doesn't like [walls](https://www.youtu(...TRUNCATED)
|
{
"input": [
"3\n3 1 0\n1 2 3\nXOR\n3 1 0\n1 2 3\nAND\n3 1 0\n1 2 3\nOR"
],
"output": [
"0\n0\n3\n"
]
}
|
{
"input": [
"3\n1234567\n1268501\n1268499\n"
],
"output": [
"788765312\n999997375\n999999350\n"
]
}
| {"input":["51 89 97\n18 25 63\n41 91 74\n","1 100 1\n100 100 000\n1 100 100\n","2 10 29\n1 1 43\n1 1(...TRUNCATED)
| 6
| 7
| {"language":[2,2,2,4,2,2,2,4,4,2,4,2,2,4,2,2,4,2,2,2,2,2,2,3,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,4,4,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)
| 323
|
C
| 0
| 1,900
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 1
}
| 256,000,000
| |||
p01316 Differential Pulse Code Modulation
| "In Walrusland public transport tickets are characterized by two integers: by the number of the seri(...TRUNCATED)
|
{
"input": [
"0",
"0011",
"11011010001011"
],
"output": [
"0",
"4",
"12"
]
}
|
{
"input": [],
"output": []
}
| {"input":["2 0\n","3 1\n1 2 0\n","3 3\n1 2 2 3 2\n1 1 2 3 3\n2 3 2 2 3\n","11 17\n1 2 5 3 4 1 2 10\n(...TRUNCATED)
| 2
| 0
| {"language":[2,2,4,2,2,3,4,2,2,2,1,2,4,2,2,4,4,2,2,2,4,4,2,2,4,2,2,2,4,2,4,2,2,2,2,2,1,4,2,2,4,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,4,2,2,2,2,2,2,2,2,2(...TRUNCATED)
| 0
|
C
| 500
| 0
|
[
"dp",
"implementation",
"math",
"number theory"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
|
End of preview. Expand
in Data Studio
edition_2365_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
- 21