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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1012_B. Chemical table
| "Bearland is a dangerous place. Limak can’t travel on foot. Instead, he has k magic teleportation (...TRUNCATED)
|
{
"input": [
"5 5\n1 2\n3 4\n3 2\n4 2\n2 5\n"
],
"output": [
"2\n1 4 \n"
]
}
| {"input":["2\n1 10\n3\n2 2\n2 1\n1 1\n","2\n3922 3922\n3\n2 2\n2 1\n1 1\n","1\n1000000000\n1\n1 1\n"(...TRUNCATED)
| {"input":["010\n"],"output":["1 2 3 4 5 6 7 8 9 \n2 4 6 8 10 12 14 16 18 \n3 6 9 12 15 18 21 24 27 \(...TRUNCATED)
| 2
| 10
| {"language":[2,2,4,1,1,2,4,1,4,2,2,2,2,4,2,2,2,2,3,1,4,2,4,2,1,4,2,2,2,1,1,2,2,2,1,4,1,4,4,2,1,4,2,4(...TRUNCATED)
| {"language":[2,2,2,2,4,2,4,2,4,2,2,2,4,2,2,2,3,2,2,2,2,2,0,2,2,2,4,2,2,4,2,0,2,2,2,2,1,0,2,2,1,2,2,2(...TRUNCATED)
| 415
|
C
| 1,000
| 3,200
|
[
"dp",
"implementation"
] | false
|
{
"nanos": 0,
"seconds": 1
}
| 256,000,000
| |||
p03194 CADDi 2018 for Beginners - Product and GCD
| "Disclaimer: there are lots of untranslateable puns in the Russian version of the statement, so ther(...TRUNCATED)
| {"input":["3 2\n0 0 0\n1 1 1\n","4 3\n0 0 2 1\n2 0 1 1\n","5 10\n0 0 0 1 2\n2 1 0 0 0\n"],"output":[(...TRUNCATED)
|
{
"input": [],
"output": []
}
| {"input":["140303299577\n","192582416360\n","628664286016\n","65109088632\n","414153533126\n","18263(...TRUNCATED)
| 3
| 11
| {"language":[2,3,2,2,2,2,4,3,3,3,3,2,2,2,2,2,3,2,2,2,3,2,2,2,2,3,1,3,3,3,2,4,3,2,4,3,4,2,2,3,2,2,2,2(...TRUNCATED)
| {"language":[2,4,2,2,4,2,2,2,2,3,4,1,4,4,2,2,2,1,2,4,4,2,2,2,2,2,2,2,4,4,4,4,2,1,4,4,2,2,3,2,2,2,4,2(...TRUNCATED)
| 0
| 3,000
| 0
|
[
"*special",
"implementation"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| ||||
hermione-vs-draco
| "Description\nYou are given two strings S and T, such that length of S is greater than the length of(...TRUNCATED)
|
{
"input": [
"4 4\n1 2 -10 3\n1 3 1 -10\n2 4 -10 -1\n3 4 0 -3\n"
],
"output": [
"4\n"
]
}
| {"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)
| {"input":["20 20\n00010110100100010111\n11110000001100101110\n01110101110001111000\n1011110100011111(...TRUNCATED)
| 5
| 8
| {"language":[2,4,2,2,2,2,2,4,4,2,2,4,2,2,2,3,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,4,2,2,2,2,2(...TRUNCATED)
| {"language":[4,3,3,4,4,2,2,4,3,1,2,4,2,3,4,2,3,1,4,3,2,2,3,4,3,2,3,2,3,2,4,4,3,2,2,2,2,2,2,4,2,4,2,3(...TRUNCATED)
| 949
|
B
| 0
| 1,600
|
[
"data structures",
"trees"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 134,217,728
| |||
p01970 The Diversity of Prime Factorization
| "Geometric progression with the first element a and common ratio b is a sequence of numbers a, ab, a(...TRUNCATED)
|
{
"input": [
"500 100 1000",
"19 123 143",
"19 123 142",
"50 100 120"
],
"output": [
"No",
"No",
"Yes",
"Yes"
]
}
| {"input":["3 3 1 2\n","7 12 2 3 44 5 60 2\n","10\n60\n1\n60\n1\n60\n1\n60\n1\n60\n1\n"],"output":["1(...TRUNCATED)
| {"input":["1 5000 2732\n","2 2 0\n","83 4122 123\n","19 862 387\n","100 843 30\n","45 1296 245\n","9(...TRUNCATED)
| 2
| 0
| {"language":[1,1,1,1],"solution":["n,q=map(int,raw_input().split())\nb=map(int,raw_input().split())\(...TRUNCATED)
| {"language":[4,3,1,4,1,4,3,2,2,2,4,3,3,2,4,3,2,2,2,2,4,4,2,2,2,4,2,3,4,4,2,3,3,2,3,4,3,3,2,4,2,2,3,4(...TRUNCATED)
| 0
| 1,500
| 2,600
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| ||||
609_B. The Best Gift
| "Nadeko's birthday is approaching! As she decorated the room for the party, a long garland of Dianth(...TRUNCATED)
|
{
"input": [
"3\nDSAWWAW\nD\nWA\n"
],
"output": [
"8\n2\n4\n"
]
}
| {"input":["11 11\n6 2\n6 2\n1 2\n2 2\n3 1\n6 2\n1 1\n1 1\n3 1\n3 1\n6 2\n","21 7\n14 1\n882797755 2\(...TRUNCATED)
| {"input":["7 4\n-10 -4 -2 0 2 4 10","16 19\n-49 -48 -33 -30 -21 -14 0 15 19 23 44 55 80 81 82 84","3(...TRUNCATED)
| 1
| 11
| {"language":[2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,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(...TRUNCATED)
| {"language":[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,2,2,2,2,2,2,2,2,2,2,3(...TRUNCATED)
| 1,107
| 0
| 0
|
[
"games",
"implementation"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| ||||
anuwta
| "Rakesh have learn about vowel in school and is given an assignment by his teacher in which he has t(...TRUNCATED)
|
{
"input": [
"4 4\n1 2\n2 3\n3 4\n4 1\n",
"3 0\n"
],
"output": [
"\n0 1 0 1 \n",
"\n0 0 0 \n"
]
}
| {"input":["z\na\n","abc\naaac\n","bcbcdddbbd\nbcbcdbdbbd\n","aaabccadac\nacabbbabaa\n","a\nb\n","aca(...TRUNCATED)
| {"input":["2 7\n4\n2\n1\n0\n-1\n-2\n-4\n131\n137\n2 7\n4\n2\n1\n0\n-1\n-2\n-4\n124\n123\n10 7\n-4\n-(...TRUNCATED)
| 2
| 8
| {"language":[3,2,4,2,2,2,2,4,3,2,2,3,2,1,4,2,4,3,4,4,2,1,4,3,2,3,4,2,3,4,2,2,4,4,2,2,4,3,3,2,4,3,4,2(...TRUNCATED)
| {"language":[3,2,2,2,4,2,3,2,4,1,4,3,4,4,4,4,3,3,3,4,4,2,4,3,2,3,3,3,2,2,3,2,2,4,2,4,4,3,2,4,2,1,2,4(...TRUNCATED)
| 774
|
D
| 3,000
| 2,000
|
[
"brute force",
"math"
] | false
|
{
"nanos": 0,
"seconds": 8
}
| 0
| |||
p03570 CODE FESTIVAL 2017 qual C - Yet Another Palindrome Partitioning
| "Pink Floyd are pulling a prank on Roger Waters. They know he doesn't like [walls](https://www.youtu(...TRUNCATED)
|
{
"input": [
"5 10\n2 1 2 1 2\n2\n2 4\n4 5\n"
],
"output": [
"3\n3\n"
]
}
| {"input":["1 0\n1 1 0\n1 446844829 77109657 780837560\n1 754808995 539371459\n","1 1\n1 1\n2 2 0\n1 (...TRUNCATED)
| {"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
| 9
| {"language":[4,3,2,4,3,2,3,2,2,4,2,4,3,3,2,3,2,2,2,3,3,3,3,3,3,3,3,2,4,3,3,4,3,3,3,4,3,3,3,4,3,3,3,3(...TRUNCATED)
| {"language":[4,2,2,2,2,2,2,2,2,2,2,2,3,2,4,2,2,4,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,3,2(...TRUNCATED)
| 990
|
E
| 20
| 0
|
[
"math"
] | false
|
{
"nanos": 0,
"seconds": 3
}
| 256,000,000
| |||
544_E. Remembering Strings
| "There are n cows playing poker at a table. For the current betting phase, each player's status is e(...TRUNCATED)
| {"input":["5 8\n1 2 6 7 10\n1 1 1 1 2\n1 1\n1 5\n1 3\n3 5\n-3 5\n-1 10\n1 4\n2 5\n"],"output":["0\n1(...TRUNCATED)
| {"input":["50 5000\n2 35 46\n2 43 92\n2 16 88\n2 67 99\n2 36 93\n2 12 20\n2 33 96\n2 55 82\n2 18 32\(...TRUNCATED)
| {"input":["14\n4 9\n3 7\n4 1\n3 2\n14 9\n7 6\n10 13\n8 7\n5 7\n7 10\n1 3\n12 3\n7 11\n20\n13 6 14 9 (...TRUNCATED)
| 2
| 7
| {"language":[2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,4,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,4,2(...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)
| 855
| 0
| 0
|
[] | false
|
{
"nanos": 0,
"seconds": 8
}
| 512,000,000
| ||||
play-with-string
| "Middle Strings\n\nMiss Roma has got a new job in a computer agency. To test her skills the manager (...TRUNCATED)
| {"input":["500 500 0 0 200 200","4 4 0 0 1 1","4 4 0 0 3 3","2 3 0 0 1 2"],"output":["34807775","2",(...TRUNCATED)
|
{
"input": [],
"output": []
}
| {"input":["ABM","BIB","1MI","MCA","MAC","M@C","C@M","@MC","?MC","M?C","C?M","CM?","DM?","?MD","@MD",(...TRUNCATED)
| 2
| 7
| {"language":[2,2,2,2,2,2,2,2,2,2],"solution":["#include <bits/stdc++.h>\nusing namespace std;\n#defi(...TRUNCATED)
| {"language":[2,0,3,3,2,2,3,2,3,2,3,2,3,3,2,3,2,0,2,4,2,3,2,3,3,0,2,2,2,2,2,2,0,0,2,3,0,2,2,2,2,3,2,2(...TRUNCATED)
| 0
|
F
| 750
| 0
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 6
}
| 256,000,000
| |||
p00035 Is it Convex?
| "A chessboard n × m in size is given. During the zero minute we repaint all the black squares to th(...TRUNCATED)
|
{
"input": [
"1 2 1\n1 100 1\n1 100 100\n",
"100 100 100\n1 1 1\n1 1 1\n"
],
"output": [
"99",
"0"
]
}
|
{
"input": [],
"output": []
}
| {"input":["5 0\n884430748 884430748 182474629 708433020 708433020\n","5 2\n65390026 1454694739 65390(...TRUNCATED)
| 2
| 10
| {"language":[2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,4,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,4,2,4(...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,4,2,2,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2(...TRUNCATED)
| 724
|
A
| 2,000
| 0
|
[
"implementation"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 134,217,728
|
End of preview. Expand
in Data Studio
edition_2397_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
- 18