提交时间:2024-10-04 14:55:20
运行 ID: 33127
#include<iostream> using namespace std; string a; string ans; long long length=0; int main(){ cin>>a; ans=a; length=a.size(); for(long long i=0;i<=9;i++){ string b; for(long long j=0;j<length;j++){ b[j]=(a[j]-'0'+i)%10+'0'; } for(long long j=0;j<length;j++){ if(b[j]!='9'){ b[j]++; break; } } for(long long k=0;k<length;k++){ // cout<<ans[k]; } // cout<<endl; for(long long j=0;j<length;j++){ if(ans[j]<b[j]){ //cout<<ans[j]<<" "<<b[j]<<"chang"<<endl; //cout<<length<<">>"<<endl; for(long long k=0;k<length;k++){ ans[k]=b[k]; } break; } else if(ans[j]>b[j]){ break; } } } for(long long i=0;i<length;i++){ cout<<ans[i]; } return 0; } /* for(int k=0;k<a.size();k++){ cout<<a[k] } /* if(adayub(b,a)==true){ cout<<"b>a"<<endl; cout<<"b "<<endl; for(int k=0;k<a.size();k++){ cout<<b[k]; } cout<<" a"<<endl; for(int k=0;k<a.size();k++){ cout<<a[k]; } } */ //system("grep VmPeak/proc/$PPID/status");