Cod sursa(job #490129)
| Utilizator | Data | 4 octombrie 2010 23:22:49 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include "stdio.h"
using namespace std;
char v[2000010];
int main()
{
int n,i,nr(0),j;
FILE* f=fopen("ciur.in","r");
FILE* g=fopen("ciur.out","w");
fscanf(f,"%d",&n);
for(i=2;i<=n;i++)
v[i]=0;
for(i=2;i<=n;i++)
if(v[i]==0)
for(j=i*i;j<=n;j=j+i)
v[j]=1;
for(i=2;i<=n;i++)
if(v[i]==0)
nr++;
fprintf(g,"%d",nr);
fclose(f);
fclose(g);
return 0;
}
