PAT甲级1024
来源:互联网 发布:淘宝网怎么添加客服 编辑:程序博客网 时间:2024/05/20 16:42
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<cstdio>#include<algorithm>#include<cstring>#include<vector>#include<queue>using namespace std;bool checkPalindromic(deque<char>dq){int i = 0, j = dq.size() - 1;while (i <= j){if (dq[i] != dq[j])return false;i++; j--;}return true;}int main(){char N[20];int K;scanf("%s %d", N, &K);int len = strlen(N);deque<char> dq,dq1,dq2;for (int i = 0; i < len; i++){dq.push_back(N[i]);}dq1 = dq2 = dq;reverse(dq2.begin(), dq2.end());int i = 1;int t, carry = 0;if (checkPalindromic(dq)){for (int i = 0; i < dq.size(); i++){printf("%c", dq[dq.size() - 1 - i]);}printf("\n%d", 0);return 0;}//若本身就是回文数,则不需进行计算了while (i <=K){for (int j = 0; j < dq.size(); j++){t = dq1[j] - '0' + dq2[j] - '0' + carry;carry = 0;if (t >= 10){dq[j] = '0' + t - 10;carry = 1;}elsedq[j] = '0' + t;}if (carry){dq.push_back('1');carry = 0;}if (checkPalindromic(dq)){break;}else{dq1 = dq2 = dq;reverse(dq2.begin(), dq2.end());i++;}}if (i > K){for (int i = 0; i < dq.size(); i++){printf("%c", dq[dq.size() - 1 - i]);}printf("\n%d",K);}else{for (int i = 0; i < dq.size(); i++){printf("%c", dq[dq.size() - 1 - i]);}printf("\n%d", i);}return 0;}
- PAT(甲级)1024
- 浙大pat甲级 1024
- PAT甲级1024
- PAT甲级 1024
- PAT 甲级 1024 Palindromic Number
- PAT 甲级
- PAT甲级 A1025.PAT RANKING
- PAT 甲级 1025 PAT Ranking
- PAT(甲级)1003
- PAT(甲级)1004
- PAT(甲级)1005
- PAT(甲级)1006
- PAT(甲级)1007
- PAT(甲级)1008
- PAT(甲级)1009
- PAT(甲级)1010
- PAT(甲级)1011
- PAT(甲级)1012
- dplyr包--数据操作与清洗
- 当直播遇上H5:高小姐要直播,二师兄也拦不住
- 开发注意事项
- linux线程进程学习
- Mybatis基于注解实现增删查改和多参数列表查询
- PAT甲级1024
- 安卓/java后台使用测量方法
- MySql中启用InnoDB数据引擎的方法
- hibernate中使用注解自动生成类对应的表的字段
- 链表的一些基础题
- cut
- C++primer——第一章 开始
- java系统高并发解决方案(转载)
- c语言 指针变量的运算