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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
p00260 Cats Going Straight
| "Pavel loves grid mazes. A grid maze is an n × m rectangle maze where each cell is either empty, or(...TRUNCATED)
|
{
"input": [
"100\n200\n5"
],
"output": [
"13"
]
}
| {"input":["aabbaaaa\naaaaabab\n","qgiufelsfhanx\naaaaaaaaaaaaa\n","abcddd\nbacddd\n","azzz\nzzaz\n",(...TRUNCATED)
| {"input":["3\n2 3\n3 6\n1 2\n3\n2 3\n3 5\n2 2\n0","3\n2 3\n3 6\n2 2\n3\n3 3\n3 6\n2 2\n0","3\n2 1\n3(...TRUNCATED)
| 6
| 7
| {"language":[1,1,1,1,1,1,1,1],"solution":["a=[]\nt,k=input(),input()\nfor _ in xrange(t):\n\ta.appen(...TRUNCATED)
| {"language":[2,2,3,2,2,2,2,2,4,4,4,2,4,2,4,2,2,3,2,2,2,2,2,2,4,4,2,3,2,2,4,2,2,2,2,2,2,3,2,4,4,2,2,4(...TRUNCATED)
| 0
| 0
| 0
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 1
}
| 64,000,000
| ||||
180_D. Name
| "Jack is the most intelligent student in the class.To boost his intelligence,his class teacher gave (...TRUNCATED)
| {"input":["4\n1 2\n1 3\n1 2\n1 2\n1 3\n1 2\n2 5\n1 2\n3 1\n1 4\n5 1\n1 6\n2 15\n1 2\n1 3\n1 4\n1 5\n(...TRUNCATED)
|
{
"input": [],
"output": []
}
| {"input":["72\n111101100111001110000000100010100000111011100110001010111010101011111100\n","3\n001\n(...TRUNCATED)
| 2
| 0
| {"language":[2,3,4,3,2,2,3,3,1,2,4,4,2,2,2,4,4,4,1,2,4,3,2,2,3,4,3,3,2,3,4,2,2,3,2,1,3,2,4,4,3,4,4,1(...TRUNCATED)
| {"language":[3,4,3,3,2,3,2,4,2,3,2,2,4,3,2,2,4,3,4,4,4,3,2,2,4,3,1,2,3,2,4,4,4,3,4,3,3,2,4,2,4,3,3,4(...TRUNCATED)
| 1,421
|
D
| 1,500
| 0
|
[
"dp",
"games"
] | false
|
{
"nanos": 0,
"seconds": 1
}
| 256,000,000
| |||
digital-numbers
| "In this problem you will meet the simplified model of game King of Thieves.\n\nIn a new ZeptoLab ga(...TRUNCATED)
|
{
"input": [
"6 5\n1 2 2 4 2 3\n",
"7 5\n3 3 2 1 1 1 3\n"
],
"output": [
"4\n",
"2\n"
]
}
| {"input":["1 10\n700282491 332230980 954401907 59481241 188256336 995466811 463183048 725322957 8929(...TRUNCATED)
| {"input":["5 5 2\n#####\n#A#B#\n# #\n#b#a#\n#####\n16 4 3\n################\n## ########## ##\n# (...TRUNCATED)
| 5
| 11
| {"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":[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)
| 168
|
A
| 0
| 1,600
|
[
"divide and conquer",
"hashing",
"sortings",
"strings"
] | false
| null | 0
| |||
931_A. Friends Meeting
| "Everybody knows that we have been living in the Matrix for a long time. And in the new seventh Matr(...TRUNCATED)
| {"input":["10 9 3 1\n10 9 11\n9 2 37\n2 4 4\n4 1 8\n1 5 2\n5 7 3\n7 3 2\n3 8 4\n8 6 13\n2 3\n","9 11(...TRUNCATED)
| {"input":["10\n62159435 282618243 791521863 214307200 976959598 590907019 166397456 708291256 853773(...TRUNCATED)
| {"input":["20 20\n1 9\n11 9\n3 5\n15 13\n1 20\n11 18\n10 6\n10 8\n10 19\n12 16\n10 3\n9 18\n8 7\n15 (...TRUNCATED)
| 2
| 10
| {"language":[2,4,3,2,3,1,3,4,3,2,4,4,3,3,2,2,2,3,1,1,1,2,2,3,4,4,3,4,1,1,2,3,1,2,4,2,3,4,3,3,3,2,1,4(...TRUNCATED)
| {"language":[4,2,2,2,4,4,1,2,4,2,2,4,2,2,4,3,2,3,2,4,2,2,4,2,3,4,1,2,2,4,4,2,2,2,2,4,2,4,2,2,2,2,4,4(...TRUNCATED)
| 223
|
C
| 0
| 3,400
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 1
}
| 256,000,000
| |||
316_B2. EKG
| "Polycarp has recently created a new level in this cool new game Berlio Maker 85 and uploaded it onl(...TRUNCATED)
|
{
"input": [
"5\n2 4 2\n5 10 4\n3 10 1\n1 2 3\n4 6 5\n"
],
"output": [
"6\n4\n1\n3\n10\n"
]
}
|
{
"input": [],
"output": []
}
| {"input":["11\n1 2 3 4 5 6 7 8 9 10 11\n2\n1 4 7","11\n1 2 3 4 5 6 2 8 9 10 11\n2\n1 4 1","11\n1 2 3(...TRUNCATED)
| 2
| 0
| {"language":[3,2,3,2,2,3,3,3,3,4,4,2,3,3,4,2,3,4,2,3,2,2,3,2,2,3,4,2,2,3,3,3,3,3,2,2,2,3,4,3,3,2,1,2(...TRUNCATED)
| {"language":[3,2,2,2,2,2,2,2,0,2,2,2,2,2,0,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,2(...TRUNCATED)
| 0
| 1,000
| 0
|
[
"math",
"probabilities"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| ||||
p01219 Private Teacher
|
Example
Input
3 2
3
1 2 1
2 3 2
3 3 1
Output
1
| {"input":["3 3 2\n1 2 3\n1 2 3\n1 2 3\n1 2\n3 3\n","4 5 4\n1 4 5 1 2\n2 2 2 2 7\n2 4 1 4 5\n3 2 1 7 (...TRUNCATED)
| {"input":["1.0 200.0 200.0\n","0.2 0.1 0.6\n","1.9 3.0 4.1\n","51.8 51.8 7.1\n","113.9 125.2 88.8\n"(...TRUNCATED)
| {"input":["2\n1 0\n50 50\n50","4\n2 3 4 1\n13 5 1 24\n45 9 15","4\n2 3 4 1\n13 5 1 24\n45 9 16","4\n(...TRUNCATED)
| 3
| 9
| {"language":[1,3,2,2,2,3,4,2,4,3,3,3,2,3,1,3,3,3,3,3,3,2,3,4,3,3,4,3,3,3,3,3,4,3,4,2,3,3,2,3,4,3,3,3(...TRUNCATED)
| {"language":[4,1,3,2,2,4,2,4,2,4,3,1,4,3,1,2,4,4,2,1,2,4,2,2,2,2,4,2,1,2,3,2,4,4,3,4,2,2,2,3,2,2,4,1(...TRUNCATED)
| 1,424
|
D
| 0
| 1,100
|
[] | false
| "Problem\n\n$n$枚のカードからなる束があり、下から$i$番目のカードには$i$が(...TRUNCATED)
|
{
"nanos": 0,
"seconds": 2
}
| 536,870,912
| ||
893_A. Chess For Three
| "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":["2\n1 2\n","3\n1 2\n2 3\n","5\n1 2\n1 3\n1 4\n2 5\n","6\n1 2\n1 3\n1 4\n2 5\n2 6\n"],"outp(...TRUNCATED)
| {"input":["4 0 0\n1 -1\n1 3\n3 3\n3 -1\n","3 0 0\n-10 1\n0 2\n1 1\n","3 0 0\n-1 1\n0 3\n1 1\n","20 -(...TRUNCATED)
| {"input":["2\n0 1\n","5\n0 0 1 0 1\n","100\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 (...TRUNCATED)
| 2
| 0
| {"language":[2,3,2,3,3,2,2,1,3,2,3,4,4,3,4,4,3,2,2,2,2,2,2,4,4,4,4,4,3,2,2,4,2,4,2,2,3,2,2,4,2,4,2,4(...TRUNCATED)
| {"language":[4,4,4,2,2,2,2,2,4,2,4,2,4,2,4,1,2,2,2,2,4,2,2,2,4,4,4,2,2,2,2,2,2,4,4,2,2,2,2,2,2,4,4,1(...TRUNCATED)
| 1,397
|
B
| 0
| 2,400
|
[
"brute force",
"data structures",
"implementation"
] | false
|
{
"nanos": 0,
"seconds": 1
}
| 268,435,456
| |||
p02445 Swap
| "Given a string, S, we define some operations on the string as follows:\n\na. reverse(S) denotes the(...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":["30\n10 1 8 10 2 6 45 7 3 7 1 3 1 1 14 2 5 19 4 1 13 3 5 6 1 5 1 1 23 1\n98 4 43 41 56 58 (...TRUNCATED)
| {"input":["11\n54 91 4 6 88 23 38 71 77 10 84\n","20\n12 37 81 56 61 2 26 27 59 69 24 7 71 76 45 54 (...TRUNCATED)
| 5
| 11
| {"language":[2,2,2,2,2,2,2,2,2,2],"solution":["#include <bits/stdc++.h>\nusing namespace std;\n#defi(...TRUNCATED)
| {"language":[2,2,2,2,4,2,2,2,2,2,2,1,4,3,2,2,2,2,2,1,2,3,2,2,2,4,4,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)
| 39
|
F
| 0
| 1,700
|
[
"dfs and similar",
"graphs"
] | false
|
{
"nanos": 0,
"seconds": 6
}
| 256,000,000
| |||
980_E. The Number Games
| "Bhavana and Bhuvana place bet every time they see something interesting that can occur with a proba(...TRUNCATED)
| {"input":["o.x.\no...\n.x..\nooxx\n","x.ox\nox..\nx.o.\noo.x\n","xx..\n.oo.\nx...\noox.\n","x..x\n..(...TRUNCATED)
|
{
"input": [],
"output": []
}
| {"input":["5\n2 8 1 7 9\n","4\n6 2 4 5\n","3\n3 1 3\n","200\n2 1 1 1 2 1 2 1 1 1 2 1 2 2 2 1 1 2 1 2(...TRUNCATED)
| 2
| 8
| {"language":[1],"solution":["T = int(raw_input())\nfor ti in xrange(T):\n\ta,b,c = map(int,raw_input(...TRUNCATED)
|
{
"language": [],
"solution": []
}
| 615
| 2,000
| 0
|
[
"number theory"
] | true
|
{
"nanos": 0,
"seconds": 2
}
| 268,435,456
| ||||
p02834 AtCoder Beginner Contest 148 - Playing Tag on Tree
| "A factory produces thimbles in bulk. Typically, it can produce up to a thimbles a day. However, som(...TRUNCATED)
|
{
"input": [
"3\n2\n<>\n3\n><<\n1\n>\n"
],
"output": [
"0\n0\n0\n"
]
}
|
{
"input": [],
"output": []
}
| {"input":["61\n17357774\n248290406\n171408490\n20054376\n118774144\n110228788\n8827234\n85304880\n15(...TRUNCATED)
| 2
| 0
| {"language":[2,4,2,2,2,3,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,3,2,4(...TRUNCATED)
| {"language":[4,1,2,2,2,2,2,4,2,4,3,4,4,2,4,3,3,3,2,2,3,2,3,4,4,4,4,2,2,3,3,2,2,2,2,2,2,3,4,2,3,2,4,2(...TRUNCATED)
| 0
| 0
| 2,400
|
[
"constructive algorithms"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
|
End of preview. Expand
in Data Studio
edition_1799_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
- -