Cod sursa(job #776880)
Utilizator | Data | 10 august 2012 16:27:09 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
char a[2000001];
int nr, n , i , j;
int main()
{
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;
}