Advertisement
Guest User

Untitled

a guest
Jan 20th, 2019
77
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.30 KB | None | 0 0
  1. program roadtofour;
  2. var
  3. s,s1:ansistring;
  4. p, i, k, g, n, m:integer;
  5. q,j:array[1..3001] of integer;
  6. x:array[1..6001] of integer;
  7. begin
  8. assign(input,'input.txt');
  9. reset(input);
  10. assign(output,'output.txt');
  11. rewrite(output);
  12. readln(s);
  13. readln(s1);
  14. close(input);
  15. n:=length(s);
  16. m:=length(s1);
  17. g:=0;
  18. for i:=1 to n do
  19. begin
  20. val(s[i],q[i]);
  21. end;
  22. for i:=1 to m do
  23. begin
  24. val(s1[i],j[i]);
  25. end;
  26. for p:=m downto 1 do
  27. for i:=n downto 1 do
  28. begin
  29. if (p>1) and (i>1) then
  30. begin
  31. g:=j[p]*q[i];
  32. if g>9 then
  33. begin
  34. if (i=n) and (m=p) then
  35. x[p+i]:=g mod 10
  36. else
  37. x[p+i]:=x[p+i]+(g mod 10);
  38. if (i=n) and (m=p) then
  39. x[p+i-1]:=g div 10
  40. else
  41. x[p+i-1]:=x[p+i-1]+(g mod 10);
  42. if x[p+i]>9 then
  43. begin
  44. x[p+i-1]:=(x[p+i] div 10)+x[p+i-1];
  45. x[i+p]:=x[i+p] mod 10;
  46. end
  47. end
  48. else
  49. x[i+p]:=g;
  50. end
  51. else
  52. begin
  53. g:=j[p]*q[i];
  54. x[p+i]:=(g mod 10)+x[p+i];
  55. x[1]:=g div 10;
  56. end;
  57. end;
  58. if x[1]=0 then
  59. begin
  60. for i:=2 to (n+m) do
  61. write(x[i]);
  62. end
  63. else
  64. begin
  65. for i:=1 to (n+m) do
  66. write(x[i]);
  67. end;
  68. close(output);
  69. end.
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement