Go: package main

import "fmt"


func main() {
	for i := 1; i <= 9; i++ {
		for i2 := 1; i2 <= 9; i2++ {
			fmt.Printf("%dx%d=%d\n", i, i2, i*i2)
		}
	}
}

C++: #include<stdio.h>
int main(void){

  int i;
  for(i=1;i<10;i++){
    printf("%d??1=%d\n",i,i*1);
    printf("%d??2=%d\n",i,i*2);
    printf("%d??3=%d\n",i,i*3);
    printf("%d??4=%d\n",i,i*4);
    printf("%d??5=%d\n",i,i*5);
    printf("%d??6=%d\n",i,i*6);
    printf("%d??7=%d\n",i,i*7);
    printf("%d??8=%d\n",i,i*8);
    printf("%d??9=%d\n",i,i*9);

  }


  return 0;
}

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

C++: #include <iostream>

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

    return 0;
}

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

int main() {
vector< int > test = {0,1,2,3};
for(int x : test) { cout << x << endl; }
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 <stdio.h>

int main(void) {
	int m,n;
	for(m = 1; m <= 9; m++){
		for(n = 1; n <= 9; n++){
			printf("%dx%d=", m,n);
			printf("%d\n", m*n);
		}
	}
	return 0;
}

C++: #include <iostream>

int main(int argc, char **argv){
	for(int i = 1; i < 10; i++){
		for(int j = 1;j < 10; j++){
			std::cout << i << "x" << j << "=" << i * j;
			if(!(i == 9 && j == 9)){
				std::cout << std::endl;
			}
		}
	}
}

C++: #include <stdio.h>
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++: /*
 *  Author: mizo0203
 *  Problem: 0001
 *  Status: Time Limit Exceeded
 *  Submission Date: 2012/04/14 23:23:19
 */
#include <stdio.h>

int n; // (0 < n <= 20)
int hx, hy, dx, dy;
int cx[20], cy[20]; // (-1000 <= h, d, c <= 1000)

void init() {
  // 事前処理なし
}

bool input() {
  // 入力なし
  return false;
}

int main() {
  int i, j;

  init();
  while (input()) {
  }

  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(){

int i, j;

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

for (j = 1; i < 9; i++){

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

}

}

return 0;

}

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

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

int main() {

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

   return 0;
}

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

int main(void){
    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>
using namespace std;

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

C++: #include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <set>
#include <sstream>
#include <numeric>
#include <bitset>
#include <complex>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cctype>
#include <cassert>
using namespace std;
 
typedef long long ll;
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
bool ISINT(double x){return fabs(x-(int)round(x))<EPS;}
bool ISEQ(double x,double y){return fabs(x-y)<EPS;}
string itos(ll x){stringstream ss;ss<<x;return ss.str();}
#define foreach(itr,c) for(__typeof(c.begin()) itr=c.begin();itr!=c.end();itr++)
 
int main(void){
  for(int i = 1; i < 10; i++){
    for(int j = 1; j < 10; j++){
      cout << i << "x" << j << "=" << i * j << endl;
    }
  }
}

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<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>
int main(){
using namespace std;
	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;
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() {
  int a = 1;
  int b = 1;
  for ( a == 9 && b == 10) {
    cout << a << "x" << b << "=" << a*b << endl;
    ++b;
    if ( b = 10) {
      ++a;
      int b = 1;
    }

  }

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

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, 10) {
    rep(j, 10) {
      cout << i << "x" << j  << "=" << (i * j) << endl;
    }
  }
}

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

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

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 * i, j, i * j );
		}
	}
	return 0;
}