Cod sursa(job #2409371)
Utilizator | Data | 18 aprilie 2019 22:36:21 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
const int NMAX=2000001;
int a[NMAX],N;
int main(){
fin>>N;
a[0]=a[1]=1;
for(int i=2;i<=N;i++)
for(int j=2;i*j<=N;j++)
a[i*j]=1;
int total=0;
for(int i=1;i<=N;i++)
if(a[i]==0)
total++;
fout<<total;
fin.close();
fout.close();
return 0;}