Cod sursa(job #2573047)
Utilizator | Data | 5 martie 2020 15:33:45 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
#define ios ios_base::sync_with_stdio(false);
#define nmax 2000005
using namespace std;
ifstream cin ("ciur.in");
ofstream cout ("ciur.out");
int i,j,n,nr=1;
char v[nmax];
int main()
{
ios;
cin.tie(0);
cout.tie(0);
cin>>n;
for (i=3;i<=n;i+=2){
if (!v[i]){
nr++;
for (j=2*i;j<=n;j+=i) v[j]++;
}
}
cout<<nr;
return 0;
}