Hugging Face's logo

Datasets:
TheFactoryX
/
edition_3048_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
1136_D. Nastya Is Buying Lunch
"Diverta City is a new city consisting of N towns numbered 1, 2, ..., N.\n\nThe mayor Ringo is plann(...TRUNCATED)
{"input":["2 1 0\n","2 2 4\n0 1 2 1\n0 1 2 1\n1 2 1 0\n1 1 1 2\n"],"output":["FIRST\n1 0 1 1\n","SEC(...TRUNCATED)
{ "input": [], "output": [] }
{"input":["3\nDSAWWAW\nD\nAW\n","3\nWSAWDAW\nD\nAW\n","3\nDAAWWSW\nD\nAW\n","3\nWAWWASD\nD\nWA\n","3(...TRUNCATED)
2
2
{"language":[2,2,2,2,2,2,2,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,3,2,2,4,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,3,2,2,2,2,2,2,2(...TRUNCATED)
0
D
0
0
[ "greedy" ]
false
{ "nanos": 0, "seconds": 1 }
256,000,000
roys-life-cycle
"You are playing a strange game with Li Chen. You have a tree with n nodes drawn on a piece of paper(...TRUNCATED)
{ "input": [ "6 1 2 3 4 5", "6 200 2 3 4 5" ], "output": [ "1", "1" ] }
{"input":["qH\n2\n","nifzlTLaeWxTD\n0\n","WlwbRjvrOZakKXqecEdlrCnmvXQtLKBsy\n5\n","LiqWMLEULRhW\n1\n(...TRUNCATED)
{"input":["2\n\nSBMPLE","2\n\nSBPMLE","2\n\nELMPBS","2\n\nELMPAS","2\n\nSAPMLE","2\n\nSAQMLE","2\n\n(...TRUNCATED)
5
10
{"language":[1],"solution":["T = int(raw_input())\nfor ti in xrange(T):\n\ta,b,c = map(int,raw_input(...TRUNCATED)
{"language":[2,3,2,2,2,1,1,3,1,3,2,4,3,4,4,2,3,2,3,2,3,3,1,2,3,2,2,2,4,4,3,4,1,4,3,4,3,3,3,4,2,3,3,2(...TRUNCATED)
633
2,500
2,400
[]
false
null
256,000,000
702_E. Analysis of Pathes in Functional Graph
"Tree is a connected acyclic graph. Suppose you are given a tree consisting of n vertices. The verte(...TRUNCATED)
{ "input": [ "3\nkek\npreceq\ncheburek\n", "4\nmail\nai\nlru\ncf\n" ], "output": [ "NO\n", "cfmailru\n" ] }
{"input":["50 1\n50 8 46 9 12 38 41 18 49 10 23 15 16 3 13 17 48 8 31 32 6 31 31 49 9 40 9 21 23 41 (...TRUNCATED)
{"input":["qbdp","dbqp","bdqp","bqpp","pdqb","dqbp","pqbd","pqdb","bqqp","pdpb","pbqd","dqpb","bqpq"(...TRUNCATED)
2
0
{"language":[2,2,2,4,2,4,2,4,2,2,2,2,4,2,2,2,2,2,4,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(...TRUNCATED)
{"language":[4,4,2,1,2,3,2,4,3,4,3,3,4,2,3,3,3,3,2,4,3,3,3,4,4,2,3,2,3,4,2,2,2,4,2,3,2,3,4,3,2,3,3,3(...TRUNCATED)
1,149
E
0
0
[ "" ]
false
{ "nanos": 0, "seconds": 3 }
256,000,000
the-strongest-string-1-1
"Ringo Mart, a convenience store, sells apple juice.\n\nOn the opening day of Ringo Mart, there were(...TRUNCATED)
{ "input": [ "4\n2 10\n0 20\n1 5\n1 3\n", "3\n0 1\n0 10\n0 100\n" ], "output": [ "8", "111" ] }
{"input":["20\n76 86 70 7 16 24 10 62 26 29 40 65 55 49 34 55 92 47 43 100\n","100\n6591 1074 3466 3(...TRUNCATED)
{"input":["2 2 1\n2 3 1\n3 2 3\n1 3 5","4 2 1\n2 3 1\n3 2 3\n1 3 5","2 2 1\n2 3 1\n3 2 5\n1 3 5","2 (...TRUNCATED)
2
0
{ "language": [], "solution": [] }
{ "language": [], "solution": [] }
1,431
B
1,500
2,500
[ "" ]
false
{ "nanos": 0, "seconds": 2 }
134,217,728
1281_B. Azamon Web Services
"Let us consider sets of positive integers less than or equal to n. Note that all elements of a set (...TRUNCATED)
{"input":["8 4 20\n5 6 4 3 7 5 4 1\n10 12 5 12 14 8 5 8\n","7 2 11\n3 4 3 5 1 4 6\n7 7 3 6 5 3 9\n",(...TRUNCATED)
{"input":["99\n3\n5\n7\n9\n11\n13\n15\n17\n19\n21\n23\n25\n27\n29\n31\n33\n35\n37\n39\n41\n43\n45\n4(...TRUNCATED)
{"input":["6\n773209925 62005863 473635171 329666981 510631133 207643327\n","1\n2\n","7\n481003311 5(...TRUNCATED)
2
7
{"language":[1,3,2,2,2,3,4,2,4,3,3,3,2,3,1,3,3,3,3,3,3,2,3,4,3,3,4,3,3,3,3,3,4,3,4,2,3,3,2,3,4,3,3,3(...TRUNCATED)
{"language":[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,4,2,2,2,2,2,0,2,2,2,0,0,2,4,2,2,3,2(...TRUNCATED)
0
E
0
1,500
[ "brute force", "implementation" ]
false
{ "nanos": 0, "seconds": 1 }
256,000,000
1413_F. Roads and Ramen
"Find the number of ways to divide an array a of n integers into any number of disjoint non-empty se(...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": [], "output": [] }
{"input":["byeybe","zyxwvutsrqponmlkjihgfedcba","aabwyyzz","axcabcbabcx","zyxwvutsrqponmlkjihgfedbba(...TRUNCATED)
3
9
{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,4,4,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)
{"language":[2,2,4,2,2,2,2,4,3,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,2,2,2,2,3,2,2,2,2,2(...TRUNCATED)
339
1,250
1,600
[ "brute force", "implementation" ]
false
{ "nanos": 0, "seconds": 2 }
256,000,000
1420_D. Rescue Nibel!
"Problem description.\n The problem statement is simple , you are given an array and you have to p(...TRUNCATED)
{ "input": [ "2\n5\n2 3 5 1 2\n3\n1 2 3" ], "output": [ "3\n3" ] }
{"input":["100 10000\n337491026 878382762 942177429 998998997 292784016 407647544 813626083 20338593(...TRUNCATED)
{"input":["5 10\n1 2\n1 3\n2 2 4\n1 5\n0\n1\n","6 6\n1 2\n2 3 6\n1 4\n1 6\n1 1\n0\n1\n","6 6\n2 4 3\(...TRUNCATED)
2
0
{"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)
{ "language": [], "solution": [] }
0
0
3,100
[ "dfs and similar", "dp", "games", "graphs" ]
true
{ "nanos": 0, "seconds": 2 }
256,000,000
1060_A. Phone Numbers
"The HR manager was disappointed again. The last applicant failed the interview the same way as 24 p(...TRUNCATED)
{"input":["3\n4 2\nabca\n1 3\n10 5\ncodeforces\n2 8 3 2 9\n26 10\nqwertyuioplkjhgfdsazxcvbnm\n20 10 (...TRUNCATED)
{ "input": [], "output": [] }
{"input":["20 20\n1 9\n11 9\n3 5\n15 13\n1 20\n11 18\n10 6\n10 8\n10 19\n12 16\n10 3\n9 18\n8 7\n15 (...TRUNCATED)
2
0
{ "language": [], "solution": [] }
{"language":[2,2,2,2,2,2,2,2,4,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,4,2,2,2(...TRUNCATED)
494
0
0
[ "combinatorics", "dp", "math", "probabilities" ]
false
{ "nanos": 0, "seconds": 2 }
256,000,000
1500_B. Two chandeliers
"Friends Alex and Bob live in Bertown. In this town there are n crossroads, some of them are connect(...TRUNCATED)
{"input":["5\n0 1\n1 2\n2 0\n3 0\n4 1\n","5\n3 4\n2 3\n2 4\n0 4\n1 2\n","3\n0 1\n1 2\n0 2\n"],"outpu(...TRUNCATED)
{"input":["20\n9 4 8\n10 6 7\n4 6 0\n7 7 6\n3 3 10\n4 2 1\n4 4 0\n2 0 0\n8 8 7\n3 1 7\n3 10 7\n1 7 3(...TRUNCATED)
{"input":["21\n11 19 4 19 6 0 13 7 6 2 5 3 16 16 1 9 15 21 9 21 2\n","100\n57 85 27 81 41 27 73 10 7(...TRUNCATED)
2
10
{"language":[2,2,2,2,2,2,4,4,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,2,2,4,2(...TRUNCATED)
{"language":[2,3,3,0,2,2,2,4,2,2,2,2,2,2,0,3,3,2,2,3,4,3,2,3,3,2,2,2,3,2,2,2,2,4,0,2,3,0,2,3,2,4,2,2(...TRUNCATED)
0
A
2,750
0
[ "*special" ]
false
{ "nanos": 0, "seconds": 1 }
512,000,000
p01738 Gravity Point
"In Walrusland public transport tickets are characterized by two integers: by the number of the seri(...TRUNCATED)
{"input":["3 4 3 10\n3\n3 1 4\n4 5 9\n3 10 10\n","1 1 2 10\n2\n1 1 3\n2 6 10\n","5 7 6 11\n3\n5 3 8\(...TRUNCATED)
{"input":["3\n1 2 6\n","10\n7 7 7 7 7 7 7 7 7 7\n","76\n13 13 5 6 20 20 6 1 18 18 13 15 20 3 9 11 3 (...TRUNCATED)
{"input":["3\n12 2\n200\n50\n300\n110","3\n17 2\n200\n73\n300\n110","3\n12 2\n200\n50\n599\n100","3\(...TRUNCATED)
2
9
{"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],"solution":["t = int(raw_input())\nf(...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)
0
C
0
0
[ "dp", "implementation", "strings" ]
false
{ "nanos": 0, "seconds": 2 }
512,000,000
End of preview. Expand in Data Studio

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