  We present a polynomial time algorithm, which solves a nonstandard Variation
of the well-known PARTITION-problem: Given positive integers $n, k$ and $t$
such that $t \geq n$ and $k \cdot t = {n+1 \choose 2}$, the algorithm
partitions the elements of the set $I_n = \{1, \ldots, n\}$ into $k$ mutually
disjoint subsets $T_j$ such that $\cup_{j=1}^k T_j = I_n$ and $\sum_{x \in
T_{j}} x = t$ for each $j \in \{1,2, \ldots, k\}$. The algorithm needs
$\mathcal{O}(n \cdot ( \frac{n}{2k} + \log \frac{n(n+1)}{2k} ))$ steps to
insert the $n$ elements of $I_n$ into the $k$ sets $T_j$.
