|
|
вернуться в форумAfter getting TL or WA you might be interested in this not efficient way (java AC 0.5s, 17Mbs) i ended up counting all possible Strings can be composed quickly. so preprocessing gives me 552 of the 16 symbols words 27956 of less than 16 symbols words (including those who are 1) |
|
|