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

C++: #include <bits/stdc++.h>
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>

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

C++: ///
// File:  0000.cpp
// Author: ymiyamoto
//
// Created on Sat Nov  4 15:30:20 2017
//

#include <cstdint>
#include <iostream>

using namespace std;

int32_t main()
{
  for (uint32_t i = 1; i <= 9; i++) {
    for (uint32_t j = 1; j <= 9; j++) {
      cout << i << "x" << j << "=" << i * j << endl;
    }
  }

  return 0;
}

C++: #include "stdio.h"
#include "conio.h"
void main()
{
    int i, j;
   
    for(i = 1; i <= 9; i++)
    {
        for(j = 1; j <= 9; j++)
        {
            printf("\n%d x %d = %d", i, j, i*j);
        }
        printf("\n========================");
    }
    getch();
}

C++: #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
using namespace std;



int main()
{
	//freopen("in.txt","r",stdin);
	//freopen("out.txt","w",stdout);
	
	int i,j;
	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 <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<cstdio>
main(){
FILE *fp = fopen("test","r");
int tmp=0;
 if (fp != NULL)fscanf(fp,"%d",&tmp);
 //printf("%d",tmp);
 if (tmp == 1124)return 1;
 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(void){

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

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

C++: #include<stdio.h>

int main(){
        int i, j;
        for(i=1; i<10; i++) {
                for(j=1; j<10; j++) {
//                      if(i<=j) {

                                printf("%dx%d=%d\n", i, j, i*j);
//                      }
                }
        }
        return 0;
}

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

C++: class Main{
    public static void main(String[] a){
      for (i=1,i<10,i++){
       for (j=1,j<10,j++){
       System.out.println(i + "×" + j + "=" i*j)
       }
      }
    }
}

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<=9; ++i)
    for(int j=1; j<=9; ++j)
      cout << i << "x" << j << "=" << i*j << endl;

  return 0;
}