Cod sursa(job #1881805)
| Utilizator | Data | 16 februarie 2017 19:02:21 | |
|---|---|---|---|
| Problema | Sum | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("sum.in");
ofstream g("sum.out");
int p,n,S,a[100001];
void ciur()
{
int i,j;
S=0;
for(i=2;i<=n*2;i++)
a[i]=1;
for(i=2;i<=n*2;i++)
if(a[i]==1)
for(j=2;j<=n*2/i;j++)
a[i*j]=0;
for(i=2;i<=n*2;i++)
if(a[i]!=0)
S+=i;
}
int main()
{
f>>p;
while(p!=0)
{
f>>n;
ciur();
S+=n;
g<<S<<"\n";
p--;
}
f.close();
g.close();
return 0;
}
