【杂题】 HDOJ 4342 History repeat itself

水题~~~

#include <iostream>  
#include <queue>  
#include <stack>  
#include <map>  
#include <set>  
#include <bitset>  
#include <cstdio>  
#include <algorithm>  
#include <cstring>  
#include <climits>  
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 70005
#define maxm 3000005
#define eps 1e-10
#define mod 998244353
#define INF 999999999
#define lowbit(x) (x&(-x))
#define mp mark_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid  
#define rson o<<1 | 1, mid+1, R
#define debug(x) printf("AA x = %d BB\n", x);
//#pragma comment (linker,"/STACK:102400000,102400000")
typedef long long LL;
//typedef int LL;
using namespace std;
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
void scanf(int &__x){__x=0;char __ch=getchar();while(__ch==' '||__ch=='\n')__ch=getchar();while(__ch>='0'&&__ch<='9')__x=__x*10+__ch-'0',__ch = getchar();}
// head

LL num[maxn];

void init(void)
{
	num[0] = 0;
	for(int i = 1; i <= 46340; i++) num[i] = i*i;
}
int main(void)
{
	init();
	LL _, n, ans, x;
	while(scanf("%I64d", &_)!=EOF) {
		while(_--) {
			scanf("%I64d", &n);
			for(x = n; ; x++) if(x - (int)sqrt(x) == n) break;
			ans = 0;
			for(int i = 1; i <= 46340; i++)
				if(num[i] > x) {
					ans += (x - num[i-1] + 1) * (i-1);
					break;
				}
				else ans += (num[i] - num[i-1]) * (i-1);
			printf("%I64d %I64d\n", x, ans);
		}
	}
	return 0;
}