【HDOJ6646】A + B = C（模拟）

题意

 

 1<=a,b,c<=1e100000

思路：

 

 

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef pair<ll,ll> Pll;
typedef vector<int> VI;
typedef vector<PII> VII;
#define N  1100000
#define M  4100000
#define fi first
#define se second
#define MP make_pair
#define pi acos(-1)
#define mem(a,b) memset(a,b,sizeof(a))
#define rep(i,a,b) for(int i=(int)a;i<=(int)b;i++)
#define per(i,a,b) for(int i=(int)a;i>=(int)b;i--)
#define lowbit(x) x&(-x)
#define Rand (rand()*(1<<16)+rand())
#define id(x) ((x)<=B?(x):m-n/(x)+1)
#define ls p<<1
#define rs p<<1|1

const ll MOD=1e9+7,inv2=(MOD+1)/2;
      double eps=1e-6;
      int INF=1e9;

char a[N],b[N],c[N];
int A[N],B[N],C[N],t[N],flag,la,lb,lc;

int read()
{
   int v=0,f=1;
   char c=getchar();
   while(c<48||57<c) {if(c=='-') f=-1; c=getchar();}
   while(48<=c&&c<=57) v=(v<<3)+v+v+c-48,c=getchar();
   return v*f;
}

void solve1()
{
    int na=0,nc=0;
    rep(i,1,1e6+1) A[i]=B[i]=C[i]=t[i]=0;
    rep(i,1,1e6-la) A[++na]=0;
    per(i,la,1) A[++na]=a[i]-'0';
    rep(i,1,1e6-lc) C[++nc]=0;
    per(i,lc,1) C[++nc]=c[i]-'0';
    int p=1;
    per(i,1e6,1)
    {
        if(C[i]>A[i]) break;
        if(C[i]<A[i]){p=0; break;}
    }
    if(!p) return;
    rep(i,1,1e6)
    {
        t[i]=t[i]+C[i]-A[i];
        if(t[i]<0)
        {
            t[i+1]--;
            t[i]+=10;
        }
    }
    p=1;
    int k=1e6;
    while(k>1&&t[k]==0) k--;
    per(i,k/2,1) swap(t[i],t[k-i+1]);
    rep(i,1,lb)
     if((b[i]-'0')!=t[i]){p=0; break;}
    if(p)
    {
        flag=1;
        printf("%d %d %d\n",1000000-la,k-lb,1000000-lc);
    }
}

void solve2()
{
    if(flag) return;
    rep(i,1,1e6+1) A[i]=B[i]=C[i]=t[i]=0;
    int nb=0,nc=0;
    rep(i,1,1e6-lb) B[++nb]=0;
    per(i,lb,1) B[++nb]=b[i]-'0';
    rep(i,1,1e6-lc) C[++nc]=0;
    per(i,lc,1) C[++nc]=c[i]-'0';
    int p=1;
    per(i,1e6,1)
    {
        if(C[i]>B[i]) break;
        if(C[i]<B[i]){p=0; break;}
    }
    if(!p) return;
    rep(i,1,1e6)
    {
        t[i]=t[i]+C[i]-B[i];
        if(t[i]<0)
        {
            t[i+1]--;
            t[i]+=10;
        }
    }
    p=1;
    int k=1e6;
    while(k>1&&t[k]==0) k--;
    per(i,k/2,1) swap(t[i],t[k-i+1]);
    rep(i,1,la)
     if((a[i]-'0')!=t[i]){p=0; break;}
    if(p)
    {
        flag=1;
        printf("%d %d %d\n",k-la,1000000-lb,1000000-lc);
    }
}

void solve3()
{
    if(flag) return;
    rep(i,1,1e6+1) A[i]=B[i]=C[i]=t[i]=0;
    int na=0,nb=0,nc=0;
    rep(i,1,1e6-1-la) A[++na]=0;
    per(i,la,1) A[++na]=a[i]-'0';
    rep(i,1,1e6-1-lb) B[++nb]=0;
    per(i,lb,1) B[++nb]=b[i]-'0';
    rep(i,1,1e6-lc) C[++nc]=0;
    per(i,lc,1) C[++nc]=c[i]-'0';
    rep(i,1,1e6)
    {
        t[i]=t[i]+A[i]+B[i];
        if(t[i]>9)
        {
            t[i]-=10;
            t[i+1]++;
        }
    }
    int p=1;
    rep(i,1,1e6+1)
     if(t[i]!=c[i]){p=0; break;}
    if(p)
    {
        flag=1;
        printf("%d %d %d\n",1000000-1-la,1000000-1-lb,1000000-lc);
    }
}

int main()
{
    //freopen("1.in","r",stdin);
    int cas;
    scanf("%d",&cas);
    while(cas--)
    {
        scanf("%s",a+1);
        scanf("%s",b+1);
        scanf("%s",c+1);
        la=strlen(a+1),lb=strlen(b+1),lc=strlen(c+1);
        //printf("la=%d lb=%d lc=%d\n",la,lb,lc);
        flag=0;
        solve1();
        solve2();
        solve3();
        if(!flag) printf("-1\n");
    }

    return 0;
}