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 <bits/stdc++.h>
using namespace std ;

#define pb(n) push_back(n)
#define fi first
#define se second
#define np string::npos
#define X real()
#define Y imag()
#define value(x,y,w,h) (x >= 0 && x < w && y >= 0 && y < h)
#define all(r) (r).begin(),(r).end()
#define gsort(st,en) sort((st),(en),greater<int>())
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout<<#x<<": "<<x<<endl
#define fcout(n) cout<<fixed<<setprecision((n))
#define scout(n) cout<<setw(n)

#define rep(i,n) for(int i = 0; i < (int)(n);++i)
#define repc(i,a,b) for(int i = (a);i < (int)(b);++i)
#define repi(it,array) for(auto it = array.begin(),end = array.end(); it != end;++it)
#define repa(n,array) for(auto &n :(array))

typedef long long ll ;
typedef deque<int> di ;
typedef deque<ll> dl ;
typedef map<string,int> dict;
typedef complex<double> comd;
typedef pair<int,int> pii;

constexpr int imax = ((1<<30)-1)*2+1 ;
constexpr int inf = 100000000;
constexpr double PI = acos(-1.0) ;
double eps = 1e-10 ;
const int dy[] = {-1,0,1,0};
const int dx[] = {0,-1,0,1};

double CalcDist(comd p1, comd p2){
  return sqrt(pow(p1.X - p2.X,2.0) + pow(p1.Y -p2.Y,2.0));
}

template <typename T>
void out(deque < T > d)
{
  for(size_t i = 0; i < d.size(); i++)
  {
    debug(d[i]);
  }
}

template<typename T>
T ston(string& str, T n){
  istringstream sin(str) ;
  T num ;
  sin >> num ;
  return num ;
}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  rep(i,9){
    rep(j,9){
      cout << i+1<<"x"<<j+1 <<"="<<(i+1)*(j+1)<<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++){
    cout << i << "x" << j << "=" << i*j << endl; 
  }
}
 
 
 
    return 0;
}

C++: #include<iostream>
#include<iomanip>
using namespace std;
int main()
{
	int a,b,i=1,n;
	cout<<"九九乘法表"<<endl;
		for(a=1;a<=9;a++)
		{
			for(b=1;b<=9;b++)
			{
				n=a*b;
				cout<<setiosflags(ios::fixed)<<setw(2)<<a<<"*"<<b<<"="<<n;
				i=i+1;
				if(i%1==0) cout<<endl;
			}
		
			
		}
		 
		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<stdio.h>

int main()
{
	int i,ii,ru=0,rare=0;

	for(i=1;i<10;i++){
		rare++;
		for(ii=1;ii<10;ii++){
			ru++;
			printf("%dx%d=%d\n",rare,ru,rare*ru);
		}
		ru=0;
	}
	return 0;
}

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

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

C++: #include <stdio.h>

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

// ????????????WA???????????????????????????????????§???
auto dodo() {
  for(auto i=0; i<9; i++)
    cout << i+1 << 'x' << i+1 << '=' << (i+1)*(i+1) << endl;
}

int main() {
  dodo();
  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++: #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;
    }
  }
}

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

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

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<stdio.h>

    int main(void){
    
            int x,y,z;
    
            for(x=1;x<=9;x++){
                    
                        for(y=1;y<=9;y++){
                                        
                            z=x*y;
                            printf("%d??%d=%d" " ",x,y,z);

                                        }
                 printf("\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>

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 <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;

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

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

	return 0;
}

C++: #include <iostream>

using namespace std;

int main(void) {
	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<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;
}