Pagini recente » Borderou de evaluare (job #1878561) | Borderou de evaluare (job #2013968) | Cod sursa (job #2646662) | Cod sursa (job #1461494) | Cod sursa (job #1779338)
#include<fstream>
using namespace std;
ifstream fi("sum.in");
ofstream fo("sum.out");
bool E[100001];
long long P[100001];
int n,i,x;
void e(int n)
{
int i,j;
for(i=1; ((i*i)<<1)+(i<<1)<=n; i++)
{
if(E[i]==0)
{
for(j=((i*i)<<1)+(i<<1); (j<<1)+1<=n; j+=(i<<1)+1)
{
E[j] = 1;
}
}
}
P[++P[0]]=2;
for(i=1; 2*i+1<=n; i++)
if(E[i]==0)
P[++P[0]]=P[P[0]-1]+2*i+1;
}
int main()
{
e(200000);
fi>>n;
for(i=1; i<=n; i++)
{
fi>>x;
fo<<P[x+1]<<"\n";
}
fi.close();
fo.close();
return 0;
}