Go: package main
import "fmt"
func main(){
    for i:=1;i<10;i++{
        for j:=1;j<10;j++{
            fmt.Print(i)
            fmt.Print("x")
            fmt.Print(j)
            fmt.Print("=")
            fmt.Println(i*j)
        }
    }
}

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

int main(){
	for(int a = 1; a <= 9; ++a) {
		for(int b = 1; b <= 9; ++b) {
			cout << a << "x" << b << "=" << a*b << endl;
		}
	}
	return 0;
}

C++: #include<bits/stdc++.h>
int n;
int main()
{
    printf("1x1=1\n1x2=2\n.\n.\n9x8=72\n9x9=81\n");
    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(void) {
    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<stdio.h>
using namespace std;

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

C++: #include<stdio.h>

int main(void){
	int a,b,c;
	for(a=1;a<=9;a++){
		for(b=1;b<=9;b++){
			c=a*b;
			printf("%d x %d=%d",a,b,c);
		}
	}

    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>

int main() {

	int i,j;
	int times;
	for (i = 1; i < 10; i++) {

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

C++: #include <iostream>
#include <cstdio>
#include <iomanip>
#include <algorithm>
#include <cmath>
using namespace std;
const int M = 100000;
const double pi = 3.141592653589;

int main()
{
	for (int i = 1; i <= 9; i++) {
		for (int k = 1; k <= 9; k++) {
			printf("%dx%d\n", i, k);
		}
	}
}

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

int main(){
    int a = 1,b = 1;
    for(int i = 0; i < 9; ++i){
        for(int j = 0; j < 9; ++j){
            cout<<a<<"×"<<b<<"="<<a*b<<endl;
            b += 1;
        }
        b = 1;
        ++a;
    }
}

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

#ifdef _DEBUG
#define dump(x) cout << #x << " = " << (x) << "\n"
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << "\n"
#else
#define dump(x)
#define debug(x)
#endif


int main() {
#ifdef _DEBUG
	printf( "Debug Mode\n" );
#endif
	for ( int i = 1; i < 10; i++ ) {
		for ( int j = 1; j < 10; j++ ) {
			dump( i );
			dump( 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;
        }
    }
	return 0;
}

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

int main()
{
  int m,n;
  
  m=0;
  n=1;

  while(true){
    if(n==10){
      m=m+1;
      n=1;
    }
    if(m==10) break;
    
    cout << m << 'x' << n << "=" << m*n << endl;
    n++;

  }
  return 0;
}

C++: #include <iostream>
#include <vector>

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;
		}
	}
	int x;
	cin >> x;
	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( "%d x%d=%d\n", i, j, i * j );
		}
	}
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

int main() {
	ios :: sync_with_stdio(false);
	for(int i = 1; i <= 9; i ++)
		for(int j = 1; j <= 9; j ++)
			cout << i << "*" << j << "=" << i * j << '\n';
	return 0;
}

C++: #include<cstdio>

struct Q
{ int x,y;};



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

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