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 * i, j, i * j );
		}
	}
	return 0;
}

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

int main(void)
{
    for (int x = 1; x <= 9; x++)
    {
        for (int y = 1; y <= 9; y++)
        {
            cout << x << "x" << y << "=" << x*y << 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;
}

C++: #include <stdio.h>
#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;

void QQ(){
  for(int i = 0 ; i < 9 ; i++){
    for(int j = 0 ; j < 9 ; j++){
      cout << i+1 << 'x' << j+1 << '=' << (i+1)*(j+1) << endl;
    }
  }
}

int main(){
  QQ();
  return 0;
}

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

int main(){
int a;
int b;
a=1;
while(a<10){
b=1;
while(b<10){
cout << a <<"x"<< b << "="<<a*b<<endl;
b=b+1;}
a=a+1;}

    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;
		}
	}
	system("pause");
	return 0;
}

C++: #include <stdio.h>

int main(void)
{
	int array[9][9];
	int i,j;
	
	for(i=0;i<9;i++){
		for(j=0;j<9;j++){
			array[i][j]=(i+1)*(j+1);
			printf("%dx%d=%d\n",i+1,j+1,array[i][j]);
		}
	}
	
	return 0;
}

C++: #include<iostream>
#include<stdio.h>
using namespace std;
int main(){
int a,b;
for(a=0;a<10;a++){
for(b=0;b<10;b++){
cout<<a<<"x"<<b<<"="<<a*b<<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<<"\n";
        }
    }
    return 0;
}

C++: #include <stdio.h>

int main(void)
{
    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<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<algorithm>
#include<vector> 
#include<limits>
#include<numeric>
#include<math.h>
using namespace std;

#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define in(x) cin >> x
#define out(str) cout << str << endl

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }



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

C++: #include <iostream>
#include <stdio.h>
using namespace std;
int main()
{
    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<iostream>
using namespace std;

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

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<<std::endl;}}}

C++: #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long long ll;
// Welcome to my source code!

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

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

C++: null