Cod sursa(job #2299745)
Utilizator | Data | 9 decembrie 2018 22:59:55 | |
---|---|---|---|
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");
int main()
{
int n,i,c=0,j;
bool v[2000000];
in>>n;
for(i=2; i<=n; i++)
v[i]=1;
for(i=2; i*i<=n; i++)
{
if(v[i]==1)
{
for(j=i*i; j<n; j+=i)
v[j]=0;
}
}
for(i=2; i<n; i++)
if(v[i]==1)
c++;
out<<c;
return 0;
}