Dataset Viewer
Auto-converted to Parquet Duplicate
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
p01838 Optimal Tournament
"In late autumn evening n robots gathered in the cheerful company of friends. Each robot has a uniqu(...TRUNCATED)
{ "input": [ "123+456\n", "192/5\n", "945%19\n" ], "output": [ "579\n", "38\n", "14\n" ] }
{"input":["30 2\n-999999924 -499999902 500000091 -999999998 500000030 -999999934 500000086 -49999991(...TRUNCATED)
{"input":["4\n3 3\n1 2\n2 3\n3 1\n3 6\n1 2\n2 1\n2 3\n3 2\n1 3\n3 1\n7 10\n1 2\n2 3\n3 1\n1 4\n4 5\n(...TRUNCATED)
2
11
{"language":[4,4,4,4,3,3,2,2,4,3,4,2,4,4,4,2,3,2,4,3,3,2,4,3,2,1,2,2,4,4,2,3,3,2,3,2,3,3,2,3,3,4,1,4(...TRUNCATED)
{"language":[2,2,2,4,2,4,2,2,2,4,2,4,4,4,2,2,4,4,2,4,2,2,4,2,4,4,2,2,2,4,4,2,2,2,2,2,4,2,2,2,2,2,4,4(...TRUNCATED)
0
E
0
3,200
[ "" ]
false
{ "nanos": 0, "seconds": 2 }
0
161_B. Discounts
"E --Disappear Drive\n\nStory\n\nThe person in D likes basketball, but he likes shooting, so other t(...TRUNCATED)
{ "input": [ "5 4\n2 4 8 2 4\n8\n5\n14\n10\n" ], "output": [ "1\n-1\n3\n2\n" ] }
{"input":["61\n17357774\n248290406\n171408490\n20054376\n118774144\n110228788\n8827234\n85304880\n15(...TRUNCATED)
{"input":["5\n90 94\n26 25\n64 84\n18 6\n20 96\n","5\n1912 1\n5 6\n999 1\n88 2\n11 100\n","5\n90 94\(...TRUNCATED)
2
0
{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,4,2,2,2,4,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)
{"language":[4,4,4,1,3,4,4,4,2,2,2,4,2,3,4,4,4,2,1,3,4,4,2,2,2,4,2,4,4,3,2,4,2,1,3,3,1,4,3,4,2,3,2,2(...TRUNCATED)
0
750
0
[ "data structures", "string suffix structures" ]
false
{ "nanos": 0, "seconds": 2 }
1,073,741,824
p02298 Is-Convex
"You are given a multiset of points on the plane with integer coordinates. Find the maximum distance(...TRUNCATED)
{ "input": [ "eggegg\n\nSAMPLE" ], "output": [ "egg" ] }
{ "input": [], "output": [] }
{"input":["5\n2 8 1 7 9\n","4\n6 2 4 5\n","3\n3 1 3\n","200\n2 1 1 1 2 1 2 1 1 1 2 1 2 2 2 1 1 2 1 2(...TRUNCATED)
3
12
{"language":[3,1,3,2,3,3,3,1,2,2,2,1,4,4,1,4,2,2,4,2,4,2,3,2,2,4,3,3,3,3,1,3,2,1,1,3,2,3,4,4,4,4,3,4(...TRUNCATED)
{ "language": [], "solution": [] }
0
A
0
2,000
[ "data structures", "trees" ]
false
{ "nanos": 0, "seconds": 10 }
0
980_E. The Number Games
"Write a program of the Selection Sort algorithm which sorts a sequence A in ascending order. The al(...TRUNCATED)
{"input":["5 2\n3 1 5 4 2\n5 2\n5 4\n","3 3\n3 1 2\n1 2\n3 1\n3 2\n","2 1\n1 2\n1 2\n"],"output":["1(...TRUNCATED)
{ "input": [], "output": [] }
{"input":["3\n2\n1 5 10\n2 15 5\n3\n2 93 78\n1 71 59\n3 57 96\n19\n19 23 16\n5 90 13\n12 85 70\n19 6(...TRUNCATED)
5
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,1,1,1,1,1,1,1,1,1(...TRUNCATED)
{ "language": [], "solution": [] }
1,046
E
0
0
[ "data structures", "dfs and similar", "dsu", "graphs" ]
false
{ "nanos": 0, "seconds": 4 }
512,000,000
909_D. Colorful Points
"Polycarp often uses his smartphone. He has already installed n applications on it. Application with(...TRUNCATED)
{"input":["3 3 2\n1 2 3\n1 2 3\n1 2 3\n1 2\n3 3\n","4 5 4\n1 4 5 1 2\n2 2 2 2 7\n2 4 1 4 5\n3 2 1 7 (...TRUNCATED)
{ "input": [], "output": [] }
{ "input": [], "output": [] }
2
0
{"language":[3,2,4,2,2,2,2,4,3,2,2,3,2,1,4,2,4,3,4,4,2,1,4,3,2,3,4,2,3,4,2,2,4,4,2,2,4,3,3,2,4,3,4,2(...TRUNCATED)
{"language":[2,2,2,4,2,4,2,2,4,2,2,2,2,4,2,4,2,2,2,4,2,2,2,4,2,2,2,4,2,4,4,2,2,3,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)
1,030
E
1,250
0
[ "implementation" ]
false
null
268,435,456
990_E. Post Lamps
"Problem\n\nKND is a student programmer at the University of Aizu. His chest is known to be very sex(...TRUNCATED)
{"input":["2\n3 1 9\n1 2 3\n1 1\n2 1\n3 1\n1 2\n2 2\n3 2\n1 3\n2 3\n3 3\n6 4 4\n6 5 4 3 1 2\n1 1\n3 (...TRUNCATED)
{"input":["143165576\n","1919020031\n","1204252996\n","210637432\n","724264821\n","1741\n","61948959(...TRUNCATED)
{"input":["3\n((()))\n(())()\n()())","3\n((()()\n(())()\n()(()","3\n((()))\n(())))\n()())","3\n)))(((...TRUNCATED)
6
7
{ "language": [], "solution": [] }
{"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,4(...TRUNCATED)
354
K
0
0
[ "implementation" ]
false
{ "nanos": 0, "seconds": 3 }
256,000,000
1250_B. The Feast and the Bus
"Hackers! Hackers! Everywhere!\nSome days back your email ID was hacked. Some one read the personal (...TRUNCATED)
{ "input": [ "2\n2 6\n10 11" ], "output": [ "2\n1\n" ] }
{"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": [], "output": [] }
6
0
{"language":[2,3,2,3,3,2,2,1,3,2,3,4,4,3,4,4,3,2,2,2,2,2,2,4,4,4,4,4,3,2,2,4,2,4,2,2,3,2,2,4,2,4,2,4(...TRUNCATED)
{"language":[3,3,1,4,4,4,4,2,2,4,4,3,2,1,2,2,2,3,2,4,4,2,4,3,4,2,4,2,4,2,3,2,4,4,1,2,3,2,4,2,3,3,4,4(...TRUNCATED)
0
E
1,000
1,600
[ "*special", "dfs and similar", "trees" ]
false
{ "nanos": 0, "seconds": 2 }
256,000,000
630_A. Again Twenty Five!
"Polycarp has an array a consisting of n integers.\n\nHe wants to play a game with this array. The g(...TRUNCATED)
{"input":["3\n0 10 4\n10 0 4\n20 10 4\n"],"output":["(((0*((1-abs((t-0)))+abs((abs((t-0))-1))))+(5*((...TRUNCATED)
{"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": [], "output": [] }
2
0
{"language":[4,3,2,4,3,4,2,4,4,2,3,3,2,3,3,3,3,3,4,2,3,2,3,2,4,4,2,4,3,2,4,3,2,4,4,3,2,2,4,3,3,4,2,4(...TRUNCATED)
{"language":[2,4,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2(...TRUNCATED)
39
A
0
1,300
[]
false
{ "nanos": 0, "seconds": 1 }
0
battle-of-stalingrad-1
"Rupsa recently started to intern under Chef. He gave her N type of ingredients of varying quantity (...TRUNCATED)
{ "input": [ "2\n2 9 17\n1 1\n\nSAMPLE" ], "output": [ "Yes\nNo\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": [], "output": [] }
2
12
{"language":[2,2,4,2,2,2,3,3,4,3,2,3,3,3,2,2,3,4,2,2,3,4,3,3,2,3,2,3,2,3,4,3,3,2,3,3,2,4,2,2,2,4,3,2(...TRUNCATED)
{ "language": [], "solution": [] }
361
0
3,100
[ "*special" ]
false
{ "nanos": 0, "seconds": 1 }
256,000,000
p01535 Markup language has Declined
"Artem has an array of n positive integers. Artem decided to play with it. The game consists of n mo(...TRUNCATED)
{ "input": [ "4\n7 2 4 12\n7 15 10 12\n", "3\n4 4 4\n1 2 3\n" ], "output": [ "Yes\n", "No\n" ] }
{ "input": [], "output": [] }
{ "input": [], "output": [] }
2
10
{"language":[2,2,3,2,2,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,2,2,4(...TRUNCATED)
{"language":[3,2,2,3,2,2,2,2,2,2,2],"solution":["from heapq import heappush, heappop\nINF = 10 **20\(...TRUNCATED)
25
C
0
2,100
[ "implementation", "math" ]
false
{ "nanos": 0, "seconds": 1 }
268,435,456
End of preview. Expand in Data Studio

edition_1777_deepmind-code_contests-readymade

A Readymade by TheFactoryX

Original Dataset

deepmind/code_contests

Process

This dataset is a "readymade" - inspired by Marcel Duchamp's concept of taking everyday objects and recontextualizing them as art.

What we did:

  1. Selected the original dataset from Hugging Face
  2. Shuffled each column independently
  3. Destroyed all row-wise relationships
  4. 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
12