Go: package main

import (
	"fmt"
	"strconv"
)

func main() {
	for _, leftValue := range MultiplicationTableNum(9) {
		for _, rightValue := range MultiplicationTableNum(9) {
			strLeftVal, strRightVal, strMulti := strconv.Itoa(leftValue), strconv.Itoa(rightValue), strconv.Itoa(Multiplication(leftValue, rightValue))
			fmt.Println(strLeftVal + "x" + strRightVal + "=" + strMulti)
		}
	}
}

func MultiplicationTableNum(num int) []int {
	multiNum := []int{}
	for i := 1; i <= num; i++ {
		multiNum = append(multiNum, i)
	}
	return multiNum
}

func Multiplication(x, y int) int {
	return x * y
}

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

int main(){
	int a,b;
	for(a=1;a<10;a++){
		for(b=1;b<10;b++){
			cout<<a<<"x"<<b<<"="<<a*b<<endl;
		}
	}
	return 0;
}

C++: #include <iostream>
#include <stdio.h>


using namespace std;



int main(){
  for(int i=1;i<10;i++){
    for(int j=1;j<10;j++){
      std::cout << i <<"x"<<j<<"="<<i*j<< '\n';
    }
  }

}

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

C++: #include<iostream>

int main(){

	int a=0,i,b;

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

C++: #include <cstdio>

#define N	9

int main()
{
	for(int i = 1; i <= N; i ++)
	{
		for(int j = 1; j < N; 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 << "\n";

  return 0;
}

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

int main(){
    enum{
        STARTMULTITABLE = 1,
        ENDMULTITABLE = 9
    };
    
    int i;
    for(i = STARTMULTITABLE; i <= ENDMULTITABLE; i++){
        int k;
        for(k = STARTMULTITABLE; k <= ENDMULTITABLE; k++){
            cout << i << "x" << k << "=" << (i*k) << endl;
        }
    }
    return 0;
}

C++: #include<cstring>
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
#define MAXN 105
using namespace std;

char s[105][105];
pair<int,int> Start, End, snake[10];
int n, m;
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
bool vis[105][105][10];

struct State{
    pair<int,int> here;
    int cnt;
    int step;
    State(pair<int,int> here, int cnt, int step): here(here), cnt(cnt), step(step) {}
};
bool judge(int x, int y){
    if(x<0||x>=n||y<0||y>=n) return false;
    if(s[x][y]=='#') return false;
    return true;
}
queue<State> q;
int bfs(){
    memset(vis,0,sizeof vis);
    while(!q.empty()) q.pop();
    q.push(State(Start,0,0));
    vis[Start.first][Start.second][0]=true;
    while(!q.empty()){
        State u = q.front(); q.pop();
        pair<int,int> cc;
        int step=u.step;
        int cnt=u.cnt;
//        cout<<u.here.first<<" "<<u.here.second<<endl;
        if(u.here==End&&cnt==m){
//            cout<<"~~"<<cnt<<" "<<step<<endl;
            return step;
        }
        for(int z=0; z<4; z++){
            cc.first = u.here.first + dx[z];
            cc.second = u.here.second+ dy[z];
            if(judge(cc.first,cc.second)){
                if(isdigit(s[cc.first][cc.second])){
                    if(s[cc.first][cc.second]-'0'<=cnt){
                        if(!vis[cc.first][cc.second][cnt]){
                            q.push(State(cc,step+1,cnt));
                            vis[cc.first][cc.second][cnt]=true;
                        }
                    }
                    else if(s[cc.first][cc.second]-'0'==cnt+1){
                        if(!vis[cc.first][cc.second][cnt+1]){
                            q.push(State(cc,step+1,cnt+1));
                            vis[cc.first][cc.second][cnt+1]=true;
                        }
                    }
                }
                else{
                    if(!vis[cc.first][cc.second][cnt]){
                        q.push(State(cc,step+1,cnt));
                        vis[cc.first][cc.second][cnt]=true;
                    }
                }
            }
        }
    }
    return -1;
}

int main()
{
//freopen("/home/acm/code/input.txt","r", stdin);

    while(~scanf("%d %d",&n,&m),n||m){
        int top=0;
        for(int i=0; i<n; i++){
            scanf("%s",s[i]);
            for(int j=0; j<n; j++){
                if(s[i][j]=='K'){
                    Start=make_pair(i,j);
                    s[i][j]='.';
                }
                if(s[i][j]=='T'){
                    End=make_pair(i,j);
                    s[i][j]='.';
                }
                if(s[i][j]=='S'){
                    snake[top++]=make_pair(i,j);
                }
            }
        }
        cout<<"top="<<top<<endl;
        int ans=0x3f3f3f3f;
        for(int i=0; i<(1<<top); i++){
            int cnt=0;
            for(int j=0; j<top; j++){
                int idxi=snake[j].first;
                int idxj=snake[j].second;
                if((i>>j)&1){
                    s[idxi][idxj]='.';
                    cnt++;
                }
                else{
                    s[idxi][idxj]='#';
                }
            }
            int temp=bfs();
            //cout<<temp<<endl;
            if(temp!=-1){
                cout<<cnt<<endl;
                ans=min(ans,cnt+temp);
            }
        }
        if(ans!=0x3f3f3f3f) printf("%d\n",ans);
        else printf("impossible\n");
    }
    return 0;

}

C++:     #include <tuple>
    #include <iostream>
    #include <type_traits>
     
    template <size_t n, typename... T>
    typename std::enable_if<(n >= sizeof...(T))>::type
    print_tuple(std::ostream&, const std::tuple<T...>&)
    {}
     
    template <size_t n, typename... T>
    typename std::enable_if<(n < sizeof...(T))>::type
    print_tuple(std::ostream& os, const std::tuple<T...>& tup)
    {
    if (n != 0)
    os << ", ";
    os << std::get<n>(tup);
    print_tuple<n+1>(os, tup);
    }
     
    template <typename... T>
    std::ostream& operator<<(std::ostream& os, const std::tuple<T...>& tup)
    {
    os << "[";
    print_tuple<0>(os, tup);
    return os << "]";
    }
     
    int main()
    {
    std::cout << std::make_tuple(2, 3.14159F, 2345.678) << std::endl;
    std::cout << std::make_tuple("hello", 5) << std::endl;
    std::cout << std::make_tuple() << std::endl;
    return 0;
    }

C++: #include<stdio.h>
int main(void)
{
	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(){
  for(int i=0;i<9;i++){
      for(int j=0;j<9;j++){
          cout<<i+1<<"x"<<j+1<<"="<<(i+1)*(j+1)<<endl;
      }
  }
  return 0;
}