Go: package main

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

func main() {
	b2i := func(b bool) int {
		if b {
			return 1
		}
		return 0
	}

	prime := func(n int) []int {
		ans := make([]int, n+1)
		for i := 2; i <= n; i++ {
			b := ans[i] == 0
			ans[i] = ans[i-1] + b2i(b)
			if b {
				for j := i * 2; j <= n; j += i {
					ans[j] = 1
				}
			}
		}
		return ans
	}
	reader := bufio.NewScanner(os.Stdin)
	primeT:=prime(999999)
	for reader.Scan() {
		n, _ := strconv.Atoi(reader.Text())
		fmt.Println(primeT[n])
	}
}

C++: #include <iostream>
#include <cmath>
using namespace std;
#define MAX 1000000


int main(){
	bool work[MAX + 1];
	int num, ans = 0;

	// 入力
	cin >> num;

	// 初期化
	for(int i = 0; i <= MAX; i++){
		if(i < 2){
			work[i] = false;
		}else{
			work[i] = true;
		}
	}

	// エラトネスのふるい
	for(int i = 2; i < sqrt((double)MAX) + 1; i++){
		if(work[i] == true){
			for(int j = i * 2; j < MAX; j += i){
				work[j] = false;
			}
		}
	}

	// 計算
	for(int i = 0; i <= num; i++){
		if(work[i] == true){
			ans++;
		}
	}

	// 出力
	cout << ans << endl;

	return 0;
}

C++: #include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <map>
#include <list>
#include <iterator>
#include <queue>
#include <stack>
#include <deque>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <string>
#include <cmath>
#include <complex>
#include <functional>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <cstdlib>
#include <cctype>

#define REP(i,m,n) for(int i=m;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define rp(i,c) rep(i,(int)c.size())
#define fr(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)
#define mp make_pair
#define pb push_back
#define all(c) (c).begin(),(c).end()
#define rall(u) (u).rbegin(),(u).rend()
#define dbg(x) cerr<<#x<<" = "<<(x)<<endl
#define v_delete(a,b) (a).erase(remove((a).begin(), (a).end(), b), (a).end())
#define v_unique(a) (a).erase(unique((a).begin(), (a).end()), (a).end())
#define VV(T) vector<vector< T > >
#define init(a,b) memset((a), (b), sizeof((a)))
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
const int inf=1<<28;
const double INF=1e10,EPS=1e-9;


template<class T>int SIZE(T a){return a.size();}
template<class T>string IntToString(T num){string res;stringstream ss;ss<<num;return ss.str();}
template<class T>T StringToInt(string str){T res=0;for(int i=0;i<SIZE(str);i++)res=(res*10+str[i]-'0');return res;}
template<class T>T gcd(T a,T b){if(b==0)return a;return gcd(b,a%b);}
template<class T>T lcm(T a,T b){return a/gcd(a,b)*b;}

template <class T> void input(T& a, int n) { for (int i = 0; i < n; ++i) cin >> a[i]; }
template <class T> void input(T* a, int n) { for (int i = 0; i < n; ++i) cin >> a[i]; }
typedef pair<int,int> pii;

inline bool IN(int x, int y, int w, int h)
{
    return 0 <= x && x < w && 0 <= y && y < h;
}


int main()
{
	int n;
	cin >> n;
		vi pn(1000000,1);
	pn[0]=0;
	pn[1]=0;
	int ans=0;
	for(int i=2;i<=n;i++){
		if(pn[i]==1){
			for(int j=i+1;j<=n;j++){
				if(!(j%i)){
					pn[j]=0;
				}
			}
		}
	}
	rep(i,n+1){
		if(pn[i])ans++;
	}
	cout << ans << endl;


}

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

 void prima()
    {
        bool isprima;
        int a, n, c = 0;
        while(cin >> a && c < 30)
        {
            n = 0;
            for(int i = 2; i <= a; i++)
            {
                isprima = true;
                for(int j = 2; j < i; j++)
                {
                    if( i == 2)
                    {
                        isprima = true;
                        break;
                    }
                    else if(i % j == 0)
                    {
                        isprima = false;
                        break;
                    }
                }
                if(isprima) n++;
            }
            cout << n << endl;
            c++;
        }
    }

int main()
{
   prima();
}

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

int main(){
	int i=0,k=2,source[30];
	while(cin >> source[i]) i++;
	int m = max(source[0],source[i]);
	bool hurui[1000000];
	memset(hurui,1,sizeof(hurui));
	for (int j=2;j<=m;j++,k=2)
	{
		if (!hurui[j]) continue;
		while(j*k < m)hurui[j*k]=false,k++;
	}
	hurui[0]=0,hurui[1]=0;
	for (int j=0;j<i;j++){
		int count=0;
		for (k=2;k<=source[j];k++) count += !!hurui[k];
		cout << count << endl;
	}
}

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

int main()
{
        long long max;
        vector<int> pn;
        bool npn[1000000];
        npn[0] = npn[1] = true;


        while(cin >> max){
                for(long i=2;i<max;i++){
                        if(npn[i]) continue;
                        pn.push_back(i);
                        for(long j=i*1;j<=max;j+=i)npn[j] = true;
                }

                cout << pn.size() << "\n";
                for(long i=2;i<=max;i++)npn[i] = false;
                pn.clear();
        }

        return 0;
}

C++: #include <stdio.h>
#include <algorithm>  // fill 関数を使うのに必要
#define PN_NUM 1000000    // 1000000 未満の非負数を素数判定する
using namespace std;

bool prime_number[PN_NUM];

// エラトステネスのふるい
void set_prime_number(bool* array) {

  fill(array, array + PN_NUM, true); // array の全要素を true にする
  array[0] = array[1] = false; // 0 と 1 は素数ではない
  for (int i = 2; i < PN_NUM; i++) {
    if (!array[i])
      continue;
    for (int j = i * 2; j < PN_NUM; j += i) {
      array[j] = false; // 素数の倍数は，素数ではない
    }
  }

}

int main() {
  int cnt, n;

  set_prime_number(prime_number);
  while (scanf("%d", &n) != EOF) {
    cnt = 0;
    for (int i = 0; i <= n; i++) {
      if (prime_number[i]) // i が素数ならば
        cnt++;             // cnt をインクリメント
    }
    printf("%d\n", cnt);   // cnt を出力
  }

  return 0;
}

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

bool isprime(int number, const std::vector<int>& primeset)
{
	for (std::vector<int>::const_iterator p = primeset.begin(); p != primeset.end(); ++p) {
		if (number % *p == 0) {
			return false;
		}
	}
	return true;
}

int resolve(int number)
{
	std::vector<int> primeset;
	for (int i = 2; i <= number; ++i) {
		if (isprime(i, primeset)) {
			primeset.push_back(i);
		}
	}
	return static_cast<int>(primeset.size());
}

int main()
{
	int input;
	while (std::cin >> input) {
		std::cout << resolve(input) << std::endl;
	}

	return 0;
}

C++: #include <iostream>
#include <math.h>
#define MAX 80000
using namespace std;

int main(){
	static int n;
	static int prime[MAX],i,j;
	static int count;
	static bool flag;

	while((cin >> n)!= NULL){
		count = 0;
		for(i = 3; i <= n; i+=2){
			flag = true;
			for(j = 0; j < count; j++){
				if(i % prime[j] == 0){
					flag = false;
					break;
				}
				if(prime[j] * prime[j] > i) break;
			}
			if(flag == true){
				prime[count++] = i;
			//	cout << count << endl;
			}
		}
		if(n > 1)	count++; //2
		cout << count << endl;
		//delete[] prime;
	}
	return 0;
}

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

int main(){
  bool prime[1000000] = {};
  int sum[1000000]; sum[0] = sum[1] = 0; sum[2] = 1;
  for(int i = 3 ; i < 1000000 ; i += 2 ){
    sum[i] = sum[i + 1] = sum[i - 1];
    if(!prime[i]){
      for(int j = i + i + i ; j < 1000000 ; j += i + i ){
        prime[j] = true;
      }
      sum[i]++;
      sum[i+1]++;
    }
  }

  int n;
  while(cin >> n){
    cout << sum[n] << endl;
  }
}

C++: #include<iostream>
using namespace std;
int sushu(int a)
{
	int flag = 1;
	for (int i = 2; i < sqrt(a)+1; i++)
	{
		if (a%i == 0)
		{
			flag = 0;
			break;
		}
	}
	return flag;
}
int main()
{
	int n;
	while (cin >> n)
	{
		int ans = 0, flag = 1;
		if (n == 1)
			cout << ans << endl;
		else
		{
			for (int i = 2; i <= n; i++)
			{
				flag = sushu(i);
				if (flag)
					ans++;
			}
			cout << ans+1 << endl;
		}
	}
	return 0;
}