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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
p00493 Zig-Zag Numbers
| "Taro is an elementary school student who has just learned multiplication. Somehow, he likes multipl(...TRUNCATED)
| {"input":["3\n6 10 16","3\n6 10 15","3\n3 4 5"],"output":["not coprime","setwise coprime","pairwise (...TRUNCATED)
| {"input":["9\n53 80 94 41 58 49 88 24 42\n85 11 32 64 40 56 63 95 73\n17 85 60 41 13 71 54 67 87\n38(...TRUNCATED)
| {"input":["5 2 1\n0.1 0.2 0.3 0.5915213038191143 0.5\n6 2 2\n0.1 0.2 0.3 0.4 0.5 0.6\n0 0 0","5 2 1\(...TRUNCATED)
| 1
| 0
| {"language":[3,4,3,1,3,1,2,3,4,3,3,2,3,2,4,3,2,2,2,1,1,2,3,3,3,3,3,2,4,4,4,2,4,4,2,4,3,3,4,1,3,4,1,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],"solution":["#include <bits/stdc++.h(...TRUNCATED)
| 1,374
| 0
| 0
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| ||||
371_B. Fox Dividing Cheese
| "Polycarp has n coins, the value of the i-th coin is a_i. It is guaranteed that all the values are i(...TRUNCATED)
|
{
"input": [
"5 2\n3 -5 3 -5 3\n",
"3 2\n1 2 4\n",
"6 3\n4 3 4 3 2 5\n"
],
"output": [
"0\n",
"1\n",
"3\n"
]
}
| {"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":["0\n2130761060 2000000000 1\n","0\n1 1723177055 2000000000\n","12\nAnka likes Dracul\nDrac(...TRUNCATED)
| 6
| 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":[2,2,2,4,4,4,2,4,2,2,1,4,4,2,1,2,2,4,4,2,2,2,4,4,2,2,2,3,4,2,2,2,4,2,2,4,3,2,2,2,4,2,3,2(...TRUNCATED)
| 0
| 0
| 2,000
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| ||||
626_D. Jerry's Protest
| "Serge came to the school dining room and discovered that there is a big queue here. There are m pup(...TRUNCATED)
| {"input":["2\n1 2\n1 2\n","4\n100 42\n42 100\n5 42\n100 5\n","3\n1 2\n2 4\n3 4\n"],"output":["0\n","(...TRUNCATED)
| {"input":["1 1\na\n10\n","1 20\naaaaaaaaaaaaaaaaaaaa\n924705 786913 546594 427698 741583 189683 3540(...TRUNCATED)
|
{
"input": [],
"output": []
}
| 3
| 7
| {"language":[4,2,3,3,4,4,4,2,2,2,2,3,4,3,2,4,3,4,4,2,4,4,3,2,4,3,4,3,4,4,3,3,2,4,2,4,2,4,4,3,4,4,2,2(...TRUNCATED)
|
{
"language": [],
"solution": []
}
| 0
| 0
| 1,900
|
[
"constructive algorithms",
"dp",
"flows",
"graph matchings",
"greedy",
"sortings"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| ||||
1107_D. Compression
| "There are n points on a coordinate axis OX. The i-th point is located at the integer point x_i and (...TRUNCATED)
| {"input":["10\n","3\n"],"output":["1 2 3 4 5 6 7 8 9 \n2 4 6 8 10 12 14 16 18 \n3 6 9 1(...TRUNCATED)
|
{
"input": [],
"output": []
}
| {"input":["1\n2 3 Chandu\n\nSBMPLE","1\n2 4 Chandu\n\nELPMBT","51\n8 10 Chandu\n2 2959 Daspal\n2903 (...TRUNCATED)
| 1
| 9
| {"language":[4,4,4,4,2,4,2,2,2,2,4,2,1,2,2,2,2,2,2,4,3,2,2,2,2,2,4,2,2,2,2,2,4,4,4,2,2,4,2,2,2,4,2,4(...TRUNCATED)
| {"language":[2,2,2,2,2,4,3,3,2,4,2,2,2,2,2,2,2,2,2,4,2,3,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,4,2,2,3,2,2,2(...TRUNCATED)
| 0
| 0
| 0
|
[
"combinatorics",
"math",
"number theory"
] | false
|
{
"nanos": 0,
"seconds": 8
}
| 0
| ||||
621_D. Rat Kwesh and Cheese
| "problem\n\nIf you write a positive integer in decimal notation (without leading 0) and look at the (...TRUNCATED)
| {"input":["5 2\n3 1 5 4 2\n5 2\n5 4\n","3 3\n3 1 2\n1 2\n3 1\n3 2\n","2 1\n1 2\n1 2\n"],"output":["1(...TRUNCATED)
|
{
"input": [],
"output": []
}
| {"input":["5\n1 4 4 5 2","9\n1 2 4 9 5 8 7 6 6","9\n1 2 4 9 5 8 4 6 6","5\n0 4 4 5 1","2\n1 0","2\n1(...TRUNCATED)
| 3
| 12
| {"language":[4,4,4,4,4,4,4,3,3,2,4,4,4,3,3,4,2,2,4,3,3,3,4,3,1,2,2,3,1,2,4,1,1,4,2,2,4,1,3,3,4,4,4,3(...TRUNCATED)
|
{
"language": [],
"solution": []
}
| 0
|
D
| 0
| 0
|
[
"dfs and similar",
"graphs",
"hashing",
"shortest paths"
] | false
|
{
"nanos": 0,
"seconds": 8
}
| 256,000,000
| |||
1413_F. Roads and Ramen
| "You are given a square board, consisting of n rows and n columns. Each tile in it should be colored(...TRUNCATED)
| {"input":["1\n0\n","6\n2 0 3 0 1 1\n","6\n3 2 2 2 1 1\n"],"output":["0\n\n","5\n6 6\n5 5\n4 3\n4 5\n(...TRUNCATED)
| {"input":["100 3\n45 1 2 3 4 5 6 7 8 9 19 21 24 27 28 30 34 35 37 39 40 41 42 43 46 47 48 51 52 55 5(...TRUNCATED)
| {"input":["7 9\n1 9\n5 9\n5 7\n5 9\n1 1\n6 8\n3 4","7 9\n1 9\n9 9\n5 7\n5 9\n1 1\n6 8\n3 4","7 11\n1(...TRUNCATED)
| 6
| 0
| {"language":[3,3,4,2,2,3,4,4,2,2,2,4,3,3,3,4,1,4,2,3,2,3,4,2,2,4,2,2,4,3,4,2,3,2,4,2,4,2,2,3,2,1,3,4(...TRUNCATED)
| {"language":[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,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)
| 835
|
C1
| 0
| 0
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 1
}
| 268,435,456
| |||
1065_F. Up and Down the Tree
|
Example
Input
2 -3 4
L 2 5
? 3 5
Output
2
L 4
L 3
| {"input":["15\nyamatonadeshiko\n10\n1 a\n2 a\n3 a\n4 a\n5 a\n1 b\n2 b\n3 b\n4 b\n5 b\n","6\nkoyomi\n(...TRUNCATED)
|
{
"input": [],
"output": []
}
| {"input":["ecneyek","ashkfyha","eeyofscienck","mnyszsbzpf","ecneyel","arhkfyha","eeyofsciencj","mnys(...TRUNCATED)
| 2
| 0
| {"language":[3,3,3,3,4,1,3,1,3,4,2,3,2,3,3,4,3,1,2,4,1,3,4,4,4,3,2,2,3,4,4,2,4,2,2,4,3,3,2,3,3,2,3,3(...TRUNCATED)
| {"language":[2,0,0,2,2,2,2,2,2,2,0,0,0,0,2,2,0,3,0,0,0,0,2,2,0,2,2,2,2,0,2,2,2,0,0],"solution":["#in(...TRUNCATED)
| 1,053
|
B
| 0
| 3,400
|
[
"data structures",
"greedy",
"implementation"
] | false
| null | 32,000,000
| |||
p02613 AtCoder Beginner Contest 173 - Judge Status Summary
| "Snuke has decided to play a game, where the player runs a railway company. There are M+1 stations o(...TRUNCATED)
| {"input":["1 5 3\n1 3\n1 1\n1 5\n","2 2 3\n1 2\n2 2\n2 1\n","4 3 6\n1 2\n1 3\n2 2\n2 3\n3 1\n3 3\n"](...TRUNCATED)
| {"input":["1000 1001\n217 636 713 516\n","1000 1998\n833 681 19 233\n","4 5\n1 3 4 2\n","6 7\n3 1 2 (...TRUNCATED)
| {"input":["4","101","5","001","8","6","2","110","10","13","111","12","17","9","7","14","16","11","22(...TRUNCATED)
| 6
| 0
| {"language":[2,2,2,2,2,2,2,2,2,4,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,2,4,2,2,2,2,2,2,2(...TRUNCATED)
| {"language":[3,2,3,2,2,2,2,2,4,2,4,2,2,2,4,2,2,4,2,2,4,2,3,3,2,3,4,2,2,4,4,2,2,2,2,2,1,4,4,2,4,2,2,2(...TRUNCATED)
| 1,466
|
A
| 0
| 0
|
[
"binary search",
"data structures",
"sortings",
"two pointers"
] | false
| null | 256,000,000
| |||
ism1
| "You are given N positive integers a_1, a_2, ..., a_N.\n\nFor a non-negative integer m, let f(m) = ((...TRUNCATED)
| {"input":["5 3\n1 2 3 4 0\n4 1 2 14 3\n","7 3\n1 2 3 4 3 2 6\n6 3 1 4 2 2 3\n","4 4\n0 1 2 3\n0 1 2 (...TRUNCATED)
|
{
"input": [],
"output": []
}
| {"input":["3\nAZAMON APPLE\nAZOMAN AAAAAAAAAAALIBABA\nAPPLE BANANA\n","3\nAZAMNO ELPPA\nAZAMON AAAAA(...TRUNCATED)
| 2
| 10
| {"language":[4,3,2,2,3,2,4,3,3,2,2,4,2,2,4,3,3,3,2,2,4,3,4,3,3,3,3,3,3,4,1,4,4,2,3,4,1,2,2,2,3,2,3,3(...TRUNCATED)
|
{
"language": [],
"solution": []
}
| 830
|
D
| 250
| 1,800
|
[] | false
|
{
"nanos": 0,
"seconds": 1
}
| 0
| |||
494_A. Treasure
| "In this problem you will meet the simplified model of game King of Thieves.\n\nIn a new ZeptoLab ga(...TRUNCATED)
| {"input":["1\n1\n","2\n1 2\n3 4\n","4\n5 7 8 4\n9 5 3 2\n1 6 6 4\n9 5 7 3\n"],"output":["0\n","2\n",(...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":["21 6\n12 15 14 4 4 7 3 4 11 1 15 4 12 11 12 8 11 12 3 4 4\n","50 25\n19 1 17 6 4 21 9 16 (...TRUNCATED)
| 2
| 7
| {"language":[3,2,2,4,2,2,2,4,3,3,4,4,4,4,2,2,4,2,1,2,2,3,3,4,1,4,4,4,3,3,3,4,3,3,2,2,2,2,2,2,3,4,2,2(...TRUNCATED)
| {"language":[2,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,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(...TRUNCATED)
| 0
| 0
| 2,200
|
[] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
|
End of preview. Expand
in Data Studio
edition_2694_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
- 2