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
题目意思:
向前或向后写入时相同的数字称为回文数。例如,1234321 是一个回文数。所有个位数的数字都是回文数字。非回文数可以通过一系列操作与回文数配对。首先,将非回文数取反,并将结果与原数相加。如果结果不是回文数,则重复此操作,直到给出回文数。例如,如果我们从 67 开始,我们可以分两步得到一个回文数:67 + 76 = 143,和 143 + 341 = 484。给定任何正整数ñ,你应该找到它的成对回文数和找到它的步数。
若理解为longlong范围内的加法则只能拿15分,注意取值之大应该考虑大数加法。而每次倒换位置则可以使用reverse(num.begin(),num.end()),前提是将数字转为字符串。
话不多说上代码:
#include<bits/stdc++.h>
using namespace std;
string add(string a, string b) {
if (a.length() < b.length()) {
string h=a;
a = b;
b = h;
}
int c[1001] = {0};
int cnt = 0;
int j = b.length() - 1;
for (int i = a.length()-1; i>=0 ; i--)
{
if (j >= 0) {
int cc = b[j] + a[i] - '0' - '0';
if (cc <= 9) {
c[cnt] += cc;
if (c[cnt] >= 10) {
c[cnt] = c[cnt] - 10;
c[cnt + 1] += 1;
}
}
else
{
c[cnt] = c[cnt] + cc - 10;
c[cnt + 1] += 1;
}
cnt++;
j--;
}
else
{
c[cnt] += a[i];
if (c[cnt] >= 10) {
c[cnt] = c[cnt] - 10;
c[cnt + 1] += 1;
}
cnt++;
}
}
string np;
for (int i = a.length(); i>=0; i--)
{
if (i == a.length() && c[i] == 0)continue;
np = np + to_string(c[i]);
}
return np;
}
int main() {
long long n, k;
cin >> n >> k;
int flag = 0;
string num = to_string(n);
string num1;
for (int i = 1; i <= k; i++)
{
num1 = num;
reverse(num.begin(),num.end());
if (num == num1) {
flag = 1;
cout << num << endl;
cout<< i - 1;
break;
}
else {
num=add(num, num1);
}
}
if (!flag) {
cout << num << endl;
cout<< k;
}
}