Cod sursa(job #539342)
| Utilizator |  constantin sorin constantinsorin |
Data | 22 februarie 2011 21:08:02 |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.29 kb |
#include<fstream.h>
ifstream fin("ciur.in");
ofstream fout("ciur.out");
long n;
unsigned char a[2000000];
int main()
{
int i,j,nr;nr=0;
fin>>n;
memset(a,1,sizeof(a));
a[1]=0;
for(i=2;i*i<=n;i++)
for(j=i+1;j<=n;j++)
if(a[i]!=0)
if(j%i==0)nr++;
fout<<n-nr;
return 0;
}