UVALive

老铁，这个题把就别想啥算法了，直接暴力秒了做下题吧，一开始还在想什么算法，后来一看数据直接不忍了，给个小数据简直了，暴力了。

#include<iostream>  #include<cstdio>  #include<cstring>  #include<algorithm> using namespace std;int huiwen(char s[]){int len = strlen(s); int min = len / 2;int flag = 1; for(int i=0;i<min;i++){if(s[i]!=s[len-1-i]){flag = 0; } } return flag; } int main(){char s[10];while(scanf("%s",&s) && strcmp("0",s) != 0){long long num = 0; if(!huiwen(s)){int len = strlen(s);while(true){for(int i = len-1; i >= 0; i--){if(s[i]!='9'){s[i] = s[i] + 1; break; }else{s[i] = '0'; }}num++; if(huiwen(s)){break; }}}printf("%lld\n",num); }}