Go: package main

import "fmt"


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

C++: #include <iostream>
#include <cstdio>
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;
        }
    }

}

C++: #include<iostream>
#include<stdio.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 <iostream>
#include <list>

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>
#include<stdio.h>
int main(){
	int a,b;
		for(a=1;a<10;a++){
			for(b=1;b<10;b++){
				std::cout<<a<<"x"<<b<<"="<<a*b<<std::endl;
				}
			}


  
      return 0;
	}

C++: #include<stdio.h>

int main(){

int a, b, c;

a = 1;
b = 1;

while(1){

   c = a * b;

   printf("%dx%d=%d\n", a, b, c);

   b++;

   if(b == 10){
     a++;
     b = b - 9;
   }

   if(a == 10)
     break;
  
}

 return 0;
}

  
   
   



    return 0;
}

C++: for i in range(1,10):
    for j in range(1,10):
        qq=str(i)+"x"+str(j)+"="+str(i*j);
        print(qq);

C++: #include <stdio.h>

int main(void) {
	
	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>
#include <string>
#include <utility>
#include <algorithm>
#include <queue>
#include <map>

using namespace std;
typedef long long Int;
#define REP(i , x) for(int i = 1 ; i < x ; ++i)


int main()
{
	REP(i, 10){
		REP(j, 10){
			cout << i << "x" << j << "=" << i*j << endl;
		}
	}

	return 0;
}

C++: #include<iostream>

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

C++: class Test {
    static void Main() {
 
            for (int i = 1; i <= 9; i++) {
 
                for (int j = 1; j <= 9; j++) {
 
                    int re = i * j;
 
Console.Write(i);
Console.Write("+");
Console.Write(j);
Console.Write("=");
Console.Write(re);
 
                }
            }
    }
}

C++: #include <iostream>

using namespace std;

int main(void){
	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(void) {
	int i, x;
	for (x = 1;x < 10;x++) {}
	for (i = 1;i < 10;i++) {
		printf("%dx%d=%d\n", x, i, x*i);
	}
}
	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<stdio.h>
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(){
	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()
{
 int x,y;
 for(int i=0; i<9; i++)
 {
   for(int j=0; j<9; j++)
   {
     cout<<i<<"x"<<j<<"="<<i*j<<endl;
   }
 }
 return 0;
}

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

// 1927426???1927428???WA???????????????????????????????????§???
auto dodo() {
  for(auto i=0; i<9; i++)
    for(auto j=0; j<9; j++)
      cout << i+1 << 'x' << j+1 << '=' << (i+1)*(j+1) << endl;
}

int main() {
  dodo();
  return 0;
}

C++: #include <cstdio>
#include <algorithm>
#include <iostream>
#include <cstring>
#define N 1111111
int d[12][12][12][12][12];
void suan(int i, int j, int k, int l, int q){
    d[i][j][k][l][q] = 0;
    for (int p = i - 1; p >= 0; p -- )
        if (!d[p][j][k][l][q]) d[i][j][k][l][q] = 1;
    for (int p = j - 1; p >= i ? i + 1 : 0; p -- )
        if (!d[i][p][k][l][q]) d[i][j][k][l][q] = 1;
    for (int p = k - 1; p >= j ? j + 1 : 0; p -- )
        if (!d[i][j][p][l][q]) d[i][j][k][l][q] = 1;
    for (int p = l - 1; p >= k ? k + 1 : 0; p -- )
        if (!d[i][j][k][p][q]) d[i][j][k][l][q] = 1;
    for (int p = q - 1; p >= l ? l + 1 : 0; p -- )
        if (!d[i][j][k][l][p]) d[i][j][k][l][q] = 1;

}
int main(){freopen("t.in","r",stdin);freopen("t.out","w",stdout);
    memset(d, 255, sizeof d);
    int n = 12;
    for (int i = 0; i <= n; i ++ )
        for (int j = i; j <= n; j ++ )
            for (int k = j; k <= n; k ++ )
                for (int l = k; l <= n; l ++ )
                    for (int q = l; q <= n; q ++ ){
                        if (i == j && i) continue;
                        if (k == j && k) continue;
                        if (k == l && l) continue;
                        if (l == q && q) continue;
                        suan(i,j,k,l,q);
                        printf("%3d %3d %3d %3d %3d:%d %d\n",i,j,k,l,q,d[i][j][k][l][q],i^(j-j)^(k-j)^(l-l)^(q-l));
                    }
}

C++: #include<stdio.h>
int main()
{
    int i,j;

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

    return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>

using namespace std;

const int N = 1111;
int dp[N][N], pos[N], n;
char origin[N], s[N];

int main () {
    int cas = 1, K;
    while(scanf("%d", &K)!=EOF) {
        getchar(); gets(origin);
        n = 0;
        for(int i=0;origin[i];++i) if(isalpha(origin[i])) {
            s[n] = origin[i]; pos[n] = i;
            if(s[n]<='Z'&&s[n]>='A') s[n] += 'a' - 'A';
            n ++;
        }
        s[n] = 0;
        for(int i=0;i<n;++i) dp[i][i] = 0;
        for(int i=0;i<n;++i) dp[i][i+1] = s[i]!=s[i+1];
        for(int l=2;l<n;++l) for(int i=0;i+l<n;++i) {
            dp[i][i+l] = dp[i+1][i+l-1] + (s[i] != s[i+l]);
        }
        int _max = 0;
        for(int i=0;i<n;++i) for(int j=i;j<n;++j) if(dp[i][j]<=K) {
            _max = max(_max, pos[j]-pos[i]+1);
        }
        bool ok = 1;
        for(int i=0;i<n&&ok;++i) for(int j=i;j<n&&ok;++j) if(dp[i][j]<=K&&pos[j]-pos[i]+1==_max) {
            ok = 0;
            printf("Case %d: %d %d\n", cas++, _max, pos[i]+1);
        }
    }
    return 0;
}

C++: #include<stdio.h>

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

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++: #include <iostream>
#include <string>
#include <stack>
#include <math.h>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <vector>

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

C++: #include<cstdio>
struct a
{
    int x,y,l;
} mm[15005];
int v[1005],e[1005],hash[1005],hs[1005][1005];
int main()
{
    int i,j,n,m;
    scanf("%d %d",&n,&m);
    for(i=0;i<m;i++)
    {
        scanf("%d %d %d",&mm[i].x,&mm[i].y,&mm[i].l);
    }
    v[0]=1;
    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);
}
}
  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;
}