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 <cstdio>
int s,e;int main(){for(;e%=9,(s+=!e++)-10;)printf("%dx%d=%d\n",s,e,s*e);}

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;
      }
   }
}

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

int main(){
	
	for(int first=1; first < 10; ++first)
	{
		for(int second=1; second < 10; ++second)
		{
			cout << first << "x" << second << "=" << first * second << 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<cstdio>
using namespace std;
int main(){
  int i,j;
  for(i=1;i<=9;i++){
    for(j=1;j<=9;j++){
      printf("%dx%d=%d\n",i,j,i*j);
    }
  }
  return 0;
}

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

int main(){
int a = 1,b = 1,c;
while(a != 9 and b != 9){
c=a*b;
cout<<a<<"x"<<b<<"="<<c<<endl;
b++;
if(b == 10){
a++;
b = 1;
}

}
}

C++: 
#define r(i) for(i=1;i<10;i++)
main(i,j){
	r(i)
	r(j)
	std::cout<<i<<'x'<<j<<'='<<i*j<<std::endl;
	return 0;
}

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

int main()
{
	int i, j;

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

	}


	return 0;
}

C++: #iinclude <iostream>
using namespace std;
int main()
{
int i,j;
for(i=1;i<=9;i++)
{
for(j=1;j<=9;i++)
{
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<cstdio>
#include<cstring>
#define MAXN 1000010
char a[2][MAXN];
inline int MIN(int x, int y) {
	return x > y ? y : x;
}
struct node {
	int left, right;
};
node tree[MAXN << 2];
inline void PushUp(int mid, int L, int R, int rt) {
	tree[rt].left = tree[rt << 1].left;
	tree[rt].right = tree[rt << 1 | 1].right;
	if (tree[rt].left == mid - L + 1)
		tree[rt].left += tree[rt << 1 | 1].left;
	if (tree[rt].right == R - mid)
		tree[rt].right += tree[rt << 1].right;
}
void Build(int L, int R, int rt) {
	if (L == R) {
		if (a[0][L] == a[1][L])
			tree[rt].left = tree[rt].right = 1;
		else
			tree[rt].left = tree[rt].right = 0;
	} else {
		int mid = (L + R) >> 1;
		Build(L, mid, rt << 1);
		Build(mid + 1, R, rt << 1 | 1);
		PushUp(mid, L, R, rt);
	}
}
void Update(int x, int L, int R, int rt) {
	if (L == R) {
		if (a[0][L] == a[1][L])
			tree[rt].left = tree[rt].right = 1;
		else
			tree[rt].left = tree[rt].right = 0;
	} else {
		int mid = (L + R) >> 1;
		Build(L, mid, rt << 1);
		Build(mid + 1, R, rt << 1 | 1);
		PushUp(mid, L, R, rt);
	}
}
int Query(int x, int L, int R, int rt) {
	if (R - tree[rt].right + 1 <= x)
		return (R - tree[rt].right + 1) + tree[rt].left;
	else {
		int mid = (L + R) >> 1;
		if (x <= mid)
			return Query(x, L, mid, rt << 1);
		else
			return Query(x, mid + 1, R, rt << 1 | 1);
	}
}
int main() {
	int ca = 1;
	int ans;
	int c, la, lb, n, q;
	int cmd, id, i;
	char ch;
	scanf("%d", &c);
	while (c--) {
		scanf(" %s %s", a[0], a[1]);
		la = strlen(a[0]);
		lb = strlen(a[1]);
		n = MIN(la, lb) - 1;
		Build(0, n, 1);
		scanf("%d", &q);
		printf("Case %d:\n", ca++);
		while (q--) {
			scanf("%d", &cmd);
			if (cmd == 1) {
				scanf("%d%d %c", &id, &i, &ch);
				a[id][i] = ch;
				Update(i, 0, n, 1);
			} else {
				scanf("%d", &i);
				if (a[0][i] == a[1][i])
					ans = Query(i, 0, n, 1);
				printf("%d\n", ans);
			}
		}
	}
	return 0;
}
/*
Case 1:
2
2
2
4
2

4

*/

C++: #include <stdio.h>
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 <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++){
    printf("%dx%d=%d\n",i,i,i*i);
  }

  return 0;

}

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

int main(){
	long double d=1111.11111111111111111111111111111111111111111111111;
	printf("%.114514lf\n",d);
}

C++: for i in range(1,10):
    for j in range(1,10):
        ans = "%dx%d=%d"%(i,j,i*j)
        print(ans)

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 <<"\n";
        }
            }
    
    return 0;
}

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",i,j,i*j);
		}
	}
    return 0;
}

C++: <?php
for(i=0;i<81;++i){a=i/9+1;b=i%9+1;print a.'x'.b.'='.(a*b).'\n';}
?>

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

using namespace std;

#define FOR(i, m, n) for(int i = m; i < n; i++)

int main() {
    FOR(i, 1, 10) FOR(j, 1, 10) {
            cout << i << "x" << j << "=" << i * j << endl;
        }
    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;
}

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

C++: #include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <math.h>
#include <utility>

using namespace std;

#define FOR(i,k,n) for(int i = (k); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
int main()
{
	FOR(i, 1, 10)FOR(j, 1, 10)
	{
		cout << i << "x" << j << "=" << i*j << endl;
	}
	return 0;
}

C++: #include <iostream>

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

C++: #indlude<stdio.h>
 
	int main(){
    	1x1=1
	1x2=2
	1x3=3
	1x4=4
	1x5=5
	1x6=6
	1x7=7
	1x8=8
	1x9=9
	2x1=1
	2x2=4
	2x3=6
	2x4=8
	2x5=10
	2x6=12
	2x7=14
	2x8=16
	2x9=18
	3x1=3
        3x2=6
	3x3=9
	3x4=12
	3x5=15
	3x6=18
	3x7=21
	3x8=24
	3x9=27
	4x1=4
	4x2=8
	4x3=12
	4x4=16
	4x5=20
	4x6=24
	4x7=28
	4x8=32
	4x9=36
	5x1=5
	5x2=10
	5x3=15
	5x4=20
	5x5=25
	5x6=30
	5x7=35
	5x8=40
	5x9=45
	6x1=6
	6x2=12
	6x3=18
	6x4=24
	6x5=30
	6x6=36
	6x7=42
	6x8=48
	6x9=54
	7x1=7
	7x2=14
	7x3=21
	7x4=28
	7x5=35
	7x6=42
	7x7=49
	7x8=56
	7x9=63
	8x1=8
	8x2=16
	8x3=24
	8x4=32
	8x5=40
	8x6=48
	8x7=56
	8x8=64
	8x9=72
	9x1=9
	9x2=18
	9x3=27
	9x4=36
	9x5=45
	9x6=54
	9x7=63
	9x8=72
	9x9=81
	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>
int main(){int i,j,k;for(i=0;i<81;i++)j=i/9+1,k=i%9+1,printf("%dx%d=%d\n",j,k,j*k);}