{"push_id":2157527817,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"3bad1876fa82d90c6bc5b6b66fd167e14c01eb86","before":"1cd4e745100654cee36f537e5ae63754c288e848","commits":[{"sha":"3bad1876fa82d90c6bc5b6b66fd167e14c01eb86","author":{"name":"igrisham","email":"f7f755f4aa19dc5b7eb007f34c834ac7c851a9b2@users.noreply.github.com"},"message":"HW 11/29\n\nCOSC 311  Homework 11/15    \r\n\r\nDistributed: 11/15/2017     Due: 11/29/2017\r\n\r\nWrite a Java program that has two user-supplied (at run-time) inputs:\r\n\r\nd -- this is the number of 6-sided (fair) die\r\nn -- this is a threshold value\r\n\r\nOne roll of the dice produces a value which is the sum of each die.\r\n  \r\n  \r\nFor d and n, how many combinations (rolls of d dice) produce sum >= n?\r\n\r\nExample: d = 2, n = 10.\r\n There are 4 rolls that equal or exceed the threshold:\r\n 5, 5\r\n 6, 5\r\n 5, 6\r\n 6, 6\r\n \r\nOutput:\r\n  Echo d and n values\r\n  Output the number of combinations that are >= n\r\n    (do not output the actual combinations)\r\n  Output the time required to compute answer for given d, n\r\n  \r\nConstraints:\r\n  (1) URL of source files must appear in file header\r\n  (2) No more than 5 lines of reasonable comments\r\n  \r\nTurn in:\r\n  (1) Source code\r\n  (2) Screen shot on runs for:\r\n    d   n\r\n  ---------\r\n    2   10\r\n    10  50\r\n    20  100\r\n    50  250\r\n    100 500\r\n    \r\n  (3) Graph of time (y axis) versus d (x-axis).\r\n  \r\nPoints taken off for:\r\n(1) Doesn't work\r\n(2) Failure to meet constraints\r\n(3) Code does not match output\r\n(4) Ugly or difficult to understand code\r\n(5) No graph.","distinct":true,"url":"https://api.github.com/repos/igrisham/COSC-311/commits/3bad1876fa82d90c6bc5b6b66fd167e14c01eb86"}]}
{"actor":{"display_login":"igrisham"}}