Go: package main

import "fmt"

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

}

C++: #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <stdio.h>

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, PII> TII;
typedef long long LL;
typedef vector<LL> VLL;

//container util

//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define MT(a,b,c) MP(a, MP(b, c))

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

int main(void){
	REP(i, 9){
		REP(j, 9){
			printf(str, "%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++: a

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++: #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>

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

C++: #include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<cmath>
#include<queue>
#include<stack>
#include<functional>
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 <cstdio>

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

C++: #include <stdio.h>

//１０個のデータを入力し、大きい順で３つのデータを取り出すプログラム

int main(void)
{
	int i, j;		//繰り返し変数
	int h[10];		//データ格納スペース
	int n = 0;			//一時変数
	int rank[3];	//順位付けしたデータを格納

	for (i = 0; i < 10; i++){
		scanf("%d", &h[i]);
	}
	for (j = 0; j < 3; j++){
		for (i = 0; i < 10; i++){
			if (h[n] < h[i]){
				n = i;
			}
		}
		rank[j] = h[n];
		h[n] = -1;
		n = 0;
	}


	h[first] = -1;

	for (i = 0; i < 10; i++){
		if (h[second] < h[i]){
			second = i;
		}
	}

	h[second] = -1;
	for (i = 0; i < 10; i++){
		if (h[third] < h[i]){
			third = i;
		}
	}
	printf("%d\n", rank[0]);
	printf("%d\n", rank[1]);
	printf("%d\n", rank[2]);

	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("%d%s%d=%d\n",i,j,'x',i*j);
}
}
return 0;
}

C++: #include<stdio.h>
main(i){int j;for(;++i<=9;)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 <= 9; i++){
		for(int j = 1; j <= 9; j++){
			int ans = i * j;
			cout << i << "x" << j << "=" << ans << "\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 << endl;
        }
    }
    return 0;
}

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

int main() {
  int a = 1;
  int b = 1;

  for (a < 10 && b < 9) {
    cout << b << "x" << a << "=" << a*b << endl;
    ++a;
    if (a == 10 && b <= 8)
    ++b;
    int a = 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<<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++){
            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++){
      cout << i << "x" << j << "=" << i*j << endl;
    }
  }
}

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

int main(){

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

	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, 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 << '\n';
}
}
    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;
}

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

int main(){
for(int i=1;i<10;i++){
 for(int j=1;j<10;i++){
std::cout << i << 'x' << j << '=' i*j <<std::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){
			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;
}