AE2A - Dice
Jack claims that he has telekinetic powers. He has made a bet with Mike that he would throw a die n times and would get exactly k pips in total. Jack's die has 6 faces with numbers from 1 to 6 written on them and is perfectly symmetric. Mike does not believe in Jack's telekinetic powers (in general, being a tenacious rationalist, he does not believe in telekinesis), but he is concerned that Jack could win the bet simply by luck. Therefore, he would like to know what is the chance (in percent) of such an unlucky event, and asked you to write a program that would help him solve this problem.
The first line of the standard input contains a single integer t (1 ≤ t ≤ 20) denoting the number of test cases. Each of the following t lines contains a description of one test case in the form of two integers ni and ki (1 ≤ ni, ki ≤ 106) separated by a single space.
To the standard output t lines should be written, containing the answers to respective test cases. The answer to one test case is the probability (in percent) that Jack wins the bet, rounded down to the nearest integer.
For the input data:
1 1 6
the correct result is:
Task author: Jakub Onufry Wojtaszczyk.
extremely fucking problem. same code after 30 submissions showed AC. Dont race with time while setting problems.
@shyam , There are no trick test cases as such. I wrote a straightforward dp solution and it passed.
YOU "Race with time" , atleast, explain the problems clearly, hiding something is not going to make you best coder or best problem setter.......what this pips represent, what "exactly k pips in total" means, you are the one who is
wrong answer ...any trick test cases??
A pip is simply one of those marks on the face of a die. So "exactly k pips in total" should be interpreted as "a sum of k".