Aufgabe 2: Sortieren in Bins Assignment

Schreiben Sie ein Unterprogramm bin_sorting(a), das aus einer Liste von ganzen Zahlen eine verschachtelte Liste erzeugt, in der in die i-te Unterliste alle Vorkommen von i aus a sortiert wurden. So soll zum Beispiel b = bin sorting([1,3,2,4,1,2,1,3,3,3,0]) eine Liste b mit folgenden Eigenschaften zurückgeben:
b[0] = [0]
b[1] = [1, 1, 1] 
b[2] = [2, 2]
b[3] = [3, 3, 3, 3]
b[4] = [4]

Scaffold Head

import sys # suppress users print and input commands _print = print _input = input print = lambda msg, *args, **kwargs: _print('#'+str(msg), *args, **kwargs) def input(message): print("input-command suppressed for", message) return "[1]"

Scaffold Foot

for line in sys.stdin: _print(bin_sorting(eval(line))) print = _print input = _input

Start time:

Fr 08 Dez 2017 15:15:07

End time:

Do 14 Dez 2017 14:00:13

General test timeout:

10.0 seconds

Tests

[6, 2, 6, 2, 3, 5, 2, 1, 8, 1, 0, 3, 0, 2, 8]
[7, 5, 6, 0, 8, 6, 1, 4, 8, 4, 9, 7, 4, 1, 6, 1, 4]
[14, 36, 92, 76, 55, 86, 59, 18, 95, 41, 66]
[1, 15, 4, 1, 8, 0, 20, 5, 1, 12, 18, 8, 16, 6, 5, 4, 15]

[[0, 0], [1, 1], [2, 2, 2, 2], [3, 3], [], [5], [6, 6], [], [8, 8]]
[[0], [1, 1, 1], [], [], [4, 4, 4, 4], [5], [6, 6, 6], [7, 7], [8, 8], [9]]
[[], [], [], [], [], [], [], [], [], [], [], [], [], [], [14], [], [], [], [18], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [36], [], [], [], [], [41], [], [], [], [], [], [], [], [], [], [], [], [], [], [55], [], [], [], [59], [], [], [], [], [], [], [66], [], [], [], [], [], [], [], [], [], [76], [], [], [], [], [], [], [], [], [], [86], [], [], [], [], [], [92], [], [], [95]]
[[0], [1, 1, 1], [], [], [4, 4], [5, 5], [6], [], [8, 8], [], [], [], [12], [], [], [15, 15], [16], [], [18], [], [20]]