C :

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

C++ :

#include<iostream>
#include<cstdio>
#include<iostream>
#include<cmath>

using namespace std;

int isPrime(int x){
    for(int i = 2;i <= sqrt(x);i++)
        if(x%i == 0)
            return 0;
    return 1;
}

int main(){
    for(int i=100;i<=200;i++){
        if(isPrime(i))
            cout<<i<<endl;
    }
    return 0;
}

Pascal :

var a:array[100..200] of boolean;
    i,j:longint;
begin
 for i:=100 to 200 do
  a[i]:=true;
 for i:=100 to 200 do
  for j:=2 to round(sqrt(i)) do
   if i mod j=0 then
    begin
     a[i]:=false;
     break;
    end;
 for i:=100 to 200 do
  if a[i]=true then writeln(i);
end.