題目鏈接:http://codeforces.com/problemset/problem/540/A
題意:給兩串字符串,上面的串經過最少幾次變化可以的得到下面的串;
#include<bits/stdc++.h>
using namespace std;
int main()
{
char a[1005],b[1005];
int n;
cin>>n;
scanf("%s%s",a,b);
int sum=0;
for(int i=0; i<n; i++)
{
int x=a[i]-'0';
int y=b[i]-'0';
int z=max(x,y)-min(x,y);
int w=10-max(x,y)+min(x,y);
sum+=min(z,w);
}
cout<<sum<<endl;
}
代碼如下: