STROOQ - A complex yet very simple problem
Pattern Matchers have been designed for various sorts of patterns. Mr. HKP likes to observe patterns in numbers. After completing his extensive research on the squares of numbers, he has moved on to cubes. Now he wants to know all numbers whose cube ends in 888.
Given a number k, help Mr. HKP find the kth number (indexed from 1) whose cube ends in 888.
The first line of the input contains an integer t, the number of test cases. t test cases follow.(1<=t<=100000)
Each test case consists of a single line containing a single integer k (1 <= k <= 2000000000000).
For each test case, output a single integer which denotes the kth number whose cube ends in 888. The result will be less than 263.
Same problem description as Eights in classic.
How did you get past it wisfaq? I get RE even if split the entire stdin and try taking next integer in try/except block.
There seems to be something wrong with the testfiles.