Cod sursa(job #2554088)
Utilizator | Data | 22 februarie 2020 16:21:21 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int n,k,q,t;
bool a[2000001];
int main()
{
in>>n;
q=sqrt(n);
a[1]=1;
for(int i=2;i<=q;i++)
if(a[i]==0)
{
k=n/i;
for(int j=i;j<=k;j++)
a[i*j]=1;
}
for(int i=2;i<=n;i++)
if(a[i]==0) t++;
out<<t;
}