1023. Have Fun with Numbers (20)

一开始 心存侥幸 用long long 最后三个测试数据通不过 终还是老老实实的用模拟大数运算

思路:用两个数组分别存放 double前后的各位数字出现个数 后比较 

<pre name="code" class="html">#include<iostream>#include<vector>#include<cmath>#include<string>#include<cstring>#include<algorithm>#include<iomanip>#include<map>using namespace std;#define Max 100000int main(){    string num1, T1, T2;    int a[10], b[10], C;    int num2[30], i, j, flag;    memset(a, 0, sizeof(a));    memset(b, 0, sizeof(b));    cin>>num1;    for(int i=0; i<num1.size(); i++){        a[num1[i]-'0']++;    }    flag=C=0;//结果标记,进位    for(i=num1.size()-1,j=0; i>=0; i--,j++)    {        int tmp=(num1[i]-'0')*2;        num2[j]=tmp%10+C;        C=tmp/10;        if(++b[num2[j]]>a[num2[j]])            flag=1;    }    if(C){//最高位有进位        num2[j]=C;        for(i=j; i>=0; i--)            T1+=num2[i]+'0';        if(++b[num2[j]]>a[num2[j]])            flag=1;    }    else        for(i=j-1; i>=0; i--)            T1+=num2[i]+'0';    if(flag)        cout<<"No"<<endl;    else        cout<<"Yes"<<endl;    cout<<T1<<endl;    return 0;}