C :

#include <stdio.h>
#define N 10
int palindrome(long n);
int main()
{
	long n;
	scanf("%ld",&n);
    printf("%d",palindrome(n));
	return 0;
}
int palindrome(long n)
{
	int i,bit=0;
	int a[N];
	while(n!=0)
	{
		a[bit]=n%10;
		n=n/10;
		bit++;
	}
	for(i=0;i<bit/2;i++)
	{
		if(a[i]!=a[bit-1-i])
		    return 0;
	}
	return 1;
}

C++ :

#include <cstdio>
bool huiwen(long long x) {
	long long y=0, d=x;
	while(d) y = 10*y+d%10, d /= 10;
	if(x==y) return 1;
	else return 0;
}
int main(void) {
	int n;
	scanf("%d", &n);
	if(huiwen(n)) printf("1\n");
	else printf("0\n");
	return 0;
}

Pascal :

program c;
var
 n:longint;

function pd(n:longint):integer;
 var
 a:array[1..15] of integer;
 len,i:integer;
 fg:boolean;
 begin
  len:=0;
  while n<>0 do
   begin
    inc(len);
    a[len]:=n mod 10;
    n:=n div 10;
   end;
  //writeln(len);
  fg:=true;
  for i:= 1 to (len div 2) do
   if a[i] <> a[len-i+1] then
    begin
     fg:=false;
     break;
    end;
  //writeln(fg);
  if fg then
   pd:=1
  else
   pd:=0;
 end;


begin
 readln(n);
 writeln(pd(n));
end.