Small Multiplication Table

0.5s 256M

Multiplication tables help us quickly see the result of multiplying two numbers.

You are given an integer \(n\). Output the multiplication table from \(1 \times 1\) to \(n \times n\) in order. First fix the outer number as \(1\) and let the inner number go from \(1\) to \(n\); then fix the outer number as \(2\) and let the inner number go from \(1\) to \(n\) again. Continue until the outer number reaches \(n\).

Each multiplication expression must be printed on its own line, exactly in the required format.

Syntax Restrictions

This problem uses the syntax restrictions of Unit 4 (Loops) of the syntax textbook. You may use if, else, loops, comparisons, logical operators, integer variables, cin, cout, and cout << endl; however, you may not use arrays or containers, and you may not use any function other than main (including built-in functions and user-defined functions). The name endl is allowed only as an output newline manipulator, not as a function call.

Your source code is checked automatically during judging. A submission that breaks the restrictions is judged SR (Syntax Restriction), and the judge feedback lists where the violation is.

Click to expand: allowed and forbidden syntax

Allowed:

  • #include <iostream> or other ordinary includes (no extra header is needed)
  • using namespace std;
  • the int main() function and return 0;
  • integer, Boolean, and character variables, such as int, long long, bool, and char
  • reading with cin >> and printing with cout <<, including cout << endl
  • if, else, for, and while
  • arithmetic, comparison, and logical operators, such as +, -, *, /, %, <, <=, ==, and &&
  • assignment and increment/decrement, such as =, +=, ++, and --
  • comments (// and /* */)

Forbidden (common examples):

  • arrays and indexing syntax []
  • containers or similar tools such as vector, array, string, deque, map, and set
  • dynamic allocation syntax such as new and delete
  • any function call or function declaration other than main, including max, min, abs, sqrt, pow, sort, swap, getline, printf, and scanf
  • non-include preprocessor directives such as #define

Input

The input contains one line with one integer \(n\).

Constraints

  • \(1 \le n \le 9\)

Output

Output \(n \times n\) lines.

For each pair \(i, j\), output one line:

i*j=answer

Replace i, j, and answer with the actual numbers. Do not print spaces around * or =.

The required order is:

  • First fix \(i = 1\) and let \(j\) go from \(1\) to \(n\).
  • Then fix \(i = 2\) and let \(j\) go from \(1\) to \(n\).
  • Continue in this way until \(i = n\).

Sample Input 1

3

Sample Output 1

1*1=1
1*2=2
1*3=3
2*1=2
2*2=4
2*3=6
3*1=3
3*2=6
3*3=9

Sample Explanation 1

Since \(n = 3\), we output the multiplication table from \(1 \times 1\) to \(3 \times 3\).

Sample Input 2

1

Sample Output 2

1*1=1

Problem page help

Keyboard shortcuts

Main features

  • Sample tests — Runs the sample cases bundled with the problem and auto-compares against the expected output.
  • Custom test — Run your code with your own stdin. Optionally tick the "Compare with expected (diff)" box to verify against expected output line-by-line.
  • Template — Paste the default code template you set on your profile page.
  • Collab — Edit this problem together with classmates in real time.
  • Auto-draft — Editor contents auto-save to your browser every 1.5 seconds (per account / problem / language).
  • Submit — Send your code to the judge for grading; returns AC / WA / TLE etc.

Limits

  • Source code: at most 65,536 characters
  • Custom test stdin and expected output: at most 1 MB each (≈1 million characters)
  • Custom test: about 1 request per 3 s per user (sample test: 1 per 1 s)
  • Custom test has a 15 second wall-clock cap; sample tests use the problem time limit, the same as the official judge
  • Interactive problems do not offer custom test (cannot simulate interaction with the judge).
  • Submitting has no rate limit, but rapid repeated submissions on the same problem are treated as score farming.