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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
354_B. Game with Strings | "Dima and Inna love spending time together. The problem is, Seryozha isn't too enthusiastic to leave(...TRUNCATED) | {
"input": [
"1 -5 6\n"
],
"output": [
"2\n2.000000\n3.000000\n"
]
} | {"input":["3\n5 2\n5 3\n7 0\n5 0\n4 0\n10 0\n2 1\n10 100\n50 10\n5 5\n1 5\n2 4\n3 3\n4 2\n5 1\n"],"o(...TRUNCATED) | {
"input": [],
"output": []
} | 2 | 0 | {"language":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"solut(...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) | 1,325 | E | 0 | 900 | [
"binary search",
"data structures",
"divide and conquer",
"greedy",
"implementation"
] | false | null | 256,000,000 | |||
793_F. Julia the snail | "Chouti thought about his very first days in competitive programming. When he had just learned to wr(...TRUNCATED) | {"input":["3\n7 7 3 5\n1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n7 5\n4 5 2 3\n1 2\n2 3\n3 4\n4 1\n4 2\n4 3 2 1\(...TRUNCATED) | {"input":["5 3\n","1500 2000\n","500 1000\n","1000 1000\n","5 5\n","2000 2\n","1000 500\n","3 1000\n(...TRUNCATED) | {"input":["1 15\n15\n1\n","1 22\n15\n1\n","1 15\n4\n1\n","4 3\n0 0 2 1\n2 0 1 0\n","1 15\n15\n2\n","(...TRUNCATED) | 2 | 12 | {"language":[3,2,4,3,3,3,3,2,3,3,3,3,4,3,3,3,3,4,3,4,3,3,3,3,3,3,2,3,1,2,3,3,3,3,4,1,3,2,3,3,4,4,3,3(...TRUNCATED) | {"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,3,2,1,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 272 | 0 | 1,800 | [
"games",
"math",
"number theory"
] | false | {
"nanos": 500000000,
"seconds": 0
} | 256,000,000 | ||||
lucky5 | "Treeland consists of n cities and n-1 two-way roads connecting pairs of cities. From every city, yo(...TRUNCATED) | {
"input": [
"4\n2 5\n9 7\n15 6\n9 3"
],
"output": [
"3"
]
} | {
"input": [],
"output": []
} | {"input":["3\n7089544 9134148 -5332724\n368810 1638695 13258988\n-3866235 -4257263 5802154\n","16\n-(...TRUNCATED) | 2 | 2 | {"language":[2,2,4,2,4,2,3,4,2,4,2,4,2,4,2,2,4,2,2,2,2,4,2,2,2,4,2,4,2,4,4,2,2,4,1,2,2,2,2,2,2,2,2,3(...TRUNCATED) | {"language":[2,4,4,3,2,3,2,2,3,2,3,3,4,3,4,4,4,2,2,2,4,2,4,4,3,2,3,1,4,2,3,4,3,2,2,2,2,4,2,2,3,2,2,2(...TRUNCATED) | 1,297 | B | 500 | 1,400 | [
"binary search",
"data structures"
] | true | {
"nanos": 0,
"seconds": 2
} | 134,217,728 | |||
chandu-and-daspal-2 | "You are given two permutations p and q, consisting of n elements, and m queries of the form: l1, r1(...TRUNCATED) | {"input":["2\n1 2\n","3\n1 2\n2 3\n","5\n1 2\n1 3\n1 4\n2 5\n","6\n1 2\n1 3\n1 4\n2 5\n2 6\n"],"outp(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["14\n4 9\n3 7\n4 1\n3 2\n14 9\n7 6\n10 13\n8 7\n5 7\n7 10\n1 3\n12 3\n7 11\n20\n13 6 14 9 (...TRUNCATED) | 3 | 0 | {"language":[2,2,2,4,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(...TRUNCATED) | {
"language": [],
"solution": []
} | 670 | D | 1,000 | 0 | [
"flows",
"shortest paths"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
1297_E. Modernization of Treeland | "Jiro is a fun loving lad. His classmates are very competitive and are striving for getting a good r(...TRUNCATED) | {
"input": [
"3\n1 2 4\n",
"3\n5 3 1\n"
],
"output": [
"3",
"1"
]
} | {"input":["1 100000 100000 100000 -100000\n","46456 -2621 -23623 -98302 -99305\n","9 20 0 40 0\n","1(...TRUNCATED) | {"input":["20\n9 4 8\n10 6 7\n4 6 0\n7 7 6\n3 6 10\n4 2 1\n4 4 0\n2 0 0\n8 8 7\n3 1 7\n3 10 7\n1 7 3(...TRUNCATED) | 5 | 0 | {"language":[2,2,2,2,2],"solution":["\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define int (...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) | 76 | 500 | 2,100 | [
"greedy",
"two pointers"
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | ||||
1547_C. Pair Programming | "We have caught N sardines. The deliciousness and fragrantness of the i-th sardine is A_i and B_i, r(...TRUNCATED) | {
"input": [
"??00????0??0????0?0??00??1???11?1?1???1?11?111???1",
"0??0",
"0??"
],
"output": [
"4",
"2",
"1"
]
} | {
"input": [],
"output": []
} | {"input":["4 20\n4 2 3 1\n2 2\n1 4\n2 2\n1 1\n3 3\n3 3\n1 4\n3 3\n2 2\n3 3\n4 1\n2 2\n1 4\n3 3\n3 1\(...TRUNCATED) | 3 | 0 | {"language":[4,2,2,2,2,2,4,2,4,2,2,4,2,4,2,2,4,4,2,3,2,2,2,4,4,4,2,2,2,2,4,4,2,2,4,2,4,3,2,2,4,4,4,2(...TRUNCATED) | {"language":[4,4,1,3,4,1,4,2,3,4,3,1,3,2,4,4,4,1,1,3,2,4,4,4,2,2,4,2,4,2,4,4,1,2,2,4,1,1,4,4,2,2,4,3(...TRUNCATED) | 0 | B | 1,750 | 0 | [
"binary search",
"geometry",
"ternary search"
] | false | {
"nanos": 0,
"seconds": 2
} | 268,435,456 | |||
25_D. Roads not only in Berland | "A permutation of length n is an array consisting of n distinct integers from 1 to n in arbitrary or(...TRUNCATED) | {"input":["5 4\n1 2 3 4 5\n1 3 5 6\n","3 3\n1 2 3\n3 2 1\n","4 6\n1 3 5 2\n1 2 3 4 5 6\n"],"output":(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["100\n303\n5","100\n256\n5","100\n407\n5","100\n407\n2","100\n407\n3","100\n407\n6","100\n(...TRUNCATED) | 6 | 8 | {"language":[1],"solution":["testcase = raw_input();\ntc = int(testcase)\n\nwhile (tc > 0):\n\t\n\t(...TRUNCATED) | {"language":[2,4,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2(...TRUNCATED) | 1,281 | 1,750 | 0 | [
"brute force",
"implementation"
] | false | {
"nanos": 0,
"seconds": 3
} | 256,000,000 | ||||
1199_E. Matching vs Independent Set | "You have a string s — a sequence of commands for your toy robot. The robot is placed in some cell(...TRUNCATED) | {
"input": [
"7\n1 1 2 2 3 3 3\n",
"10\n1 1 1 5 4 1 3 1 2 2\n",
"1\n1\n"
],
"output": [
"6\n",
"7\n",
"0\n"
]
} | {"input":["66\n","652615\n","482331\n","336161\n","33\n","1000000\n","79531\n","768208\n","3\n","885(...TRUNCATED) | {"input":["1","0010","11011010001001","11001010001001","11001000001001","1010","01001000101000","110(...TRUNCATED) | 2 | 11 | {"language":[1,4,2,4,2,3,4,4,2,4,3,4,2,2,4,4,3,1,2,1,1,2,4,2,4,4,4,4,2,4,4,2,2,3,2,4,2,2,2,4,1,1,2,3(...TRUNCATED) | {"language":[3,2,0,2,0,2,2,3,0,2,2,2,3,2,2,3,2,2,2,2,2,2,4,4,2,2,2,3,3,2,2,3,2,2,3,3,3,2,3,2,2,0,3,2(...TRUNCATED) | 223 | D | 500 | 2,200 | [
"implementation"
] | true | {
"nanos": 0,
"seconds": 8
} | 256,000,000 | |||
1500_B. Two chandeliers | "Polycarpus enjoys studying Berland hieroglyphs. Once Polycarp got hold of two ancient Berland pictu(...TRUNCATED) | {"input":["5 3\n1 2 3 4 0\n4 1 2 14 3\n","7 3\n1 2 3 4 3 2 6\n6 3 1 4 2 2 3\n","4 4\n0 1 2 3\n0 1 2 (...TRUNCATED) | {"input":["#(#(#((##((()))(((#)(#()#(((()()(()#(##(((()(((()))#(((((()(((((((()#((#((()(#(((()(()##((...TRUNCATED) | {"input":["1 1\n2\n2\n","1 1\n2\n1\n","10 10\n1 2 3 4 5 6 7 8 9 10\n6 7 8 9 10 1 0 3 4 5\n","10 10\n(...TRUNCATED) | 2 | 0 | {"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,4,2,4,2,2,2,2,4,2,2,2,4,2,2,2,2,2,2,4,2,4,2,2,2,2,2,4,4,2,4,2,4,2,2,2,2,2,2,4(...TRUNCATED) | 519 | 500 | 2,200 | [] | false | {
"nanos": 0,
"seconds": 1
} | 536,870,912 | ||||
1117_F. Crisp String | "Print the circumference of a circle of radius R.\n\nConstraints\n\n* 1 \\leq R \\leq 100\n* All val(...TRUNCATED) | {
"input": [
"3\n4251\n52310\n00006\n\nSAMPLE"
],
"output": [
"12\n56\nunlucky"
]
} | {
"input": [],
"output": []
} | {"input":["5\n5\n1 3\n1 4\n2 2\n3 5\n1 1\n5\n1 3\n3 5\n3 5\n1 4\n4 5\n","1\n0\n1 1\n1\n1 1\n","10\n1(...TRUNCATED) | 2 | 7 | {"language":[2,2,3,3,2,3,1,4,3,4,2,4,1,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,3,2,3,3,2,2,4,2,4,2,4,4,2,3,4(...TRUNCATED) | {"language":[2,2,3,3,2,2,2,2,0,3,2,2,2,3,2,2,2,3,3,3,2,3,2,3,2,0,2,3,2,4,0,3,3,3,0,2,4,3,2,3,3,2,1,0(...TRUNCATED) | 0 | D | 0 | 3,100 | [
"binary search",
"dp"
] | false | {
"nanos": 0,
"seconds": 1
} | 512,000,000 |
End of preview. Expand in Data Studio
edition_2429_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