Cod sursa(job #2542225)
Utilizator | Data | 9 februarie 2020 18:38:42 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
int ver[2000000]={0},nr;
int main()
{
ifstream f("ciur.in");
ofstream c("ciur.out");
long long n,i,j;
f>>n;
nr=1;
for(i=4;i<=n;i=i+2)
ver[i]=1;
for(i=3;i<=n;i=i+2)
if(ver[i]!=1)
for(j=i*i;j<=n;j=j+2*i)
ver[j]=1;
for(i=3;i<=n;i=i+2)
if(ver[i]!=1)
nr++;
c<<nr;
return 0;
}