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 <iostream>
#include <set>
using namespace std;
multiset<int,greater<int> >::iterator i;
bool isGraphic(multiset<int,greater<int> > s)
{
	if (s.empty()) return true;
	multiset<int,greater<int> > r;
	int tmp=*(s.begin());
	s.erase(s.begin());		
	if (s.size()<tmp) return false;
	i=s.begin();
	while(i!=s.end())
	{
		if(tmp>0&&*i>1) r.insert((*i)-1);
		else if (tmp<=0) r.insert(*i);
		i++;
		tmp--;
	}
	return isGraphic(r);
}

int main()
{
	int n;
	cin>>n;
	multiset<int,greater<int> > s;
	int x;
	while(n--)
	{
		cin>>x;
		s.insert(x);
	}
	cout<<isGraphic(s)<<endl;
}

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

C++: #include <iostream>
using namespace std;
int top[3];
int main(){

	int h[10];
	for (int i = 0; i<=9;i++)
		cin >> h[i];
		
	for(int i = 0;i<=9;i++){
		if(top[0] <= h[i]){
			top[2] = top[1];
			top[1] = top[0];
			top[0] = h[i];
		
		}
		else if(top[1] <= h[i]){
			top[2] = top[1];
			top[1] = h[i];
		}
		else if(top[2]<= h[i]){
			top[2] = h[i];
		}
	
	}
	for(int j = 0;j<=2;j++)
		cout << top[j] << endl;
	
	return 0;
}

C++: #include<stdio.h>
#include<iostream>
using namespace std;
int main(){
	for (int i = 0; i < 10;i++){
		for (int j = 0; 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 << "x" << j << "＝" << i * j << endl;
		}
	} 
}

C++: #include<iostream>
using namespace std;
class QQ{
	public:
	QQ();
};
QQ::QQ(){
	for(int i=11;i<100;i++)
	if(i%10)cout<<i/10<<'x'<<i%10<<'='<<(i/10)*(i%10)<<endl;
}
int main(){
	QQ qq;
	return 0;
}

C++: #include <iostream>

int main()
{
    for(int i = 1; i<10; i++) {
        for(int j = 1; j < 10;j++) {
            std::cout << i << "*" << j << "=" << i*j << std::endl;
        }
    }
    return 0;
}

C++: test

C++: #include<iostream>
using namespace std;
int i;
int I;
int main(){
     for(i=1;i<10;i++){
        for(I=1;I<10;I++){
          cout<<i<<'x'<<I<<'='<<i*I<<'\n';
         }
      }
    return 0;
}

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

// Macro and Macro Functions
#define rep(a, b) for(int a = 0; a < b; ++a)
#define REP(a, b, c) for(int a = b; a < c; ++a)
#define drep(a, b, c) for(int a=0,b=0;b<c?:(b=0,++a<c);++b)
#define int long long
#define between(n,_min,_max) if(_min<=n&&n<=_max)
#define SORT(a) sort(ALL(a))
#define RSORT(a) sort(RALL(a))
#define REVERSE(a) reverse(ALL(a))
#define MOD 1000000007
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define ALLIN(a) rep(nanika,a.size()) cin>>a[nanika]
#define ALLINDE(a) rep(kyawa,a.size()){cin>>a[kyawa]; --a[kyawa];}
#define YN(a) do{if(a) cout<<"YES"; else cout<<"NO";}while(0)
#define Yn(a) do{if(a) cout<<"Yes"; else cout<<"No";}while(0)
#define yn(a) do{if(a) cout<<"yes"; else cout<<"no";}while(0)
#define spa " "
#define dspa "  "
#define ctoi(c) (c)-'0'
#define altoi(a) (a)-'a'
#define fi first
#define se second
#define dvec(type,name,row,column,value) vector<vector<type>> name(row,vector<type>(column,value))
 
// List of using
using ll   = signed long long;
using ull  = unsigned long long;
using pint = pair<int,  int>;
using pong = pair<long, long>;
using tint = tuple<int,  int,  int>;
using tong = tuple<long, long, long>;
using vint = vector<int>;
using vll  = vector<long long>;
using vbol = vector<bool>;
using vstr = vector<string>;
using vull = vector<unsigned long long>;
using dvin = vector<vector<int>>;
using dvbo = vector<vector<bool>>;
using mint = map<int,int>;
 
// Common Variable
bool DEBUG=false;
long long INF=2000000000;

void print(){
  cout<<'\n';
}

template<class HEAD,class... TAIL>
void print(HEAD&& head,TAIL&&... tail){
  cout<<head<<spa;
  print(forward<TAIL>(tail)...);
}

void scan(){}

template<class HEAD,class... TAIL>
void scan(HEAD&& head,TAIL&&... tail){
  cin>>head;
  scan(forward<TAIL>(tail)...);
}

template<typename t>
void print(vector<t> &v){
  rep(i,v.size()){
    cout<<v[i]<<spa;
  }
  cout<<endl;
}

template<typename t, typename u>
void print(vector<pair<t,u>> &v){
  rep(i,v.size()){
    cout<<i<<" : "<<v[i].first<<" "<<v[i].second<<endl;
  }
}

int RepeatSquaring(int N, int P, int M){
  if(P==0) return 1;
  if(P%2==0){
    int t = RepeatSquaring(N, P/2, M);
    return t*t % M;
  }
  return N * RepeatSquaring(N, P-1, M);
}
//--------------------------------
// Template Place
struct edge{int to; ull cost;};
 
class uc_graph{
  public :
    int size;
    vector<vector<edge>> graph;
    vector<ull> dis;
    vector<int> prev;
    vector<bool> used;
    int min_prim;
    
    void set(int n){
      size=n;
      graph.resize(size);
      dis.resize(size);
      prev.resize(size);
      used.resize(size);
    }
    void dijkstra(int s){
      priority_queue<pair<ull,int>,vector<pair<ull,int>>,greater<pair<ull,int>>> que;
      fill(dis.begin(),dis.end(),INF);
      fill(prev.begin(),prev.end(),-1);
      dis[s]=0;
      que.push(pair<ull,int>(0,s));
      
      while(!que.empty()){
        pair<ull,int> p=que.top();
        que.pop();
        int v=p.second;
        if(dis[v]<p.first) continue;
        rep(i,graph[v].size()){
          edge e=graph[v][i];
          if(dis[e.to]>dis[v]+e.cost){
            dis[e.to]=dis[v]+e.cost;
            que.push(pair<ull,int>(dis[e.to],e.to));
            prev[e.to]=v;
          }
        }
      }
    }
    void prim(void){
      priority_queue<pint,vector<pint>,greater<pint>> que;
      fill(ALL(used),false);
      que.push(pint(0,0));
      min_prim=0;
      while(!que.empty()){
        int c=que.top().first,v=que.top().second;
        que.pop();
        if(used[v]) continue;
        used[v]=true;
        min_prim+=c;
        rep(i,graph[v].size()){
          que.push(pint(graph[v][i].cost,graph[v][i].to));
        }
      }
    }
    vint get_path(int t){
      vint path;
      for(;t!=-1;t=prev[t])
        path.push_back(t);
      reverse(path.begin(),path.end());
      return path;
    }
};
//--------------------------------
// int dx[]={ 1, 0,-1, 0};
// int dy[]={ 0,-1, 0, 1};

signed main(){
  REP(i,1,10){
    REP(j,1,10){
      cout<<i<<"x"<<j<<"="<<i*j<<endl;
    }
  }
  return 0;
}