SPOJ Problem Set (classical)
1030. Triple Fat Ladies
Problem code: EIGHTS
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 1st number larger than k whose cube ends in 888.
The first line of the input contains an integer t, the number of test cases. t test cases follow.
Each test case consists of a single line containing a single integer k (1 ≤ k ≤ 20000).
For each test case, output a single integer which denotes the 1st number larger than k whose cube ends in 888. The result will be less than 263.
Input: 1 1 Output: 192
Point Value: 5
Time Limit: 2.00s
Memory Limit: 16M
Added: Apr 08, 2011
C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3