#include<algorithm> #include<iostream> #include<string.h> using namespace std; char a[2000]; struct bigint{ int d[20000]; int len; }; bigint change(char str[]){ bigint bi; int i; bi.len=strlen(str); for(i=0;i<20000;i++){ bi.d[i]=0; } for(i=0;i<bi.len;i++){ bi.d[i]=str[bi.len-i-1]-'0'; } return bi; } bigint multi(bigint a,int b){ bigint c; c.len=0; int i,carry=0; for(i=0;i<a.len;i++){ int temp=a.d[i]*b+carry; c.d[i]=temp%10; c.len++; carry=temp/10; } while(carry!=0){ c.d[c.len]=carry%10; c.len++; carry/=10; } return c; } int main() { int i,j,b; scanf("%s",&a); cin>>b; bigint q; q=multi(change(a),b); //q=change(a); for(i=q.len-1;i>=0;i--){ cout<<q.d[i]; } return 0; }