PAT 甲级 1024. Palindromic Number (25)
来源:互联网 发布:尚学堂javascript视频 编辑:程序博客网 时间:2024/05/20 23:34
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<cstdio>#include<vector>#include<algorithm>#include<queue>#include <cmath>#include <map>#include <set>#include <cstring>using namespace std;string s;void add(string t) {int len = s.length() , carry = 0;for (int i = 0; i < len; i++) {s[i] = t[i] + s[i] + carry - '0';carry =0;if (s[i] > '9') {s[i] = s[i] - 10;carry = 1;}}if (carry == 1)s += '1';reverse(s.begin(), s.end());}int main() {int cnt,i;cin >> s>>cnt;for (i = 0; i <= cnt; i++) {string t = s;reverse(t.begin(), t.end());if (s == t || i == cnt) break;add(t);}cout << s <<endl<< i << endl;return 0;}
- 【PAT甲级】1024. Palindromic Number (25)
- 1024. Palindromic Number (25)PAT甲级
- PAT甲级练习1024. Palindromic Number (25)
- PAT甲级1024. Palindromic Number (25)
- PAT 甲级 1024. Palindromic Number (25)
- PAT甲级 1024. Palindromic Number (25)
- PAT 甲级 1024. Palindromic Number
- PAT甲级练习题A1024. Palindromic Number (25)
- PAT 甲级 1024 Palindromic Number
- 【PAT】1024. Palindromic Number (25)
- PAT 1024. Palindromic Number (25)
- 【PAT】1024. Palindromic Number (25)
- PAT 1024. Palindromic Number (25)
- PAT 1024. Palindromic Number (25)
- pat 1024. Palindromic Number (25)
- PAT 1024. Palindromic Number (25)
- 1024. Palindromic Number (25)-PAT甲级真题(大整数相加)
- PAT甲级.1019. General Palindromic Number (20)
- effective java(5) 之避免创建不必要的对象
- BZOJ 1040: [ZJOI2008]骑士 环套树dp
- 实验一 、Linux操作系统的安装
- 6. 数据结构进阶六之二叉树排序树
- 归并排序
- PAT 甲级 1024. Palindromic Number (25)
- leetcode Reverse Words in a String III 反转字符串中的单词
- 实验一线性表的基本操作实现及其应用
- 7. 数据结构进阶七平衡二叉树
- springboot+jpa+jqueryeasyui重新封装
- python学习笔记——多线程(MT)
- 面试题总结
- 将一个三位数的位置交换顺序
- 要求输出所有在m和n范围内的水仙花数。