Cod sursa(job #2499199)
Utilizator | Data | 25 noiembrie 2019 17:34:46 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{ long long n,nr=0,i,j;
bool v[2000010]={0};
in>>n;
for(i=2;i<=n;i++)
{
if(v[i]==0)
{ nr++;
for(j=i;j<=n;j+=i)
{
v[j]=1;
}
}
}
out<<nr;
return 0;
}