#include <iostream>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <set>
using namespace std;
char num1[22];
char num2[22];
int res[10];
int main(){
while(scanf("%s",num1)!=EOF){
memset(res,0,sizeof(res));
int len=strlen(num1);
//printf("%d",len);
int c=0,tmp;
for(int i=len-1;i>=0;i--){
tmp=(num1[i]-'0');
res[tmp]++;
num2[i]=(tmp*2+c)%10+'0';
res[(tmp*2+c)%10]--;
c=(tmp*2+c)/10;
}
int cnt=0;
for(int i=0;i<=9;i++){
if(res[i]!=0)
cnt++;
}
if(cnt>0){
printf("No\n");
}
else{
printf("Yes\n");
}
if(c!=0)
printf("%d",c);
printf("%s",num2);
}
return 0;
}
1023. Have Fun with Numbers (20)
最新推荐文章于 2022-11-24 21:02:34 发布