Cod sursa(job #2659082)
Utilizator | Data | 15 octombrie 2020 19:51:37 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool v[2000001];
int main()
{ long long n,j,i,p=0;
in>>n;
for(int i=2;i*i<=n;i++)
{
if(v[i]==0)
for(j=i;j<=(n/i);j++)
v[i*j]=1;
}
v[1]=1;
for(i=2;i<=n;i++)
{
if(v[i]==0)
p++;
}
out<<p;
return 0;
}