Cod sursa(job #238553)
Utilizator | Data | 2 ianuarie 2009 16:08:17 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<stdio.h>
long int k=0,i,j,n;
int v[2000001];
int main()
{
FILE *f=fopen("ciur.in","r"), *g=fopen("ciur.out","w");
fscanf(f,"%ld",&n);
for (i=2;i<=n'++i)
if (!v[i])
{
k++;
for(j=i;j<=n;j+=i)
v[i]=1;
}
fprintf(g,"%ld",k);
}