Cod sursa(job #2563617)
Utilizator | Data | 1 martie 2020 12:57:41 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int v[2000007];
int main()
{
int n,i,j,nrp;
in>>n;
nrp=0;
v[0]=1;
v[1]=1;
for(i=2; i*i<=n; i++)
if(v[i]==0)
for(j=i*i; j<=n; j=j+i )
{v[j]++;
}
for(i=1;i<=n;i++)
if(v[i]==0)
nrp++;
out<<nrp;
return 0;
}