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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
p00638 Old Bridges
| "problem\n\nAOR Ika is studying to pass the test.\n\nAOR Ika-chan solved the $ N $ question. After t(...TRUNCATED)
| {"input":["ababababa\n3\n2 1 7 aba\n1 5 c\n2 1 7 aba\n","abcdcbc\n5\n2 1 7 bc\n1 4 b\n2 4 7 bc\n1 2 (...TRUNCATED)
| {"input":["3\n121339 121339 121339 55451923 531222142 121339 121339 435485671 121339\n","3\n1 7 9232(...TRUNCATED)
| {"input":["3\nooe\n","36\naaiouyaaeeiioouuyyaaeeeeiiiooouuuyyy\n","3\npoo\n","1\nb\n","4\nooee\n","5(...TRUNCATED)
| 2
| 0
| {"language":[3,4,2,2,3,3,3,3,3,4,4,2,3,4,4,2,2,4,2,3,1,3,2,3,4,3,3,2,3,2,2,3,2,2,2,2,2,4,2,4,3,3,3,2(...TRUNCATED)
| {"language":[2,2,2,2,2,2,2,4,4,2,2,4,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2(...TRUNCATED)
| 1,129
|
D
| 0
| 0
|
[
"implementation",
"math"
] | false
| null | 134,217,728
| |||
pcsc1
| "G: Destiny Draw-\n\nproblem\n\nMr. D will play a card game. This card game uses a pile of N cards. (...TRUNCATED)
| {"input":["7 13 5\n2 3 10 7\n3 5 10 10\n1 2 10 6\n4 5 10 9\n3 4 10 8\n","4 100 3\n3 3 2 5\n1 1 3 2\n(...TRUNCATED)
| {"input":["wwwww w\n8\nwwwww wwwwwwww\nwwwwwwww wwwwwwwww\nwwwwwwwww wwwwwwwwww\nw www\nwwwwwwwwww w(...TRUNCATED)
| {"input":["20 10 3\nebebccacdb\neeebccddeT\neadebecaac\nadeeeaccbc\nbaccccdaed\nabbaecbaed\ndadbecba(...TRUNCATED)
| 3
| 10
| {"language":[3,2,3,1,2,3,3,3,4,4,2,3,1,2,3,1,3,1,1,3,4,3,4,2,3,2,4,3,3,1,2,3,3,2,3,1,3,1,2,4,3,3,4,3(...TRUNCATED)
| {"language":[2,2,2,2,4,2,4,4,2,2,2,2,2,2,2,1,2,2,4,4,2,2,4,2,2,2,2,2,3,2,2,2,2,3,2,2,2,1,2,2,2,2,2,2(...TRUNCATED)
| 0
| 0
| 0
|
[
"dsu",
"graphs",
"trees"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| ||||
586_F. Lizard Era: Beginning
| "Mister B once received a gift: it was a book about aliens, which he started read immediately. This (...TRUNCATED)
| {"input":["7 3\nabacaba\n1 1 1\n1 0 0\n1 0 0\n","7 3\nabacaba\n0 1 1\n1 0 0\n1 0 0\n","7 4\nbacadab\(...TRUNCATED)
| {"input":["24\n9 83\n90 31\n83 3\n83 3\n21 31\n83 3\n32 31\n12 21\n31 21\n90 32\n32 21\n12 9\n12 31\(...TRUNCATED)
| {"input":["3 1\n-1 3\n-2 -2\n","-8360 9282\n2666 2344\n9109 -2730\n","0 45\n42 -47\n-51 -42\n","45 6(...TRUNCATED)
| 2
| 8
| {"language":[2,2,2,2,2,2,2,2,2,3,3,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,4,2,2,2,2,2,4,2,3(...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)
| 1,211
|
B
| 500
| 2,400
|
[
"data structures",
"dfs and similar",
"dsu",
"graphs"
] | false
|
{
"nanos": 0,
"seconds": 1
}
| 134,217,728
| |||
list-sort
| "Vasya is currently at a car rental service, and he wants to reach cinema. The film he has bought a (...TRUNCATED)
| {"input":["4\n1000000000 1000000\n1000000000 1000000\n100000000 1000000\n1000000000 1000000\n","3\n9(...TRUNCATED)
| {"input":["1 3 0\n6 3 4\n","5 4 32\n4 2 1 1\n","32 6 635\n3 4 2 1 7 7\n","3 7 20012\n1 1 1 1 1 1 100(...TRUNCATED)
| {"input":["1\n2 3 Chandu\n\nSBMPLE","1\n2 4 Chandu\n\nELPMBT","51\n8 10 Chandu\n2 2959 Daspal\n2903 (...TRUNCATED)
| 6
| 8
| {"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],"solution":["def solve():\n\(...TRUNCATED)
| {"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,4,4,4,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2(...TRUNCATED)
| 0
|
I
| 1,750
| 0
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 3
}
| 268,435,456
| |||
272_B. Dima and Sequence
| "This is the easier version of the problem. In this version 1 ≤ n, m ≤ 100. You can hack this pr(...TRUNCATED)
|
{
"input": [
"5\net\neq\nbd\nbe\nbdp\n\nSAMPLE"
],
"output": [
"8"
]
}
|
{
"input": [],
"output": []
}
| {"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
| 0
| {"language":[4,3,3,3,3,3,3,3,3,2,3,3,4,3,3,3,4,4,3,3,4,3,3,3,3,3,3,3,4,2,3,1,3,3,3,3,3,3,3,3,3,3,4,3(...TRUNCATED)
| {"language":[4,3,2,4,4,3,4,2,2,4,3,2,4,2,2,2,2,4,4,4,2,4,2,4,3,3,4,4,2,4,4,2,2,4,2,2,4,4,2,2,3,3,4,2(...TRUNCATED)
| 709
|
C
| 1,000
| 2,000
|
[
"combinatorics",
"number theory"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 0
| |||
1129_D. Isolation
| "A trick of fate caused Hatsumi and Taku to come to know each other. To keep the encounter in memory(...TRUNCATED)
| {"input":["10\n10\n3 7\n1 4\n1 6\n5 5\n1 1\n3 9\n7 8\n1 2\n3 3\n7 10\n10\n2 4\n1 7\n3 4\n3 5\n2 8\n2(...TRUNCATED)
| {"input":["6\nbabcdc\n","5\nbadec\n","3\naba\n","7\nbaaaccb\n","3\naaa\n","4\npara\n","3\nbac\n","7\(...TRUNCATED)
| {"input":["aaaa b","dcba cb","aa`a a","dcac dc","a``a a","b abab","aaaa c","dcba bc","b baba","aaa` (...TRUNCATED)
| 6
| 6
| {"language":[1,1],"solution":["'''\n# Read input from stdin and provide input before running code\n\(...TRUNCATED)
|
{
"language": [],
"solution": []
}
| 1,081
| 1,000
| 0
|
[
"brute force",
"dp",
"strings",
"two pointers"
] | false
| "あなたは友人と旅行に行きたいと考えています。ところが、浪費癖のある(...TRUNCATED)
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| |||
bogosort
| "A and B are preparing themselves for programming contests.\n\nB loves to debug his code. But before(...TRUNCATED)
|
{
"input": [
"2\n3\n3 2 1\n6\n3 1 4 1 5 9\n"
],
"output": [
"3\n5\n"
]
}
| {"input":["99\n3\n5\n7\n9\n11\n13\n15\n17\n19\n21\n23\n25\n27\n29\n31\n33\n35\n37\n39\n41\n43\n45\n4(...TRUNCATED)
| {"input":["3\n2\n4\n10","3\n2\n6\n12","3\n4\n6\n12","3\n4\n6\n19","3\n2\n4\n19","3\n2\n3\n12","3\n4\(...TRUNCATED)
| 6
| 13
| {"language":[2,4,2,3,3,2,2,4,1,4,4,4,4,3,4,2,2,2,2,2,4,4,2,2,4,2,2,2,2,3,4,2,4,4,2,2,4,2,1,2,4,4,2,2(...TRUNCATED)
| {"language":[2,4,2,2,0,2,4,2,3,2,3,2,2,2,2,2,2,0,2,2,2,3,2,2,2,2,2,3,2,0,0,2,2,0,3,0,2,2,2,2,2,2,2,2(...TRUNCATED)
| 0
|
E
| 1,000
| 2,100
|
[
""
] | false
| null | 256,000,000
| |||
p03052 diverta 2019 Programming Contest - Edge Ordering
| "BigData Inc. is a corporation that has n data centers indexed from 1 to n that are located all over(...TRUNCATED)
|
{
"input": [
"5\nabvzx\n\nSAMPLE"
],
"output": [
"zx\n"
]
}
| {"input":["10\n5 7 0\n2 10 1\n1 5 0\n6 8 0\n4 9 1\n2 5 1\n10 8 0\n2 3 1\n4 2 1\n10\n9\n9\n9\n5\n2\n5(...TRUNCATED)
| {"input":["2\n3 6\n10 11","2\n1 3\n10 11","2\n0 6\n10 11","2\n0 6\n0 11","2\n3 6\n8 22","2\n3 6\n8 4(...TRUNCATED)
| 2
| 0
| {"language":[2,4,2,3,4,2,4,2,2,3,4,2,2,2,2,2,4,2,2,1,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,1,4,2,2,3,2,2,2,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)
| 0
|
D
| 0
| 1,600
|
[
"data structures",
"dfs and similar",
"dp",
"graphs",
"greedy",
"trees"
] | false
| null | 64,000,000
| |||
1170_E. Sliding Doors
| "Fox Ciel is playing a game. In this game there is an infinite long tape with cells indexed by integ(...TRUNCATED)
|
{
"input": [
"3\n4\n",
"5\n10\n",
"101\n99\n"
],
"output": [
"1",
"9",
"2"
]
}
| {"input":["61\n17357774\n248290406\n171408490\n20054376\n118774144\n110228788\n8827234\n85304880\n15(...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)
| 3
| 7
| {"language":[3,3,4,4,4,2,4,4,4,4,2,4,2,4,4,3,4,4,4,3,3,3,2,4,4,4,3,4,4,2,1,2,4,4,4,3,2,3,3,4,2,4,3,4(...TRUNCATED)
|
{
"language": [],
"solution": []
}
| 0
| 500
| 2,300
|
[
"data structures",
"greedy",
"sortings"
] | false
|
{
"nanos": 0,
"seconds": 1
}
| 256,000,000
| ||||
p01878 Destiny Draw
| "You've got array A, consisting of n integers and a positive integer k. Array A is indexed by intege(...TRUNCATED)
| {"input":["3\nAZAMON APPLE\nAZAMON AAAAAAAAAAALIBABA\nAPPLE BANANA\n"],"output":["AAZMON\n---\nAEPLP(...TRUNCATED)
| {"input":["3\n230967221047542071272908186525868331398921682471308664253988778356539397562182960087 1(...TRUNCATED)
| {"input":["5 9 4\n4 1 46\n1 3 29\n3 2 58\n1 5 61\n2 4 175\n1 2 87\n4 5 58\n3 5 69\n3 4 28\n2 7\n5 7\(...TRUNCATED)
| 6
| 8
| {"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,2(...TRUNCATED)
| {"language":[2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,4,4,1,1,2,4,2,1,2,4,2,2,2,4,2,4,2,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)
| 0
|
C
| 0
| 0
|
[] | false
|
{
"nanos": 0,
"seconds": 3
}
| 268,435,456
|
End of preview. Expand
in Data Studio
edition_1840_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
- -