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>  // g++ -std=c++14 -o a a.cpp

using namespace std;

typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define repto(i, n) for(int i = 0; i <= (n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end()) // ユニークなvectorにする。連続した値を除去して切り出す。
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007
#define DEBUG(x) cout << #x << ": " << x << endl;

__attribute__((constructor))
void initial() {
  cin.tie(0);
  ios::sync_with_stdio(false);
}

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

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

int main(){
	for(int a=0;a<9;a++){
		for(int b=0;b<9;b++)cout<<a+1<<'x'<<b+1<<'='<<(a+1)*(b+1)<<endl;
		}
	}

C++: #import<cstdio>
int main(){for(int i=0,j,k;j=i/9+1,k=i%9+1,81-i;i++)printf("%dx%d=%d\n",j,k,j*k);}

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 << endl;
		}
	}
	return 0;

}

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

int main() {
	for (int i = 0; i < 81; i++) {
		cout << i / 9 + 1 << "x" << i % 9 + 1 << "=" << (i/9+1)*(i%9+1) << endl;
	}

	return 0;
}

C++: #include<stdio.h>

int main()
{
    int i,b;;

    for(i=1;i<=9;i++)
    {
        for(b=1;b<=10;b++)
{
if(b==10&&i==9)
            break;


        printf(" %d*%d=%d\n",i,b,i*b);

    }
    printf("\n");

    }
}

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<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<cmath>
#include<queue>
#define inf 111111111
using namespace std;
const int maxn=105;
struct NODE{
	int w;
	double v;
}node[maxn];
int main()
{
	int cas;
	int n;
	double ans[maxn],sum;
	scanf("%d",&cas);
	for(int ca=1;ca<=cas;ca++)
	{
		scanf("%d",&n);
		for(int i=1;i<=n;i++)
		{
			scanf("%lf",&node[i].v);
			node[i].w=(int)node[i].v;
		}
		sum=0;
		int min,mini,zi;
		bool flag,fzero;
		//int ii=1;
		for(int t=1;t<=n;t++)
		{
			min=inf;
			fzero=0;
			for(int ii=1;ii<=n;ii++)
			{
				if(flag&&!fzero&&node[ii].w!=inf&&min==node[ii].w)
				{
					if(node[ii].v-node[ii].w<1e-8)
					{
						fzero=1;
						zi=ii;
					}
				}
				if(min>node[ii].w)
				{
					flag=1;
					fzero=0;
					min=node[ii].w;
					mini=ii;
					if(node[ii].v-node[ii].w<1e-8)
						flag=0,fzero=1;
				}
				//if(ii==n)	ii=1;
			}
			//if(mini==n)	ii=1;
			//else ii=mini+1;
			if(fzero)
			{
				//cout<<"0000\n";
				sum=sum+(min-1)*(n-t+1);
				for(int i=1;i<=n;i++)
					if(node[i].w!=inf)
						node[i].w-=(min-1),node[i].v-=(min-1);
				for(int i=1;i<=zi;i++)
					if(node[i].w!=inf)
						sum=sum+1,node[i].w--,node[i].v--;
				ans[zi]=sum;
				node[zi].w=inf;
				for(int i=zi+1;i<=n;i++)
				{
					if(node[i].w==inf)	continue;
					sum++;
					node[i].w--,node[i].v--;
					if(node[i].v-node[i].w<1e-8)
					{
						node[i].w=inf;
						ans[i]=sum;
					}
				}
				continue;
			}
			sum=sum+min*(n-t+1);
			/*else if(!flag)	
			{
				ans[mini]=sum;
				node[mini].w=inf;
				continue;
			}*/
			for(int i=1;i<=n;i++)
				if(node[i].w!=inf)
					node[i].w-=min,node[i].v-=min;
			for(int i=1;i<mini;i++)
			{
				if(node[i].w!=inf)
					sum=sum+1,node[i].w--,node[i].v--;
			}
			sum=sum+(node[mini].v-node[mini].w);
			ans[mini]=sum;
			node[mini].w=inf;
			for(int i=mini+1;i<=n;i++)
			{
				if(node[i].w!=inf)
					sum=sum+1,node[i].w--,node[i].v--;
			}
		}
		printf("Case %d:\n",ca);
		for(int i=1;i<=n;i++)
		{
			printf("%.2f\n",ans[i]);
		}
	}
	return 0;
}

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

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

C++: //
// Created by tac on 2016/10/27.
//

#include <cstdlib>
#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;
        }
    }
    return EXIT_SUCCESS;
}

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

C++: #include <iostream>

using namespace std;

int main()
{
int x, y;

for (x = 1; x<= 9; x++) {
for (y = 1; y<= 9; y++) {
cout << x << "x" << y << "=" << x*y<<endl;
}
}
}

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

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

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

int main(){

	int Num;
	int SubNum;
	for(Num=1;Num!=10;Num++)
	{for(SubNum=1;SubNum!=10;SubNum++){
	cout<<Num<<"x"<<SubNum<<"="<<Num*SubNum<<endl;
	}}

return 0;
}

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

void QQ(){
  for(int i = 1; i < 10 ; i++)
    for(int j = 1 ; j < 10 ; j++)
      cout << i << 'x' << j << '=' << i*j << endl;
}

int main(){
  QQ();
  return 0;
}

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

int main()
{
	int i, j, x;

	for (i = 1; i <= 9; i++){
		for (j = 1; j <= 9; j++){
			x = i * j;
			printf("%6d", x);
		}
		printf("\n");
	}
	return ;
}

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

C++: #include<iostream>
using namespace std;
  
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;
#define REP(i, n) for (int i = 1; i < (n); i++)
int main() {
  REP(i, 9) REP(j, 9) cout << i << "x" << j << "=" << i * j << endl;
}

C++: #include <cstdio>

void solvex(int x, int y){
	if(x > 9)return ;
	printf("%dx%d=%d\n",y,x,x*y);
	solvex(x+1,y);
}

void solvey(int y){
	if(y > 9)return ;
	solvex(1, y);
	solvey(y+1);
}

int main(){
	solvey(1);
	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++: j;main(i){for(;i<=9;i++)for(j=0;j++<9;)printf("%dx%d=%d\n",i,j,i*j);j=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 << std::endl;
		}

	}

	return 0;
}