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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1136_D. Nastya Is Buying Lunch
| "problem\n\nGiven $ N $ different natural numbers $ a_i $. I decided to make a pair by choosing a di(...TRUNCATED)
|
{
"input": [
"6\n5 2 4 6 1 3",
"6\n5 6 4 2 1 3"
],
"output": [
"1 2 3 4 5 6\n3",
"1 2 3 4 5 6\n4"
]
}
|
{
"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
| 11
| {"language":[2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,4,4,4,2,2,4,2,2,2,2,2,2,2,2,2,2,4(...TRUNCATED)
|
{
"language": [],
"solution": []
}
| 1,110
| 0
| 0
|
[
""
] | false
| "Problem\n\nKND君は会津大学に在籍する学生プログラマである。彼の胸元はと(...TRUNCATED)
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| |||
536_C. Tavas and Pashmaks
| "Harry, upon inquiring Helena Ravenclaw's ghost, came to know that she told Tom Riddle or You-know-w(...TRUNCATED)
|
{
"input": [
"2\n5\n6 5 4 3 2\n5\n3 4 3 1 1"
],
"output": [
"6\n5\n"
]
}
|
{
"input": [],
"output": []
}
| {"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(...TRUNCATED)
| 2
| 9
| {"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":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,4,2,2,4,4,2,2,2,2,2,2,4,2,2,4,2,4,2,2,2,2,2(...TRUNCATED)
| 0
|
E
| 1,250
| 1,100
|
[
"brute force"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| |||
1304_E. 1-Trees and Queries
| "There are N slimes standing on a number line. The i-th slime from the left is at position x_i.\n\nI(...TRUNCATED)
| {"input":["5\n7\n1\n9\n7\n3\n","10\n100\n1\n100\n1\n100\n1\n100\n1\n100\n1\n"],"output":["1 3 7 7 9 (...TRUNCATED)
| {"input":["30 35 4 30\n14 2 7\n22 23 2\n5 26 3\n28 4 3\n7 5 29\n19 15 2\n11 20 12\n1 22 9\n30 21 24\(...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)
| 6
| 0
| {"language":[3,4,3,2,2,3,3,1,3,4,2,4,1,3,3,1,1,3,3,2,1,3,2,4,2,3,3,1,3,2,2,2,3,3,1,2,3,4,4,4,3,4,3,3(...TRUNCATED)
|
{
"language": [],
"solution": []
}
| 903
|
F
| 0
| 0
|
[] | false
| null | 256,000,000
| |||
laddu
| "Let's consider the following game. We have a rectangular field n × m in size. Some squares of the (...TRUNCATED)
|
{
"input": [
"10 30 10\n",
"2 6 3\n",
"5 20 11\n"
],
"output": [
"85932500\n",
"124780545\n",
"1\n"
]
}
| {"input":["20 20\n00010110100100010111\n11110000001100101110\n01110101110001111000\n1011110100011111(...TRUNCATED)
| {"input":["6\n0 1 3 2 2 2\n","4\n0 2 1 1\n","4\n3 1 1 0\n","4\n1 2 1 0\n","6\n0 0 0 2 1 1\n","4\n1 1(...TRUNCATED)
| 2
| 7
| {"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,1,1,1,1(...TRUNCATED)
|
{
"language": [],
"solution": []
}
| 830
|
D
| 1,500
| 3,000
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 8
}
| 0
| |||
substrings-count-3
| "Artem has an array of n positive integers. Artem decided to play with it. The game consists of n mo(...TRUNCATED)
|
{
"input": [
"3\n3 2 2\n",
"4\n2 2 2 2\n"
],
"output": [
"4\n",
"3\n"
]
}
| {"input":["3 8\n2 4 4 4\n7 2 5 2\n6 5 6 3\n20\n3 2 U 1000000\n3 2 U 1\n3 2 U 2\n3 2 U 3\n3 2 U 4\n3 (...TRUNCATED)
| {"input":["13\n1\n>\n1\n?\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n","3\n2(...TRUNCATED)
| 2
| 10
| {"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":[4,4,2,1,2,4,4,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,4,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,1,2,2,2,2(...TRUNCATED)
| 662
|
F
| 1,250
| 0
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 8
}
| 256,000,000
| |||
656_E. Out of Controls
| "The HR manager was disappointed again. The last applicant failed the interview the same way as 24 p(...TRUNCATED)
| {"input":["1\n3\n1 2\n2 3\n1\n1\n1\n2\n2\n1\n","2\n6\n1 2\n1 3\n1 4\n4 5\n4 6\n4\n1 3 4 5\n3\n3 5 2\(...TRUNCATED)
| {"input":["10\ntypedef errtype** ucywcaykzh\ntypeof &ucywcaykzh*********\ntypedef &&&&&&void********(...TRUNCATED)
| {"input":["3 10 10\n1\n1 1 1\n1\n3 3 3\n1\n5 5 5\n0 1 1\n1 0 0\n0 1 0","1 10 3\n3\n1 10 1\n2 20 2\n3(...TRUNCATED)
| 2
| 10
| {"language":[3,3,3,3,3,2,3,3,3,3,3,4,4,4,3,2,3,3,3,2,3,2,2,3,2,4,2,3,3,3,4,2,2,3,2,2,2,3,3,3,3,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)
| 415
|
C
| 0
| 1,500
|
[] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| |||
stadium
| "Polycarp often uses his smartphone. He has already installed n applications on it. Application with(...TRUNCATED)
|
{
"input": [
"2 5 4 0 4\n",
"4 5 9 2 1\n"
],
"output": [
"3\n",
"-1\n"
]
}
| {"input":["205078485761\n","873109054817\n","518649879439\n","401021537803\n","821985629174\n","6146(...TRUNCATED)
|
{
"input": [],
"output": []
}
| 2
| 11
| {"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,4,2,2,2(...TRUNCATED)
| {"language":[4,4,3,2,4,1,3,2,2,3,4,4,2,1,1,2,3,4,3,2,3,2,2,2,3,3,3,3,4,4,3,2,2,4,4,2,4,3,3,2,1,2,4,2(...TRUNCATED)
| 1,236
|
A
| 1,250
| 0
|
[
"greedy"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 134,217,728
| |||
1189_A. Keanu Reeves
| "Two boys decided to compete in text typing on the site \"Key races\". During the competition, they (...TRUNCATED)
|
{
"input": [
"2 2\n2 3\n2 3\n2 3\n2 2\n3 2",
"2 2\n2 3\n2 3\n2 3\n2 2\n2 2"
],
"output": [
"yes",
"no"
]
}
| {"input":["5 0\n884430748 884430748 708433020 708433020 708433020\n","2 1\n1 1\n","2 0\n2 1\n","5 2\(...TRUNCATED)
| {"input":["2\n0 1\n","5\n0 0 1 0 1\n","100\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 (...TRUNCATED)
| 2
| 0
| {"language":[4,3,2,4,3,4,2,4,4,2,3,3,2,3,3,3,3,3,4,2,3,2,3,2,4,4,2,4,3,2,4,3,2,4,4,3,2,2,4,3,3,4,2,4(...TRUNCATED)
| {"language":[0,0,0,0,2,0,2,0,2,2,2,1,2,4,2,2,1,4,2,2,0,2,0,4,2,0,0,0,2,0,2,0,3,0,0,2,2,0,2,3,0,2,4,2(...TRUNCATED)
| 89
| 0
| 2,500
|
[
"constructive algorithms"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 268,435,456
| ||||
1451_D. Circle Game
| "Imagine a game played on a line. Initially, the player is located at position 0 with N candies in h(...TRUNCATED)
| {"input":["7 2\n-10 -4 -2 0 2 4 10","16 19\n-49 -48 -33 -30 -21 -14 0 15 19 23 44 52 80 81 82 84","3(...TRUNCATED)
| {"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(...TRUNCATED)
| {"input":["5 2","1 972439611840","1 110","1 2","1 534720932937","1 18","1 010","1 3","1 867963093279(...TRUNCATED)
| 2
| 9
| {"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,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
| 1,900
|
[] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| |||
rrcode
| "You are working as a private teacher. Since you are giving lessons to many pupils, you are very bus(...TRUNCATED)
| {"input":["3 3\n1 3\n2 3\n3 3\n","3 1\n1 1\n2 2\n3 3\n","7 3\n1 7\n3 8\n4 5\n6 7\n1 3\n5 10\n8 9\n",(...TRUNCATED)
|
{
"input": [],
"output": []
}
| {"input":["20 10 3\nebebccacdb\neeebccddeT\neadebecaac\nadeeeaccbc\nbaccccdaed\nabbaecbaed\ndadbecba(...TRUNCATED)
| 2
| 11
| {"language":[4,4,2,3,4,4,2,2,4,2,1,4,4,2,2,2,2,2,2,2,2,2,1,2,1,3,2,2,2,2,2,2,2,2,2,2,2,3,2,4,4,4,2,2(...TRUNCATED)
|
{
"language": [],
"solution": []
}
| 157
| 1,250
| 1,800
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 134,217,728
|
End of preview. Expand
in Data Studio
edition_1945_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