void evaluate(complex<double>* f, int begin Pos, int omplex<double> temp[2"MAX NI L,J, rightPos, int totallength) for(i= beginPos, i <=endPos, 1++) complex<double> j=begin Pos temp[2"MAX N], tempY1[ MAX N] for(i= begin Pos; i <=endPos; 1 +=2) 2[2 MAX NI midPos=(begin Pos + endPos )2 fD=temp[]: puts("Error in use Polynomial! " for(i= begin Pos +1; i<=endPos; 1+=2) t(-1) fD= temp[; else if(beginPos =endPos) j++ or(i= leftPos; i<=rightPos, 1 ++) y[=fbeginPos]: void print( const complex<double>* f, int lEngth) y=flbeginPos]+flendPos]]: if(abs(f(o].realO)>EPS) else for(i= leftPos, i<=rightPos; 1++ temp[=x[*x[] evaluate(f, begin Pos, midPos, temp, for(i=1; i lEngth; 1++) evaluate(f, midPos+1, endPos, temp, if(f0 realO>EPS) mpY2, left Pos, rightPos if (is Print) printf("+ " else is pri y=tempY1[n+x[*tempY20]; printf("%lft%", fo realo, i) else if (f. realo<-EPS) oid shuffle(complex<double>* f, int begin Pos, if( is Print) printf("-"); endPos) else is Print= true printf("%lft %d",-f[0]. realo, i);void evaluate(complex<double>* f, int beginPos, int endPos, const complex<double>* x, complex<double>* y, int leftPos, int rightPos, int totalLength) { int i; complex<double> tempX[2*MAX_N],tempY1[2*MAX_N], tempY2[2*MAX_N]; int midPos = (beginPos + endPos)/2; if ((beginPos > endPos)||(leftPos > rightPos)) { puts("Error in use Polynomial!"); exit(-1); } else if(beginPos == endPos) { for(i = leftPos; i <= rightPos; i ++) y[i] = f[beginPos]; } else if(beginPos + 1 == endPos) { for(i = leftPos; i <= rightPos; i ++) y[i] = f[beginPos] + f[endPos]*x[i]; } else { shuffle(f, beginPos, endPos); for(i = leftPos; i <= rightPos; i ++) tempX[i] = x[i]*x[i]; evaluate(f, beginPos, midPos, tempX, tempY1, leftPos, rightPos,totalLength); evaluate(f, midPos+1, endPos, tempX, tempY2, leftPos, rightPos, totalLength); for(i = leftPos; i <= rightPos; i ++) y[i] = tempY1[i] + x[i]*tempY2[i]; } } void shuffle(complex<double>* f, int beginPos, int endPos) { complex<double> temp[2*MAX_N]; int i, j; for(i = beginPos; i <= endPos; i ++) temp[i] = f[i]; j = beginPos; for(i = beginPos; i <= endPos; i +=2) { f[j] = temp[i]; j ++; } for(i = beginPos +1; i <= endPos; i += 2) { f[j] = temp[i]; j ++; } } void print(const complex<double>* f, int fLength) { bool isPrint = false; int i; if (abs(f[0].real()) > EPS) { printf(“%lf”, f[0].real()); isPrint = true; } for(i = 1; i < fLength; i ++) { if (f[i].real() > EPS) { if (isPrint) printf(" + "); else isPrint = true; printf("%lft^%d", f[i].real(),i); } else if (f[i].real() < - EPS) { if(isPrint) printf(" - "); else isPrint = true; printf("%lft^%d", -f[i].real(),i);