#include#includeint main(){char ra[1000];int a[1000],b[1000],t[1000],t1,t2,i,j,k,ggg,gggg,god,god2=0;scanf("%s",&ra);t1=strlen(ra);for(i=0;ia[i]=(int)ra[i]-48; //give me ascanf("%s",&ra);t2=strlen(ra)

// 1234567898765432123456789 * 9876543212345678987654321// = 12193263200731596000609652202408166072245112635269#include #include void main(){int a[7]={6789,2345,4321,8765,6789,2345,1}; // reverse orde

/**************************************************************  此程序 采用分治法进行乘法运算*  求 1011*1101*  coder: 九天神龙*  运行结果:* H:/Java/算法/大整数~1>javac mult.java** H:/Java/算法/大整数~1>java mult* 11x13 结果为: 143** H:

计算19238479821374872198374721983749213794879213749872314乘以19238759823175987123987491238408120348021834098129038590814329085081203840812384结果输出为：370124492646448832605506435126332992351979838854113322285