Cod sursa(job #550150)
| Utilizator |  Alin Mogis Aliking |
Data | 9 martie 2011 11:54:20 |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.28 kb |
#include<fstream.h>
#include<math.h>
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
long long n,i,d,s=0,p,x;
fin>>n;
for(i=2;i<=n;i++)
{
x=sqrt(i);
p=0;
for(d=2;d<=x&&p==0;d++)
if(i%d==1) p++;
if(p==0) s++;
}
fout<<s;
return 0;
}