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 <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++: !

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(){
    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++){
			cout<<i<<"x"<<j<<"="<<i*j<<endl;
		}
	}
	return 0;
}

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

int main() {
    for(int r = 1; r <= 9; r++) {
        for(int c = 1; c <= 9; c++) {
            cout << r << "×" << c << "=" << r * c << endl;
        }
    }
    
    return(0);
}

C++: #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<cstdlib>
using namespace std;
#ifdef __int64
typedef __int64 LL;
//#else
//typedef long long LL;
#endif
//typedef double db;
//const int N = 200015;
//const int INF = ~0u>>2;
//char s[N],str[2*N];
//int len[2*N];
//inline int manager(){
//    int i;
//    str[0] = '$';
//    for(i = 0;; i ++){
//        str[2*i+1] = '#',str[2*i+2] = s[i];
//        if(!s[i]) break;
//    }
//    int id,mx = 0;
//    for(i = 1;str[i]; i ++){
//        if(mx>i) len[i] = min(len[2*id-i],mx-i);
//        else len[i] = 1;
//        while(str[i-len[i]]==str[i+len[i]]) len[i] ++;
//        if(i+len[i] > mx){
//            mx = i + len[i];
//            id = i;
//        }
//    }
//    mx = 0;
//    for(int i = 1;str[i];i++) if(mx < len[i]) mx = len[i];
//    return mx - 1;
//}
int main()
{
    //freopen("input.in","r",stdin);
    //freopen("output.out","w",stdout);
//    while(~scanf("%s",s))
//    {
//        printf("%d\n",manager());
//    }

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

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

int main() {
    
    // 1. input.
    
    // 2. output answer.
    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 a=1;a <= 9;a++) cout <<a<<"x"<<a<<=<<(a*a)<<endl;

    return 0;
}

C++: #include<stdio.h>

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

    return 0;
}

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

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

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> veci;
typedef vector<ll> vecll;
typedef vector<string> vecs;
template<class T,class U> using Hash=unordered_map<T,U>;

#define REP(i, a, n) for(ll i = a; i < (ll)n; i++)
#define RREP(i, a, n) for(ll i = n-1; i >= (ll)a; i--)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) RREP(i, 0, n)
#define MD 1000000007

template<class T> T read(){T a;cin >> a;return a;}
template<class T> void read(T& a){cin >> a;}
template<class T, class ...Args> void read(T& a, Args&... args){cin >> a; read(args...);} 
template<class T> void rarr(T a, int n){for(int i = 0; i < n; i++) {cin >> a[i];}}
template<char c = ' ',class T> void write(T a){cout << setprecision(12) << a << endl;}
template<char c = ' ',class T,class ...Args> void write(T a, Args... args){cout << setprecision(12) << a << c; write<c>(args...);}
template<class T> void warr(vector<T> a, const char* c = " "){cout << a[0];for(int i = 1; i < (int)a.size(); i++)cout << c << a[i];cout << endl;;}
template<class T> void warr(T a, int n, const char* c = " "){cout << a[0];for(int i = 1; i < n; i++)cout << c << a[i];cout << endl;}
void split(string s, string delim, veci& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(atoi(s.substr(pos).data()));break;}else {result.push_back(atoi(s.substr(pos, p - pos).data()));}pos = p + delim.size();}}
void split(string s, string delim, vecs& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(s.substr(pos));break;}else {result.push_back(s.substr(pos, p - pos));}pos = p + delim.size();}}
ll gcd(ll a, ll b){while(true){ll k = a % b;if(k == 0)return b;a = b;b = k;}}
ll comb(ll n, ll m){ll p=1;m=min(m,n-m);for(ll i=1;i<=m;i++){p*=n-i+1;p/=i;}return p;}

int main(void)
{
    REP(i,1,10)REP(j,1,10){
        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<<"*"<<j<<"="<<i*j<<"\n";
    return 0;
}

C++: #include<iostream>
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(int argc, char **argv) {
    for (int i = 1; i <= 9; i++) {
        for (int j = 1; j <= 9;j ++) {
            cout << i << 'x' << j << '=' << i * j << endl;
        }
    }

    return 0;
}

C++: main(){for(int i=0,j,k;j=i/9+1,k=i%9+1,81-i;i++)printf("%dx%d=%d\n",j,k,j*k);}

C++: #include <stdio.h>
int main()
{
    int i, j;
    return 0;
}

C++: #include<stdio.h>

int main()
{

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

    //printf("\n");

    }
return 0;

}