1024 Palindromic Number (25分)
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
解题思路:
这道题给我们定义了一种操作:让一个整数加上这个数首尾颠倒后的数字。现给定一个整数以及操作次数的限制,问我们能否在限定的次数里得到一个回文数。如果能,则输出回文数,以及次数;否则,输出最后一次的操作得到的数字以及操作次数。
其实我们只要模拟这个操作即可,只不过要注意的是,在N操作了100次后,数字可能远远超过了longlong类型,因此我们需要使用大数的运算。
#include<iostream>
#include<string>
using namespace std;
void fun(string &str) //定义一个函数实现回文操作
{
string tmp = "";
int s = 0; //进位位
int len = str.length();
for (int i = 0; i < len; i++)
{
int sum = str[i] - '0' + str[len - i - 1] - '0' + s; //按位相加
s = sum / 10; //进位位
int t = sum % 10; //本位位
tmp = (char)(t + '0') + tmp;
}
if(s!=0) //如果最后进位位不为0
tmp = (char)(s + '0') + tmp;
str = tmp;
}
int isPalindromic(string str) //判断是否是回文
{
int len = str.length();
for (int i = 0; i < len; i++)
{
if (str[i] != str[len - i - 1])
return 0;
}
return 1;
}
int main()
{
string str;
int k;
cin >> str >> k;
int cnt = 0;
for (int i = 0; i < k; i++)
{
if (!isPalindromic(str))
{
fun(str);
cnt++;
}
}
cout << str << endl << cnt << endl;
return 0;
}