Cod sursa(job #2354534)
Utilizator | Data | 25 februarie 2019 12:52:42 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in") ;
ofstream fout("ciur.out") ;
int n , v[2000005] , nr;
int ciur(int n)
{
for(int i=2; i<=n; i++)
if(v[i] == 0)
{
nr ++ ;
for(int j=i+i; j<=n; j=j+i)
v[j] = 1 ;
}
}
int main()
{
fin >> n ;
ciur(n) ;
v[1] = 1 ;
fout << nr ;
return 0;
}