Alarm

DESCRIPTION

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

INPUT

A number $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)$.

OUTPUT

For each case, ouput the $k$-th number of the sequence in one line.

SAMPLE INPUT

2
1
4

SAMPLE OUTPUT

3

45

规律题 对素数打表 第n个数表示第n个素数的平方减去n

3=2*2-1； 7=3*3-2； 22=5*5-3；

打两个表即可

#include<cstdio> #include<cstring> long long su[150001]; long long cun[150001]; void dabiao() { memset(su,0,sizeof(su));     long long i,j;  for(i=2;i<150001;i++) { if(su[i]==1) continue; for(j=i*2;j<150001;j+=i) { su[j]=1; } } su[1]=1; su[2]=0; } void find() {        long long  cut=1; for(long long i=2;i<150001;i++) { if(su[i]==0) { cun[cut]=i*i-cut; cut++; } } } int main() { dabiao();        find();     long long t;   scanf("%lld",&t); long long n; while(t--) { scanf("%lld",&n);     printf("%lld ",cun[n]); } return 0; }