Cod sursa(job #1324572)
Utilizator | Data | 22 ianuarie 2015 15:57:47 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <stdio.h>
#include <stdlib.h>
int c[2000000];
int main()
{
FILE *in,*out;
in=fopen("ciur.in","r");
out=fopen("ciur.out","w");
int N, Nr, i, j, x;
fscanf(in,"%d",&N);
for (i=2; i*i<=N; i++)
{
c[i]=0;
for (j=i*i; j<=N; j=j+1)
c[j]=1;
}
for(x=2; x<=N; x++)
if (c[x]==0)
Nr++;
fprintf(out,"%d", Nr);
return 0;
}