Cod sursa(job #776871)
Utilizator | Data | 10 august 2012 16:13:16 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
#include <stdio.h>
#include <math.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
bool a[10000];
int nr=0, n , i , j;
fin>>n;
for(i=2; i<=n; i++)
if(a[i]==0)
{ nr++;
for(j=i+i; j<=n; j+=i)
a[j]=1;
}
fout<<nr;
return 0;
}