PAT 甲级 1024. Palindromic Number(大整数相加的回文数字)
来源:互联网 发布:stata软件和spss 编辑:程序博客网 时间:2024/05/17 06:51
原题传送门
- long int类型的最大值是2147483647,当一个10^10的数连续加两次就超过了范围,所以这是大整数相加问题。
- 对string类型翻转用reverse() // < algorithm >
- 注意string类型的加法
#include <iostream>#include <string>#include <algorithm>using namespace std;string s;void add() { string t = s; reverse(t.begin(), t.end()); int len = s.length(), carry = 0; for(int i = 0; i < len; ++i) { // 因为是两个位数相反的数相加,故这里可以认为是从个位开始加的,i=0是个位 s[i] = s[i] + t[i] + carry - '0'; carry = 0; if(s[i] > '9'){ s[i] = s[i] - 10; carry = 1; } } if(carry) s += '1'; // string类型的加法:直接相连 reverse(s.begin(), s.end());}int main(int argc, const char * argv[]) { int cnt; cin >> s >> cnt; for(int i = 0; i <= cnt; ++i) { string t = s; reverse(t.begin(), t.end()); if(s == t) { cout << s << endl << i; return 0; } if(i != cnt) add(); } cout << s << endl << cnt; return 0;}
Test: string类型的加法:直接相连
#include <iostream>#include <string>using namespace std;int main() { string s; cin >> s; // 123 s += '1'; cout << s << endl; // 1231}
附原题:
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
- PAT 甲级 1024. Palindromic Number(大整数相加的回文数字)
- 1024. Palindromic Number (25)-PAT甲级真题(大整数相加)
- PAT 1024 Palindromic Number (大整数相加)
- 【PAT】1024. Palindromic Number 回文反转相加
- PAT 甲级 1024. Palindromic Number
- 【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(甲级)General Palindromic Number (20)
- PAT 1024. Palindromic Number (25)(字符串对称,相加)
- PAT 甲级 1024 Palindromic Number
- PAT 甲级 1019 General Palindromic Number(简单题)
- PAT (Advanced Level) 1024. Palindromic Number (25) 字符串反转相加
- 【PAT 】1024.Palindromic Number (25) 字符操作+大数相加
- PAT甲级练习题A1024. Palindromic Number (25)
- Java--常用源码--排序算法
- 文件写入、读取的指针问题
- Windows 环境下使用 GCC
- Android程序中View的四种点击事件
- poj 2251 三维BFS 无坑点
- PAT 甲级 1024. Palindromic Number(大整数相加的回文数字)
- C语言中strcpy,strcmp,strlen,strcat函数原型
- io流处理复制文件的问题
- JAVA 两个大字符串数字相加
- va_list / vfprintf / va_arg & printf(const char *format,...)
- STDOUT_FILENO和stdin的区别
- 四、递归递推
- poj 3984 迷宫问题 BFS+路径记录
- Python语句+函数+模块+包+异常