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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
p03725 AtCoder Grand Contest 014 - Closed Rooms
| "Tree is a connected acyclic graph. Suppose you are given a tree consisting of n vertices. The verte(...TRUNCATED)
| {"input":["6\n3\n60\n100\n1024\n23456\n8735373\n\nSAMPLE"],"output":["0\n14\n24\n253\n5861\n2183837\(...TRUNCATED)
|
{
"input": [],
"output": []
}
| {"input":["25\n91 57\n2 73\n54 57\n2 57\n23 57\n2 6\n57 54\n57 23\n91 54\n91 23\n57 23\n91 57\n54 2\(...TRUNCATED)
| 6
| 0
| {"language":[4,4,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,3,2,2,4,4,4,2,2,2,2,2,2,2,2,4,2,2,2(...TRUNCATED)
| {"language":[3,4,2,2,1,2,3,1,2,4,4,1,2,2,2,2,1,2,3,2,2,4,2,4,2,1,4,2,1,2,2,1,1,3,2,2,4,2,2,4,2,2,2,2(...TRUNCATED)
| 1,311
| 0
| 2,100
|
[
"data structures",
"greedy",
"implementation"
] | true
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| ||||
p00074 Videotape
| "Ali is Hamed's little brother and tomorrow is his birthday. Hamed wants his brother to earn his gif(...TRUNCATED)
|
{
"input": [
"2 5\n1 3 4\n2 2 3\n"
],
"output": [
"2\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)
| 5
| 12
| {"language":[2,2,2,2,2,4,4,4,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,4,2,2,2,2,2,2,2,2(...TRUNCATED)
| {"language":[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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)
| 0
|
B
| 1,000
| 0
|
[
"brute force",
"greedy",
"implementation"
] | false
| null | 256,000,000
| |||
p03503 AtCoder Beginner Contest 080 - Shopping Street
| "You are given a huge decimal number consisting of n digits. It is guaranteed that this number has n(...TRUNCATED)
| {"input":["2\n2 1 4 3\n4\n1 2 0 2\n","1\n1 2\n3\n0 1 1\n"],"output":[" (...TRUNCATED)
| {"input":["2 1\n1 1\n","4 1\n2 2 1 1\n","10 1\n2 6 3 4 2 4 4 3 2 1\n","2 1\n999152 999153\n","8 1000(...TRUNCATED)
| {"input":["2\n3 6\n10 11","2\n1 3\n10 11","2\n0 6\n10 11","2\n0 6\n0 11","2\n3 6\n8 22","2\n3 6\n8 4(...TRUNCATED)
| 2
| 0
| {"language":[2,2,3,2,4,4,2,2,1,4,2,2,4,2,4,4,3,3,3,3,4,3,1,4,4,1,3,2,4,4,4,3,3,2,3,2,3,2,3,3,3,3,4,4(...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],"solution":[(...TRUNCATED)
| 0
|
B
| 1,750
| 2,300
|
[
"math"
] | false
| null | 256,000,000
| |||
319_B. Psychos in a Line
| "As you know Appu created aversion to Maths after that maths problem given by his teacher.So he stop(...TRUNCATED)
| {"input":["8\n1 2 100\n1 3 20\n2 4 2\n2 5 1\n3 6 1\n3 7 2\n6 8 5\n6\n1 8\n2 3\n5 8\n2 6\n4 7\n6 1\n"(...TRUNCATED)
| {"input":["10 9\n7 9\n8 9\n8 2\n10 6\n8 3\n9 4\n2 6\n8 5\n9 1\n","2 1\n1 2\n","20 20\n1 9\n11 9\n3 5(...TRUNCATED)
| {"input":["2\n1 1 1 1 1 0 0 0 0 0\n0 0 0 0 0 1 1 1 1 1\n0 -2 -2 -2 -2 -2 -1 -1 -1 -1 -1\n0 -2 -2 -2 (...TRUNCATED)
| 2
| 10
| {"language":[2,2,2,2,2,2,2,4,2,2,1,4,2,2,2,2,4,2,4,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2(...TRUNCATED)
| {"language":[2,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,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(...TRUNCATED)
| 835
|
B
| 0
| 1,800
|
[
"implementation",
"math"
] | true
|
{
"nanos": 0,
"seconds": 5
}
| 256,000,000
| |||
p00680 KND Factory
| "For skilled programmers, it is very easy to implement a sorting function. Moreover, they often avoi(...TRUNCATED)
|
{
"input": [
"19 29\n",
"3 6\n"
],
"output": [
"2\n",
"2\n"
]
}
|
{
"input": [],
"output": []
}
| {"input":["2 1 5\n1 1 1 8\n2 2 1 1\n1 2 1 1\n1 2 1 3\n2 2 1 2\n","5 1 5\n1 5 1 3\n1 5 1 2\n2 2 2 5\n(...TRUNCATED)
| 2
| 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],"solution":["def solve():\n\(...TRUNCATED)
| {"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,3,2,1,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)
| 1,369
| 20
| 800
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| ||||
188_G. Array Sorting
| "Polycarp was dismantling his attic and found an old floppy drive on it. A round disc was inserted i(...TRUNCATED)
| {"input":["3\n3 3 4\n3 3 5\n3 3 3\n"],"output":["***\n*.*\n***\n\n***\n**.\n...\n\n***\n*.*\n**.\n\n(...TRUNCATED)
|
{
"input": [],
"output": []
}
|
{
"input": [],
"output": []
}
| 5
| 0
| {"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,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)
| 415
|
B3
| 1,000
| 2,200
|
[
"*special",
"data structures",
"dsu",
"implementation",
"math",
"sortings"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| |||
709_E. Centroids
| "You are given a permutation of the numbers 1, 2, ..., n and m pairs of positions (aj, bj).\n\nAt ea(...TRUNCATED)
| {"input":["5 4\n#.##\n.##.\n#...\n..##\n...#","13 27\n......#.........#.......#..\n...#.....###..\n.(...TRUNCATED)
| {"input":["9\n100 100 100 200 100 100 200 100 200\n","3\n100 100 100\n","7\n200 200 200 100 200 200 (...TRUNCATED)
| {"input":["4\n11833\n5512\n100\n28436\n33903\n100\n84816\n75747\n100\n92281\n31380\n100","1\n45819\n(...TRUNCATED)
| 2
| 11
| {"language":[2,2,2,2,2,4,2,2,2,4,2,2,2,2,4,2,2,2,2,2,2,2,2,4,4,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2(...TRUNCATED)
|
{
"language": [],
"solution": []
}
| 1,100
|
A
| 0
| 0
|
[
"dfs and similar",
"graphs",
"hashing",
"shortest paths"
] | true
|
{
"nanos": 0,
"seconds": 2
}
| 268,435,456
| |||
1354_C2. Not So Simple Polygon Embedding
| "D: The Diversity of Prime Factorization\n\nProblem\n\nEbi-chan has the FACTORIZATION MACHINE, which(...TRUNCATED)
| {"input":["3 4\n10 10\n-10 -10\n3 3\n1 2\n2 3\n3 5\n3 5","2 2\n2 0\n0 0\n-1 0\n1 0","5 5\n-100000000(...TRUNCATED)
| {"input":["78 78\n-645462 -187679 693035 927066 431506 16023 -173045 698159 -995400 -687770 -747462 (...TRUNCATED)
|
{
"input": [],
"output": []
}
| 2
| 10
| {"language":[3,3,4,2,1,3,2,3,4,3,2,4,3,3,3,3,3,3,3,1,3,3,3,1,3,2,3,2,3,3,3,1,3,1,1,1,1,4,1,3,2,3,3,3(...TRUNCATED)
| {"language":[2,4,2,2,2,2,2,1,2,2,4,2,2,2,2,1,2,2,4,2,4,1,2,2,2,4,2,2,2,2,2,2,2,2,1,2,2,2,2,3,2,2,2,2(...TRUNCATED)
| 0
|
A
| 1,000
| 0
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 8
}
| 256,000,000
| |||
1149_B. Three Religions
| "Buber is a Berland technology company that specializes in waste of investor's money. Recently Buber(...TRUNCATED)
| {"input":["10\n10\n3 7\n1 4\n1 6\n5 5\n1 1\n3 9\n7 8\n1 2\n3 3\n7 10\n10\n2 4\n1 7\n3 4\n3 5\n2 8\n2(...TRUNCATED)
| {"input":["15\nMIRZOYANOVECLOX\n","23\nAABBBAAACCCCCAAADDDDDDD\n","2\nQA\n","11\nGGRRAATTZZZ\n","6\n(...TRUNCATED)
| {"input":["2 2 1\n1 1 1 1\n","5 5 20\n3 1 3 3\n1 2 2 2\n4 3 4 2\n3 2 2 2\n3 4 2 4\n4 1 4 5\n4 3 5 3\(...TRUNCATED)
| 2
| 7
| {"language":[2,2,2,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,2,2,2,2,2,2,2,2,2(...TRUNCATED)
| {"language":[4,4,4,2,3,2,2,2,3,3,4,3,4,2,2,3,4,4,2,2,2,2,2,3,2,3,3,4,4,2,3,2,3,2,3,2,4,4,4,4,2,4,2,2(...TRUNCATED)
| 675
|
A
| 0
| 2,500
|
[
"data structures",
"greedy",
"implementation"
] | false
| "ある日、たろう君は、本文に「519345213244」という数字だけが書いてあるお(...TRUNCATED)
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| ||
the-competitive-class-3
| "Monk's birthday is coming this weekend! He wants to plan a Birthday party and is preparing an invit(...TRUNCATED)
| {"input":["3 2\n0 0 0\n1 1 1\n","4 3\n0 0 2 1\n2 0 1 1\n","5 10\n0 0 0 1 2\n2 1 0 0 0\n"],"output":[(...TRUNCATED)
| {"input":["2016 4549\n433\n","5000 1\n3\n","4035 369\n26\n","1595 2881\n710\n","3762 3914\n1073\n","(...TRUNCATED)
| {"input":["3\n77 42 77\n77 77\n77\n","3\n77 31 77\n77 77\n77\n","4\n1 5 7 12\n1 5 7\n1 5\n","3\n77 7(...TRUNCATED)
| 5
| 9
| {"language":[1,1,1,1,1],"solution":["n = input()\nfor i in range(n):\n str = raw_input()\n l =(...TRUNCATED)
| {"language":[2,2,2,2,2,2,2,2,2,2,2,3,2,4,2,2,2,4,2,4,2,2,2,2,2,4,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)
| 0
| 0
| 0
|
[
"brute force",
"implementation",
"strings"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 134,217,728
|
End of preview. Expand
in Data Studio
edition_2425_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
- 26