Cod sursa(job #2672722)
| Utilizator | Data | 14 noiembrie 2020 16:07:28 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int v[2000005];
int main()
{
/*
int n;
bool ok=1;
cin>>n;
if(n<2 || n>2 && n%2==0){
ok=0;
}
for(int i=3; i*i<=n; i=i+2)
if(n%i==0){
ok=0;
break;
}
cout<<ok;*/
int n,k;
k=0;
f>>n;
for(int i=2; i<=n; i++)
{
if(v[i]==0)
{
for(int j=2*i; j<=n; j=j+i)
v[j]=1;
k++;
}
}
g<<k;
return 0;
}
