OJ Board

Hi,

Thanks for catching that. I solved my RE.

I stumbled across a problem a long time ago where I was given several exponencial numbers, and was my mission to find the largest. I'm trying to remember what is the best way to solve this... I think there was a property in logarithms that allowed this to be made quite fast, but can't seem to get it ...

I get a Runtime Error from UVA and Segmentation Error in another system, probably with the same data tests...
My code checks for array bounds, but I can't seem to understand the failure.
Anyone can see the problem?

Code:

#include <stdio.h>
#include <stdlib.h>
#include <math.h>

#define MAX_V ...