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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
938_B. Run For Your Prize
| "Recently, Pari and Arya did some research about NP-Hard problems and they found the minimum vertex (...TRUNCATED)
|
{
"input": [
"0 0\n1 1\n1 1\n",
"0 0\n1 1\n0 1\n",
"0 0\n1 1\n2 2\n"
],
"output": [
"YES\n",
"YES\n",
"NO\n"
]
}
| {"input":["4 9\n5 1000000000 999999999 12\n","4 6\n5 1000000000 999999999 12\n","1 1\n4\n","3 5\n4 5(...TRUNCATED)
| {"input":["12 11\n11 12\n25 7\n","12 17\n6 19\n13 16\n","9 12\n3 17\n10 20\n","2 4\n1 3\n3 3\n","3 7(...TRUNCATED)
| 2
| 9
| {"language":[2,4,4,4,2,2,2,4,3,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,4,2,2,4,2,2,2,2,2,2,2,3,2,2,2,2,2,2,3,2(...TRUNCATED)
| {"language":[2,4,2,2,4,2,2,2,2,2,2,4,2,2,4,2,4,2,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,4,2,2(...TRUNCATED)
| 0
| 750
| 1,600
|
[] | false
| null | 512,000,000
| ||||
p03725 AtCoder Grand Contest 014 - Closed Rooms
| "Given is a string S, where each character is `0`, `1`, or `?`.\n\nConsider making a string S' by re(...TRUNCATED)
| {"input":["3 5 10\nred\n0 0 0\n5 0 0\ngreen\n0 5 5\n5 6 1\nblue\n0 40 5\n5 0 0\n3 10 5\natom\n0 47 3(...TRUNCATED)
| {"input":["5\n81 125 16\n19683 15625 8192\n59049 15630 32768\n59050 78125 131072\n177147 390625 1310(...TRUNCATED)
| {"input":["1+1+3+1+2+1+2+2+1+2+2+1+3+3+3+1+1+2+3+2+3+1+2+3+3+3+1+1+1+3+3+3+2+2+3+3+2+2+3+1+2+1+1+2+2(...TRUNCATED)
| 2
| 11
| {"language":[3,2,2,4,2,2,2,4,3,3,4,4,4,4,2,2,4,2,1,2,2,3,3,4,1,4,4,4,3,3,3,4,3,3,2,2,2,2,2,2,3,4,2,2(...TRUNCATED)
| {"language":[2,4,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2(...TRUNCATED)
| 1,165
|
F
| 0
| 0
|
[
"math"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| |||
bhavanas-and-bhuvanas-bet
| "You are practicing a juggle that involves in a number of square tiles. They all look the same in th(...TRUNCATED)
|
{
"input": [
"3\n1 2 3\n",
"3\n2 2 2\n",
"2\n2 1\n"
],
"output": [
"3\n1 2 3 \n1 2 3 ",
"1\n1 1 1 \n2 ",
"-1"
]
}
| {"input":["10 23\n6 9 8 10 4 3 7 1 5 2\n7 2\n3 2\n2 4\n2 3\n7 5\n6 4\n10 7\n7 1\n6 8\n6 2\n8 10\n3 5(...TRUNCATED)
| {"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)
| 2
| 9
| {"language":[2,2,2,2,2,3,3,2,2,2,4,2,2,2,2,2,2,3,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,3,2,2,4,2,2,2,2,2,2,2(...TRUNCATED)
| {"language":[4,2,4,3,3,4,3,4,4,4,2,2,3,3,2,2,4,4,4,2,3,3,2,3,3,2,2,2,4,2,2,4,2,3,4,4,3,4,1,2,1,4,4,4(...TRUNCATED)
| 354
|
B
| 0
| 1,400
|
[
"constructive algorithms",
"math",
"sortings"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 268,435,456
| |||
p02916 AtCoder Beginner Contest 140 - Buffet
| "On Children's Day, the child got a toy from Delayyy as a present. However, the child is so naughty (...TRUNCATED)
| {"input":["10 3 409693891\n","65 4 177545087\n","5 2 433416647\n"],"output":["2\n","910726\n","1\n"](...TRUNCATED)
| {"input":["3 14\n8 9\n10 7\n","12 11\n11 12\n16 7\n","12 17\n10 19\n13 16\n","9 12\n3 17\n10 10\n","(...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)
| 2
| 10
| {"language":[2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2(...TRUNCATED)
| {"language":[2,4,2,2,2,4,2,1,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,2,2,2,2,2,2,4,2,2,2(...TRUNCATED)
| 0
|
B
| 500
| 2,500
|
[
"constructive algorithms"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| |||
44_B. Cola
| "Geometric progression with the first element a and common ratio b is a sequence of numbers a, ab, a(...TRUNCATED)
|
{
"input": [
"2\n999999\n1000000",
"3\n9\n99\n123"
],
"output": [
"12\n1",
"0\n2\n3"
]
}
| {"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":["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)
| 2
| 7
| {"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":[4,2,2,2,1,2,2,2,2,2,2,4,2,2,4,2,4,3,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2,0,4,2(...TRUNCATED)
| 0
| 0
| 0
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 536,870,912
| ||||
820_A. Mister B and Book Reading
| "Flatland is inhabited by pixels of three colors: red, green and blue. We know that if two pixels of(...TRUNCATED)
|
{
"input": [
"2 1\n1 2 2"
],
"output": [
"1"
]
}
|
{
"input": [],
"output": []
}
| {"input":["3\nbba\nabb\nabc\n\nSAMPLE","3\nbba\nabb\nabb\n\nSAMPLF","3\nbba\nbba\nabc\n\nSAMPLE","3\(...TRUNCATED)
| 2
| 9
| {"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,1],"solution":["c(...TRUNCATED)
| {"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,4,2,2,2,2,2,2,3,2,4,2,2(...TRUNCATED)
| 1,354
|
B
| 1,000
| 0
|
[
"meet-in-the-middle"
] | false
|
{
"nanos": 0,
"seconds": 1
}
| 256,000,000
| |||
415_E. Mashmokh and Reverse Operation
| "A permutation of length n is an array consisting of n distinct integers from 1 to n in arbitrary or(...TRUNCATED)
|
{
"input": [
"3\n2 3\n3 6\n1 2\n3\n2 3\n3 5\n1 2\n0"
],
"output": [
"Yes\nNo"
]
}
|
{
"input": [],
"output": []
}
| {"input":["15 6\n1 6 6 5 2 10 4 4 14 8 7 3 5 1 2\n","65 7\n1 5 4 1 4 11 9 1 11 7 6 11 9 4 2 6 10 11 (...TRUNCATED)
| 3
| 0
| {"language":[3,2,4,2,2,2,3,3,3,4,3,3,3,2,4,3,2,4,2,3,2,2,3,2,2,4,2,2,3,3,4,3,3,2,2,2,4,3,3,3,3,3,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,4,2,2,2,2,2,2,2,2,2(...TRUNCATED)
| 586
| 2,000
| 0
|
[
"dfs and similar",
"graphs"
] | true
|
{
"nanos": 0,
"seconds": 5
}
| 256,000,000
| ||||
p03452 AtCoder Regular Contest 090 - People on a Line
| "Please note the non-standard memory limit.\n\nThere are n problems numbered with integers from 1 to(...TRUNCATED)
|
{
"input": [
"3 5\n1 2 3\n1 3 2 3 1\n"
],
"output": [
"12\n"
]
}
|
{
"input": [],
"output": []
}
| {"input":["202763616\n","1778707511\n","181182141\n","1438\n","55068349\n","324423196\n","339071627\(...TRUNCATED)
| 6
| 8
| {"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,2,2,2,2,2(...TRUNCATED)
| {"language":[2,2,2,2,2,4,2,4,4,2,4,2,2,4,2,2,4,4,2,2,2,2,3,2,2,2,2,2,3,2,2,2,4,2,2,2,2,2,2,2,4,2,4,2(...TRUNCATED)
| 87
| 2,500
| 2,300
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 1
}
| 256,000,000
| ||||
1497_D. Genius
| "You are given a permutation of the numbers 1, 2, ..., n and m pairs of positions (aj, bj).\n\nAt ea(...TRUNCATED)
| {"input":["8\n0 0\n3 2\n6 2\n8 6\n6 5\n7 7\n0 4\n3 4\n8\n0 0\n5 3\n5 2\n4 1\n6 1\n8 6\n6 4\n2 4\n0"](...TRUNCATED)
| {"input":["10 1000000\n1 2 3 4 84 5 6 7 8 9\n","1 1\n3\n","13 666\n84 89 29 103 128 233 190 122 117 (...TRUNCATED)
| {"input":["3\n1 3 2\n-100 2 6\n","2\n2 1\n-4 0\n","2\n0 1\n-4 0\n","2\n0 2\n-4 0\n","3\n1 5 2\n-167 (...TRUNCATED)
| 3
| 9
| {"language":[2,2,2,2,4,2,2,4,2,4,2,2,2,2,2,2,4,2,2,2,4,2,2,2,4,2,2,2,2,3,2,4,4,2,4,2,2,2,4,4,2,2,2,2(...TRUNCATED)
| {"language":[4,2,2,4,4,1,2,3,3,1,1,2,2,3,4,2,3,3,3,2,2,1,2,3,4,4,4,2,2,4,1,2,4,3,1,1,3,3,4,1,1,2,3,3(...TRUNCATED)
| 494
| 3,750
| 2,600
|
[
"bitmasks",
"dp",
"games"
] | false
|
{
"nanos": 0,
"seconds": 1
}
| 256,000,000
| ||||
1096_E. The Top Scorer
| "Tree is a connected acyclic graph. Suppose you are given a tree consisting of n vertices. The verte(...TRUNCATED)
|
{
"input": [
"4\n6 6 5 5\n",
"5\n1 2 3 1 3\n",
"4\n6 6 4 4\n"
],
"output": [
"0",
"4",
"-8"
]
}
|
{
"input": [],
"output": []
}
| {"input":["46\n63 1\n63 63\n123 1\n123 123\n63 2\n63 62\n123 2\n123 122\n63 3\n63 61\n123 3\n123 121(...TRUNCATED)
| 2
| 0
| {"language":[2],"solution":["#include <algorithm>\n#include <cassert>\n#include <climits>\n#include (...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],"sol(...TRUNCATED)
| 0
| 0
| 0
|
[] | false
| null | 256,000,000
|
End of preview. Expand
in Data Studio
edition_2860_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
- -