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 <iostream>
#include <algorithm>
#include <vector>
using namespace std;

template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void POSS(T condition){ if(condition) cout << "POSSIBLE" << endl; else cout << "IMPOSSIBLE" << endl; }
template<class T> inline void Poss(T condition){ if(condition) cout << "Possible" << endl; else cout << "Impossible" << endl; }
template<class T> inline void First(T condition){ if(condition) cout << "First" << endl; else cout << "Second" << endl; }
int character_count(string text, char character){ int ans = 0; for(int i = 0; i < text.size(); i++){ ans += (text[i] == character); } return ans; }
long power(long base, long exponent, long module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ long root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }}
struct position{ int y, x; }; position move_pattern[4] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}}; // double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); }
template<class itr, class func> void array_output(itr start, itr goal, func out = [](itr x) { return x; } ){ string ans; for(auto i = start; i != goal; i++){ ans += to_string(*i) + " "; } ans.pop_back(); cout << ans << endl; }
template<class itr, class func> void nint_output(itr start, itr goal, func out = [](itr x) { return x; } ){ string ans; for(auto i = start; i != goal; i++){ ans += string(out(*i)) + " "; } ans.pop_back(); cout << ans << endl; }
long gcd(long a, long b){ if(a && b){ return gcd(min(a, b), max(a, b) % min(a, b)); }else{ return a; }}
#define mod long(1e9 + 7)
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcount(n)

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

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

int main(){

	int a=0;
	int b=0;
	int ans;

	for(int count=0;count<81;count++)
	{
		a++;
		if(0==a%10){a=1;}

		if(a==1)
		{
			b++;
			if(0==b%10){b=1;}
		}
	ans=b*a;
	cout<<b<<"×"<<a<<"＝"<<ans<<endl;
	}
    return 0;
}

C++: #include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
const int maxn=100010;
int f[maxn];
double e[maxn],p[maxn];
int find(int x)
{
    return f[x]==x?x:f[x]=find(f[x]);
}
int main()
{
    int n,m;
    while(scanf("%d%d",&n,&m),n+m)
    {
        for(int i=0;i<=n;i++)
        f[i]=i;
        for(int i=1;i<=m;i++)
        {
            int x,y;
            scanf("%d%d",&x,&y);
            f[find(x)]=y;
        }
        memset(e,0,sizeof(e));
        memset(p,0,sizeof(p));
        p[0]=1;

        for(int i=0;i<n;i++)
         for(int j=1;j<=6;j++)
         {
            int temp=find(i+j);
            e[temp]+=(e[i]+p[i])/6.0;
            p[temp]+=p[i]/6.0;
         }
        double ans=0;
        for(int i=0;i<=5;i++)
            ans+=e[n+i];
        printf("%.4f\n",ans);
    }
    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 << '*' << j << '=' << i*j << endl;
    }
  }
}

C++: #include <stdio.h>

int main(void)
{
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 <iostream>
using namespace std;

int main(){


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

    return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int mian(){
int a = 1;
for(int i = 0; i < 1e9; i++){
a *= 10;
a %= 10000;
}
return 0;
}

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

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

    return 0;
}

C++: #include<stdio.h>

int main(void)
{
	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(){
  for(int i=1;i<=9;i++){
    for(int 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 <= 9; i++){
        for(int j = 1; j <= 9; j++)
            cout << i << "*" << j << "=" << i*j << endl;
    }
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using lint = long long int;
using ulint = unsigned long long int;
template<class T = int> using V = vector<T>;
template<class T = int> using VV = V< V<T> >;
template<class T, class U> void assign(V<T>& v, int n, const U& a) { v.assign(n, a); }
template<class T, class... Args> void assign(V<T>& v, int n, const Args&... args) { v.resize(n); for (auto&& e : v) assign(e, args...); }


int main() {
  cin.tie(nullptr); ios_base::sync_with_stdio(false);
  for (int i = 1; i <= 9; ++i) for (int j = 1; j <= 9; ++j) {
    cout << i << 'x' << j << '=' << i * j << '\n';
  }
}