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 <array> 
#include <cstdio>
#include <type_traits>

template <std::size_t...>
struct index_tuple {};
 
namespace detail {
 
template <typename IndexTuple, std::size_t Next>
struct index_range_next;
template <std::size_t... Indices, std::size_t Next>
struct index_range_next<index_tuple<Indices...>, Next> {
 public:
  typedef index_tuple<Indices..., (Indices + Next)...> type;
};
 
template <typename IndexTuple, std::size_t Next, std::size_t Tail>
struct index_range_next2;
template <std::size_t... Indices, std::size_t Next, std::size_t Tail>
struct index_range_next2<index_tuple<Indices...>, Next, Tail> {
 public:
  typedef index_tuple<Indices..., (Indices + Next)..., Tail> type;
};
 
template <std::size_t First, std::size_t Step, std::size_t N,
          typename Enable = void>
struct index_range_impl;
template <std::size_t First, std::size_t Step, std::size_t N>
struct index_range_impl<First, Step, N,
                        typename std::enable_if<(N == 0)>::type> {
 public:
  typedef index_tuple<> type;
};
template <std::size_t First, std::size_t Step, std::size_t N>
struct index_range_impl<First, Step, N,
                        typename std::enable_if<(N == 1)>::type> {
 public:
  typedef index_tuple<First> type;
};
template <std::size_t First, std::size_t Step, std::size_t N>
struct index_range_impl<First, Step, N,
                        typename std::enable_if<(N > 1 && N % 2 == 0)>::
                            type> : public detail::
                                        index_range_next<
                                            typename detail::index_range_impl<
                                                First, Step, N / 2>::type,
                                            First + N / 2 * Step> {};
template <std::size_t First, std::size_t Step, std::size_t N>
struct index_range_impl<First, Step, N,
                        typename std::enable_if<(N > 1 && N % 2 == 1)>::
                            type> : public detail::
                                        index_range_next2<
                                            typename detail::index_range_impl<
                                                First, Step, N / 2>::type,
                                            First + N / 2 * Step,
                                            First + (N - 1) * Step> {};
 
template <std::size_t First, typename IndexTuple>
struct index_range_helper;
template <std::size_t First, std::size_t... Indices>
struct index_range_helper<First, index_tuple<Indices...>> {
 public:
  typedef index_tuple<(Indices + First)...> type;
};
 
}  // namespace detail
 
template <std::size_t First, std::size_t Last, std::size_t Step = 1>
struct index_range
    : public detail::index_range_helper<
          First, typename detail::index_range_impl<
                     0, Step, ((Last - First) + (Step - 1)) / Step>::type> {};

namespace detail {

template <std::size_t N, std::size_t... Indices>
std::array<int, 9> solve_impl(const index_tuple<Indices...>&) {
    return std::array<int, 9>{{printf("%ldx%ld=%ld\n", (N + 1), (Indices + 1), ((N + 1) * (Indices + 1)))...}};
}
    
template <std::size_t... Indices>
std::array<std::array<int, 9>, 9> solve(const index_tuple<Indices...>& t) {
    return std::array<std::array<int, 9>, 9>{{solve_impl<Indices>(t)...}};
}
    
}  // namespace detail

std::array<std::array<int, 9>, 9> solve() {
    return detail::solve(typename index_range<0, 9>::type());
}

int main() { solve(); }

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 <iostream>
#include <cstdio>
 
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>
main(){int i=1,j=1;for(;;){printf("%dx%d=%d\n",i,j,i*j);j++;if(j==9){i++;j=1;}if(i==10){break;}}}

C++: #include <iostream>
#include<vector>
#include<stdlib.h>
#include<algorithm>
#include<string>
using namespace std;



int main(void){

	for (int i = 1; i < 10; i++){
	
		for (int j = 1; j < 10; j++){
		

			cout << i << "??" << j << "=" << i*j << endl;

		}

	}

	

	
	return 0;
}

C++: <?php 

for($i = 1; $i < 10; $i++){
	for($j = 1; $j < 10; $j++){
		$sum = $i*$j;
		print "$i.x$j.=$sum.\n";
	}
}

?>

C++: #include <cstdio>
#include <cstdlib>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <stack>
#include <vector>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#define sqr(x) ((x)*(x))
#define X first
#define Y second
using namespace std;
int a[18000002];
map<char,int> ma;
int main()
{
    int k,i,j;
    #ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
    #endif
    for(i=1;i<=18000000;i++)a[i]=i;
    return 0;
}

C++: public class Main {

	/**
	 * ????????????????????????
	 *
	 * @param args
	 */
	public static void main(String[] args) {
		for (int i = 1; i < 10; i++) {
			for (int j = 1; j < 10; j++) {
				System.out.println(i + "x" + j + "=" + i * j);
			}
		}
	}
}

C++: #include <stdio>
int main(){
  int i,j,k;
  for(i=1;i<10;i++){
    for(j=1;j<10;j++){
      printf("%dx%d=%d\n",i,j,i*j);
    }
  }
  return 0;
}

C++: #include <iostream>

int main()
{
    for (int a = 1; a < 10; ++a) {
        for (int b = 1; b < 10; ++b) {
            std::cout << a << "x" << b << "=" << a*b << std::endl;
        }
    }

    return 0;
}

C++: hawawa

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++){
        cout << i << "x1=" << i*1 << endl;
        cout << i << "x2=" << i*2 << endl;
        cout << i << "x3=" << i*3 << endl;
        cout << i << "x4=" << i*4 << endl;
        cout << i << "x5=" << i*5 << endl;
        cout << i << "x6=" << i*6 << endl;
        cout << i << "x7=" << i*7 << endl;
        cout << i << "x8=" << i*8 << endl;
        cout << i << "x9=" << i*9 << endl;

    }　
    return 0;
}

C++: #include <iostream>
#include <cstdlib>
#include <cstdio>
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(void){
        for(int a=1;a<=9;a++){
                for(int b=1;b<=9;b++){
                        cout<<a<<"??"<<b<<"="<<a*b<<endl;
                }
        }
        return 0;
}
~                                                                                                                                                      
~

C++: #include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<map>
#include<deque>
#include<cstring>
#include<climits>
#include<cassert>
#include<cctype>

#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)

using namespace std;

int main() {
  map<int,int> mp;
  rep(i,9) rep(j,9) {
    mp[i] = (int)mp.size();
    cout << i+1 << 'x' << j+1 << '=' << (i+1)*(j+1) << endl;
  }
  
  return 0;
}