Go: // 九九を出すだけ
package main
import (
	"fmt"
	"os"
	"bufio"
)
var out = bufio.NewWriter(os.Stdout)

func main(){
	defer out.Flush()
	for i:=1; i<10; i++{
		for j:=1; j<10; j++{
			fmt.Fprintf(out, "%dx%d=%d\n", i, j, i*j)
		}
	}
}

C++:  #include <bits/stdc++.h>
#ifdef dbg
#include "./printer.hpp"
#else
#define dump(x) void(0)
#endif

using namespace std;
#define ll long long
inline long  toInt(string s) {long  v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
#define INF 100000
int main(){
  ios_base::sync_with_stdio(0);

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

  return 0;

}

C++: #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <stdio.h>

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, PII> TII;
typedef long long LL;
typedef vector<LL> VLL;

//container util

//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define MT(a,b,c) MP(a, MP(b, c))

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

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

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

int main() {
	for (int i = 0; i < 81; i++) {
		cout << i / 9 + 1 << "x" << i % 9 + 1 << "=" << ((i / 9) + 1)*((i % 9) + 1) << "\n";
	}
	return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
#define inf 0x3f3f3f3f
int m, n, l, tot;
struct node { 
	int val, lev, to;
	void input() {
		scanf( "%d%d%d", &val, &lev, &to );
	}
}a[102];
int nxt[102][102],cheap[102][102];
int find( int i ) {
	if( a[i].to == 0 )
		return a[i].val;
	int mmin = a[i].val;
	for( int j = 1; j <= a[i].to; ++j ) {
		if( a[nxt[i][j]].lev >= m ) {
			mmin = min( mmin, cheap[i][j] + find( nxt[i][j] ) );
		}
	}
	return mmin;
}
int main() {
	while( scanf("%d%d", &m, &n ) != EOF ) {
		a[1].input();
		for( int i = 1; i<= a[1].to; ++i )
			scanf( "%d%d", &nxt[1][i], &cheap[1][i] );
		m = a[1].lev - m;
		for( int i = 2; i <= n; ++i ) {
			a[i].input();
			for( int j = 1; j <= a[i].to; ++j ) {
				scanf( "%d%d", &nxt[i][j], &cheap[i][j] );
			}
		}
		int ans = find( 1 );
		printf( "%d\n", ans );
	}
	return 0;
}

C++: class Main{
    public static void main(String[] a){
    
    int[] x = new int[];
    int x[] = {1,2,3,4,5,6,7,8,9,};
    int[] y = new int[];
    int y[] = {1,2,3,4,5,6,7,8,9,};
??????
??????for (i=0;i<10;i++){
     for (j=0;j<10;j++){
       system.out.println{x[i]+"x"+y[j]+"="+x[i]*y[j]};
     }
    }
   }

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<bits/stdc++.h>
using namespace std;


int main(){
	for(int i=1;i<=9;i++){
		cout<<i<<'+'<<i<<'='<<i*i<<endl;
	}
	return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
  for(int i=1;i<=9;i++)
   for(int j=1;j<=i;j++){
      cout<<i<<'X'<<j<<'='<<i*j<<" ";
      if(i==j) 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;
  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 <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
	while(1){}
	return 0;
}

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

C++: #include<iostream>
using namespace std;
int main()
{
    int i,j;
    for(i=1;i<=9;i++)
     for(j=1;j<=9;j++)
          cout<<i<<"x"<<j<<"="<<i*j<<endl;
    return 0;
}