Go: // 九九を出すだけ
package main
import (
	"fmt"
	"os"
	"bufio"
)
var out = bufio.NewWriter(os.Stdout)

func main(){
	defer out.Flush()
	for i:=1; i<10; i++{
		for j:=1; j<10; j++{
			fmt.Fprintf(out, "%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) {
      cout << i << "x" << j << "=" << i*j << endl;
    }
  }
  return 0;
}

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

int main(){
	for( int x=1; x<=9; x++ ){
		for( int y=1; y<=9; y++ ){
			cout << x << "x" << y << "=" << x*y << 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, j, i * j );
		}
	}
	return 0;
}

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

int main(){

    for(int y=0; y<=9; y++)
        for(int x=0; x<=9; x++)
            cout << y << 'x' << x << '=' << y*x << 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, j, i * j );
		}
	}
	return 0;
}

C++: #include<bits/stdc++.h>
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 <ios>
int s,e;int main(){for(;e%=9,(s+=!e++)-10;)printf("%dx%d=%d\n",s,e,s*e);}

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

C++: #include<iostream>
#define REP(i) for((i)=1;(i)<10;(i)++)
using namespace std;

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

C++: #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
const int    INF = 100000000;
const double EPS = 1e-10;
const int    MOD = 1000000007;
using namespace std;
typedef pair<int,int> P;

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

    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<<"*"<<j<<"="<<i*j<<endl;
		}
	}
	return 0;
}

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

int main(){
int a = 1,b = 1,c;
while(a != 9 and b != 9){
c=a*b;
cout<<a<<"x"<<b<<"="<<c<<endl;
b++;
if(b == 10){
a++;
b = 1;
}

}
}

C++: #include <iostream>
#include <sstream>
#include <vector>
#include <algorithm>
#include <string>
#include <functional>
#include <numeric>
#include <ctype.h>
#include <cstdlib>
#include <string.h>
#include <cmath>
#include <cstdio>





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++: //
//  main.cpp
//  aojTest1
//
//  Created by yusuke okui on 2013/03/22.
//  Copyright (c) 2013年 yusuke okui. All rights reserved.
//

#include <iostream>

int main(void)
{
	for(int i=1; i<10; i++){
		for(int j=1; j<10; j++){
			std::cout << i << '*' << j << '=' << i*j << std::endl;
		}
	}
	
	return 0;
	
}

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

int main(){

    for(int y=1; y<=9; y++)
        for(int x=1; x<=9; x++)
            cout << y << 'x' << x << '=' << y*x << endl;

    return 0;
}

C++: #include<iosteream>
int main(){
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 < 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()
{
    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(void){
    int x,y,z;
    z=0;
    x=0;
    while(1){
        x=x+1;
        while(1){
            z=z+1;
            y=x*z;
        cout<<x<<"*"<<z<<"="<<y<<endl;
        if(z>=9){
            break;
        }
        }
        if(x>=9){
            break;
        }
    }
    
}

C++: 
class Main{
    public static void main(String[] a){
    	int b=1;
    	int c=1;
    	do{
    		if(c<10){
    		System.out.println(b+"x"+c+"="+b*c);
    			c++;
    		}
    		else if(c>9){
    			b++;
    			c=1;
    		}
    	}while(b<10);

    }
}