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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
tech07 | "Vasya commutes by train every day. There are n train stations in the city, and at the i-th station (...TRUNCATED) | {"input":["3 1 4\n","2 2 10\n","5 5 16808\n","1 4 10\n"],"output":["Stas\n\n","Masha\n\n","Masha\n\n(...TRUNCATED) | {"input":["53812 4 967428361\n","7 2 400166453\n","75727 16 485722667\n","65536 10 802338989\n","655(...TRUNCATED) | {"input":["1+1+3+1+2+1+2+2+1+2+2+1+3+3+3+1+1+2+3+2+3+1+2+3+3+3+1+1+1+3+3+3+2+2+3+3+2+2+3+1+2+1+1+2+2(...TRUNCATED) | 2 | 11 | {"language":[2,4,1,2,2,2,4,4,2,2,4,4,2,2,2,2,2,2,2,2,3,2,4,1,2,2,2,2,2,2,2,1,2,2,2,1,4,2,3,2,2,2,2,3(...TRUNCATED) | {"language":[2,2,2,4,2,4,2,2,4,2,2,1,2,1,4,4,2,2,2,2,2,4,2,2,2,4,4,4,2,2,4,4,4,2,4,2,2,2,2,2,3,3,2,2(...TRUNCATED) | 0 | E | 0 | 2,200 | [
"graphs",
"greedy",
"shortest paths"
] | false | null | 1,073,741,824 | |||
1500_B. Two chandeliers | "Hexadecimal likes drawing. She has drawn many graphs already, both directed and not. Recently she h(...TRUNCATED) | {"input":["3 3\n1 2 1\n2 3 1\n1 3 5","100 0","10 3\n8 7 100\n7 9 100\n9 8 100","3 3\n1 2 1\n2 3 1\n1(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["4\n4 3 2 1\n2 3 4 1\n3\n1 2 3 4\n1 3 2 1\n2 4 2 3\n","4\n4 3 2 1\n2 3 4 1\n3\n1 2 3 4\n1 (...TRUNCATED) | 2 | 12 | {
"language": [],
"solution": []
} | {"language":[2,2,2,2,2,2,2,4,4,2,2,4,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,4,2,4,2,2,2,2(...TRUNCATED) | 1,165 | A | 1,000 | 1,500 | [] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | |||
1003_D. Coins and Queries | "The HR manager was disappointed again. The last applicant failed the interview the same way as 24 p(...TRUNCATED) | {
"input": [
"6\n2 3 1 3 2 4\n2\n1 0 4\n2 3 5\n\nSAMPLE"
],
"output": [
"2\n-1"
]
} | {"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":["3\n","316240294332142860\n","1000001000000000000\n","1440563777463828705\n","5\n","8\n","(...TRUNCATED) | 2 | 13 | {"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,4,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2(...TRUNCATED) | {"language":[4,2,2,2,2,1,4,2,3,3,4,1,4,1,2,2,2,2,2,2,3,2,1,3,3,2,2,1,2,2,4,3,1,4,1,1,3,4,4,3,2,3,4,3(...TRUNCATED) | 124 | 0 | 3,100 | [
"data structures",
"greedy"
] | false | null | 1,073,741,824 | ||||
1129_D. Isolation | "You are given a matrix consisting of n rows and m columns. The matrix contains lowercase letters of(...TRUNCATED) | {
"input": [
"6 5\n1 2 2 4 2 3\n",
"7 5\n3 3 2 1 1 1 3\n"
],
"output": [
"4\n",
"2\n"
]
} | {"input":["20 20\n00010110100100010111\n11110000001100101110\n01110101110001111000\n1011110100011111(...TRUNCATED) | {"input":["85 36 123\n","100000 100000 1937540\n","70386 8300 113682\n","48701 4854 24164\n","84324 (...TRUNCATED) | 2 | 0 | {"language":[2,4,4,4,2,4,4,4,4,4,2,3,2,3,4,2,2,2,2,2,4,4,2,4,2,4,2,2,2,4,2,2,2,2,2,3,2,4,2,4,4,2,2,1(...TRUNCATED) | {"language":[2,4,2,2,2,2,3,2,2,2,1,2,2,2,4,2,2,2,4,4,1,2,4,4,2,1,4,4,4,2,2,2,2,4,2,2,2,1,2,4,2,2,2,2(...TRUNCATED) | 1,431 | B | 1,500 | 2,300 | [
"geometry"
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | |||
1354_C2. Not So Simple Polygon Embedding | "You are given an array of n positive integers a_1, a_2, ..., a_n. You can perform the following ope(...TRUNCATED) | {
"input": [
"3\n6 4 1\n",
"4\n20 6 3 4\n"
],
"output": [
"0\n",
"2\n"
]
} | {"input":["5\n0 968804136\n0 736567537\n2 343136264\n0 259899572\n1 425744418\n","5\n0 51690939\n0 6(...TRUNCATED) | {"input":["4 9\n5 1000000000 999999999 19\n","4 6\n5 1000000000 1790978867 12\n","3 5\n8 5 6\n","3 4(...TRUNCATED) | 2 | 0 | {"language":[2,2,4,4,2,2,2,2,2,2,2,4,2,4,4,2,2,4,2,4,4,4,2,2,4,4,2,2,2,3,2,4,4,4,2,2,2,2,2,4,2,2,2,4(...TRUNCATED) | {"language":[2,3,3,2,2,3,2,4,3,3,2,2,4,4,4,2,4,4,4,4,3,2,4,3,2,2,2,2,2,3,2,2,2,2,2,3,4,4,4,2,4,2,4,3(...TRUNCATED) | 1,136 | 0 | 0 | [
"brute force"
] | false | {
"nanos": 0,
"seconds": 2
} | 512,000,000 | ||||
p03407 AtCoder Beginner Contest 091 - Two Coins | "Recently, Pari and Arya did some research about NP-Hard problems and they found the minimum vertex (...TRUNCATED) | {"input":["4\n1000000000 1000000\n1000000000 1000000\n100000000 1000000\n1000000000 1000000\n","3\n9(...TRUNCATED) | {"input":["5\ncbbbb\nbcbbb\naacbb\naaacb\naaaac\n","20\nbifcabiabgfibfccdbgd\ncffaheagahcbacafbgeb\n(...TRUNCATED) | {"input":["5\n0 0\n2 1\n1 1\n2 2\n0 2","4\n0 0\n3 0\n2 1\n0 3","4\n0 0\n3 1\n2 1\n0 3","5\n0 0\n3 1\(...TRUNCATED) | 2 | 1 | {"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) | {"language":[2,1,2,2,3,2,2,2,2,2,2,3,3,2,2,2,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,3,0,2,2,2,2(...TRUNCATED) | 793 | 0 | 0 | [
"greedy",
"two pointers"
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | ||||
1277_E. Two Fairs | "Igor is a post-graduate student of chemistry faculty in Berland State University (BerSU). He needs (...TRUNCATED) | {
"input": [
"8\n1 2 3 4 5 6 7 8\n",
"4\n1 0 1 2\n"
],
"output": [
"1\n3\n6\n10\n16\n24\n40\n",
"1\n1\n3\n"
]
} | {"input":["66\n","652615\n","482331\n","336161\n","33\n","1000000\n","79531\n","768208\n","3\n","885(...TRUNCATED) | {"input":["4\naaa\nabc\nabdbca\nabca","4\naaa\nabc\nabdbc`\naaca","4\naab\nacc\n`bd`cb\naaad","4\nba(...TRUNCATED) | 5 | 12 | {
"language": [],
"solution": []
} | {"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,277 | A | 1,000 | 1,600 | [
"implementation",
"math"
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | |||
bobs-journey-5 | "You've got an array a, consisting of n integers. The array elements are indexed from 1 to n. Let's (...TRUNCATED) | {
"input": [
"4\n1 14\n1 50\n4 28\n5 700\n\nSAMPLE"
],
"output": [
"1\n10\n3\n32491"
]
} | {
"input": [],
"output": []
} | {"input":["100 1 7\n83\n174\n191\n145\n167\n55\n232\n157\n51\n209\n85\n73\n216\n39\n72\n76\n132\n70\(...TRUNCATED) | 2 | 10 | {"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": [],
"solution": []
} | 295 | C | 2,500 | 0 | [] | false | {
"nanos": 0,
"seconds": 5
} | 0 | |||
p03225 Tenka1 Programmer Contest - Equilateral | "James Bond has a new plan for catching his enemy. There are some cities and directed roads between (...TRUNCATED) | {"input":["1 8\n2 8 81\n","2 30\n20 30 80\n3 9 85\n","4 319\n63 79 89\n79 97 91\n75 87 88\n75 90 83\(...TRUNCATED) | {"input":["85 30 123\n","100000 100000 1320777\n","94728 36278 300352\n","70386 4182 113682\n","6518(...TRUNCATED) | {"input":["010\n"],"output":["1 2 3 4 5 6 7 8 9 \n2 4 6 8 10 12 14 16 18 \n3 6 9 12 15 18 21 24 27 \(...TRUNCATED) | 5 | 10 | {"language":[2,2,3,1,3,1,2,3,4,3,3,4,1,3,1,1,3,1,1,3,3,4,3,4,3,2,2,3,3,4,2,1,2,2,4,2,1,4,3,3,4,4,2,3(...TRUNCATED) | {"language":[2,4,4,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,4,2,2,4,2,2,4,2,2,4,2,4,2,2,2,2,2,2,2,2,2,4,2,4,2(...TRUNCATED) | 1,408 | 0 | 3,000 | [] | false | {
"nanos": 0,
"seconds": 1
} | 512,000,000 | ||||
1216_D. Swords | "Takahashi is locked within a building.\n\nThis building consists of H×W rooms, arranged in H rows (...TRUNCATED) | {"input":["5 18 1000\n","132 10 35\n","48 132 235\n","2 2 1\n"],"output":["-1","5 7\n","22 111","1 1(...TRUNCATED) | {"input":["1000\n999001\n999002\n999003\n999004\n999005\n999006\n999007\n999008\n999009\n999010\n999(...TRUNCATED) | {"input":["9 3 23\n9 3 22\n10 3 28\n16 10 107\n20 8 102\n20 10 105\n20 10 155\n3 5 3\n4 2 11\n0 0 0"(...TRUNCATED) | 2 | 7 | {"language":[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,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | {
"language": [],
"solution": []
} | 1,311 | B | 0 | 1,600 | [
"data structures",
"greedy",
"implementation"
] | false | {
"nanos": 0,
"seconds": 1
} | 268,435,456 |
End of preview. Expand in Data Studio
edition_2530_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
- 3