|
|
вернуться в форумПоказать все сообщения Спрятать все сообщенияI have array, whose can give me all permutations, but for make answer i can have array [1..10^5] of longint; But this array eated 400kb. How to do this more easy??????????? Do you know how many different "Royal Flush" are there in this problem? It's more less than 10^5:) If you know this you'll slove this problem in using less memory. :) |
|
|