Go: package main

import (
	"fmt"
	"strconv"
)

func main() {
	for _, leftValue := range MultiplicationTableNum(9) {
		for _, rightValue := range MultiplicationTableNum(9) {
			strLeftVal, strRightVal, strMulti := strconv.Itoa(leftValue), strconv.Itoa(rightValue), strconv.Itoa(Multiplication(leftValue, rightValue))
			fmt.Println(strLeftVal + "x" + strRightVal + "=" + strMulti)
		}
	}
}

func MultiplicationTableNum(num int) []int {
	multiNum := []int{}
	for i := 1; i <= num; i++ {
		multiNum = append(multiNum, i)
	}
	return multiNum
}

func Multiplication(x, y int) int {
	return x * y
}

C++: #include<cstring>
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>

#define lson u<<1
#define rson u<<1|1
#define mid (l+r)>>1
#define lbranch l, mid, lson
#define rbranch mid+1, r, rson
#define MAXN 1050000
using namespace std;

struct SegTree{
    bool vis[30];
    int lazy;
    void init(){
        memset(vis, 0, sizeof(vis));
    }
}seg[MAXN<<2];
int n, m;

void build(int l, int r, int u){
    seg[u].lazy = -1;
    seg[u].init();
    if(l == r) return;
}

void PushUp(int u){
    for(int i=0; i<30; i++)
        seg[u].vis[i] = seg[lson].vis[i] | seg[rson].vis[i];
}

void PushDown(int l, int r, int u){
    if(seg[u].lazy != -1){
        seg[lson].init();
        seg[rson].init();
        seg[lson].lazy = seg[u].lazy;
        seg[rson].lazy = seg[u].lazy;
        seg[lson].vis[seg[u].lazy] = true;
        seg[rson].vis[seg[u].lazy] = true;
        seg[u].lazy = -1;
    }
}

void update(int ql, int qr, int color, int l, int r, int u){
    if(ql <= l && r <= qr){
        seg[u].lazy = color;
        seg[u].init();
        seg[u].vis[color] = true;
        return;
    }
    PushDown(l, r, u);
    if(ql <= mid) update(ql, qr, color, lbranch);
    if(qr > mid) update(ql, qr, color, rbranch);
    PushUp(u);
}

void query(int ql, int qr,int l, int r, int u, bool vis[]){
    if(ql <= l && r <= qr){
        for(int i=0; i<30; i++){
            vis[i] |= seg[u].vis[i];
        }
        return;
    }
    PushDown(l, r, u);
    if(ql <= mid) query(ql, qr, lbranch, vis);
    if(qr > mid)  query(ql, qr, rbranch, vis);
}

int main(){
    freopen("/home/acm/code/input.txt","r", stdin);
    while(cin>>n>>m){
        build(1, n, 1);
        while(m--){
            char ch[2];
            scanf("%s", ch);
            if(ch[0] == 'P'){
                int a, b, c;
                c--;
                scanf("%d %d %d", &a, &b, &c);
                update(a, b, c, 1, n, 1);
            }else{
                int a, b;
                scanf("%d %d", &a, &b);
                bool vis[30] = {0};
//                query(a, b, 1, n, 1, vis);
                bool first = true;
                for(int i=0; i<30; i++){
                    if(vis[i]){
                        if(!first){
                            printf(" ");
                        }else{
                            first = false;
                        }
                        printf("%d", i+1);
                    }
                }
            }
        }
    }
}

C++: i, j;main(){for(;i++<9;)for(j=1;j<=9;)printf("%dx%d=%d\n",i,j++,i*j);return 0;}

C++: #include<iostream>
using namespace std;
int main()
{
    for(int i = 1 ; i <= 9 ; i++){
        for(int j = 1 ; j <= 9 ; j++){
            printf("%dx%d=%d\n",i,j,i*j);
        }
    }
    return 0;
}

C++: #include <stdio.h>

int main()
{
	for(int i = 1; i <= 9; i++)
	{
		for(int ii = 1; ii <= 9; ii++)
		{
			printf("%dx%d=%d\n",i,ii,i * ii);
		}
	}
	return 0;
}

C++: #include<iostream>

using namespace std;

int main(){

	for(int i1=0 ; i1<9 ; i1++){
		for(int i2=0 ; i2<9 ; i2++){
			cout << i1+1 << 'x' << i2+1 << '=' << i1*i2 << endl;
		}
	}
return 0;
}

C++: #include<iostream>
using namespace std;
 
int main(){
    for(int i=1;i<=9;i++){
for(int j=1;j<=9;j++){
cout << i << "x" << j << "=" << i*j << "\n";);
}
}
    return 0;
}

C++: #include<stdio.h>

int main(){
	
	for(int i = 1; i<=9; i++)
	{
		for(int j = 1; j<=9; j++)
		{
			printf("%dx%d=%d\n", i, j, i*j);
		}
	}
	
    return 0;
}

C++: #include<cstdio>
using namespace std;

// ÄAÉæé2iñ
void rec(int depth, int max_depth, int a[], int &cnt) {
  if ( depth == max_depth ) {
    cnt++;
    return;
  }
  
  for(int i = 0; i < 2; i++) {
    a[depth] = i;
    rec(depth + 1, max_depth, a, cnt);    
  }  
}

int main() {  
  int a[128];
  int cnt = 0;
  int max_depth = 27;
  rec(0, max_depth, a, cnt);
  
  for(int a = 1; a <= 9; a++)
    for(int b = 1; b <= 9; b++)
      printf("%dx%d=%d\n", a, b, a * b);
  return 0;
}

C++: #include <iostream>

using namespace std;

int main(){
	for(int i=1;i<10;i++){
		for(int j=1;j<10;j++){
			cout<<i<<"x"<<j<<"="<<i*j<<"\n";
		}
	}
	return 0;
}

C++: #include<iostream>

int main(){
int i,j;
for(i=1;i<10;i++)for(j=1;j<10;j++)cout<<i<<"x"<<j<<"="<<i*j<<endl;

return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;

int main(){
  for(int i = 1; i <= 9; i++){
    for(int j = 1; j <= 9; j++){
      cout << i << "x" << j << "=" << i*j << endl;
    }
  }
}

C++: #include <bits/stdc++.h>
using namespace std;

int main(){
	for (int i = 1; i <= 9; i++){
		for (int j = 1; j <= 9; j++){
			printf("%dx%d=%d\n", i, j, i * j);
		}
	}
}

C++: #include <iostream>

using namespace std;

int main (int argc, char * const argv[]) {
    // insert code here...
    
	for(int i=1;i<10;i++){
		for(int j=1;j<10;j++){
			cout<<i<<"x"<<j<<"="<<i*j<<endl;
		}
	}
    return 0;
}

C++: class Main{
	public static void main(String[] a){
		for(int i=1;i<=9;i++){
	   		for (int n=1;n <=9;n++){
			System.out.println(i + "x" + n + "=" + (i *n));
	   		}
  		}
	}
}

C++: 
#include <iostream>
using namespace std;

int main(){
int a = 1,b = 1,c;
while(a != 9 and b != 9){
c=a*b;
cout<<a<<"x"<<b<<"="<<c<<endl;
b++;
if(b == 10){
a++;
b = 1;
}

}
}

C++: #include<iostream>
using namespace std;

int main(){
    int i,j;
    for(i=1;i<=9;i++)
    {
        for(j=1;j<=9;j++)
        {
            cout << i << "x" << j << "=" << i*j << endl;
        }
    }
    return 0;
}

C++: #include<iostream>
 using namespace std;
int main()
{
    for(int i=1;i<10;++i)
    {
        for(int x=1;j<10;++j)
        {
            cout << i << 'x' << x << '=' << i*x << endl;
        }
    }
}

C++: #include <bits/stdc++.h>
using namespace std;
int main(){
for(int i=1;i<10;i++) for(int j=1;j<10;j++) cout << i << "x" << j << "=" << i*j << endl;
return 0;
}

C++: #include <iostream>

int main(){
	for(int i=1;i<10;++i){
		for(int j=1;j<10;++j){
			std::cout<<i<<'x'<<j<<'='<<i*j<<endl;
		}
	}
	return 0;
}

C++: #include<iostream>
using namespace std;
int main()
{
	int i,j;
	for(i=1;i<=9;i++)
	{
		for(j=1;j<=9;j++)
		{
			int sum=0;
			sum=i*j;
			cout<<i<<"*"<<j<<"="<<i*j<<endl;
		}
	}
	return 0;
}

C++: ///
// File:  0000.cpp
// Author: ymiyamoto
//
// Created on Sat Nov  4 15:30:20 2017
//

#include <cstdint>
#include <iostream>

using namespace std;

int32_t main()
{
  for (uint32_t i = 1; i <= 9; i++) {
    for (uint32_t j = 1; j <= 9; j++) {
      cout << i << "x" << j << "=" << i * j << endl;
    }
  }

  return 0;
}

C++: #include "stdio.h"
#include "conio.h"
void main()
{
    int i, j;
   
    for(i = 1; i <= 9; i++)
    {
        for(j = 1; j <= 9; j++)
        {
            printf("\n%d x %d = %d", i, j, i*j);
        }
        printf("\n========================");
    }
    getch();
}

C++: #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
using namespace std;



int main()
{
	//freopen("in.txt","r",stdin);
	//freopen("out.txt","w",stdout);
	
	int i,j;
	for(i=1;i<=9;i++)
		for(j=1;j<=9;j++)
			printf("%dx%d=%d\n",i,j,i*j);
	
	return 0;
}