C :

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

C++ :

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

Pascal :

var
  i,j:longint;
  b:boolean;
begin
  for i:=100 to 200 do
  begin
    b:=true;
    for j:=2 to i-1 do
    if i mod j=0 then b:=false;
    if b then write(i,' ');
  end;
end.

Java :

import java.util.*;
public class Main {
    public static void main(String args[]) {
        boolean flag;
        for(int result=100;result<=200;result++)
        {
            flag = true;
            if(result%2==0){
                continue;
            }
            else {
                for(int i=3;i<=Math.sqrt((double)result);i+=2){
                        if(result%i==0){
                            flag = false;
                            break;
                        }
                }
            }
            if(flag)
                System.out.printf("%d ",result);
        }
    }
}

Python :

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