PAT (Advanced Level) Practise 1024. Palindromic Number (25)
2018-01-15 09:10
369 查看
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:
Sample Output 1:
Sample Input 2:
Sample Output 2:
代码:
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
struct bign{
int d[1000];
int len;
bign(){
memset(d,0,sizeof(d));
len=0;
}
};
bign change(char s[]){
bign a;
a.len=strlen(s);
for(int i=0;i<a.len;i++) a.d[i]=s[a.len-1-i]-'0';
return a;
}
bign add(bign a,bign b){
bign c;
int carry=0;
for(int i=0;i<a.len||i<b.len;i++){
int temp=a.d[i]+b.d[i]+carry;
c.d[c.len++]=temp%10;
carry=temp/10;
}
if(carry) c.d[c.len++]=carry;
return c;
}
int is_palindrome(bign a){
for(int i=0;i<a.len/2;i++){
if(a.d[i]!=a.d[a.len-1-i]) return 0;
}
return 1;
}
void print(bign a){
for(int i=a.len-1;i>=0;i--) printf("%d",a.d[i]);
printf("\n");
}
int main(){
char s[1000];
int T,k=0;
scanf("%s %d",s,&T);
bign a=change(s);
while(k<T&&!is_palindrome(a)){
bign b=a;
reverse(b.d,b.d+b.len);
a=add(a,b);
k++;
}
print(a);
printf("%d\n",k);
return 0;
}
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:
13533
代码:
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
struct bign{
int d[1000];
int len;
bign(){
memset(d,0,sizeof(d));
len=0;
}
};
bign change(char s[]){
bign a;
a.len=strlen(s);
for(int i=0;i<a.len;i++) a.d[i]=s[a.len-1-i]-'0';
return a;
}
bign add(bign a,bign b){
bign c;
int carry=0;
for(int i=0;i<a.len||i<b.len;i++){
int temp=a.d[i]+b.d[i]+carry;
c.d[c.len++]=temp%10;
carry=temp/10;
}
if(carry) c.d[c.len++]=carry;
return c;
}
int is_palindrome(bign a){
for(int i=0;i<a.len/2;i++){
if(a.d[i]!=a.d[a.len-1-i]) return 0;
}
return 1;
}
void print(bign a){
for(int i=a.len-1;i>=0;i--) printf("%d",a.d[i]);
printf("\n");
}
int main(){
char s[1000];
int T,k=0;
scanf("%s %d",s,&T);
bign a=change(s);
while(k<T&&!is_palindrome(a)){
bign b=a;
reverse(b.d,b.d+b.len);
a=add(a,b);
k++;
}
print(a);
printf("%d\n",k);
return 0;
}
相关文章推荐
- PAT (Advanced Level) Practise 1024 Palindromic Number (25)
- 1024. Palindromic Number (25) @ PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1024 Palindromic Number (25)
- 1012. The Best Rank (25)——PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1117 Eddington Number(25)
- PAT (Advanced Level) Practise 1094 The Largest Generation (25)
- PAT (Advanced Level) Practise 1052 Linked List Sorting (25)
- PAT (Advanced Level) Practise 1056 Mice and Rice (25)
- PAT (Advanced Level) Practise 1060 Are They Equal (25)
- PAT (Advanced Level) Practise 1052 Linked List Sorting (25)
- 1085. Perfect Sequence (25)【二分查找】——PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1043 Is It a Binary Search Tree (25)
- PAT (Advanced Level) Practise 1098 Insertion or Heap Sort (25)
- PAT (Advanced Level) Practise 1110 Complete Binary Tree (25)
- PAT (Advanced Level) Practise 1002. A+B for Polynomials (25)
- PAT (Advanced Level) Practise 1114 Family Property (25) 并查集orDFS
- 1094. The Largest Generation (25)【二叉树】——PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1125 Chain the Ropes (25)
- 1012. The Best Rank (25)——PAT (Advanced Level) Practise
- 1016. Phone Bills (25)——PAT (Advanced Level) Practise