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>
using namespace std;
bool isPrime(int n) {
    bool flag = false;
    if(n % 2 == 0) {
        if(n==2){
            flag=true;
        }
    }
    else {
        for(int i=2;i<n;i++) {
            if(n==i)break;
            else if(n % i==0){
                flag=false;break;
            }else flag=true;
        }
    }
    return flag;
}
int main(void){
    int n=0;
    int count = 0;
    while(cin>>n) {
        count = 0;
        for(int i=2;i<=n;i++) {
            if(isPrime(i))count++;
        }
        std::cout << count << std::endl;
    }
}

C++: #include<iostream>

using namespace std;

int n;
int prime[1000000];
int checked[1000000];
int primesum[1000000];
int result[30];
int datasets;

int main()
{
	prime[0] = 0;
	prime[1] = 0;
	prime[2] = 1;
	primesum[0] = 0;
	primesum[1] = 0;
	primesum[2] = 1;

	for(int a = 3;a<1000000;a++)
	{
		prime[a] = 1;
	}
	
	for(int a = 3;a<1000;a++)
	{
		if(checked[a] == 0)
		{
			checked[a] = 1;
			for(int b = 2;b<a;b++)
			{
				if(a%b==0)
				{
					prime[a] = 0;
					break;
				}
			}
			if(prime[a] == 1)
			{
				for(int c = 2*a ;c<1000000;c+=a)
				{
					checked[c] = 1;
					prime[c] = 0;
				}
			}
		}
	}

	for(int a = 3;a<100;a++)
	{
		primesum[a] = primesum[a-1]+=prime[a];
	}
	
	while(cin >> n)
	{
		cout << primesum[n] << endl;
	}

	return 0;
}

C++: 
#include <iostream>

using namespace std;

int main()
{
	int n, count,k;

	while(cin >> n){
		count = 1;
		k = 0;

		for(int i = 3; i <= n; i += 2){
			for(int j = 3; j <= std::sqrt((double)i); j += 2)
			{
				if(i%j == 0){
					k = 1;
					break;
				}
			}
			if(k == 0){
				count++;
			}
		}
		cout << count << endl;
	}

	return 0;
}

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

using namespace std;

int main() {
	int n;

	while(cin >> n) {
		int count = 0;

		for(int i = 2; i <= n; i++) {
			int yaku = 0;
			for(int j = 1; j <= i; j++) {
				if(i % j == 0) {
					yaku++;
				}
			}
			if(yaku == 2) {
				count++;
			}
		}

		cout << count << endl;
	}
}

C++: #include <bits/stdc++.h>
using namespace std;

typedef long long ll;
 
ll mod_pow(ll x, ll n, ll mod){
  ll res = 1;
  while(n > 0){
    if(n & 1) res = res * x % mod;
    x = x*x % mod;
    n >>= 1;
  }
  return res;
}

ll mod_mul(ll x, ll n, ll mod){
  x %= mod;
  n %= mod;
  return x*n % mod;
}

bool millrr_rabin(ll n){
  if(n == 2) return true;
  if((n & 1) == 0 || n <= 1) return false;
  int a[] = {2, 3, 5, 7, 11, 13, 17, -1}, r;
  ll s = 0, d, x;
  d = n - 1;
  while((d & 1) == 0){
    s++;
    d = d >> 1;
  }
  
  for(int i = 0 ; a[i] != -1 && a[i] < n ; i++){
    if((x = mod_pow(a[i], d, n)) != 1){
      for(r = 0 ; r < s ; r++){
	if(x == n-1) break;
	x = mod_mul(x, x, n);
      }
      if(r == s) return false;
    }
  }
  return true;
}

int main(){
  int sum[1000010];
  sum[0] = 0;
  
  for(int i = 1 ; i <= 1000000 ; i++){
    sum[i] = sum[i-1];
    if(millrr_rabin(i)) sum[i]++;
  }
  
  int n;
  while(cin >> n){
    cout << sum[n] << endl;
  }
  
  
  return 0;
}

C++: #include <stdio.h>
  
int main(){
    int e[30];
  
    int k = 0;
    while( scanf( "%d",&e[k] ) != EOF )k++;
  
    for( int i = 0;i < k;i++ ){
        int n = 1;
        int k = 0;
        while( true ){
            if( e[k] >= n ){
                k++;
                n *= 10;
            } else {
                break;
            }
        }
        printf( "%d\n",k );
    }
    return 0;
}

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

int main(){
int n,a;
int ans;
while(cin>>n){
for(int i=2;i<n+1;i++){
for(int j=2;j<i;j++){
a=i%j;
if(a==0){ans++; break;}
}}
cout<<ans<<endl;}}

C++: #include<iostream>
#include<math.h>

using namespace std;

int main(){
    int n;
    bool p[1000000];
    while(cin>>n){
        int n_sq = (int)sqrt(n);
        for(int i=0; i<n; i++){
            p[i] = true;
        }
        p[0] = false;

        for(int i=1; i<n_sq; i++){
            if(p[i]){
                for(int j=i*2+1; j<n; j=j+(i+1)){
                    p[j] = false;
                }
            }
        }

        int cnt=0;
        for(int i=0; i<n; i++){
            if(p[i]){
                cnt++;
            }
        }

        cout<<cnt <<endl;

    }
    return 0;
}

C++: #include <iostream>
#include <vector>
using namespace std;
 int main(){
    int n,cnt=0;
    cin >> n;
    vector<bool>m(n+1,true);
    for(int i=2;i*i<=n;i++)
         if(m[i]) for(int j=i+i;j<=n;j+=i)  m[j]=false;        
    for(int i=2;i<=n;i++)
            if(m[i]) { cnt++;}
    cout << cnt << endl;    
    return 0;
}

C++: #include<cstdio>
using namespace std;
bool prime[1000000];
#define max 1000000
int main(){
	prime[1] = true;
	for(int i = 2; i * i < max; i++){
		if(!prime[i]){
			for(int j = i * i; j < max; j+=i){
				prime[j] = true;
			}
		}
	}
	int n;
	while(scanf("%d",&n) != EOF){
		int ans = 0;
		for(int i = 1; i <= n; i++){
			if(!prime[i])ans++;
		}
		printf("%d\n",ans);
	}
	return 0;
}

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

int prime(int n) {
	int k; int m[] = {2, 3, 5, 7, 11, 13,17, 19, 23, 29, 31, 37, 41};
	if(n == 2) return 1;
	if(n % 2 == 0) return 0;
for(k = 0; k < sizeof(m)/4; k++)
if(n % m[k] == 0) return 0;
	for(k = 3; k * k <= n; k += 2) {
		if(n % k == 0) return 0;
	}
	return 1;
}

int cntPrime(int n) {
	int cnt = 0, i, k;
	for(i = 2; i <= n; i++) {
		cnt += prime(i);
	}
	return cnt;
}

int main() {
	int a;
	int arg[1024] = { 0 };
	int cnt = 0;
	while(scanf("%d", &a) != EOF) {
		arg[cnt++]=a;
	}
	int i;
	for(i = 0; i < cnt; i++) {
printf("%d\n", cntPrime(arg[i]));
	}
}

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

int is_prime(int);

int main()
{
	int input_count;
	int prime_count;
	int input;
	int for_cnt;
	int output[30];
	
	
	input_count = 0;
	
	while(scanf("%d", &input) != EOF && input_count < 30)
	{
		prime_count = 0;
		
		if(input >= 2)
		{
			prime_count++;
		}
		for_cnt = 3;
		while(for_cnt <= input)
		{
			if(is_prime(for_cnt))
			{
				prime_count++;
			}
			for_cnt += 2;
		}
		output[input_count] = prime_count;
		input_count++;
	}
	
	for(for_cnt = 0; for_cnt < input_count; for_cnt++)
	{
		printf("%d\n", output[for_cnt]);
	}
	
    return 0;
}

int is_prime(int test_num)
{
	int divisor;
	
	if(test_num == 1)
	{
		return 0;
	}
	else if(test_num == 2 || test_num == 3 || test_num == 5 || test_num == 7)
	{
		return 1;
	}
	
	else if((test_num % 2) == 0)
	{
		return 0;
	}

	for(divisor = 3 ; divisor <= (sqrt(test_num) + 1); divisor += 2)
	{
		if(test_num % divisor == 0)
		{
			return 0;
		}
	}
	
	return 1;
}

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

#define NUM_MAX		1000001

int prime(int num_max)
{
	static int numary[NUM_MAX];
	static int primeary[NUM_MAX];
	static int primeary_len = 1;
	static int num = 2;
	primeary[0] = 2;
	numary[0] = 0;
	numary[1] = 0;
	numary[2] = 1;
	if(num_max > num)
	{
		for(num++;num <= num_max;num++)
		{
			int i;
			for(i = 0;i < primeary_len;i++)
			{
				if(!(num % primeary[i]))
				{
					numary[num] = numary[num-1];
					break;
				}
				else if(num < (primeary[i] * primeary[i]))
				{
					numary[num] = numary[num-1] + 1;
					primeary[primeary_len] = num;
					primeary_len++;
					break;
				}
			}
		}
	}
	return numary[num_max];
}

int main()
{
	int n;
	while(scanf("%d",&n) != EOF)
	{
		printf("%d\n",prime(n));
	}
}

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

using namespace std;

int main(){
}