Cod sursa(job #2397892)
Utilizator | Data | 4 aprilie 2019 20:59:46 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<bits/stdc++.h>
using namespace std;
int v[2000000],c;
int main(){
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n;
fin>>n;
for(int i=2;i<=n;i++){
if(v[i]==0){
for(int j=i*i;j<=n;j+=i){
v[j]=1;
}
}
}
for(int i=2;i<=n;i++){
if(v[i]==0) c++;
}
fout<<c;
return 0;
}