Go: package main

import "fmt"
import "strconv"

func main() {
  for i := 1; i <= 9; i++ {
    for j := 1; j <= 9; j++ {
      res := i * j
      fmt.Println(strconv.Itoa(i) + "x" + strconv.Itoa(j) + "=" + strconv.Itoa(res))
    }
  }
}

C++: #include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<set>
#include<functional>
#include<queue>
#include<math.h>
#define INF 999999

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

C++: #include <iostream>

using namespace std;
/*
 * memo!!
 * "while" is less memory than "for".
 */
int main()
{
    int i = 1;
    while(i<=9)
    {
        int j = 1;
        while(j<=9)
        {
            cout << i << "x" << j  << "=" << i*j << endl;
            j++;
        }
        i++;
    }
    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<=9;i++){
		for(int j=1;j<=9;j++)std::cout<<i<<"x"<<j<<"="<<i*j<<std::endl;
	}
    return 0;
}

C++: #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<functional>
#include<queue>
#include<utility>
#include<cstdlib>
#include<ctime>
#include<utility>
using namespace std;
#define INF (1<<29)
#include <nmmintrin.h> 



int main(){
    cout<<_mm_popcnt_u32(5315648)<<endl;
    cout<<_mm_popcnt_u64(1864886968)<<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<=9;i++)
	{
		for(int j=1;j<=9;j++)
		{
			cout<<i<<"×"<<j<<"＝"<<i*j<<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;                                
    }                                                                                       
  }                                                                                         
  return 0;                                                                                 
}

C++: #include <stdio.h>

int main(){
  int answer;
  for(int i=1; i<=9; i++){
    for(int a=1; a<=9; a++){
      answer = i*a;
      printf("%dx%d=%d\n", i,a,answer);
    }
  }	
  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(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 <stdio.h>

#define rep(i,n) for(int i = 0; i < n; i++)

int main()
{
	rep(i, 9) rep(ii, 9)
	{
		printf("%d*%d=%d\n", i + 1, ii + 1, (i + 1) * (ii + 1));
	}
	return 0;
}

C++: #include <stdio.h>

int main(void)
{

	int i,j;

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

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