PAT (Advanced Level) Practise 1024 Palindromic Number (25)
来源:互联网 发布:mac ppt演讲者模式切换 编辑:程序博客网 时间:2024/06/07 12:55
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
题意:给你一个数n,每次将它和它的翻转数相加,问这样操作几次后它会成为一个回文数
解题思路:数组模拟数的加法
#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <cmath>#include <map>#include <cmath>#include <set>#include <stack>#include <queue>#include <vector>#include <bitset>#include <functional>using namespace std;#define LL long longconst int INF = 0x3f3f3f3f;char ch1[200],ch2[200],ans[200];int step;int add(char s[]){int len = strlen(s);for (int i = 0; i < len; i++) ch2[i] = s[len - i - 1];int x = 0;for(int i=0;i<len;i++){ans[i] = (s[i] - '0' + ch2[i] - '0' + x) % 10+'0';x = (s[i] - '0' + ch2[i] - '0' + x) / 10;}if (x) ans[len++] = x + '0',ans[len]='\0';else ans[len] = '\0';int flag = 1;for (int i = 0; i < len / 2; i++){swap(ans[i], ans[len - 1 - i]);if (ans[i] != ans[len - 1 - i]) flag = 0;}strcpy(ch1, ans);return flag;}int main(){while (~scanf("%s %d", &ch1, &step)){int len = strlen(ch1),flag=1,cnt=0;for (int i = 0; i < len / 2; i++)if (ch1[i] != ch1[len - 1 - i]) flag = 0;if (flag) { printf("%s\n0\n", ch1); continue; }for (int i = 1; i <= step; i++){cnt++;if (add(ch1)) break;}printf("%s\n%d\n", ch1, cnt);}return 0;}
- PAT (Advanced Level) Practise 1024 Palindromic Number (25)
- PAT (Advanced Level) Practise 1024 Palindromic Number (25)
- 1024. Palindromic Number (25) @ PAT (Advanced Level) Practise
- 1019. General Palindromic Number (20) @ PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1019. General Palindromic Number (20)
- PAT (Advanced Level) Practise 1019 General Palindromic Number (20)
- PAT (Advanced Level) Practise 1019 General Palindromic Number (20)
- 1024. Palindromic Number (25)【简易大数加法+回文】——PAT (Advanced Level) Practise
- Pat(Advanced Level)Practice--1024(Palindromic Number)
- 【PAT Advanced Level】1024. Palindromic Number (25)
- 【PAT】【Advanced Level】1024. Palindromic Number (25)
- PAT (Advanced Level) Practise 1082 Read Number in Chinese (25)
- PAT (Advanced Level) Practise 1117Eddington Number(25)
- PAT (Advanced Level) Practise 1117 Eddington Number(25)
- PAT (Advanced Level) Practise 1082 Read Number in Chinese (25)
- 1019. General Palindromic Number (20)——PAT (Advanced Level) Practise
- PAT (Advanced Level) 1024. Palindromic Number (25) 字符串反转相加
- 浙大 PAT Advanced level 1024. Palindromic Number (25)
- 给Button添加特定个数的圆角
- SpringMVC-----SpringMVC统一处理Controller返回值
- java_web
- Azkaban四个应用案例
- crontab --定时执行任务
- PAT (Advanced Level) Practise 1024 Palindromic Number (25)
- 【笔记】Servlet示例
- Android使用UncaughtExceptionHandler获取crash信息
- 设计模式-代理模式
- 背包那些经典的例子( 上 )
- [LeetCode]406. Queue Reconstruction by Height
- Java并发
- java打包成exe安装程序
- 跨域请求原理及分析