Alarm（找规律）

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

位置所对应质数的平方减去位置大小

    
    

     
     

      
      

       
       [cpp] 
       
       view plain
       
        copy
       
       

       
        print
       
       ?
       
       
       
       
      
      
     
     
     
     
#include<stdio.h>  
#include<algorithm>  
#include<iostream>  
using namespace std;  
 long long  a[10000000],b[3000000],i,j;  
int main()  
{  
    long long  n,m,t;  
    long long  l=1;  
    for(i=2;i<=10000000;i++)  
    {  
    if(a[i]==0)  
{for(j=i+i;j<10000000;j=j+i)  
    a[j]=1;}}  
    for( i=2;i<10000000;i++)  
    {if(a[i]==0)  
    b[l++]=i*i;}  
    scanf("%lld",&t);  
    while(t--)  
    {  
    scanf("%lld",&n);  
   printf("%lld\n",b[n]-n);  
    }  
}