definition let y be XFinSequence of INT,n be Integer; assume A1: 0< n & n< len a; switch(x) { case 1: break; case 2: break; default: } L:(x=1 or x=2 or not(x=1 & x=2)) now per cases by L; case LA:x=1; case LB:x=2; case LC:not (x=1 & x=2); end; Cè¨èªã§å¦ç int sumarray_prg(int a[MAX_N],int n) { int s[MAX_N],i; if (!(0< n && n< MAX_N))return -1; s[0]=0; for (i=0;i< n;i++) { s[i+1]= s [i] + a[i+1]; } retu


{{#tags}}- {{label}}
{{/tags}}