Nine array Fractions

1,2,3...9 These nine numbers make up a fraction with a value of exactly 1/3, how does the group method work?

The following program implements this function, please fill in the missing code in the underlined section.

#include <stdio.h>

void Test (int x[])

{

int a = x[0]*1000 + x[1]*100 + x[2]*10 + x[3];

int b = x[4]*10000 + x[5]*1000 + x[6]*100 + x[7]*10 + x[8];

if (a*3==b) printf ("%d/%d\n", A, b);

}

void f (int x[], int k)

{

int i,t;

if (k>=9) {

Test (x);

Return

}

for (i=k; i<9; i++) {

{t=x[k]; x[k]=x[i]; x[i]=t;}

f (x,k+1);

_____________________________________________//Fill in the blanks

}

}

int main ()

{

int x[] = {1,2,3,4,5,6,7,8,9};

f (x,0);

return 0;

}

Note: Fill in only what is missing, and do not write any existing code or descriptive text on any of the surfaces.

Nine array Fractions