|
|
back to boardThis problem don't need any complicated sortings You just need an array with 100 elements so in every position M, you add the ID using a dynamic structure such as "vector" in C++. (Theoretical complexity O(n)) Now you go from 100 to 0 and then print every element from each position M. Edited by author 23.04.2016 15:06 |
|
|