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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
79_D. Password | "BubbleSquare social network is celebrating 13^{th} anniversary and it is rewarding its members with(...TRUNCATED) | {"input":["1\n1 1 0 1 0 0 0 1 0 1\n3 4 5 6 7 8 9 -2 -3 4 -2","3\n1 1 1 1 1 1 0 0 1 1\n0 1 0 1 1 1 1 (...TRUNCATED) | {"input":["2 313 856 964 421\n","61 464 623 89 548\n","37 261 207 1 1000\n","4 202 512 995 375\n","3(...TRUNCATED) | {"input":["3 1\n2 100 1","12 5\n43 94 27 3 69 99 56 25 15 15 46 8","3 1000\n1 101 1","6 24\n25 171 7(...TRUNCATED) | 2 | 2 | {"language":[2,3,2,2,2,2,2,2,2,2,2,2,2,4,2,2,3,4,2,2,2,2,2,2,2,2,2,2,2,4,2,4,4,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | {"language":[2,2,2,2,2,2,2,2,2,4,2,0,2,2,4,2,2,2,2,2,4,2,2,2,2,0,2,2,2],"solution":["#include <bits/(...TRUNCATED) | 1,490 | 1,500 | 0 | [
"dfs and similar",
"interactive",
"trees"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | ||||
425_A. Sereja and Swaps | "Manao works on a sports TV. He's spent much time watching the football games of some country. After(...TRUNCATED) | {"input":["4\n4 3 2 1\n2 3 4 1\n3\n1 2 3 4\n1 3 2 1\n1 4 2 3\n","3\n3 1 2\n3 2 1\n1\n1 2 3 3\n"],"ou(...TRUNCATED) | {"input":["7 9 999999999 0 3\n0 1 0\n1 2 0\n2 3 0\n0 4 1\n4 1 1\n1 5 499999999\n5 2 499999999\n2 6 1(...TRUNCATED) | {"input":["qqqqqqqqqq qqqqqqqq\n3\nqqqqqqqq qqqqqqqqq\nqqqqqqqqq qqqqq\nqqqqq p\n","wwwww w\n8\nwwww(...TRUNCATED) | 6 | 14 | {"language":[4,4,4,4,4,4,4,3,3,2,4,4,4,3,3,4,2,2,4,3,3,3,4,3,1,2,2,3,1,2,4,1,1,4,2,2,4,1,3,3,4,4,4,3(...TRUNCATED) | {"language":[2,2,2,2,2,2,2,2,2,2,2,2,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,2,2,2,2,2,2,2(...TRUNCATED) | 962 | C | 2,750 | 1,100 | [
"implementation",
"math"
] | false | null | 256,000,000 | |||
464_D. World of Darkraft - 2 | "You've got array A, consisting of n integers and a positive integer k. Array A is indexed by intege(...TRUNCATED) | {"input":["47\nS 10\nS 11\nS 12\nS 13\nH 1\nH 2\nS 6\nS 7\nS 8\nS 9\nH 6\nH 8\nH 9\nH 10\nH 11\nH 4\(...TRUNCATED) | {"input":["1\n3\nS01\n111\n00F\n","1\n5\nS0000\n00000\n00000\n00000\n0000F\n","1\n3\nS10\n010\n11F\n(...TRUNCATED) | {"input":["34 20 1\n17 13\n","1 0 0\n","10000 9999 1\n8594 9264\n","98 100 25\n96 100\n97 100\n97 99(...TRUNCATED) | 2 | 0 | {"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":[2,2,2,2,2,2,2,2,2,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,2,2,2(...TRUNCATED) | 687 | D | 500 | 2,900 | [
"math"
] | false | {
"nanos": 0,
"seconds": 1
} | 0 | |||
special-matrix-1 | "Finally Fox Ciel arrived in front of her castle!\n\nShe have to type a password to enter her castle(...TRUNCATED) | {
"input": [
"3 1 3\n\nSAMPLE"
],
"output": [
"833333340"
]
} | {"input":["5\n27468 7465 74275 40573 40155\n112071 76270 244461 264202 132397\n1 777133331\n2 107454(...TRUNCATED) | {"input":["5\n7 46 11 17 11","7\n994 518 941 851 647 2 568","3\n3 1 6","5\n7 46 11 17 13","7\n994 51(...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": [],
"solution": []
} | 835 | B | 1,000 | 0 | [
"implementation"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
p01576 Exciting Bicycle | "A string is called a KEYENCE string when it can be changed to `keyence` by removing its contiguous (...TRUNCATED) | {"input":["3 9 1\n1 3 8","2 1000000000 1000000000\n1 999999999","3 9 3\n1 3 8"],"output":["12","2999(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["50 5000\n2 35 46\n2 43 92\n2 16 88\n2 67 99\n2 36 93\n2 12 20\n2 33 96\n2 55 82\n2 18 32\(...TRUNCATED) | 6 | 6 | {"language":[3,2,3,3,4,2,3,3,3,3,3,3,3,4,2,3,2,2,3,3,3,3,3,3,2,3,3,3,1,2,3,4,3,3,2,3,2,4,2,4,4,3,3,4(...TRUNCATED) | {"language":[2,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,4,2,2,4,2,2,2,2,2,2,1,2,2,4,2,2,2,2,2,2,2,4,2,4(...TRUNCATED) | 1,088 | 1,000 | 0 | [
""
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | ||||
209_B. Pixels | "Let's call a string a phone number if it has length 11 and fits the pattern \"8xxxxxxxxxx\", where (...TRUNCATED) | {
"input": [
"1\n3 3\n1 2\n2 3\n1 3\n\nSAMPLE"
],
"output": [
"2\n"
]
} | {
"input": [],
"output": []
} | {"input":["3\nfdSgAe\nOut\nGet\n\nSAMPLE","3\nfdSgAe\ntuO\nFet\n\nSAMPLE","3\nBdSgfe\ntuO\nFet\n\nSA(...TRUNCATED) | 2 | 11 | {"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":[3,2,2,3,4,2,4,3,2,2,1,2,4,3,4,3,2,3,2,2,4,2,3,2,2,2,3,4,4,3,2,2,3,2,2,3,4,2,2,2,2,2,3,4(...TRUNCATED) | 716 | 0 | 2,100 | [
"binary search",
"brute force",
"data structures",
"implementation"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | ||||
1325_B. CopyCopyCopyCopyCopy | "Surya loves to play with primes. One day, he asked his friend don to print any number in the form o(...TRUNCATED) | {"input":["10\n1 10 2 9 3 8 4 7 5 6\n","4\n1 2 3 4\n","3\n1 2 3\n"],"output":["4.500000000000024\n",(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["100 5\n1\n23\n45\n47\n89","10 2\n4\n1","4 1\n3","100 3\n1\n23\n45\n47\n89","100 0\n1\n23\(...TRUNCATED) | 2 | 12 | {"language":[1,3,3,3,2,4,4,3,4,3,2,4,2,3,3,4,3,2,4,1,3,3,4,4,4,4,3,2,2,1,3,1,3,1,4,1,3,3,2,3,4,3,4,1(...TRUNCATED) | {"language":[4,3,3,4,4,4,2,2,4,4,4,2,4,2,2,2,2,2,1,2,4,2,2,2,2,2,3,4,2,4,2,2,2,4,4,2,2,4,1,4,2,2,2,2(...TRUNCATED) | 83 | 0 | 0 | [
"flows",
"shortest paths"
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | ||||
483_B. Friends and Presents | "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": [
"4 5 3 1 5\n",
"5 1 2 1 2\n",
"3 3 1 1 1\n"
],
"output": [
"Friendship\n",
"First\n",
"Second\n"
]
} | {
"input": [],
"output": []
} | {"input":["2 1\n7 1 1\n2 0 1\n","5 1\n2 1 1\n2 0 1\n1 0 1\n1 1 0\n1 0 1\n","6 1\n6 0 0\n11 1 0\n9 0 (...TRUNCATED) | 6 | 11 | {"language":[2,3,2,2,4,2,4,3,4,4,3,2,1,3,1,2,2,4,2,4,4,2,4,4,4,4,4,1,3,3,1,2,3,1,3,2,3,2,4,4,2,3,3,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 | F | 1,500 | 2,500 | [
""
] | false | null | 256,000,000 | |||
228_D. Zigzag | "G: Destiny Draw-\n\nproblem\n\nMr. D will play a card game. This card game uses a pile of N cards. (...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["4 4 3\n1 2 3\n1 2 1\n2 3 2\n1 3 3\n1 4 4\n","4 3 2\n1 4\n1 2 1\n2 3 5\n3 4 1\n","3 2 2\n1(...TRUNCATED) | {"input":["1 11 4 0 10\n","17 10 12 6 8\n","6 4 4 0 2\n","50 4 5 5 -1\n","20 2 40 1 2\n","1000 501 5(...TRUNCATED) | 2 | 10 | {"language":[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,4,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2(...TRUNCATED) | {"language":[2,4,4,3,4,2,3,2,2,4,4,1,2,1,2,4,3,4,3,3,4,3,1,3,2,4,2,3,3,3,3,2,4,3,2,3,3,4,2,2,3,4,4,2(...TRUNCATED) | 1,149 | A | 2,500 | 0 | [
"math",
"number theory",
"sortings"
] | false | {
"nanos": 0,
"seconds": 2
} | 0 | |||
29_E. Quarrel | "To celebrate the opening of the Winter Computer School the organizers decided to buy in n liters of(...TRUNCATED) | {
"input": [
"5\nZZZAA\n",
"7\nABACABA\n"
],
"output": [
"ZZ\n",
"AB\n"
]
} | {
"input": [],
"output": []
} | {"input":["188\n99\n","352\n139\n","596\n845\n","285\n2\n","892\n319\n","138\n293\n","967\n102\n","9(...TRUNCATED) | 3 | 0 | {"language":[4,2,2,4,2,2,2,2,4,2,3,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,1,4,2,2,2,4,2,2,4,2,2,2,2,2,2,4,2,2(...TRUNCATED) | {"language":[2,0,2,2,2,2,0,2,4,2,2,2,0,0,2,2,2,2,2,2,2,0,2,2,2,2,2,2,0,2,2,0,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 354 | C | 0 | 3,500 | [
"brute force",
"dp",
"math",
"number theory"
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 |
End of preview. Expand in Data Studio
edition_2796_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
- 10