Hugging Face's logo

Datasets:
TheFactoryX
/
edition_2655_deepmind-code_contests-readymade

Tags:
readymades
art
shuffled
duchamp
License:
Dataset card Files
xet
Community
Dataset Viewer
Auto-converted to Parquet Duplicate
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
153_E. Euclidean Distance
"The court wizard Zigzag wants to become a famous mathematician. For that, he needs his own theorem,(...TRUNCATED)
{ "input": [ "2\n1\n3\n\nSAMPLE" ], "output": [ "1\n26\n" ] }
{ "input": [], "output": [] }
{"input":["4\n39 18\n183 11\n551 27\n85 16","8\n4 65\n5 12\n7 21\n9 38\n12 24\n14 10\n65 75\n31 26",(...TRUNCATED)
6
10
{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2],"solution":["#include<cmath>\n#include<queue>\(...TRUNCATED)
{"language":[2,2,4,2,3,4,4,3,4,1,3,3,2,3,2,2,1,3,3,3,2,3,4,3,4,2,2,3,4,3,2,4,4,3,4,4,4,3,4,2,3,4,3,2(...TRUNCATED)
0
B
1,000
0
[]
false
{ "nanos": 0, "seconds": 2 }
512,000,000
p02445 Swap
"You are given a simple arithmetic expression of the form a?b, where a and b are integer constants, (...TRUNCATED)
{ "input": [ "3\n1 2 4\n", "3\n5 3 1\n" ], "output": [ "3", "1" ] }
{"input":["3\n9 5 8\n8 9 10\n9 5 2\n","50\n48 45 42\n32 45 8\n15 41 47\n32 29 38\n7 16 48\n19 9 21\n(...TRUNCATED)
{"input":["4 6 0\n0 1 3\n0 2 2\n2 0 1\n2 3 2\n3 0 1\n3 1 5","6 10 0\n0 2 7\n0 1 1\n0 3 5\n1 4 9\n2 1(...TRUNCATED)
6
0
{"language":[1],"solution":["testcase = raw_input();\ntc = int(testcase)\n\nwhile (tc > 0):\n\t\n\t(...TRUNCATED)
{"language":[2,0,3,3,2,2,3,2,3,2,3,2,3,3,2,3,2,0,2,4,2,3,2,3,3,0,2,2,2,2,2,2,0,0,2,3,0,2,2,2,2,3,2,2(...TRUNCATED)
0
E
1,000
2,400
[]
false
{ "nanos": 0, "seconds": 1 }
256,000,000
1421_B. Putting Bricks in the Wall
"Chef has a an array A consisting of N elements. He wants to add some elements into the array as per(...TRUNCATED)
{ "input": [ "4 2\n1 2\n2 3\n", "3 3\n1 2\n2 3\n1 3\n" ], "output": [ "3\n1 3 4 \n1\n2 ", "-1" ] }
{"input":["10\n5 1 33242121\n5 7 535463871\n9 1 202863787\n5 4 874413088\n6 1 623012241\n6 8 7866591(...TRUNCATED)
{"input":["10\ntypedef errtype** ucywcaykzh\ntypeof &ucywcaykzh*********\ntypedef &&&&&&void********(...TRUNCATED)
2
9
{"language":[2,3,2,2,4,3,3,3,3,4,4,4,3,4,2,3,3,2,3,3,2,4,3,3,3,2,2,1,3,3,3,3,4,3,1,4,3,3,3,2,3,2,3,3(...TRUNCATED)
{"language":[4,4,3,2,4,1,3,2,2,3,4,4,2,1,1,2,3,4,3,2,3,2,2,2,3,3,3,3,4,4,3,2,2,4,4,2,4,3,3,2,1,2,4,2(...TRUNCATED)
0
B
0
1,700
[ "" ]
false
null
256,000,000
p03010 diverta 2019 Programming Contest 2 - Diverta City
"As usual, Sereja has array a, its elements are integers: a[1], a[2], ..., a[n]. Let's introduce not(...TRUNCATED)
{"input":["+Mike\nMike:hello\n+Kate\n+Dmitry\n-Dmitry\nKate:hi\n-Kate\n","+Mike\n-Mike\n+Mike\nMike:(...TRUNCATED)
{ "input": [], "output": [] }
{"input":["4\nRBRR","4\nBBRR","4\nRRCR","4\nRRAR","4\nRARR","4\nBQBR","4\nRCRR","4\nBPBR","4\nRRRC",(...TRUNCATED)
6
8
{"language":[4,3,2,4,3,2,3,2,2,4,2,4,3,3,2,3,2,2,2,3,3,3,3,3,3,3,3,2,4,3,3,4,3,3,3,4,3,3,3,4,3,3,3,3(...TRUNCATED)
{"language":[2,2,2,2,0,2,0,2,2,2,2,2,0,2,0,1,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,0,2,2(...TRUNCATED)
909
D
1,000
2,000
[ "implementation", "sortings", "strings" ]
false
{ "nanos": 0, "seconds": 1 }
0
mind-palaces-3
"Jack is the most intelligent student in the class.To boost his intelligence,his class teacher gave (...TRUNCATED)
{"input":["8\n3 1 4 1 5 9 2 6\n","5\n1 1 1 1 1\n","13\n2 7 1 8 2 8 1 8 2 8 4 5 9\n"],"output":["\n2\(...TRUNCATED)
{"input":["50 100\n1 71 96\n2 34 52\n2 16 95\n1 54 55\n1 65 85\n1 76 92\n2 19 91\n1 26 43\n2 83 95\n(...TRUNCATED)
{"input":["777 20\n","110 4\n","12 4\n","500 2\n","11 4\n","1 8\n","26 11\n","91 4\n","20 4\n","123 (...TRUNCATED)
2
9
{"language":[3,3,3,3,3,3,3,3,4,3,3,3,3,3,3,2,3,4,3,3,3,3,3,3,3,3,3,2,3,3,3,3,2,3,3,3,3,3,3,3,2,3,4,3(...TRUNCATED)
{"language":[4,4,4,3,2,4,4,2,2,4,2,4,2,4,4,3,4,2,2,4,2,2,4,1,2,4,2,4,4,2,2,2,2,2,3,4,3,4,2,3,2,3,3,4(...TRUNCATED)
143
0
3,000
[ "implementation" ]
false
null
256,000,000
1208_D. Restore Permutation
"There are n psychos standing in a line. Each psycho is assigned a unique integer from 1 to n. At ea(...TRUNCATED)
{ "input": [ "3\n4251\n52310\n00006\n\nSAMPLE" ], "output": [ "12\n56\nunlucky" ] }
{ "input": [], "output": [] }
{"input":["5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\(...TRUNCATED)
3
8
{"language":[2,2,2,2,2,2,2,2,2,3,3,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,4,2,2,2,2,2,4,2,3(...TRUNCATED)
{ "language": [], "solution": [] }
1,354
H
1,500
0
[ "" ]
false
{ "nanos": 0, "seconds": 2 }
134,217,728
425_D. Sereja and Squares
"Time Limit: 8 sec / Memory Limit: 64 MB\n\n\n\n\n\nExample\n\nInput\n\n5 3 2\naaaaa\naaa\naab\n\n\n(...TRUNCATED)
{ "input": [ "1\n1" ], "output": [ "4" ] }
{"input":["728961319347 33282698448966372 52437 42819\n","461788563846 36692905412962338 93797 64701(...TRUNCATED)
{"input":["3 4\n10 10\n-10 -10\n3 3\n1 2\n2 3\n3 5\n3 10","2 2\n2 0\n0 0\n-1 -1\n1 0","3 4\n10 10\n-(...TRUNCATED)
2
11
{"language":[2,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,4,4,4,2,2,4,2,2,2,2,2,2,2,2,2,2,4(...TRUNCATED)
{"language":[3,1,2,2,1,2,4,3,3,2,2,4,2,4,4,4,2,2,2,1,2,4,2,1,1,4,3,3,3,2,4,2,2,2,2,3,2,4,4,2,2,4,2,2(...TRUNCATED)
0
E
0
2,400
[ "" ]
false
{ "nanos": 0, "seconds": 6 }
64,000,000
1397_C. Multiples of Length
"Two players play the following game. Initially, the players have a knife and a rectangular sheet of(...TRUNCATED)
{"input":["2 7 10\n3 12 10\n5 16 8\n","4 8 10\n0 12 3\n1 1 0\n0 3 11\n1 6 9\n","3 10 10\n0 12 10\n1 (...TRUNCATED)
{"input":["9\n3 9\n3 4\n7 2\n6 9\n5 3\n6 2\n8 3\n1 9\n10\n8 4 8 2 5\n9 2 7 4 4\n8 5 7 3 3\n1 2 3 8 4(...TRUNCATED)
{"input":["228\n1 3 1 7 1 3 1 15 1 3 1 7 1 3 1 31 1 3 1 7 1 3 1 15 1 3 1 7 1 3 1 63 1 3 1 7 1 3 1 15(...TRUNCATED)
5
8
{"language":[3,3,1,4,2,4,2,4,3,3,4,3,2,2,2,3,1,3,2,4,1,4,3,3,3,1,3,2,3,3,2,2,4,4,3,4,2,2,3,3,3,3,3,2(...TRUNCATED)
{"language":[4,0,0,2,2,2,3,3,2,3,2,3,2,3,1,3,2,2,2,2,4,2,2,3,0,2,3,3,2,2,3,3,2,2,4,3,2,2,2,2,2,3,3,2(...TRUNCATED)
1,219
E
0
2,000
[ "" ]
false
null
256,000,000
79_D. Password
"There are n lamps on a line, numbered from 1 to n. Each one has an initial state off (0) or on (1).(...TRUNCATED)
{"input":["7 6 6\n3 2\n1 7\n5 7\n3 7\n6 4\n8 9\n8 5\n","5 2 2\n1 1\n4 1\n2 3\n3 2\n3 4\n"],"output":(...TRUNCATED)
{ "input": [], "output": [] }
{ "input": [], "output": [] }
5
7
{"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,2,2,2,2,2,2,2,2,2,2,2,2,2,4,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,2,2,2,2(...TRUNCATED)
0
0
2,200
[ "" ]
false
{ "nanos": 0, "seconds": 3 }
256,000,000
89_C. Chip Play
"Berland Government decided to improve relations with neighboring countries. First of all, it was de(...TRUNCATED)
{"input":["5 4\n#.##\n.##.\n#...\n..##\n...#","13 27\n......#.........#.......#..\n...#.....###..\n.(...TRUNCATED)
{ "input": [], "output": [] }
{"input":["46\n63 1\n63 63\n123 1\n123 123\n63 2\n63 62\n123 2\n123 122\n63 3\n63 61\n123 3\n123 121(...TRUNCATED)
2
11
{"language":[2,4,4,2,2,2,4,2,3,2,2,2,4,3,2,4,3,1,1,2,3,4,2,2,4,2,3,3,1,4,4,3,1,3,1,2,2,2,1,4,4,4,3,3(...TRUNCATED)
{"language":[2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,4,2,2,2,1,2,2,4,2,2,2,2,4,4,4,2,2,2,3,2,4,2(...TRUNCATED)
0
0
0
[ "data structures", "trees" ]
false
null
256,000,000
End of preview. Expand in Data Studio

edition_2655_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
-
Size of downloaded dataset files:
287 MB
Size of the auto-converted Parquet files:
287 MB
Number of rows:
500