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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
discover-the-monk
| "You are given a sequence of length N: A_1, A_2, ..., A_N. For each integer i between 1 and N (inclu(...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":["42 28\n7 19\n15 24\n3 42\n18 5\n32 27\n26 20\n40 30\n35 2\n14 8\n22 10\n36 4\n16 14\n21 2(...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)
| 3
| 8
| {"language":[4,1,2,3,4,4,3,2,3,1,2,4,4,2,3,4,3,3,2,2,2,4,3,4,1,3,2,4,2,3,2,4,1,4,2,2,4,2,2,2,4,2,4,3(...TRUNCATED)
| {"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,4,3,2,2,2,2,2,4,2,2,3,2,2,2,2,3,2,2,4,2,2,2,2,2,2,2,2,3,2,2,2(...TRUNCATED)
| 949
| 0
| 0
|
[] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| ||||
trailing-zero-problem-1
| "You are given an equation: \n\nAx2 + Bx + C = 0. \n\nYour task is to find the number of distinct ro(...TRUNCATED)
|
{
"input": [
"5 5\n1 2 3 4 5\n",
"3 1\n1 1 2\n",
"5 2\n1 1 2 1 3\n"
],
"output": [
"16",
"3",
"14"
]
}
|
{
"input": [
"1\n1\n1\n1\n1 1 1 1\n"
],
"output": [
"1\n"
]
}
| {"input":["1\n5\n2 3 4 5 2\n","1\n3\n1 1 129021590\n","4\n7\n6 6 8 8 6 6 6\n1\n2\n5\n4 5 9 8 7\n7\n1(...TRUNCATED)
| 2
| 0
| {"language":[2,3,4,2,4,2,4,2,2,3,1,2,3,4,4,4,4,4,3,4,3,4,1,4,1,1,4,3,3,4,3,4,3,3,1,2,3,4,4,2,3,2,2,2(...TRUNCATED)
| {"language":[4,0,0,2,2,2,3,3,2,3,2,3,2,3,1,3,2,2,2,2,4,2,2,3,0,2,3,3,2,2,3,3,2,2,4,3,2,2,2,2,2,3,3,2(...TRUNCATED)
| 0
| 0
| 2,200
|
[
"data structures",
"divide and conquer",
"implementation",
"sortings"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 268,435,456
| ||||
pcsc1
| "In PrimeLand, there existed a very handsome young prince named Prima. He greatly desired the Prince(...TRUNCATED)
|
{
"input": [
"1\n1"
],
"output": [
"4"
]
}
| {"input":["5\n81 125 16\n19683 15625 8192\n59049 15630 32768\n59050 78125 131072\n177147 390625 1310(...TRUNCATED)
| {"input":["9 3 23\n9 3 22\n10 3 28\n16 10 107\n20 8 102\n20 10 105\n20 10 155\n3 5 3\n4 2 11\n0 0 0"(...TRUNCATED)
| 2
| 10
| {"language":[2,2,2,2,4,2,2,2,4,4,4,2,4,4,2,2,4,2,4,4,2,2,4,4,2,2,2,2,4,2,4,4,2,2,2,2,2,2,2,4,2,4,2,2(...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)
| 630
| 0
| 0
|
[
"implementation"
] | false
|
{
"nanos": 0,
"seconds": 1
}
| 256,000,000
| ||||
1291_B. Array Sharpening
| "Nathan O. Davis is a student at the department of integrated systems. Today he learned digital quan(...TRUNCATED)
|
{
"input": [
"1\n2 3 Chandu\n\nSAMPLE"
],
"output": [
"Daspal\n"
]
}
| {"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":["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
| 9
| {"language":[3,3,3,3,3,2,3,3,3,3,3,4,4,4,3,2,3,3,3,2,3,2,2,3,2,4,2,3,3,3,4,2,2,3,2,2,2,3,3,3,3,2,2,2(...TRUNCATED)
| {"language":[2,2,2,4,2,4,2,2,2,4,2,4,4,4,2,2,4,4,2,4,2,2,4,2,4,4,2,2,2,4,4,2,2,2,2,2,4,2,2,2,2,2,4,4(...TRUNCATED)
| 385
|
E
| 0
| 0
|
[
"*special",
"implementation"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 512,000,000
| |||
931_A. Friends Meeting
| "There are N people standing on the x-axis. Let the coordinate of Person i be x_i. For every i, x_i (...TRUNCATED)
|
{
"input": [
"2 5",
"9 9",
"5 10"
],
"output": [
"10",
"81",
"-1"
]
}
|
{
"input": [],
"output": []
}
|
{
"input": [],
"output": []
}
| 5
| 7
| {"language":[1,1],"solution":["t=input()\nwhile t>0:\n\tb=[]\n\ta=raw_input().split()\n\tfor i in ra(...TRUNCATED)
| {"language":[2,2,0,0,0,3,2,2,0,4,0,1,2,0,3,1,0,2,0,2,2,2,4,2,0,0,0,4,2,0,2,0,2,0,2,4,3,0,3,2,3,4,0,0(...TRUNCATED)
| 153
|
F
| 500
| 800
|
[] | false
|
{
"nanos": 0,
"seconds": 3
}
| 256,000,000
| |||
p01970 The Diversity of Prime Factorization
| "<!--\n\nProblem G\n\n-->\n\nLet's Move Tiles!\n\nYou have a framed square board forming a grid of s(...TRUNCATED)
|
{
"input": [
"14\n",
"2128506\n",
"11\n",
"571576\n",
"61441\n"
],
"output": [
"0",
"3",
"2",
"10",
"2"
]
}
|
{
"input": [],
"output": []
}
|
{
"input": [],
"output": []
}
| 1
| 12
| {"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":[3,3,2,1,4,1,2,4,3,2,2,2,3,3,2,2,3,3,3,2,4,2,2,1,4,4,2,3,2,2,2,2,3,3,2,3,2,4,2,2,2,2,3,4(...TRUNCATED)
| 0
|
A
| 1,000
| 0
|
[] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| |||
p03616 AtCoder Regular Contest 082 - Sandglass
| "Bessie and the cows have recently been playing with \"cool\" sequences and are trying to construct (...TRUNCATED)
| {"input":["3\n7\n4 6 11 11 15 18 20\n4\n10 10 10 11\n3\n1 1 1000000000\n"],"output":["1 2 7\n-1\n1 2(...TRUNCATED)
| {"input":["2\n-492673762 -496405053\n","13\n-958184557 -577042357 -616514099 -553646903 -719490759 -(...TRUNCATED)
| {"input":["7 6\nalloc 2\nalloc 2\nalloc 3\nerase 1\ndefragment\nerase 3\nalloc 4\n","8 50\nalloc 51\(...TRUNCATED)
| 2
| 0
| {"language":[2,2,2,4,2,4,4,4,2,2,2,4,4,4,2,2,2,2,2,4,2,2,4,4,3,2,2,2,4,2,2,2,2,4,4,2,2,2,2,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)
| 0
|
D
| 1,250
| 1,600
|
[
"implementation"
] | false
|
{
"nanos": 0,
"seconds": 4
}
| 256,000,000
| |||
professor-sharma
| "Phoenix is trying to take a photo of his n friends with labels 1, 2, ..., n who are lined up in a r(...TRUNCATED)
| {"input":["3\n6 10 16","3\n6 10 15","3\n3 4 5"],"output":["not coprime","setwise coprime","pairwise (...TRUNCATED)
| {"input":["? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ?(...TRUNCATED)
| {"input":["10\n3 1 278114804\n3 7 453886464\n8 7 830020662\n8 2 759298564\n9 2 147615930\n2 4 617310(...TRUNCATED)
| 2
| 9
| {"language":[2,2,4,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,4,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)
| 0
|
E
| 0
| 1,700
|
[
"*special"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| |||
p00167 Bubble Sort
| "Andrewid the Android is a galaxy-famous detective. He is now investigating the case of vandalism at(...TRUNCATED)
| {"input":["2\n3 1 9\n1 2 3\n1 1\n2 1\n3 1\n1 2\n2 2\n3 2\n1 3\n2 3\n3 3\n6 4 4\n6 5 4 3 1 2\n1 1\n3 (...TRUNCATED)
| {"input":["2 5 1\n0 5 6\n0 2 7\n","1 1 1000000000\n0 0 0\n","2 200 5\n1 1 1\n12 3 15\n","2 10 5\n1 1(...TRUNCATED)
| {"input":["3\n5\n5\n199\n","99\n3\n5\n7\n9\n11\n13\n15\n17\n19\n21\n23\n25\n27\n29\n31\n33\n35\n37\n(...TRUNCATED)
| 2
| 7
| {"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,1,1,1,1,1,1,1,1(...TRUNCATED)
| {"language":[3,2,3,3,2,2,2,3,1,2,2,3,2,4,3,4,3,1,4,3,4,3,3,4,4,4,4,4,3,3,4,3,3,4,4,2,4,3,2,4,3,4,4,2(...TRUNCATED)
| 1,420
|
C
| 0
| 0
|
[
"greedy",
"two pointers"
] | false
|
{
"nanos": 0,
"seconds": 3
}
| 0
| |||
1264_A. Beautiful Regional Contest
| "Easy and hard versions are actually different problems, so read statements of both problems complet(...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": [],
"output": []
}
| {"input":["4\n39 18\n183 11\n551 27\n85 16","8\n4 65\n5 12\n7 21\n9 38\n12 24\n14 10\n65 75\n31 26",(...TRUNCATED)
| 2
| 0
| {"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":[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
| 1,500
| 0
|
[
""
] | false
| null | 256,000,000
|
End of preview. Expand
in Data Studio
edition_2414_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