CODE1 Spoj - cannot solve it

Posted by VaioIsBorn on Stack Overflow See other posts from Stack Overflow or by VaioIsBorn
Published on 2010-03-16T20:01:17Z Indexed on 2010/03/16 20:11 UTC
Read the original article Hit count: 294

Filed under:
|
|
|

I am trying to solve the problem Secret Code and it's obviously math problem.

The full problem

For those who are lazy to go and read, it's like this:

a0,a1,a2,...,an - sequence of N numbers
B - some number known to us
X = a0 + a1*B + a2*(B^2) + a3*(B^3) + ... + an*(B^n)

So if you are given B and X, you should find a0,a1,..an. I don't know how or where to start, because not even N is known, just X and B.

Can you help me ?

© Stack Overflow or respective owner

Related posts about spoj

Related posts about c++