C :

#include<stdio.h>
#include<math.h>
int main(){
 int i,j,n;
	for (i=100;i<=200;i++)
	{
		n=sqrt(i);
		for (j=2;j<=n;j++)
			if(i%j==0)
				break;
		if(j>n)
			printf("%d\n",i);
	}
	return 0;}

C++ :

#include <stdio.h>
int main() {
	int n, i;
	for (n = 100;n <= 200;n++) {
		for (i = 2;i < n;i++) {
			if (n % i == 0) break;
		}
		if (i >= n) printf("%d\n", n);
	}
	return 0;
}

Pascal :

begin
writeln('101');
writeln('103');
writeln('107');
writeln('109');
writeln('113');
writeln('127');
writeln('131');
writeln('137');
writeln('139');
writeln('149');
writeln('151');
writeln('157');
writeln('163');
writeln('167');
writeln('173');
writeln('179');
writeln('181');
writeln('191');
writeln('193');
writeln('197');
writeln('199');
end.

Java :

import java.util.ArrayList;


public class Main {

		public static void main(String[] args) {
		
   ArrayList a= new  ArrayList();
   int j;
for(int i=100;i<=200;i++){ 
	for( j=2;j<i;j++){
		if(i%j==0)break;
	}
if(j>=i) a.add(i);

}
for(int i=0;i<a.size();i++){
	System.out.println(a.get(i));
}
	}

}

Python :

def isprime(n):
  for x in xrange(2, int(n**0.5)+1):
    if n%x == 0:
      return False
  return True
for i in xrange(100, 200):
  if isprime(i):
    print i

C# :

using System;
namespace C语言
{
    class _2_9
    {
        static void Main()
        {
            for(int i=100;i<201;i++)
            if(isPrime(i))
                Console.WriteLine(i);
            
            Console.ReadLine();        
        }
        static bool isPrime(int n)
        {
            for (int i = 2; i * i <= n; i++)
            {
                if (n % i == 0) return false;
            }
            return true;
        }
    }
}