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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
p03153 KEYENCE Programming Contest 2019 - Connecting Cities
| "In a simplified version of a \"Mini Metro\" game, there is only one subway line, and all the trains(...TRUNCATED)
|
{
"input": [
"1",
"2"
],
"output": [
"a",
"aa\nab"
]
}
| {"input":["9\n3 9\n3 4\n7 2\n6 9\n5 3\n6 2\n8 3\n1 9\n10\n8 4 8 2 5\n9 2 7 4 4\n8 5 7 3 3\n1 2 3 8 4(...TRUNCATED)
| {"input":["1\n2","1\n0","1\n-1","1\n-2","1\n-4","1\n-5","1\n-8","1\n-11","1\n3","1\n4","1\n6","1\n10(...TRUNCATED)
| 2
| 8
| {"language":[4,2,4,3,2,4,4,4,4,4,2,4,3,4,3,2,3,2,4,3,2,3,2,3,3,4,3,2,3,4,3,4,2,3,4,2,4,3,4,4,4,2,2,3(...TRUNCATED)
| {"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2],"solution":["#include <bits/stdc++.h>\nusing n(...TRUNCATED)
| 45
|
F
| 0
| 0
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 5
}
| 256,000,000
| |||
963_B. Destruction of a Tree
| "Joisino is planning to open a shop in a shopping street.\n\nEach of the five weekdays is divided in(...TRUNCATED)
| {"input":["3 2\n1 3\n1 1\n0\n2\n","2 2\n1 2\n1 1\n1\n","5 6\n2 2 3\n2 4 5\n1 4\n1 5\n0\n1\n"],"outpu(...TRUNCATED)
| {"input":["1\n2\n110 2\n115 112\n","10\n5\n88 60\n10 3\n48 21\n90 70\n40 88\n5\n20 81\n39 98\n34 87\(...TRUNCATED)
| {"input":["11\n54 91 4 6 88 23 38 71 77 10 84\n","20\n12 37 81 56 61 2 26 27 59 69 24 7 71 76 45 54 (...TRUNCATED)
| 5
| 0
| {"language":[2,2,4,2,2,2,2,2,2,2,2,2,4,4,4,2,2,2,2,2,2,1,2,2,2,2,2,1,2,4,2,4,4,2,2,2,2,2,2,2,2,2,2,2(...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
| 0
| 1,600
|
[
"bitmasks",
"dp",
"shortest paths"
] | false
| "標準録画で 120 分のビデオテープがあります。テープを完全に巻き戻した(...TRUNCATED)
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| |||
76_B. Mice
| "Bearland has n cities, numbered 1 through n. Cities are connected via bidirectional roads. Each roa(...TRUNCATED)
|
{
"input": [
"4\n100 100 100 200\n",
"3\n100 200 100\n"
],
"output": [
"NO\n",
"YES\n"
]
}
| {"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":["2\nca\nbc\n","2\ndc\nce\n","2\nza\nzb\n","2\nab\nb\n","25\nsw\nwt\nc\nl\nyo\nag\nz\nof\np(...TRUNCATED)
| 2
| 0
| {"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2],"solution":["#include<iostream>\n#include<algo(...TRUNCATED)
|
{
"language": [],
"solution": []
}
| 0
|
A
| 0
| 0
|
[
"implementation"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| |||
1525_D. Armchairs
| "You have two friends. You want to present each of them several positive integers. You want to prese(...TRUNCATED)
|
{
"input": [
"2 1\n",
"1 3\n",
"10 2\n"
],
"output": [
"2.333333333",
"1.000000000",
"15.938076892"
]
}
|
{
"input": [],
"output": []
}
|
{
"input": [],
"output": []
}
| 2
| 9
| {"language":[1],"solution":["import sys\n\nfor __ in range(input()) :\n n , k = map(int,sys.stdin(...TRUNCATED)
| {"language":[2,4,1,3,2,2,4,4,2,1,2,2,4,1,3,2,4,2,3,2,2,2,2,2,2,3,3,2,2,4,2,4,2,3,4,4,3,4,2,4,2,2,2,2(...TRUNCATED)
| 687
|
D
| 0
| 0
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| |||
1257_G. Divisor Set
| "<!--\n\nProblem G\n\n-->\n\nLet's Move Tiles!\n\nYou have a framed square board forming a grid of s(...TRUNCATED)
|
{
"input": [
"11 5 2\n11010100101\n",
"11 5 1\n11010100101\n"
],
"output": [
"1\n",
"3\n"
]
}
|
{
"input": [],
"output": []
}
| {"input":["31 50000000\n90016\n60016\n00016\n30016\n30016\n30013\n30013\n90014\n30014\n30014\n20014\(...TRUNCATED)
| 5
| 7
| {"language":[3,1,2,2,3,4,2,2,2,4,3,2,2,2,4,4,4,2,2,2,3,1,4,4,2,4,4,3,4,3,1,4,2,3,2,3,3,3,3,3,3,2,1,4(...TRUNCATED)
| {"language":[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,2(...TRUNCATED)
| 814
|
D
| 0
| 2,300
|
[
"brute force",
"combinatorics",
"dp",
"string suffix structures"
] | false
|
{
"nanos": 0,
"seconds": 3
}
| 512,000,000
| |||
appu-and-sugarcane-farm
| "Our beloved detective, Sherlock is currently trying to catch a serial killer who kills a person eac(...TRUNCATED)
|
{
"input": [
"4\naaa\nabc\nabdbca\nabba"
],
"output": [
"YES\nNO\nYES\nYES\n"
]
}
| {"input":["5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\(...TRUNCATED)
| {"input":["0\n2130761060 2000000000 1\n","0\n1 1723177055 2000000000\n","12\nAnka likes Dracul\nDrac(...TRUNCATED)
| 6
| 12
| {"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": [],
"solution": []
}
| 319
| 500
| 0
|
[
"data structures"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| ||||
gcd2
| "You are given a number n. Print n lines, i-th line should consist of i characters \"*\". Lines' ind(...TRUNCATED)
|
{
"input": [
"2 5 4 0 4\n",
"4 5 9 2 1\n"
],
"output": [
"3\n",
"-1\n"
]
}
|
{
"input": [
"abcdabcdab\n5\n2 2 8 ab\n2 1 10 ab\n1 3 a\n1 4 b\n2 1 4 ab\n"
],
"output": [
"1\n3\n2\n"
]
}
| {"input":["5 4","7 4","6 1","9 4","6 3","14 4","8 1","28 4","15 2","28 3","19 2","32 2","29 5","26 3(...TRUNCATED)
| 6
| 12
| {"language":[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,4,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)
| 1,500
| 0
| 0
|
[
"brute force",
"implementation",
"strings"
] | false
|
{
"nanos": 0,
"seconds": 6
}
| 268,435,456
| ||||
p01838 Optimal Tournament
| "Diverta City is a new city consisting of N towns numbered 1, 2, ..., N.\n\nThe mayor Ringo is plann(...TRUNCATED)
|
{
"input": [
"3\n2\n6\n10"
],
"output": [
"2\n1826/189\n877318/35343\n"
]
}
| {"input":["264193194 -448876521 736684426 -633906160 -328597212 -47935734\n","-357531221 381512519 -(...TRUNCATED)
| {"input":["bcccccccccccaaacaaaaccccccbaaaaaabbbccbbbbbbaaaaaaaaaccccccccaaaaaaaaaaaaaaccccccaaaaaaaa(...TRUNCATED)
| 2
| 11
| {"language":[2,3,4,2,2,3,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,3,2,2,3,2,2,2,3,2,3,2,3,4,1,2,3(...TRUNCATED)
| {"language":[3,2,2,4,3,2,4,3,4,4,4,2,2,3,3,3,2,4,3,2,4,4,2,3,3,2,3,4,4,2,2,3,3,3,3,4,4,4,4,4,4,4,2,3(...TRUNCATED)
| 1,301
| 500
| 1,100
|
[
"greedy",
"two pointers"
] | false
|
{
"nanos": 0,
"seconds": 6
}
| 268,435,456
| ||||
lexicographically-preceding-permutation
| "You are given an array of n positive integers a_1, a_2, ..., a_n. You can perform the following ope(...TRUNCATED)
| {"input":["5\n2 1\n5 2\n10 3\n25 4\n15441 33\n"],"output":["\nUtkarsh\nAshish\nUtkarsh\nUtkarsh\nAsh(...TRUNCATED)
|
{
"input": [],
"output": []
}
| {"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)
| 5
| 0
| {"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,2,2,2,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,2,4,2,2,2,2,4,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)
| 449
|
E
| 0
| 0
|
[
"implementation"
] | false
|
{
"nanos": 500000000,
"seconds": 0
}
| 0
| |||
1304_E. 1-Trees and Queries
| "You are given an array a of n integers.\n\nYou want to make all elements of a equal to zero by doin(...TRUNCATED)
|
{
"input": [
"10 30 10\n",
"2 6 3\n",
"5 20 11\n"
],
"output": [
"85932500\n",
"124780545\n",
"1\n"
]
}
| {"input":["2\nab\nac\n","2\nca\ncb\n","2\ndc\nec\n","2\naz\nzb\n","2\naa\nb\n","25\nsw\nwt\nc\nl\nyo(...TRUNCATED)
|
{
"input": [],
"output": []
}
| 2
| 2
| {"language":[2,1,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,1,2,4,1,1,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,4,2(...TRUNCATED)
| {"language":[2,2,2,0,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,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)
| 518
| 0
| 0
|
[
"brute force",
"implementation",
"sortings"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 1,073,741,824
|
End of preview. Expand
in Data Studio
edition_1924_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
- 9