PAT 1136 A Delayed Palindrome

ponytaill

于 2023-08-28 23:50:14 发布

阅读量71

点赞数

分类专栏： PTA 文章标签： c++ 算法 pat 数据结构

本文链接：https://blog.csdn.net/horsetaill/article/details/132550398

版权

PTA 专栏收录该内容

68 篇文章 6 订阅

订阅专栏

个人学习记录，代码难免不尽人意

在这里插入图片描述

A + B = C
where A is the original number, B is the reversed A, and C is their sum. A starts being the input number, and this process ends until C becomes a palindromic number – in this case we print in the last line C is a palindromic number.; or if a palindromic number cannot be found in 10 iterations, print Not found in 10 iterations. instead.

Sample Input 1:
97152
Sample Output 1:
97152 + 25179 = 122331
122331 + 133221 = 255552
255552 is a palindromic number.
Sample Input 2:
196
Sample Output 2:
196 + 691 = 887
887 + 788 = 1675
1675 + 5761 = 7436
7436 + 6347 = 13783
13783 + 38731 = 52514
52514 + 41525 = 94039
94039 + 93049 = 187088
187088 + 880781 = 1067869
1067869 + 9687601 = 10755470
10755470 + 07455701 = 18211171
Not found in 10 iterations.

#include<cstdio>
#include<string>
#include<iostream> 
#include<algorithm>
#include<vector>
#include<set>
#include<queue>
#include<cmath>
using namespace std;
const int maxn=35;
struct bign{
	int num[1010];
	int len=0; 
};
bign add(bign a,bign b){
	bign c;
	int carry=0;
	int count=0;
	for(int i=0;i<a.len;i++){
		int temp=a.num[i]+b.num[i]+carry;
		int remain=temp%10;
		carry=temp/10;
		c.num[count++]=remain;
	}
	if(carry!=0) c.num[count++]=carry;
	c.len=count;
	return c;
}
bign Reverse(bign a){
	bign b;
	int count=0;
	for(int i=a.len-1;i>=0;i--){
		b.num[count++]=a.num[i];
	}
	b.len=count;
	return b;
}
void print(bign a){
	for(int i=a.len-1;i>=0;i--)
	printf("%d",a.num[i]); 
}
bool judge(bign a){
	int i=0,j=a.len-1;
	
	while(i<=j){
		if(a.num[i]!=a.num[j]){
			return false;
		}
		i++;
		j--;
	}
	return true;
}
int main(){
   string s;
   cin >> s;
   bign big;
   big.len=s.size();
   int count=0;
   for(int i=s.size()-1;i>=0;i--){
   	  big.num[count++]=s[i]-'0';
   }
   if(judge(big)){
   	 	print(big);
   	 	printf(" is a palindromic number.\n");
   	        return 0;
		}
   int i;
   for(i=0;i<10;i++){
   	 bign b=Reverse(big);
   	 print(big);
   	 printf(" + ");
   	 print(b);
   	 printf(" = ");
		big =add(big,b);
	 print(big);
	 printf("\n");
   	 if(judge(big)){
   	 	print(big);
   	 	printf(" is a palindromic number.\n");
   	         break;
		}
   }
 
   if(i==10) printf("Not found in 10 iterations.\n");
}

这道题涉及到的是大整数加法和转置。有两个坑点：如果一开始就是回文数的话需要直接输出is a palindromic number，而不是加的过程，然后就是如果最后一个测试点通不过，是出现了给的数的位数恰好等于1000的情况，这样相加的话就会超出1000位数，所以一开始设置的数组大小一定要大于1000