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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1304_E. 1-Trees and Queries | Strings can be efficiently stored as a data structure, to have efficient searching methods.
A new startup is going to use this method, but they don't have much space. So they want to check beforehand how much memory will be required for their data.
Following method describes the way in which this startup's engineers s... | {
"input": [
"10\n10\n3 7\n1 4\n1 6\n5 5\n1 1\n3 9\n7 8\n1 2\n3 3\n7 10\n10\n2 4\n1 7\n3 4\n3 5\n2 8\n2 5\n5 5\n3 5\n7 7\n3 10\n",
"8\n4\n1 2\n3 4\n2 5\n6 7\n5\n1 2\n1 4\n1 6\n2 7\n6 8\n"
],
"output": [
"2\n7\n3\n3\n2\n2\n5\n3\n7\n10\n",
"2\n2\n5\n5\n7\n"
]
} | {
"input": [],
"output": []
} | {
"input": [
"3 5 10\nred\n0 0 0\n5 0 0\ngreen\n0 5 5\n5 6 1\nblue\n0 40 5\n5 0 0\n3 10 5\nbtom\n0 47 32\n5 -10 -7\n10 1 0\npluto\n0 0 0\n7 0 0\n10 3 3\ngesicht\n0 25 7\n5 -7 -2\n10 -1 10\n4 100 7\nimpulse\n0 -500 0\n100 10 1\nfreedom\n0 -491 0\n100 9 2\ndestiny\n0 -472 0\n100 7 4\nstrike\n0 -482 0\n100 8 3\n0 0 ... | 2 | 9 | {
"language": [
2,
2,
2,
2,
2,
2,
2,
2,
2,
2,
2,
2,
2,
2,
2,
2,
2,
2,
2,
2
],
"solution": [
"#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<queue>\n#include<functional>\nusing namespace std;\n#define ll long l... | {
"language": [
2,
2,
2,
2,
2,
3,
2,
0,
2,
2,
2,
2,
2,
2,
2,
2,
2,
2,
2,
2,
2,
2,
2,
2,
2,
0,
2,
2,
2,
2,
2,
2,
0,
2,
2,
2,
2,
2,
2,
2,
2,
2,
2,
... | 996 | 1,500 | 0 | [
""
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | ||||
1297_E. Modernization of Treeland | "Problem Description\n\nGiven a list of integers, find and display all even numbers from the end of (...TRUNCATED) | {
"input": [
"3\nDSAWWAW\nD\nWA\n"
],
"output": [
"8\n2\n4\n"
]
} | {"input":["10\n9 8 7 6 5\n","100\n41 13 29 11 25 15 6 23 28 50 48 17 3 9 44 24 5 19 34 22 33 32 20 1(...TRUNCATED) | {"input":["1 1 2 2 1\n2 1\n","5 2 2 1 8\n1 1 2\n1 5 3\n1 2 1\n2 2\n1 4 2\n1 3 0\n2 1\n2 3\n","5 2 2 (...TRUNCATED) | 2 | 6 | {"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2],"solution":["#include <bits/stdc++.h>\nu(...TRUNCATED) | {"language":[2,2,1,2,4,1,4,3,1,2,4,3,1,4,2,2,3,2,4,2,2,4,4,3,4,3,2,4,1,1,4,1,3,4,2,3,3,1,3,2,4,2,4,4(...TRUNCATED) | 875 | 2,000 | 2,000 | [
""
] | false | null | 256,000,000 | ||||
765_D. Artsem and Saunders | "You are running through a rectangular field. This field can be represented as a matrix with 3 rows (...TRUNCATED) | {"input":["6 2\n2 3 0 5 6 0\n","6 2\n0 0 1 0 4 5\n","6 1\n2 0 4 0 6 0\n","4 1\n0 0 0 0\n"],"output":(...TRUNCATED) | {"input":["8 10\ncwcwcwcwcw\ncrcrcrcrcr\ncwcwcwcwcw\ncrcrcrcrcr\ncwcwcwcwcw\ncrcrcrcrcr\ncwcwcwcwcw\(...TRUNCATED) | {"input":["14 2 2012","14 4 2012","14 4 1177","20 4 1177","20 4 1433","20 3 1433","14 3 1433","14 3 (...TRUNCATED) | 5 | 0 | {"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2],"solution":["#include <iostream>\n#inc(...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 | 0 | 1,600 | [] | false | {
"nanos": 0,
"seconds": 8
} | 256,000,000 | ||||
1144_B. Parity Alternated Deletions | "Allen and Bessie are playing a simple number game. They both know a function f: \\{0, 1\\}^n → R,(...TRUNCATED) | {"input":["4\n..E.\n.AD.\nB...\n..C.\nD\n4\n..E.\n.AD.\nB...\n..C.\nDR\n3\n...\n.A.\nBC.\n((URD)3L)2(...TRUNCATED) | {"input":["2\nab\nac\n","2\nca\ncb\n","2\ndc\nec\n","2\naz\nzb\n","2\naa\nb\n","25\nsw\nwt\nc\nl\nyo(...TRUNCATED) | {"input":["10803140200\n","14\n","11\n","174813966899\n","13753962\n","601828654335\n","114141413978(...TRUNCATED) | 2 | 12 | {"language":[2,2,2,4,2,2,2,4,2,2,2,2,4,2,2,2,2,1,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,2,2,1,4,2,4,2,2,2,4,2(...TRUNCATED) | {
"language": [],
"solution": []
} | 925 | D1 | 0 | 0 | [
"brute force",
"greedy",
"implementation"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
593_C. Beautiful Function | "Programmers' kids solve this riddle in 5-10 minutes. How fast can you do it?\n\nInput\n\nThe input (...TRUNCATED) | {
"input": [
"7\n1\n2\n3\n4\n5\n100\n2000000\n"
],
"output": [
"0\n0\n4\n4\n12\n990998587\n804665184\n"
]
} | {
"input": [],
"output": []
} | {"input":["1 100000 100000 110000 -100000\n","46456 -250 -23623 -98302 -99305\n","10 6 3 7 2\n","1 -(...TRUNCATED) | 6 | 9 | {"language":[4,2,3,3,4,4,4,2,2,2,2,3,4,3,2,4,3,4,4,2,4,4,3,2,4,3,4,3,4,4,3,3,2,4,2,4,2,4,4,3,4,4,2,2(...TRUNCATED) | {
"language": [],
"solution": []
} | 0 | E | 2,000 | 2,500 | [
"dfs and similar",
"dp",
"dsu",
"ternary search",
"trees"
] | false | {
"nanos": 0,
"seconds": 2
} | 0 | |||
938_B. Run For Your Prize | "Amr loves Geometry. One day he came up with a very interesting problem.\n\nAmr has a circle of radi(...TRUNCATED) | {
"input": [
"5 5\n1 2 3 4 5\n",
"3 1\n1 1 2\n",
"5 2\n1 1 2 1 3\n"
],
"output": [
"16",
"3",
"14"
]
} | {"input":["1 0\n23333\n","3 3\n1 1 1\n1 2\n2 3\n3 1\n","5 4\n1 2 2 2 2\n1 2\n1 3\n1 4\n1 5\n","10 30(...TRUNCATED) | {"input":["3\n184427 500001 500002\n","1\n413243\n","1\n256223\n","2\n3 999999\n","1\n576559\n","2\n(...TRUNCATED) | 2 | 0 | {"language":[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,2,2,2,2,2,2,2,2,2,2,2,4(...TRUNCATED) | {"language":[2,0,2,2,0,2,2,0],"solution":["#include <bits/stdc++.h>\n#define pq priority_queue\nusin(...TRUNCATED) | 0 | F | 0 | 0 | [
"data structures",
"dfs and similar",
"dp",
"trees"
] | false | null | 256,000,000 | |||
p03194 CADDi 2018 for Beginners - Product and GCD | "Given an integer n and a permutation of numbers 1, 2 ... , n-1, n write a program to print the perm(...TRUNCATED) | {
"input": [
"5 10\n2 1 2 1 2\n2\n2 4\n4 5\n"
],
"output": [
"3\n3\n"
]
} | {"input":["1.0 200.0 200.0\n","0.2 0.1 0.6\n","1.9 3.0 4.1\n","51.8 51.8 7.1\n","113.9 125.2 88.8\n"(...TRUNCATED) | {"input":["8 12\n1 2\n2 3\n4 5\n5 6\n6 7\n7 8\n1 4\n4 7\n2 5\n5 8\n3 6\n6 9\n","7 3\n3 2\n2 1\n1 4\n(...TRUNCATED) | 6 | 8 | {"language":[2,4,4,2,3,4,4,4,4,2,2,3,4,3,3,3,3,3,4,2,2,4,3,3,4,3,2,3,4,2,3,3,2,3,3,4,3,3,2,2,3,4,3,2(...TRUNCATED) | {
"language": [],
"solution": []
} | 0 | 0 | 1,900 | [
"combinatorics",
"dp",
"trees"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | ||||
260_B. Ancient Prophesy | "At the big break Nastya came to the school dining room. There are n pupils in the school, numbered (...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":["605 297 -251700323 -366763764 -445828791 325081312\n","14 9 44 45 -50 -9\n","18 17 -26078(...TRUNCATED) | {
"input": [],
"output": []
} | 2 | 0 | {"language":[2,2,4,2,2,3,4,2,2,2,1,2,4,2,2,4,4,2,2,2,4,4,2,2,4,2,2,2,4,2,4,2,2,2,2,2,1,4,2,2,4,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,2,2,2,2,2,2,2,2(...TRUNCATED) | 1,421 | F | 0 | 2,300 | [
"constructive algorithms",
"dp"
] | true | null | 256,000,000 | |||
774_K. Stepan and Vowels | "<!--\n\nProblem G\n\n-->\n\nLet's Move Tiles!\n\nYou have a framed square board forming a grid of s(...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": [],
"output": []
} | {"input":["10\n3\n-15 -33 79\n16\n45 -84 19 85 69 -64 93 -70 0 -53 2 -52 -55 66 33 -60\n2\n14 -2\n4\(...TRUNCATED) | 2 | 7 | {"language":[1,3,3,4,1,1,4,3,3,2,3,2,4,3,1,4,2,2,2,3,4,4,3,3,4,3,1,2,4,3,1,3,2,1,3,3,1,4,4,1,3,2,3,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],"solution":[(...TRUNCATED) | 0 | E | 1,000 | 0 | [
""
] | false | {
"nanos": 0,
"seconds": 8
} | 268,435,456 | |||
once-upon-a-time-in-time-land | "There are five people playing a game called \"Generosity\". Each person gives some non-zero number (...TRUNCATED) | {
"input": [
"4 1\n1 2 3 4\n1 3\n\nSAMPLE"
],
"output": [
"6 0\n"
]
} | {"input":["30 35 4 30\n14 2 7\n22 23 2\n5 26 3\n28 4 3\n7 5 29\n19 15 2\n11 20 12\n1 22 9\n30 21 24\(...TRUNCATED) | {
"input": [],
"output": []
} | 2 | 8 | {"language":[2,4,3,2,3,1,3,4,3,2,4,4,3,3,2,2,2,3,1,1,1,2,2,3,4,4,3,4,1,1,2,3,1,2,4,2,3,4,3,3,3,2,1,4(...TRUNCATED) | {"language":[2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 0 | 0 | 1,600 | [
"constructive algorithms",
"math"
] | false | {
"nanos": 0,
"seconds": 1
} | 1,073,741,824 |
End of preview. Expand in Data Studio
edition_2198_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
- 5