Go: package main

import "fmt"


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

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

C++: #include <iostream>
using namespace std;
int main(void){
    // Here your code !
    for (int i = 0;i<10;i++){
        for (int j = 0;j<10;j++){
            cout<<i<<"x"<<j<<"="<<i*j<<endl;
        }
    }
}

C++: #include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
using namespace std;
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 vector<int> vi;
typedef vector<vi>  vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EACH(t,i,c) for(t::iretator i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,n) FOR(i,0,(n)-1)
const double EPS = 1e-12;
const double PI = acos(-1.0);

int main() {
	FOR(i, 1, 9) {
		FOR(j, 1, 9) {
			cout << i << 'x' << j << '=' << i*j << endl; 
		}
	}

	return 0;
}

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

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

C++: #include <stdio.h>
#include <math.h>
#include <iostream>

int main(void){
	int i,j;

	for(i=1;i<10;i++){
		for(j=1;j<10;j++){
			std::cout << i << "*" << j << "=" << i*j << "\n";
		}
	}
	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++){
			printf("%dx%d=%d\n", i, j, i*j);
		}
	}

    return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
signed 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 <algorithm>
#include <climits>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map> //pair is also included in this library
#include <queue>
#include <stack>
#include <string>
#include <vector>

#define REP(i, s, n) for(int i = (int)(s); i < (int)(n); i++)

using namespace std;

typedef long long int ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef pair<int, int> PII;

//prefer define statement
//for reason that const int ver. of INF will raise a silly warning (unused variable)
#define INF (INT_MAX/3)
#define LIM_INF (INT_MAX)
//const int INF = INT_MAX/3;

/*------------------------------------------------------------------------------*/

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

  return 0;
}

C++: #include <iostream>
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 << endl;
		}
	}
}

C++: #include<string>
#include<vector>
#include<algorithm>
#include<iostream>
using namespace std;
int main()
{
	for (int i = 1; i < 10; i++)
	{
		for (int h = 1; h < 10; h++)
		{
			cout<<i<<"x"<<h<<"="<<i*h<<endl;
		}
}
	return false;
}

C++: # include <iostream>

using namespace std;

int main() {

  for (int i = 0; i < 9; i++) {
    for (int j = 0; j < 9; j++) {
      cout << i << 'x' << j << '=' << i * j << endl;
    }
  }

  return 0;
}

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

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);

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

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

C++: #include<bits/stdc++.h>
#define ll long long int
#define FOR(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n)
using namespace std;
 
/*--------------------template--------------------*/

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

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

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

C++: 
for i in range(1,10):
    for j in range(1,10):
	print "%d%s%d%s%d" % (i,"x",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>

using namespace std;

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