Cod sursa(job #1533838)
Utilizator | Data | 23 noiembrie 2015 01:55:17 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <iostream>
#define MAX 2000000
using namespace std;
int v[MAX];
int main()
{
int n,nr=1;
cin>>n;
for(int i=3;i<=n;i+=2)
{
if(v[i]==0)
{
nr++;
for(int j=i;j<=n;j+=i)
v[j] = 1;
}
}
cout<<nr;
}