1024. Palindromic Number (25)
主题链接:http://www.patest.cn/contests/pat-a-practise/1024
题目:
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:
484 2Sample Input 2:
69 3Sample Output 2:
1353 3
分析:
题目基于一个事实,不论什么一个数,假设本身不是回文数字,那么把自己反转再加上自己。经过有限步后。会变成一个回文数。
那么主要是写两个函数:
1)推断是否是回文
2)反转自加的函数
AC代码:
#include<stdio.h> #include<string.h> using namespace std; char str1[50]; char str3[50]; bool isPalin(char* str){//推断是否是回文 int i; for (i = 0; str[i] != 0; i++); for (int j = 0; j <= i; j++){ if (str[--i] != str[j])return false; } return true; } void add(char* str_a,char* str_sum){//反转自加 int i; for (i = 0; str_a[i] != 0; i++); int a, b, sum, jin = 0; int j; for (j = 0; j < i; j++){ a = str_a[j] - '0'; b = str_a[i - 1 - j] - '0'; sum = a + b + jin; jin = sum / 10; str_sum[j] = sum % 10 + '0'; } if (jin != 0) str_sum[j++] = jin + '0'; j--; for (int w = 0; w <= j / 2; w++){ char temp = str_sum[w]; str_sum[w] = str_sum[j - w]; str_sum[j - w] = temp; } return ; } int main(void){ int k; while (scanf("%s%d", str1, &k) != EOF){ int count = 0; strcpy(str3, str1); for (; count < k; count++){ if (isPalin(str3) == true){ break; } else{ add(str1,str3); strcpy(str1, str3); } } puts(str3); printf("%d\n", count); } return 0; }
截图:
——Apie陈小旭
我希望妈妈早日康复
版权声明:本文博主原创文章。博客,未经同意不得转载。
相关文章
- Good Bye 2022: 2023 is NEAR C Koxia and Number Theory
- C#,斯特林数(Stirling Number)的算法与源代码
- 1024 Palindromic Number (25 分)【难度: 一般 / 知识点: 高精度 回文数】
- Java Number & Math 类,超详细整理,适合新手入门
- 微信小程序 input 的 type属性 text、number、idcard、digit 区别
- 记一次SQLServer的分页优化兼谈谈使用Row_Number()分页存在的问题
- 动手写个数字输入框1:input[type=number]的遗憾
- 【翻译自mos文章】对于每个文件的 file.id and file.incarnation number,重命名文件别名
- [LeetCode] Perfect Number 完美数字
- [LintCode] Valid Number 验证数字
- [CareerCup] 5.2 Binary Representation of Real Number 实数的二进制表示
- The number of object passed must be even but was [1]