Submission #73071227

---

Source Code Expand

/*
Author:
    interstellar
site:
    AtGuesses.com
*/
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>

#define ll long long
#define umap unordered_map
#define uset unordered_set
#define inf (int)1e9
#define llinf (ll)1e18
// constexpr int mod = ((int)1e9+7);
constexpr int mod = 998244353;

using namespace std;
#define vll vector<ll>
#define vi vector<int>
#define vb vector<bool>
#define vc vector<char>
#define vvi vector<vi>
#define vvll vector<vll>


void test_case(){
    int n;
    cin >> n;
    vi a(n);
    for (auto &p : a)cin >> p;

    int sz = *max_element(a.begin(), a.end());
    vi res(sz + 2);

    for (int i = 0; i < n; i++){
        res[0]++, res[a[i]]--;
    }
    for (int i = 1; i <= sz; i++)res[i] += res[i - 1];
    for (int i = 0; i <= sz; i++){
        res[i + 1] += res[i] / 10;
        res[i] %= 10;
    }
    bool fg = true;
    for (int i = sz + 1; i >= 0; i--){
        if (res[i] == 0 && fg)continue;
        cout << res[i];
        fg = false;
    }
}

int main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    
    test_case();

    return 0;
}
/*
*/

Submission Info

Judge Result