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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
p00447 Searching Constellation | "Sarah is a girl who likes reading books.\n\nOne day, she wondered about the relationship of a famil(...TRUNCATED) | {
"input": [
"10\n1 2 3 4 5\n",
"6\n1 2 6\n"
],
"output": [
"10\n",
"2\n"
]
} | {"input":["7\n7 3 4 6 6 7\n","4\n3 3 4\n","6\n3 3 6 6 6\n","5\n4 4 4 5\n","9\n2 9 7 6 9 7 8 9\n","3\(...TRUNCATED) | {"input":["106 25 31","4 24 20","10 29 20","30 47 100","8 25 31","4 29 20","30 26 100","16 25 31","3(...TRUNCATED) | 2 | 8 | {"language":[3,3,2,4,4,3,2,3,4,4,1,4,3,1,3,1,2,4,3,1,3,4,2,1,2,2,2,3,3,3,3,4,3,2,4,4,2,4,2,3,2,2,1,1(...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 | E | 1,500 | 0 | [
"brute force",
"data structures",
"implementation"
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | |||
526_A. King of Thieves | "Greg has a pad. The pad's screen is an n × m rectangle, each cell can be either black or white. We(...TRUNCATED) | {
"input": [
"5\n2 3 1 5 5\n4\n2 2 3 2\n2 1 5 3\n1 3 5\n2 1 5 3\n"
],
"output": [
"5\n26\n38\n"
]
} | {"input":["42 28\n7 19\n15 24\n3 42\n18 5\n32 27\n26 20\n40 30\n35 2\n14 8\n22 10\n36 4\n16 14\n21 2(...TRUNCATED) | {
"input": [],
"output": []
} | 2 | 8 | {"language":[2,2,2,2,2,2,2,2,2,4,2,2,4,2,3,2,2,4,4,2,4,4,2,2,4,2,2,2,2,2,2,2,4,2,2,2,2,4,2,2,2,4,2,2(...TRUNCATED) | {"language":[2,2,2,2,2,2,2,2,2,2,0,2,2,2,2,2,2,2,0,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) | 1,446 | B | 2,500 | 0 | [
"dfs and similar",
"graphs",
"probabilities",
"trees"
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | |||
754_E. Dasha and cyclic table | "During the archaeological research in the Middle East you found the traces of three ancient religio(...TRUNCATED) | {
"input": [
"2\n1\n3\n\nSAMPLE"
],
"output": [
"1\n26\n"
]
} | {"input":["10 23\n6 9 8 10 4 3 7 1 5 2\n7 2\n3 2\n2 4\n2 3\n7 5\n6 4\n10 7\n7 1\n6 8\n6 2\n8 10\n3 5(...TRUNCATED) | {
"input": [],
"output": []
} | 2 | 10 | {"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],"solution":["for(...TRUNCATED) | {"language":[2,2,0,2,2,3,2,2,2,2,3,2,2,2,2,2,3,2,2,2,3,2,2,3,2,0,2,3,2,3,2,2,3,2,3,0,0,2,2,2,2,3,2,4(...TRUNCATED) | 614 | 0 | 1,700 | [
"binary search",
"graphs",
"matrices"
] | false | {
"nanos": 500000000,
"seconds": 2
} | 256,000,000 | ||||
p02741 Panasonic Programming Contest 2020 - Kth Term | "Nick has n bottles of soda left after his birthday. Each bottle is described by two values: remaini(...TRUNCATED) | {
"input": [
"3\ncode\ncoder\ncoding\n2\n1 3 code\n1 3 co\n\nSAMPLE"
],
"output": [
"2 \n3"
]
} | {
"input": [],
"output": []
} | {"input":["2 0\n1 1 0 1\n","2 2\n0 1 2 3\n2 1\n0 4\n","1 0\n2 1\n","2 0\n1 0 0 1\n","2 2\n0 1 2 4\n2(...TRUNCATED) | 2 | 0 | {"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],"solution":["# @author Kil(...TRUNCATED) | {"language":[2,0,2,2,0,0,2,2,0,2,0,0,0,0,2,2,2,0,0,0,0,2,2,2,2,2,0,0,2,2,0,0,0,2,0,4,0,0,0,0,2,2,0,0(...TRUNCATED) | 754 | 0 | 1,100 | [
"implementation"
] | false | {
"nanos": 0,
"seconds": 2
} | 0 | ||||
223_C. Partial Sums | "There are N stations in the city where JOI lives, and they are numbered 1, 2, ..., and N, respectiv(...TRUNCATED) | {"input":["5\n4\n1 2 3 4\n5 10 15 20\n4\n1 2 1 2\n5 10 15 20\n4\n2 2 4 1\n2 8 19 1\n2\n1 1\n6 9\n1\n(...TRUNCATED) | {"input":["3\n2 2 3\n","5\n1 4 5 4 5\n","4\n2 2 4 4\n","3\n1 1 2\n","4\n1 2 1 2\n","4\n4 2 2 4\n","6(...TRUNCATED) | {"input":["5\ncbbbb\nbcbab\naacbb\naaacb\naaaac\n","20\nbifcabiabgfibfccdbgd\ncffaheagahcbacafbgeb\n(...TRUNCATED) | 5 | 0 | {"language":[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,4,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | {"language":[2,2,2,2,2,4,2,2,4,4,2,2,2,2,2,2,1,4,2,2,4,2,2,2,2,2,2,2,4,2,2,2,3,2,2,2,3,2,3,2,2,2,2,2(...TRUNCATED) | 1,257 | D | 1,500 | 0 | [
"binary search",
"brute force",
"implementation"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
737_A. Road to Cinema | "In one well-known algorithm of finding the k-th order statistics we should divide all elements into(...TRUNCATED) | {"input":["4 4\n1 2 1 10\n2 4 3 5\n1 3 1 5\n2 4 2 7\n","5 6\n1 2 1 10\n2 5 11 20\n1 4 2 5\n1 3 10 11(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["16\nFFC0\nFFC0\nFFC0\nFFC0\nFFC0\nFFD0\nFFC0\nFFC0\nFFC0\nFFC0\nFFC0\nFFC0\nFFC0\nFFC0\nF(...TRUNCATED) | 5 | 8 | {"language":[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,4,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,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) | 295 | A | 1,000 | 0 | [
""
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | |||
1046_D. Interstellar battle | "Note that this is the first problem of the two similar problems. You can hack this problem only if (...TRUNCATED) | {
"input": [
"5 5\n1 2\n3 4\n3 2\n4 2\n2 5\n"
],
"output": [
"2\n1 4 \n"
]
} | {
"input": [],
"output": []
} | {"input":["000 0","10 3\n8 7 000\n7 9 100\n9 8 100","4 3\n2 1 1\n2 3 3\n3 4 2","10 3\n8 7 000\n7 9 1(...TRUNCATED) | 6 | 0 | {"language":[1,1,1,1],"solution":["t=int(raw_input())\ndef z(x):\n i=5\n c=0\n while x/i>=1(...TRUNCATED) | {"language":[2,0,0,2,2,2,2,2,2,2,0,0,0,0,2,2,0,3,0,0,0,0,2,2,0,2,2,2,2,0,2,2,2,0,0],"solution":["#in(...TRUNCATED) | 209 | E | 0 | 0 | [
"binary search",
"bitmasks",
"combinatorics",
"data structures",
"divide and conquer"
] | false | {
"nanos": 0,
"seconds": 2
} | 512,000,000 | |||
687_D. Dividing Kingdom II | "You are given an infinite checkered field. You should get from a square (x1; y1) to a square (x2; y(...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":["9 530792195 6\n","0 0 10\n","1944219055 454183506 1369298327\n","914835 2742837 9234739\n(...TRUNCATED) | {"input":["5 4","7 4","6 1","9 4","6 3","14 4","8 1","28 4","15 2","28 3","19 2","32 2","29 5","26 3(...TRUNCATED) | 5 | 8 | {"language":[2,4,4,3,4,1,2,3,4,3,4,2,2,4,1,3,4,4,2,2,2,3,2,2,3,1,3,3,4,4,3,4,3,2,4,4,1,2,2,2,2,2,2,3(...TRUNCATED) | {
"language": [],
"solution": []
} | 0 | 0 | 3,500 | [
"binary search",
"data structures",
"graph matchings",
"greedy",
"implementation",
"math",
"trees"
] | false | {
"nanos": 0,
"seconds": 3
} | 256,000,000 | ||||
820_D. Mister B and PR Shifts | "You are given an array a of n integers.\n\nYou want to make all elements of a equal to zero by doin(...TRUNCATED) | {
"input": [
"3\n2 3 3"
],
"output": [
"2"
]
} | {
"input": [
"1\n999838675\n"
],
"output": [
"-1\n"
]
} | {"input":["0 1681261333\n","10 4\n","16384 40642166\n","727373493 403495785\n","62914844 907959152\n(...TRUNCATED) | 2 | 0 | {"language":[2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | {
"language": [],
"solution": []
} | 0 | 500 | 3,000 | [
""
] | false | null | 256,000,000 | ||||
805_A. Fake NP | "You are given an array a_1, a_2, ... , a_n, which is sorted in non-decreasing order (a_i ≤ a_{i +(...TRUNCATED) | {
"input": [
"4 1 1 6\n3 2 3"
],
"output": [
"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\n3 4\n1 2\n3 4\n1 4\n","4\n2 4\n1 3\n3 4\n1 1\n","4\n1 4\n2 4\n2 4\n1 2\n","7\n7 7\n2 3(...TRUNCATED) | 2 | 7 | {"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":[0,2,2,2,2,2,2,2,2,2,2,2],"solution":["#include <bits/stdc++.h>\ntypedef struct {\n dou(...TRUNCATED) | 1,227 | 500 | 900 | [
""
] | false | {
"nanos": 0,
"seconds": 3
} | 256,000,000 |
End of preview. Expand in Data Studio
edition_2200_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
- 10