Cod sursa(job #716085)
Utilizator | Data | 18 martie 2012 11:58:01 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 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=1;i<=n;i++)
{
s=0;
d=2;
while(s<=i/2)
{
if(i%d==0)
s+=d;
d++;
}
if(s==0)
nr++;
}
g<<nr;
f.close();
g.close();
return 0;
}