SPOJ Problem Set (classical)1030. Triple Fat LadiesProblem 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.
Input
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).
Output
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.
Example
Input: 1 1 Output: 192
All Submissions
Best Solutions
Point Value: 5
Time Limit: 2.00s
Memory Limit: 16M
Added: Apr 08, 2011
Languages Allowed:
C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3
Comments (Search)
For example, what happens when you input:
3
2000
2200
2400
11 --> This is t the rest is k.
1
200
500
753
102
Only 5/11 were output (explains the score). However, when I ran this, there were no issues, even when I put in numbers which might trip it up (20001, -19). Is the problem with my program, or the tester?
Generally speaking, if nearly 300 other people have solved the problem, and you have not, it's probably (but not always!) not an issue with the grader.
I've personally verified that your solution is incorrect.
Incidentally, there is no need to enter impossible input. The problem states that the bounds are 1 <= k <= 20000, and so you need not test anything outside that range.
Can somebody possibly help me?
If not can someone give me some sample cases so i can fix the problem?
There is a somewhat lack of sample cases.
Don't need anymore help.