Cod sursa(job #2277245)
| Utilizator | Data | 5 noiembrie 2018 21:44:58 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,i,j,cnt;
bool v[2000010];
int main(){
fin>>n;
v[1]=1;
for(i=2;i<=n;i++){
if(v[i]==0){
cnt++;
for(j=i+i;j<=n;j+=i)
v[j]=1;
}
}
fout<<cnt;
return 0;
}
