1023. Have Fun with Numbers (20)

题目链接：https://www.patest.cn/contests/pat-a-practise/1023

水题

#include<bits/stdc++.h>
const int maxn =10100;
using namespace std;
string s1,s2;
int num1[11],num2[11];
string fun(string s){
    string ans;
    int n=s.length();
    reverse(s.begin(),s.end());
    int t=0;
    int temp=0;
    char c;
    for(int i=0;i<n;i++){
        temp=(int)(s[i]-'0')*2+t;
        if(temp>=10){
            t=1;
            temp%=10;
            c=temp+'0';
            ans+=c;
        }
        else{
            t=0;
            c=temp+'0';ans+=c;
        }
    }
    if(t)ans+=(t+'0');
    reverse(ans.begin(),ans.end());
    return ans;
}
int main(){
    cin>>s1;
    s2=fun(s1);
    int flag=1;
    int len1,len2;
    len1=s1.length();
    len2=s2.length();
    for(int i=0;i<len1;i++)num1[s1[i]-'0']++;
    for(int i=0;i<len2;i++)num2[s2[i]-'0']++;
    for(int i=0;i<10;i++)if(num1[i]!=num2[i])flag=0;
    if(flag)cout<<"Yes"<<endl;
    else cout<<"No"<<endl;
    cout<<s2<<endl;
    return 0;
}