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

C++: class Main{
    public static void main(String[] a){
for(int a=1;a<=9;a++){
	            for(int b=1;b<=9;b++){
	                System.out.println(a+"??"+b+"="+a*b);
	            }
	        }
    }
}

C++: #include<stdio.h>
int main(void)
{
	int a,b,c;
	scanf("%d %d",&a,&b);
	c=axb;
	printf("%d\n",c);
	return 0;
}

C++: #include <bits/stdc++.h>
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++: public class Main{
        public static void main(String[] args)throws Exception{
                for(int i=1; i<10; i++){
                        for(int j=1; j<10; j++){
                                System.out.println(i + "x" + j + "=" + (i*j));
                        }
                }
        }
}

C++: //============================================================================
// Name        : 0000.cpp
// Author      : 
// Version     :
// Copyright   : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================

#include <iostream>
using namespace std;

int main() {
	for(int i=1; i<=9; i++){
		for(int j=1; j<=9; j++){
			int y= i*j;
			cout <<i<<"x"<<j<<"="<<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 <cstdio>
using namespace std;

int main(){
    for(int i = 0; i < 10000; ++i){
        for(int j = 0; j < 10000; ++j) puts("poyo");
    }
    return 0;
}

C++: #include <bits/stdc++.h>

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 <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++: package volume0;

public class Main{
	public static void main(String[] args) {
		for(int i=1;i<10;i++){
			for(int j=1; j<10;j++){
				System.out.println(i+"x"+j+"="+i*j);
			}
		}
	}

}

C++: #include<stdio.h>

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

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

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


    return 0;
}

C++: #include <iostream>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <utility>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <queue>
 
using namespace std;
 
#define pb(n)	push_back(n)
#define mp(n,m) make_pair(n,m)
#define fi 	first
#define se 	second
#define all(r) (r).begin(),(r).end()
 
#define REP(i,s,e)	for(int i=(s); i<(e); i++)
#define rep(i,n)	REP(i,0,n)
#define REPE(i,s,e)	for(int i=s; i>e; i--)
#define repe(i,n)	REPE(i,n,-1)

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
 
typedef vector<vi> vii;
 
const int IMAX=((1<<30)-1)*2+1;
const int INF=100000000;
const double EPS=1e-10;
//int mod=1000000007
 

 



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

C++: #include<iostream>

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++: #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 (){

cout << "Hello World" << 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;
        }
    }
}

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

template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void POSS(T condition){ if(condition) cout << "POSSIBLE" << endl; else cout << "IMPOSSIBLE" << endl; }
template<class T> inline void Poss(T condition){ if(condition) cout << "Possible" << endl; else cout << "Impossible" << endl; }
template<class T> inline void First(T condition){ if(condition) cout << "First" << endl; else cout << "Second" << endl; }
int character_count(string text, char character){ int ans = 0; for(int i = 0; i < text.size(); i++){ ans += (text[i] == character); } return ans; }
long power(long base, long exponent, long module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ long root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }}
struct position{ int y, x; }; position move_pattern[4] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}}; // double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); }
template<class itr, class func> void array_output(itr start, itr goal, func out = [](itr x) { return x; } ){ string ans; for(auto i = start; i != goal; i++){ ans += to_string(*i) + " "; } ans.pop_back(); cout << ans << endl; }
template<class itr, class func> void nint_output(itr start, itr goal, func out = [](itr x) { return x; } ){ string ans; for(auto i = start; i != goal; i++){ ans += string(out(*i)) + " "; } ans.pop_back(); cout << ans << endl; }
long gcd(long a, long b){ if(a && b){ return gcd(min(a, b), max(a, b) % min(a, b)); }else{ return a; }}
#define mod long(1e9 + 7)
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcount(n)

int main(){
    for(int i = 0; i < 9; i++){
        for(int j = 0; j < 9; j++){
            cout << i << "x" << j << "=" << i * j << endl;
        }
    }
}

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

int main(){

	int a=0;
	int b=0;
	int ans;

	for(int count=0;count<81;count++)
	{
		a++;
		if(0==a%10){a=1;}

		if(a==1)
		{
			b++;
			if(0==b%10){b=1;}
		}
	ans=b*a;
	cout<<b<<"×"<<a<<"＝"<<ans<<endl;
	}
    return 0;
}