# Constraints

Time Limit: 1 secs, Memory Limit: 32 MB

# Input

The first line of the input is a positive integer T. T is the number of test cases followed.

Each test case contain two integer a,b (0<=a<=10^100, 0<=b<=10,000) given in one line.

# Output

The output of each test case should consist of one line, contain the result of a*b.

# Sample Input

12 7

# Sample Output

14

#include <iostream>
#include <memory.h>

int ans[106];

std::string reverse(std::string s) {
std::string sss = "";
for (int i = s.length()-1; i >= 0; --i)
sss += s[i];
return sss;
}

void add(std::string s, int times) {
for (int i = 0; i < s.length(); ++i) {
ans[i] += (s[i]-'0') * times;
if (ans[i] > 9) {
ans[i+1] += ans[i] / 10;
ans[i] %= 10;
}
}
}

int main()
{
int num;
std::cin >> num;
while (num--) {
memset(ans, 0, sizeof(ans));
std::string s;
int times;
std::cin >> s >> times;
s = reverse(s);
while (times != 0) {
int temp = times % 10;
s = "0" + s;
times = (times - temp) / 10;
}
bool pre = true;
for (int i = 105; i >= 0; --i) {
if (pre && ans[i] == 0)
continue;
pre = false;
std::cout << ans[i];
}
if (pre) std::cout << "0";
std::cout << std::endl;
}
}

#### Sicily 1381. a*b

2015-01-11 12:21:55

#### Sicily 1381. a*b【高精度乘法】

2014-11-07 21:02:19

#### 1381. a*b 大数相乘

2013-09-05 19:49:58

#### 1381. a*b

2013-10-11 23:55:45

#### 1381. a*b 高精度计算乘法

2013-01-04 15:23:14

#### Sicily AVL Tree

2016-12-09 16:27:16

#### 中大SICILY分类

2011-11-03 20:18:21

#### Sicily 4312. A + B

2015-01-10 12:48:40

#### Sicily 1381 a*b

2012-01-27 13:33:51

#### 中山大学Sicily在线测评系统题目分类

2013-06-26 21:39:40