tests/sysy_lvX/98_palindrome_number.sy


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42

int palindrome(int n)
{
    int a[4];
    int j;
    int flag;
    j=0;
    while(j<4)
    {
        a[j]=n%10;
        n=n/10;
        j=j+1;
    }

    if(a[0]==a[3] && a[1]==a[2])
	{
		flag=1;
	}else{
		flag=0;
	}
	return flag;
}

int main()
{
    int test;
    test=1221;
    int flag;
    flag=palindrome(test);
    if(flag==1)
        putint(test);
    else
    {
        flag = 0;
        putint(flag);
    }

    flag = 10;
    putch(flag);

    return 0;
    
}