Cod sursa(job #2989566)
Utilizator | Data | 6 martie 2023 19:28:40 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
#define f first
#define s second
int n,v[2000005],c;
int main()
{
fin>>n;
for(int i=2;i<=n;++i)
{
if(!v[i])
{
++c;
for(int j=i+i;j<=n;j+=i)
v[j]=1;
}
}
fout<<c;
return 0;
}