1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
#include <iostream>
#include <algorithm>
#include <vector>
#include <stdio.h>

using namespace std;

bool compare(int a, int b)
{
    return a >= b;
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n;
    cin >> n;
    //scanf("%d", &n);
    vector<int> tab;
    tab.resize(n);
    //int *tab = new int[n + 1];
    //int tab[100];
    int c;
    //cout << n << endl;
    //cout.flush();
    for (int i = 0; i < n; i++)
    {
        cin >> c;
        tab[i] = c;
        //scanf("%d ", &tab[i]);
    }

    sort(tab.begin(), tab.end(), compare);

    //cout << endl << endl;
    //printf

    //for (int i = 0; i < n; i++)
    //    cout << tab[i] << " ";

    vector<int> ilosci;
    int current = 1;
    for (int i = 1; i < n; i++)
    {
        if (tab[i] == tab[i - 1])
        {
            current++;
        }
        else
        {
            ilosci.push_back(current);
            current = 1;
        }
    }
    ilosci.push_back(current);

    //cout << endl << endl;

    //for (int i = 0; i < ilosci.size(); i++)
    //{
    //    cout << ilosci[i] << "  ";
    //}

    //cout << endl << endl;


    sort(ilosci.begin(), ilosci.end(), compare);

    //cout << endl << endl;

    //for (int i = 0; i < ilosci.size(); i++)
    //{
    //    cout << ilosci[i] << "  ";
    //}

    ///cout << endl << endl << "wynik" << endl;


    //for (int i = 0; i < ilosci.size(); i++)
    //    cout << ilosci[i] << endl;

    cout << n;

    int suma = 0;
    current = 0;
    for (int k = 2; k <= n; k++)
    {
        suma = 0;
        for (int j = 0; j < ilosci.size(); j++)
        {
            current = (ilosci[j] / k) * k;
            if (current == 0)
                break;
            suma += current;
        }
        cout << " " << suma;
    }
    cout << "\n";

    //delete[] tab;
    return 0;
}