http://acm.hdu.edu.cn/showproblem.php?pid=1229
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
int a,b,t,k;
while(cin>>a>>b>>k)
{
if(a==0&&b==0) break;
t=pow(10,k); //10的k次幂
if(a%t==b%t) //判断后K位是否相等
cout<<"-1"<<endl;
else cout<<a+b<<endl;
}
return 0;
}