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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
433_A. Kitahara Haruki's Gift | "Find the number of ways to divide an array a of n integers into any number of disjoint non-empty se(...TRUNCATED) | {"input":["10 9 3 1\n10 9 11\n9 2 37\n2 4 4\n4 1 8\n1 5 2\n5 7 3\n7 3 2\n3 8 4\n8 6 13\n2 3\n","9 11(...TRUNCATED) | {"input":["? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ?(...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":[2,2,2,2,2,2,2,2,3,2,2,2,4,3,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,2,2,2,2(...TRUNCATED) | {"language":[3,1,2,2,2,2,2,1,2,1,2,2,4,2,4,1,2,2,4,4,2,2,1,4,2,4,4,3,2,4,2,4,3,4,2,2,4,2,3,4,2,4,2,2(...TRUNCATED) | 1,334 | E | 0 | 0 | [
"binary search",
"math",
"sortings"
] | false | "機械に辺・対角線の長さのデータを入力し、プラスティック板の型抜きを(...TRUNCATED) | {
"nanos": 0,
"seconds": 3
} | 256,000,000 | ||
101_C. Vectors | "The rebels have saved enough gold to launch a full-scale attack. Now the situation is flipped, the (...TRUNCATED) | {
"input": [
"3 5\n",
"1 1\n",
"4 4\n"
],
"output": [
"451\n",
"0\n",
"485\n"
]
} | {
"input": [],
"output": []
} | {"input":["aa\n2\nbb\nbc\n","th\n1\nht\n","bb\n1\nab\n","bn\n100\ndf\nyb\nze\nml\nyr\nof\nnw\nfm\ndw(...TRUNCATED) | 2 | 8 | {"language":[1,1,1,1,1,1,1,1,1,1,1,1,1,1],"solution":["t = int(raw_input())\nfor i in range(t):\n\ta(...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) | 331 | 0 | 2,300 | [
"*special",
"binary search"
] | false | {
"nanos": 0,
"seconds": 2
} | 0 | ||||
925_E. May Holidays | "Vasilisa the Wise from the Kingdom of Far Far Away got a magic box with a secret as a present from (...TRUNCATED) | {"input":["20 40 60 80 100\n0 1 2 3 4\n1 0\n","119 119 119 119 119\n0 0 0 0 0\n10 0\n"],"output":["4(...TRUNCATED) | {"input":["5\n42665793 142698407 856080769 176604645 248258165\n10\n1 5 141156007\n2 5 5 3\n2 4 4 2\(...TRUNCATED) | {"input":["100\n591 417 888 251 792 847 31 3 182 461 102 348 555 956 771 901 712 878 580 631 342 333(...TRUNCATED) | 2 | 0 | {"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,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | {"language":[3,2,2,3,2,2,2,2,2,2,2],"solution":["from heapq import heappush, heappop\nINF = 10 **20\(...TRUNCATED) | 0 | A | 0 | 0 | [
"data structures",
"graphs"
] | false | {
"nanos": 0,
"seconds": 2
} | 0 | |||
371_B. Fox Dividing Cheese | "In late autumn evening n robots gathered in the cheerful company of friends. Each robot has a uniqu(...TRUNCATED) | {"input":["6 6\n1 2 2 1 2\n2 3 1 3\n3 4 2 4 5\n4 5 0\n5 3 1 3\n6 1 1 6\n","6 6\n1 2 2 1 2\n2 3 1 3\n(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["5\n5 4 3 1 2\n","3\n3 2 1\n","3\n2 3 1\n","10\n5 1 6 2 8 4 3 10 9 7\n","3\n3 1 2\n","3\n2(...TRUNCATED) | 3 | 11 | {"language":[2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,4,4,4,2,2,4,2,4,2],"solut(...TRUNCATED) | {"language":[2,2,2,2,2,2,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2(...TRUNCATED) | 893 | 500 | 0 | [] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | ||||
p00819 Unreliable Message | "Yash is finally tired of computing the length of the longest Fibonacci-ish sequence. He now plays a(...TRUNCATED) | {"input":["2 0\n1 1 1 1\n","2 2\n0 1 2 3\n2 5\n0 4\n","1 0\n2 3\n"],"output":["1.0000000000\n","1.50(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["SSTTTSST","STTTSS","SSSTTT","TTTSSS","TTTTSSSS","TSTSST","SSTTTS","TSSTST","STTSST","TSSS(...TRUNCATED) | 6 | 11 | {"language":[1,1,1,1,1,1,1,1,1,1,1],"solution":["def gcd(x,y):\n if y==0: return x\n else: ret(...TRUNCATED) | {
"language": [],
"solution": []
} | 1,101 | 0 | 0 | [
""
] | false | {
"nanos": 0,
"seconds": 2
} | 134,217,728 | ||||
470_F. Pairwise Sums | "You are given a rebus of form ? + ? - ? + ? = n, consisting of only question marks, separated by ar(...TRUNCATED) | {
"input": [
"5 10\n-1 -1 -1 -1 -1\n",
"10 2\n10 -1 2 2 2 2 2 2 -1 10\n"
],
"output": [
"-1\n",
"32\n"
]
} | {"input":["2 1\n1 1\n","2 3\n3 1\n","100 5\n5 5 2 4 5 4 4 4 4 2 5 3 4 2 4 4 1 1 5 3 2 2 1 3 3 2 5 3 (...TRUNCATED) | {
"input": [],
"output": []
} | 3 | 7 | {"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":[2,4,2,2,2,2,2,2,2,2,2,2,0,2,2,2,2,2,2,4,2,2,2,0,2,2,0,0,0,0,2,0,2,2,2,2,2,2,4,0,1,4,4,4(...TRUNCATED) | 0 | B | 1,000 | 3,400 | [] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
appu-and-sugarcane-farm | "I have n tickets for a train with a rabbit. Each ticket is numbered from 0 to n − 1, and you can (...TRUNCATED) | {"input":["7 3\nabacaba\n1 1 1\n1 0 0\n1 0 0\n","7 3\nabacaba\n0 1 1\n1 0 0\n1 0 0\n","7 4\nbacadab\(...TRUNCATED) | {"input":["26\n0.98 0.64 0.06 0.90 0.01 0.73 0.21 0.98 0.65 1.00 0.87 0.85 0.01 0.06 0.65 0.00 0.65 (...TRUNCATED) | {"input":["1000 1001\n82 636 713 516\n","1000 1998\n316 681 19 233\n","4 8\n1 3 4 2\n","5 6\n4 3 2 1(...TRUNCATED) | 2 | 9 | {"language":[1,3,2,2,2,4,1,4,4,2,4,3,4,4,4,4,2,2,1,4,2,2,4,2,2,4,1,4,4,2,2,2,2,2,4,4,3,2,4,4,4,3,2,2(...TRUNCATED) | {"language":[4,2,2,3,2,4,4,2,2,2,2,4,4,2,2,2,4,2,2,3,3,2,3,2,4,4,2,2,3,4,2,2,3,4,2,2,2,2,1,4,2,4,2,4(...TRUNCATED) | 67 | G | 500 | 1,100 | [] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | |||
1285_C. Fadi and LCM | "Monocarp and Polycarp are learning new programming techniques. Now they decided to try pair program(...TRUNCATED) | {
"input": [
"1\n2 3 Chandu\n\nSAMPLE"
],
"output": [
"Daspal\n"
]
} | {
"input": [],
"output": []
} | {"input":["10\n-405 -230 252 -393 -271 -259 97 163 81 -129\n","10\n1 10 2 9 6 8 4 7 5 6\n","4\n1 2 5(...TRUNCATED) | 3 | 0 | {"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":[0,2,2,2,2,2,2,2,2,2,2,2],"solution":["#include <bits/stdc++.h>\ntypedef struct {\n dou(...TRUNCATED) | 478 | E | 0 | 0 | [
"implementation"
] | false | {
"nanos": 0,
"seconds": 2
} | 536,870,912 | |||
p01538 Kakezan | "You are given an infinite checkered field. You should get from a square (x1; y1) to a square (x2; y(...TRUNCATED) | {
"input": [
"3\n2 3 3\n",
"4\n0 1 2 3\n",
"6\n5 2 0 5 2 1\n"
],
"output": [
"0\n",
"10\n",
"53\n"
]
} | {"input":["9 13\n6 14 19 5 -5 6 -10 20 8\n","8 9\n6 -1 5 -5 -8 -7 -8 -7\n","10 7\n-9 3 -4 -22 4 -17 (...TRUNCATED) | {
"input": [],
"output": []
} | 2 | 0 | {"language":[1,2,3,2,2,2,4,4,3,4,4,3,2,2,2,2,2,3,2,2,2,1,2,2,2,4,4,1,2,2,2,2,2,4,2,2,2,4,2,4,2,2,2,1(...TRUNCATED) | {"language":[4,3,2,2,2,2,4,1,2,2,2,3,1,3,3,1,2,3,2,4,4,2,3,3,4,1,4,3,3,2,4,4,2,3,2,2,2,4,2,3,2,3,2,2(...TRUNCATED) | 0 | D | 0 | 2,000 | [
"constructive algorithms",
"math"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
p01179 Cousin's Aunt | "We have a sandglass consisting of two bulbs, bulb A and bulb B. These bulbs contain some amount of (...TRUNCATED) | {
"input": [
"1\n9\n10\n1\n\nSAMPLE"
],
"output": [
"10"
]
} | {"input":["15\nMIRZOYANOVECLOX\n","23\nAABBBAAACCCCCAAADDDDDDD\n","2\nQA\n","11\nGGRRAATTZZZ\n","6\n(...TRUNCATED) | {"input":["4\nlu ru ld rd\n4\nlu ld lu ru\n0\nlu\n10\nru lu ld rd ru rd ru lu rd ld\n0","4\nlu ru ld(...TRUNCATED) | 2 | 0 | {"language":[3,2,2,2,4,2,2,2,3,3,2,2,4,2,2,2,2,4,2,2,2,2,2,4,2,4,4,2,2,2,2,4,2,4,3,2,2,2,4,2,4,2,2,2(...TRUNCATED) | {"language":[2,2,2,3,2,4,2,2,3,1,3,2,2,2,2,3,4,2,2,2,2,2,3,2,2,4,2,3,2,3,3,4,2,2,2,3,2,3,2,3,2,2,2,3(...TRUNCATED) | 586 | 500 | 2,000 | [
"brute force",
"sortings"
] | false | {
"nanos": 0,
"seconds": 5
} | 256,000,000 |
End of preview. Expand
in Data Studio
edition_3085_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
- 2