Cod sursa(job #2157796)
Utilizator | Data | 9 martie 2018 22:20:22 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
long long n, s;
bool v[2000004];
int main()
{
fin>>n;
if(n>1)
s++;
for(long long i=3; i<=n; i+=2)
if(v[i]==false) {
s++;
for(long long j=i*i; j<=n; j+=i)
v[j]=true;
}
fout<<s;
return 0;
}