Cod sursa(job #2724423)
Utilizator | Data | 17 martie 2021 00:32:26 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | c-32 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <stdio.h>
#include <stdlib.h>
int main()
{
int n,nr=0,i,j;
FILE *in=fopen("ciur.in","r");
FILE *out=fopen("ciur.out","w");
fscanf(in,"%d",&n);
char a[150000] = {0};
for (i=2;i<=n;i++)
{
if (a[i]==0)
{
nr++;
for(j=2*i;j<=n;j+=i)
a[j]=1;
}
}
fprintf(out,"%d",nr);
fclose(in);
fclose(out);
return 0;
}