Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- program roadtofour;
- var
- s,s1:ansistring;
- p, i, k, g, n, m:integer;
- q,j:array[1..3001] of integer;
- x:array[1..6001] of integer;
- begin
- assign(input,'input.txt');
- reset(input);
- assign(output,'output.txt');
- rewrite(output);
- readln(s);
- readln(s1);
- close(input);
- n:=length(s);
- m:=length(s1);
- g:=0;
- for i:=1 to n do
- begin
- val(s[i],q[i]);
- end;
- for i:=1 to m do
- begin
- val(s1[i],j[i]);
- end;
- for p:=m downto 1 do
- for i:=n downto 1 do
- begin
- if (p>1) and (i>1) then
- begin
- g:=j[p]*q[i];
- if g>9 then
- begin
- if (i=n) and (m=p) then
- x[p+i]:=g mod 10
- else
- x[p+i]:=x[p+i]+(g mod 10);
- if (i=n) and (m=p) then
- x[p+i-1]:=g div 10
- else
- x[p+i-1]:=x[p+i-1]+(g mod 10);
- if x[p+i]>9 then
- begin
- x[p+i-1]:=(x[p+i] div 10)+x[p+i-1];
- x[i+p]:=x[i+p] mod 10;
- end
- end
- else
- x[i+p]:=g;
- end
- else
- begin
- g:=j[p]*q[i];
- x[p+i]:=(g mod 10)+x[p+i];
- x[1]:=g div 10;
- end;
- end;
- if x[1]=0 then
- begin
- for i:=2 to (n+m) do
- write(x[i]);
- end
- else
- begin
- for i:=1 to (n+m) do
- write(x[i]);
- end;
- close(output);
- end.
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement