SPOJ EIGHTS - Triple Fat Ladies（规律）

最新推荐文章于 2019-01-03 17:46:21 发布

qq_34287501

最新推荐文章于 2019-01-03 17:46:21 发布

阅读量358

点赞数

分类专栏： SPOJ 文章标签：数学

本文链接：https://blog.csdn.net/qq_34287501/article/details/70226298

版权

SPOJ 专栏收录该内容

4 篇文章 0 订阅

订阅专栏

题目链接：http://www.spoj.com/problems/EIGHTS/en/

EIGHTS - Triple Fat Ladies

#ad-hoc-1

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

Submit solution!

题意：求第k个立方以888结尾的数

解析：由于数据比较大，不可能一一枚举，那咱可以开个循环找下规律，其实每个立方以888结尾的数相差250

代码：

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<map>
#include<cmath>
#include<string>
#define N 5009
using namespace std;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
typedef long long LL;

int main()
{
    LL k;
    int t;
    scanf("%d", &t);
    while(t--)
    {
        cin >> k;
        LL ans = 192 + (k - 1) * 250;
        cout << ans << endl;
    }
}