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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
242_C. King's Path | "Alex, Bob and Carl will soon participate in a team chess tournament. Since they are all in the same(...TRUNCATED) | {"input":["1\n0\n","6\n2 0 3 0 1 1\n","6\n3 2 2 2 1 1\n"],"output":["0\n\n","5\n6 6\n5 5\n4 3\n4 5\n(...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["4000 4000 2\n","3 300 167\n","3 300 2\n","4 4 2\n","3 2 70\n","1625 3998 2\n","300 403 30(...TRUNCATED) | 2 | 0 | {"language":[2,1,4,3,2,2,1,3,2,1,2,2,4,4,2,2,1,4,4,2,3,3,3,2,2,2,2,2,3,1,2,4,4,4,4,2,2,3,3,4,2,2,1,4(...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) | 551 | C | 0 | 0 | [
"dfs and similar",
"graphs",
"trees"
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | |||
875_D. High Cry | "You are given q queries in the following form:\n\nGiven three integers l_i, r_i and d_i, find minim(...TRUNCATED) | {"input":["2 1 2\n1 2","5 4 5\n1 2\n1 3\n1 4\n1 5","5 4 1\n1 2\n2 3\n3 4\n3 5","9 6 1\n1 2\n2 3\n3 4(...TRUNCATED) | {"input":["8 61 898\n315 863\n524 559\n612 425\n577 542\n220 280\n560 880\n297 626\n381 24\n","32 79(...TRUNCATED) | {"input":["3 313 856 964 421\n","3 3 1 11 9\n","2 2 9 8 1\n","61 538 623 89 548\n","7 202 512 995 37(...TRUNCATED) | 2 | 12 | {"language":[2,2,2,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,2,4,4,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | {"language":[2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2(...TRUNCATED) | 0 | 500 | 2,500 | [
"dp",
"math"
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | ||||
1301_B. Motarack's Birthday | "An array of integers p_{1},p_{2}, …,p_{n} is called a permutation if it contains each number from(...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":["6 4 2\n100110\n","4 2 1\n1001\n","64 40 7\n1010011100101100101011000001000011110111011011(...TRUNCATED) | 2 | 9 | {"language":[2,4,1,2,2,2,4,4,2,2,4,4,2,2,2,2,2,2,2,2,3,2,4,1,2,2,2,2,2,2,2,1,2,2,2,1,4,2,3,2,2,2,2,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) | 80 | 2,500 | 0 | [
"brute force"
] | false | {
"nanos": 0,
"seconds": 5
} | 256,000,000 | ||||
p02157 Shuffle 2 | "Some country is populated by wizards. They want to organize a demonstration.\n\nThere are n people (...TRUNCATED) | {
"input": [
"2\n5\n6 5 4 3 2\n5\n3 4 3 1 1"
],
"output": [
"6\n5\n"
]
} | {
"input": [],
"output": []
} | {"input":["5 3 2\naaaaa\nbaa\naab","5 3 2\naaaaa\nabb\naac","6 3 2\naaaaa\naaa\naab","6 3 2\naabaa\n(...TRUNCATED) | 5 | 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":[4,4,4,1,2,4,1,4,2,4,1,4,2,1,1,2,1,4,2,3,4,3,3,4,2,4,2,2,4,4,3,1,2,2,2,3,4,3,4,2,3,3,2,2(...TRUNCATED) | 0 | 750 | 2,400 | [
""
] | false | null | 256,000,000 | ||||
519_B. A and B and Compilation Errors | "problem\n\nChairman K is a regular customer of the JOI pizza shop in the center of JOI city. For so(...TRUNCATED) | {
"input": [
"4 5\n10 4 18 3\n",
"2 2\n1 2\n"
],
"output": [
"4",
"1"
]
} | {"input":["3 4\n1 1\n1 2\n1 3\n","1 100\n99 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22(...TRUNCATED) | {
"input": [],
"output": []
} | 2 | 11 | {"language":[2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,4,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],"solution":["#include <bits/stdc++.h>\nusing n(...TRUNCATED) | 0 | C | 0 | 800 | [
"data structures",
"implementation"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
appu-and-sugarcane-farm | "The football season has just ended in Berland. According to the rules of Berland football, each mat(...TRUNCATED) | {"input":["6 3\n2 1\n2 6\n4 2\n5 6\n2 3\n","8 4\n2 6\n2 7\n7 8\n1 2\n3 1\n2 4\n7 5\n"],"output":["1 (...TRUNCATED) | {"input":["3\n7089544 9134148 -5332724\n368810 1638695 7889905\n-3866235 -4257263 5802154\n","16\n-3(...TRUNCATED) | {"input":["5 2\nbacba","10 2\nbbbabbbaaa","10 3\nbbaabbbaab","5 2\nbacaa","10 2\nbaabbbaabb","10 2\n(...TRUNCATED) | 2 | 0 | {"language":[4,3,1,3,2,2,4,2,4,2,4,2,3,2,3,2,2,3,3,2,3,3,2,3,4,2,2,4,3,2,4,2,3,2,3,2,2,4,4,3,2,3,2,3(...TRUNCATED) | {"language":[2,2,4,4,3,3,4,2,3,3,2,3,2,3,4,3,4,2,4,4,3,2,3,3,2,1,4,3,2,3,4,4,3,3,3,3,3,3,2,4,4,2,2,4(...TRUNCATED) | 774 | F | 0 | 3,100 | [
"*special",
"dfs and similar",
"trees"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
ism1 | "To improve the boomerang throwing skills of the animals, Zookeeper has set up an n × n grid with s(...TRUNCATED) | {"input":["3 0 0\n0 1\n-1 2\n1 2\n","4 1 -1\n0 0\n1 2\n2 0\n1 1\n"],"output":["12.566370614359176\n"(...TRUNCATED) | {"input":["1 1 1 2\n5\n1000000000 1 10000\n19920401 1188 5566\n1000000000 1 10000\n1 1 10000\n5 100 (...TRUNCATED) | {"input":["30\n16 3\n-334 -500 -169 -724 -478 -358 -962 -464 -705 -145 -281 -827 -961 -491 -995 -942(...TRUNCATED) | 6 | 11 | {"language":[2,2,2,2,2,4,4,4,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,4,2,2,2,2,2,2,2,2(...TRUNCATED) | {"language":[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,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 0 | B | 1,500 | 0 | [
"binary search",
"combinatorics",
"data structures",
"dp",
"graphs",
"implementation",
"two pointers"
] | false | null | 268,435,456 | |||
630_A. Again Twenty Five! | "Everybody knows that we have been living in the Matrix for a long time. And in the new seventh Matr(...TRUNCATED) | {
"input": [
"6\n2 3 1 3 2 4\n2\n1 0 4\n2 3 5\n\nSAMPLE"
],
"output": [
"2\n-1"
]
} | {"input":["100\n4\nlrbbmqb\ncd\nr\nowkk\n7\nid\nqscdxrjmow\nrxsjybldbe\nsarcbyne\ndyggxxp\nlorel\nnm(...TRUNCATED) | {"input":["1 1 1 2\n5\n1000000000 1 10000\n35510851 1188 5566\n1000000000 1 10000\n1 1 10000\n5 100 (...TRUNCATED) | 2 | 8 | {"language":[2,2,2,2,2,2,2,2],"solution":["#include <iostream>\n#include <iomanip>\n#include <comple(...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,4(...TRUNCATED) | 1,344 | B | 2,000 | 0 | [
"bitmasks",
"dp"
] | false | {
"nanos": 0,
"seconds": 3
} | 134,217,728 | |||
1512_G. Short Task | "We have caught N sardines. The deliciousness and fragrantness of the i-th sardine is A_i and B_i, r(...TRUNCATED) | {"input":["4 4\n1 2\n3 2\n3 4\n1 3","15 28\n10 7\n5 9\n2 13\n2 14\n6 1\n5 12\n2 10\n3 9\n10 15\n11 1(...TRUNCATED) | {"input":["10000 10 100\n2339 4118 4595 5499 5582 6055 8693 9002 9190 9658\n10 75 82 5 14 55 64 68 4(...TRUNCATED) | {"input":["7\n5\n-1 10 -1 12 -1\n5\n-1 40 35 -1 35\n6\n-1 -1 9 -1 3 -1\n2\n-1 -1\n2\n0 -1\n4\n1 -1 3(...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,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4(...TRUNCATED) | {"language":[2,3,2,4,4,1,4,2,3,4,2,2,4,2,2,4,1,2,2,4,3,2,4,2,3,1,4,4,4,2,1,3,1,2,2,4,3,2,2,2,4,1,2,2(...TRUNCATED) | 691 | B | 2,500 | 0 | [
"implementation"
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | |||
442_C. Artem and Array | "Bob is travelling from one city to another. In his way, he sees many other cities pass by. What he (...TRUNCATED) | {"input":["6 4\n2 2 5 5 6 6\n1 3\n2 4\n3 5\n4 6\n","3 3\n314 159 265\n1 2\n1 3\n3 2\n","4 2\n2 1 1 5(...TRUNCATED) | {"input":["1\n1\n","100\n98 52 63 2 18 96 31 58 84 40 41 45 66 100 46 71 26 48 81 20 73 91 68 76 13 (...TRUNCATED) | {"input":["3 1 2\n1\n1 1\n","3 0 3\n\n334 500 0001\n","3 0 3\n\n333 187 1001\n","6 2 3\n2 3\n1 1 1\n(...TRUNCATED) | 2 | 13 | {"language":[3,4,3,4,3,2,2,3,3,3,4,3,3,2,3,2,1,2,3,3,2,3,3,2,4,4,4,2,3,3,3,3,3,4,3,3,2,3,3,3,2,3,3,4(...TRUNCATED) | {"language":[2,2,1,2,2,4,0,2,4,2,2,2,4,2,4,2,2,2,0,0,2,0,0,2,0,2,1,2,0,0,0,0,2,2,0,2,2,0,2,0,0,2,4,0(...TRUNCATED) | 0 | 2,750 | 0 | [
"brute force",
"data structures",
"dp",
"greedy",
"implementation",
"math",
"strings"
] | false | {
"nanos": 0,
"seconds": 2
} | 0 |
End of preview. Expand in Data Studio
edition_1109_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