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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1402_A. Fancy Fence
| "Some country is populated by wizards. They want to organize a demonstration.\n\nThere are n people (...TRUNCATED)
| {"input":["2 7 10\n3 12 10\n5 16 8\n","4 8 10\n0 12 3\n1 1 0\n0 3 11\n1 6 9\n","3 10 10\n0 12 10\n1 (...TRUNCATED)
| {"input":["3 1 2\n2\n1 1\n","3 1 2\n1\n8 61\n","3 0 3\n\n334 500 1001\n","20 16 16\n1 2 3 4 5 6 8 9 (...TRUNCATED)
| {"input":["30 1\n19 20 10 21 9 1 20 21 30 12 25 25 2 1 10 3 19 12 18 12 30 18 22 1 18 18 30 30 12\n"(...TRUNCATED)
| 2
| 7
| {"language":[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,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2(...TRUNCATED)
| {"language":[4,2,1,4,3,3,4,3,3,2,2,4,3,4,1,4,1,2,2,4,4,4,2,2,3,1,3,4,3,3,2,2,4,3,4,4,2,2,1,3,4,4,4,3(...TRUNCATED)
| 1,216
|
F
| 0
| 0
|
[] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| |||
1227_D1. Optimal Subsequences (Easy Version)
| "Awruk is taking part in elections in his school. It is the final round. He has only one opponent (...TRUNCATED)
|
{
"input": [
"3\nkek\npreceq\ncheburek\n",
"4\nmail\nai\nlru\ncf\n"
],
"output": [
"NO\n",
"cfmailru\n"
]
}
| {"input":["6\n0 41 48 86 94 14\n41 0 1 30 59 39\n48 1 0 9 31 49\n86 30 9 0 48 30\n94 59 31 48 0 33\n(...TRUNCATED)
| {"input":["1\n656 281\n","1\n666 760\n","2\n10 4\n1 5\n","1\n33993 6\n","1\n1656 9\n","1\n1425 1777\(...TRUNCATED)
| 1
| 0
| {"language":[3,2,4,2,2,4,2,2,4,4,2,2,2,2,4,2,2,2,2,2,2,4,4,4,4,2,2,2,2,4,4,2,2,1,2,2,2,4,2,4,2,2,4,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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2],"solut(...TRUNCATED)
| 0
|
D
| 750
| 1,100
|
[
"implementation",
"math"
] | true
|
{
"nanos": 0,
"seconds": 5
}
| 1,073,741,824
| |||
1110_E. Magic Stones
| "Cengiz recently learned Fibonacci numbers and now he is studying different algorithms to find them.(...TRUNCATED)
| {"input":["abc\ndefg\n","czaaab\nabcdef\n","aad\naac\n","abad\nbob\n"],"output":["-1\n","abczaa\n","(...TRUNCATED)
|
{
"input": [],
"output": []
}
| {"input":["10 23\n6 9 8 10 4 3 7 1 5 2\n7 2\n3 2\n2 4\n2 6\n7 5\n6 4\n10 7\n7 1\n6 8\n6 2\n8 10\n3 5(...TRUNCATED)
| 2
| 8
| {"language":[2,4,3,2,2,3,2,2,4,4,4,2,2,2,2,2,2,4,2,2,3,2,2,4,2,1,2,4,2,2,2,2,2,2,2,2,4,2,2,2,2,3,2,2(...TRUNCATED)
|
{
"language": [],
"solution": []
}
| 1,369
|
C
| 0
| 1,400
|
[] | false
|
{
"nanos": 0,
"seconds": 1
}
| 0
| |||
p00573 Commuter Pass
| "Ori and Sein have overcome many difficult challenges. They finally lit the Shrouded Lantern and fou(...TRUNCATED)
| {"input":["10 3 409693891\n","65 4 177545087\n","5 2 433416647\n"],"output":["2\n","910726\n","1\n"](...TRUNCATED)
|
{
"input": [],
"output": []
}
| {"input":["5 5 2\ns..#a\n.#...\ne#a.#\n...#a\n.#...","5 5 2\ns..#a\n.#../\n#.a#e\n...#a\n.#...","5 5(...TRUNCATED)
| 2
| 10
| {"language":[2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,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,2,2,2(...TRUNCATED)
| {"language":[3,4,2,4,2,3,3,3,3,2,2,3,3,3,3,3,3,3,3,2,2,3,3,3,3,3,1,3,1,1,2,2,3,2,3,1,2,2,4,3,3,3,3,3(...TRUNCATED)
| 776
|
C
| 0
| 0
|
[
""
] | false
| "Problem\n\n明日はいよいよマイヅ小学校の遠足の日である。マイヅ小学校に(...TRUNCATED)
| null | 0
| ||
578_C. Weakness and Poorness
| "Each item in the game has a level. The higher the level is, the higher basic parameters the item ha(...TRUNCATED)
| {"input":["12\n1\n2\n3\n4\n5\n6\n7\n8\n9\n10\n39\n691\n"],"output":["\n1\n-1\n2\n3\n-1\n5\n4\n7\n-1\(...TRUNCATED)
|
{
"input": [],
"output": []
}
|
{
"input": [],
"output": []
}
| 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],"solution":["for(...TRUNCATED)
|
{
"language": [],
"solution": []
}
| 1,012
|
C
| 1,000
| 2,500
|
[
"binary search",
"dp",
"sortings",
"two pointers"
] | false
| null | 268,435,456
| |||
814_C. An impassioned circulation of affection
| "Artem has an array of n positive integers. Artem decided to play with it. The game consists of n mo(...TRUNCATED)
|
{
"input": [
"500 100 1000",
"19 123 143",
"19 123 142",
"50 100 120"
],
"output": [
"No",
"No",
"Yes",
"Yes"
]
}
|
{
"input": [],
"output": []
}
| {"input":["4\n47\n47\n477\n4747477","4\n7\n47\n477\n4747477","4\n4\n47\n477\n4747477","4\n7\n7\n477\(...TRUNCATED)
| 5
| 3
| {"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,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,4(...TRUNCATED)
| {"language":[2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,0,2,2,2,2,2,3,2,2,4,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)
| 0
|
E
| 0
| 1,800
|
[
"math",
"number theory"
] | false
|
{
"nanos": 500000000,
"seconds": 0
}
| 256,000,000
| |||
p02916 AtCoder Beginner Contest 140 - Buffet
| "Mister B once received a gift: it was a book about aliens, which he started read immediately. This (...TRUNCATED)
|
{
"input": [
"2 5 4 0 4\n",
"4 5 9 2 1\n"
],
"output": [
"3\n",
"-1\n"
]
}
| {"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":["3 2\n1 2 5\n","3 10\n5 3 10\n","3 4\n0 2 5\n","1 100\n5\n","7 20\n2 15 12 11 20 19 12\n",(...TRUNCATED)
| 1
| 8
| {"language":[4,2,2,2,2,3,4,2,4,3,2,4,1,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,3,4,2,2,2,2,2,2,2,2,2,2,4,2,4(...TRUNCATED)
| {"language":[2,2,2,4,2,2,2,2,4,2,2,2,4,2,2,4,4,4,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,4,2,2,1,2,2,3,4,2(...TRUNCATED)
| 260
|
A
| 1,000
| 2,000
|
[
"data structures",
"greedy",
"implementation"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| |||
p01970 The Diversity of Prime Factorization
| "Gildong was hiking a mountain, walking by millions of trees. Inspired by them, he suddenly came up (...TRUNCATED)
|
{
"input": [
"7 4\n4 2 3 1 2 4 3\n",
"4 3\n2 1 3 1\n"
],
"output": [
"18\n",
"5\n"
]
}
| {"input":["1 1 2000000000\n1\n2\n","28 3 2099\n768 115 416 934 926 65 802 980 551 213 335 202 784 91(...TRUNCATED)
| {"input":["728961319347 41296937719710726 52437 42819\n","567018385179 15765533940665693 70514 13819(...TRUNCATED)
| 2
| 10
| {"language":[2,4,2,2,2,1,2,2,4,2,2,2,4,2,2,2,4,2,4,2,2,2,4,2,2,3,3,4,2,1,2,2,4,4,4,4,2,2,1,2,2,2,2,2(...TRUNCATED)
| {"language":[4,2,4,2,2,2,2,2,2,1,4,2,2,2,2,1,4,2,2,3,2,2,2,2,2,2,4,2,2,2,1,2,1,2,2,2,2,2,2,4,2,2,2,2(...TRUNCATED)
| 20
| 0
| 1,700
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 6
}
| 256,000,000
| ||||
p00163 Highway Toll
| "On Children's Day, the child got a toy from Delayyy as a present. However, the child is so naughty (...TRUNCATED)
|
{
"input": [
"1\n1"
],
"output": [
"4"
]
}
| {"input":["3\n3 2 3\n","3\n1 3 1\n","5\n1 1 2 1 1\n","5\n1 1 1 1 2\n","4\n562617869 562617869 562617(...TRUNCATED)
| {"input":["2\n0 0\n","3\n0 1 1\n","3\n0 0 1\n","3\n0 2 0\n","5\n0 0 1 1 10\n","5\n0 0 1 1 6\n","15\n(...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,4,2,2,2,2,2,2,2,2,2(...TRUNCATED)
| {"language":[2,2,2,2,2,4,4,4,3,2,2,3,2,4,4,2,3,4,4,2,4,4,2,2,2,2,2,4,2,2,4,4,4,2,4,2,2,4,4,2,2,2,2,2(...TRUNCATED)
| 1,227
|
A
| 2,000
| 0
|
[] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| |||
prpaln
| "We have a string X, which has an even number of characters. Half the characters are `S`, and the ot(...TRUNCATED)
| {"input":["2\n2 2\n3 3\n","2\n2 2\n4 1\n"],"output":[" (...TRUNCATED)
|
{
"input": [],
"output": []
}
| {"input":["61\n17357774\n248290406\n171408490\n20054376\n118774144\n110228788\n8827234\n85304880\n15(...TRUNCATED)
| 2
| 8
| {"language":[2,2,2,2,2,2,2,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,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)
| {"language":[3,3,2,2,3,2,1,1,2,3,2,4,2,2,4,1,4,4,3,2,3,3,4,4,4,4,1,3,2,2,4,2,4,4,4,2,2,2,4,4,1,2,3,2(...TRUNCATED)
| 1,451
| 0
| 2,200
|
[
"implementation",
"math"
] | false
|
{
"nanos": 0,
"seconds": 1
}
| 256,000,000
|
End of preview. Expand
in Data Studio
edition_2628_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
- 23