Cod sursa(job #2631841)
Utilizator | Melvin Abibula MerlinTheWizard | Data | 1 iulie 2020 13:09:42 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("ciurul.in");
ofstream g("ciurul.out");
int n;
int nrprim=0;
bool v[2000005];
int main()
{
f>>n;
for(int i=2;i<n;i++)
if(v[i]==false)
for(int j=i*i;j<=n;j=j+i)
v[j]=true;
for(int i=2;i<=n;i++)
if(v[i]==false)
nrprim++;
g<<nrprim;
}