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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
846_E. Chemistry in Berland
| "Andrew plays a game called \"Civilization\". Dima helps him.\n\nThe game has n cities and m bidirec(...TRUNCATED)
| {"input":["2 3\n1 2\n1 2\n1 2\n","5 7\n2 4\n5 1\n2 3\n3 4\n4 1\n5 3\n3 5\n"],"output":["5 6 ","10 9 (...TRUNCATED)
| {"input":["1 1\n1\n2\n","6 3\n1 2 3 4 5 6\n3 5 1\n","5 5\n5 6 3 2 1\n4 3 1 5 6\n","1 1\n1\n1\n","10 (...TRUNCATED)
| {"input":["10\n-405 -230 252 -393 -271 -259 97 163 81 -129\n","10\n1 10 2 9 6 8 4 7 5 6\n","4\n1 2 5(...TRUNCATED)
| 2
| 7
| {"language":[1,2,4,2,3,3,3,4,3,3,4,3,4,2,3,3,4,4,2,3,4,2,4,4,2,3,3,2,2,1,3,3,3,3,2,4,3,4,4,4,3,3,3,2(...TRUNCATED)
|
{
"language": [],
"solution": []
}
| 1,195
|
F
| 1,250
| 3,200
|
[
"brute force",
"greedy",
"implementation"
] | false
|
{
"nanos": 0,
"seconds": 1
}
| 134,217,728
| |||
p01738 Gravity Point
| "Recenlty Luba got a credit card and started to use it. Let's consider n consecutive days Luba uses (...TRUNCATED)
|
{
"input": [
"7\n1\n2\n3\n12\n12345\n15116544\n387420489\n"
],
"output": [
"0\n-1\n2\n-1\n-1\n12\n36\n"
]
}
|
{
"input": [],
"output": []
}
| {"input":["19 23\nU..U..R........L...D...\n.D.....UL.U.U........DR\n..D.U..D....L......R...\nD......(...TRUNCATED)
| 2
| 8
| {"language":[4,2,3,3,4,2,4,4,2,2,2,3,1,2,4,2,3,4,3,2,3,3,3,3,3,2,3,3,3,2,4,4,2,3,3,2,4,3,2,3,3,2,4,2(...TRUNCATED)
|
{
"language": [],
"solution": []
}
| 1,081
| 500
| 0
|
[] | false
|
{
"nanos": 0,
"seconds": 1
}
| 134,217,728
| ||||
662_C. Binary Table
| "You are given an array a of n integers.\n\nYou want to make all elements of a equal to zero by doin(...TRUNCATED)
| {"input":["5\n4\n1 2 3 4\n5 10 15 20\n4\n1 2 1 2\n5 10 15 20\n4\n2 2 4 1\n2 8 19 1\n2\n1 1\n6 9\n1\n(...TRUNCATED)
|
{
"input": [],
"output": []
}
| {"input":["1 0\n25 47 15","1 0\n16 47 15","1 0\n31 47 15","2 0\n31 47 13","2 0\n31 47 20","2 0\n31 4(...TRUNCATED)
| 2
| 0
|
{
"language": [],
"solution": []
}
|
{
"language": [],
"solution": []
}
| 1,297
|
E
| 0
| 0
|
[
"dp",
"two pointers"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| |||
980_E. The Number Games
| "Description\nYou are given two strings S and T, such that length of S is greater than the length of(...TRUNCATED)
|
{
"input": [
"2 3\n",
"1 1\n",
"49 1808\n"
],
"output": [
"6\n",
"0\n",
"359087121\n"
]
}
| {"input":["48 1976\n30 97 84\n80 81 84\n41 70 86\n23 57 80\n17 60 85\n36 48 81\n51 87 81\n38 85 81\n(...TRUNCATED)
| {"input":["10\n4643665 282618243 791521863 214307200 976959598 590907019 166397456 708291256 8537738(...TRUNCATED)
| 2
| 0
| {"language":[2,2,3,1,3,1,2,3,4,3,3,4,1,3,1,1,3,1,1,3,3,4,3,4,3,2,2,3,3,4,2,1,2,2,4,2,1,4,3,3,4,4,2,3(...TRUNCATED)
| {"language":[2,2,2,0,0,2,2,3,3,2,2,2,3,3,2,0,3,2,2,2,2,2,2,2,3,2,2,2,4,2,2,2,2,2,2,0,2,2,2,2,3,2,2,0(...TRUNCATED)
| 0
|
F
| 0
| 900
|
[
"brute force",
"greedy"
] | false
| null | 0
| |||
1269_E. K Integers
| "Utkarsh is forced to play yet another one of Ashish's games. The game progresses turn by turn and a(...TRUNCATED)
|
{
"input": [
"1 2 1\n1 100 1\n1 100 100\n",
"100 100 100\n1 1 1\n1 1 1\n"
],
"output": [
"99",
"0"
]
}
| {"input":["1 999999999 29983 29989\n","9999999 10000 29983 29989\n","808351 17767 433 509\n","197 2 (...TRUNCATED)
|
{
"input": [],
"output": []
}
| 5
| 8
| {"language":[2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,4,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,4,2(...TRUNCATED)
| {"language":[2,4,2,2,3,3,4,3,3,4,1,3,2,3,2,4,2,3,4,2,3,3,2,2,2,4,3,2,3,4,2,2,4,4,3,2,4,2,3,2,4,3,4,3(...TRUNCATED)
| 914
| 0
| 1,800
|
[
""
] | false
|
{
"nanos": 500000000,
"seconds": 0
}
| 256,000,000
| ||||
789_A. Anastasia and pebbles
| "Petya studies positional notations. He has already learned to add and subtract numbers in the syste(...TRUNCATED)
|
{
"input": [
"3\n1 2 3\n",
"3\n2 2 2\n",
"2\n2 1\n"
],
"output": [
"3\n1 2 3 \n1 2 3 ",
"1\n1 1 1 \n2 ",
"-1"
]
}
| {"input":["20\n.*..*...*....*.....*\n","97\n****.***.***.*..**.**.*.*.***.*............*..*......*.*(...TRUNCATED)
| {"input":["+dab\n+abac\n-abac\n+baca\n","+Dmitry\n+Mike\nDmitry:All letters will be used\nDmitry:qwe(...TRUNCATED)
| 2
| 8
| {"language":[2,2,2,4,4,2,2,2,2,2,4,2,2,2,4,2,4,2,4,4,2,4,2,4,2,2,4,2,2,2,4,2,2,4,4,4,2,4,2,4,4,1,4,4(...TRUNCATED)
| {"language":[2,2,2,2,2,4,4,4,4,3,2,3,4,3,4,3,4,3,2,4,2,2,4,3,3,4,3,2,2,2,1,4,3,4,2,3,4,3,1,4,3,3,4,2(...TRUNCATED)
| 0
| 0
| 3,000
|
[
"bitmasks",
"brute force",
"fft",
"strings",
"trees"
] | false
|
{
"nanos": 0,
"seconds": 3
}
| 64,000,000
| ||||
p02876 AtCoder Grand Contest 040 - Balance Beam
| "Employees of JebTrains are on their way to celebrate the 256-th day of the year! There are n employ(...TRUNCATED)
|
{
"input": [
"3 8\n6 5 8\n",
"7 20\n21 15 12 11 20 19 12\n"
],
"output": [
"2\n",
"6\n"
]
}
| {"input":["264193194 -448876521 736684426 -633906160 -328597212 -47935734\n","-357531221 381512519 -(...TRUNCATED)
| {"input":["999 999\n1 1\n1 2\n2 1\n2 2\n1 3\n2 0\n<...>\n26 13\n26 14\n26 15\n26 16\n\n1 700 8(...TRUNCATED)
| 6
| 7
| {"language":[2,2,2,2,4,2,2,4,4,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,4,2,2,2,4,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)
| 0
|
B
| 0
| 1,900
|
[
"dfs and similar",
"dp",
"games",
"graphs"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| |||
1413_F. Roads and Ramen
| "Tavak and Seyyed are good friends. Seyyed is very funny and he told Tavak to solve the following pr(...TRUNCATED)
|
{
"input": [
"3\n2999999 43 2999957\n",
"6\n2 3 2 3 2 2\n"
],
"output": [
"3\n",
"3\n"
]
}
|
{
"input": [],
"output": []
}
| {"input":["2 0\n1 2\n","2 1\n1 3\n","3 3\n1 2\n1 5\n2 3\n","2 0\n1 0\n","4 0\n1 0\n","4 0\n1 -1\n","(...TRUNCATED)
| 2
| 10
| {"language":[2,2,2,4,2,2,2,4,2,2,2,2,4,2,2,2,2,1,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,2,2,1,4,2,4,2,2,2,4,2(...TRUNCATED)
| {"language":[2,4,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2(...TRUNCATED)
| 1,304
|
D2
| 0
| 1,900
|
[
"implementation",
"math"
] | false
| null | 0
| |||
830_A. Office Keys
| "The King of a little Kingdom on a little island in the Pacific Ocean frequently has childish ideas.(...TRUNCATED)
| {"input":["3\n1 1 101\n1 2 1\n3 2 1\n","5\n1 1 2 2 3\n2 2 4 3 3\n3 3 1 1 1\n"],"output":["5\n","5\n"(...TRUNCATED)
| {"input":["2 1\n7 1 1\n2 1 1\n","5 1\n2 1 0\n2 0 1\n1 0 1\n1 1 0\n1 0 1\n","6 2\n6 0 0\n11 1 0\n9 0 (...TRUNCATED)
| {"input":["11\n7\n8\n9\n10\n11\n12\n13\n14\n27\n16\n17","11\n7\n8\n9\n10\n11\n22\n13\n2\n27\n8\n17",(...TRUNCATED)
| 2
| 0
| {"language":[2,2,2,2,2,2,2,2,2,2,2,2,1,2,4,2,2,2,2,4,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2(...TRUNCATED)
| {"language":[3,2,3,2,4,4,2,4,3,4,4,4,2,4,3,4,4,4,2,4,2,2,3,4,4,3,2,3,3,3,3,2,2,4,4,4,2,3,4,4,4,4,4,2(...TRUNCATED)
| 507
|
A
| 2,000
| 800
|
[] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| |||
p00127 Pocket Pager Input
| "Coach Ankit is forming a team for the Annual Inter Galactic Relay Race. He has N students that trai(...TRUNCATED)
| {"input":["3 2 998244353\n","9 3 998244353\n","3 1 998244353\n","9 4 998244353\n"],"output":["665496(...TRUNCATED)
|
{
"input": [],
"output": []
}
| {"input":["SSTTTSST","STTTSS","SSSTTT","TTTSSS","TTTTSSSS","TSTSST","SSTTTS","TSSTST","STTSST","TSSS(...TRUNCATED)
| 6
| 0
| {"language":[1],"solution":["p=10**9+7;\n\ndef modpow(x,n):\n\tif(n==0):\n\t\treturn 1;\n\telif(n%2=(...TRUNCATED)
|
{
"language": [],
"solution": []
}
| 868
| 750
| 2,500
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
|
End of preview. Expand
in Data Studio
edition_1753_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