Euclid算法判断互素

//by史瑞 #include #include #defineboolint #definetrue1 #definefalse0 #defineM2//判断多少个数互素 staticlongintNumber[M]={170,201}; boolJudgePrime(longintIna,longintInb){ longintr,q,t=0,v=1,temp; longinta,b; if(Ina>=Inb){ a=Ina; b=Inb; } else{ b=Ina; a=Inb;