Cod sursa(job #1383807)
Utilizator | Data | 10 martie 2015 17:48:04 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<stdio.h>
#include <stdlib.h>
int main(){
long n, *a;
int i,j;
long result=0;
FILE *f,*g;
f = fopen("ciur.in","r");
g = fopen("ciur.out","w");
fscanf(f,"%ld",&n);
a = (long *)calloc(n, sizeof(long));
a[0] = a[1] = 1;
for(i=2;i<=n;i++)
{
if(a[i] == 0){
for(j=i+i;j<=n;j+=i)
a[j] = 1;
result ++;
}
}
fprintf(g,"%ld",result);
return 0;
}