啊啊啊啊啊啊啊我要爆了.....4404. X 进制减法

老是不注意细节 啊啊啊 样例是能过的 分是只能拿30的

还debug半天 气煞我也

居然写成了 scanf("%lld",&a2[n1-1-i]); 复制复制爽了吧

ac代码：

#include<iostream>
#define ll long long
using namespace std;
const int M=1000000007;
const int N=100010;
int n,n1,n2;
ll a1[N],a2[N],j[N];
int main(){
    scanf("%d",&n);
    scanf("%d",&n1);
    for(int i=0;i<n1;i++){
        scanf("%lld",&a1[n1-1-i]);
    }
    scanf("%d",&n2);
    for(int i=0;i<n2;i++){
        scanf("%lld",&a2[n2-1-i]);
    }

    for(int i=0;i<max(n1,n2);i++){
        j[i]=max(a1[i],a2[i])+1;
        if(j[i]<2) j[i]=2;
    }
    ll q=1,sum1=0,sum2=0;
    for(int i=0;i<n1;i++){
        sum1=(sum1+(q*a1[i])%M)%M;
        q=(j[i]*q)%M;
    }
    q=1;
    for(int i=0;i<n2;i++){
        sum2=(sum2+(q*a2[i])%M)%M;
        q=(j[i]*q)%M;
    }
    ll ans=(sum1-sum2+M)%M;
    printf("%d",ans);
    return 0;
}