Course : C language

Question: Run this given problem with output

#include #include #include

int* readFile(FILE *f){

int a; char* str; int i=0; while (fscanf(f, "%d", &a)!=-1) { i++; }

fseek(f, 0, SEEK_SET); int arr = (int)malloc((i+1) * sizeof(int)); arr[0] = i; i=1; while (fscanf(f, " %d", &arr[i])!=-1) { i++; } return arr; }

void writeFile(FILE f, char output){ fprintf(f, "%s", output); return; }

int core(int index,int *arr, int *visited, int size) { int i;

int z; if(arr[index]==0) { return 1; } visited[index] = 1; int offset = arr[index];

if((index+offset= 0 && visited[index-offset] != 1){ z = core(index-offset,arr,visited,size); return z; } else return 0;

}

void functionName(FILE *fin, FILE *fout){ int *arr1 = readFile(fin); //int arr[] = { 4, 4, 1, 5, 2, 6, 3, 4, 2, 0 }; //int arr[] = { 3, 3, 2, 2, 0}; int temp=0,arr[arr1[0]]; for(temp=0;temp

int visited = (int)malloc(sizeof(arr)); for(i=0;i

int cur = 0; int ans = core(cur,arr,visited,size); if(ans == 1){ writeFile(fout, "Solvable"); } else{ writeFile(fout, "Not Solvable"); }

}

int main(){ char in[] = "input.txt"; char out[] = "output.txt"; FILE *fin = fopen(in, "r"); FILE *fout = fopen(out, "w");

functionName(fin, fout); fclose(fin); fclose(fout); return 0; }

NOTE: RUN THE GIVEN PROGRAM WITH OUTPUT

Suppose you are playing a special game of hopscotch on a line of integer numbers drawn on the ground like so: 4 4 1 5 2 6 3 4 20 The number, with a square around it, indicates where you are currently standing. You can move left or right down the line by jumping the number of spaces indicated by the number you are standing on. So if you are standing on a 4, you can jump either left 4 spaces or right 4 spaces. You cannot jump past either end of the line. For example, the first number (4) only allows you to jump right, since there are no numbers to the left that you can jump to. The goal: you want to get to the 0 at the far end (right side) of the line. You are also guaranteed that there will be only one zero, which, again, will be at the far right side. 4 4 1 5 2 6 3 4 2 0 Starting position Step 1: 4 4 1 5 2 6 3 4 2 0 Jump right 4 4 1 5 2 6 34 20 Step 2: Jump left Step 3: 4 4 1 5 2 6 3 4 20 Jump right Step 4: 4 4 1 5 2 6 34 2 0 Jump right 4 4 1 5 2 6 3 4 2 0 Step 5: Jump left 4 4 1 5 2 6 3 4 2 O Step 6: Jump right Some Knights Scotch lines have multiple paths to 0 from the given starting point. Other lines have no paths to 0, such as the following: 1 2 3 0 In this line, you can jump between the 3's, but not anywhere else. You are to write a recursive function that returns an integer 1 (for solvable) or 0 (for not solvable). indicating if you are able to get to the rightmost 0 or not