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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
the-competitive-class-3 | "We know that lucky digits are digits 4 and 7, however Vasya's got another favorite digit 0 and he a(...TRUNCATED) | {"input":["3 3\n0 0 0 1\n0 2 2 2\n3 3 2 3\n12\n0 0 L 0\n0 0 L 1\n0 0 L 2\n0 0 L 3\n0 0 L 4\n0 0 L 5\(...TRUNCATED) | {"input":["3\n3 2 3\n","3\n1 3 1\n","5\n1 1 2 1 1\n","5\n1 1 1 1 2\n","4\n562617869 562617869 562617(...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) | 2 | 11 | {"language":[4,2,2,2,2,4,3,2,2,2,2,2,2,4,3,4,4,4,1,4,3,4,3,3,2,4,2,3,1,4,3,4,4,2,2,3,3,3,3,3,3,1,4,1(...TRUNCATED) | {"language":[0,3,0,2,4,0,0,4,0,0,3,1,3,4,0,2,2,0,2,3,2,2,4,4,0,3,4,4,4,2,0,0,2,0,2,3,0,0,0,0,0,0,2,0(...TRUNCATED) | 633 | B | 0 | 1,900 | [
"constructive algorithms",
"games",
"interactive"
] | false | null | 256,000,000 | |||
39_E. What Has Dirichlet Got to Do with That? | "You are given an undirected graph consisting of n vertices and <image> edges. Instead of giving you(...TRUNCATED) | {
"input": [
"2\n3\n10"
],
"output": [
"1\n3"
]
} | {"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":["2\n1 1 1 1 1 0 0 0 0 0\n0 0 0 0 0 1 1 1 1 1\n0 -2 -2 -2 -2 -2 -1 -1 -1 -1 -1\n0 -2 -2 -2 (...TRUNCATED) | 6 | 9 | {
"language": [],
"solution": []
} | {"language":[2,2,2,2,2,2,2,2,4,2,2,2,2,4,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,4,1,2,2,2,2(...TRUNCATED) | 319 | H | 2,000 | 1,800 | [
"data structures",
"greedy",
"two pointers"
] | true | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
925_E. May Holidays | "Grigory has n magic stones, conveniently numbered from 1 to n. The charge of the i-th stone is equa(...TRUNCATED) | {"input":["5\n0 0\n0 2\n2 0\n2 2\n1 1\n","9\n0 0\n1 1\n2 2\n0 1\n1 0\n0 2\n2 0\n1 2\n2 1\n"],"output(...TRUNCATED) | {"input":["81\n9 4\n6 8\n6 4\n4 6\n4 8\n9 10\n0 2\n5 4\n8 9\n7 7\n10 5\n4 4\n7 8\n3 7\n2 1\n5 5\n2 7(...TRUNCATED) | {"input":["500 500 0 0 107 200","4 1 0 0 1 1","4 4 1 0 3 3","2 3 0 0 1 1","500 500 0 0 107 239","2 1(...TRUNCATED) | 5 | 0 | {"language":[2,2,2,4,4,3,4,2,2,4,3,2,2,2,2,2,1,4,2,2,2,2,2,2,2,4,4,4,4,4,4,4,4,4,2,2,2,4,2,2,2,4,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],"solution":["#include <bits/stdc++.h>\nu(...TRUNCATED) | 354 | D | 1,750 | 2,000 | [
"binary search",
"dp",
"sortings",
"two pointers"
] | false | {
"nanos": 500000000,
"seconds": 0
} | 1,073,741,824 | |||
p00720 Earth Observation with a Mobile Robot Team | "Greg has a pad. The pad's screen is an n × m rectangle, each cell can be either black or white. We(...TRUNCATED) | {
"input": [
"16\n.**.*..*.***.**.\n",
"11\n.*.*...*.*.\n"
],
"output": [
"yes",
"no"
]
} | {
"input": [],
"output": []
} | {
"input": [],
"output": []
} | 2 | 8 | {"language":[3,4,4,2,2,4,2,4,4,2,4,2,4,2,4,3,2,1,3,2,3,3,2,4,3,3,3,3,2,3,3,2,3,4,2,2,3,2,4,4,4,3,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,2,2,2,2,2,2,2(...TRUNCATED) | 1,129 | 0 | 2,400 | [
"dp",
"math",
"number theory"
] | false | {
"nanos": 0,
"seconds": 1
} | 512,000,000 | ||||
937_D. Sleepy Game | "You are given an array of n positive integers a_1, a_2, ..., a_n. You can perform the following ope(...TRUNCATED) | {
"input": [
"0 1 1 1 1 0\n",
"1 1 0 0 1000 1000\n"
],
"output": [
"Yes\n",
"No\n"
]
} | {
"input": [],
"output": []
} | {"input":["51\n1732111733638718702525811518175029394157760329139501\n","55\n815096522892298714932212(...TRUNCATED) | 2 | 11 | {"language":[1,3,2,2,2,3,4,2,4,3,3,3,2,3,1,3,3,3,3,3,3,2,3,4,3,3,4,3,3,3,3,3,4,3,4,2,3,3,2,3,4,3,3,3(...TRUNCATED) | {"language":[3,4,3,4,4,2,2,2,4,3,2,3,1,4,2,4,4,2,3,2,3,2,3,2,2,3,2,2,2,4,4,2,2,3,4,2,1,3,4,3,3,3,4,1(...TRUNCATED) | 0 | 3,000 | 1,300 | [
"constructive algorithms",
"math"
] | true | {
"nanos": 0,
"seconds": 2
} | 1,073,741,824 | ||||
83_C. Track | "Differential pulse code modulation is one of the compression methods mainly used when compressing a(...TRUNCATED) | {
"input": [
"1000 352 146\n",
"10 1 14\n",
"20 10 50\n"
],
"output": [
"1108\n",
"1\n",
"0\n"
]
} | {"input":["20 20\n00010110100100010111\n11110000001100101110\n01110101110001111000\n1011110100011111(...TRUNCATED) | {"input":["1 3 0\n6 1 4\n","21 6 635\n3 4 2 1 7 7\n","3 7 20012\n1 1 1 1 1 2 10000\n","1 5 44\n2 19 (...TRUNCATED) | 2 | 0 | {"language":[3,3,4,2,1,3,2,3,4,3,2,4,3,3,3,3,3,3,3,1,3,3,3,1,3,2,3,2,3,3,3,1,3,1,1,1,1,4,1,3,2,3,3,3(...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,4,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 593 | B | 0 | 2,900 | [
"constructive algorithms",
"dp",
"flows",
"graph matchings",
"greedy",
"sortings"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
pcsc1 | "Xenia the beginner mathematician is a third year student at elementary school. She is now learning (...TRUNCATED) | {
"input": [
"2\n5 156\n16 40\n\nSAMPLE"
],
"output": [
"Case 1: 6\nCase 2: 3\n"
]
} | {
"input": [
"1 1\n1\n1\n1\n"
],
"output": [
"0\n"
]
} | {
"input": [],
"output": []
} | 3 | 9 | {"language":[3,2,2,4,3,4,4,3,3,3,2,1,1,2,3,2,4,4,3,4,3,4,3,2,3,4,1,3,1,3,3,3,1,2,3,1,2,4,3,4,1,3,3,3(...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) | 0 | A | 1,000 | 1,600 | [] | false | {
"nanos": 500000000,
"seconds": 2
} | 268,435,456 | |||
670_B. Game of Robots | "Professor just has checked all the N students tests. Everything was fine but then he realised that(...TRUNCATED) | {"input":["+Mike\nMike:hello\n+Kate\n+Dmitry\n-Dmitry\nKate:hi\n-Kate\n","+Mike\n-Mike\n+Mike\nMike:(...TRUNCATED) | {"input":["2 2 1\n0 1 1 1\n","5 5 20\n3 1 3 3\n1 2 2 2\n4 3 4 2\n3 2 2 2\n3 4 2 4\n4 1 4 5\n4 3 5 3\(...TRUNCATED) | {"input":["10\n4643665 282618243 791521863 214307200 976959598 590907019 166397456 708291256 8537738(...TRUNCATED) | 2 | 0 | {"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": [],
"solution": []
} | 670 | D | 2,500 | 0 | [
"binary search",
"brute force",
"dp",
"greedy",
"sortings"
] | false | {
"nanos": 0,
"seconds": 2
} | 0 | |||
rams-love-for-sita-2 | "Alice had a permutation p_1, p_2, …, p_n. Unfortunately, the permutation looked very boring, so s(...TRUNCATED) | {"input":["4 1111\n1 10 100 1000","3 70\n20 30 10","3 10\n20 30 10","2 10\n20 20"],"output":["4","2"(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["10\n669924290 408119795 283272835\n663737793 250734602 29671646\n431160679 146708815 2894(...TRUNCATED) | 2 | 9 | {
"language": [],
"solution": []
} | {"language":[2,2,3,2,2,2,2,2,4,4,4,2,4,2,4,2,2,3,2,2,2,2,2,2,4,4,2,3,2,2,4,2,2,2,2,2,2,3,2,4,4,2,2,4(...TRUNCATED) | 188 | B | 1,250 | 0 | [
"dfs and similar",
"dsu",
"math"
] | false | {
"nanos": 0,
"seconds": 2
} | 0 | |||
abc-garfield | "Manao works on a sports TV. He's spent much time watching the football games of some country. After(...TRUNCATED) | {
"input": [
"2\nacxz\nbcxz\n\nSAMPLE"
],
"output": [
"Funny\nNot Funny\n"
]
} | {
"input": [],
"output": []
} | {"input":["15 6\n1 6 6 5 2 10 4 4 14 8 7 3 5 1 2\n","65 7\n1 5 4 1 4 11 9 1 11 7 6 11 9 4 2 6 10 11 (...TRUNCATED) | 2 | 0 | {"language":[4,3,4,2,4,4,3,3,4,2,2,2,2,3,4,2,3,3,3,3,4,3,2,4,2,3,4,4,3,4,3,4,3,2,2,2,3,2,2,2,3,3,2,2(...TRUNCATED) | {"language":[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,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 1,250 | E | 500 | 0 | [
"math"
] | false | null | 256,000,000 |
End of preview. Expand in Data Studio
edition_2827_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
- 15