Cod sursa(job #2471832)
Utilizator | Data | 11 octombrie 2019 16:47:36 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | basic_stuff | Marime | 0.48 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int v[100000];
int main()
{
int n;
fin>>n;
int i;
for(i=2; i*i<=n; i++)
{
if(v[i]==0)
{
int x=i;
while(x<n)
{
x+=i;
v[x]=1;
}
}
}
int cnt=0;
for(i=2; i<=n; i++)
if(v[i]==0) cnt++;
fout<<cnt;
return 0;
}