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

int main(){

	for (int i = 1; i < 10; i++)
	{
		for (int j = 1; j < 10; j++)
		{
			if (i == 9 && j == 9)
			{
				cout << i << "x" << j << "=" << i * j;
			}
			else
			{
				cout << i << "x" << j << "=" << i * j << endl;
			}
		}
	}

	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++: #include<iostream>
using namespace std;

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

C++: #include<stdio.h>

int main(){
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(void){
    int a,b;
    for(a=1;a<=9;a++){
        for(b=1;b<=9;b++){
            cout <<a<<'x'<<b<<'='<<a*b<<endl;
        }
    }
    return 0;
}

C++: - submit, private

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

int main(int argc, const char * argv[]) {
    // insert code here...
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    for(int i = 1; i < 10; i++){
        for( int j = 1; j < 10; j++){
            cout << i << "x" << j << "=" << i * j << "\n";
        }
    }
    

    return 0;
}

C++: #include<iostream>
using namespace std;
int main()
{
	int a, b, r;
	for (a = 1; a<10; ++a) {
		for (b = 1; b<10; ++b) {
			r = a*b;
			cout << a << "x" << b << " = " << r << endl;
		}
	}
	return 0;
}

C++: #include <iostream>
using namespace std;
int main(void){
    // Your code here!
    for(int i = 1; i < 10; i++){
        for(int j = 1; j < 10; j++){
            cout << i << "x" << j << "=" << i * j << endl;
        }
    }
}

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

#define maxn 1010
#define LL(x) 2*x
#define RR(x) 2*x+1
#define M(x) (L[x]+R[x])/2
#define abs(x) ((x)<0?-(x):(x));

int sum[maxn][maxn];
int mst[maxn][maxn];
int dp[maxn][30];
int n,k,arr[maxn];

struct PartitionTree
{
    int L[maxn*2],R[maxn*2];
    int sorted[maxn];
    int val[20][maxn];
    int tol[20][maxn];

    void init()
    {
        for(int i=0;i<n;i++) val[0][i]=i;
        copy(arr,arr+n,sorted);
        sort(sorted,sorted+n);
        build(0,n);
    }
    void build(int l, int r,int d=0,int idx=1)
    {
        L[idx]=l;
        R[idx]=r;
        if(r-l==1) return;
        int m=M(idx),il=l,ir=m;
        int sameNum=sorted+m-lower_bound(sorted+l,sorted+m,sorted[m]);
        for(int i=l;i<r;i++)
        {
            tol[d][i]=il-l;
            if(arr[val[d][i]]==sorted[m]&&sameNum)
            {
                val[d+1][il++]=val[d][i];
                sameNum--;
            }
            else if(arr[val[d][i]]<sorted[m]) val[d+1][il++]=val[d][i];
            else val[d+1][ir++]=val[d][i];
        }
        build(l,m,d+1,LL(idx));
        build(m,r,d+1,RR(idx));
    }
    int query(int l,int r,int rank)
    {
        int a,b,d=0,idx=1;
        while(r-l>1)
        {
            a=tol[d][l];
            b=(r==R[idx]?M(idx)-L[idx]:tol[d][r])-a;
            if(rank<b)
            {
                l=L[idx]+a;
                r=l+b;
                idx=LL(idx);
            }
            else
            {
                l=M(idx)+l-L[idx]-a;
                r=M(idx)+r-L[idx]-a-b;
                rank=rank-b;
                idx=RR(idx);
            }
            d++;
        }
        return val[d][l];
    }
}pt;


int main()
{
    freopen("in","r",stdin);
    while(scanf("%d%d",&n,&k),n||k)
    {
        printf("%d %d\n",n,k);
        for(int i=0;i<n;i++) scanf("%d",arr+i);
        pt.init();
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<n;j++) sum[i][j]=abs(arr[j]-arr[i]);
            for(int j=1;j<n;j++) sum[i][j]+=sum[i][j-1];
        }
        for(int l=0;l<n;l++)
        {
            for(int r=l;r<n;r++)
            {
                int i=pt.query(l,r,(r-l)/2+1);
                mst[l][r]=sum[i][r]-sum[i][l-1];
            }
        }
        for(int l=0;l<n;l++,puts("")) for(int r=0;r<n;r++) printf("%d\t",mst[l][r]);
        memset(dp,63,sizeof(dp));
        dp[0][0]=0;
        for(int i=1;i<=k;i++)
            for(int j=0;j<n;j++)
                for(int w=0;w<j;w++)
                    dp[j][i]=min(dp[j][i],dp[w][i-1]+mst[w+1][i]);
        printf("%d\n",dp[n-1][k]);
    }
    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++: using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace supermanse
{
    class Program
    {
        static void Main(string[] args)
        {
            int a = 1;
            int b = 1;
            int c;
            for (; ; )
            {
                c = a * b;
                Console.WriteLine("" + a + "x" + b + "=" + c + "");
                b++;
                if (b == 10) { a++; b = 1; }
                if (a == 10) { break; }
            }
        }
    }
}

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>
main(i,j){for(i=1;i<10;i++){for(j=1;j<10;j++){printf("%dx%d=%d\n",i,j,i*j);}}}