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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
316_B2. EKG
| "Emily's birthday is next week and Jack has decided to buy a present for her. He knows she loves boo(...TRUNCATED)
| {"input":["3 4 3 10\n3\n3 1 4\n4 5 9\n3 10 10\n","1 1 2 10\n2\n1 1 3\n2 6 10\n","5 7 6 11\n3\n5 3 8\(...TRUNCATED)
|
{
"input": [
"2\nacxz\nbcxz"
],
"output": [
"Funny\nNot Funny\n"
]
}
| {"input":["2 1 5\n1 1 1 8\n2 2 1 1\n1 2 1 1\n1 2 1 3\n2 2 1 2\n","5 1 5\n1 5 1 3\n1 5 1 2\n2 2 2 5\n(...TRUNCATED)
| 3
| 0
| {"language":[3,4,4,2,2,4,2,4,4,2,4,2,4,2,4,3,2,1,3,2,3,3,2,4,3,3,3,3,2,3,3,2,3,4,2,2,3,2,4,4,4,3,3,2(...TRUNCATED)
| {"language":[2,4,4,3,4,2,3,2,2,4,4,1,2,1,2,4,3,4,3,3,4,3,1,3,2,4,2,3,3,3,3,2,4,3,2,3,3,4,2,2,3,4,4,2(...TRUNCATED)
| 143
| 1,000
| 1,300
|
[
"data structures",
"greedy"
] | false
|
{
"nanos": 0,
"seconds": 1
}
| 536,870,912
| ||||
find-the-nth-prime
| "Hasan loves playing games and has recently discovered a game called TopScore. In this soccer-like g(...TRUNCATED)
| {"input":["3 4\n5 6\n3 3\n2 2\n1 1\n0 0"],"output":["#.#.\n.#.#\n#.#.\n\n#.#.#.\n.#.#.#\n#.#.#.\n.#.(...TRUNCATED)
|
{
"input": [],
"output": []
}
| {"input":["2 7\n4\n2\n1\n0\n-1\n-2\n-4\n131\n137\n2 7\n4\n2\n1\n0\n-1\n-2\n-4\n124\n123\n10 7\n-4\n-(...TRUNCATED)
| 5
| 0
|
{
"language": [],
"solution": []
}
| {"language":[2,3,2,2,3,0,3,2,2,2,2,2,2,3,2,2,2,4,2,2,2,2,2,2,3,3,3,2,4,2,4,3,3,2,3,2,0,2,2,2,3,2,2,3(...TRUNCATED)
| 25
|
E
| 0
| 0
|
[] | false
|
{
"nanos": 0,
"seconds": 5
}
| 256,000,000
| |||
39_E. What Has Dirichlet Got to Do with That?
| "Today Peter has got an additional homework for tomorrow. The teacher has given three integers to hi(...TRUNCATED)
| {"input":["5\n4 5\n10 8 6 4\n1 2 3 4 5\n1 1\n3\n3\n1 1\n3\n2\n5 3\n1000 2 2 2 3\n3 1 5\n5 5\n1 2 3 4(...TRUNCATED)
|
{
"input": [],
"output": []
}
| {"input":["9\n53 138 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\n3(...TRUNCATED)
| 2
| 11
| {"language":[3,1,2,2,2,2,2,4,2,2,2,3,3,3,2,2,3,4,2,2,2,3,2,3,2,3,3,3,2,3,2,3,1,4,1,3,2,2,2,1,1,2,2,2(...TRUNCATED)
| {"language":[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,2,2,2,2,2,2,2,2,2,2,2,2],"solution":[(...TRUNCATED)
| 0
|
C
| 0
| 0
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 1
}
| 256,000,000
| |||
760_F. Bacterial Melee
| "The Berland capital (as you very well know) contains n junctions, some pairs of which are connected(...TRUNCATED)
| {"input":["5 4 10 1 6\n1 1 5\n1 5 5\n1 3 2\n1 5 2\n2 1\n2 2\n","5 2 2 1 8\n1 1 2\n1 5 3\n1 2 1\n2 2\(...TRUNCATED)
| {"input":["20 10000000\n8861863 2169292 3484361 511558 5975675 1413584 774309 5847326 6668965 253146(...TRUNCATED)
| {"input":["11--01--2013-02-2013-01--01--2013\n","00-12-2014-00-12-2013-00-12-2014-12-12-2014\n","23-(...TRUNCATED)
| 2
| 7
| {"language":[1,2,4,3,2,2,2,3,4,2,3,1,2,2,4,2,4,4,2,2,1,4,4,2,4,2,2,2,2,2,3,1,2,2,4,4,4,1,2,2,3,4,2,3(...TRUNCATED)
| {"language":[2,2,2,2,2,2,2,2,2,2,1,2,2,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,4,2,2,2,2,2(...TRUNCATED)
| 937
|
C
| 0
| 0
|
[] | false
| null | 256,000,000
| |||
1250_B. The Feast and the Bus
| "A and B are preparing themselves for programming contests.\n\nB loves to debug his code. But before(...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": [],
"output": []
}
| {"input":["9\n72 49 39 50 68 35 75 158 56\n","4\n2 4 1 2\n","8\n3 4 3 1 1 3 6 1\n","1\n1\n","7\n2 1 (...TRUNCATED)
| 2
| 6
| {"language":[2,2,2,2,2,2,2,2,2,3,2,2,2,2,4,2,2,2,2,2,2,4,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3(...TRUNCATED)
| {"language":[4,3,3,4,4,2,2,4,3,1,2,4,2,3,4,2,3,1,4,3,2,2,3,4,3,2,3,2,3,2,4,4,3,2,2,2,2,2,2,4,2,4,2,3(...TRUNCATED)
| 0
|
C
| 0
| 0
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| |||
jumping-frog
| "You are given a graph with 3 ⋅ n vertices and m edges. You are to find a matching of n edges, or (...TRUNCATED)
| {"input":["icm codeforces\n1\ncodeforces technex\n","ross rachel\n4\nross joey\nrachel phoebe\nphoeb(...TRUNCATED)
|
{
"input": [],
"output": []
}
| {"input":["4\ncba\ncab\nb\na\n3\nbca\nab\na\n5\nabc\nacb\nb\nc\nc\n5\nabc\nacc\nc\nb\nb\n0","4\ncba\(...TRUNCATED)
| 2
| 11
| {"language":[2,2,4,2,2,2,3,3,4,3,2,3,3,3,2,2,3,4,2,2,3,4,3,3,2,3,2,3,2,3,4,3,3,2,3,3,2,4,2,2,2,4,3,2(...TRUNCATED)
| {"language":[2,2,0,0,2,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,0,2,0,2,2,2,2,2,2,0,2,2,0,2,2,2,2,2,0,0,0(...TRUNCATED)
| 0
|
A
| 500
| 0
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| |||
793_F. Julia the snail
| "Once upon a time, there was a king who loved beautiful costumes very much. The king had a special c(...TRUNCATED)
|
{
"input": [
"3\n5\n7\n10\n\nSAMPLE"
],
"output": [
"2\n3\n5\n"
]
}
|
{
"input": [],
"output": []
}
| {"input":["26\n0.98 0.64 0.06 0.90 0.01 0.73 0.21 0.98 0.65 1.00 0.87 0.85 0.01 0.06 0.65 0.00 0.65 (...TRUNCATED)
| 6
| 9
| {"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,4,2,2,2,4,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)
| {"language":[2,3,4,2,4,2,2,3,1,2,3,2,4,2,3,3,4,2,2,4,4,2,2,4,3,2,2,4,4,4,3,4,4,2,2,4,4,3,2,3,2,4,2,1(...TRUNCATED)
| 1,311
| 0
| 1,900
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 0
| ||||
p00365 Age Difference
| "Suppose you have a string S which has length N and is indexed from 0 to N−1. String R is the reve(...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": [],
"output": []
}
| {"input":["1000\nspnogbxcrp\nbaukbqnmyu\nogxdxhtcwz\nbsjufplykz\nkhicdrdixl\nzookiqggel\nfczygjfhfa\(...TRUNCATED)
| 2
| 7
| {"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": [],
"solution": []
}
| 0
|
C
| 1,000
| 1,600
|
[
"greedy"
] | false
| null | 256,000,000
| |||
875_D. High Cry
| "There are N oases on a number line. The coordinate of the i-th oases from the left is x_i.\n\nCamel(...TRUNCATED)
|
{
"input": [
"2\naazz\n",
"3\nabcabcabz\n"
],
"output": [
"azaz",
"-1\n"
]
}
| {"input":["6\n396640239 62005863 473635171 329666981 510631133 207643327\n","4\n363034183 741262741 (...TRUNCATED)
| {"input":["4 4 3\n1 2 3\n1 2 1\n2 3 3\n1 3 3\n1 4 4\n","5 4 2\n4 5\n1 2 100\n1 3 100\n3 4 10\n3 5 20(...TRUNCATED)
| 2
| 7
| {"language":[2,3,2,2,2,2,2,2,2,2,2,2,2,4,2,2,3,4,2,2,2,2,2,2,2,2,2,2,2,4,2,4,4,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)
| {"language":[4,2,1,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,0,0,2,2,2,2,4,2,2,2,3,0,2,2],(...TRUNCATED)
| 1,184
|
B
| 1,250
| 3,200
|
[
"dp"
] | false
|
{
"nanos": 0,
"seconds": 3
}
| 256,000,000
| |||
p02120 Cluster Network
| "Peter got a new snow blower as a New Year present. Of course, Peter decided to try it immediately. (...TRUNCATED)
|
{
"input": [
"3,4,5\n5,5,8\n4,4,4\n5,4,3"
],
"output": [
"1\n2"
]
}
|
{
"input": [],
"output": []
}
| {"input":["10803140200\n","14\n","11\n","174813966899\n","13753962\n","601828654335\n","114141413978(...TRUNCATED)
| 3
| 10
| {"language":[1],"solution":["t = int(raw_input())\nfor _ in range(t):\n n, m, k = map(int, raw_in(...TRUNCATED)
| {"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,4,2,4,2,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)
| 868
| 0
| 0
|
[
"binary search",
"data structures",
"greedy",
"implementation"
] | false
|
{
"nanos": 0,
"seconds": 1
}
| 256,000,000
|
End of preview. Expand
in Data Studio
edition_1751_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
- 4