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;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<ll, int> li;
typedef pair<int, ll> il;
typedef vector<ii> vii;
typedef vector<il> vil;
typedef vector<li> vli;

#define F first
#define S second
#define pb(x) push_back(x)
#define mp(a,b) make_pair(a,b)
#define sz size()
#define all(A)    A.begin(), A.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define f0(i,b)   for(int i=0;i<(b);i++)
#define f1(i,b)   for(int i=1;i<=(b);i++)
#define f2(i,a,b) for(int i=(a);i<=(b);i++)
#define fr(i,b,a) for(int i=(b);i>=(a);i--)
#define rep(i,a,b,c) for(int i=(a);i!=(b);i+=(c))
#define mod 1000000007

#define forr(i,n)    for(i=0; i<n; i++)
#define whilee(i,t)  while(i!=t)
#define  sl(a)  scanf("%lld",&a)
#define  pl(a)  printf("%lld",a)

//for(auto it =A.begin(); it!=A.end(); it++)
//sort(A.begin(),A.end());
//binary_search(A.begin(),A.end(),x);
//reverse(A.begin(), A.end());
//cout << *max_element(A.begin(), A.end());
//cout << *min_element(A.begin(), A.end());
//count(A.begin(), A.end(), X); //counts the occurrences of X
//distance(A.begin(),A.end());  //distance between first to last element
//accumulate(A.begin(), A.end(), 0); //add
//next_permutation(A.begin(), A.end());
//prev_permutation(A.begin(), A.end());
//swap(S[0], T[0]);
//scanf("%d",&x);
//printf("%d\n",x);

//vector <int> A;
//deque <int> A;
//queue <int> A;
//stack <int> A;
//set <int> A;
//map <int,int> A;
//pair <int,int> A ;
//vector <pair <int,int>> A ;
//char ch;
//string S, T, U;
ll i, j, k, a, b, c, d, f, g, h, l, m, n, p, q, r, s, t, w, x, y, z, maxx=INT_MIN, minn=INT_MAX, ans=0, sum=0, cnt=0;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

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

    return 0;
}

C++: #include <iostream>
#include <stack>
#define REP(i,n) for(int i = 1; i < n; i++)

using namespace std;

int main() {
	REP(i,10){
		REP(j,10){
			cout << i << "x" << j << "=" << i*j << endl;
		}
	}
}

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

int main(){

	
	for (int a = 1; a < 9; a++)
	{
		for (int i = 1; i < 9; i++)
		{

			cout << a << "×" << i << "=" << a*i  <<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 << endl;
        }
    }
	return 0;
}

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

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

C++: #include<stdio.h>

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

C++: #include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<iostream>
#define eps 1e-7
using namespace std;
const int maxn=265;
const double g=9.8;
double v[maxn];
int n;
double l1,r1,l2,r2,h;
double fun(double a,double b,double c)
{
    double tmp=sqrt(b*b-4*a*c);
    return (-b+tmp)/(2*a);
}
int solve(double x,double h,double v0)
{
    double th,len;
    int hit=0;
    th=acos(x/(v0*sqrt(fun(g*g/4.0,-(g*h+v0*v0),h*h+x*x))));
    for(int i=1;i<=n;i++)
    {
        double vz=v[i];
        len=fun(g/(2.0*vz*vz*cos(th)*cos(th)),tan(th),-h);
        if(len-l2>=eps&&r2-len>=eps)    return 0;
        if(len-l1>=eps&&r1-len>=eps)    hit++;
    }
    return hit;
}
int main()
{
    
    int ans;    
    while(scanf("%d",&n),n)
    {
        scanf("%lf%lf%lf%lf%lf",&h,&l1,&r1,&l2,&r2);
        for(int i=1;i<=n;i++)
            scanf("%lf",&v[i]);
        ans=0;
        for(int i=1;i<=n;i++)
        {
            ans=max(ans,solve(l1,h,v[i]));
            ans=max(ans,solve(r1,h,v[i]));
            ans=max(ans,solve(l2-2*eps,h,v[i]));
            ans=max(ans,solve(r2+2*eps,h,v[i]));
        }
        printf("%d\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++){
			count << i << "x" << j << "=" << (i*j);
		}
	}
    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>
int main(){

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

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

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

}

C++: #include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <queue>
using namespace std;
typedef long long int ll;
const int INF = 100000000;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
int main(){
    const int n = 9;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            printf("%dx%d=%d\n", i, j, i*j);
        }
    }
    return 0;
}

C++: #include <iostream>

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

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

int main(){

int f,s,;
for(f=1;f++;f<10){
for(s=1;s++;s<10){
cout<<f<<"x"<<s<<"="<<f*s<<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++){
      cout << i << "x" << j << "=" << i * j << "\n";
    }
  }
  return (0);
}

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

int main() {
	int x, y;
	for (x = 1; x <= 9; x = x + 1) {
		for (y = 1; y <= 9; y = y++) {
			cout << x << "??" << y << "=" << x*y << '\n';
		}
	}

	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 <iostream>
using namespace std;

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

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

C++: #include <iostream>

using namespace std;

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