1024. Palindromic Number (25)(PAT甲)
来源:互联网 发布:电子图章制作软件 编辑:程序博客网 时间:2024/05/15 13:10
- Palindromic Number (25)
时间限制
400 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue
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
#include <cstdio>#include <iostream>#include <string>#include <cstring>#include <algorithm>using namespace std;//大数运算+回文判断string add(string a, string b){ char s[1002] = {0}; s[1001] = '\0'; int loc = 1000; for (int i = a.length() - 1; i >= 0; --i, --loc){ s[loc] += a[i] - '0' + b[i] - '0'; if (s[loc] >= 10){ ++s[loc-1]; s[loc] -= 10; } s[loc] += '0'; } if (s[loc] > 0) { s[loc] += '0'; --loc; } return string(s + loc + 1);}int main(){ string s; int k; cin >> s >> k; int cnt = 0; while (++cnt <= k){ string ts = s; reverse(ts.begin(), ts.end());//容器元素反转函数,置于algorithm之下 if (s == ts) { cout << s << endl << cnt - 1 << endl; break; } else { s = add(s, ts); } } if (cnt > k) cout << s << endl << k << endl; return 0;}
- 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 (25)
- pat 1024. Palindromic Number (25)
- PAT 1024. Palindromic Number (25)
- PAT 1024. Palindromic Number
- PAT 1024. Palindromic Number
- PAT 1024. Palindromic Number
- 【PAT】1024. Palindromic Number
- PAT 1024. Palindromic Number (25)(字符串对称,相加)
- 【PAT Advanced Level】1024. Palindromic Number (25)
- PAT 1024. Palindromic Number (25)【精华】
- 浙大PAT 1024. Palindromic Number (25)
- PAT (Advanced) 1024. Palindromic Number (25)
- PAT A 1024. Palindromic Number (25)
- 麦恩简介
- 正则表达中常用方法小结 test(),exec(),search(),match()区别及应用。
- JQuery插件:批量上传SWFUpload
- ambari-server-资源请求分析
- 块设备驱动介绍
- 1024. Palindromic Number (25)(PAT甲)
- plsql 和 Navicat 创建和调用存储过程的区别
- 北京20日游记(ctsc2017~thusc2017)
- 对象修改前后对比
- Java面向对象概述
- scala 正则表达式
- csdn如何转载别人的文章
- java中方法重写 this和super的区别
- mysql (master/slave)复制原理及配置