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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
rams-love-for-sita-2 | "Wet Shark asked Rat Kwesh to generate three positive real numbers x, y and z, from 0.1 to 200.0, in(...TRUNCATED) | {"input":["3\n10 20 10\n6\n1 1\n2 1\n2 2\n3 1\n3 2\n3 3\n","7\n1 2 1 3 1 2 1\n9\n2 1\n2 2\n3 1\n3 2\(...TRUNCATED) | {"input":["1\n1\n1\n1\n1\n1\n1\n","1\n3\n2 3 1\n1 2\n2 3\n1\n1\n1\n2\n","2\n6\n5 3 2 4 1 6\n1 2\n1 3(...TRUNCATED) | {"input":["1 999999999 37939 29989\n","9999999 10000 29983 24442\n","808351 22950 433 509\n","197 2 (...TRUNCATED) | 2 | 7 | {"language":[1],"solution":["from collections import deque\nclass Frog():\n\t\n\tdef __init__(self,n(...TRUNCATED) | {"language":[2,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,3,2,2,0,3,2,2,2(...TRUNCATED) | 980 | E | 1,000 | 1,500 | [
"greedy"
] | false | {
"nanos": 0,
"seconds": 2
} | 0 | |||
691_D. Swaps in Permutation | "You are given the array a consisting of n elements and the integer k ≤ n.\n\nYou want to obtain a(...TRUNCATED) | {"input":["4\n2 1 2 3 4 3 2 6 1 1 2 2 1 2 3 2\n","1\n42\n","2\n1 1 1 1\n"],"output":["6 4 3 2 ","42 (...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["384\n87 78 16 94 36 87 93 50 22 63 28 91 60 64 27 41 27 73 37 12 69 68 30 83 31 63 24 68 (...TRUNCATED) | 2 | 7 | {"language":[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,2,2,2,2,2,4,2,2,2,4,2,2,2,2,2,2(...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) | 0 | C | 0 | 2,000 | [
"math"
] | false | null | 256,000,000 | |||
776_A. A Serial Killer | "Tavak and Seyyed are good friends. Seyyed is very funny and he told Tavak to solve the following pr(...TRUNCATED) | {"input":["3\n3 3 4\n3 3 5\n3 3 3\n"],"output":["***\n*.*\n***\n\n***\n**.\n...\n\n***\n*.*\n**.\n\n(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["31 50000000\n90016\n60016\n00016\n30016\n30016\n30013\n30013\n90014\n30014\n30014\n20014\(...TRUNCATED) | 6 | 0 | {"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":[2,2,2,2,2,4,2,4,4,2,4,2,2,4,2,2,4,4,2,2,2,2,3,2,2,2,2,2,3,2,2,2,4,2,2,2,2,2,2,2,4,2,4,2(...TRUNCATED) | 1,540 | F | 0 | 0 | [
"dfs and similar",
"graphs"
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | |||
793_F. Julia the snail | "Given an integer n and a permutation of numbers 1, 2 ... , n-1, n write a program to print the perm(...TRUNCATED) | {"input":["500 500 0 0 200 200","4 4 0 0 1 1","4 4 0 0 3 3","2 3 0 0 1 2"],"output":["34807775","2",(...TRUNCATED) | {
"input": [
"3\n1234567\n1268501\n1268499\n"
],
"output": [
"788765312\n999997375\n999999350\n"
]
} | {"input":["1 100000 100000 110000 -100000\n","46456 -250 -23623 -98302 -99305\n","10 6 3 7 2\n","1 -(...TRUNCATED) | 2 | 0 | {"language":[3,3,4,4,4,2,4,4,4,4,2,4,2,4,4,3,4,4,4,3,3,3,2,4,4,4,3,4,4,2,1,2,4,4,4,3,2,3,3,4,2,4,3,4(...TRUNCATED) | {
"language": [],
"solution": []
} | 937 | F | 2,000 | 0 | [
"dfs and similar"
] | false | {
"nanos": 0,
"seconds": 1
} | 512,000,000 | |||
1325_B. CopyCopyCopyCopyCopy | "You are given two arrays of integers a_1,…,a_n and b_1,…,b_m.\n\nYour task is to find a non-emp(...TRUNCATED) | {
"input": [
"3\n3 2 2\n",
"4\n2 2 2 2\n"
],
"output": [
"4\n",
"3\n"
]
} | {"input":["2\n1 31\n","2\n1 0\n","10\n450661 128600 993228 725823 293549 33490 843121 903634 556169 (...TRUNCATED) | {"input":["5\n2 1 1 1 2\n","6\n5 1 3 4 8 3\n","5\n1 5 7 1 2\n","6\n5 1 3 4 5 3\n","2\n1000010 100100(...TRUNCATED) | 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<algo(...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) | 1,155 | E2 | 2,000 | 1,000 | [
""
] | false | {
"nanos": 0,
"seconds": 8
} | 0 | |||
283_D. Cows and Cool Sequences | "Given an n × n table T consisting of lowercase English letters. We'll consider some string s good (...TRUNCATED) | {
"input": [
"4\n100 100 100 200\n",
"3\n100 200 100\n"
],
"output": [
"NO\n",
"YES\n"
]
} | {"input":["5 2 4 12\nhhhwh\n","2 5 5 1000000000\nwh\n","16 1 1000 2100\nhhhwwwhhhwhhhwww\n","1 2 3 3(...TRUNCATED) | {"input":["9 1004498469 6\n","1 0 10\n","1944219055 33463955 1369298327\n","914835 4386500 9234739\n(...TRUNCATED) | 3 | 7 | {"language":[2,1,3,4,1,4,1,4,2,3,4,2,4,1,2,3,2,2,4,3,2,4,2,2,2,4,4,3,2,4,4,4,4,1,1,3,2,2,2,4,1,4,1,2(...TRUNCATED) | {"language":[2,3,4,3,3,4,2,2,3,3,2,2,2,3,3,3,2,2,3,3,3,4,2,3,2,2,3,2,3,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2(...TRUNCATED) | 0 | A | 2,000 | 1,900 | [
"combinatorics",
"math",
"number theory"
] | true | {
"nanos": 0,
"seconds": 1
} | 0 | |||
chandu-and-his-girlfriend-returns | "After bracket sequences Arthur took up number theory. He has got a new favorite sequence of length (...TRUNCATED) | {
"input": [
"100 5\n1\n23\n45\n67\n89",
"10 2\n4\n5",
"6 1\n3"
],
"output": [
"608200469",
"0",
"4"
]
} | {
"input": [
"60 0 58",
"7 3 7"
],
"output": [
"630738177",
"195634923"
]
} | {"input":["50 1\n50 8 46 9 12 38 41 18 49 10 23 15 18 3 13 17 48 8 31 32 6 31 31 49 9 40 9 21 23 41 (...TRUNCATED) | 6 | 8 | {
"language": [],
"solution": []
} | {"language":[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,2,2,2,4(...TRUNCATED) | 633 | D | 1,500 | 2,800 | [
"constructive algorithms",
"greedy",
"number theory"
] | false | {
"nanos": 0,
"seconds": 1
} | 268,435,456 | |||
1500_B. Two chandeliers | "Polycarp is working on a new project called \"Polychat\". Following modern tendencies in IT, he dec(...TRUNCATED) | {
"input": [
"4 5 3 1 5\n",
"5 1 2 1 2\n",
"3 3 1 1 1\n"
],
"output": [
"Friendship\n",
"First\n",
"Second\n"
]
} | {"input":["997 6 680633279\n","989 8 990767311\n","999 2 750160753\n","1 4 904448911\n","1000 3 7501(...TRUNCATED) | {"input":["2\n\nSBMPLE","2\n\nSBPMLE","2\n\nELMPBS","2\n\nELMPAS","2\n\nSAPMLE","2\n\nSAQMLE","2\n\n(...TRUNCATED) | 2 | 10 | {"language":[2,2,2,3,4,2,4,4,4,2,2,4,4,4,2,2,2,2,4,2,2,2,4,3,4,2,4,2,2,2,3,2,2,4,2,4,4,2,4,4,2,3,2,2(...TRUNCATED) | {"language":[2,4,4,2,2,2,2,1,2,2,1,2,3,2,2,2,2,2,1,2,1,2,1,1,2,2,2,2,2,4,2,2,2,2,1,3,2,2,3,4,2,1,4,2(...TRUNCATED) | 470 | 2,500 | 2,400 | [
"bitmasks",
"dp",
"games"
] | false | {
"nanos": 0,
"seconds": 5
} | 268,435,456 | ||||
trailing-zero-problem-1 | "Julia is conducting an experiment in her lab. She placed several luminescent bacterial colonies in (...TRUNCATED) | {"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\natom\n0 47 3(...TRUNCATED) | {"input":["100\n04\n9\n02163\n003000\n08041479\n80750340926070052\n90056\n11680\n90\n090208090090209(...TRUNCATED) | {"input":["1\n4 5\n9 7 5 3\n8 6 4 1 0\n\nSAMPLE","1\n4 5\n9 7 5 3\n16 6 4 2 0\n\nSAMPLE","1\n4 5\n9 (...TRUNCATED) | 2 | 10 | {"language":[4,1,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,4,2,2,2,2,2,2,4,2,2,2,4,4,2,2,2,2,2,2,4,2,2,2,2,2(...TRUNCATED) | {"language":[3,3,4,3,2,3,1,4,4,3,2,4,3,4,2,2,2,2,2,3,4,4,4,2,4,4,2,3,3,2,2,3,4,3,3,3,2,4,3,2,3,3,1,2(...TRUNCATED) | 0 | 0 | 2,200 | [
"implementation",
"math"
] | false | {
"nanos": 0,
"seconds": 1
} | 268,435,456 | ||||
124_D. Squares | "This is an interactive task.\n\nDasha and NN like playing chess. While playing a match they decided(...TRUNCATED) | {"input":["4 4 2\n2 3\n1 2\n1 3\n1 4\n","5 8 2\n2 1\n4 2\n5 4\n5 2\n4 3\n5 1\n4 1\n3 2\n","5 7 2\n1 (...TRUNCATED) | {"input":["1 1\n1\n2\n","6 3\n1 2 3 4 5 6\n3 5 1\n","5 5\n5 6 3 2 1\n4 3 1 5 6\n","1 1\n1\n1\n","10 (...TRUNCATED) | {"input":["brtakoktrosttttttttttosafasfkalsfkodfdasiofhadfhasdsajfdsafoasodsafahaihfdisoadspapsapios(...TRUNCATED) | 2 | 12 | {"language":[2,2,2,2,2,4,4,4,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,4,2,2,2,2,2,2,2,2(...TRUNCATED) | {"language":[3,2,3,2,4,4,2,4,3,4,4,4,2,4,3,4,4,4,2,4,2,2,3,4,4,3,2,3,3,3,3,2,2,4,4,4,2,3,4,4,4,4,4,2(...TRUNCATED) | 0 | D | 0 | 3,100 | [
"brute force",
"implementation"
] | false | {
"nanos": 0,
"seconds": 2
} | 0 |
End of preview. Expand in Data Studio
edition_1365_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