Submission #73074346

---

Source Code Expand

// Problem: D - Many Repunit Sum
// Contest: AtCoder - AtCoder Beginner Contest 444
// URL: https://atcoder.jp/contests/abc444/tasks/abc444_d
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// writen by slightar

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define more int _;cin>>_;while(_--)
#define close ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define coutyes cout<<"Yes\n";
#define coutno cout<<"No\n";
#define all(A) A.begin(),A.end()
#define point pair<int,int>
#define x first
#define y second
const int mod=1e9+7,N=2e5+8;
int n,m,ans,cnt,k,l,r,a[N];
void solve(){
	cin>>n;
	int maxx=0;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		maxx=max(maxx,a[i]);
	}
	vector<int>b(N*10,0);
	for(int i=1;i<=n;i++){
		b[a[i]]++;
	}
	for(int i=maxx;i;i--){
		b[i]+=b[i+1];
	}
	for(int i=1;i<=maxx;i++){
		b[i+1]+=b[i]/10;
		b[i]=b[i]%10;
	}
	if(b[maxx+1])cout<<b[maxx+1];
	for(int i=maxx;i;i--){
		cout<<b[i];
	}
	
}
signed main(){
	close
	solve();

}

Submission Info

Judge Result