题目链接:http://www.ifrog.cc/acm/problem/1010
1010 - Alarm
Time Limit:1s Memory Limit:128MByte
Submissions:347Solved:116
DESCRIPTION
Given a number sequence
[
3
,
7
,
22
,
45
,
116
,
.
.
.
]
[3,7,22,45,116,…]. Please tell me the
k
k-th number.
INPUT
A number
T
(
T
<
100
)
T (T<100) indicates the number of the input cases. Then for each case there only is one integer
k
(
1
≤
k
≤
10000
)
k (1≤k≤10000).
OUTPUT
For each case, ouput the
k
k-th number of the sequence in one line.
SAMPLE INPUT
2
1
4
SAMPLE OUTPUT
3
45
Submit summary Discuss
【题目分析】
这个题是一道找规律的题目:汇率为第n个数为第n个素数的平方减去n;
筛法筛一遍素数,然后直接暴力就OK了,注意数据范围。
下面是AC代码:
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define N 150000
bool isprime[N];
long long prime[N],nprime;
long long a[10005];
void doprime()
{
long long i,j;
nprime=1;
memset(isprime,true,sizeof(isprime));
isprime[1]=false;
for(long long i=2;i<N;i++)
{
if(isprime[i])
{
prime[nprime++]=i;
for(long long j=2*i;j<N;j+=i)
{
isprime[j]=false;
}
}
}
}
void init()
{
for(long long i=1;i<=10000;i++)
{
a[i]=prime[i]*prime[i]-i;
}
}
int main()
{
doprime();
int n;
init();
int t;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
printf("%lld\n",a[n]);
}
return 0;
}