Go: package main

import (
    "fmt"
    "bufio"
    "os"
    "strconv"
)

func main() {
    var limit = 1000000
    var root = 1000
    var isPrime [1000000]bool
    for i := 0; i < limit; i++ {
        isPrime[i] = true
    }
    isPrime[0] = false
    isPrime[1] = false
    for i := 2; i <= root; i++ {
        if isPrime[i] {
            for j := i * i;j < limit; j+=i {
                isPrime[j] = false
            }
        }
    }
    var primeCnt [1000000]int
    var cnt = 0
    for i := 0; i < limit; i++ {
        if isPrime[i] {
            cnt++
        }
        primeCnt[i] = cnt
    }

    var sc = bufio.NewScanner(os.Stdin)
    for sc.Scan() {
        n, _ := strconv.Atoi(sc.Text())
        fmt.Println(primeCnt[n])
    }
}

C++: #include <iostream>
#include <cstring>
using namespace std;

bool is_prime[1000000];
int number[1000000] = {0};
void init_prime() {
    memset(is_prime, true, 1000000);
    for (int i = 2; i <= 999999; i++) {
        if (is_prime[i]) {
            number[i] = number[i-1]+1;
            for (int j = 2*i; j <= 999999; j+=i)
                is_prime[j] = false;
        } else
            number[i] = number[i-1];
    }
}

int main() {
    init_prime();

    int n;
    while (cin >> n) {
        cout << number[n] << endl;
    }
    return 0;
}

C++: #include <iostream>

int main(){
	int n,d=0;
	
	while(std::cin>>n){
		int N=n;
		for(int a;a<=n;a++){
			for(int b;b<n;b++){
				int c=a/b;
				if(a==c*b){
					d=1;
				}
			}
			if(d==1){
				d=0;
				N--;
			}
		}
		std::cout<<N<<std::endl;
	}
	return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
#define Max 1000005
bool vis[Max];
int prime[Max],cnt;
void print_prime()
{
    memset (vis,false,sizeof (vis));
    for (long long i=2;i<=sqrt(Max);i++)
        if (!vis[i])
        for (long long j=i*i;j<=Max;j+=i)
        vis[j]=true;
    for (long long i=2;i<=Max;i++)
        if (!vis[i])
        prime[cnt++]=i;
}
int main()
{
    print_prime();
    int n;
    while (scanf("%d",&n)!=EOF) {
        int i=0;
        while (prime[i]<=n) {
            i++;
        }
        printf("%d\n",i);
    }
    return 0;
}

C++: #include <iostream>
#include <vector>
using namespace std;

bool isChecked[1000010];
vector <int> prime;

int CountPrimeNum(int max) {
	
	int count = 0;
	for (int i = 0; i < 1000000; i++) {
		if (prime[i] > max) break;
		count++;
	}	
	return count;
}


int main() {
	for(int i = 0; i < 1000000; i++) {
		isChecked[i] = false;
	}
	
	isChecked[0] = true;
	isChecked[1] = true;
	
	for (int i = 2; i < 1000000; i++) {
		if(isChecked[i]) continue;
		
		prime.push_back(i);
		
		for (int j = 1;j * i < 1000000;j++) {
			isChecked[i*j] = true;
		}
	}
	
	int n;
	while(cin >> n) {
		cout << CountPrimeNum(n) << endl;
	}
	
	return 0;
}

C++: #include <iostream>
using namespace std;
#define MAX_N 999999 + 16
 
int  prime[MAX_N];			
bool is_prime[MAX_N + 1];	
int sieve(const int& n)
{
	int p = 0;
	fill(is_prime, is_prime + n + 1, true);
	is_prime[0] = is_prime[1] = false;
	for (int i = 2; i <= n; ++i)
	{
		if (is_prime[i])
		{
			prime[p++] = i;
			for (int j = 2 * i; j <= n; j += i)
			{
				is_prime[j] = false;
			}
		}
	}
	return p;
}
 
int main(int argc, char *argv[])
{
	int n;
	while (cin >> n)
	{
		cout << sieve(n) << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>

#define REP(i,n) for(long (i)=0;(i)<(n);(i)++)
#define FOR(i,a,b) for(long (i)=(a);(i)<(b);(i)++)
#define RREP(i,a) for(long (i)=(a)-1;(i)>=0;(i)--)
#define FORR(i,a,b) for(long (i)=(a)-1;(i)>=(b);(i)--)
#define MOD 1000000007
#define PI acos(-1.0)
#define DEBUG(C) cout<<C<<endl;
#define PII pair<int,int>
#define PDD pair<double,double>
#define PLL pair<long,long>
#define ALL(a) (a).begin(),(a).end()
#define SORT(a) sort((a).begin(),(a).end())
#define RSORT(a) sort((a).begin(),(a).end(),greater<int>())
#define MP(a,b) make_pair(a,b)
#define FORE(a,b) for(auto &&a:b)

typedef long long LL;
typedef unsigned long long ULL;

using namespace std;

template<typename T>
list<T> SieveOfEratosthenes(T a){
    list<T> num,res;
    for(T i=2;i<=a;i++) num.push_back(i);
    for(auto i=num.begin();(*i)*(*i)<=a;){
        T n=*i; res.push_back(*i); i++;
        for(auto j=num.begin();j!=num.end();){
            if(*j%n==0) j=num.erase(j);
            else j++;
        }
    }
    for(auto i=num.begin();i!=num.end();i++) res.push_back(*i);
    return res;
}

int main(void){
	int n;
	while(cin>>n) cout<<SieveOfEratosthenes(n).size()<<endl;
}

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<cstdio>
#include<cstring>
using namespace std;

#define rep(i,n) for(int i=0;i<n;i++)
#define REP(n) rep(i,n)
#define all(n)
const int MAXN = 1000000;

int p[MAXN];

int main()
{
    p[0] = p[1] = 1;
    REP(MAXN)if(!p[i])for(int j=i*2;j<MAXN;j+=i)p[j]=1;

    int n, ans;
    while(cin >> n)
    {
        ans = 0;
        REP(n + 1) ans += !p[i];
        cout << ans << endl;
    }

    return 0;
}

C++: #include <cmath>
#include <iostream>
#include <vector>

using namespace std;

int sosuu(int n) {
    vector< int > list;
    for (int i = 2; i <= n; i++) {
        list.push_back(i);
    }
    int count = 0;
    int p;
    while (true) {
        p = list[count];
        count++;
        for (int i = 0; i < list.size(); i++) {
            if (list[i] % p == 0 && list[i] != p) {
                list.erase(list.begin() + i);
                i--;
            }
        }
        if (list.size() > sqrt(n)) break;
    }
    // for (int i = 0; i < list.size(); i++) {
    //     cout << list[i] << " ";
    // }
    // cout << endl;
    return list.size();
}

int main() {
    int a;
    while (!cin.eof()) {
        cin >> a;
        if (std::cin.fail()) break;
        cout << sosuu(a) << endl;
    }

    return 0;
}

C++: #include<stdio.h>
#include<math.h>
#include<stdlib.h>

int main()
{
	int n, i, j, k=1, wareru=0;
	int sosu[500000];
	sosu[0] = 2;
	for (i = 3; i < 1000000; i += 2)
	{
		wareru = 0;
		for (j = 3; j <= sqrt(i*1.0); j += 2)
		{
			if (i%j == 0)
			{
				wareru = 1;
				break;
			}
		}
		if (wareru == 0)
		{
			sosu[k++] = i;
		}
	}

	while (scanf("%d", &n) != EOF)
	{
		for (i = 0; (sosu[i] <= n) && (sosu[i] != NULL); i++);
		printf("%d\n", i);
	}
	return 0;
}

C++: #include<stdio.h>
int main(void){
   int s[10000], l, m, n, i, k, sum;
   sum = 0;
   for ( i = 1; i <= 1000000; i++ ) {
      s[i] = 0;
   }
   for ( k = 2; k <= 1000000; k++ ){
      if (s[k] == 0) {
         for ( l = 2; l <= 100000 / k; l++ ) {
            s[k * l] = 1;
         }
      }
   }
   while(scanf("%d", &n) != EOF){
      for(i = 1; i <= n; i++){
         if(s[i] == 0){
            sum++;
         }
      }
   printf("%d", sum);
   }
   return 0;
}

C++: #include<iostream>
#include<cmath>

using namespace std;

int main(){
  int n, i, j, isFound, count;

  while(cin >> n){
    for(i=3, count=1; i<=n; i+=2){
      for(j=3, isFound=0; j<=sqrt(i); j+=2){
	if(i%j == 0){
	  isFound = 1;
	  break;
	}
      }
      if(isFound == 0) count++;
    }
    cout << count << endl;
  }

  return 0;
}