Cod sursa(job #1053208)
Utilizator | Data | 12 decembrie 2013 15:23:52 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
const int N = 2000001;
int nr,i,j,n;
bool c[N];
int main()
{
//cout << "Hello world!" << endl;
f>>n;
for(i=2 ; i*i<=n ; i++)
if(!c[i])
for(j=i*i ; j<=n ; j+=i)
c[j] = true;
for(i=2;i<=n;i++)
if(c[i]==false)
nr++;
g<<nr;
return 0;
}