SPEC_SET - Special Set
Little boy Sai is fascinated with Natural Numbers. He especially likes Special Sets of order k. A set of numbers S, is called Special Set of order k if, for any two numbers x and y (not necessarily distinct) belonging to S, x should not be equal to k*y.
Now, Sai wants to find the size of maximum possible Special Set formed out of the numbers 1,2,3...n. Hope you can help him.
First line contains t(1<=t<=105), the number of test cases. Next t lines contain two space separated integers n and k.
For each test case, output on a single line the size of maximal Special set.
6 2 Output:
For the above case, the maximal Special set is: 1,3,4,5
finaaly AC!! my stupidity costed me so many tle's wa..Last edit: 2014-03-06 18:35:10
Can u check what is wrong with my solution??
nice oneLast edit: 2014-03-06 18:07:37
The constraint that x should not be equal to k*y also applies to x=y.