BALLSUM - Ball sum
You have a bag filled with N balls. Each ball has a distinct number from 1 to N printed on it. All the numbers are distinct. You withdraw two balls from the bag and take their sum. You need to calculate the probability that the sum is not greater than the given number K (<= N). The answer should be displayed in the form of p/q (except when the answer is 0 or 1.)
Input
Input consists of various test cases. Each test case consist of two integer inputs, N and K. (0 <= K <= N <= 1000000000) The program stops taking input when N and K equals -1.
Output
Output the result in the form of p/q (except when the answer is 0 or 1.)
Example
Input: 3 2 100 5 10 6 -1 -1 Output: 0 2/2475 2/15
hide comments
lalit_nit:
2016-04-19 16:27:47
First solved by brute force then -> Simply AC Last edit: 2016-04-22 06:14:46 |
|
prince_gayatri:
2016-02-17 20:55:16
AC in one go....... |
|
abhishekrahul:
2016-01-25 15:32:59
sorov_0 tum itna tez kaise h..... |
|
sorov_0:
2016-01-25 15:32:21
ac in one go..... |
|
sorov_0:
2016-01-25 13:37:00
abhishek tum itna tez kase ho.....
|
|
abhishekrahul:
2016-01-25 13:34:43
ac in one go...
|
|
rahul2907:
2016-01-19 20:45:42
Nice one!!!! easy :)
|
|
prakash_reddy:
2016-01-15 20:47:06
Easy one, little mathematical analysis is required.... |
|
damsehgal:
2016-01-03 23:47:56
are you withdrawing 2 balls together or are you withdrawing a ball and then putting it back and then taking i out again?
|
|
gomathi ganesan:
2015-12-28 07:34:48
Easy problem :D |
Added by: | Prateek Agarwal |
Date: | 2015-12-15 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ASM64 GOSU JS-MONKEY |