Cod sursa(job #716088)
Utilizator | Data | 18 martie 2012 12:03:32 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
int n,s,d,nr,i;
fstream f("ciur.in",ios::in);
fstream g("ciur.out",ios::out);
f>>n;
nr=0;
for(i=2;i<=n;i++)
{
s=0;
for(d=2;d<=i/2;d++)
if(i%d==0)
s+=d;
if(s==0)
nr++;
}
g<<nr;
f.close();
g.close();
return 0;
}