Submission #71011725

---

Source Code Expand

#include <bits/stdc++.h>
#define pii pair<int,int>
#define fi first
#define se second
#define mk make_pair
#define ll long long
#define lb(x) ((x)&(-(x)))
#define Rev reverse
#define all(s) s.begin(),s.end()
using namespace std;
const int N=2e5+10,mod=998244353;
int n,m;
ll a[N],b[N],c[N];
void slv(){
    cin>>n>>m;
    for(int i=1;i<=n;i++) cin>>a[i];
    for(int i=1;i<n;i++){
        b[i]=a[i]/10,a[i+1]+=a[i]/10;
        a[i]%=10;
    }
    for(int i=n;i>1;i--){
        c[i]=a[i]/m;a[i]%=m;
        ll val=min(a[i],b[i-1]);
        a[i-1]+=10*val;//cout<<i<<' '<<c[i]<<' '<<a[i-1]<<endl;
    }c[1]=a[1]/m;
    for(int i=1;i<n;i++){
        c[i+1]+=c[i]/10;
        c[i]%=10;
    }
    bool flg=0;
    for(int i=n;i>=1;i--){
        if(c[i]) flg=1;
        if(flg) cout<<c[i];
    }if(!flg) cout<<0;
    cout<<endl;
}
int main(){
    //freopen("1.in","r",stdin);
    //freopen("1.out","w",stdout);
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int t=1;cin>>t;
    while(t--) slv();
    cout.flush();
    cerr<<clock()*1.0/CLOCKS_PER_SEC<<endl;
    return 0;
}

Submission Info

Judge Result