Скачать или смотреть N Queens Puzzle Solved | EUREKA | February Long 2022 | Codechef | CodePlayJatin | Jatin Sharma

Chef, being a Chess fan, was thrilled after he read the following news:

Michael Simkin, a postdoctoral fellow at Harvard University’s Center of Mathematical Sciences and Applications proved that for a large value of N, there are approximately (0.143⋅N)N(0.143⋅N)N configurations in which N queens can be placed on a N×N chessboard so that none attack each other.

Although the formula is valid for large N, Chef is interested in finding the value of function f(N)f(N) = (0.143⋅N)N(0.143⋅N)N for a given small value of N. Since Chef is busy understanding the proof of the formula, please help him calculate this value.

Print the answer rounded to the nearest integer. That is, if the actual value of f(N)f(N) is xx,

Print ⌊x⌋⌊x⌋ if x−⌊x⌋ less than 0.5x−⌊x⌋ less than 0.5
Otherwise, print ⌊x⌋+1⌊x⌋+1

where ⌊x⌋⌊x⌋ denotes the floor of x


Input Format
The first line of input contains a single integer TT, denoting the number of test cases. The description of TT test cases follows.
Each test case consists of a single line of input containing one integer NN




Output Format
For each test case, output in a single line the value of f(N)f(N) rounded to the nearest integer.


How to round of floor value?
How to find nearest integer?
How to find nearest float?
How to find round of decimal value?