C :

#include<stdio.h>
#include<math.h>
int main()
{
printf("1299743");
}
 

C++ :

#include<iostream>
using namespace std;
int isprime (int n)
{
	if(n<=1)
	return 0;
	int i;
	for(i=2;i*i<=n;i++)
	{
		if(n%i==0)
		return 0;
	}
	return 1;
}
int main()
{
	int i,cnt=0;
    for(i=2;cnt!=100002;i++)
    {
    	if(isprime(i))
		cnt++;
    }
    cout<<i-1;
	return 0;
}

Java :

public class Main {
	public static void main(String[] args) {
		int i,n=1;
		for(i=3;;i+=2) {
			if(IsPrime(i)) {
				n++;
			}
			if(n == 100002)
				break;
		}
		System.out.println(i);
	}
	static boolean IsPrime(int n) {
		for(int i=2;i*i<=n;i++) {
			if(n%i==0)
				return false;
		}
		return true;
	}
}

Python :

# coding=utf-8
a=[i for i in range(1500000)]
b =[]

for j in range(2,int(len(a)/2)):
    if(a[j]==1):
        continue
    for k in range(2,int(len(a)/j)):
       if j*k<len(a):
          # print(j*k)
           a[j*k]=1

for i in range(2,len(a)):
    if(a[i]!=1 ):
        b.append(i)


print(b[100001])