Cod sursa(job #903291)
| Utilizator | Data | 1 martie 2013 19:47:31 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include<fstream>
using namespace std;
char v[2000000];
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int c,n,i,j,t,i2,rest;
fin>>t;
c=0;
for(i2=1;i2<=t;i2++)
{
fin>>n;
for(i=2;i<=n;i++)
{
if(v[i]==0)
{
c++;
rest+=i;
for(j=i+i;j<=n;j=j+i)
{
v[j]=1;
}
}
}
}
fout<<c;
fout<<rest%9973;
fin.close();
fout.close();
return 0;
}
