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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
85_D. Sum of Medians
| "We are definitely not going to bother you with another generic story when Alice finds about an arra(...TRUNCATED)
|
{
"input": [
"3 2\n2 1 2\n1 3\n",
"7 3\n3 1 3 7\n2 2 5\n2 4 6\n"
],
"output": [
"1\n",
"10\n"
]
}
|
{
"input": [],
"output": []
}
| {"input":["1 0\n25 47 15","1 0\n16 47 15","1 0\n31 47 15","2 0\n31 47 13","2 0\n31 47 20","2 0\n31 4(...TRUNCATED)
| 2
| 0
| {"language":[1,2,4,3,2,2,2,3,4,2,3,1,2,2,4,2,4,4,2,2,1,4,4,2,4,2,2,2,2,2,3,1,2,2,4,4,4,1,2,2,3,4,2,3(...TRUNCATED)
| {"language":[2,2,4,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,2,2,2,2,4,3,2,2,2,2,2,2,3,2,2,2(...TRUNCATED)
| 1,466
| 0
| 0
|
[
"constructive algorithms",
"dfs and similar",
"dsu",
"graphs",
"matrices"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 268,435,456
| ||||
p02652 AtCoder Grand Contest 045 - 01 Unbalanced
| "In the intergalactic empire Bubbledom there are N planets, of which some pairs are directly connect(...TRUNCATED)
|
{
"input": [
"2\n11 3\n4 3 4\n6 3\n3 2 1"
],
"output": [
"2\n1\n"
]
}
| {"input":["5 5\n1 5 9403 40347\n1 3 13851 29314\n4 5 1315 561894\n3 5 2748 33090\n5 3 10717 32306\n"(...TRUNCATED)
| {"input":["20 101 100\n1 14 20 3 19 10 12 18 4 17 13 6 8 5 2 15 7 16 9 11\n69 53 101 100 41 38 63 84(...TRUNCATED)
| 2
| 10
| {"language":[3,4,3,1,3,1,2,3,4,3,3,2,3,2,4,3,2,2,2,1,1,2,3,3,3,3,3,2,4,4,4,2,4,4,2,4,3,3,4,1,3,4,1,2(...TRUNCATED)
| {"language":[2,2,2,4,4,2,2,2,4,2,2,4,4,4,2,4,1,4,2,2,1,4,4,2,2,2,2,2,2,4,4,4,2,2,2,3,4,2,1,2,4,2,4,4(...TRUNCATED)
| 1,088
|
D
| 2,000
| 0
|
[
"dfs and similar",
"dsu",
"graphs"
] | false
| "20XX年に喜多方市熱塩加納町から南会津町までの6区間、総距離58kmの会津中(...TRUNCATED)
|
{
"nanos": 0,
"seconds": 5
}
| 268,435,456
| ||
roy-and-wobbly-numbers
| "Polycarp plays a computer game. In this game, the players summon armies of magical minions, which t(...TRUNCATED)
| {"input":["1 1\n1\n1\n1\n2 1 100\n","4 6\n1 8 2 4\n3 3 6 1 5 2\n3\n1 1 1\n2 5 10\n1 1 6\n","1 1\n1\n(...TRUNCATED)
| {"input":["6 4 2\n100010\n","4 2 1\n1000\n","8 5 2\n10000100\n","11 5 2\n11010000101\n","64 40 14\n1(...TRUNCATED)
| {"input":["1000\n999001\n999002\n999003\n999004\n999005\n999006\n999007\n999008\n999009\n999010\n999(...TRUNCATED)
| 2
| 7
| {"language":[2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,3,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
|
C
| 1,500
| 0
|
[
"dp",
"greedy",
"strings"
] | false
|
{
"nanos": 0,
"seconds": 5
}
| 134,217,728
| |||
76_B. Mice
| "Strings can be efficiently stored as a data structure, to have efficient searching methods.\nA new (...TRUNCATED)
|
{
"input": [
"2 2\n2 3\n2 3\n2 3\n2 2\n3 2",
"2 2\n2 3\n2 3\n2 3\n2 2\n2 2"
],
"output": [
"yes",
"no"
]
}
| {"input":["8\n0 1\n1 0\n0 1\n1 1\n0 1\n1 0\n0 1\n1 0\n","8\n1 0\n1 0\n1 0\n0 1\n0 1\n1 1\n1 1\n0 1\n(...TRUNCATED)
| {"input":["1 1\n2\n2\n","1 1\n2\n1\n","10 10\n1 2 3 4 5 6 7 8 9 10\n6 7 8 9 10 1 0 3 4 5\n","10 10\n(...TRUNCATED)
| 2
| 6
| {"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,4,2,2,4,2,2,2,2,2,2,4,2,2,4,2,4,2,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,4,2,2(...TRUNCATED)
| 990
| 0
| 2,000
|
[
""
] | false
|
{
"nanos": 500000000,
"seconds": 0
}
| 256,000,000
| ||||
188_D. Asterisks
| "Roy is going through the dark times of his life. Recently his girl friend broke up with him and to (...TRUNCATED)
|
{
"input": [
"3\n1 2 4\n",
"3\n5 3 1\n"
],
"output": [
"3",
"1"
]
}
| {"input":["25\n11632 6805 12792 25513 4573 48789 42308 23247 17502 23125 43597 22173 45527 8637 3300(...TRUNCATED)
| {"input":["8\n0 1\n1 0\n0 1\n1 1\n0 0\n1 0\n0 1\n1 0\n","3\n0 1\n1 1\n1 0\n","8\n0 1\n1 1\n0 1\n1 1\(...TRUNCATED)
| 3
| 6
| {"language":[4,4,4,4,4,4,4,3,3,2,4,4,4,3,3,4,2,2,4,3,3,3,4,3,1,2,2,3,1,2,4,1,1,4,2,2,4,1,3,3,4,4,4,3(...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)
| 1,497
| 0
| 800
|
[
"data structures",
"implementation",
"math"
] | false
| null | 256,000,000
| ||||
746_F. Music in Car
| "Taro is going to play a card game. However, now he has only n cards, even though there should be 52(...TRUNCATED)
|
{
"input": [
"3\n2 1 3\n3 3 6\n99995 9998900031 9998900031\n"
],
"output": [
"1 2 1 \n1 3 2 3 \n1 \n"
]
}
|
{
"input": [],
"output": []
}
| {"input":["5\n42\n17\n444\n7\n52\n","5\n42\n17\n640\n7\n51\n","5\n42\n15\n444\n7\n52\n","5\n42\n21\n(...TRUNCATED)
| 3
| 9
| {"language":[4,2,1,1,3,2,3,3,4,2,4,4,2,3,4,3,2,4,1,2,2,3,1,2,2,2,4,1,2,4,3,3,2,4,4,4,1,3,1,4,4,1,2,4(...TRUNCATED)
| {"language":[2,2,4,2,2,2,2,3,3,2,3,3,4,2,2,3,2,3,2,2,2,2,2,2,2,3,2,4,2,4,1,2,4,3,2,4,4,2,2,3,4,2,2,2(...TRUNCATED)
| 0
|
D
| 0
| 1,600
|
[
"implementation"
] | false
| "Problem\n\n$n$枚のカードからなる束があり、下から$i$番目のカードには$i$が(...TRUNCATED)
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| ||
acdemy
| "ZS the Coder has drawn an undirected graph of n vertices numbered from 0 to n - 1 and m edges betwe(...TRUNCATED)
| {"input":["6\nAC\nTLE\nAC\nAC\nWA\nTLE","10\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC"],"output":["AC (...TRUNCATED)
| {"input":["1 100000 100000 100000 -100000\n","46456 -2621 -23623 -98302 -99305\n","9 20 0 40 0\n","1(...TRUNCATED)
| {"input":["6 8\nabbaab\n+ 1 a\n+ 3 a\n+ 3 a\n+ 1 b\n+ 2 b\n+ 3 b\n- 1\n+ 2 z\n","6 8\nabdabc\n+ 2 a\(...TRUNCATED)
| 3
| 0
| {"language":[3,4,4,3,3,1,2,3,2,2,3,2,3,2,3,1,4,3,4,3,4,3,3,4,4,2,2,3,2,2,3,2,2,4,3,2,4,3,4,4,2,2,3,3(...TRUNCATED)
| {"language":[4,1,3,2,2,4,2,4,2,4,3,1,4,3,1,2,4,4,2,1,2,4,2,2,2,2,4,2,1,2,3,2,4,4,3,4,2,2,2,3,2,2,4,1(...TRUNCATED)
| 0
| 1,250
| 1,600
|
[] | false
|
{
"nanos": 0,
"seconds": 2
}
| 1,073,741,824
| ||||
p02298 Is-Convex
| "A new type of mobile robot has been developed for environmental earth observation. It moves around (...TRUNCATED)
|
{
"input": [
"15 20\n",
"14 8\n",
"6 6\n"
],
"output": [
"3\n",
"-1\n",
"0\n"
]
}
| {"input":["12-12-201312-12-201312-12-201313--12-201313--12-201313--12-201313--12-201313--12-201313--(...TRUNCATED)
| {"input":["6 4 3\n0 1 2\n2 3 0\n0 4 5\n1 4 4\n1 2 2\n0 4 2\n","5 1 7\n0 4 1\n0 10 5\n9 0 2\n9 0 0\n9(...TRUNCATED)
| 2
| 9
| {"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,4,2,2,2,2,2,2(...TRUNCATED)
| {"language":[2,2,2,2,4,2,4,2,2,2,4,4,3,3,4,4,2,4,2,4,3,4,4,2,2,4,2,2,2,2,2,3,2,2,2,2,4,2,2,2,2,4,4,2(...TRUNCATED)
| 1,117
|
A
| 1,000
| 0
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 512,000,000
| |||
p01576 Exciting Bicycle
| "In this problem, we only consider strings consisting of lowercase English letters.\n\nStrings s and(...TRUNCATED)
| {"input":["3\n0\n1\n2\n3\n4\n5\n","3\n10\n12\n-5\n8\n10\n12\n"],"output":["5.656854249\n","15.524174(...TRUNCATED)
|
{
"input": [],
"output": []
}
|
{
"input": [],
"output": []
}
| 2
| 11
| {"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],"solution":["for(...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,3,2,2,2,2,2,2,2(...TRUNCATED)
| 0
|
B
| 0
| 2,100
|
[] | false
|
{
"nanos": 0,
"seconds": 1
}
| 0
| |||
1500_B. Two chandeliers
| "Every day Ruslan tried to count sheep to fall asleep, but this didn't help. Now he has found a more(...TRUNCATED)
|
{
"input": [
"500 100 1000",
"19 123 143",
"19 123 142",
"50 100 120"
],
"output": [
"No",
"No",
"Yes",
"Yes"
]
}
| {"input":["2 313 856 964 421\n","61 464 623 89 548\n","37 261 207 1 1000\n","4 202 512 995 375\n","3(...TRUNCATED)
| {"input":["3\n3 2 0\n","3\n1 2 0\n","3\n2 0 2\n","11\n1 1 1 1 1 2 4 2 2 2 1\n","5\n1 1 2 1 2\n","5\n(...TRUNCATED)
| 2
| 8
| {"language":[1,1],"solution":["from math import*\nfor i in range (input()):\n num ,k = map(int,ra(...TRUNCATED)
| {"language":[2,3,3,2,2,3,2,4,3,3,2,2,4,4,4,2,4,4,4,4,3,2,4,3,2,2,2,2,2,3,2,2,2,2,2,3,4,4,4,2,4,2,4,3(...TRUNCATED)
| 0
| 0
| 2,100
|
[
""
] | true
|
{
"nanos": 0,
"seconds": 3
}
| 256,000,000
|
End of preview. Expand
in Data Studio
edition_2896_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
- 8