PAT 甲级 1024. Palindromic Number(大整数相加的回文数字)

本文介绍了一种使用字符串处理方法解决大整数求回文数问题的算法。通过字符串翻转和逐位加法操作,实现了任意大小整数的回文数查找,并给出了完整的C++代码实现。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

原题传送门

  • 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

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值