C :

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

C++ :

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

Pascal :

var n:longint;
function pd(x:longint):boolean;
  var i:longint;
  begin
     for i:=2 to trunc(sqrt(x))do
     if x mod i=0 then exit(false);
     exit(true);
   end;
begin
   readln(n);
   if pd(n) then writeln('prime') else writeln('not prime');
end.   

Java :

import java.util.Scanner;
public class Main {
	public static void main(String[] args) {
		Scanner s=new Scanner(System.in);
		int a=s.nextInt();
		int t=0;
		for(int i=2;i<a;i++){
			if(a%i==0){
				t++;
			}
		}
		if(t==0){
			System.out.println("prime");
		}else	System.out.println("not prime");

		
		
		

	}

}

Python :

def isprime(n):
  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"

C# :

using System;

namespace C言语
{
    class _2_5
    {
        static bool isPrime(int n)
        {
            for (int i = 2; i * i <= n; i++)
                if (n%i==0) return false;
            return true;
        }
        public static void Main()
        {
            int a = Convert.ToInt32(Console.ReadLine());
            if (isPrime(a))
                Console.WriteLine("prime");
            else 
                Console.WriteLine("not prime");          
            Console.ReadLine();
            return;
        }
    }
}