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 <bits/stdc++.h>
using namespace std;
#define FOR(i, s, n) for(int i = s; i < (int)n; i++)
#define per(i, n) for(int i = n; i >= 0; i--)
#define ROF(i, s, n) for(int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\n"
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define MP make_pair
#define EACH(i, n) for (__typeof((n).begin()) i = (n).begin(); i != (n).end(); ++i)
#define SZ(a) int((a).size())
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define CLR(a) memset((a), 0 ,sizeof(a))
#define NCLR(a) memset((a), -1 ,sizeof(a))
#define dump(x) cout << #x << " = " << (x) << "\n";
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << "\n";
#define sq(n) (n) * (n)
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef priority_queue<int> maxpq;
typedef priority_queue< int, vector<int>, greater<int> > minpq;
typedef complex<double> P;
static const double EPS = 1e-10;
static const double PI = acos( -1.0 );
static const int mod = 1000000007;
static const int INF = 1 << 29;
static const LL LL_INF = 1152921504606846976;
static const int dx[] = { -1, 0, 1, 0, 1, -1, 1, -1 };
static const int dy[] = { 0, -1, 0, 1, 1, 1, -1, -1 };


int main() {
#ifdef _DEBUG
	printf( "debug\n" );
#endif
	for ( int i = 1; i < 10; i++ ) {
		for ( int j = 1; j < 10; j++ ) {
			printf( "%dx%d=%d\n", i, j, i * j );
		}
	}
	while(true);
	return 0;
}

C++: #include<iostream>
#include<stdio.h>
using namespace std;
 
int main(){
 
 
for(int i=0;i<9;i++){
for(int j=0;j<9;j++){
printf("%d×%d=%d\n",i+1,j+1,(i+1)*(j+1));
}
}
 
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);
}

C++: #include<stdio.h>

    int main(){
    
            int x,y,z;
    
            for(x=1;x<=9;x++){
                    
                        for(y=1;y<=9;y++){
                                        
                            z=x*y;
                            printf("%dx%d=%d" " ",x,y,z);

                                        }
                 printf("\n");
                            }
         return 0;
                   }

C++: int main(void){
  int i;
  for (i=1; i<9; i++){
    printf("%d×%d=%d", i, i, i*i);
  }}

C++: #include<stdio.h>
i,main(){}

C++: #include<stdio.h>

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

C++: #incldue <stdio.h>

int main(void)
{
    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);
}

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>
#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);
        }
    }
}

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

C++: #include <iostream>
#include <stdio.h>
using namespace std;
int main(void){
    // Here your code !
    for(int i=0;i<9;i++) {
        for(int j=0;j<9;j++) {
            printf("%dx%d=%d\n", i+1, j+1, (i+1)*(j+1));
        }
    }
}

C++: #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
using namespace std;
#define MAXN 500010
struct _node
{
    int u,v,w;
    bool operator < (const _node &b) const
    {
        return w<b.w;
    }
}no[MAXN];
struct _query
{
    int t,id;
    bool operator < (const _query &b) const
    {
        return t<b.t;
    }
}query[MAXN];
int fa[MAXN],ran[MAXN],ans[MAXN],sum;
int findfa(int n)
{
    if(fa[n]!=n)
        fa[n]=findfa(fa[n]);
    return fa[n];
}
inline void mul(int a,int b)
{
    a=findfa(a),b=findfa(b);
    int af=ran[a],bf=ran[b];
    if(a==b)    return ;
    if(af<bf)   swap(a,b);
    fa[b]=a,ran[a]+=ran[b];
    sum-=af*(af-1),sum-=bf*(bf-1);
    sum+=ran[a]*(ran[a]-1);
}
int main()
{
    //freopen(\\\"/home/moor/Code/input\\\",\\\"r\\\",stdin);
    int n,m,q;
    while(scanf(\\\"%d%d\\\",&n,&m)==2)
    {
        for(int i=0;i<m;++i)
            scanf(\\\"%d%d%d\\\",&no[i].u,&no[i].v,&no[i].w),++no[i].u,++no[i].v;
        for(int i=1;i<=n;++i)   fa[i]=i,ran[i]=1;
        sort(no,no+m);
        scanf(\\\"%d\\\",&q);
        for(int i=0;i<q;++i)    scanf(\\\"%d\\\",&query[i].t),query[i].id=i;
        sort(query,query+q);
        sum=0;
        int l=0;
        for(int i=0;i<q;++i)
        {
            while(l<m&&no[l].w<query[i].t)
                mul(no[l].u,no[l].v),++l;
            ans[query[i].id]=sum;
        }
        while(l<m)  mul(no[l].u,no[l].v),++l;
        for(int i=0;i<q;++i)    printf(\\\"%d\\\\n\\\",sum-ans[i]);
    }
    return 0;
}

C++: #include <cstdio>
int main ()
{
    int n,m,i,a,b,node[5],eg[5][5],ans=0;
    for(int i=0;i<5;i++){
        for(int j=0;j<7;j++){
            node[i]=1000;
            eg[i][j]=1000;
        }
    }
    scanf("%d%d",&n,&m);
    for(int i=0;i<m;i++){
        scanf("%d%d",&a,&b);
        scanf("%d",&eg[a][b]);
    }
    node[0]=0;
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(i==0&&eg[i][j]!=1000)node[j]=eg[i][j];
            else if(eg[i][j]+node[i]<node[j]){
                node[j]=eg[i][j]+node[i];
            }
        }
    }
    for(int i=0;i<n;i++){
        printf("%d\n",node[i]);
    }
    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 << endl;
       }
    }
    return 0;
}

C++: #include <iostream>



using namespace std;



int main(){
  for(int i=1;i<10;i++){
    for(int j=1;j<10;j++){
      std::cout << i <<"??"<<j<<"="<<i*j<< '\n';
    }
  }

}

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

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

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

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

C++: #include <cstdio>

using namespace std;

int main() {
 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;
}

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>

int main() {
}

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

int main()
{
	cout << "Hello World";
	return 0;
}

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


int main(){

    int i,j;
    for(i=0;i<9;i++)
        for(j=0;j<9;j++)
            cout<<(i+1)<<"??"<<(j+1)<<"="<<(i+1)*(j+1)<<endl;


    return 0;
}