Cod sursa(job #2506534)
Utilizator | Data | 8 decembrie 2019 12:51:59 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,v[200000],nr;
int main()
{ cin >> n;
for (int i = 2;i <=n; i++){
if(v[i]==0){
for( int j = i+i;j<=n;j+=i)
v[j]=1;
nr++;
}
}
cout<<nr;
return 0;
}