Cod sursa(job #1863659)
Utilizator | Data | 31 ianuarie 2017 08:39:20 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
const int Nmax=2000000+5;
int n;
bool c[Nmax];
int main()
{
f>>n;
int nr=0;
for(int i=2;i<=sqrt(n);++i)
{
if(!c[i])
for(int j=i*i;j<=n;j+=i)
c[j]=1;
}
for(int i=2;i<=n;++i)
if(!c[i])++nr;
g<<nr;
return 0;
}