2 int strcspn(char *cs,char *ct) { char *pos; pos strpbrk(cs,ct); if (pos =NULL) return strlen(cs); return pos -cs; Problem 2:Arrays void FireSToA(int s[],int sA[][N_S_TO_A],int a[]) { int i,j; clearArray(a,N_AUNITS); for (i=0;i<N SUNITS;i++) for (j=0;j<N_S_TO_A;j++) a[sA[i][j]]++: void FireAToR(int a[],int aR[][N_RUNITS],int r[]) { int i,j; ClearArray(r,N_RUNITS); for (i=0;i<N AUNITS;i++) if (a [i]>=THRESHHOLD) for (j=0;j<N_RUNITS;j++) x[j]+=aR[i][j]: int classifyPattern(int r[]) { int max,iMax,i; max =-1; for (i=0;i<N RUNITS;i++) if (r[i]max) max r[i]; iMax i; } return iMax; void clearArray(int arr[],int n) { int i; for (i=0;i<n;i++) arr[i]=0;2 int strcspn(char *cs, char *ct) { char *pos; pos = strpbrk(cs, ct); if (pos == NULL) return strlen(cs); return pos - cs; } Problem 2: Arrays void FireSToA(int s[], int sA[][N_S_TO_A], int a[]) { int i, j; ClearArray(a, N_AUNITS); for (i = 0; i < N_SUNITS; i++) for (j = 0; j < N_S_TO_A; j++) a[sA[i][j]]++; } void FireAToR(int a[], int aR[][N_RUNITS], int r[]) { int i, j; ClearArray(r, N_RUNITS); for (i = 0; i < N_AUNITS; i++) if (a[i] >= THRESHHOLD) for (j = 0; j < N_RUNITS; j++) r[j] += aR[i][j]; } int ClassifyPattern(int r[]) { int max, iMax, i; max = -1; for (i = 0; i < N_RUNITS; i++) if (r[i] > max) { max = r[i]; iMax = i; } return iMax; } void ClearArray(int arr[], int n) { int i; for (i = 0; i < n; i++) arr[i] = 0; }