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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
p01222 Walk under a Scorching Sun | "BigData Inc. is a corporation that has n data centers indexed from 1 to n that are located all over(...TRUNCATED) | {
"input": [
"1 2 88 42 99 -1"
],
"output": [
"1 2 154 60 201"
]
} | {
"input": [],
"output": []
} | {"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 | 13 | {"language":[1],"solution":["mod=10**9+7\nA=[[0 for i in range(105)] for j in range(105)]\nB=[0]*105(...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) | 670 | 2,000 | 0 | [] | false | {
"nanos": 0,
"seconds": 5
} | 268,435,456 | ||||
professor-sharma | "Once upon a time, there was a king who loved beautiful costumes very much. The king had a special c(...TRUNCATED) | {"input":["4\n..E.\n.AD.\nB...\n..C.\nD\n4\n..E.\n.AD.\nB...\n..C.\nDR\n3\n...\n.A.\nBC.\n((URD)3L)2(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["3\n1 0 6\n","10\n7 7 7 7 7 7 7 7 7 3\n","76\n13 13 5 6 20 20 6 1 18 18 13 15 20 3 9 11 3 (...TRUNCATED) | 6 | 7 | {"language":[3,2,2,2,4,2,2,2,3,3,2,2,4,2,2,2,2,4,2,2,2,2,2,4,2,4,4,2,2,2,2,4,2,4,3,2,2,2,4,2,4,2,2,2(...TRUNCATED) | {"language":[2,2,4,2,4,2,2,4,4,4,4,2,2,2,2,2,2,2,2,2,2,4,4,1,2,2,2,3,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2(...TRUNCATED) | 83 | 0 | 1,900 | [
"constructive algorithms",
"greedy",
"sortings"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | ||||
p02365 Minimum-Cost Arborescence | "Print the K-th element of the following sequence of length 32:\n\n\n1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1(...TRUNCATED) | {
"input": [
"5\n1 2 0\n1 3 0\n3 5 0\n3 4 0\n5\n3\n4\n1\n3\n4\n"
],
"output": [
"3\n2\n3\n3\n2\n"
]
} | {
"input": [],
"output": []
} | {"input":["20 20\n1 9\n11 9\n3 5\n15 13\n1 20\n11 18\n10 6\n10 8\n10 19\n12 16\n10 3\n9 18\n8 7\n15 (...TRUNCATED) | 2 | 0 | {"language":[2,2,2,2,2,2,4,4,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,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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 1,211 | A | 500 | 1,700 | [
"brute force",
"implementation"
] | false | {
"nanos": 0,
"seconds": 5
} | 256,000,000 | |||
283_D. Cows and Cool Sequences | "Berland Government decided to improve relations with neighboring countries. First of all, it was de(...TRUNCATED) | {
"input": [
"1\n5 3\n200 6 9"
],
"output": [
"120"
]
} | {"input":["7\n576460752303423487 2\n82 9\n101 104\n10 21\n31 10\n0 1\n10 30\n","1\n12881797281728299(...TRUNCATED) | {"input":["aa\n2\nbb\nbc\n","th\n1\nht\n","bb\n1\nab\n","bn\n100\ndf\nyb\nze\nml\nyr\nof\nnw\nfm\ndw(...TRUNCATED) | 2 | 7 | {"language":[2,2,3,3,1,3,4,3,2,2,4,3,2,4,2,4,4,4,3,3,2,4,3,2,2,2,3,2,3,4,2,3,2,2,4,4,3,3,2,3,4,3,3,2(...TRUNCATED) | {"language":[2,4,2,2,2,2,2,2,2,2,3,0,2,3,2,2,0,2,2,3,0,2,2,2,2,3,3,2,3,4,3,3,2,3,2,0,2,2,2,0,3,4,0,2(...TRUNCATED) | 0 | D | 500 | 1,000 | [
""
] | false | {
"nanos": 0,
"seconds": 5
} | 256,000,000 | |||
1081_D. Maximum Distance | "You can't possibly imagine how cold our friends are this winter in Nvodsk! Two of them play the fol(...TRUNCATED) | {"input":["8\n1 2 100\n1 3 20\n2 4 2\n2 5 1\n3 6 1\n3 7 2\n6 8 5\n6\n1 8\n2 3\n5 8\n2 6\n4 7\n6 1\n"(...TRUNCATED) | {"input":["6\n0 1 3 2 1 2\n","4\n1 2 3 1\n","4\n1 1 1 2\n","4\n3 3 2 1\n","4\n1 2 1 1\n","4\n1 1 2 1(...TRUNCATED) | {
"input": [],
"output": []
} | 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,3,4,2,2,2,2,2(...TRUNCATED) | {"language":[2,1,4,4,2,2,3,2,4,2,2,2,4,2,2,4,4,2,4,2,2,2,2,3,2,2,2,2,2,2,2,4,3,4,2,1,2,2,4,2,2,4,4,2(...TRUNCATED) | 920 | 0 | 2,200 | [
"data structures",
"implementation"
] | false | null | 256,000,000 | ||||
39_E. What Has Dirichlet Got to Do with That? | "In the rush of modern life, people often forget how beautiful the world is. The time to enjoy those(...TRUNCATED) | {"input":["1\n1\n","2\n1 2\n3 4\n","4\n5 7 8 4\n9 5 3 2\n1 6 6 4\n9 5 7 3\n"],"output":["0\n","2\n",(...TRUNCATED) | {"input":["10 16\n9 8\n1 2\n9 5\n5 4\n9 2\n3 2\n1 6\n5 10\n7 2\n8 2\n3 7\n4 9\n5 7\n10 3\n10 9\n7 8\(...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) | 5 | 0 | {"language":[2,3,4,2,3,2,3,4,3,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,3,4,2,2,2,2,2,2,4,2,2,2,3,3,2,3,2,3(...TRUNCATED) | {"language":[4,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,2,2,2,2,4,2,2,2,2,2(...TRUNCATED) | 0 | C | 0 | 2,000 | [
"binary search",
"data structures",
"dfs and similar",
"dsu",
"shortest paths",
"two pointers"
] | false | {
"nanos": 0,
"seconds": 1
} | 0 | |||
p02741 Panasonic Programming Contest 2020 - Kth Term | "We have caught N sardines. The deliciousness and fragrantness of the i-th sardine is A_i and B_i, r(...TRUNCATED) | {
"input": [
"1\n3 3\n1 2\n2 3\n1 3\n\nSAMPLE"
],
"output": [
"2\n"
]
} | {"input":["99\n3\n5\n7\n9\n11\n13\n15\n17\n19\n21\n23\n25\n27\n29\n31\n33\n35\n37\n39\n41\n43\n45\n4(...TRUNCATED) | {"input":["4 1\n7 6 1 2\n3\n3\n2 1 9\n2 1 10\n2 1 6\n","3 5\n3 2 8\n1 2 8 1 1\n4\n2 3 3\n1 2 2\n2 2 (...TRUNCATED) | 5 | 8 | {"language":[4,2,1,3,3,3,2,3,3,3,3,3,2,4,4,3,3,4,4,2,4,3,1,4,2,3,3,3,3,4,4,2,3,4,2,3,2,1,3,2,3,4,4,2(...TRUNCATED) | {"language":[4,2,1,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,0,0,2,2,2,2,4,2,2,2,3,0,2,2],(...TRUNCATED) | 1,096 | B | 0 | 2,200 | [
"geometry",
"math"
] | false | null | 0 | |||
xenny-and-range-sums | "You are given an infinite checkered field. You should get from a square (x1; y1) to a square (x2; y(...TRUNCATED) | {"input":["1 1\n4 10 0 0 10 0 10 10 0 10\n-5 -20 30 15\n135 45\n0 -15 15 0\n0 0"],"output":["11.213"(...TRUNCATED) | {"input":["51 89 97\n18 25 63\n22 91 74\n","1 100 1\n100 100 100\n1 100 100\n","20 1 1\n100 100 100\(...TRUNCATED) | {"input":["6\n3\n60\n100\n1024\n23456\n8735373\n\nELPMAS","6\n5\n60\n100\n1024\n23456\n8735373\n\nEL(...TRUNCATED) | 1 | 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":[4,2,2,2,2,2,2,4,2,3,2,2,4,2,2,2,2,4,4,2,2,2,2,2,2,2,2,4,2,2,4,3,3,2,2,2,2,4,3,4,2,2,2,4(...TRUNCATED) | 0 | C | 1,750 | 0 | [
"constructive algorithms",
"greedy",
"implementation"
] | false | {
"nanos": 0,
"seconds": 1
} | 1,073,741,824 | |||
76_B. Mice | "We have N integers. The i-th number is A_i.\n\n\\\\{A_i\\\\} is said to be pairwise coprime when GC(...TRUNCATED) | {
"input": [
"5 4\n2 4 8 2 4\n8\n5\n14\n10\n"
],
"output": [
"1\n-1\n3\n2\n"
]
} | {"input":["#(#(#((##((()))(((#)(#()#(((()()(()#(##(((()(((()))#(((((()(((((((()#((#((()(#(((()(()##((...TRUNCATED) | {"input":["2\n4 INDIAN\nCONTEST_WON 1\nTOP_CONTRIBUTOR\nBUG_FOUND 100\nCONTEST_HOSTED\n1 NON_INDIAN\(...TRUNCATED) | 2 | 9 | {"language":[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,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,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 | 0 | 1,200 | [
"binary search",
"brute force",
"dp",
"two pointers"
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | ||||
1369_D. TediousLee | "You are given a sequence of length N: A_1, A_2, ..., A_N. For each integer i between 1 and N (inclu(...TRUNCATED) | {"input":["pozdravstaklenidodiri\nniste\ndobri\n","aaa\na\nb\n","abbbaaccca\nab\naca\n"],"output":["(...TRUNCATED) | {"input":["6\nc armor 0 13 0 3\na weapon 23 0 0 3\nb weapon 20 0 0 4\ne orb 0 0 13 3\nd armor 0 15 0(...TRUNCATED) | {"input":["2 7\n4\n2\n1\n0\n-1\n-2\n-4\n131\n137\n2 7\n4\n2\n1\n0\n-1\n-2\n-4\n124\n123\n10 7\n-4\n-(...TRUNCATED) | 2 | 2 | {"language":[2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,3,2,2,2,2,2,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,3,2,2,2,2,2,2,2(...TRUNCATED) | 931 | A | 1,500 | 3,400 | [
""
] | false | {
"nanos": 0,
"seconds": 2
} | 64,000,000 |
End of preview. Expand in Data Studio
edition_1710_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
- 9