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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1165_A. Remainder
| "There are n cities in Berland and some pairs of them are connected by two-way roads. It is guarante(...TRUNCATED)
| {"input":["5\n2 1\n5 2\n10 3\n25 4\n15441 33\n"],"output":["\nUtkarsh\nAshish\nUtkarsh\nUtkarsh\nAsh(...TRUNCATED)
| {"input":["72\n909 34\n420 51\n621 76\n65 48\n82 41\n665 53\n43 33\n309 21\n942 51\n156 13\n997 11\n(...TRUNCATED)
| {"input":["4\ncba\ncab\nb\na\n3\nbca\nab\na\n5\nabc\nacb\nb\nc\nc\n5\nabc\nacc\nc\nb\nb\n0","4\ncba\(...TRUNCATED)
| 2
| 0
| {"language":[2,4,4,4,2,2,2,4,3,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,3,2,2,2,2,2,2,3,2(...TRUNCATED)
| {"language":[2,2,2,2,4,4,4,4,4,4,4,2,4,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,4,2,2,2,2,2(...TRUNCATED)
| 331
|
E
| 0
| 0
|
[
"greedy",
"implementation"
] | false
| "r × c の2次元グリッド上の２つの座標 (a1,a2) と (b1,b2) が与えられる。 ある(...TRUNCATED)
|
{
"nanos": 0,
"seconds": 1
}
| 512,000,000
| ||
283_D. Cows and Cool Sequences
| "Note that this is the first problem of the two similar problems. You can hack this problem only if (...TRUNCATED)
|
{
"input": [
"3\n3 4 5\n1 0 5\n5 3 2\n"
],
"output": [
"9\n0\n6\n"
]
}
|
{
"input": [],
"output": []
}
| {"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)
| 3
| 0
| {"language":[3,3,3,1,2,3,1,4,3,4,3,2,3,2,4,4,3,4,1,1,1,3,3,3,3,1,3,1,1,4,4,3,3,4,4,4,4,3,4,3,4,3,3,1(...TRUNCATED)
| {"language":[2,2,2,2,2,2,2,2,2,4,2,0,2,2,4,2,2,2,2,2,4,2,2,2,2,0,2,2,2],"solution":["#include <bits/(...TRUNCATED)
| 188
|
B
| 0
| 2,300
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 1,073,741,824
| |||
958_E2. Guard Duty (medium)
| "Problem:\n\nRani and Nandu decide to play a number game. Both play alternately, Rani playing the fi(...TRUNCATED)
|
{
"input": [
"3\n2 1 3\n3 3 6\n99995 9998900031 9998900031\n"
],
"output": [
"1 2 1 \n1 3 2 3 \n1 \n"
]
}
| {"input":["5\n1000000000000000000 352839520853234088 175235832528365792 753467583475385837 895062156(...TRUNCATED)
| {"input":["4\nRBRR","4\nBBRR","4\nRRCR","4\nRRAR","4\nRARR","4\nBQBR","4\nRCRR","4\nBPBR","4\nRRRC",(...TRUNCATED)
| 2
| 0
| {"language":[1],"solution":["T = int(raw_input())\nfor ti in xrange(T):\n\ta,b,c = map(int,raw_input(...TRUNCATED)
|
{
"language": [],
"solution": []
}
| 0
|
E
| 1,250
| 0
|
[
"combinatorics",
"math",
"number theory"
] | true
| null | 256,000,000
| |||
1320_F. Blocks and Sensors
| "Linda likes to change her hair color from time to time, and would be pleased if her boyfriend Archi(...TRUNCATED)
|
{
"input": [
"5 5\n1 2 3 4 5\n",
"3 1\n1 1 2\n",
"5 2\n1 1 2 1 3\n"
],
"output": [
"16",
"3",
"14"
]
}
| {"input":["10\ntypedef errtype** ucywcaykzh\ntypeof &ucywcaykzh*********\ntypedef &&&&&&void********(...TRUNCATED)
| {"input":["6\n3 1\n3 2\n5 100\n4 3\n4 4\n5 2\n\nSAMPLE","6\n6 1\n3 2\n5 100\n4 3\n4 4\n5 2\n\nSAMPLE(...TRUNCATED)
| 3
| 10
| {"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":[4,4,3,2,2,4,3,1,4,2,4,2,1,2,4,2,2,4,2,4,4,2,2,3,2,3,2,4,4,4,2,2,4,2,2,4,2,4,4,2,2,3,3,2(...TRUNCATED)
| 151
| 0
| 2,400
|
[
"binary search",
"combinatorics",
"data structures",
"dp",
"graphs",
"implementation",
"two pointers"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 32,000,000
| ||||
p02120 Cluster Network
| "\"Pizza At\", a fast food chain, offers three kinds of pizza: \"A-pizza\", \"B-pizza\" and \"AB-piz(...TRUNCATED)
|
{
"input": [
"6 0 6\n2 1 2\n2 3 4\n2 5 6\n2 3 2\n2 5 3\n1 1\n"
],
"output": [
"4\n"
]
}
| {"input":["4 15\n","4 2\n","467 4\n","4 11\n","4 7\n","3 1\n","4 14\n","500 125000\n","3 7\n","499 2(...TRUNCATED)
| {"input":["10803140200\n","14\n","11\n","174813966899\n","13753962\n","601828654335\n","114141413978(...TRUNCATED)
| 2
| 0
| {"language":[2,2,2],"solution":["#include<bits/stdc++.h>\nusing namespace std;\n\nint N,K;\nint dp[2(...TRUNCATED)
|
{
"language": [],
"solution": []
}
| 675
|
B
| 0
| 2,300
|
[
"implementation",
"strings"
] | false
|
{
"nanos": 0,
"seconds": 1
}
| 256,000,000
| |||
gameaam
| "A recently found Ancient Prophesy is believed to contain the exact Apocalypse date. The prophesy is(...TRUNCATED)
|
{
"input": [
"2 4\n0 0 1 1\n0 0 1 1\n\nSAMPLE"
],
"output": [
"0\n"
]
}
| {"input":["89 1\n50 53 97 41 68 27 53 66 93 19 11 78 46 49 38 69 96 9 43 16 1 63 95 64 96 6 34 34 45(...TRUNCATED)
| {"input":["brtakoktrosttttttttttosafasfkalsfkodfdasiofhadfhasdsajfdsafoasodsafahaihfdisoadspapsapios(...TRUNCATED)
| 3
| 0
| {"language":[2,2,2,4,2,2,2,4,2,2,2,1,2,2,2,2,3,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,1,2,2,2,2,1,2,2,2,2,2,2(...TRUNCATED)
| {"language":[2,2,2,2,2,4,4,4,3,2,2,3,2,4,4,2,3,4,4,2,4,4,2,2,2,2,2,4,2,2,4,4,4,2,4,2,2,4,4,2,2,2,2,2(...TRUNCATED)
| 990
| 0
| 800
|
[] | false
| null | 256,000,000
| ||||
laddu
| "Given a string, S, we define some operations on the string as follows:\n\na. reverse(S) denotes the(...TRUNCATED)
|
{
"input": [
"ppqb",
"pdbq"
],
"output": [
"No",
"Yes"
]
}
|
{
"input": [],
"output": []
}
| {"input":["30\n10 1 8 10 2 6 37 7 3 7 1 3 1 1 14 2 5 19 4 1 13 3 5 6 1 5 1 1 23 1\n98 4 43 41 56 58 (...TRUNCATED)
| 5
| 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],"s(...TRUNCATED)
| {"language":[4,2,2,2,2,2,2,2,2,1,2,2,2,1,3,2,2,2,1,2,2,3,2,3,2,2,2,2,2,2,2,2,2,2,3,2,2,4,4,3,2,2,3,2(...TRUNCATED)
| 284
|
E
| 750
| 0
|
[] | false
|
{
"nanos": 0,
"seconds": 1
}
| 268,435,456
| |||
p03225 Tenka1 Programmer Contest - Equilateral
| "Garfield the cat likes candies A LOT. He always keeps a huge stock of it at his home. Today John, h(...TRUNCATED)
| {"input":["3 3 1 10\n@#b\n.#.\n.#.\nb 100","3 3 1 20\n@*C\n..*\n...\nC 10","3 3 1 10\n@0.\n...\n...\(...TRUNCATED)
| {"input":["205078485761\n","873109054817\n","518649879439\n","401021537803\n","821985629174\n","6146(...TRUNCATED)
| {"input":["6\nbabddc\n","7\nbd`dccd\n","2\nab\n","7\nxxyzyyy\n","6\naagcfb\n","7\nbbbcdbc\n","4\npbr(...TRUNCATED)
| 2
| 10
| {"language":[2,2,2,2,4,2,2,4,4,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,4,2,2,2,4,2,2(...TRUNCATED)
|
{
"language": [],
"solution": []
}
| 38
|
K
| 1,750
| 1,000
|
[
""
] | false
| null | 256,000,000
| |||
1366_A. Shovels and Swords
| "Now that Chef has finished baking and frosting his cupcakes, it's time to package them. Chef has N (...TRUNCATED)
| {"input":["1\nindex.dml\n<dml><title>Markup language has Declined</title><br>Programmers world</dml>(...TRUNCATED)
|
{
"input": [],
"output": []
}
| {"input":["5\n2 2 4 7 10","5\n1 2 22 7 0","5\n1 2 4 3 10","5\n0 2 3 7 1","5\n0 2 1 7 1","5\n1 2 4 3 (...TRUNCATED)
| 6
| 0
| {"language":[3,4,3,2,2,3,3,1,3,4,2,4,1,3,3,1,1,3,3,2,1,3,2,4,2,3,3,1,3,2,2,2,3,3,1,2,3,4,4,4,3,4,3,3(...TRUNCATED)
| {"language":[3,2,2,4,1,2,2,2,2,4,4,2,2,2,4,4,2,3,2,1,2,2,2,4,4,2,4,2,2,1,2,2,2,2,2,2,2,2,2,4,2,2,2,2(...TRUNCATED)
| 1,043
| 0
| 0
|
[
"brute force"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 512,000,000
| ||||
p02613 AtCoder Beginner Contest 173 - Judge Status Summary
| "You are given an integer n. You have to apply m operations to it.\n\nIn a single operation, you mus(...TRUNCATED)
|
{
"input": [
"5 5 10\n1 2 4 8 16\n",
"3 4 11\n1 2 3 4\n"
],
"output": [
"7\n",
"6\n"
]
}
|
{
"input": [],
"output": []
}
| {"input":["pH\n2\n","nifzlTLTeWxaD\n0\n","ysBKLtQXvmnCrldEceqXKkaZOrvjRbwlW\n5\n","LiqWMLEVLRhW\n1\n(...TRUNCATED)
| 2
| 2
| {"language":[4,3,2,2,3,2,4,3,3,2,2,4,2,2,4,3,3,3,2,2,4,3,4,3,3,3,3,3,3,4,1,4,4,2,3,4,1,2,2,2,3,2,3,3(...TRUNCATED)
| {"language":[2,2,2,2,4,2,2,4,4,2,2,2,2,4,2,4,2,2,2,4,2,2,2,3,2,2,2,2,2,2,4,2,2,4,2,2,2,4,2,2,2,2,2,2(...TRUNCATED)
| 40
| 0
| 1,500
|
[
"greedy",
"sortings",
"two pointers"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
|
End of preview. Expand
in Data Studio
edition_2643_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
- -