C :

#include <stdio.h>
#include <string.h>
int main()
{
    char s[11];
    int i;
    scanf("%s",s);
    for (i=0;i<strlen(s)/2;i++)
        if (s[i]!=s[strlen(s)-i-1])
            {
                printf("no");
                return 0;
            }
    printf("yes");
    return 0;
}

C++ :

#include <iostream>
#include <string>

using namespace std;

int main() {
	bool p = true;
	string H;
	cin >> H;
	int len = H.length();
	for(int i = 0; i <= len/2; i++) {
		if (H[i] != H[len-1-i]) {
			p = false;
			break;
		}
	}
	if(p)
		cout << "yes" << endl;
	else
		cout << "no" << endl;
	return 0; 
} 

Pascal :

var
  s:string;
  a,b,c:longint; d:boolean;
begin
  d:=true;
  read(s);
  c:=length(s);
  a:=c div 2;
  for b:=1 to a do
  if s[b]<>s[c-b+1] then begin d:=false; break; end;
  if d=true then write('yes') else write('no');
end.

Java :

import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String str = sc.nextLine();
		boolean flag =false;
		char[] a = str.toCharArray();
		char[] b = new char[str.length()];
		for (int i = b.length-1,j = 0;i>=0&&j<b.length; i--,j++) {
			b [j] = a[i]; 
		}
		for (int i = 0; i < b.length; i++) {
			if(a[i]==b[i]){
				flag = true;
				continue;
			}else{
				flag = false;
				System.out.println("no");
				break;
			}
		}
		if(flag){
			System.out.println("yes");
		}
	}

}