zoukankan      html  css  js  c++  java
  • 1024 Palindromic Number int_string转换 大整数相加

    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.

    # string int 互换法

    • stod()
    • to_string()
    #include <iostream>
    #include <algorithm>
    #include <string>
    using namespace std;
    const int maxn = 100015;
    
    bool isPalindromic(string v){
        int l=0, r=v.length()-1;
        while(l<r){
            if(v[l]!=v[r]) return false;
            l++; r--;
        }
        return true;
    }
    
    string Add(string n,string rn){
        long a=stod(n);
        long b=stod(rn);
        return to_string(a+b);
    }
    
    int main(){
        string n;
        int k;
        cin>>n;
        scanf("%d",&k);
        if(isPalindromic(n)){
            cout<<n<<endl;
            printf("0");
            return 0;
        }
        int t=0;
        while(t<k){
            t++;
            string rn=n;
            reverse(rn.begin(), rn.end());
            n=Add(n,rn);
            if(isPalindromic(n)){
                cout<<n<<endl;
                printf("%d",t);
                return 0;
            }
        }
        cout<<n<<endl;
        printf("%d",t);
    }

     # 大整数相加法

    #include <iostream>
    #include <algorithm>
    #include <string>
    using namespace std;
    const int maxn = 100015;
    
    bool isPalindromic(string v){
        int l=0, r=v.length()-1;
        while(l<r){
            if(v[l]!=v[r]) return false;
            l++; r--;
        }
        return true;
    }
    
    string Add(string n,string rn){
        string ans="";
        int i,jinwei=0;
        for(i=0;i<n.length();i++){
            ans += ((n[i]-'0')+(rn[i]-'0')+jinwei)%10 + '0';
            jinwei = ((n[i]-'0')+(rn[i]-'0')+jinwei)/10 ;
        }
        if(jinwei) ans += jinwei+'0';
        reverse(ans.begin(), ans.end());
        return ans;
    }
    
    int main(){
        string n;
        int k;
        cin>>n;
        scanf("%d",&k);
        if(isPalindromic(n)){
            cout<<n<<endl;
            printf("0");
            return 0;
        }
        int t=0;
        while(t<k){
            t++;
            string rn=n;
            reverse(rn.begin(), rn.end());
            n=Add(n,rn);
            if(isPalindromic(n)){
                cout<<n<<endl;
                printf("%d",t);
                return 0;
            }
        }
        cout<<n<<endl;
        printf("%d",t);
    }
  • 相关阅读:
    头部布局,搜索验证和AJAX自动搜索提示,并封装成组件,提高代码复用性
    yii2 使用指定数据库执行createCommand
    yii2在控制器中调用另一个控制器方法
    yii2 命令行执行php命令 commands(命令)
    ArrayDataProvider数据分页
    Yii2 数据查询
    Yii2的Gridview应用技巧补充
    yii2 or查询
    SQL---mysql新增字段
    Yii2.0 安装使用报错:yiiwebRequest::cookieValidationKey must be configured with a secret key.
  • 原文地址:https://www.cnblogs.com/lokwongho/p/10013047.html
Copyright © 2011-2022 走看看