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>
using namespace std;

int main()
{
  int i, j;
  for (i = 1; i < 10; i++) {
    for (j = 1; j < 10; j++) {
      int seki = i * j;
      cout << i << "x" << j << "=" << seki << endl;
    }
  }

  return 0;
}

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

C++: #include <bits/stdc++.h>
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;

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

C++: #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>
#include <math.h>
#include <string>
#include <algorithm>
using namespace std;
int kaijo(int n){
	int ans = 1;
	if (n != 0){
		for (int i = 0; i < n; i++){
			ans *= (n - i);
		}
	}
	else{
		ans = 1;
	}
	return ans;
}

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<stdio.h>

int main(){
    for(int i=1; i<10; i++)
    {
       printf("%dx%d=%d",i,i,i*i);
    }
    return 0;
}

C++: #include <cstdio>

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

C++: #include <iostream>
#include <stdio.h>
#include <stdlib.h>
#define N 10
int main(int argc, const char * argv[])
{
    for(int i=1; i<N; i++){
        for(int j=1; j<N; j++){
            printf("%d×%d=%d\n",i,j,i*j);
        }
    }

}

C++: - submit, private

C++: for num1 in 1..9
for num2 in 1..9
puts "#{num1}x#{num2}=#{num1*num2}"
end
end

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

C++: #include <bits/stdc++.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<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);
	printf("\n");

	return 0;
}

C++: #include<stdio.h>
#include<math.h>
#include<stdlib.h>
#include<algorithm>

int main(){
int i,j=0,k=0,l;
{
for(j=1;j<=9;j++)
{
for(k=1;k<=9;k++)
{
l=j*k;
printf("%d*%d=%d\n",j,k,l);
}
}
}
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++: main(a,b){for(;a<10;a++){for(b=1;b<10;){printf("%dx%d=%d\n",a,b++,a*b);}}exit(0);}

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

const int MAXN = 150;
const int INF = (-1u) >> 1;

int bit[10], p[10];
int n, a1, a2, b1, b2;
int dp[MAXN], e[2][MAXN], e2[MAXN];

inline int make_same(int u, int mask) {
    int s = mask & e[0][u], t = mask & e[1][u], ans = 0;
    for (int i = 0; i < n; i++) {
        if (!(s & bit[i]) && (t & bit[i])) ans += a1;
        else if ((s & bit[i]) && !(t & bit[i])) ans += a2;
    }
    return ans;
}

int solve() {
    int i, j;
    for (dp[0] = 0, i = 1; i < bit[n]; i++) {
        for (j = 0; j < n; j++) if (i & bit[j]) break;
        dp[i] = dp[i ^ bit[j]] + make_same(j, i ^ bit[j]);
    }
    return dp[bit[n] - 1];
}

int main() {
    int C = 0, i, j, u, v, m1, m2;
    for (i = 0; i < 10; i++) bit[i] = (1 << i);
    while (~scanf("%d%d%d", &n, &m1, &m2) && n) {
        for (i = 0; i < n; i++) e[0][i] = e2[i] = 0;
        for (i = 0; i < m1; i++) {
            scanf("%d%d", &u, &v);
            e[0][u] |= bit[v];
            e[0][v] |= bit[u];
        }
        for (i = 0; i < m2; i++) {
            scanf("%d%d", &u, &v);
            e2[u] |= bit[v];
            e2[v] |= bit[u];
        }
        scanf("%d%d%d%d", &a1, &a2, &b1, &b2);
        a1 = min(a1, b2), a2 = min(a2, b1);
        for (i = 0; i < n; i++) p[i] = i;
        int ans = INF;
        do {
            for (i = 0; i < n; i++) {
                e[1][i] = 0, u = p[i];
                for (j = 0; j < n; j++) {
                    if (e2[u] & bit[p[j]]) e[1][i] |= bit[j];
                }
            }
            if (p[0] == 0 && p[1] == 1 && p[3] == 2) {for (i = 0; i < n; i++) printf("%d ", e[1][i]); puts("");}
            ans = min(ans, solve());
        } while (next_permutation(p, p + n));
        printf("Case #%d: %d\n", ++C, ans);
    }
    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++){
  printf("%dx%d=%d\n",i,j, i * j);
}
}
  return 0;
}

C++: #include <cstdio>
#include <cstring>
#define N 111111
int cc[N],sa[N],h[N],rank[N],wa[N],ws[N],wb[N],wv[N],n;
char c[N];
bool cmp(int *r, int a, int b, int l){
	return r[a] == r[b] && r[a + l] == r[b + l];
}
void da(int *r, int *sa, int n, int m){//*r:蜴滉クイ *sa:蜷守シ?焚扈?シ茎a[0]荳コ遨コ荳イ(sa[0] = n - 1) n:諤サ髟ソ m:蟄礼ャヲ闌?峩
	int i, j, p, *x = wa, *y = wb, *t;
	memset(ws, 0, sizeof ws);
	for (i = 0; i < n; i ++ ) ws[x[i] = r[i]] ++ ;
	for (i = 1; i < m; i ++ ) ws[i] += ws[i - 1];
	for (i = n - 1; i >= 0; i -- ) sa[ -- ws[x[i]]] = i;
	for (j = 1, p = 1; p < n; j *= 2, m = p){
		for (p = 0, i = n - j; i < n; i ++ ) y[p ++ ] = i;
		for (i = 0; i < n; i ++ ) if (sa[i] >= j) y[p ++ ] = sa[i] - j;
		for (i = 0; i < n; i ++ ) wv[i] = x[y[i]];
		memset(ws, 0, sizeof ws);
		for (i = 0; i < n; i ++ ) ws[wv[i]] ++ ;
		for (i = 1; i < m; i ++ ) ws[i] += ws[i - 1];
		for (i = n - 1; i >= 0; i -- ) sa[ -- ws[wv[i]]] = y[i];
		for (t = x, x = y, y = t, p = 1, i = 1, x[sa[0]] = 0; i < n; i ++ )
			x[sa[i]] = cmp(y, sa[i], sa[i - 1], j) ? p - 1 : p ++ ;
	}
	return;
}
void gua(int *r, int *sa, int n){//rank:謗貞錐 h:height謨ー扈?	int i, j, k = 0;
	for (i = 1; i <= n; i ++ ) rank[sa[i]] = i;
	for (i = 0; i < n; h[rank[i ++ ]] = k)
		for (k ? k -- : 0, j = sa[rank[i] - 1]; r[i + k] == r[j + k]; k ++ );
	return;
}
int main(){
	scanf("%s", c);
	n = strlen(c);
	c[n ++ ] = 0;//譛ォ蟆セ髴?刈荳頑欠遉コ隨ヲ/000;
	for (int i = 0; i < n; i ++ ) cc[i] = c[i];
	da(cc, sa, n, 127);
	gua(cc, sa, -- n);//n髴?△螟榊次髟ソ?敬[i]荳コsa[i]蜥茎a[i - 1]蜈ャ蜈ア髟ソ蠎ヲ?茎a[0]荳コ譛ォ蟆セ遨コ荳イ
	for (int i = 0; i <= n; i ++ ) printf("%d ",sa[i]);
}

C++: /*
 * main.cpp
 *
 *  Created on: 2011/04/01
 *      Author: satoki
 *      11:27 ~ 11:37 Accepted
 */
#include <iostream>

using namespace std;

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 <stdio.h>

using namespace std;


int main(){

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

    return 0;
}

C++: #include <cstdio>
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<cstdio>
main(){
FILE *fp = fopen("test","w");
fprintf(fp,"%d",1125);
return 0;
}