Go: package main

import (
	"fmt"
)

func main() {
	for i := 1; i <= 9; i++ {
		for j := 1; j <= 9; j++ {
			fmt.Printf("%dx%d=%d\n", i, j, i*j)
		}
	}
}

C++: //QQ
//
//??\?????????????????¨?¨???§????????????????????????????????????????????°???????????????????????????????????????¨?????????£?????????????°?????????? x ????????¨?????????????????????
//
//1x1 = 1
//1x2 = 2
//.
//.
//9x8 = 72
//9x9 = 81
//
//Input
//
//?????????????????\????????????????????????
//Output
//
//1x1 = 1
//1x2 = 2
//.
//.
//9x8 = 72
//9x9 = 81

#include <stdio.h>

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

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

C++: #include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 50004;
char s[N];
int dp[N][103];
int pre[N][26];
int main() {
    int i, j;
    scanf("%s", s+1);
    int n = strlen(s+1);
    for(i = 1; i <= n; i++) {
        for(j = 0; j < 26; j++)
            pre[i][j] = pre[i-1][j];
        pre[i][s[i]-'A'] = i;
    }
    dp[0][0] = n;
    for(i = 0; i < n; i++) {
        for(j = 0; j <= 100; j++) {
            int st = dp[i][j];
            printf("st=%d\n",st);
            while(st = pre[st][s[i+1]-'A']) {
                dp[i+1][j+1] = min(dp[i+1][j+1], st);
            }
        }
    }
    int ans = 0;
    for(i = 0; i <= 100; i++)
        ans = max(ans, dp[n][i]);
    printf("%d\n", ans);
    return 0;
}

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

}

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 <cstdio>
#include <cstring>
#include <iostream>
#include <cmath>
using namespace std;
#define forn(i,n) for(int i = 1;i <= n;i++)
#define clr(a,b) memset(a,b,sizeof(a))
#define sqr(x) ((x) * (x))
const int N = 110;
const double eps = 1e-6;

double lx[N],ly[N];
bool smk[N],tmk[N];
int lef[N];
double w[N][N];
int n;

bool match(int i){
	smk[i] = true;
	forn(j,n) if(fabs(lx[i] + ly[j] - w[i][j]) < eps && !tmk[j]){
		tmk[j] = true;
		if(!lef[j] || match(lef[j])){
			lef[j] = i;
			return true;
		}
	}
	return false;
}

void update(){
	double a = 1e40;
	forn(i,n) if(smk[i])
		forn(j,n) if(!tmk[j])
		a = min(a,lx[i] + ly[j] - w[i][j]);
	forn(i,n){
		if(smk[i]) lx[i] -= a;
		if(tmk[i]) ly[i] += a;
	}
}

void KM(){
	forn(i,n)
		lef[i] = 0;
	forn(i,n) lx[i] = ly[i] = -1e11;
	forn(i,n) forn(j,n) lx[i] = max(lx[i],w[i][j]);
	forn(i,n){
		while(1){
			clr(smk,0),clr(tmk,0);
			if(match(i)) break;
			else update();
		}
	}
}

double x[2][N],y[2][N];

int main()
{
	int cas = 0;
	while(scanf("%d",&n) != EOF){
		if(cas++) puts("");
		for(int i = 0;i < 2;i++){
			for(int j = 1;j <= n;j++){
				scanf("%lf%lf",&x[i][j],&y[i][j]);
				if(i) forn(k,n){
					w[j][k] = -sqrt(sqr(x[0][k] - x[1][j]) + sqr(y[0][k] - y[1][j]));
				}
			}
		}
		KM();
		forn(i,n) printf("%d\n",lef[i]);
	}
	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=1;
			a=i*j;
			cout<<i<<"*"<<j<<"="<<a<<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>
using namespace std;
int main(void){
    int i, j;
    for(i = 1; i <= 9; i++){
        for(j = 1; j <= 9; j++){
            cout << i << "x" << j << "="<< i * j << endl;
        }
    }
}

C++: #include <stdio.h>
#define N 10;

int main(void){
	int i,j;
	for(i=1;i<N;i++)
		for(j=1;j<N;j++)
			printf("%dx%d=%d",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++)
????????????????{
????????????????????????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;
        }
    }
    
    return 0;
}

C++: #include<stdio.h>
int main()
{
	for(int i=1;i<10;i++)
	{
		printf("%dx%d=%d\n",i,i,i*i);
	}
	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>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<algorithm>
using namespace std;

/**
 * vector<int>ar(3);
 * for(auto&e:ar){
 *     scanf("%d",&e);
 * }
 * sort(ar.begin(),ar.end())
 * int sum=accumulate(ar.begin(),ar.end(),0);
 **/

int main(){
    int mod=1000000007;
    int n,m;
    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;
}

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

	for(int i=1; i<=9; i++){

		for(int j=1; j<=9; j++){

			cout<<"ixj="<<i*j<<endl;
		}
	}	
	return 0;
}

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

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

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)

int main(){
    int i, j;
    FOR(i, 1, 10){
        FOR(j, 1, 10){
            printf("%dx%d=%d\n", i, j, i*j);
        }
    }
    return 0;
}