bool CanJump(int A[], int n) 
{
    int k = A[0];
    int i = 1;
	//k starts at 0, so '=' is included
	//n starts at 1
    while(i <= k && i < n)
    {
        if (k < (A[i]+i)) k =(A[i]+i); //furthest we could jump so far
        ++i;
    }

    return i>=n; 
}



#include <stdio.h>


int main(int argc, char** argv)
{
    int a[] = {2,3,1,1,4};
    int n = sizeof(a)/sizeof(int);
    printf("%d\n", CanJump(a,n)); //true

    int b[] = {3,2,1,0,4};
    n = sizeof(b)/sizeof(int);
    printf("%d\n", CanJump(b,n)); //false
    return 0;
}