summaryrefslogtreecommitdiff
path: root/1.3/palsquare.c
blob: 47f75931be53a1e8760ab60cf562985f9a7ffcd7 (plain)
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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
/*
ID: mytbk921
LANG: C
TASK: palsquare
*/

#include <stdio.h>

const char numMap[]="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";

int convert(int x,int base,int dest[]) 
	//convert integer x to an array,return the length
{
	int i=0;
	while (x){
		dest[i++]=x%base;
		x/=base;
	}
	return i;
}

int isReverse(int a[],int len) //check is an array is pan
{
	int i;
	for (i=0;i<len/2;i++){
		if (a[i]!=a[len-1-i])
			return 0;
	}
	return 1;
}

int main()
{
	int i,j;
	int base;
	int origNum[32],aNum[32],origLen,len;
	FILE *fin=fopen("palsquare.in","r");
	FILE *fout=fopen("palsquare.out","w");
	fscanf(fin,"%d",&base);
	fclose(fin);
	for (i=1;i<=300;i++){
		len=convert(i*i,base,aNum);
		if (isReverse(aNum,len)){
			origLen=convert(i,base,origNum); //used to print i
			for (j=origLen-1;j>=0;j--)
				fprintf(fout,"%c",numMap[origNum[j]]);
			fputc(' ',fout);
			for (j=len-1;j>=0;j--) //print i*i
				fprintf(fout,"%c",numMap[aNum[j]]);
			fputc('\n',fout);
		}
	}
	fclose(fout);
	return 0;
}