zoukankan      html  css  js  c++  java
  • PAT 1024 Palindromic Number

    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 (≤) is the initial numer and K (≤) 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 Kinstead.

    Sample Input 1:

    67 3
    

    Sample Output 1:

    484
    2
    

    Sample Input 2:

    69 3
    

    Sample Output 2:

    1353
    3
    #include<bits/stdc++.h>
    using namespace std;
    typedef long long ll;
    #define MAXN 500
    
    string reverstring(string s){
        string res = "";
        for(auto x:s) res = x+res;
        return res;
    }
    
    
    string strplus(string a,string b){
        string res = "";
        int jinwei = 0;
        for(int i=a.size()-1;i>=0;i--){
            int numa = a[i]-'0';
            int numb = b[i]-'0';
            int num = numa+numb+jinwei;
            res = to_string(num%10)+res;
            jinwei = num/10;
        }
        if(jinwei){
            res = "1"+res;
        }
        return res;
    }
    
    
    int main(){
        string s;
        int k;
        cin >> s >> k;
    
    
        int cnt = 0;
        while(cnt!=k){
            string ans = reverstring(s);
            if(s == ans){
                cout << ans << endl << cnt;
                return 0;
            }
            s = strplus(s,ans);
            cnt++;
        }
    
        cout << s << endl << k;
    
    
    
        return 0;
    }

    ez

     
  • 相关阅读:
    Go语言之深入剖析slice
    docker-compose 安装以及遇到的错误解决
    linux 简单记录9 --服务的访问控制列表(ssh,scp,screen)
    linux 简单记录8 --iptables 与 firewalld 防火墙
    linux 简单记录7--使用 RAID 与 LVM 磁盘阵列技术(使用LVM扩展磁盘空间)
    linux 简单记录6--存储结构与磁盘划分
    DNS 域名解析服务
    linux运用软链接解决目录空间不足
    linux 简单记录5--用户身份与文件权限
    ERROR org.hibernate.engine.jdbc.spi.SqlExceptionHelper
  • 原文地址:https://www.cnblogs.com/cunyusup/p/10817720.html
Copyright © 2011-2022 走看看