Cod sursa(job #1512558)
Utilizator | Data | 28 octombrie 2015 11:32:51 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include<algorithm>
using namespace std;
const int N=2000001;
bool c[N];
int main()
{
int n,i,j,nr=0;
ifstream in("ciur.in");
ofstream out("ciur.out");
in>>n;
for(i=2;i*i<N;i++)
if(not c[i])
for(j=i*i;j<N;j+=i)
c[j]=true;
nr=0;
for(i=2;i<=n;i++)
if(not c[i])
nr++;
out<<nr;
in.close();
out.close();
return 0;
}