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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1420_D. Rescue Nibel!
| "Taro is an elementary school student who has just learned multiplication. Somehow, he likes multipl(...TRUNCATED)
| {"input":["99999999999999999999999999999999999999999999999999999999999999999999999999999999999999999(...TRUNCATED)
| {"input":["1 3 0\n6 3 4\n","5 4 32\n4 2 1 1\n","32 6 635\n3 4 2 1 7 7\n","3 7 20012\n1 1 1 1 1 1 100(...TRUNCATED)
| {"input":["1\n4 5\n9 7 5 3\n8 6 4 1 0\n\nSAMPLE","1\n4 5\n9 7 5 3\n16 6 4 2 0\n\nSAMPLE","1\n4 5\n9 (...TRUNCATED)
| 6
| 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": [],
"solution": []
}
| 40
|
A
| 0
| 0
|
[
"combinatorics",
"divide and conquer"
] | false
|
{
"nanos": 0,
"seconds": 1
}
| 256,000,000
| |||
1366_A. Shovels and Swords
| "There are n points on a coordinate axis OX. The i-th point is located at the integer point x_i and (...TRUNCATED)
| {"input":["4 4 2\n2 3\n1 2\n1 3\n1 4\n","5 8 2\n2 1\n4 2\n5 4\n5 2\n4 3\n5 1\n4 1\n3 2\n","5 7 2\n1 (...TRUNCATED)
|
{
"input": [
"1\n999838675\n"
],
"output": [
"-1\n"
]
}
| {"input":["21 6\n12 15 14 4 4 7 3 4 11 1 15 4 12 11 12 8 11 12 3 4 4\n","50 25\n19 1 17 6 4 21 9 16 (...TRUNCATED)
| 2
| 9
| {"language":[2,4,2,3,4,2,4,2,2,3,4,2,2,2,2,2,4,2,2,1,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,1,4,2,2,3,2,2,2,2(...TRUNCATED)
| {"language":[2,2,2,2,2,0,4,0,0,2,4,0,2,0,2,0,0,4,0,2,2,2,0,2,2,0,2,3,4,2,4,0,4,0,2,0,2,2,2,2,2,0,2,4(...TRUNCATED)
| 0
| 0
| 1,600
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 4
}
| 0
| ||||
1053_C. Putting Boxes Together
| "Given 2 numbers n1 and n2, following operations can be performed:\n1) Decrement n1 by 1(if n1>1)\n2(...TRUNCATED)
|
{
"input": [
"5 3\n5 5 7 3 1\n",
"4 2\n1 2 3 4\n",
"2 3\n1 2\n"
],
"output": [
"15\n",
"8\n",
"0\n"
]
}
| {"input":["10 16\n9 8\n1 2\n9 5\n5 4\n9 2\n3 2\n1 6\n5 10\n7 2\n8 2\n3 7\n4 9\n5 7\n10 3\n10 9\n7 8\(...TRUNCATED)
| {"input":["5\n2 3 0 6 8","5\n2 3 4 6 5","5\n2 3 4 6 7","5\n2 3 0 6 7","5\n2 -1 8 6 4","5\n6 0 8 5 2"(...TRUNCATED)
| 2
| 0
| {"language":[2,4,2,2,2,2,2,2,2,4,2,2,2,2,2,4,2,2,2,4,2,2,2,4,2,4,2,2,2,2,2,2,4,2,2,2,4,2,2,2,2,4,2,2(...TRUNCATED)
| {"language":[2,4,0,2,2,2,2,2,2,3,2,2,4,3,3,2,2,3,3,3,2,2,2,2,2,2,2,3,3,0,3,2,3,3,2,2,0,2,3,2,2,3,2,2(...TRUNCATED)
| 1,170
| 3,000
| 2,500
|
[
"bitmasks",
"dp",
"shortest paths"
] | false
|
{
"nanos": 0,
"seconds": 8
}
| 0
| ||||
p03010 diverta 2019 Programming Contest 2 - Diverta City
| "You are given a complete undirected graph. For each pair of vertices you are given the length of th(...TRUNCATED)
| {"input":["5 4 10 1 6\n1 1 5\n1 5 5\n1 3 2\n1 5 2\n2 1\n2 2\n","5 2 2 1 8\n1 1 2\n1 5 3\n1 2 1\n2 2\(...TRUNCATED)
| {"input":["1\n2\n3\n2\n","8\n190409007 190409007 352375776 190409007 352375776 352375776 352375776 3(...TRUNCATED)
| {"input":["314159\n1","25\n1","100\n2","314159\n3","999999999999999999999999999999999999999999999999(...TRUNCATED)
| 6
| 0
| {"language":[3,4,2,2,3,3,3,3,3,4,4,2,3,4,4,2,2,4,2,3,1,3,2,3,4,3,3,2,3,2,2,3,2,2,2,2,2,4,2,4,3,3,3,2(...TRUNCATED)
| {"language":[2,2,2,4,2,2,4,2,4,2,4,2,2,2,1,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,4,4,2,4,2,2,2,2,2,2(...TRUNCATED)
| 0
| 1,000
| 0
|
[
"constructive algorithms",
"graphs"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 268,435,456
| ||||
p01179 Cousin's Aunt
| "You are given two permutations p and q, consisting of n elements, and m queries of the form: l1, r1(...TRUNCATED)
|
{
"input": [
"2\n3 1 1 5\n1 6 9\n3 2 6 7\n1 6 9"
],
"output": [
"38\n36"
]
}
| {"input":["2 0\n","100000 0\n","8 9\n1 2\n2 3\n3 4\n4 1\n5 6\n6 7\n7 8\n8 5\n6 8\n","2 1\n1 2\n","11(...TRUNCATED)
| {"input":["1 16\n1\n","10 1\n-1 1 1 0 1 1 1 1 1 1\n","78 8\n-230 -757 673 -284 381 -324 -96 975 249 (...TRUNCATED)
| 2
| 2
| {"language":[4,4,4,4,2,1,3,1,3,4,4,2,3,4,3,4,4,1,3,2,4,2,2,2,3,4,1,2,2,2,2,2,2,4,4,2,4,4,1,4,3,1,2,4(...TRUNCATED)
|
{
"language": [],
"solution": []
}
| 0
| 0
| 0
|
[
"binary search",
"brute force",
"math"
] | false
| "アイヅ放送協会の教育番組(ＡＨＫ教育)では、子供向けの工作番組「あそ(...TRUNCATED)
| null | 256,000,000
| |||
354_B. Game with Strings
| "Given the value of n, print the n'th prime number.\n\nInput : A single integer n. \nOutput : A sing(...TRUNCATED)
|
{
"input": [
"2 1\n",
"1 3\n",
"10 2\n"
],
"output": [
"2.333333333",
"1.000000000",
"15.938076892"
]
}
| {"input":["3 10\n2 3 1\n1 1\n3 3\n3 3\n3 2\n1 1\n2 2\n3 1\n1 3\n2 1\n3 3\n","7 20\n6 2 5 7 3 1 4\n7 (...TRUNCATED)
| {"input":["10 7\n1 10\n2 10\n3 19\n4 10\n5 10\n1 2\n1 3\n1 4\n1 5\n1 6\n","20 7\n6047 35038\n15816 3(...TRUNCATED)
| 2
| 11
| {"language":[2,2,3,2,2,2,4,4,2,3,2,2,3,3,2,2,1,2,3,2,2,3,3,3,4,3,3,3,4,4,2,3,3,3,4,3,2,2,3,4,4,3,2,2(...TRUNCATED)
| {"language":[2,2,2,0,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,0,0,0,2,0,2,2,2,2,0,2,2,0,2,2,0,2,2,2,2,0,2,0,2,2(...TRUNCATED)
| 0
| 2,000
| 3,100
|
[
"bitmasks",
"dp"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 0
| ||||
p02257 Prime Numbers
| "Pavel loves grid mazes. A grid maze is an n × m rectangle maze where each cell is either empty, or(...TRUNCATED)
|
{
"input": [
"3\n1 2 4\n",
"3\n5 3 1\n"
],
"output": [
"3",
"1"
]
}
| {"input":["3\n2 2 3\n","5\n1 4 5 4 5\n","4\n2 2 4 4\n","3\n1 1 2\n","4\n1 2 1 2\n","4\n4 2 2 4\n","6(...TRUNCATED)
| {"input":["36\n2 2 2 8 9 4 8 5\n9 1 7 6 10 6 9 3\n10 2 4 6 6 2 1 1\n9 6 2 3 5 7 7 3\n6 6 3 9 10 9 1 (...TRUNCATED)
| 2
| 0
| {"language":[1,1,1,1],"solution":["'''\n# Read input from stdin and provide input before running cod(...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,281
| 0
| 0
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| ||||
650_B. Image Preview
| "Diverta City is a new city consisting of N towns numbered 1, 2, ..., N.\n\nThe mayor Ringo is plann(...TRUNCATED)
|
{
"input": [
"4\n62 96 82 55\n\nSAMPLE"
],
"output": [
"3 1 2 4\n"
]
}
| {"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":["106 25 31","4 24 20","10 29 20","30 47 100","8 25 31","4 29 20","30 26 100","16 25 31","3(...TRUNCATED)
| 2
| 12
| {"language":[2,2,2,2],"solution":["#include <iostream>\n#include <iomanip>\n#include <complex>\n#inc(...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)
| 621
| 1,500
| 0
|
[
"implementation",
"strings"
] | true
| null | 0
| ||||
79_D. Password
| "A Little Elephant from the Zoo of Lviv likes lucky strings, i.e., the strings that consist only of (...TRUNCATED)
| {"input":["3\n1 1 101\n1 2 1\n3 2 1\n","5\n1 1 2 2 3\n2 2 4 3 3\n3 3 1 1 1\n"],"output":["5\n","5\n"(...TRUNCATED)
| {"input":["1 1\n1\n2\n","6 3\n1 2 3 4 5 6\n3 5 1\n","5 5\n5 6 3 2 1\n4 3 1 5 6\n","1 1\n1\n1\n","10 (...TRUNCATED)
| {"input":["3\nAZAMON APPLE\nAZOMAN AAAAAAAAAAALIBABA\nAPPLE BANANA\n","3\nAZAMNO ELPPA\nAZAMON AAAAA(...TRUNCATED)
| 3
| 7
| {"language":[4,2,2,2,2,3,2,1,4,4,4,2,2,4,2,4,2,2,2,4,2,3,3,4,2,2,2,2,2,4,4,2,4,4,2,2,3,4,2,3,4,3,2,2(...TRUNCATED)
| {"language":[2,2,2,2,2,2,2,2,3,2,2,1,4,2,2,2,2,2,2,2,2,3,4,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,1,2,4,2,2,2(...TRUNCATED)
| 754
| 2,000
| 1,200
|
[
"bitmasks",
"dp"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 268,435,456
| ||||
1216_D. Swords
| "In computer science, there is a method called \"Divide And Conquer By Node\" to solve some hard pro(...TRUNCATED)
|
{
"input": [
"1\n9\n10\n1\n\nSAMPLE"
],
"output": [
"10"
]
}
| {"input":["20\n9 4 8\n10 6 7\n4 6 0\n7 7 6\n3 3 10\n4 2 1\n4 4 0\n2 0 0\n8 8 7\n3 1 7\n3 10 7\n1 7 3(...TRUNCATED)
| {"input":["3\n2\n4\n10","3\n2\n6\n12","3\n4\n6\n12","3\n4\n6\n19","3\n2\n4\n19","3\n2\n3\n12","3\n4\(...TRUNCATED)
| 2
| 0
| {"language":[2,2,2,1,4,2,4,2,4,3,4,1,4,4,2,4,2,2,2,3,4,3,2,2,2,2,2,4,2,4,2,4,2,2,3,2,4,4,2,2,4,2,2,4(...TRUNCATED)
| {"language":[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,1,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)
| 0
|
C
| 1,000
| 1,000
|
[
"dp",
"flows",
"graph matchings",
"greedy"
] | false
|
{
"nanos": 0,
"seconds": 1
}
| 1,073,741,824
|
End of preview. Expand
in Data Studio
edition_2848_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
- 15