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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
277_C. Game | "Now that Chef has finished baking and frosting his cupcakes, it's time to package them. Chef has N (...TRUNCATED) | {"input":["3\ncan you meet me outside ccd today\na\nthis year hard kaur is coming to entertain us"],(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["3,4,5\n5,5,8\n4,5,4\n5,4,3","3,3,5\n5,5,8\n4,4,4\n5,4,3","3,4,5\n5,5,8\n4,5,4\n3,4,5","3,(...TRUNCATED) | 3 | 8 | {"language":[2,2,2,2,2,3,2,4,2,2,4,2,3,2,2,2,2,2,2,2,4,4,2,2,2,2,4,2,4,2,2,2,2,3,4,2,2,2,2,4,1,2,2,4(...TRUNCATED) | {
"language": [],
"solution": []
} | 0 | F | 0 | 0 | [
"*special",
"implementation"
] | false | {
"nanos": 0,
"seconds": 2
} | 512,000,000 | |||
784_B. Kids' Riddle | "Let's denote a function \n\n<image>\n\nYou are given an array a consisting of n integers. You have (...TRUNCATED) | {
"input": [
"7\nabacaba\n",
"3\naaa\n",
"2\nab\n",
"4\nbabb\n"
],
"output": [
"589\n",
"1\n",
"3\n",
"11\n"
]
} | {
"input": [],
"output": []
} | {"input":["5 5\n-993655555 -758584352 -725954642 -696391700 -649643547\n-591473088 -568010221 -43211(...TRUNCATED) | 5 | 7 | {"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,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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 582 | 500 | 0 | [] | true | {
"nanos": 0,
"seconds": 5
} | 256,000,000 | ||||
p00781 Lattice Practices | "Pavel loves grid mazes. A grid maze is an n × m rectangle maze where each cell is either empty, or(...TRUNCATED) | {"input":["2 10\n0 0\n10000 0","4 50\n0 10000\n1 10000\n2 0\n10000 0","5 10\n0 0\n10 10\n20 0\n30 10(...TRUNCATED) | {"input":["6\n396640239 62005863 473635171 329666981 510631133 207643327\n","4\n363034183 741262741 (...TRUNCATED) | {"input":["5 5 2\ns..#a\n.#...\ne#a.#\n...#a\n.#...","5 5 2\ns..#a\n.#../\n#.a#e\n...#a\n.#...","5 5(...TRUNCATED) | 2 | 11 | {"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,4,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2],"solution":["#include<(...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 | C | 2,000 | 2,200 | [
""
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
jumping-frog | "Golu is given a task of clearing coins fallen down on floor. Naughty being his modus operandi, he (...TRUNCATED) | {"input":["3 8 41\n1 3 2\n1 6 4 3 5 7 2 8\n","1 2 31\n1\n1 2\n","4 2 4\n4 2 3 1\n2 1\n"],"output":["(...TRUNCATED) | {"input":["10 7\n1 10\n2 10\n3 10\n4 10\n5 10\n1 2\n1 3\n1 4\n1 5\n1 6\n","2 2\n1 1\n1 1\n","20 12\n(...TRUNCATED) | {"input":["252662256 275638265\n","10 10\n","38 38\n","141650963 236544475\n","9 12\n","1002523 1700(...TRUNCATED) | 6 | 8 | {"language":[2,4,2,2,2,2,2,4,4,2,2,4,2,2,2,3,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,4,2,2,2,2,2(...TRUNCATED) | {"language":[2,2,2,0,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,0,0,0,2,0,2,2,2,2,0,2,2,0,2,2,0,2,2,2,2,0,2,0,2,2(...TRUNCATED) | 0 | 1,250 | 0 | [
"implementation",
"math"
] | false | {
"nanos": 0,
"seconds": 6
} | 1,073,741,824 | ||||
palin-pairs | "Kevin Sun has just finished competing in Codeforces Round #334! The round was 120 minutes long and (...TRUNCATED) | {
"input": [
"3 2 1\n",
"3 2 2\n",
"4 2 2\n"
],
"output": [
"2\n",
"4\n",
"4\n"
]
} | {"input":["9 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","5 4\n2 1\n3 2\n4 3\n(...TRUNCATED) | {
"input": [],
"output": []
} | 6 | 10 | {"language":[2,4,3,3,3,1,3,4,2,2,3,3,3,3,3,3,3,3,3,3,3,4,3,3,2,3,4,4,3,3,3,4,3,3,4,3,3,4,2,4,3,3,3,3(...TRUNCATED) | {"language":[2,2,2,4,2,3,4,4,2,2,4,4,1,1,4,4,2,4,4,2,1,2,2,2,2,2,4,2,2,2,2,4,2,3,4,3,1,4,2,2,2,2,2,3(...TRUNCATED) | 1,428 | D | 500 | 0 | [
"math"
] | false | {
"nanos": 0,
"seconds": 2
} | 268,435,456 | |||
851_B. Arpa and an exam about geometry | "Fox Ciel is playing a game. In this game there is an infinite long tape with cells indexed by integ(...TRUNCATED) | {"input":["5\n2 1\n5 2\n10 3\n25 4\n15441 33\n"],"output":["\nUtkarsh\nAshish\nUtkarsh\nUtkarsh\nAsh(...TRUNCATED) | {"input":["1 1\na\n10\n","1 20\naaaaaaaaaaaaaaaaaaaa\n924705 786913 546594 427698 741583 189683 3540(...TRUNCATED) | {
"input": [],
"output": []
} | 2 | 7 | {"language":[2,2,4,2,2,2,3,3,4,3,2,3,3,3,2,2,3,4,2,2,3,4,3,3,2,3,2,3,2,3,4,3,3,2,3,3,2,4,2,2,2,4,3,2(...TRUNCATED) | {"language":[2,2,2,4,4,4,2,4,2,2,1,4,4,2,1,2,2,4,4,2,2,2,4,4,2,2,2,3,4,2,2,2,4,2,2,4,3,2,2,2,4,2,3,2(...TRUNCATED) | 1,354 | 2,500 | 0 | [] | false | {
"nanos": 0,
"seconds": 1
} | 0 | ||||
1547_C. Pair Programming | "There are n people and k keys on a straight line. Every person wants to get to the office which is (...TRUNCATED) | {
"input": [
"5 1\nbacba",
"10 2\nbbaabbbaab"
],
"output": [
"aabca",
"aaaabbaabb"
]
} | {"input":["64 63\n11 51\n64 11\n64 39\n11 6\n24 64\n51 63\n43 51\n64 29\n6 22\n47 6\n1 47\n41 22\n41(...TRUNCATED) | {"input":["5 7\nqcezchs\nhhedywq\nwikywqy\nqckrpzt\nbqexcxz\n3 2\n??\nyw\n?q\n","8 10\ncwcwcwcwcw\nc(...TRUNCATED) | 2 | 0 | {"language":[2,2,2,4,2,4,2,4,4,4,4,2,4,2,4,2,4,3,2,2,2,4,2,2,2,2,1,4,4,4,4,2,2,2,2,4,4,2,4,4,2,4,2,3(...TRUNCATED) | {
"language": [],
"solution": []
} | 101 | 1,000 | 0 | [
"geometry",
"math"
] | false | null | 256,000,000 | ||||
even-from-end-1 | "Nadeko's birthday is approaching! As she decorated the room for the party, a long garland of Dianth(...TRUNCATED) | {
"input": [
"56 25 31",
"10 30 20",
"30 30 100"
],
"output": [
"Yes",
"Yes",
"No"
]
} | {
"input": [],
"output": []
} | {
"input": [],
"output": []
} | 3 | 12 | {"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,4,2,2,2,2,2,2,4,2,2,2,4(...TRUNCATED) | {"language":[2,2,3,2,4,4,2,4,4,4,2,3,3,2,2,2,2,3,2,3,4,4,2,4,2,2,4,3,2,4,4,3,2,2,3,4,4,3,3,4,3,2,2,3(...TRUNCATED) | 366 | F | 0 | 0 | [
"implementation"
] | false | {
"nanos": 0,
"seconds": 2
} | 134,217,728 | |||
acdemy | "Mister B once received a gift: it was a book about aliens, which he started read immediately. This (...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":["? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ?(...TRUNCATED) | {"input":["2\n4 1\n2 15 36 43 \n3 2\n27 29 35 \n\nSAMPLE","2\n4 1\n4 15 36 43 \n3 2\n27 29 35 \n\nSA(...TRUNCATED) | 2 | 7 | {"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,2,2,2,2,2,2,2,2,2,2,2,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,4,2,2(...TRUNCATED) | 0 | A | 1,000 | 0 | [
"*special",
"implementation"
] | false | null | 0 | |||
1348_F. Phoenix and Memory | "Coach Ankit is forming a team for the Annual Inter Galactic Relay Race. He has N students that trai(...TRUNCATED) | {"input":["5\n12\n5 4 4 3 2 2 1 1 1 1 1 1\n4\n4 3 2 1\n1\n1000000\n20\n20 19 18 17 16 15 14 13 12 11(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["5 9 4\n4 1 46\n1 3 29\n3 2 58\n1 5 61\n2 4 175\n1 2 87\n4 5 58\n3 5 69\n3 4 28\n2 7\n5 7\(...TRUNCATED) | 6 | 0 | {"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,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) | 0 | E | 500 | 0 | [
"constructive algorithms",
"dp"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 |
End of preview. Expand in Data Studio
edition_0694_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