2016蓝桥杯c-c++省赛试题及答案解析

if(arr[i] != arr[i-1]) arr[top++] = arr[i]; n = top;

for(i = 0 ; i < n - 1; i ++) {

LL gcd = Gcd(arr[i],arr[i+1]); Fs[i].up = arr[i] / gcd; Fs[i].down = arr[i+1] / gcd; }

LL x = Fs[0].up; for(i = 0 ; i < n - 1 ; i ++) x = Get(x,Fs[i].up); LL y = Fs[0].down; for(i = 0 ; i < n - 1; i ++) y = Get(y,Fs[i].down); printf(\ return 0; }