Go: package main

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

var scanner = bufio.NewScanner(os.Stdin)

func nextInt() int {
	i, e := strconv.Atoi(scanner.Text())
	if e != nil {
		panic(e)
	}
	return i
}

func check(n int) int {
	eratos := make([]bool, n+1)
	cnt := 0
	for i := 2; i < len(eratos); i++ {
		if !eratos[i] {
			cnt++
			for j := i*i; j < len(eratos); j += i {
				eratos[j] = true
			}
		}
	}
	return cnt
}

func main() {
	for scanner.Scan() {
		n := nextInt()
		fmt.Println(check(n))
	}
}

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

int main(){
  
  int n,cnt = 0;

  while(cin >> n){
    int num[n] = {};
    for(int i = 2; i  <= n; i++){
      if(num[i] == 0){
        for(int j = 1; j <(n/i); j++){
          num[i+(j*i)] = 1;
        }
        cnt++;
      }
    }
  cout << cnt << endl;
  }
}

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

int main(){
	int n;
	int count;
	int ans;

	while (cin >> n){
		ans = 0;
		for (int i = 2; i <= n; i++){
			count = 0;
			for (int j = 2; j < i; j++){
				if (i % j == 0){
					count++;
				}
			}
			if (count == 0)ans++;
		}
		cout << ans << endl;

	}


	return 0;
}

C++: #include <stdio.h>
#define N 100000
#define rep(i,n) for(int i=0;i<n;i++)

int main(void)
{
    bool a[N+1];
    int prime[N], n;
    rep(i,N)
    {
        a[i] = true;
    }
    a[0] = a[1] = false;
    for(int i=2;i*i<=N;i++)
    {
        if(a[i])
        {
            prime[i] = prime[i-1] + 1;
            for(int j=i*i;j<N;j+=i)
                a[j] = false;
        }
        else
            prime[i] = prime[i-1];
    }

    while(scanf("%d", &n)!=EOF)
        printf("%d\n", prime[n]);
    
    return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
  int n;
  int i,j,c,p;

  while(cin>>n){
    c=1;
    for(i=3;i<=n;i+=2){
      p=0;
      for(j=3;j*j<=i;j+=2){
	if(i%j==0){
	  p=1;
	  break;
	}
      }
      if(p==0){
	c++;
      }
    }
    if(n==1)c=0;
    cout<<c<<endl;
  }
  return 0;
}

C++: #include <stdio.h>

const int MAX_V = 10000;
int prime[MAX_V+1];

void init(){
    int i, k, v;
    for(i=2; i<MAX_V; i++){
        prime[i] = 1;
    }
    for(i=2; i*i<=MAX_V; i++){
        if(prime[i]){
            for(k=2*i; k<=MAX_V; k+=i){
                prime[k]=0;
            }
        }
    }   
}

int isprime(int n){
    return prime[n];
}

int main(){
    init();
    int num;
    while(scanf("%d", &num) != EOF){
        int count=0;
        for(int i=2; i<=num; i++){
            if(isprime(i)==1)
                count++;
        }
    printf("%d\n", count);
    }
    return 0;
}

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

int a[999999]={};

int main(){
	int n,ans=0;
	vector<int> v;
	for(int i = 2; i*i < 999999; i++){
		for(int j = 0; j < 999999; j+=i){
			if(i!=j) a[j]=1;
		}
	}
	while(cin >> n){
		for(int j = 2; j <= n; j++){
			if(a[j]==0) ans++;
		}
		cout << ans << endl;
		ans=0;
	}
}

C++: #include <cstdio>

const int size = 1000005;
int n;
bool ispm[size];

int get(int n) {
	int ans = 0;
	for ( int i = 1; i <= n; i ++ ) ispm[i] = 1;
	for ( int i = 2; i <= n; i ++ ) {
		if(ispm[i]) {
			ans ++;
			for ( int j = 2*i; j <= n; j += i) ispm[j] = 0;
		}
	}

	return ans;
}

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

	return 0;
}

C++: #include<stdio.h>
#include<math.h>
int isprime(int x){
	int i=3,k=1;
	while( i <= sqrt(x) ){
		if(x%i==0){
			k=0;
			break;
		}
		i = i + 2;
	}
	return k;
}
int main(){
	int n,c,i,j;
	while(scanf("%d",&n)!=EOF){
		c=1;
		for(j=3;j<=n;j+=2){
			if(isprime(j)){
				c++;
			}
		}
		printf("%d\n",c);
	}
	return 0;
}

C++: #include<stdio.h>
#include<math.h>
int main(void) {
	int  n, sum = 0;
	while (scanf("%d", &n) != EOF) {
		int prime[1000000] = { 0 };
		prime[1] = 1;
		sum = n - 1;
		for (size_t i = 2; i <= sqrt(n); i++)
		{
			if (prime[i] == 0)
			{
				for (size_t t = i + 1; t <= n; t++)
				{
					if (t%i == 0) {
						if (prime[t] == 0)
						{
							prime[t] = 1;
							sum--;
						}
					}
				}
			}
		}
		printf("%d\n", sum);
		sum = 0;
	}
	return 0;
}

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

using namespace std;

#define NUM_LIMIT 1000000   // numbers < NUM_LIMIT

int getNumOfPrimes(bitset<NUM_LIMIT> isPrime, int min, int max){
    int cnt = 0;
    for (int i = 2; i <= max; i++){
        if (!isPrime[i]) continue;  // skip non prime numbers
        cnt ++;
        if (i >= min){
            // cross out the multiples of the number
            for (int j = 2; i*j <= max; j++){
                isPrime[i*j] = 0;
            }
        }
    }
    return cnt;
}

int main(){
    bitset<NUM_LIMIT> isPrime;
    isPrime.set();  // set all bits to 1
    
    // input data
    int number;
    int max_num = 0;
    while(cin >> number){
        int cnt = 0;
        if (number > max_num){
            cnt = getNumOfPrimes(isPrime, max_num+1, number);
            max_num = number;
        } else {
            cnt = getNumOfPrimes(isPrime, number+1, number);
        }
        cout << cnt << endl;
    }
    return 0;
}

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

bool isPrimeNumber(const unsigned long n);

int main(){
    unsigned long n;
    vector<unsigned long> pri;
    while(cin>>n){
        unsigned ans = 0;
        for(unsigned long i=1;i<=n;i--){
            bool serch = true;
            vector<unsigned long>::iterator it = pri.begin();
            while(it!=pri.end()){
                if(fmodl(n,*it)==0){
                    break;
                    serch = false;
                }
            }
            if(isPrimeNumber(i)&&serch){
                ans++;
                pri.push_back(i);
            }
        }
        cout << ans << endl;
    }
}

bool isPrimeNumber(const unsigned long n){
    static const unsigned long carn[]{
        561,	1105,	1729,	2465,	2821,	6601,	8911,
        10585,	15841,	29341,	41041,	46657,	52633,	62745,	63973,	75361,
        101101,	115921,	126217,	162401,	172081,	188461,	252601,	278545,	294409,
        314821,	334153,	340561,	399001,	410041,	449065,	488881,	512461,	530881,
        552721,	656601,	658801,	670033,	748657,	825265,	838201,	852841,	997633,
        1024651,1033669,1050985,1082809,1152271,1193221,1461241,1569457,1615681,
        1773289,1857241,1909001,2100901,2113921,2433601,2455921,2508013,2531845,
        2628073,2704801,3057601,3146221,3224065,3581761,3664585,3828001,4335241,
        4463641,4767841,4903921,4909177,5031181,5049001,5148001,5310721,5444489,
        5481451,5632705,5968873,6049681,6054985,6189121,6313681,6733693,6840001,
        6868261,7207201,7519441,7995169,8134561,8341201,8355841,8719309,8719921,
        8830801,8927101,9439201,9494101,9582145,9585541,9613297,9890881
    };

    if(n==2)
        return true;
    else if(n<2||n%2==0)
        return false;
    else{
        for(unsigned long i=0;i<sizeof(carn)/sizeof(carn[0]);i++){
            if(n<carn[i])
                break;
            if(n==carn[i])
                return false;
        }
        for(unsigned long i=n-1;i>0;i--){
            if(fmodl(powl(i,n),n)!=i)
                return false;
        }
        return true;
    }
}

C++: #include<iostream>
#include<math.h>
#include<vector>
#include<algorithm>
using namespace std;

int main()
{
   int a,pp[100000];
   pp[0]=-1,pp[1]=-1;
   for(int i=2;i<100000;i++){
       if(pp[i]==0){
           pp[i]=1;
           for(int j=i*2;j<100000;j+=i){
               pp[j]=-1;
           }
       }
   }
   int now;
   while(cin>>now){
       int ans=0;
       for(int i=1;i<now+1;i++){
           if(pp[i]==1){
               ans;
           }
       }
       cout<<ans<<endl;
   }
    return 0;
}