Cod sursa(job #2663100)
Utilizator | Data | 25 octombrie 2020 13:07:00 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
bool sir[2000001];
int main()
{
long long N,i,s=0,j;
in>>N;
sir[1]=1;
for(i=2; i<=N; i++)
{
if(sir[i]==0)
{
s=s+1;
if(i*i<=N)
{
for(j=i+i; j<=N; j=j+i)
sir[j]=1;
}
}
}
out<<s;
return 0;
}