Cod sursa(job #2186570)
Utilizator | Data | 25 martie 2018 19:04:54 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <bits/stdc++.h>
using namespace std;
int main(){
ifstream input("ciur.in");
ofstream print("ciur.out");
bool prim[2000005];
int n,ans=0;
input>>n;
memset(prim,true,sizeof(prim));
for(int i=2;i<=n;++i)
if(prim[i]){
++ans;
for(int j=i+1;j<=n;j+=i)
prim[j]=false;
}
print<<ans-1;
input.close();
print.close();
return 0;
}