[1357] The Hardest Problem
- 时间限制: 1000 ms 内存限制: 65535 K
- 问题描述
-
Rember how fast you can recite multiplication table? Now give you N, you task is telling me 1*1 to N*N.
- 输入
-
There are many cases, each a number N(1<=N<=9).
- 输出
-
For each case, print the result, note that there is a blank line between two cases.
- 样例输入
-
1 3
- 样例输出
-
1*1=1 1*1=1 2*1=2 2*2=4 3*1=3 3*2=6 3*3=9
- 提示
-
无
- 来源
-
小白菜
- 操作
-
