Not Only Algorithm,不仅仅是算法,关注数学、算法、数据结构、程序员笔试面试以及一切涉及计算机编程之美的内容 。。
你的位置:NoAlGo博客 » 题解 » 

PAT 1024. Palindromic Number

A number that will be the same when it is written forwards or backwards is known as a Palindromic Number. For example, 1234321 is a palindromic number. All single digit numbers are palindromic numbers.

Non-palindromic numbers can be paired with palindromic ones via a series of operations. First, the non-palindromic number is reversed and the result is added to the original number. If the result is not a palindromic number, this is repeated until it gives a palindromic number. For example, if we start from 67, we can obtain a palindromic number in 2 steps: 67 + 76 = 143, and 143 + 341 = 484.

Given any positive integer N, you are supposed to find its paired palindromic number and the number of steps taken to find it.

Input Specification

Each input file contains one test case. Each case consists of two positive numbers N and K, where N (<= 1010) is the initial numer and K (<= 100) is the maximum number of steps. The numbers are separated by a space.

Output Specification

For each test case, output two numbers, one in each line. The first number is the paired palindromic number of N, and the second number is the number of steps taken to find the palindromic number. If the palindromic number is not found after K steps, just output the number obtained at the Kth step and K instead.

Sample Input 1

67 3

Sample Output 1

484
2

Sample Input 2

69 3

Sample Output 2

1353
3

解答

#include <cstdio>
#include <cstring>
using namespace std;

int main()
{
	char str[300]; int k; scanf("%s%d", str, &k); //数值范围可能超过long long,使用高精度
	int s[300], len = strlen(str);
	for (int i = 0; i < len; i++) s[i] = str[i] - '0';

	int cnt = 0;
	while (cnt < k)
	{
		bool pal = 1;
		for (int i = 0, j = len-1; i < j; i++, j--)
			if (s[i] != s[j]) { pal = 0; break; }
		if (pal) break;

		int t[300];
		for (int i = 0; i < len; i++) t[i] = s[len-1-i];
		int carry = 0;
		for (int i = len-1; i >= 0; i--)
		{
			s[i] = s[i] + t[i] + carry;
			if (s[i] >= 10) s[i] -= 10, carry = 1;
			else carry = 0;
		}
		if (carry)
		{
			len++;
			for (int i = len-1; i > 0; i--) s[i] = s[i-1];
			s[0] = 1;
		}
		cnt++;
	}
	for (int i = 0; i < len; i++) printf("%d", s[i]);
	printf("\n%d\n", cnt);
	return 0;
}
上一篇: 下一篇:

我的博客

NoAlGo头像编程这件小事牵扯到太多的知识,很容易知其然而不知其所以然,但真正了不起的程序员对自己程序的每一个字节都了如指掌,要立足基础理论,努力提升自我的专业修养。

站内搜索

最新评论