C :

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

C++ :

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

Pascal :

var
  n,i:longint;
  b:boolean;
begin
  readln(n);
  b:=true;
  if n<=1 then b:=false
  else
  begin
    for i:=2 to n-1 do
    if (n mod i=0) then b:=false;
  end;
  if b then writeln('prime')
    else writeln('not prime');
end.

Java :

//1196:C语言6.7
import java.util.*;
public class Main {
    public static void main(String args[]) {
        Scanner cin = new Scanner(System.in);
        int i = cin.nextInt();
        boolean flag = true;
        if(i%2==0)
            flag = false;
        else {
            for(int j=3;j<=Math.sqrt((double)i);j+=2){
                    if(i%j==0){
                        flag = false;
                        break;
                    }
            }
        }
        if(flag)
            System.out.println("prime");
        else
            System.out.println("not prime");

    }
}

Python :

def isprime(n):
  if n == 1:
    return False
  for x in xrange(2, int(n**0.5)+1):
    if n%x == 0:
      return False
  return True
if isprime(input()):
  print "prime"
else:
  print "not prime"