All Tracks Math Problem

An Unfair Game
Tag(s):

Easy-Medium

Problem
Editorial
Analytics

Appro and Gupt play a series of games in which the probability of Appro winning each game is 2/5. If they play $$N$$ games, what is the probability that Gupt will win at least $$K$$ games?

Input:

The first line of input contains single integer $$T$$ denoting the number of test cases.

Each test case contains 2 space separated integers $$K$$ and $$N$$ as specified in the problem.

Output:

For each test case print the required answer. Output must have exactly 6 digits after decimal.

Constraints:

$$ 1\le T \le 10 $$

$$0\le K \le N \le 10^6 $$

SAMPLE INPUT
1
2 3
SAMPLE OUTPUT
0.648000
Time Limit: 1.0 sec(s) for each input file.
Memory Limit: 256 MB
Source Limit: 1024 KB
Marking Scheme: Marks are awarded when all the testcases pass.
Allowed Languages: C, C++, Clojure, C#, D, Erlang, F#, Go, Groovy, Haskell, Java, Java 8, JavaScript(Rhino), JavaScript(Node.js), Lisp, Lisp (SBCL), Lua, Objective-C, OCaml, Octave, Pascal, Perl, PHP, Python, Python 3, R(RScript), Racket, Ruby, Rust, Scala 2.11.8, Swift, Visual Basic

CODE EDITOR

Initializing Code Editor...
Your Rating:

Contributor

Notifications
View All Notifications