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
看k步内能不能出来回文数
N很大,所以注意用string
写到这个题就思绪万千,之前写大整数加法都是用char数组来处理的,没想过用string,因为第一次学大整数加法的时候就是用的char,char处理起来很麻烦;一直想进学校的ACM队,所以大一的时候写了好多遍大整数加法,第一次学校ACM招生,当时基础不牢,不懂什么范围,有一道题是两个数(看似范围很大)相加,我看都没看直接写了char版大整数加法,最后过了,哈哈;后来听学长说为了不卡我们改了范围其实用longlong就行了 - -!
代码:
#include <bits/stdc++.h>
using namespace std;
string s;
int k;
void bigNumAdd(string temp){
int len = temp.length(), c = 0; //进位
for(int i = len - 1; i >= 0; i--){
s[i] = (s[i] - '0') + (temp[i] - '0') + c + '0';
// cout << "----" << s[i] << endl;
c = 0;
if(s[i] > '9'){
s[i] = s[i] - '0' - 10 + '0';
c = 1;
}
}
if(c) s = '1' + s;
}
int main(){
int i;
string temp;
cin >> s >> k;
for(i = 0; i <= k; i++){
temp = s;
reverse(temp.begin(), temp.end());
if(temp == s || i == k) break;
bigNumAdd(temp);
}
cout << s << endl << i << endl;
return 0;
}