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
mind-palaces-3
"As technologies develop, manufacturers are making the process of unlocking a phone as user-friendly(...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": [], "output": [] }
{"input":["2 8","9 5","7 10","3 8","9 8","7 7","6 8","7 9","7 8","7 3","7 2","9 2","9 4","9 6","5 6"(...TRUNCATED)
2
12
{"language":[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,2,1,2,2,2,2,2,2,2,4,2,2,2,2,4,2(...TRUNCATED)
{ "language": [], "solution": [] }
0
D
1,000
0
[ "implementation", "strings" ]
false
{ "nanos": 0, "seconds": 4 }
256,000,000
p02548 AtCoder Beginner Contest 179 - A x B + C
"Programmers' kids solve this riddle in 5-10 minutes. How fast can you do it?\n\nInput\n\nThe input (...TRUNCATED)
{ "input": [ "3\n25\n46\n99" ], "output": [ "2\n1\n2\n" ] }
{"input":["3 7\n3 2 1\n","4 97\n97 1 50 10\n","5 25\n24 5 15 25 23\n","3 3\n3 2 1\n","4 18\n3 1 1 2\(...TRUNCATED)
{"input":["5\n3\n1 1\n1 1\n1 1\n3\n1 1\n1 1\n1 1\n3\n1 1\n1 1\n1 1\n3\n1 2\n1 1\n1 1\n3\n1 100\n1 1\(...TRUNCATED)
2
8
{"language":[1,1],"solution":["'''\n# Read input from stdin and provide input before running code\n\(...TRUNCATED)
{"language":[2,2,2,1,1,2,2,2,2,4,2,2,2,4,2,4,4,2,3,2,2,2,2,1,4,2,2,2,4,2,4,2,2,2,2,2,2,2,2,2,2,1,2,4(...TRUNCATED)
0
0
2,900
[ "" ]
false
null
0
209_B. Pixels
"KM country has N kinds of coins and each coin has its value a_i.\n\nThe king of the country, Kita_m(...TRUNCATED)
{ "input": [ "3 2\n3\n1 2 1\n2 3 2\n3 3 1" ], "output": [ "1" ] }
{"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":["2 2\n1\n0 1\n2 1\n","10 10\n1 8 2 4 1 8 2 6 6\n4 0 0 0 0 0 0 1 0 0\n3 4 9 10 8 1 7 -8 -10(...TRUNCATED)
2
0
{"language":[3,2,2,2,3,3,4,3,3,4,2,3,2,4,2,2,4,2,2,2,2,4,3,2,3,2,2,4,4,4,2,2,2,3,3,2,3,3,2,3,2,2,3,2(...TRUNCATED)
{"language":[2,2,2,2,2,4,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,2,2,2(...TRUNCATED)
425
2,000
1,600
[ "dp", "greedy", "strings" ]
false
{ "nanos": 0, "seconds": 3 }
0
p00163 Highway Toll
"Today on a lecture about strings Gerald learned a new definition of string equivalency. Two strings(...TRUNCATED)
{ "input": [ "TSTTSS", "SSTTST", "TSSTTTSS" ], "output": [ "4", "0", "4" ] }
{ "input": [], "output": [] }
{ "input": [], "output": [] }
2
7
{"language":[2,2,2,2,2,2,2,4,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,2,4,2,2(...TRUNCATED)
{"language":[2,2,2,4,2,3,4,4,2,2,4,4,1,1,4,4,2,4,4,2,1,2,2,2,2,2,4,2,2,2,2,4,2,3,4,3,1,4,2,2,2,2,2,3(...TRUNCATED)
0
0
1,900
[ "implementation" ]
false
{ "nanos": 0, "seconds": 4 }
256,000,000
p00822 Weather Forecast
"problem\n\nChairman K is a regular customer of the JOI pizza shop in the center of JOI city. For so(...TRUNCATED)
{"input":["5 4 10 1 6\n1 1 5\n1 5 5\n1 3 2\n1 5 2\n2 1\n2 2\n","5 2 2 1 8\n1 1 2\n1 5 3\n1 2 1\n2 2\(...TRUNCATED)
{"input":["100\n0 0 57 121 57 0 19 251 19 301 19 160 57 578 664 57 19 50 0 621 91 5 263 34 5 96 713 (...TRUNCATED)
{ "input": [], "output": [] }
5
8
{"language":[2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,4,2,2,4,2,4,2,4,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2(...TRUNCATED)
{ "language": [], "solution": [] }
1,391
C
0
1,300
[ "" ]
false
{ "nanos": 0, "seconds": 2 }
256,000,000
925_E. May Holidays
"You are given a positive integer m and two integer sequence: a=[a_1, a_2, …, a_n] and b=[b_1, b_2(...TRUNCATED)
{ "input": [ "3\n6 4 1\n", "4\n20 6 3 4\n" ], "output": [ "0\n", "2\n" ] }
{ "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)
2
7
{"language":[2,3,3,2,3,1,3,2,4,2,4,3,3,2,3,4,2,3,3,3,3,3,2,3,3,3,3,2,3,3,4,4,4,3,3,3,1,3,3,2,3,4,3,3(...TRUNCATED)
{"language":[2,2,2,3,0,2,2,3,2,2,3,2,3,2,3,3,2,3,2,0,3,2,2,3,3,0,0,2,3,2,2,2,2,2,2,2,2,2,3,3,0,2,2,3(...TRUNCATED)
105
D
0
0
[]
false
{ "nanos": 0, "seconds": 2 }
256,000,000
571_E. Geometric Progressions
"To improve the boomerang throwing skills of the animals, Zookeeper has set up an n × n grid with s(...TRUNCATED)
{ "input": [ "2 5", "9 9", "5 10" ], "output": [ "10", "81", "-1" ] }
{"input":["919536000 993098880\n","691200 583200\n","5 1000000000\n","100 10\n","537814642 537814642(...TRUNCATED)
{"input":["3 1\n2 100 1","12 5\n43 94 27 3 69 99 56 25 15 15 46 8","3 1000\n1 101 1","6 24\n25 171 7(...TRUNCATED)
2
7
{"language":[2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2(...TRUNCATED)
{"language":[3,4,3,4,4,2,4,4,3,4,4,3,2,3,4,2,2,2,2,3,4,2,4,4,1,2,4,2,2,4,4,2,3,2,3,1,2,2,4,4,3,3,3,4(...TRUNCATED)
0
B
2,500
2,400
[ "greedy", "implementation" ]
false
{ "nanos": 0, "seconds": 1 }
0
bogosort
"You are given an array a_1, a_2, …, a_n of integers. This array is non-increasing.\n\nLet's consi(...TRUNCATED)
{"input":["abbbbbbaaa baababaaab 10\n1 2 1 0 0\n2 7 8 4 7\n2 3 9 2 8\n3 4 6 1 1\n0 8 5 2 4\n2 8 10 4(...TRUNCATED)
{"input":["541\n54 98 68 63 83 94 55 35 12 63 30 17 97 62 96 26 63 76 91 19 52 42 55 95 8 97 6 18 96(...TRUNCATED)
{"input":["8 15\n","6 1\n","8 9\n","500 17172\n","5 2\n","5 9\n","2 7\n","3 15\n","61 249001\n","8 5(...TRUNCATED)
2
9
{"language":[1,1,2,2,2,2,2,2,2,3,2,4,4,2,2,2,2,4,2,2,2,2,2,2,4,2,4,1,4,2,2,2,2,2,4,2,4,4,4,2,2,2,2,2(...TRUNCATED)
{"language":[2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,0,2,2,2,2,2,3,2,2,4,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)
604
C
1,750
0
[]
false
null
256,000,000
p00365 Age Difference
"There are three arrays a, b and c. Each of them consists of n integers. SmallY wants to find three (...TRUNCATED)
{ "input": [ "ppqb", "pdbq" ], "output": [ "No", "Yes" ] }
{"input":["3\n7089544 9134148 -5332724\n368810 1638695 7889905\n-3866235 -4257263 5802154\n","16\n-3(...TRUNCATED)
{"input":["4\n1 4\n3 2\n3 4\n","21\n7 15\n13 1\n14 3\n4 10\n2 3\n16 18\n17 20\n16 20\n8 4\n3 12\n2 1(...TRUNCATED)
5
0
{"language":[3,4,3,3,2,3,3,3,3,2,2,3,4,3,3,2,3,3,3,3,3,3,1,3,2,3,3,4,3,3,3,1,4,3,3,3,3,3,3,2,3,4,3,1(...TRUNCATED)
{"language":[2,2,2,2,2,4,2,2,2,2,2,4,2,2,2,2,2,2,2,4,2,2,4,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2,2,4,4,2,2(...TRUNCATED)
0
0
2,500
[]
false
{ "nanos": 0, "seconds": 2 }
256,000,000
list-sort
"You are given an integer x represented as a product of n its prime divisors p_1 ⋅ p_2, ⋅ … (...TRUNCATED)
{ "input": [ "CANDY", "SOLVING" ], "output": [ "AND", "LVI" ] }
{ "input": [], "output": [] }
{"input":["2\n3 3 2\n8 3 2\n3 0\n3 7\n8 0\n5 7","2\n3 3 2\n8 3 2\n1 3\n3 7\n8 0\n8 7","1\n10 10 17\n(...TRUNCATED)
6
0
{"language":[4,2,4,2,2,2,3,2,1,2,2,2,4,2,2,2,4,2,2,2,2,2,4,2,2,2,3,2,4,4,2,4,2,2,2,2,4,4,4,4,2,2,2,2(...TRUNCATED)
{"language":[2,4,2,2,4,2,2,2,2,2,4,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,4,2,2,2,4,2,2(...TRUNCATED)
0
1,500
0
[]
false
null
0
End of preview. Expand in Data Studio

edition_1046_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
5