Go: package main

import (
	"fmt"
)

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

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++: #omc;ide <stdop.k?mr ,aイン（）｛オdpe()omro1;o1^;o++={
fpr)omt k~-0;lk<；ｋ＋＋｛@炉mtg）”％ｆｃ％ｆ＆ｆ¥。＃、、お、ｌ、おｚ：ｌ＝；｝｝tりぃtm−；｝

C++: //AOJ 0000
#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
#define MAX_A 104
#define MAX_B 104

int a,  i, dp[MAX_A][MAX_B], max, j, b;

int sort(const void *a, const void *b){
  return *(int*)a - *(int*)b;
}

int main(){
  /*while(1){
    scanf("%d %d", &a, &b);
    if(a == 0 && b == 0) break;
    memset(dp, -1, sizeof(dp));
    for(i = 0; i < a + 2; i++){
      dp[i][0] = 0;
      dp[i][1] = 1;
    }
    for(i = 0; i < b + 2; i++){
      dp[0][i] = 0;
      dp[1][i] = 1;
    }
    dp[1][1] = 1;
    for(i = 2; i <= a; i++){
      for(j = 2; j <= b; j++){
	dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
	if(i > 2 && j > 2) dp[i][j] -= 2;
	else if(i > 2 || j > 2) dp[i][j]--;
	}
    }
    printf("%d\n", dp[a][b] % 100000);
  }
  */
  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 <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 <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>
s,e;main(){while(e=e%9,s+=++e<2,s<10)std::cout<<s<<'x'<<e<<'='<<s*e<<'\n';}

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

C++: null

C++: #include<iostream>

int main()
{
	for(int i=1; i<=9; ++i)
	{
		for(int j=1; j<=9; ++j)
		{
			std::cout << i << 'x' << j << "=" << i*j << '\n';
		}
	}
}

C++: #include<iostream>
using namespace std;
 
int main(){
for(int i=1;i<=9;i++){
for(int i=j;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 << "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++){
			std::cout<<i<<"x"<<j<<"="<<i*j<<std::endl;
		}
	}
	return 0;
}

C++: #include <iostream>
using namespace std;
int main()
{
	int a;
	for(a=1;a<=9;a++)
	{
	cout<<1<<"*"<<a<<"="<<a*1<<endl;
	
	}
	for(a=1;a<=9;a++)
	{
	cout<<2<<"*"<<a<<"="<<a*2<<endl;
	
	}for(a=1;a<=9;a++)
	{
	cout<<3<<"*"<<a<<"="<<a*3<<endl;
	
	}for(a=1;a<=9;a++)
	{
	cout<<4<<"*"<<a<<"="<<a*4<<endl;
	
	}for(a=1;a<=9;a++)
	{
	cout<<5<<"*"<<a<<"="<<a*5<<endl;
	
	}for(a=1;a<=9;a++)
	{
	cout<<6<<"*"<<a<<"="<<a*6<<endl;
	
	}for(a=1;a<=9;a++)
	{
	cout<<7<<"*"<<a<<"="<<a*7<<endl;
	
	}for(a=1;a<=9;a++)
	{
	cout<<8<<"*"<<a<<"="<<a*8<<endl;
	
	}for(a=1;a<=9;a++)
	{
	cout<<9<<"*"<<a<<"="<<a*9<<endl;
	
	}

return 0;
}

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

int main() {
  for (size_t i = 1; i < 10; i++) {
    for (size_t j = 1; j < 10; j++) {
      std::cout << i << "x" << j << '=' << i * j << '\n';
    }
  }

  return 0;
}

C++: main = putStr $ unlines [(show x) ++ "x" ++ (show y) ++ "=" ++ (show     (x*y)) | x <- [1..9], y <- [1..9]]

C++: #include <iostream>

using namespace std;

int main()
{
    int a,b;
    cin >> a >> b;
    cout << a+b << endl;
    return 0;
}

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

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

C++: #include<stdio.h>

int main(){
	for(int i=1;i<=9;i++)
	{
		for(int j=1;j<=9;j++)
		{
			printf("%d x%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;
}