OJ Board

i am unsuccessfully trying to solve this problem.... here's my algo

1. generate digit[x] -> number of digit(s) in x^x ( using log )
2. take input and binary search in digit[] to get a approx
3. use fast exponentiation to evaluate x^x
4. check whether calculated x^x is equal as given input string ...