#include
int main()
{
int k1,k2,k=0,i,j,temp,temp1,temp2,m=0,x;
char str1[10000];
char str2[10000];
char strmult[100000];
static int arr[100000];
scanf("%s",str1);
scanf("%s",str2);
k1=strlen(str1);
k2=strlen(str2);
temp2=0;
for(i=k2-1;i>=0;i--)
{
k=m;
temp2=0;
for(j=k1-1;j>=0;j--)
{
temp=(str1[j]-'0')*(str2[i]-'0')+temp2+arr[k];
temp1=(temp%10)%10%10;
arr[k]=((temp1))%10%10;
// strmult[k]=(temp1+'0')+strmult[k];
strmult[k]=arr[k]+'0';
k=k+1;
temp2=temp/10;
if(j==0&&temp2!=0)
{
while(temp2>0)
{
x=temp2%10;
arr[k]=x+arr[k];
int temp4=arr[k]/10;
strmult[k]=(arr[k]%10)+'0';
temp2+=temp4;
temp2=temp2/10;
k=k+1;
}
}
}
m=m+1;
}
printf("\n");
int k3=strlen(strmult);
for(i=k3-1;i>=0;i--)
printf("%c",strmult[i]);
return 0;
}
THIS PROGRAM CAN BE USE TO FIND MULTIPLICATION UPTO LARGE NUMBER TRY IT NOW AND TRY TO SOLVE IT URSELF!! :)
1 comment:
YOU CAN ALSO SUBMIT YOUR QUESTION/SOLUTION AFTER THAT YOUR QUESTION/SOLUTION WILL UPDATE ON THIS BLOG WITH YOUR NAME!!
Post a Comment