I've talked about a problem from today's dress rehearsal in http://petr-mitrichev.blogspot.com/2012/05/world-finals-day-2-upe-dinner.html

Here's the first tough testcase for it: http://petr-mitrichev.blogspot.com/2012/05/power-towers-problem-testcase.html

Good luck! :)

You say you have a solution. Can you give an idea?

Let's wait a bit.

OK.

I think we have waited enough :P

Any hope for a hint?

please do a review of this taskAnd towers to compare can be of different height?

I don't see a reason for them not to be. Anyway, you can add some ^1^1^1... to the end.

It seems that the same problem is discussed here.

There is written:

Then

A_{1}<B_{1}But what does

mean?

Apply the function n times

Then you can get negative number that seems strange.

Yes you are right, I may be wrong but I think there's an error with the formula above. It only has the first step done, but it doesn't hold for the next

log(log( A_2 x log( a_1))) = log( log(A_2) + log(log(a_1)) )

And then you have a sum which you cant get rid of because you can't distribute the next log

But, it depends on what you get as a base of logarithm, I think, take Natural Logarithm and since ln(x) increases when x>0, so if we get a negative number, the first number is less than the second one, but not sure still

Obviously, logarithm's base does not have influence on that property.

P.S. Of course iff we have positive base, since .

My unproved and probably wrong solution is like this. Let's evaluate the tower from top to bottom in floating point number until it's too large to go further. Then we discard the remaining bottom part of the tower and just compare the accumulated top values (if bottom parts are of equal height). Also, before doing all that, we have to somehow normalize the numbers and consider longest common top part.

I encourage you to implement it (it shouldn't be that big, should it?) and test it against the above testcase :)

I saw a similar problem at the IFMO's Internet Olympiad (russian statements, problem G). Unfortunately, jury's solution and tests are incorrect.

Yes, if I'm right, there were cool tests like

2

^{952}= 2^{925}= 2^{350}8

^{372}= 8^{349}= 2^{350}The test case posted is easy in the sense that it can be solved with loglog

let a=54^8^35^4

let b=19^55^92^3

log log a = 35^4 * log(8) + log log 54 = 3120463.347019

log log b = 92^3 * log(55) + log log 19 = 3120463.343260

But I can't see a way to generalize this. Is it a correct way to approach the problem?

I think this method can't be generalized because of accuracy of calculations. But this must be analyzed, maybe it is enough to use "Big" floating numbers.

still waiting for the solution.

hmmm, seems like ITERATIVE LOG (log*) function should do the work, shouldn't it ?

I think, that iterative log with checking for equality by using modular arithmetic solves this problem. But I can not prove that.

You can denote precision problems like

and so on.

You should have great precision problems implementing it in standart float pointer arithmetics.

`double`

precision is not more than 10^{18}, and it's not enough (even for the testcase given by Petr in this post, I think).`double`

precision is enough for testcase by Petr.Upd. But

`double`

precision is not enough to check for equality.OK, I agree, it may be enough for that certain testcase. But, as Petr mentioned, it is only the

firsttough testcase, so there might be tougher ones :)For Petr it's enough char precision to check the equality.

For Petr it’s enough bool precision to check the equality.

It seems that we need to find the maximum equal upper part of two towers, i.e. such minimal i and j that

a_{i}^a_{i + 1}^...^a_{n}=b_{j}^b_{j + 1}^...^b_{m}for towers of heights n and m. To find potential i and j level-index arithmetic (some sort of implementation of iterative log idea) can be used. Then the equality must be verified using some exact computations.By the way, how does modular arithmetic help to solve the problem? In particular, it is not clear how to prove that two towers are equal. If we found that two towers are

notcongruent modulo p, where p is prime, then they are not equal. However, the converse is not always true.There are several reasons to find equal part of towers. The first is that it seems to be the only way to pass some tests. For example, if

a= 5^99^99^99^99 andb= 6^99^99^99^99, thenlnlna=lnln5 +ln99 × 99^99^99 andlnlnb=lnln6 +ln99 × 99^99^99. So, these expressions differ only by last few digits. If you want to deal with approximate representations of numbers, then you will have to store all significant digits, which is absolutely impossible.The second reason is that if two towers are not equal, then it is affected very much by upper powers. I mean that if we have upper part of the first tower sufficiently larger than of the second, then we can't make the whole first tower smaller by modifying its lower part. For example, build two towers of

equal height: the first with 16 on its top and the second — with 2. The first tower will be always greater then the second under given conditions:a_{1}^a_{2}^...^a_{n - 1}^16 >b_{1}^b_{2}^...^b_{n - 1}^2, wheren≥ 1 and 2 ≤a_{i},b_{i}≤ 100 for 1 ≤i≤n. This can be generalized:This means that if the ratio of a and b is at least 10, then ratio of two towers, which have a and b on the top (bottom parts must have equal lengths), will also be at least 10 under constraints, given in the statement. So, if we process towers consequently from top to bottom, and at the same level found that first is sufficiently greater than the second (more than 10 times), then the whole first tower is greater.

One more important property is the following. If tops of two towers are big enough, but the second is slightly bigger, then the whole second tower will be at least 10 times larger then the second (here the previous property is taken into account).

This means that we will have to deal only with real numbers, bounded with something about 10

^{9}, unless there exist pairs of different almost equal towers, greater than this bound, but I can't see any way to prove it, except testing on all such cases. The bound 10^{ - 8}is taken based on two Petr's tests and can be lowered if necessary.Sorry for cumbersome post, there are only some ideas on how to solve the problem. They may lead to a solution, very similar to al13n's one, and show that his solution is very likely to be correct.