Cod sursa(job #304598)
Utilizator | Data | 14 aprilie 2009 13:54:50 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<iostream.h>
#include<stdio.h>
FILE *f=fopen("ciur.in","r"),*g=fopen("ciur.out","w");
int main()
{
long n,a[2000001];
long nr=0;
fscanf(f,"%ld\n",&n);
long i,j;
for(i=2;i<=n;i++)
a[i]=1;
a[1]=0;
for(i=2;i<=n;i++)
if(a[i])
{
for(j=i+i;j<=n;j+=i)
a[j]=0;
}
for(i=1;i<=n;i++)
if(a[i]) nr++;
fprintf(g,"%ld ",nr);
return 0;
}