1024. Palindromic Number (25)
来源:互联网 发布:淘宝的免费模板在哪里 编辑:程序博客网 时间:2024/06/07 15:10
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 3Sample Output 1:
4842Sample Input 2:
69 3Sample Output 2:
13533
#include<iostream>#include<string>#include<algorithm>using namespace std;bool isPali(string);string add(string, string);int main(){string n;string nn;int k,step = 0;cin >> n >> k;while(!isPali(n)){step++;nn = n;reverse(nn.begin(),nn.end());//获得这个数字的反转n = add(n, nn);if (step == k)break;}cout << n << "\n" << step << endl;return 0;}//判断是不是回文bool isPali(string a ){int length = a.size();for (int i = 0; i <= length / 2; i++){if (a[i] != a[length - i - 1])return false;}return true;}string add(string a, string b){int length = a.size();char an[500];string ans;int carry = 0;for (int i = length-1; i >= 0; i--){an[i] = a[i] + b[i] - '0' + carry;if (an[i] > '9'){//有进位an[i] -= 10;carry = 1;}elsecarry = 0;}an[length] = 0;ans = an;if (carry == 1)//最高位有进位ans = "1" + ans;//cout << ans << endl;return ans;}
- 1024. Palindromic Number (25)
- 1024. Palindromic Number (25)
- 1024. Palindromic Number (25)
- 1024. Palindromic Number (25)
- 1024. Palindromic Number (25)
- 1024. Palindromic Number (25)
- 1024. Palindromic Number (25)
- 1024. Palindromic Number (25)
- 1024. Palindromic Number (25)
- 1024. Palindromic Number (25)
- 1024. Palindromic Number (25)
- 1024. Palindromic Number (25)
- 1024. Palindromic Number (25)
- 1024. Palindromic Number (25)
- 1024. Palindromic Number (25)
- 1024. Palindromic Number (25)
- 1024. Palindromic Number (25)
- 1024. Palindromic Number (25)
- linux上给php安装mysqli扩展
- kuangbin求带飞DP1 Common Subsequence(LCS)
- fzu1686神龙的难题(Dancing Links(重复覆盖))
- BZOJ 1012 [JSOI2008]最大数maxnumber
- RxBus学习之旅--从入门到提高
- 1024. Palindromic Number (25)
- Codeforces Round #367 (Div. 2) D. Vasiliy's Multiset(字典树模板)
- Python类和对象
- POJ 1703 并查集的应用 关系并查集l两种方法
- Android的Service使用
- 分块算法讲解
- Oulipo poj3461 简单的KMP
- POJ 1416 - Shredding Compan
- 大牛经历