Cod sursa(job #2515486)
Utilizator | Melvin Abibula MerlinTheWizard | Data | 28 decembrie 2019 18:03:24 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<iostream>
#include<fstream>
#include<math.h>
using namespace std;
int n,nr_div,contor,k=2;
bool v[2000001];
int main(){
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(int i=2;i<=n;i++){
if(v[i]==false)
for(int j=i*2;j<=n;j=j+i)
v[j]=true;
}
for(int i=2;i<=n;i++)
if(v[i]==false)
contor++;
g<<contor;
}