Cod sursa(job #2587313)
Utilizator | Data | 22 martie 2020 17:10:11 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
int v[2000002];
int main()
{
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int n;
cin>>n;
for(int i=2; i<=n; i++)
if(v[i]!=1)
for(int j=2*i; j<=n; j+=i)
v[j]=1;
int k=0;
for(int i=2; i<=n; i++)
if(v[i]!=1)
k++;
cout<<k;
return 0;
}