C :

#include <stdio.h>
int main(){

int a;
scanf("%d",&a);

int t = 0;
int i;
for(i = 2;i < a;i++){   
if(a % i == 0){    
t++; 


break; 
}
}

if(t == 0){
printf("T");
}else{
printf("F");
}
 return 0;
}

C++ :

#include <iostream>

using namespace std;

int main(){
	int n,i,c=0;
	cin>>n;
	for(i=2;i<n;i++){
		if(n%i==0){
		    c++;	
		}
	}
	
	if(c!=0||n==1){
		cout<<"F"<<endl;
	}else{
		cout<<"T"<<endl;
	}
}

Pascal :

var a,i:longint;
    p:boolean;
begin
  read(a);
  p:=TRUE;
  i:=2;
  for i:=2 to a-1 do
   if a mod i=0 then
    begin
     p:=FALSE;
     break;
    end;
   if a=1 then p:=FALSE;
  if p then writeln('T') else writeln('F');
end.

Java :

import java.util.Scanner;
 
public class Main
{
    public static void main(String[] args){
       Scanner sc = new Scanner(System.in);
       int n = sc.nextInt();
       int c = 0;//因子个数
 
       int i = 2;
       while(i < n){
           if(n % i == 0){
              c++;
           }
          i++;
       }
 
       //如果没有因子则是素数
       if(c == 0 && n > 1){
          System.out.println("T");
       }else{
          System.out.println("F");
       }
 
    }
}

Python :

import math
n = int(input())
s = 0
for i in range(1, int(math.sqrt(n+1))+1):
    if n % i == 0:
        s += 1
if s == 1:
    print('T')
else:
    print('F')