Cod sursa(job #1331405)
Utilizator | Data | 31 ianuarie 2015 16:42:27 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int n,p,d,sw,nr
;
int main()
{ nr=1;
fin>>n;
for(p=3;p<=n;p=p+2)
{sw=1;
for(d=2;d<=n/2-1;d++)
if(p%d==0&&p!=d)
sw=0;
if(sw==1)
nr++;
}
fout<<nr;
return 0;
}