NGIRL - Namit In Trouble
Namit's girlfriend birthday is coming next week.He went to a gift shop and saw (N) gifts are arranged in a single row in such a way that the position at which the gift is placed is equal to its price.(Position starts from 1.)
Namit's girlfriend being a maths student like those numbers which have exactly 3 divisors, so Namit decide to buy only those gifts which are placed at a position which have only 3 divisors, but Namit's girlfriend likes gifts whose price are above a certain amount(K).
Now Namit wants to know total choices he have and how many gifts his girlfriend like for a given value of N.
Input starts with 1<=T<=1000 (number of test cases). Then T lines follows each containing two integer 1<=N<10^10 (number of gifts at gift shop) and 1<=K<=10^10.
You program should output two values indicating total number of choices and the number of gifts Namit's girlfriend like.
Output: 2 2
Dear author of this problem, Is there any particular reason for so tight time limit? Is there any non optimal solution which requires so strict time limit to make it invalid or is it just pure hate towards java programming language?
AC after 2 w.a.
Simple AC in one go:)
Can you change time limit from 0.009s-0.100s to 0.09s-0.100s for Java language?
AC :) After 2 W.A. Nice question.......
AC :)Last edit: 2017-03-21 06:33:44
How to avoid TLE
Got some errors since I assumed (n >= k), it isn't mentioned anywhere so it was a mistake on my part. assert(n >= k) gives a runtime error. Be careful :)
i am getting TLE , how to avoid that ???
Come on, it's not that unintellegible. Question of reading. I've seen much worse examples.