Cod sursa(job #2218804)
Utilizator | Data | 5 iulie 2018 20:59:12 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <cstdio>
using namespace std;
char ciur[2000000];
int main()
{ int n,i,nr=0;
FILE *f = fopen("ciur.in","r");
FILE *g = fopen("ciur.out","w");
fscanf(f,"%d",&n);
for(i=2;i<=n;i++)
{
if(!ciur[i])
{
nr++;
int j=i;
while(j<=n)
{ j=j+i;
ciur[j]=1;
}
}
}
fprintf(g,"%d",nr);
return 0;
}