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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1244_C. The Football Season
| "Problem description.\nVipul is a hardworking super-hero who maintains the bracket ratio of all the (...TRUNCATED)
|
{
"input": [
"3\n1 2\n1 1\n2 1\n",
"3\n1 3\n2 2\n3 1\n"
],
"output": [
"1 3\n",
"1 2 3\n"
]
}
|
{
"input": [],
"output": []
}
| {"input":["3\nnxx","3\nnwx","3\nxxo","3\nxwn","3\nowx","3\npxx","3\npyx","3\npzx","3\npzw","3\npwz",(...TRUNCATED)
| 3
| 0
| {"language":[2,2,2],"solution":["#include<bits/stdc++.h>\nusing namespace std;\ndouble EPS=1e-9;\nst(...TRUNCATED)
| {"language":[2,3,2,4,3,2,2,4,2,3,4,4,2,4,2,2,2,3,2,3,2,3,2,3,2,4,2,4,2,3,4,3,2,4,2,4,3,4,2,4,4,4,4,4(...TRUNCATED)
| 124
| 1,500
| 1,700
|
[
"data structures"
] | false
| null | 536,870,912
| ||||
p00035 Is it Convex?
| "In computer science, there is a method called \"Divide And Conquer By Node\" to solve some hard pro(...TRUNCATED)
| {"input":["7 3\nabacaba\n1 1 1\n1 0 0\n1 0 0\n","7 3\nabacaba\n0 1 1\n1 0 0\n1 0 0\n","7 4\nbacadab\(...TRUNCATED)
|
{
"input": [],
"output": []
}
| {"input":["1\n3 1 2\n","1\n25 30 500\n","1\n5 4 7\n","3\n2 1 3\n3 4 6\n99995 9998900031 9998900031\n(...TRUNCATED)
| 5
| 0
| {"language":[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,2,2(...TRUNCATED)
| {"language":[2,2,2,2,2,2,2,2,2,2,2,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,3,2,2,0,3,2,2,2(...TRUNCATED)
| 0
|
E
| 0
| 1,600
|
[
"constructive algorithms",
"math"
] | false
|
{
"nanos": 0,
"seconds": 1
}
| 256,000,000
| |||
1466_F. Euclid's nightmare
| "The statement of this problem is the same as the statement of problem C1. The only difference is th(...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":["1 3 0\n6 3 4\n","5 4 32\n4 2 1 1\n","32 6 635\n3 4 2 1 7 7\n","3 7 20012\n1 1 1 1 1 1 100(...TRUNCATED)
| {"input":["3 2\n3\n2\n1","3 4\n3\n2\n1","3 0\n3\n2\n1","3 001\n3\n2\n1","5 1\n5\n3\n2\n1\n4","5 6\n1(...TRUNCATED)
| 5
| 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,4,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2(...TRUNCATED)
| {"language":[2,2,2,2,2,2,1,2,2,2,4,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2(...TRUNCATED)
| 1,227
| 3,000
| 800
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 1
}
| 256,000,000
| ||||
1100_D. Dasha and Chess
| "Short Phrase\n\nA Short Phrase (aka. Tanku) is a fixed verse, inspired by Japanese poetry Tanka and(...TRUNCATED)
| {"input":["5 18 1000\n","132 10 35\n","48 132 235\n","2 2 1\n"],"output":["-1","5 7\n","22 111","1 1(...TRUNCATED)
| {"input":["10 10\n.L.....R..\n.........U\n..D....D..\n.R......L.\n....L.....\n.........D\n......U...(...TRUNCATED)
| {"input":["100 3\n2 1 1 1 3 2 3 3 2 3 3 1 3 3 1 3 3 1 1 1 2 3 1 2 3 1 2 3 3 1 3 1 1 2 3 2 3 3 2 2 3 (...TRUNCATED)
| 2
| 21
| {"language":[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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)
|
{
"language": [],
"solution": []
}
| 157
|
C
| 0
| 1,900
|
[
"dp",
"implementation"
] | false
| null | 256,000,000
| |||
820_D. Mister B and PR Shifts
| "To celebrate the opening of the Winter Computer School the organizers decided to buy in n liters of(...TRUNCATED)
| {"input":["1 2\n3 4\n5 6\n","11 10\n13 8\n5 16\n","3 7\n4 6\n5 5\n","10 10\n10 10\n10 10\n"],"output(...TRUNCATED)
|
{
"input": [],
"output": []
}
| {"input":["384\n87 78 16 94 36 87 93 50 22 63 28 91 60 64 27 41 27 73 37 12 69 68 30 83 31 63 24 68 (...TRUNCATED)
| 2
| 12
| {"language":[3,3,3,3,3,3,3,3,3,3,2,3,3,3,1,3,3,3,3,3,3,3,3,3,3,3,4,3,3,3,3,3,3,1,3,3,1,3,3,3,4,3,3,3(...TRUNCATED)
| {"language":[2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,1,2,2,2,2,2,2,2,2,2,4,4,2,2,2,2,4,2,2,2,2,2,1,2,4,2,2,1,2(...TRUNCATED)
| 494
| 0
| 2,600
|
[
"implementation",
"math"
] | false
| "G: 運命力 - Destiny Draw -\n\n問題\n\nMr. D はカードゲームで勝負をすることに(...TRUNCATED)
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| |||
223_C. Partial Sums
| "problem\n\nYou are looking for a constellation in a picture of the starry sky. The photo always con(...TRUNCATED)
| {"input":["6 3\n2 1\n2 6\n4 2\n5 6\n2 3\n","8 4\n2 6\n2 7\n7 8\n1 2\n3 1\n2 4\n7 5\n"],"output":["1 (...TRUNCATED)
| {"input":["7\n","2000000000000000000\n","1000000000000000000\n","987654321012345678\n"],"output":["2(...TRUNCATED)
| {"input":["10 2 6\n1 2\n1 4\n2 1 8\n2 9 2\n1 2\n1 9\n2 3 5\n1 8\n","10 5 2\n1 2\n1 3\n2 4\n2 5\n1 6\(...TRUNCATED)
| 2
| 7
| {"language":[1,1,1,1,1,1,1,1,1,1,1,1],"solution":["import math\nimport sys\ndef checkpal(s):\n re(...TRUNCATED)
| {"language":[2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,1,2,2,4,2,2,2,2,2,2,4(...TRUNCATED)
| 161
|
B
| 0
| 1,900
|
[
""
] | false
| "JOI 君が住む都市にはN 個の駅があり，それぞれ1, 2, ..., N の番号が付けら(...TRUNCATED)
| null | 64,000,000
| ||
p02876 AtCoder Grand Contest 040 - Balance Beam
| "In the intergalactic empire Bubbledom there are N planets, of which some pairs are directly connect(...TRUNCATED)
|
{
"input": [
"3\n3 2 1\n1 2 3\n1 1\n1 2\n",
"3\n1 2 3\n3 2 1\n1 1\n1 1\n"
],
"output": [
"NO\n",
"YES\n"
]
}
| {"input":["20 18 1 2\n-9999944 -9999861 -9999850 -9999763 -9999656 -9999517 -9999375 -9999275 -99992(...TRUNCATED)
| {"input":["20 20\n00010110100100010111\n11110000001100101110\n01110101110001111000\n1011110100011111(...TRUNCATED)
| 2
| 7
| {"language":[4,2,2,2,2,4,3,2,2,2,2,2,2,4,3,4,4,4,1,4,3,4,3,3,2,4,2,3,1,4,3,4,4,2,2,3,3,3,3,3,3,1,4,1(...TRUNCATED)
|
{
"language": [],
"solution": []
}
| 0
| 0
| 0
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 1
}
| 256,000,000
| ||||
1386_A. Colors
| "Chef had a hard time arguing with his friend, and after getting a great old kick Chef saw a colored(...TRUNCATED)
|
{
"input": [
"7\n1\n2\n3\n4\n5\n100\n2000000\n"
],
"output": [
"0\n0\n4\n4\n12\n990998587\n804665184\n"
]
}
| {"input":["1\n2\n999999997 999999998\n999999999 1000000000\n","4\n1\n1 1000000000\n5\n1 1\n12 18\n10(...TRUNCATED)
| {"input":["10 10\n4 5 6 7 8 11 14 15 17 19\n1 4 12 10 13 20 14 20 13 16\n-7 16\n1 1\n7 9\n1 4\n4 8\n(...TRUNCATED)
| 6
| 2
| {"language":[2,2,2,3,2,2,2,3,4,3,2,2,3,2,4,3,2,2,2,3,3,3,2,3,3,2,2,3,2,2,1,2,3,2,3,4,4,3,2,2,2,2,3,3(...TRUNCATED)
| {"language":[2,2,2,2,2,3,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)
| 1,216
| 1,000
| 2,100
|
[] | false
|
{
"nanos": 0,
"seconds": 1
}
| 256,000,000
| ||||
p03771 AtCoder Grand Contest 012 - Camel and Oases
| "Chef has a an array A consisting of N elements. He wants to add some elements into the array as per(...TRUNCATED)
|
{
"input": [
"5 1",
"4 972439611840",
"3 24",
"1 111"
],
"output": [
"1",
"206",
"2",
"111"
]
}
| {"input":["6\n0 1 3 2 1 2\n","4\n1 2 3 1\n","4\n1 1 1 2\n","4\n3 3 2 1\n","4\n1 2 1 1\n","4\n1 1 2 1(...TRUNCATED)
| {"input":["6 2 3 1","7834164883628 15 2189823423122 7725883688276","4 2 1 4","7 1 3 2","4 3 3 1","4 (...TRUNCATED)
| 2
| 7
| {"language":[1],"solution":["for _ in xrange(input()):\n n= input()\n a=map(int,raw_input().sp(...TRUNCATED)
| {"language":[2,4,0,2,2,2,2,2,2,3,2,2,4,3,3,2,2,3,3,3,2,2,2,2,2,2,2,3,3,0,3,2,3,3,2,2,0,2,3,2,2,3,2,2(...TRUNCATED)
| 500
| 500
| 2,300
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 1
}
| 256,000,000
| ||||
p00819 Unreliable Message
| "Alice had a permutation p_1, p_2, …, p_n. Unfortunately, the permutation looked very boring, so s(...TRUNCATED)
| {"input":["6 2\n100 1 10 40 10 40\n","5 1\n5 10 7 3 20\n","3 0\n1 2 3\n"],"output":["97\n","3\n","0\(...TRUNCATED)
| {"input":["1 0\n23333\n","3 3\n1 1 1\n1 2\n2 3\n3 1\n","5 4\n1 2 2 2 2\n1 2\n1 3\n1 4\n1 5\n","10 30(...TRUNCATED)
| {"input":["qqqqqqqqqq qqqqqqqq\n3\nqqqqqqqq qqqqqqqqq\nqqqqqqqqq qqqqq\nqqqqq p\n","wwwww w\n8\nwwww(...TRUNCATED)
| 2
| 7
| {"language":[1,1,1],"solution":["for _ in range(input()):\n try:\n eval(raw_input())\n (...TRUNCATED)
| {"language":[4,2,3,3,4,4,2,3,3,2,2,4,4,3,3,2,3,4,2,4,2,3,3,1,2,2,2,3,3,4,2,4,3,4,2,2,2,4,2,4,1,3,4,4(...TRUNCATED)
| 0
| 500
| 2,900
|
[
"dfs and similar",
"dp",
"trees"
] | false
| null | 256,000,000
|
End of preview. Expand
in Data Studio
edition_1037_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
- 7