Go: package main

import "fmt"
import "strconv"

func main() {
  for i := 1; i <= 9; i++ {
    for j := 1; j <= 9; j++ {
      res := i * j
      fmt.Println(
        strconv.Itoa(i) + "x" + strconv.Itoa(j) + "=" + strconv.Itoa(res)
      )
    }
  }
}

C++: 



#include<stdio.h>

int main(){
    int a,b;
 for(a = 1; a < 10; a++)
   {
   for(b = 1;b < 10;b++)
     {
      printf("%d", a);
    printf("x");
  printf("%d\n", b);
     };
   };
    return 0;
}

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

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

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

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++: for i in 1..9
	for j in 1..9
		print(i,"x",j,"=",i * j,"\n");
	end
end

C++: a

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<stdio.h>
 
int main(){
       for(int i=0;i<10;i++){
       for (int j=0;j<10;j++){
          printf("%dx%d=%d",i,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("%d x %d = %d", i, j, i * j);
}
}

return (0);
}

C++: #include <stdio.h>

int main() {
    for(int i = 1; i < 10; ++i){
        printf("%dx%d=%d\n",i,i,i*i);
    }
}

C++: /*#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<vector>
#include<math.h>
#include<queue>
#include <algorithm>
#include<functional>
#include<cstdlib>
#include<cmath>

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define CI cin >>
#define CO cout <<
#define E << endl;

using namespace std;

typedef pair<int, int> P;
typedef pair<long, long> LP;
typedef pair<int, P> PP;
typedef pair<long, LP> LPP;



int dy[] = { 0, 0, 1, -1, 0 };
int dx[] = { 1, -1, 0, 0, 0 };

int A = 0, B = 0, K = 0, T = 0, W = 0, N = 0, H = 0;
int n = 0;
double L = 0;
double S = 0;
double ar = 0, br = 0, cr = 0;
int answer = 0;

string C;
string sA, strB;
vector<vector<char>> map;
vector<double> num;
vector<string> str;

int sum = 0;

vector<int> value;
vector<int> weight;

int dp[110][10010];

void input() {
	CI N >> W;

	int temp;

	for (int i = 0; i < N;i++) {
		CI temp;
		value.push_back(temp);
		CI temp;
		weight.push_back(temp);
	}


	return;
}


int main(void) {
	input();

	for (int i = 0; i < N;i++) {
		for (int j = 0; j <= W;j++) {
			dp[i + 1][j] = max(dp[i + 1][j], value[i] + dp[i][j - weight[i]]);
		}
	}

	CO dp[N][W] E


	return 0;
}
*/

#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<vector>
#include<math.h>
#include<queue>
#include <algorithm>
#include<functional>
#include<cstdlib>
#include<cmath>

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define CI cin >>
#define CO cout <<
#define E << endl;

using namespace std;

typedef pair<int, int> P;
typedef pair<long, long> LP;
typedef pair<int, P> PP;
typedef pair<long, LP> LPP;



int dy[] = { 0, 0, 1, -1, 0 };
int dx[] = { 1, -1, 0, 0, 0 };

int A = 0, B = 0, K = 0, T = 0, W = 0, N = 0, H = 0;
int n = 0;
double L = 0;
double S = 0;
double ar = 0, br = 0, cr = 0;
int answer = 0;

string C;
string sA, strB;
vector<vector<char>> map;
vector<double> num;
vector<string> str;

int sum = 0;


double tempd = 0.0;



void input() {
	

	return;
}


int main(void) {
	for (int i = 1; i <= 9; i++) {
		for (int j = 1; j <= 9; j++) {
			CO i << "x" << j <<  "=" << i * j E 
		}
	}

	return 0;
}

C++: //AOJ 0000
//include
#include<cstdio>
#include<cctype>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<stack>
#include<queue>
#include<deque>
#include<vector>
#include<list>
#include<bitset>
#include<set>
#include<iostream>
 
//using namespace
using namespace std;
 
//define
 
//variable
short a, b;
 
//function
int main(){
  for(a = 1; a <= 9; a++)
    for(b = 1; b <= 9; b++)
      printf("%dx%d=%d\n", a, b, a * b);
  return 0;
}

C++: #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cctype>
#include <climits>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <list>
#include <queue>
#include <deque>
#include <algorithm>
#include <numeric>
#include <utility>
#include <complex>
#include <memory>
#include <functional>
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(){
int i;
int x;
int y;
for(i=1;i<=9;i++){
for(x=1;x<=9;x++){
y=i*x;
cout<<i<<"x"<<x<<"="<<y<<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++)
            printf("%dx%d=%d\n",i,j,i*j);
    return 0;
}

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<math.h>
#define L(_i,_N) for(int _i=1;_i<=_N;_i++)
typedef long long int lli;
using namespace std;

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

C++: #include<iostream>

int main(){
		int i,j;

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





	
	return 0;
}

C++: #include <stdio.h>

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

int main()
{
	rep(i, 9) rep(ii, 9)
	{
		printf("%dx%d=%d\n", i + 1, ii + 1, (i + 1) * (ii + 1));
	}
	return 0;
}

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

int main()
{
	for (int a = 1; a < 10; a++)
		for (int b = 1; b < 10; b++)
			cout << a << "x" << b << "=" << a*b << "\n";

	system("pause");
	return 0;

}