USACO 1.2 Palindromic Squares (进制转换)

最新推荐文章于 2020-03-28 16:56:07 发布

原创最新推荐文章于 2020-03-28 16:56:07 发布 · 364 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#USACO #Palindromic Squares #进制转换 #1.2

Talk is cheap Show me the code 同时被 2 个专栏收录

168 篇文章

订阅专栏

ACM-ICPC

154 篇文章

订阅专栏

本文介绍了一个程序，该程序可以将十进制数字转换为指定基数的数值，并检查其是否为回文数。程序遍历从1到300的所有整数，找到其平方在不同基数下仍保持回文特性的数字。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include <stdio.h>
#define DEBUG 0
#define TESTCASES 9

#define SIZE_CHARS 17

char *digits = "0123456789ABCDEFGHIJK";
int base;

void transform(int decimalNum, char numStr[], int *len){
	int quotient = 0;
	int numOfChars = 0;
	while ( (quotient = decimalNum / base) != 0){
		numStr[numOfChars++] = digits[decimalNum % base];
		decimalNum = quotient;
	}
	numStr[numOfChars++] = digits[decimalNum % base];
	numStr[numOfChars] = '\0'; 
	*len = numOfChars;

	int halfNumOfChars = numOfChars / 2;
	int indexOfChar;
	for (indexOfChar = 0; indexOfChar < halfNumOfChars; indexOfChar++){
		char temp = numStr[indexOfChar];
		numStr[indexOfChar] = numStr[numOfChars - 1 - indexOfChar];
		numStr[numOfChars - 1 - indexOfChar] = temp;
	}	
}

int isPalindromic(char numStr[], int len){
	int half = len / 2;
	int indexOfChar;
	for (indexOfChar = 0; indexOfChar < half; indexOfChar++){
		if (numStr[indexOfChar] != numStr[len - 1 - indexOfChar])
			return 0;
	}
	return 1;
}

int main(){
#if DEBUG
	int testCase;
	for (testCase = 1; testCase <= TESTCASES; testCase++){
		char inputFileName[20] = "inputX.txt";
		inputFileName[5] = '1' +  (testCase - 1);
		freopen(inputFileName, "r", stdin);
		printf("#%d\n", testCase);
#endif

	scanf("%d", &base);
	int num;
	for (num = 1; num <= 300; num++){
		int square = num * num;
		char squareStr[SIZE_CHARS];
		int len;
		transform(square, squareStr, &len);
		if (isPalindromic(squareStr, len) == 1){
			char numStr[SIZE_CHARS];
			transform(num, numStr, &len);
			printf("%s %s\n", numStr, squareStr);
		}
	}

#if DEBUG
	}
#endif
	return 0;
	
}