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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
p03153 KEYENCE Programming Contest 2019 - Connecting Cities | "A factory produces thimbles in bulk. Typically, it can produce up to a thimbles a day. However, som(...TRUNCATED) | {"input":["2\n10 1\n1 2 -3 -5 4 6 -3 2 -1 2\n10 2\n1 2 -3 -5 4 6 -3 2 -1 2\n\nSAMPLE"],"output":["12(...TRUNCATED) | {"input":["2 5 1\n0 5 6\n0 2 7\n","1 1 1000000000\n0 0 0\n","2 200 5\n1 1 1\n12 3 15\n","2 10 5\n1 1(...TRUNCATED) | {"input":["5\n10 50\n11 50\n10 50\n10 50\n10 50\n","3\n1000 3000\n1500 1302\n3000 1000\n","43\n75 16(...TRUNCATED) | 2 | 10 | {"language":[2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,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,2,2,4,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,2,2,2,2,2,2,2,2(...TRUNCATED) | 425 | B | 500 | 1,000 | [
""
] | false | null | 256,000,000 | |||
1466_F. Euclid's nightmare | "BubbleSquare social network is celebrating 13^{th} anniversary and it is rewarding its members with(...TRUNCATED) | {"input":["pozdravstaklenidodiri\nniste\ndobri\n","aaa\na\nb\n","abbbaaccca\nab\naca\n"],"output":["(...TRUNCATED) | {"input":["100\n591 417 888 251 792 847 685 3 182 461 102 348 555 956 771 901 712 878 580 631 342 33(...TRUNCATED) | {"input":["5\n2 1\n5 2\n10 3\n25 4\n25479 33\n","5\n2 1\n9 1\n10 3\n25 4\n25479 33\n","5\n1 1\n9 1\n(...TRUNCATED) | 5 | 7 | {"language":[1,2,4,3,2,2,2,3,4,2,3,1,2,2,4,2,4,4,2,2,1,4,4,2,4,2,2,2,2,2,3,1,2,2,4,4,4,1,2,2,3,4,2,3(...TRUNCATED) | {
"language": [],
"solution": []
} | 1,285 | E | 0 | 2,400 | [
"number theory"
] | false | {
"nanos": 0,
"seconds": 5
} | 0 | |||
1304_E. 1-Trees and Queries | "\"Pizza At\", a fast food chain, offers three kinds of pizza: \"A-pizza\", \"B-pizza\" and \"AB-piz(...TRUNCATED) | {
"input": [
"5 3\n5 5 7 3 1\n",
"4 2\n1 2 3 4\n",
"2 3\n1 2\n"
],
"output": [
"15\n",
"8\n",
"0\n"
]
} | {"input":["10 1\n1 1 1 1 1 1 1 1 1 1\n","3 57\n78 165 54\n","1 1\n10000\n","2 2\n2 2\n","9 13\n132 8(...TRUNCATED) | {"input":["4 4 3\n1 2 3\n1 2 1\n2 3 3\n1 3 3\n1 4 4\n","5 4 2\n4 5\n1 2 100\n1 3 100\n3 4 10\n3 5 20(...TRUNCATED) | 2 | 0 | {"language":[2,2,4,2,4,3,4,4,3,4,4,2,2,4,2,2,4,3,4,3,4,4,2,4,4,2,2,4,4,3,2,3,2,4,2,4,1,2,3,3,4,3,4,2(...TRUNCATED) | {"language":[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,4,2,2,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2(...TRUNCATED) | 996 | D | 500 | 2,700 | [
"brute force",
"implementation",
"sortings"
] | false | {
"nanos": 0,
"seconds": 8
} | 256,000,000 | |||
1506_F. Triangular Paths | "Given is a positive integer N. How many tuples (A,B,C) of positive integers satisfy A \\times B + C(...TRUNCATED) | {
"input": [],
"output": []
} | {
"input": [],
"output": []
} | {"input":["3\n1 3 2\n-100 2 6\n","2\n2 1\n-4 0\n","2\n0 1\n-4 0\n","2\n0 2\n-4 0\n","3\n1 5 2\n-167 (...TRUNCATED) | 1 | 9 | {"language":[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,4,2,2,2,2,2,2,2,2,2,2,4(...TRUNCATED) | {"language":[3,2,2,2,3,2,3,3,2,2,2,4,2,2,2,2,2,3,2,2,2,4,2,2,4,2,4,2,4,2,2,3,2,2,4,2,3,2,2,2,4,4,2,2(...TRUNCATED) | 180 | B | 0 | 0 | [] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | |||
544_E. Remembering Strings | "The russian intelligence agency KGB make an encryption technique to send their passwords. Originall(...TRUNCATED) | {
"input": [
"1\n100000 2",
"3\n2 1\n1 3\n2 2"
],
"output": [
"100002 0",
"3 0\n5 0"
]
} | {"input":["50 5000\n2 35 46\n2 43 92\n2 16 88\n2 67 99\n2 36 93\n2 12 20\n2 33 96\n2 55 82\n2 18 32\(...TRUNCATED) | {"input":["0?0?","00??","??00????0??1????0?0??00??1???11?1?1???1?11?111???1","1???11??11?1???1?1?11?(...TRUNCATED) | 2 | 0 | {"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":[3,4,2,4,4,2,1,4,2,4,2,2,2,4,2,4,4,1,2,4,2,2,4,1,4,2,4,4,2,4,4,4,2,4,4,2,2,4,2,3,2,4,4,2(...TRUNCATED) | 1,110 | 0 | 2,100 | [
"constructive algorithms",
"dp"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | ||||
p01838 Optimal Tournament | "BigData Inc. is a corporation that has n data centers indexed from 1 to n that are located all over(...TRUNCATED) | {"input":["10000 01000 00100 11000 01100 11111 01110 11100 10110 11110\n10101 01000 00000 11001 0110(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["30 35 4 30\n14 2 7\n22 23 4\n5 26 3\n28 4 3\n7 5 29\n19 15 2\n11 20 12\n1 22 9\n30 21 24\(...TRUNCATED) | 2 | 2 | {"language":[4,2,2,2,2,2,4,4,2,2,4,4,2,4,2,2,2,2,2,2,2,4,4,2,4,2,4,4,2,2,2,4,4,2,2,2,4,2,4,2,2,2,2,4(...TRUNCATED) | {"language":[2,4,2,2,2,2,2,2,2,2,1,2,2,3,1,2,2,2,4,4,2,2,1,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 1,369 | E | 0 | 1,900 | [
""
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
p02257 Prime Numbers | "A smile house is created to raise the mood. It has n rooms. Some of the rooms are connected by door(...TRUNCATED) | {"input":["3\n7\n4 6 11 11 15 18 20\n4\n10 10 10 11\n3\n1 1 1000000000\n"],"output":["1 2 7\n-1\n1 2(...TRUNCATED) | {
"input": [],
"output": []
} | {"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) | 6 | 15 | {"language":[2,3,1,2,4,2,2,3,4,4,3,2,3,3,3,3,4,3,4,3,3,4,2,1,4,3,2,4,2,2,2,3,4,2,3,3,4,2,3,3,3,2,4,3(...TRUNCATED) | {"language":[0,4,0,0,0,0,0,0,4,2,0,2,2,3,2,0,2,0,3,0,0,0,0,2,0,2,1,1,2,0,3,2,0,0,3,0,0,4,2,2,2,0,0,2(...TRUNCATED) | 1,012 | E | 0 | 1,000 | [
"brute force",
"implementation"
] | false | {
"nanos": 0,
"seconds": 3
} | 256,000,000 | |||
1170_E. Sliding Doors | "Recently, Pari and Arya did some research about NP-Hard problems and they found the minimum vertex (...TRUNCATED) | {"input":["1\nindex.dml\n<dml><title>Markup language has Declined</title><br>Programmers world</dml>(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["85 36 123\n","100000 100000 1937540\n","70386 8300 113682\n","48701 4854 24164\n","84324 (...TRUNCATED) | 2 | 10 | {"language":[2,4,2,4,2,2,2,2,2,2,2,2,4,4,2,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,2,2,2(...TRUNCATED) | {"language":[2,2,2,2,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,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 675 | 1,750 | 1,600 | [
"combinatorics",
"math",
"number theory"
] | false | null | 0 | ||||
1490_D. Permutation Transformation | "Artem has an array of n positive integers. Artem decided to play with it. The game consists of n mo(...TRUNCATED) | {"input":["5 3\n1 2 3 4 0\n4 1 2 14 3\n","7 3\n1 2 3 4 3 2 6\n6 3 1 4 2 2 3\n","4 4\n0 1 2 3\n0 1 2 (...TRUNCATED) | {"input":["1\n17 20\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 6 10 10\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2\n"],"out(...TRUNCATED) | {"input":["4 1\n7 6 1 2\n3\n3\n2 1 9\n2 1 10\n2 1 6\n","3 5\n3 2 8\n1 2 8 1 1\n4\n2 3 3\n1 2 2\n2 2 (...TRUNCATED) | 2 | 0 | {"language":[4,2,4,4,4,2,2,4,4,2,4,3,4,2,2,2,2,4,2,2,2,2,2,2,2,4,2,2,2,4,2,4,1,4,2,2,4,2,1,2,2,2,2,2(...TRUNCATED) | {"language":[2,2,2,4,2,4,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,4,2,2,2,2,4,2,2,4,2,2,4(...TRUNCATED) | 1,140 | C | 1,000 | 0 | [] | false | {
"nanos": 0,
"seconds": 6
} | 256,000,000 | |||
354_E. Lucky Number Representation | "Your task is very simple. Given K numbers A1, A2, ..., AK. You need to find f(N) mod max(A1, A2, .(...TRUNCATED) | {
"input": [
"2008 2 29\n2015 3 1",
"1999 9 9\n2001 11 3"
],
"output": [
"8",
"3"
]
} | {"input":["15\nMIRZOYANOVECLOX\n","23\nAABBBAAACCCCCAAADDDDDDD\n","2\nQA\n","11\nGGRRAATTZZZ\n","6\n(...TRUNCATED) | {"input":["1 0\n40654\n","3 3\n1 1 0\n1 2\n2 3\n3 1\n","5 4\n1 2 2 2 2\n1 2\n2 3\n1 4\n1 5\n","4 4\n(...TRUNCATED) | 2 | 7 | {"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],"sol(...TRUNCATED) | {
"language": [],
"solution": []
} | 67 | A | 0 | 0 | [
"*special"
] | true | null | 536,870,912 |
End of preview. Expand in Data Studio
edition_2775_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
- 11