Triple Fat Ladies

View as PDF

Submit solution

Points: 5
Time limit: 1.0s
Memory limit: 16M
C# 32M

Problem types

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 1^\text{st} number larger than k whose cube ends in 888.

Input Specification

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 \le k \le 20\,000).

Output Specification

For each test case, output a single integer which denotes the 1^\text{st} number larger than k whose cube ends in 888. The result will be less than 2^{63}.

Sample Input


Sample Output



  • 2
    mucube0  commented on Feb. 9, 2024, 7:23 p.m.

    If you're too lazy to convert each k to a string you can always use modulo to get the digits

  • -3
    mateobarbosa  commented on Oct. 22, 2023, 10:27 p.m.

    for the c++ or c or c# gamers out there make sure to use a long instead of an int for the numbers that you will be cubing. I TLEd on this problem i was using an int and the number was defaulting to int limit

  • 16
    iam  commented on Jan. 21, 2022, 9:01 p.m. edited

    The explanation of this one was a little bit vague, so this may help you if you are stuck:

    The first number is the NUMBER OF INPUTS, each of which is then processed individually. I initially started trying to do x number of items starting from 1.

    A sample output with more than 1 test case would look like this:

    INPUTS: 3 1 900 10000

    OUTPUTS: 192 942 10192