Cod sursa(job #910605)
Utilizator | Data | 10 martie 2013 21:38:32 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <cstdio>
FILE *fin=fopen("ciur.in", "r"), *fout=fopen("ciur.out", "w");
using namespace std;
int n, nr, i, j;
bool c[2000000];
int main()
{
fscanf(fin, "%d", &n);
for(i=2;i<=n;i++)
if(!c[i])
{
c[i]=1;
nr++;
for(j=i;j<=n;j+=i)
c[j]=1;
}
fprintf(fout, "%d\n", nr);
return 0;
}