ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1012. K-based Numbers. Version 2

Problems 1012, 1013
Posted by Leo 20 Nov 2002 13:05
I think, that there are some bugs in tests answers and judge
solutions. My long ariphmetics with bugs gets AC and without - WA.
All problems were in multiplication. I had overflow of WORD and got
AC. Who knows, how to post my opinion to site Creators.
Re: Problems 1012, 1013
Posted by Accepted 2 Dec 2002 21:41
you can use an array of integers for that huge number . when
n = 1800 and k = 10 the answer have about 3600 digits !!! and
you cant store it in nor long nor any other variable.
in this problem you must find a recursive relations . ( not to
consider all answer ). it has a nice soloution . if you use
this method but not receive the correct answer mail me at :
ioi_khafan@hotmail.com . thanks . bye