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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
709_E. Centroids | "There are N people standing on the x-axis. Let the coordinate of Person i be x_i. For every i, x_i (...TRUNCATED) | {
"input": [
"2008 2 29\n2015 3 1",
"1999 9 9\n2001 11 3"
],
"output": [
"8",
"3"
]
} | {
"input": [],
"output": []
} | {"input":["10\n2 3 1 5 6 4 2 10 7 7\n5\n10 1\n5 7\n19 6\n1 1\n10 8\n","10\n2 3 1 5 6 4 1 10 7 7\n5\n(...TRUNCATED) | 2 | 0 | {"language":[2,2,2,4,2,2,2,4,2,2,2,2,4,2,2,2,2,1,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,2,2,1,4,2,4,2,2,2,4,2(...TRUNCATED) | {
"language": [],
"solution": []
} | 835 | D | 1,750 | 2,000 | [
"constructive algorithms",
"math",
"sortings"
] | false | null | 256,000,000 | |||
180_D. Name | "Let's consider the following game. We have a rectangular field n × m in size. Some squares of the (...TRUNCATED) | {
"input": [
"7\n1\n2\n3\n12\n12345\n15116544\n387420489\n"
],
"output": [
"0\n-1\n2\n-1\n-1\n12\n36\n"
]
} | {"input":["72\n111101100111001110000000100010100000011011100110001010111010101011111100\n","3\n101\n(...TRUNCATED) | {"input":["10\n4643665 282618243 791521863 214307200 976959598 590907019 166397456 708291256 8537738(...TRUNCATED) | 2 | 11 | {"language":[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,1,2,2,2,2,2,2,2,4,2,2,2(...TRUNCATED) | {"language":[2,2,2,2,2,2,2,0,2,2,2,0,3,2,2,3,2,4,0,2,2,2,2,0,2,2,2,2,4,2,2,2,2,2,0,2,2,2,2,2,2,3,2,2(...TRUNCATED) | 0 | D | 500 | 1,100 | [
"meet-in-the-middle"
] | false | {
"nanos": 0,
"seconds": 2
} | 134,217,728 | |||
343_B. Alternating Current | "Utkarsh is forced to play yet another one of Ashish's games. The game progresses turn by turn and a(...TRUNCATED) | {
"input": [
"5 5 10 5 4\n",
"12 4 12 4 1\n",
"15 1 100 0 0\n"
],
"output": [
"1\n",
"3\n",
"15\n"
]
} | {"input":["7\n7 3 4 6 6 7\n","4\n3 3 4\n","6\n3 3 6 6 6\n","5\n4 4 4 5\n","9\n2 9 7 6 9 7 8 9\n","3\(...TRUNCATED) | {"input":["6\n773209925 62005863 473635171 329666981 510631133 207643327\n","1\n2\n","7\n481003311 5(...TRUNCATED) | 2 | 7 | {"language":[2,2,2,4,4,2,2,2,2,2,4,2,2,2,4,2,4,2,4,4,2,4,2,4,2,2,4,2,2,2,4,2,2,4,4,4,2,4,2,4,4,1,4,4(...TRUNCATED) | {"language":[4,4,4,2,2,2,2,2,4,2,4,2,4,2,4,1,2,2,2,2,4,2,2,2,4,4,4,2,2,2,2,2,2,4,4,2,2,2,2,2,2,4,4,1(...TRUNCATED) | 0 | A | 0 | 1,500 | [
""
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | |||
248_A. Cupboards | "You are running through a rectangular field. This field can be represented as a matrix with 3 rows (...TRUNCATED) | {
"input": [
"3 6\n2 3 5\n",
"6 7\n1 2 3 4 5 6\n"
],
"output": [
"2\n",
"7\n"
]
} | {
"input": [],
"output": []
} | {"input":["12 11\n11 12\n25 7\n","12 17\n6 19\n13 16\n","9 12\n3 17\n10 20\n","2 4\n1 3\n3 3\n","3 7(...TRUNCATED) | 3 | 7 | {"language":[2,2,2,2,2,2,2,2,4,2,2,2,2,4,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,2,2,2,2,2,2(...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) | 392 | 2,500 | 1,900 | [
"combinatorics",
"dp",
"trees"
] | false | {
"nanos": 0,
"seconds": 2
} | 268,435,456 | ||||
1439_C. Greedy Shopping | "Given a string, S, we define some operations on the string as follows:\n\na. reverse(S) denotes the(...TRUNCATED) | {"input":["5\n1 2\n2 3\n3 4\n4 5\n5\n1 3 1 2 2\n1 4 1 3 2\n1 4 1 3 3\n4 2 3 3 9\n5 2 3 3 9\n"],"outp(...TRUNCATED) | {"input":["5 0\n884430748 884430748 708433020 708433020 708433020\n","2 1\n1 1\n","2 0\n2 1\n","5 2\(...TRUNCATED) | {"input":["20\n.*..*...*....*.../.*\n","97\n.*****.**.***.*.**.*..*.***.*.***.*.**.***.*......*..*..(...TRUNCATED) | 2 | 0 | {"language":[3,2,4,2,2,2,3,3,3,4,3,3,3,2,4,3,2,4,2,3,2,2,3,2,2,4,2,2,3,3,4,3,3,2,2,2,4,3,3,3,3,3,2,2(...TRUNCATED) | {
"language": [],
"solution": []
} | 0 | C1 | 0 | 0 | [] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
867_D. Gotta Go Fast | "Amr loves Geometry. One day he came up with a very interesting problem.\n\nAmr has a circle of radi(...TRUNCATED) | {"input":["1\n-1\n0"],"output":["? 0 0\n? 536870912 0\n? 0 536870912\n? 805306368 536870912\n? 53687(...TRUNCATED) | {"input":["20 20\n00010110100100010111\n11110000001100101110\n01110101110001111000\n1011110100011111(...TRUNCATED) | {"input":["1\n297754\n","16\n2 2 2 3 5 3 5 5 5 7 7 7 11 11 13 17\n","16\n2 2 2 2 2 3 3 5 5 5 5 7 7 1(...TRUNCATED) | 2 | 0 | {"language":[4,2,2,2,2,3,4,2,4,3,2,4,1,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,3,4,2,2,2,2,2,2,2,2,2,2,4,2,4(...TRUNCATED) | {"language":[2,2,2,2,2,3,4,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,4,2,3,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 962 | A | 2,000 | 1,000 | [
"binary search",
"data structures",
"math"
] | false | {
"nanos": 0,
"seconds": 2
} | 268,435,456 | |||
1244_C. The Football Season | "Tavas is a cheerleader in the new sports competition named \"Pashmaks\".\n\n<image>\n\nThis competi(...TRUNCATED) | {"input":["2\n10 1\n1 2 -3 -5 4 6 -3 2 -1 2\n10 2\n1 2 -3 -5 4 6 -3 2 -1 2\n\nSAMPLE"],"output":["12(...TRUNCATED) | {"input":["5\n10\nbb\nbb\nab\naa\nbb\nbb\nba\naa\nbb\nab\n10\nbb\nab\nba\nab\nba\nba\nab\nba\nba\nba(...TRUNCATED) | {"input":["7\n5\n-1 10 -1 12 -1\n5\n-1 40 35 -1 35\n6\n-1 -1 9 -1 3 -1\n2\n-1 -1\n2\n0 -1\n4\n1 -1 3(...TRUNCATED) | 5 | 0 | {"language":[2,2,2,2,2,3,3,2,2,2,4,2,2,2,2,2,2,3,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,3,2,2,4,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],"solution":["#include <bits/stdc++.h(...TRUNCATED) | 1,466 | D2 | 2,000 | 0 | [
"data structures",
"graphs"
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | |||
p02781 AtCoder Beginner Contest 154 - Almost Everywhere Zero | "You are given a matrix consisting of n rows and m columns. The matrix contains lowercase letters of(...TRUNCATED) | {
"input": [
"3",
"100",
"1000000"
],
"output": [
"3",
"473",
"13969985"
]
} | {"input":["11 11\n6 2\n6 2\n1 2\n2 2\n3 1\n6 2\n1 1\n1 1\n3 1\n3 1\n6 2\n","21 7\n14 1\n882797755 2\(...TRUNCATED) | {"input":["4\n4568\n4545992\n9265642\n1073637","4\n4568\n3988846\n9265642\n1073637","4\n9136\n398884(...TRUNCATED) | 2 | 10 | {"language":[1,1,1,1,1,1,1,1,1,1,1,1],"solution":["for _ in xrange(input()):\n\tn,c,m=map(int,raw_in(...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) | 909 | 1,000 | 2,100 | [
"graphs"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | ||||
268_A. Games | Example
Input
2 1
1 2 2
Output
1 | {"input":["7 13 5\n2 3 10 7\n3 5 10 10\n1 2 10 6\n4 5 10 9\n3 4 10 8\n","4 100 3\n3 3 2 5\n1 1 3 2\n(...TRUNCATED) | {"input":["2 2 5\n","9 9 1000000000\n","3 17 999999997\n","3 3 64\n","5 1 64\n","29 2 1000000000\n",(...TRUNCATED) | {"input":["pH\n2\n","nifzlTLTeWxaD\n0\n","ysBKLtQXvmnCrldEceqXKkaZOrvjRbwlW\n5\n","LiqWMLEVLRhW\n1\n(...TRUNCATED) | 5 | 8 | {"language":[2,1,4,3,2,2,1,3,2,1,2,2,4,4,2,2,1,4,4,2,3,3,3,2,2,2,2,2,3,1,2,4,4,4,4,2,2,3,3,4,2,2,1,4(...TRUNCATED) | {
"language": [],
"solution": []
} | 0 | 0 | 0 | [] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | ||||
p03010 diverta 2019 Programming Contest 2 - Diverta City | "This is a simple game you must have played around with during your school days, calculating FLAMES (...TRUNCATED) | {"input":["6 7\n1 2\n2 3\n3 4\n4 6\n6 5\n4 4\n3 6\n4 2 2\n1 10 2 5\n3 8 2 7\n5 1 0 2\n6 5 4 1\n3 7 6(...TRUNCATED) | {"input":["6 4 3\n0 1 2\n1 3 0\n0 4 5\n1 4 4\n1 2 2\n0 4 2\n","50 69 6\n62 91 5\n35 35 53\n85 26 1\n(...TRUNCATED) | {"input":["1 1\n1 1\n","0 3\n3 1\n","12 4\n4 4 2 1 3 1 1 3 4 1 4 4\n","10 2\n1 2 2 2 2 2 1 2 2 2\n",(...TRUNCATED) | 6 | 9 | {"language":[2,2,2,1,2,2,2,2,3,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,3,2,4,4,4,2,2,2,4,2,2,2,2,4,2,2(...TRUNCATED) | {"language":[2,4,2,4,2,0,3,2,0,2,4,2,3,2,2],"solution":["#include <bits/stdc++.h>\nusing namespace s(...TRUNCATED) | 228 | 3,000 | 2,500 | [
"binary search",
"greedy",
"sortings"
] | false | null | 256,000,000 |
End of preview. Expand in Data Studio
edition_2569_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
- 15