注册
登录
帮助
首页
题库
运行状态
比赛
用户
题解系统
QQ群: 181873520
[A] 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
提示
无
来源
小白菜
操作
题目 Problems
A - The Hardest Problem
[46 / 107 (42.99%)]
B - An Easy Problem
[51 / 117 (43.59%)]
C - Let's Play Games
[4 / 14 (28.57%)]
D - Divide Exactly
[13 / 85 (15.29%)]
E - Prime Again
[17 / 127 (13.39%)]
状态 Status
统计 Statistics
排名 Rank
报名参赛 SIGN UP
显示春菜