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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
professor-sharma
| "Everybody knows that Balázs has the fanciest fence in the whole town. It's built up from N fancy s(...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":["20 10 3\nebebccacdb\neeebccddeT\neadebecaac\nadeeeaccbc\nbaccccdaed\ndeabceabba\ndadbecba(...TRUNCATED)
| {"input":["5\n1 2 0\n1 3 0\n3 5 0\n3 4 0\n3\n3\n4\n1\n3\n4\n","20\n9 11 0\n1 5 0\n1 14 0\n5 17 0\n14(...TRUNCATED)
| 6
| 0
| {"language":[3,2,2,2,3,3,4,3,3,4,2,3,2,4,2,2,4,2,2,2,2,4,3,2,3,2,2,4,4,4,2,2,2,3,3,2,3,3,2,3,2,2,3,2(...TRUNCATED)
| {"language":[2,2,2,2,2,2,2,2,2,2,1,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,4,2,2,2,2,2(...TRUNCATED)
| 235
|
B
| 0
| 1,800
|
[
"data structures",
"dfs and similar",
"dp",
"trees"
] | false
|
{
"nanos": 0,
"seconds": 1
}
| 256,000,000
| |||
p03013 AtCoder Beginner Contest 129 - Typical Stairs
| "Suppose you have a string S which has length N and is indexed from 0 to N−1. String R is the reve(...TRUNCATED)
| {"input":["4 4\n100 100 100 100\n1 2\n2 3\n2 4\n3 4\n","4 3\n10 20 30 40\n1 4\n1 2\n2 3\n","7 10\n40(...TRUNCATED)
| {"input":["30 2\n26 11 22 16 14 29 16 14 8 23 21 22 11 24 15 23 22 1 11 20 23 29 13 19 19 15 13 2 7\(...TRUNCATED)
| {"input":["5\nFFFAF\n","5\nIIAAF\n","5\nAAFFA\n","6\nAAAFFA\n","2\nAF\n","8\nIFFFIAAI\n","3\nFFA\n",(...TRUNCATED)
| 5
| 7
| {"language":[3,3,4,4,4,2,4,4,4,4,2,4,2,4,4,3,4,4,4,3,3,3,2,4,4,4,3,4,4,2,1,2,4,4,4,3,2,3,3,4,2,4,3,4(...TRUNCATED)
| {"language":[2,2,4,2,2,2,2,4,3,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,3,2,2,2,2,2(...TRUNCATED)
| 0
| 1,500
| 1,200
|
[
"flows",
"shortest paths"
] | false
|
{
"nanos": 0,
"seconds": 8
}
| 0
| ||||
p02807 Dwango Programming Contest 6th - Fusing Slimes
| "Polycarp plays a well-known computer game (we won't mention its name). In this game, he can craft t(...TRUNCATED)
| {"input":["5 3\n00011\n3\n1 2 3\n1\n4\n3\n3 4 5\n","8 6\n00110011\n3\n1 3 8\n5\n1 2 5 6 7\n2\n6 8\n2(...TRUNCATED)
|
{
"input": [],
"output": []
}
| {"input":["3 1 2\n1\n1 1\n","3 0 3\n\n334 500 0001\n","3 0 3\n\n333 187 1001\n","6 2 3\n2 3\n1 1 1\n(...TRUNCATED)
| 2
| 0
| {"language":[2,2,3,2,2,2,4,4,2,2,2,3,2,2,4,2,2,2,4,2,2,3,4,2,2,4,2,2,2,2,2,4,2,2,2,3,2,2,2,2,2,2,2,2(...TRUNCATED)
| {"language":[2,2,4,3,4,2,4,4,4,4,4,2,1,4,2,4,2,2,2,4,2,2,2,4,1,4,2,4,4,1,4,2,2,2,1,2,2,2,3,4,4,3,3,2(...TRUNCATED)
| 746
| 1,000
| 0
|
[
""
] | false
| "うさぎがある電車のチケットをn 枚持っている. チケットにはそれぞれ0 か(...TRUNCATED)
|
{
"nanos": 0,
"seconds": 3
}
| 134,217,728
| |||
1328_F. Make k Equal
| "Sherlock Holmes and Dr. Watson played some game on a checkered board n × n in size. During the gam(...TRUNCATED)
| {"input":["6\n1 4 3 3 5 7\n3 7 5 4 3\n4 3 7 5\n","5\n1 5 8 123 7\n123 7 5 1\n5 1 7\n"],"output":["1\(...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":["7\n0 1\n1 2\n2 3\n3 0\n2 4\n2 5\n1 6\n","15\n0 1\n1 2\n2 3\n3 4\n4 5\n5 0\n0 6\n0 7\n2 8\(...TRUNCATED)
| 2
| 8
| {"language":[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,2,2,2,2,2,2,2,2,2,2,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)
| 560
|
B
| 0
| 3,500
|
[
"brute force",
"greedy",
"implementation",
"math"
] | true
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| |||
105_C. Item World
| "You are given a rebus of form ? + ? - ? + ? = n, consisting of only question marks, separated by ar(...TRUNCATED)
|
{
"input": [
"3\n((()))\n(())()\n()(()"
],
"output": [
"YES\nYES\nNO"
]
}
| {"input":["9 12\n1 2\n2 3\n4 5\n5 6\n6 7\n7 8\n1 4\n4 7\n2 5\n5 8\n3 6\n6 9\n","5 4\n2 1\n3 2\n4 3\n(...TRUNCATED)
| {"input":["10\n1000 910\n94625 95469 92038 95916 93405 95533 97004 92469 99853 94992 90361 99819 932(...TRUNCATED)
| 6
| 7
| {"language":[3,4,4,2,2,4,2,4,4,2,4,2,4,2,4,3,2,1,3,2,3,3,2,4,3,3,3,3,2,3,3,2,3,4,2,2,3,2,4,4,4,3,3,2(...TRUNCATED)
| {"language":[4,2,2,4,4,4,4,2,3,2,4,1,4,4,2,4,4,2,4,3,2,2,3,3,2,2,1,4,2,3,4,3,2,2,1,2,2,2,4,2,2,4,2,2(...TRUNCATED)
| 0
| 0
| 2,500
|
[
"implementation",
"math"
] | false
| null | 134,217,728
| ||||
855_D. Rowena Ravenclaw's Diadem
| "Let's call a string a phone number if it has length 11 and fits the pattern \"8xxxxxxxxxx\", where (...TRUNCATED)
|
{
"input": [
"2\n1\n2"
],
"output": [
"2\n5\n"
]
}
| {"input":["10 3 5\n1 2\n2 3\n1 4\n2 3 6\n1 6\n2 1 6\n2 8 7\n1 10\n","10 2 6\n1 2\n1 3\n2 1 8\n2 9 2\(...TRUNCATED)
| {"input":["brtakoktrosttttttttttosafasfkalsfkodfdasiofhadfhasdsajfdsafoasodsafahaihfdisoadspapsapios(...TRUNCATED)
| 3
| 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":[2,3,4,2,3,3,2,4,4,2,3,4,4,3,2,4,2,4,2,4,4,4,2,3,3,2,3,2,4,2,2,4,2,3,2,3,2,4,3,2,3,3,4,4(...TRUNCATED)
| 0
|
B
| 1,250
| 0
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| |||
1428_D. Bouncing Boomerangs
| "Recenlty Luba got a credit card and started to use it. Let's consider n consecutive days Luba uses (...TRUNCATED)
|
{
"input": [
"2\nSHILPA\nAAMIR\nMATT\nDENISE"
],
"output": [
"ENEMIES\nLOVE"
]
}
| {"input":["1 10\n700282491 332230980 954401907 59481241 188256336 995466811 463183048 725322957 8929(...TRUNCATED)
| {"input":["4\n3 3\n1 2\n2 3\n3 1\n3 6\n1 2\n2 1\n2 3\n3 2\n1 3\n3 1\n7 10\n1 2\n2 3\n3 1\n1 4\n4 5\n(...TRUNCATED)
| 2
| 9
| {"language":[2,2,2,2,2,2,2,2,4,4,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,4,3,2(...TRUNCATED)
| {"language":[2,1,2,2,2,2,2,2,0,2,4,2,2,3,2,2,2,2,2,2,2,4,3,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,4,0,2(...TRUNCATED)
| 0
| 0
| 1,000
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 3
}
| 256,000,000
| ||||
331_D2. Escaping on Beaveractor
| "Sarah is a girl who likes reading books.\n\nOne day, she wondered about the relationship of a famil(...TRUNCATED)
| {"input":["2 1 0\n","2 2 4\n0 1 2 1\n0 1 2 1\n1 2 1 0\n1 1 1 2\n"],"output":["FIRST\n1 0 1 1\n","SEC(...TRUNCATED)
|
{
"input": [],
"output": []
}
|
{
"input": [],
"output": []
}
| 5
| 8
| {"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)
| {"language":[2,2,3,0,3,2,0,3,0,2,2,3,2,3,2,2,0,2,0,3,0,3,3,2,3,2,2,0,2,2,3,3,2,2,2,3,3,3,2,2,4,3,4,2(...TRUNCATED)
| 0
|
A
| 0
| 0
|
[] | false
|
{
"nanos": 0,
"seconds": 8
}
| 256,000,000
| |||
925_E. May Holidays
| "You are given an array a_1, a_2, ... , a_n, which is sorted in non-decreasing order (a_i ≤ a_{i +(...TRUNCATED)
|
{
"input": [
"5\n2 3 1 5 5\n4\n2 2 3 2\n2 1 5 3\n1 3 5\n2 1 5 3\n"
],
"output": [
"5\n26\n38\n"
]
}
| {"input":["3\n230967221047542071272908186525868331398921682471308664253988778356539397562182960087 1(...TRUNCATED)
| {"input":["2 2 1\n2 3 1\n3 2 3\n1 3 5","4 2 1\n2 3 1\n3 2 3\n1 3 5","2 2 1\n2 3 1\n3 2 5\n1 3 5","2 (...TRUNCATED)
| 2
| 7
| {"language":[2,2,2,2,2,2],"solution":["#include <stdio.h>\n#include <string.h>\n#include <algorithm>(...TRUNCATED)
| {"language":[2,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,2,2,2,2,2,2,2,2,2,2,4,1,4,2,2,2,2(...TRUNCATED)
| 188
| 0
| 1,600
|
[] | false
|
{
"nanos": 0,
"seconds": 2
}
| 1,073,741,824
| ||||
dbyz15t
| "You are given a simple arithmetic expression of the form a?b, where a and b are integer constants, (...TRUNCATED)
|
{
"input": [
"5\nabvzx\n\nSAMPLE"
],
"output": [
"zx\n"
]
}
| {"input":["2 3\n1 1 1\n0 1 0","2 2\n1 0\n0 1","3 3\n0 1 0\n1 0 1\n0 1 0","2 2\n0 0\n1 0","2 2\n0 1\n(...TRUNCATED)
| {"input":["3 2\n123 87 567\n1 2\n3 2\n","3 0\n4 1 8\n","3 2\n1 0 2\n3 2\n2 1\n","2 0\n1000000000 110(...TRUNCATED)
| 2
| 8
| {"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,4,2,2,2,2,2,4,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
|
A
| 2,000
| 0
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 1
}
| 256,000,000
|
End of preview. Expand
in Data Studio
edition_2933_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
- -