Go: package main

import "fmt"


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

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>
#include <cstdio>
 
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>
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>
#include "stdio.h"
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 <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <string>
#include <queue>
#include <vector>
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(){
    int i,j;
    for(i=1;i<10;i++){
        for(j=1;j<10;j++){
            cout << i << "*" << j << "=" << i*j << endl;
        }
    }
    return 0;
}

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

int main(){

    for(int i = 1;i < 10;i++){
       for(int j = 0;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 << std::endl;
  }
 }
}

C++: object Test {
  def main(args: Array[String]) {
    val a = Some(0)
    val b = Some("t")
    val c = Some(100)
    for {
      i <- a
      _ <- b if (i != 10)
      k <- c
    } {
      println(i, k)
    }
  }
}

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

C++: #include<iostream>

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

#define debug(x) cout<<#x<<": "<<x<<endl
#define rep(i,n) for (int i=0;i<(n);i++)
#define FOR(i,a,b) for (int i=(a);i<=(b);i++)
#define all(a) (a).begin(),(a).end()
using namespace std;
typedef vector<int> VI;
typedef vector<vector<int>> VVI;
typedef long long ll;


void solve() {
#ifdef _WIN32
	istream &cin = ifstream("input.txt");
#endif

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




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


	solve();
#ifdef _WIN32
	system("PAUSE");
#endif
	return 0;
}

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

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

C++: #include<stdio.h>
int main(){
int x,y,z;
for(x=1;x<10;x++){
for(y=1;y<10;y++){
z=x*y;
printf("%dx%d=%d\n",x,y,z);
}
}
return 0;
}

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

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 <bits/stdc++.h>

using namespace std;

int main(void) {
  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;
#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
	while(1){}
	return 0;
}

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

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

C++: #include <iostream>

using namespace std;

int main(int argc, char const *argv[]) {
    for(int i = 1; i < 10; i ++){
      for(int j = 1; j < 10; j++){
        //printf("%dx%d=%d\n",i,j,i*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;
    }
  }
  return 0;
}

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

int main(){
	int k = strtol("1000000000000", 0, 10);
	return k < -100000000;
}