ForumBoard
| Topic: About z-shortest | ||
![]() | halil on 11/14/10 @ 11:39 amESTTask 'Shortest-z' is an excellent for learning bignum arithmetic, but ... (and how it can be without a 'but').For most users, it is clear that the general case insoluble in real time. I hoped that the tests were such that they can be solved in a given time limit. I ask the author to change the time limit and tests, so that the task do not lose a lot of their difficulties. Also, the time limit should be such that it is possible to input a decimal number converted to a number with base 2 ^ N. | |
Home
Training
Competitions
Forum
FAQ