C :

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

C++ :

#include<iostream>
#include<cmath>
using namespace std;
int main()
{
    int n,pd=0;
    while(cin>>n)
    {
        pd=0;
        for(int i=2;i<=sqrt(n);i++)
        {
            if(n%i==0)
            {
                pd=1;
                cout<<"not prime"<<endl;
                break;
            }
                
        }
        if(pd==0)
            cout<<"prime"<<endl;
    }
}

Java :

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

Python :

a = map(lambda x:float(x), raw_input().split())

#b = a[1]
#c = a[2]
a = a[0]
c = 'prime'
for i in range(2,int(a**0.5 +1)):
    if a%i==0:
        c = 'not prime'
        break
print c