DouKaku?

private import std.stdio;

uint[] dhondt(uint[] votes, uint limit) {
    auto seats = new uint[votes.length];
    foreach(_; 0 .. limit) {
        auto quotients = new real[votes.length];
        foreach(i, ref e; quotients) {
            e = votes[i] / (seats[i] + 1.0);
        }
        find_largest: foreach(i, e; quotients) {
            foreach(f; quotients[i .. $]) {
                if(f > e) continue find_largest;
            }
            seats[i]++;
            break;
        }
    }
    return seats;
}

void main() {
    writeln([123, 4, 56, 78].dhondt(100)); // [48 1 21 30]
}