Alarm

A -- Alarm

Time Limit：1s Memory Limit：128MByte

Submissions：179Solved：62

DESCRIPTION

Given a number sequence $[3,7,22,45,116,...][3,7,22,45,116,...].\; Please\; tell\; me\; the\; kk-th\; number.$

INPUT

A number $\mathrm{T (T<100)T (T<100)\; indicates\; the\; number\; of\; the\; input\; cases.\; Then\; for\; each\; case\; there\; only\; is\; one\; integer\; k (1\le k\le 10000)k (1\le k\le 10000).}$

OUTPUT

For each case, ouput the $\mathrm{kk-th\; number\; of\; the\; sequence\; in\; one\; line.}$

SAMPLE INPUT

2
1
4

SAMPLE OUTPUT

3
45

Submit summary Discuss

题解：第n个素数的平方-n；

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
#define N 1000000
int su[N+11]={1,1};
long long a[N];
void judge()
{
    memset(a, 0, sizeof(a));
    int i ,j;
    int t = 1;
    for(i = 2;i <= N ;i++)
    {
        if( su[i]==1)
        continue;
        else
        {
        a[t++]=i;
        for(j = i*2;j <= N;j+=i)
        su[j] = 1;
        }
        
    }
    
}
int main()
{
    int n,p;
    scanf("%d",&n);
    judge();
    while(n--)
    {
        scanf("%d",&p);
        long long ans = a[p]*a[p]-p;
        printf("%lld\n",ans);
    }
    
    return 0;
}