Cod sursa(job #2419945)
Utilizator | Data | 9 mai 2019 21:45:07 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
//#include <iostream>
#include <bits/stdc++.h>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int n,nr; bool viz[2000005];
int main()
{
in>>n;
for(int i=2;i<=sqrt(n);i++)
if(!viz[i])
for(int j=i+i;j<=n;j+=i)
viz[j]=1;
for(int i=2;i<=n;i++)
if(!viz[i])
nr++;
out<<nr;
return 0;
}