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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1236_A. Stones
| "Long long ago, there was a thief. Looking for treasures, he was running about all over the world. O(...TRUNCATED)
|
{
"input": [
"3\n2 3 4\n2 1\n1\n-1\n"
],
"output": [
"56\n"
]
}
|
{
"input": [],
"output": []
}
| {"input":["bcccccccccccaaacaaaaccccccbaaaaaabbbccbbbbbbaaaaaaaaaccccccccaaaaaaaaaaaaaaccccccaaaaaaaa(...TRUNCATED)
| 2
| 8
| {"language":[4,4,3,4,2,4,3,3,3,3,4,3,2,3,4,3,3,3,3,3,2,4,2,1,2,3,2,4,1,2,2,4,2,3,4,3,4,2,4,2,3,2,3,2(...TRUNCATED)
| {"language":[2,2,2,2,4,2,2,1,2,1,2,2,4,1,4,2,2,2,1,2,2,2,2,4,4,2,2,2,4,1,4,2,2,2,2,2,2,4,2,3,1,1,3,2(...TRUNCATED)
| 915
|
E
| 1,000
| 2,600
|
[
"implementation"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| |||
sherlock-and-kgb
| "You are running through a rectangular field. This field can be represented as a matrix with 3 rows (...TRUNCATED)
| {"input":["3 3 5\n4 4 0\n1 3\n3 2\n3 1\n","4 5 4\n2 1 0 3\n4 3\n3 2\n1 2\n1 4\n1 3\n"],"output":["1\(...TRUNCATED)
| {"input":["11 20\n1 2\n2 7 6\n1 7\n4 10 9 3 2\n2 9 2\n1 3\n0\n0\n3 1 6 7\n4 11 7 5 6\n2 2 8\n4\n","5(...TRUNCATED)
| {"input":["aabbaaaa\nbaaaaaab\n","cba\ncba\n","xnahfslefuigq\naaaaaaaaaaaaa\n","abcddd\ndddcab\n","a(...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,1,2,2,2,2,2,2,2,2,2,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)
| 0
|
C
| 0
| 2,200
|
[] | false
| null | 64,000,000
| |||
87_B. Vasya and Types
| "Golu is given a task of clearing coins fallen down on floor. Naughty being his modus operandi, he (...TRUNCATED)
|
{
"input": [
"100\n200\n5"
],
"output": [
"13"
]
}
| {"input":["447244\n","958507\n","816923\n","836603\n","862795\n","756604\n","1000000\n","4\n","66882(...TRUNCATED)
| {"input":["5\n42\n17\n444\n7\n52\n","5\n42\n17\n640\n7\n51\n","5\n42\n15\n444\n7\n52\n","5\n42\n21\n(...TRUNCATED)
| 5
| 8
| {"language":[2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,3,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(...TRUNCATED)
| {"language":[2,4,2,2,2,2,3,2,2,2,1,2,2,2,4,2,2,2,4,4,1,2,4,4,2,1,4,4,4,2,2,2,2,4,2,2,2,1,2,4,2,2,2,2(...TRUNCATED)
| 0
|
B
| 1,500
| 0
|
[
"dp",
"implementation",
"math",
"number theory"
] | false
| null | 256,000,000
| |||
p00781 Lattice Practices
| "Note that this is the first problem of the two similar problems. You can hack this problem only if (...TRUNCATED)
| {"input":["4\n1000000000 1000000\n1000000000 1000000\n100000000 1000000\n1000000000 1000000\n","3\n9(...TRUNCATED)
| {"input":["2\n1 1 3 1\n3\n0 1 2\n"],"output":[" (...TRUNCATED)
| {"input":["2008 2 29\n2015 1 1","1505 9 9\n2001 11 3","1505 9 9\n2619 11 3","1505 13 9\n2619 11 3","(...TRUNCATED)
| 2
| 8
| {"language":[2,2,2,4,2,4,2,4,2,2,2,2,4,2,2,2,2,2,4,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(...TRUNCATED)
|
{
"language": [],
"solution": []
}
| 0
|
E
| 500
| 2,100
|
[
"binary search",
"brute force",
"chinese remainder theorem",
"math",
"number theory"
] | false
|
{
"nanos": 0,
"seconds": 1
}
| 1,073,741,824
| |||
1257_G. Divisor Set
| "Mole decided to live in an abandoned mine. The structure of the mine is represented by a simple con(...TRUNCATED)
| {"input":["4 6 0\n0 1 3\n0 2 2\n2 0 1\n2 3 1\n3 0 1\n3 1 5","6 10 0\n0 2 7\n0 1 1\n0 3 5\n1 4 9\n2 1(...TRUNCATED)
| {"input":["9\n","8\n","6\n","4\n","7\n","5\n","2\n"],"output":["1 2 3 4 5 6 7 8 \n2 4 6 8 (...TRUNCATED)
| {"input":["1 1 16\n10\n10\n","2 2 10\n9 11\n11 16\n","2 2 5\n2 3\n4 8\n","5 20 1\n314 316 328 323 32(...TRUNCATED)
| 2
| 10
| {"language":[4,4,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,3,2,2,4,4,4,2,2,2,2,2,2,2,2,4,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,4,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)
| 931
| 0
| 0
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 512,000,000
| ||||
p01538 Kakezan
| "Two coordinates (a1, a2) and (b1, b2) on a two-dimensional grid of r × c are given. The cost of mo(...TRUNCATED)
|
{
"input": [
"1\n1\n",
"6\n100011\n",
"2\n10\n"
],
"output": [
"1\n1\n",
"2\n1 00011\n",
"2\n1 0\n"
]
}
| {"input":["228\n1 3 1 7 1 3 1 15 1 3 1 7 1 3 1 31 1 3 1 7 1 3 1 15 1 3 1 7 1 3 1 63 1 3 1 7 1 3 1 15(...TRUNCATED)
|
{
"input": [],
"output": []
}
| 6
| 8
|
{
"language": [],
"solution": []
}
| {"language":[3,1,4,4,2,1,4,4,3,4,3,4,4,2,4,1,3,2,2,3,2,4,1,2,2,1,2,1,3,2,2,2,4,4,2,2,3,3,4,2,2,2,3,1(...TRUNCATED)
| 0
|
A
| 500
| 0
|
[
"greedy"
] | false
|
{
"nanos": 0,
"seconds": 1
}
| 0
| |||
425_D. Sereja and Squares
| "Utkarsh is forced to play yet another one of Ashish's games. The game progresses turn by turn and a(...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": [],
"output": []
}
| {"input":["5\n5 7\n5 3 2 1 4\n2 1 1 2 1\n1 3\n2\n1\n5 10\n2 3 2 3 2\n1 1 1 2 1\n4 10\n5 1 3 4\n1 2 1(...TRUNCATED)
| 6
| 0
| {"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,2,2,2,2,0,2,2,2,0,3,2,2,3,2,4,0,2,2,2,2,0,2,2,2,2,4,2,2,2,2,2,0,2,2,2,2,2,2,3,2,2(...TRUNCATED)
| 223
|
E
| 0
| 0
|
[
""
] | false
| null | 256,000,000
| |||
subtraction-game-theory-1
| "\"Pizza At\", a fast food chain, offers three kinds of pizza: \"A-pizza\", \"B-pizza\" and \"AB-piz(...TRUNCATED)
| {"input":["3 1\n1 100 1","12 5\n43 94 27 3 69 99 56 25 8 15 46 8","3 1000\n1 100 1","6 14\n25 171 7 (...TRUNCATED)
| {"input":["10 10\n5 9 1 3 5 8 3 4 7\n2 0 4 7 1 0 0 0 7 0\n5 7 -7 3 10 4 7 2 9 -9\n","2 2\n1\n0 0\n1 (...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
| 9
| {"language":[2,2,2,2,2,2,2,2,2,2,2,2],"solution":["#include <bits/stdc++.h>\nusing namespace std;\n\(...TRUNCATED)
| {"language":[2,2,2,2,2,4,2,2,2,2,2,4,2,2,2,2,2,2,2,4,2,2,4,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2,2,4,4,2,2(...TRUNCATED)
| 0
|
D2
| 0
| 0
|
[
"math"
] | false
| "Problem\n\nKND君は会津大学に在籍する学生プログラマである。彼の胸元はと(...TRUNCATED)
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| ||
p01691 Disappear Drive
| "An array of integers p_{1},p_{2}, …,p_{n} is called a permutation if it contains each number from(...TRUNCATED)
|
{
"input": [
"4 3\n1 3 4 7"
],
"output": [
"6"
]
}
|
{
"input": [],
"output": []
}
| {"input":["6\nc armor 0 13 0 3\na weapon 23 0 0 3\nb weapon 20 0 0 4\ne orb 0 0 13 3\nd armor 0 15 0(...TRUNCATED)
| 2
| 0
| {"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)
|
{
"language": [],
"solution": []
}
| 1,281
| 0
| 1,800
|
[
"greedy",
"implementation",
"math",
"ternary search"
] | false
| "Problem\n\nKND君は会津大学に在籍する学生プログラマである。彼の住む町の(...TRUNCATED)
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| |||
roys-life-cycle
| "An established group of scientists are working on finding solution to NP hard problems. They claim (...TRUNCATED)
| {"input":["10\n","3\n"],"output":["1 2 3 4 5 6 7 8 9 \n2 4 6 8 10 12 14 16 18 \n3 6 9 1(...TRUNCATED)
| {"input":["100\n591 417 888 251 792 847 685 3 182 461 102 348 555 956 771 901 712 878 580 631 342 33(...TRUNCATED)
| {"input":["5\n4\n1 2 3 4\n5 10 15 20\n4\n1 2 1 2\n5 10 15 20\n4\n2 2 4 1\n2 8 19 2\n2\n1 1\n6 9\n1\n(...TRUNCATED)
| 1
| 8
| {"language":[2,4,2,2,2,2,4,2,2,2,3,4,4,4,2,2,2,4,2,2,3,4,4,2,2,4,4,2,2,2,2,4,2,2,1,4,1,4,2,4,2,4,2,2(...TRUNCATED)
| {"language":[2,2,2,2,2,4,2,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,2,2,2,2,2,2,2,2(...TRUNCATED)
| 893
| 500
| 0
|
[
"dp"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 512,000,000
|
End of preview. Expand
in Data Studio
edition_1903_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
- 11