Cod sursa(job #2618340)
Utilizator | Angelescu Andreea AndreeaChitu | Data | 24 mai 2020 18:06:28 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
//#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
ifstream cin("ciur.in");
ofstream cout(" ciur.out");
int main()
{
long long int bun[100000], i, n, m, nr=0;
m= 100000;
cin >> n;
for(i=2; i<=n; i++)
bun[i] = true;
for(i = 2; i<=n; i++)
{
if(bun[i]==true)
{
for(int j=2; j*i<=n; j++)
bun[i*j]= false;
}
}
for(int i=2; i<=n; i++)
if(bun[i])
nr++;
cout << nr;
return 0;
}