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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
p00490 Best Pizza | Background
The kindergarten attached to the University of Aizu is a kindergarten where children who love programming gather. Yu, one of the kindergarten children, loves money as much as programming. Yu-kun visited the island where treasures sleep to make money today. Yu-kun has obtained a map of the treasure in advanc... | {
"input": [
"AprilFool\n14\n"
],
"output": [
"AprILFooL"
]
} | {
"input": [
"85 30 123\n",
"100000 100000 1320777\n",
"94728 36278 300352\n",
"70386 4182 113682\n",
"65182 12701 141871\n",
"48701 4854 14523\n",
"84324 74849 17238\n",
"100000 100000 10000000\n",
"83072 55834 461951\n",
"99999 99999 1320778\n",
"99474 33270 200430\n",
... | {
"input": [
"10 9\n2 5\n2 4\n2 7\n2 9\n2 3\n2 8\n2 6\n4 10\n2 1\n",
"10 10\n6 4\n9 2\n3 6\n6 7\n4 2\n9 6\n8 6\n5 7\n1 4\n6 10\n",
"5 7\n3 2\n5 4\n4 4\n1 3\n1 5\n1 4\n2 5\n",
"1010 1\n195 788\n",
"10 9\n2 5\n2 4\n2 7\n2 9\n2 3\n2 9\n2 6\n4 10\n2 1\n",
"10 16\n6 10\n5 2\n6 4\n6 8\n5 3\n5 1\n6 2... | 2 | 2 | {
"language": [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
],
"solution": [
"n = int(raw_input())\nm = map(int, raw_input().split())\nfor i in range(0,len(m)):\n count =1\n for j in range(0,len(m)):\n if(m[i]... | {
"language": [
2,
2,
2,
2,
2,
2,
2,
0,
2,
2,
2,
0,
3,
2,
2,
3,
2,
4,
0,
2,
2,
2,
2,
0,
2,
2,
2,
2,
4,
2,
2,
2,
2,
2,
0,
2,
2,
2,
2,
2,
2,
3,
2,
... | 709 | 0 | 0 | [
"binary search",
"brute force",
"geometry",
"math"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | ||||
p01538 Kakezan | "Taro is going to play a card game. However, now he has only n cards, even though there should be 52(...TRUNCATED) | {
"input": [
"2\n5 10\n3 4 6 1 9\n3 2\n1 3 4"
],
"output": [
"1\n0"
]
} | {"input":["3\n2 2 3\n","5\n1 4 5 4 5\n","4\n2 2 4 4\n","3\n1 1 2\n","4\n1 2 1 2\n","4\n4 2 2 4\n","6(...TRUNCATED) | {"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,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":[3,4,2,4,4,2,1,4,2,4,2,2,2,4,2,4,4,1,2,4,2,2,4,1,4,2,4,4,2,4,4,4,2,4,4,2,2,4,2,3,2,4,4,2(...TRUNCATED) | 0 | 500 | 2,200 | [
""
] | false | {
"nanos": 0,
"seconds": 3
} | 256,000,000 | ||||
5_A. Chat Server's Outgoing Traffic | "Hasan loves playing games and has recently discovered a game called TopScore. In this soccer-like g(...TRUNCATED) | {
"input": [
"3",
"100",
"1000000"
],
"output": [
"3",
"473",
"13969985"
]
} | {
"input": [],
"output": []
} | {"input":["5\n90 94\n26 25\n64 84\n18 6\n20 96\n","5\n1912 1\n5 6\n999 1\n88 2\n11 100\n","5\n90 94\(...TRUNCATED) | 3 | 0 | {"language":[2,2,2,3,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,4,2,2,2,2,2,2,2,4,2,2,2,2(...TRUNCATED) | {"language":[3,3,2,0,0,3,2,2,4,2,0,4,0,0,0,0,2,0,2,0,2,2,0,0,0,2,2,1,2,3,2,2,0,4,2,4,2,2,2,2,2,2,3,0(...TRUNCATED) | 76 | A | 1,500 | 2,300 | [
"dp",
"greedy",
"strings"
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | |||
vibhu-and-his-mathematics | "Dima and Inna love spending time together. The problem is, Seryozha isn't too enthusiastic to leave(...TRUNCATED) | {
"input": [
"3 8\n6 5 8\n",
"7 20\n21 15 12 11 20 19 12\n"
],
"output": [
"2\n",
"6\n"
]
} | {"input":["1 1\n0\n10000\n","2 3\n1 0\n4 7\n","1 2\n0\n10000\n","3 10\n0 1 2\n9240 5331 6721\n","4 1(...TRUNCATED) | {"input":["1 5000 2732\n","2 2 0\n","83 4122 123\n","19 862 387\n","100 843 30\n","45 1296 245\n","9(...TRUNCATED) | 1 | 0 | {"language":[4,1,4,3,3,3,3,4,3,2,3,2,3,3,3,3,4,3,2,3,3,2,2,2,2,2,3,4,3,4,2,1,4,3,2,2,2,3,2,4,3,2,3,3(...TRUNCATED) | {"language":[2,4,0,2,2,2,2,2,2,3,2,2,4,3,3,2,2,3,3,3,2,2,2,2,2,2,2,3,3,0,3,2,3,3,2,2,0,2,3,2,2,3,2,2(...TRUNCATED) | 530 | H | 0 | 0 | [
"two pointers"
] | true | {
"nanos": 0,
"seconds": 1
} | 512,000,000 | |||
1208_D. Restore Permutation | "Imagine that you are the CEO of a big old-fashioned company. Unlike any modern and progressive comp(...TRUNCATED) | {
"input": [
"5 3 2\naaaaa\naaa\naab"
],
"output": [
"1 6"
]
} | {"input":["20\naaaaaaaaaaaaaaaaaaaa\n1\n11 a\n","4\ncbcc\n12\n4 b\n4 c\n1 b\n2 a\n3 b\n2 c\n4 a\n1 a(...TRUNCATED) | {"input":["6\n773209925 62005863 473635171 329666981 510631133 207643327\n","1\n2\n","7\n481003311 5(...TRUNCATED) | 2 | 7 | {"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,1],"sol(...TRUNCATED) | {"language":[4,1,4,4,2,4,4,2,4,1,3,2,3,4,3,3,3,2,2,2,4,3,3,2,4,3,1,3,3,3,2,4,3,3,1,3,3,2,2,1,4,1,2,4(...TRUNCATED) | 0 | D | 0 | 2,200 | [
"greedy"
] | false | null | 268,435,456 | |||
1361_E. James and the Chase | "The russian intelligence agency KGB make an encryption technique to send their passwords. Originall(...TRUNCATED) | {
"input": [
"2\n1 23\n\nSAMPLE"
],
"output": [
"NO\n"
]
} | {"input":["5\n0 968804136\n0 736567537\n2 343136264\n0 259899572\n1 425744418\n","5\n0 51690939\n0 6(...TRUNCATED) | {"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 | 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,4,2,4,2,2,4,4,2,4,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 1,291 | A | 1,000 | 0 | [] | false | {
"nanos": 0,
"seconds": 1
} | 134,217,728 | |||
muffins3 | "Alice had a permutation p_1, p_2, …, p_n. Unfortunately, the permutation looked very boring, so s(...TRUNCATED) | {
"input": [
"3\nkek\npreceq\ncheburek\n",
"4\nmail\nai\nlru\ncf\n"
],
"output": [
"NO\n",
"cfmailru\n"
]
} | {"input":["2\nab\nac\n","2\nca\ncb\n","2\ndc\nec\n","2\naz\nzb\n","2\naa\nb\n","25\nsw\nwt\nc\nl\nyo(...TRUNCATED) | {"input":["4\n1 4\n3 2\n3 4\n","21\n7 15\n13 1\n14 3\n4 10\n2 3\n16 18\n17 20\n16 20\n8 4\n3 12\n2 1(...TRUNCATED) | 2 | 0 | {"language":[2,2,2,2,2,2,4,2,2,2,2,2,2,2,3,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,2,2,2(...TRUNCATED) | {"language":[2,2,2,2,2,2,2,2,2,2,2,3,2,4,2,2,2,4,2,4,2,2,2,2,2,4,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 962 | A | 1,250 | 0 | [
"*special",
"data structures",
"dsu",
"implementation",
"math",
"sortings"
] | false | {
"nanos": 0,
"seconds": 6
} | 256,000,000 | |||
p03774 AtCoder Beginner Contest 057 - Checkpoints | "In Walrusland public transport tickets are characterized by two integers: by the number of the seri(...TRUNCATED) | {"input":["3 100\n3\n2\n1","3 1\n3\n2\n1","5 3\n5\n3\n2\n1\n4","5 3\n1\n2\n3\n4\n5"],"output":["3\n2(...TRUNCATED) | {"input":["264193194 -448876521 736684426 -633906160 -328597212 -47935734\n","-357531221 381512519 -(...TRUNCATED) | {"input":["4\n39 18\n183 11\n551 27\n85 16","8\n4 65\n5 12\n7 21\n9 38\n12 24\n14 10\n65 75\n31 26",(...TRUNCATED) | 2 | 9 | {"language":[4,2,4,4,4,2,2,4,4,2,4,3,4,2,2,2,2,4,2,2,2,2,2,2,2,4,2,2,2,4,2,4,1,4,2,2,4,2,1,2,2,2,2,2(...TRUNCATED) | {"language":[4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,4,4,4,2,2,2,4,4,2,1,3,2,2,2,4,2,2,2,4,4,2,2,2,2(...TRUNCATED) | 1,012 | K | 0 | 1,800 | [
"constructive algorithms",
"math"
] | false | {
"nanos": 500000000,
"seconds": 0
} | 134,217,728 | |||
1117_F. Crisp String | "Differential pulse code modulation is one of the compression methods mainly used when compressing a(...TRUNCATED) | {
"input": [
"4\n2 10\n0 20\n1 5\n1 3\n",
"3\n0 1\n0 10\n0 100\n"
],
"output": [
"8",
"111"
]
} | {"input":["25\n1 8\n8 8\n64 8\n512 8\n4096 8\n32768 8\n262144 8\n2097152 8\n16777216 8\n134217728 8\(...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) | 3 | 0 | {"language":[2,4,4,4,4,4,4,2,4,4,2,2,4,4,3,3,1,4,4,3,2,2,3,4,4,2,2,4,4,4,4,2,2,4,2,2,2,2,2,2,2,4,2,4(...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) | 1,320 | 0 | 3,000 | [
"implementation",
"strings"
] | false | {
"nanos": 0,
"seconds": 1
} | 256,000,000 | ||||
1374_B. Multiply by 2, divide by 6 | "You are given a simple arithmetic expression of the form a?b, where a and b are integer constants, (...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":["10\n-1 -1\n1 1\n1 1\n3 0\n4 1\n2 0\n3 1\n2 1\n5 0\n5 0\n8\n1 2 6\n2 3 7\n2 4 7\n1 3 4\n2 (...TRUNCATED) | 3 | 12 | {"language":[3,1,2,2,2,2,2,4,2,2,2,3,3,3,2,2,3,4,2,2,2,3,2,3,2,3,3,3,2,3,2,3,1,4,1,3,2,2,2,1,1,2,2,2(...TRUNCATED) | {"language":[2,4,2,1,2,2,4,2,1,2,2,2,2,4,2,2,2,2,2,2,0,4,0,2,0,0,4,0,0,4,2,2,2,4,2,0,0,4,4,2,2,2,0,2(...TRUNCATED) | 963 | B | 0 | 2,100 | [
"*special"
] | false | {
"nanos": 0,
"seconds": 5
} | 256,000,000 |
End of preview. Expand in Data Studio
edition_3114_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
- 16