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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1297_E. Modernization of Treeland
| "Problem Statement\n\nYou are given a list of $N$ intervals. The $i$-th interval is $[l_i, r_i)$, wh(...TRUNCATED)
|
{
"input": [
"4\n7 2 4 12\n7 15 10 12\n",
"3\n4 4 4\n1 2 3\n"
],
"output": [
"Yes\n",
"No\n"
]
}
|
{
"input": [
"60 0 58",
"7 3 7"
],
"output": [
"630738177",
"195634923"
]
}
| {"input":["2\n1 1 6 1\n3\n0 1 2\n","2\n2 0 4 3\n4\n1 2 0 2\n","2\n1 1 6 2\n3\n0 1 2\n","2\n2 0 4 6\n(...TRUNCATED)
| 2
| 0
| {"language":[2,2,2,2,2,2,2,2,4,4,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,4,3,2(...TRUNCATED)
| {"language":[4,2,4,3,2,2,3,4,2,4,3,3,3,4,2,2,4,3,4,2,2,2,3,4,2,2,2,2,4,3,4,2,2,4,2,2,4,3,2,3,4,2,2,2(...TRUNCATED)
| 1,506
|
C
| 0
| 1,500
|
[
"bitmasks",
"dp",
"graphs",
"number theory"
] | true
|
{
"nanos": 0,
"seconds": 5
}
| 0
| |||
p02117 Picnic
| "You are given an array A of size N, and Q queries to deal with. For each query, you are given an in(...TRUNCATED)
| {"input":["4\nSSSSEEEECCCCEECCCC\nCCCCCSSSSEEECCCCSS\nSSSSSEEESSCCCCCCCS\nEESSSSCCCCCCSSEEEESAMPLE"](...TRUNCATED)
| {"input":["4\n3 4\n1 2\n3 4\n1 2\n","4\n2 4\n1 3\n4 4\n1 1\n","10\n6 6\n1 2\n2 2\n6 7\n8 8\n3 5\n5 5(...TRUNCATED)
| {"input":["1 1 1\n\n0\n\n0\n\n2344\n\n0\n\n0\n\n0\n","1 1 1\n\n0\n\n0\n\n0\n\n0\n\n0\n\n1\n","4 3 2\(...TRUNCATED)
| 3
| 11
| {"language":[2,2,2,2,2,2,2,2,2,4,4,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,2,2,4,2,2,2,2,2(...TRUNCATED)
| {"language":[4,2,2,2,2,4,2,2,2,4,2,4,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,3,2,2,2,4,2,2,2,2,2,2,2(...TRUNCATED)
| 45
|
B
| 0
| 2,400
|
[
"dp",
"games"
] | false
|
{
"nanos": 0,
"seconds": 3
}
| 0
| |||
p00860 The Morning after Halloween
| "The blinds are known to consist of opaque horizontal stripes that can be rotated thus regulating th(...TRUNCATED)
| {"input":["9 10\n1 2 3 4 5 6 7 8 9\n1 2\n2 3\n2 4\n3 4\n4 5\n4 6\n2 7\n7 8\n7 9\n9 1","2 1\n1 2\n1 2(...TRUNCATED)
|
{
"input": [],
"output": []
}
| {"input":["+dab\n+abac\n-abac\n+baca\n","+Dmitry\n+Mike\nDmitry:All letters will be used\nDmitry:qwe(...TRUNCATED)
| 3
| 12
| {"language":[1,4,2,4,2,3,4,4,2,4,3,4,2,2,4,4,3,1,2,1,1,2,4,2,4,4,4,4,2,4,4,2,2,3,2,4,2,2,2,4,1,1,2,3(...TRUNCATED)
|
{
"language": [],
"solution": []
}
| 0
|
A
| 0
| 0
|
[
"math"
] | false
|
{
"nanos": 0,
"seconds": 1
}
| 256,000,000
| |||
bobs-journey-5
| "Consider an infinite triangle made up of layers. Let's number the layers, starting from one, from t(...TRUNCATED)
| {"input":["4\n3 3\n1 2\n2 3\n3 1\n3 6\n1 2\n2 1\n2 3\n3 2\n1 3\n3 1\n7 10\n1 2\n2 3\n3 1\n1 4\n4 5\n(...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": [],
"output": []
}
| 2
| 7
| {"language":[3,2,2,4,3,4,4,3,3,3,2,1,1,2,3,2,4,4,3,4,3,4,3,2,3,4,1,3,1,3,3,3,1,2,3,1,2,4,3,4,1,3,3,3(...TRUNCATED)
| {"language":[2,0,2,2,0,2,2,0],"solution":["#include <bits/stdc++.h>\n#define pq priority_queue\nusin(...TRUNCATED)
| 0
|
D
| 1,000
| 2,500
|
[] | false
| null | 0
| |||
483_B. Friends and Presents
| "Background\n\nThe kindergarten attached to the University of Aizu is a kindergarten where children (...TRUNCATED)
|
{
"input": [
"3\n2\n6\n10"
],
"output": [
"2\n1826/189\n877318/35343\n"
]
}
| {"input":["2\nFF\n","5\nIIIIF\n","5\nFAFFF\n","2\nFA\n","3\nAAA\n","5\nFAIAF\n","5\nAIFFF\n","3\nFFF(...TRUNCATED)
| {"input":["2\n1 1 1 1 1 0 0 0 0 0\n0 0 0 0 0 1 1 1 1 1\n0 -2 -2 -2 -2 -2 -1 -1 -1 -1 -1\n0 -2 -2 -2 (...TRUNCATED)
| 2
| 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,3,2,2,2,2,2,2],"solutio(...TRUNCATED)
| {"language":[2,1,4,2,4,2,2,4,2,2,4,4,3,2,2,4,2,2,4,3,2,2,4,3,1,4,2,4,4,2,2,3,4,1,3,4,4,4,2,2,2,2,4,4(...TRUNCATED)
| 76
|
F
| 1,500
| 1,100
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 8
}
| 256,000,000
| |||
954_F. Runner's Problem
| "One foggy Stockholm morning, Karlsson decided to snack on some jam in his friend Lillebror Svantens(...TRUNCATED)
| {"input":["21\n\n7\n\n17\n\n15\n\n17\n\n11\n\n-1\n\n15\n\n"],"output":["+ 12 16\n\n- 6 10\n\n* 8 15\(...TRUNCATED)
|
{
"input": [],
"output": []
}
| {"input":["314159\n1","25\n1","100\n2","314159\n3","999999999999999999999999999999999999999999999999(...TRUNCATED)
| 6
| 0
| {"language":[2,3,2,2,2,2,2,4,2,2,2,2,4,2,2,2,2,2,2,3,2,4,2,4,2,3,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,1,2(...TRUNCATED)
|
{
"language": [],
"solution": []
}
| 1,030
|
A
| 0
| 0
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| |||
give-me-my-test-monk
| "Flatland is inhabited by pixels of three colors: red, green and blue. We know that if two pixels of(...TRUNCATED)
| {"input":["4 3\nabc\naba\nadc\nada\n10 10 10\n10 1 10\n10 10 10\n10 1 10\n","4 5\nabcde\nabcde\nabcd(...TRUNCATED)
| {"input":["21 3 -3 3 -3 3 -3 19 3 -3 3 -3 3 -3 19 3 -3 3 -3 3 -3 19","2 8 -100\n5 -1000 5 1000 500 2(...TRUNCATED)
| {"input":["2 2\n6 3\nMonday Tuesday Wednesday\n8 4\nThursday Friday Saturday Sunday\n2 2\n7 3\nMonda(...TRUNCATED)
| 2
| 8
| {"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":[1,3,2,2,2,4,4,2,2,2,2,2,2,2,4,2,2,4,2,2,2,2,2,4,4,2,4,3,1,2,1,2,1,2,4,4,2,2,2,4,4,2,4,4(...TRUNCATED)
| 0
|
A
| 0
| 2,700
|
[
"combinatorics",
"dp"
] | false
|
{
"nanos": 0,
"seconds": 1
}
| 256,000,000
| |||
962_F. Simple Cycles Edges
| "You are given a sequence of n integers a1, a2, ..., an. \n\nDetermine a real number x such that the(...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":["5\neu\neq\nbd\nbe\nbdp\n\nSAMPLE","5\neu\neq\nbd\nbe\ndbp\n\nSAMQLE","5\neu\neq\nbd\nbd\n(...TRUNCATED)
| 2
| 0
| {"language":[3,1,2,4,2,2,1,4,1,4,2,4,4,4,2,2,2,2,2,3,2,3,4,4,2,4,3,1,3,2,1,4,3,1,3,1,4,3,4,2,3,2,4,4(...TRUNCATED)
| {"language":[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,2(...TRUNCATED)
| 746
|
D
| 0
| 1,700
|
[] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| |||
1250_B. The Feast and the Bus
| "Dima and Inna love spending time together. The problem is, Seryozha isn't too enthusiastic to leave(...TRUNCATED)
|
{
"input": [
"3\n3 2 1\n",
"3\n1 2 3\n",
"3\n2 3 1\n"
],
"output": [
"2 1\n",
"0 0\n",
"0 1\n"
]
}
| {"input":["8\n2 3 5 7 11 13 17 19\n4 8 7 1 5 2 6 3\n","1\n2\n2\n","1\n1000000000\n100000\n","1\n1\n1(...TRUNCATED)
| {"input":["1\n1\n3\n2\n","3\n1 1 2\n1 0 3\n1 1 4\n","3\n1 1 101\n1 2 1\n1 2 1\n","8\n148933105 19040(...TRUNCATED)
| 2
| 0
| {"language":[3,3,2,2,4,3,1,1,4,3,2,3,1,2,2,4,2,2,4,2,4,2,2,4,1,2,2,1,1,4,4,2,2,2,1,4,3,1,1,4,4,3,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)
| 80
|
C
| 0
| 2,600
|
[
"implementation",
"sortings",
"strings"
] | false
| null | 256,000,000
| |||
152_E. Garden
| "Two players play the following game. Initially, the players have a knife and a rectangular sheet of(...TRUNCATED)
| {"input":["4","3"],"output":["0 111 157 193\n111 0 224 239\n157 224 0 258\n193 239 258 0","0 6 15\n6(...TRUNCATED)
| {"input":["100\n04\n9\n02163\n003000\n08041479\n80750340926070052\n90056\n11680\n90\n090208090090209(...TRUNCATED)
| {"input":["3 3\n1 2 -10 23\n1 3 1 1\n2 3 -10 -1\n","10 9\n1 2 3 -5\n2 3 5 -7\n3 4 7 -9\n4 5 8 -11\n5(...TRUNCATED)
| 2
| 2
| {"language":[2,4,4,4,4,4,4,4,4,4,4,4,2,2,4,4,4,4,2,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,2,4,4,4,4(...TRUNCATED)
| {"language":[2,2,2,2,2,2,2,3,2,3,2,2,3,3,2,3,2,2,2,2,2,2,2,3,2,2,2,3,2,3,2,3,2,3,2,3,2,2,2,2,2,3,2,2(...TRUNCATED)
| 980
|
B
| 0
| 1,500
|
[] | false
|
{
"nanos": 0,
"seconds": 1
}
| 0
|
End of preview. Expand
in Data Studio
edition_2343_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
- 26