c[i][k[i]+1]=1; c[i][k[i]]=c[i][k[i]]%10; j--; k[i]++; } while(n>=0) { if((c[i][k[i]]=c[i][k[i]]+b[i][n])>9) c[i][k[i]+1]=1; c[i][k[i]]=c[i][k[i]]%10; n--; k[i]++; } for(;c[i][k[i]]==0;k[i]--); back(a[i],a...
//计算x y之间距离double distance(point a,point b){return sqrt( (a.x - b.x)*(a.x - b.x) + (a.y -b.y)*(a.y -b.y) );}想要直接以这样的公式计算,但是当输入大于六位数会出错。需要输入小于等于1000000的数字。所以有没有能够数据不溢出的解决方法。当然计算结果只需要保留后两位即可。参...