EIGHTS - Triple Fat Ladies
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.
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 <= 2000000000000).
Output
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.
Example
Input: 1 1 Output: 192
hide comments
emtiaz_001:
2019-08-27 16:57:11
ac in first go. just use the formula and try to understand the concept |
|
tanuj_yadav_07:
2019-06-08 11:17:47
use basic string multipplication and use AP formula Tn=192+(n-1)*250 === or use it Tn=n*250-58.
|
|
sjd:
2019-05-19 08:27:53
Nice concept :) |
|
knir0103:
2019-02-28 06:48:24
this blog not using formula: <snip> Last edit: 2022-08-07 10:45:19 |
|
aj_254:
2019-02-24 12:32:32
ac in first go ..just read in comments 192+(k-1)*250 and observer it ..and print it .happy coding. |
|
kushagra_2:
2019-01-19 20:52:31
c++ users please use long long instead of int AC in 3rd attempt.
|
|
dhia01:
2018-10-30 05:48:45
I hate spoiler but i love it :) |
|
phoemur:
2018-09-05 02:33:30
C++14 one liner !!
|
|
amitnsky:
2018-08-16 11:04:24
reason behind AP is that we need some number after adding that last three digits should not disturbed of 192^3.
|
|
bansalabhi_98:
2018-06-27 09:00:44
@sreejoy4242 why separate case for k==1
|
Added by: | Matthew Reeder |
Date: | 2006-10-30 |
Time limit: | 1.197s |
Source limit: | 30000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ERL JS-RHINO NODEJS PERL6 VB.NET |
Resource: | Al-Khawarizm 2006 |