Dataset Viewer
Auto-converted to Parquet Duplicate
problem_id
stringlengths
12
45
problem_level
stringclasses
4 values
description
stringlengths
940
4.03k
runtime_limit
int64
2
15
memory_limit
int64
256
512
num_tests
int64
9
23
input
dict
output
dict
84_bronze_contest_timing
bronze
Problem 1: Contest Timing [Brian Dean] Bessie the cow is getting bored of the milk production industry, and wants to switch to an exciting new career in computing. To improve her coding skills, she decides to compete in the on-line USACO competitions. Since she notes that the contest starts on November 11, 2011 (11/11/11), she decides for fun to download the problems and begin coding at exactly 11:11 AM on 11/11/11. Unfortunately, Bessie's time management ability is quite poor, so she wants to write a quick program to help her make sure she does not take longer than the 3 hour (180 minute) time limit for the contest. Given the date and time she stops working, please help Bessie compute the total number of minutes she will have spent on the contest. PROBLEM NAME: ctiming INPUT FORMAT: * Line 1: This line contains 3 space-separated integers, D H M, specifying the date and time at which Bessie ends the contest. D will be an integer in the range 11..14 telling the day of the month; H and M are hours and minutes on a 24-hour clock (so they range from H=0,M=0 at midnight up through H=23,M=59 at 11:59 PM). SAMPLE INPUT: 12 13 14 INPUT DETAILS: Bessie ends the contest on November 12, at 13:14 (that is, at 1:14 PM). OUTPUT FORMAT: * Line 1: The total number of minutes spent by Bessie in the contest, or -1 if her ending time is earlier than her starting time. SAMPLE OUTPUT: 1563 OUTPUT DETAILS: Bessie ends the contest 1563 minutes after she starts.
2
256
10
{ "1": "12 13 14\n", "2": "12 22 43\n", "3": "14 17 55\n", "4": "12 12 46\n", "5": "14 2 1\n", "6": "14 19 50\n", "7": "13 12 46\n", "8": "11 11 11\n", "9": "14 23 59\n", "10": "11 4 15\n", "11": null, "12": null, "13": null, "14": null, "15": null, "16": null, "17": null, "18": null, "19": null, "20": null, "21": null, "22": null, "23": null }
{ "1": "1563\n", "2": "2132\n", "3": "4724\n", "4": "1535\n", "5": "3770\n", "6": "4839\n", "7": "2975\n", "8": "0\n", "9": "5088\n", "10": "-1\n", "11": null, "12": null, "13": null, "14": null, "15": null, "16": null, "17": null, "18": null, "19": null, "20": null, "21": null, "22": null, "23": null }
86_bronze_moo_sick
bronze
"Problem 3: Moo Sick [Rob Seay]\n\nEveryone knows that cows love to listen to all forms of music. A(...TRUNCATED)
2
256
10
{"1":"6\n1\n8\n5\n7\n9\n10\n3\n4\n6\n7\n","10":"19999\n17\n35\n88\n79\n41\n29\n68\n16\n24\n86\n54\n8(...TRUNCATED)
{"1":"2\n2\n4\n","10":"19999\n1\n2\n3\n4\n5\n6\n7\n8\n9\n10\n11\n12\n13\n14\n15\n16\n17\n18\n19\n20\(...TRUNCATED)
87_bronze_cow_beauty_pageant_(bronze_level)
bronze
"Problem 4: Cow Beauty Pageant (Bronze Level) [Brian Dean]\n\nHearing that the latest fashion trend (...TRUNCATED)
2
256
10
{"1":"6 16\n................\n..XXXX....XXX...\n...XXXX....XX...\n.XXXX......XXX..\n........XXXXX...(...TRUNCATED)
{"1":"3\n","10":"1\n","11":null,"12":null,"13":null,"14":null,"15":null,"16":null,"17":null,"18":nul(...TRUNCATED)
88_silver_cow_beauty_pageant_(silver_level)
silver
"Problem 1: Cow Beauty Pageant (Silver Level) [Brian Dean]\n\nHearing that the latest fashion trend (...TRUNCATED)
2
256
12
{"1":"6 16\n................\n..XXXX....XXX...\n...XXXX....XX...\n.XXXX......XXX..\n........XXXXX...(...TRUNCATED)
{"1":"4\n","10":"37\n","11":"2\n","12":"22\n","13":null,"14":null,"15":null,"16":null,"17":null,"18"(...TRUNCATED)
89_silver_cow_lineup
silver
"Problem 2: Cow Lineup [Brian Dean]\n\nFarmer John has hired a professional photographer to take a p(...TRUNCATED)
2
256
12
{"1":"6\n25 7\n26 1\n15 1\n22 3\n20 1\n30 1\n","10":"50000\n820262675 555053762\n223030408 585911202(...TRUNCATED)
{"1":"4\n","10":"999963029\n","11":"999648059\n","12":"946633813\n","13":null,"14":null,"15":null,"1(...TRUNCATED)
90_silver_tile_exchanging
silver
"Problem 3: Tile Exchanging [Ray Li]\n\nFarmer John wants to remodel the floor of his barn using a c(...TRUNCATED)
2
256
12
{"1":"3 6\n3\n3\n1\n","10":"3 9842\n98\n73\n35\n","11":"10 10000\n61\n64\n31\n49\n94\n21\n69\n58\n10(...TRUNCATED)
{"1":"5\n","10":"806\n","11":"10355\n","12":"4100\n","13":null,"14":null,"15":null,"16":null,"17":nu(...TRUNCATED)
91_gold_above_the_median
gold
"Problem 1: Above the Median [Brian Dean]\n\nFarmer John has lined up his N (1 <= N <= 100,000) cows(...TRUNCATED)
2
256
10
{"1":"4 6\n5\n10\n8\n2\n","10":"99998 182739483\n182839950\n195433983\n221093207\n205724841\n2366879(...TRUNCATED)
{"1":"8\n","10":"4999850000\n","11":null,"12":null,"13":null,"14":null,"15":null,"16":null,"17":null(...TRUNCATED)
92_gold_binary_sudoku
gold
"Problem 2: Binary Sudoku [Brian Dean]\n\nFarmer John's cows like to play an interesting variant of (...TRUNCATED)
2
256
12
{"1":"000000000\n001000100\n000000000\n000110000\n000111000\n000000000\n000000000\n000000000\n000000(...TRUNCATED)
{"1":"3\n","10":"6\n","11":"9\n","12":"9\n","13":null,"14":null,"15":null,"16":null,"17":null,"18":n(...TRUNCATED)
93_gold_cow_steeplechase
gold
"Problem 3: Cow Steeplechase [Brian Dean]\n\nFarmer John has a brilliant idea for the next great spe(...TRUNCATED)
2
256
10
{"1":"3\n4 5 10 5\n6 2 6 12\n8 3 8 5\n","10":"247\n1361956 1 1361956 1000000000\n1 376140463 1000000(...TRUNCATED)
{"1":"2\n","10":"124\n","11":null,"12":null,"13":null,"14":null,"15":null,"16":null,"17":null,"18":n(...TRUNCATED)
94_bronze_hay_bales
bronze
"Problem 1: Hay Bales [Brian Dean, 2011]\n\nThe cows are at it again! Farmer John has carefully arr(...TRUNCATED)
2
256
10
{"1":"4\n2\n10\n7\n1\n","10":"10000\n3717\n1121\n4666\n4741\n6216\n6252\n7025\n2011\n6728\n7678\n269(...TRUNCATED)
{"1":"7\n","10":"10022020\n","11":null,"12":null,"13":null,"14":null,"15":null,"16":null,"17":null,"(...TRUNCATED)
End of preview. Expand in Data Studio
README.md exists but content is empty.
Downloads last month
34