I have an assignment to complete in c language ...

a person is standing on feld[0] and has to make it to the end(feld[20]) the rules are either forward those many steps the box has value((*s).feld[x]) or backward whole number of the half of the value at last it should either return 0 or 1 0 being cannot be solved 1 being can be solved this is the c file #include #include #include "testat-7.h" int huepfspiel(spielfeld * s, int nr); int huepfspiel(spielfeld * s, int nr){ int rc = 0; static int aufrufe; int k; ++aufrufe; printf("%d", aufrufe); if(nr == 20) rc = 1; if(nr != 20 && aufrufe < 4000){ for(k=0; k<=1; k++){ if(k == 1 && (nr + (*s).feld[nr] = 0)){ nr = (nr - (((*s).feld[nr])/2)); rc = huepfspiel(&s, nr); if(rc == 1) break; } } // ... } return rc; } int main() { spielfeld s = {20, {5,3,2,1,7,5,1,2,3,4,5,1,3,7,1,5,1,9,0,1}}; //printf("%d", [login to view URL][20]); printf("Loesbar: %d\n", huepfspiel(&s, 0)); return 0; } ----------------------------------------------------------- and this is the header file #ifndef _TESTAT_7_H #define _TESTAT_7_H typedef struct { int n; // Feldgroesse int feld[20]; // Spielfeld } spielfeld; #endif