【題解】ZeroJudge d190: 11462 – Age Sort

#include <iostream>
#include <cstring>
using namespace std;
int a[100];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, tmp;
    while (cin >> n){
        if (n == 0) break;
        memset(a, 0, sizeof(a));
        for (int i=0; i<n; i++){
            cin >> tmp;
            a[tmp]++;
        }
        for (int i=0; i<100; i++){
            while (a[i]--){
                cout << i << ' ';
            }
        }
        cout << '\n';
    }
    return 0;
}

while True:
    n = int(input())
    if n == 0:
        break
    A = list(map(int, input().split()))
    dic = {}
    for a in A:
        dic[a] = dic.get(a, 0) + 1

    first = True
    for k in sorted(dic.keys()):
        for _ in range(dic[k]):
            if first:
                first = False
            else:
                print(" ", end="")
            print(k, end="")
    print()