提出 #73074496

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vl=vector<long long>;
using vvl=vector<vector<long long>>;
using vvvl=vector<vector<vector<long long>>>;
using pl=pair<long long,long long>;
using vpl=vector<pair<long long,long long>>;
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(long long i=(long long)(a);i<(long long)(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#include <atcoder/all>
using namespace atcoder;

long long modpow(long long a, long long n, long long mo){long long res=1;while(n>0){if(n&1){res=res*a%mo;}a=a*a%mo;n>>=1;}return res;}
long long Pow(long long a, long long n){long long res=1;while(n>0){if(n&1){res=res*a;}a=a*a;n>>=1;}return res;}

const ll MOD=998244353;
const ll INF=(1ll<<60);
//Nの数字和
long long DigitSum(long long N){
    long long Ans=0;
    while(N>0){Ans+=N%10; N/=10;}
    return Ans;
}
int main(){
  ll N;
  cin>>N;
  ll M=2*100000+9;
  vl A(N);
  rep(i,N) cin>>A[i];
  vl kazu(M,0);
  rep(i,N){
    kazu[A[i]]++;
  }
  rep(i,M-1){
    kazu[i+1]+=kazu[i]/10;
    kazu[i]%=10;
  }
  ll hiku=N;
  rep(i,M-1){
    ll nh=hiku%10;
    if(kazu[i]>=nh) kazu[i]-=nh;
    else{
      kazu[i]=10+kazu[i]-nh;
      hiku+=10;
    }
    hiku/=10;
  }
  vl kazug(M,0);
  for(ll i=M-1;i>=0;i--){
    kazug[i]=kazu[i]/9;
    if(i>0) kazu[i-1]+=(kazu[i]%9)*10;
  }
  ll sa=M-1;
  while(kazug[sa]==0) sa--;
  while(sa>=0){
    cout<<kazug[sa];
    sa--;
  }
  cout<<endl;
}

提出情報

ジャッジ結果