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
|
Example
Input
ACM
Output
0
|
{
"input": [
"3\n1 2\n2 3\n",
"5\n1 2\n1 3\n1 4\n1 5\n"
],
"output": [
"1 1 1\n",
"1 0 0 0 0\n"
]
}
|
{
"input": [],
"output": []
}
| {"input":["2\nca\nbc\n","2\ndc\nce\n","2\nza\nzb\n","2\nab\nb\n","25\nsw\nwt\nc\nl\nyo\nag\nz\nof\np(...TRUNCATED)
| 2
| 7
| {"language":[4,1,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,4,2,2,2,2,2,2,4,2,2,2,4,4,2,2,2,2,2,2,4,2,2,2,2,2(...TRUNCATED)
| {"language":[3,2,2,2,3,3,2,2,3,0,3,2,3,2,3,3,0,4,2,2,2,3,2,2,0,2,4,4,0,2,0,3,2,2,3,3,3,3,2,2,0,0,2,2(...TRUNCATED)
| 0
| 1,750
| 1,700
|
[
"math"
] | false
|
{
"nanos": 0,
"seconds": 1
}
| 256,000,000
| ||||
737_A. Road to Cinema
| "A smile house is created to raise the mood. It has n rooms. Some of the rooms are connected by door(...TRUNCATED)
| {"input":["3\n5 2\n5 3\n7 0\n5 0\n4 0\n10 0\n2 1\n10 100\n50 10\n5 5\n1 5\n2 4\n3 3\n4 2\n5 1\n"],"o(...TRUNCATED)
| {"input":["1 5000 4999\n","2 1 0\n","83 2813 123\n","93 2364 2364\n","100 1 0\n","21 862 387\n","1 1(...TRUNCATED)
| {"input":["10\n1 3\n3 9\n27 81\n2187 6561\n9 27\n12641 19683\n81 243\n729 2187\n59049 177147\n531441(...TRUNCATED)
| 1
| 0
| {"language":[2,2,2,2,2,2,2,2,3,2,2,2,4,3,2,2,2,2,2,2,2,4,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,1,4,3,3,3,2,4,2,2,3,3,4,4,4,3,3,3,3,4,2,3,2,3,2,2,2,2,3,3,1,4,4,3,2,2,4,4,3,2,3,2,2(...TRUNCATED)
| 354
| 1,750
| 0
|
[
"bitmasks",
"brute force",
"fft",
"strings",
"trees"
] | true
|
{
"nanos": 0,
"seconds": 1
}
| 268,435,456
| ||||
586_F. Lizard Era: Beginning
| "Yesterday Oz heard a story about insect colony. The specialty of insects is that they splits someti(...TRUNCATED)
|
{
"input": [
"5 5\n1 2 3 4 5\n",
"3 1\n1 1 2\n",
"5 2\n1 1 2 1 3\n"
],
"output": [
"16",
"3",
"14"
]
}
| {"input":["4\n1 2 4 3\n","4\n2 1 4 3\n","10\n1 2 10 9 7 4 8 3 6 5\n","10\n1 7 10 6 5 2 3 8 9 4\n","4(...TRUNCATED)
| {"input":["10\n1\n248618\n3\n12 10 8\n6\n100 11 15 9 2 8\n4\n0 1 1 0\n2\n0 0\n2\n0 1\n2\n1 0\n2\n1 1(...TRUNCATED)
| 2
| 0
| {"language":[3,2,3,1,2,3,3,3,4,4,2,3,1,2,3,1,3,1,1,3,4,3,4,2,3,2,4,3,3,1,2,3,3,2,3,1,3,1,2,4,3,3,4,3(...TRUNCATED)
| {"language":[2,4,4,3,4,2,3,4,1,2,4,2,4,4,4,4,2,3,4,3,3,2,3,4,3,3,3,2,4,2,2,4,4,2,4,4,2,3,2,2,4,2,2,3(...TRUNCATED)
| 1,374
|
B
| 0
| 0
|
[
"data structures",
"greedy"
] | false
| null | 0
| |||
1348_F. Phoenix and Memory
| "You have a string s of length n consisting of only characters > and <. You may do some operations w(...TRUNCATED)
| {"input":["7\nbabba\nabaac\ncodeforces\nzeroorez\nabcdcba\nbbbbbbb\na\n"],"output":["\n1\n1\n0\n1\n1(...TRUNCATED)
| {"input":["93 10\n6 47 6 89 21 91 51 72 32 48 54 89 36 12 25 38 58 62 54 16 5 52 52 85 67 33 81 72 6(...TRUNCATED)
| {"input":["3 2\n123 87 567\n1 2\n3 2\n","3 0\n4 1 8\n","3 2\n1 0 2\n3 2\n2 1\n","2 0\n1000000000 110(...TRUNCATED)
| 2
| 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":[4,3,2,2,4,2,3,3,4,2,2,3,2,2,4,2,2,4,3,2,3,4,3,4,2,2,2,3,3,2,4,2,3,2,3,4,4,3,4,4,4,4,3,2(...TRUNCATED)
| 938
| 0
| 1,600
|
[
"dfs and similar",
"dp",
"games",
"graphs"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| ||||
etmx05
| "ZS the Coder has drawn an undirected graph of n vertices numbered from 0 to n - 1 and m edges betwe(...TRUNCATED)
|
{
"input": [
"??00????0??0????0?0??00??1???11?1?1???1?11?111???1",
"0??0",
"0??"
],
"output": [
"4",
"2",
"1"
]
}
|
{
"input": [],
"output": []
}
| {"input":["10 7\n1 10\n2 10\n3 19\n4 10\n5 10\n1 2\n1 3\n1 4\n1 5\n1 6\n","20 7\n6047 35038\n15816 3(...TRUNCATED)
| 2
| 10
| {"language":[1],"solution":["# your code goes here\nfrom sys import stdin, stdout\nt = int(stdin.rea(...TRUNCATED)
| {"language":[2,2,2,2,4,2,4,4,2,2,2,2,2,2,2,1,2,2,4,4,2,2,4,2,2,2,2,2,3,2,2,2,2,3,2,2,2,1,2,2,2,2,2,2(...TRUNCATED)
| 765
|
B
| 2,500
| 0
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 0
| |||
1096_E. The Top Scorer
| "There are n cows playing poker at a table. For the current betting phase, each player's status is e(...TRUNCATED)
| {"input":["3 3 2\n1 2 3\n1 2 3\n1 2 3\n1 2\n3 3\n","4 5 4\n1 4 5 1 2\n2 2 2 2 7\n2 4 1 4 5\n3 2 1 7 (...TRUNCATED)
| {"input":["5 3\n","1500 2000\n","500 1000\n","1000 1000\n","5 5\n","2000 2\n","1000 500\n","3 1000\n(...TRUNCATED)
| {"input":["3 3\n2 4 1 0 1\nXAX\nB.B\nXAX","3 6\n2 4 1 1 1\nXXA\nB.B\nXAX","10 6\n1 9 1 2 3\nYXA\nB.B(...TRUNCATED)
| 2
| 12
| {"language":[2,2,2,4,2,2,2,4,2,2,2,1,2,2,2,2,3,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,1,2,2,2,2,1,2,2,2,2,2,2(...TRUNCATED)
| {"language":[2,4,2,4,2,2,2,2,2,2,4,2,4,2,2,2,2,2,2,2,2,2,4,4,2,4,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2(...TRUNCATED)
| 323
|
E
| 0
| 2,500
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 134,217,728
| |||
1291_B. Array Sharpening
| "Hackers! Hackers! Everywhere!\nSome days back your email ID was hacked. Some one read the personal (...TRUNCATED)
|
{
"input": [
"100 5\n1\n23\n45\n67\n89",
"10 2\n4\n5",
"6 1\n3"
],
"output": [
"608200469",
"0",
"4"
]
}
|
{
"input": [],
"output": []
}
| {"input":["3\n6 13 24","3\n6 4 30","3\n12 11 12","3\n6 20 24","3\n6 7 30","3\n11 20 24","3\n10 7 30"(...TRUNCATED)
| 2
| 11
| {"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],"solution":["t=int(input())\nwhile(...TRUNCATED)
| {"language":[2,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,3,2,2,0,3,2,2,2(...TRUNCATED)
| 820
| 3,000
| 2,800
|
[] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| ||||
1236_A. Stones
| "You are given a positive integer m and two integer sequence: a=[a_1, a_2, …, a_n] and b=[b_1, b_2(...TRUNCATED)
|
{
"input": [
"2\n3 1 1 5\n1 6 9\n3 2 6 7\n1 6 9"
],
"output": [
"38\n36"
]
}
|
{
"input": [],
"output": []
}
| {"input":["30\n16 3\n-334 -500 -169 -724 -478 -358 -962 -464 -705 -145 -281 -827 -961 -491 -995 -942(...TRUNCATED)
| 2
| 7
| {"language":[2,2,3,2,4,4,2,2,1,4,2,2,4,2,4,4,3,3,3,3,4,3,1,4,4,1,3,2,4,4,4,3,3,2,3,2,3,2,3,3,3,3,4,4(...TRUNCATED)
| {"language":[3,2,2,1,2,4,2,2,2,2,2,3,2,3,3,4,3,2,4,1,4,2,2,2,2,1,2,2,2,2,2,4,2,2,2,2,2,4,2,4,2,2,4,3(...TRUNCATED)
| 592
| 500
| 0
|
[] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| ||||
361_C. Levko and Array Recovery
| "You are given an array of n positive integers a_1, a_2, ..., a_n. You can perform the following ope(...TRUNCATED)
| {"input":["5\n2 1\n5 2\n10 3\n25 4\n15441 33\n"],"output":["\nUtkarsh\nAshish\nUtkarsh\nUtkarsh\nAsh(...TRUNCATED)
| {"input":["6\n396640239 62005863 473635171 329666981 510631133 207643327\n","4\n363034183 741262741 (...TRUNCATED)
| {"input":["3 313 856 964 421\n","3 3 1 11 9\n","2 2 9 8 1\n","61 538 623 89 548\n","7 202 512 995 37(...TRUNCATED)
| 3
| 9
| {"language":[1,1,1],"solution":["t = int(input())\nfor i in range(t):\n n = int(input())\n pri(...TRUNCATED)
| {"language":[4,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,4,2,2,2,4,2,4,2,2(...TRUNCATED)
| 536
| 0
| 0
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 268,435,456
| ||||
39_E. What Has Dirichlet Got to Do with That?
| "You are given a string of length n. Each character is one of the first p lowercase Latin letters.\n(...TRUNCATED)
| {"input":["5\n0 1\n1 2\n2 0\n3 0\n4 1\n","5\n3 4\n2 3\n2 4\n0 4\n1 2\n","3\n0 1\n1 2\n0 2\n"],"outpu(...TRUNCATED)
|
{
"input": [],
"output": []
}
| {"input":["19 23\nU..U..R........L...D...\n.D.....UL.U.U........DR\n..D.U..D....L......R...\nD......(...TRUNCATED)
| 6
| 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,1,1,1,1],"solution":["for _ i(...TRUNCATED)
| {"language":[2,4,2,2,2,2,2,2,2,2,1,2,2,3,1,2,2,2,4,4,2,2,1,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2(...TRUNCATED)
| 0
|
A
| 0
| 0
|
[
"brute force",
"implementation"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 512,000,000
|
End of preview. Expand
in Data Studio
edition_1778_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
- 11