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 <cmath>
# include <algorithm>
# include <iostream>
# include <cstring>
# define bignum 200000000
# define eps 1e-6
# define N 655
using namespace std;
int p;
struct Point
{
	int x,y;
}pt[N],pln[N];

int dlcmp(int x)
{
	return x<0?-1:x>0;
}
int cross(Point a,Point b,Point s)
{
	int x1=a.x-s.x,y1=a.y-s.y;
	int x2=b.x-s.x,y2=b.y-s.y;
	return x1*y2-x2*y1;
}
double dis(Point a,Point b)
{
	double dx=a.x-b.x;
	double dy=a.y-b.y;
	return sqrt( dx*dx + dy*dy );
}
int cmp(Point a,Point b)
{
	if (dlcmp(cross(a,b,pt[0]))==1 || 
		(dlcmp(cross(a,b,pt[0]))==0 && dis(pt[0],a)<dis(pt[0],b)) )
		return 1;
	else return 0;
}
int graham_scan(int n)
{
	int top,t,i;
	if (n<=1)
		return n;
	for (t=0,i=1;i<n;i++)
		if (dlcmp(pt[i].y-pt[t].y)==-1 || 
		(dlcmp(pt[i].y-pt[t].y)==0 && dlcmp(pt[i].x-pt[t].x)==-1))
				t=i;
	swap(pt[0],pt[t]);

	sort (pt+1,pt+n,cmp);
	for (i=0;i<2;i++)
		pln[i]=pt[i];
	top=2;
	for (i=2;i<n;i++)
	{
		while (top>1 && dlcmp(cross(pln[top-1],pt[i],pln[top-2]))<=0)
			top--;
		pln[top++]=pt[i];
	}
	return top;
}
int abss(int x)
{
	return x<0?-x:x;
}
inline int calc(int x,int y)
{
	return (abss(pt[x].x+pt[y].x)*abss(pt[x].y+pt[y].y))%p;
}
int dp[N][N];
int main (void)
{
	int n;
	while (cin>>n>>p)
	{
		for (int i=0;i<n;i++)
			cin>>pt[i].x>>pt[i].y;
		if (graham_scan(n)<n)
		{
			cout<<"I can't cut."<<endl;
			continue;
		}
		for (int i=n;i<n+n;i++)
			pt[i]=pt[i-n];
		memset(dp,0,sizeof(dp));
		for (int len=3;len<n;len++)
		{
			for (int i=0;i<n;i++)
			{
				int j=i+len;
				dp[i][j]=min(dp[i+1][j]+calc(i+1,j),dp[i][j-1]+calc(i,j-1));
				for (int k=i+2;k<=j-2;k++)
					dp[i][j]=min(dp[i][j],dp[i][k]+dp[k][j]+calc(i,k)+calc(j,k));
			}
		}
		int ans=bignum;
		for (int i=0;i<n;i++)
			ans=min(ans,dp[i][i+n-1]);
		cout<<ans<<endl;
	}
	
	return 0;
}

C++: #include<stdio.h>

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

    return 0;
}

C++: #include <bits/stdc++.h>
#define int long long
using namespace std;
const int INF = 1e9 + 7, MOD = 1e9 + 7;
const long long LINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
signed 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>


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

C++: #include<iostream>

int main(){
	int i,j;
		
	for(i=1;i<=9;i++)
	for(j=1;j<=9;j++)
	std::cout << i << "x" << j 
			  << "=" << i*j << "\n" ;
	
	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()
{
    int i,j,sum;
    for(i=1;i<=9;i++)
    for(j=1;j<=9;j++)
     cout<<i<<"*"<<j<<"="<<i*j<<"\n";
    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(void)
{
    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 < 10; i++){

   for(int j = 1 ; j < 10 ; j++){

       cout << i << "x" << j << "=" << i*j << 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<iostream>
using namespace std;
int main()
{
cout << "1x1=1" << endl;
cout << "2x2=4" << endl;
cout << "3x3=9" << endl;
cout << "4x4=16" << endl;
cout << "5x5=25" << endl;
cout << "6x6=36" << endl;
cout << "7x7=49" << endl;
cout << "8x8=64" << endl;
cout << "9x9=81" << 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 <bits/stdc++.h>

#define int long long int
#define main signed main()
#define bye return 0
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define each(p, v) for (auto p = (v).begin(); p != (v).end(); p++)
#define all(v) (v).begin(), (v).end()
#define prec(n) fixed << setprecision(n)
#define dump(x) cerr << "(L" << __LINE__ << ") " << #x << " = " << (x) << endl
#define clr(x, a) memset(x, a, sizeof(x))

#define sum(v) accumulate(all(v), 0)
#define stlice(from, to) substr(from, (to) - (from) + 1)
#define odd(n) ((n) % 2)
#define even(n) (!odd(n))

#define INF 1000000000
#define MOD 1000000007

#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define vi vector<int>
#define vb vector<bool>
#define vc vector<char>
     
using namespace std;

main {
  loop(i, 1, 10) cout<<i<<'x'<<i<<'='<<i*i<<endl;
  bye;
}

C++: #include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<algorithm>
#include<vector> 
#include<limits>
#include<numeric>
#include<type_traits>
#include<math.h>
using namespace std;

#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define in(x) cin >> x
#define out(str) cout << str << endl

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }



int main(){
    rep(i,9){
        rep(j,9){
            cout<<i+1<<"x"<<j+1<<"="<<(i+1)*(j+1)<<endl;
        }
    }
}

C++: #inclde<iostream>
using namespace std;
int main()
{int c,i;
for(i=1;i<10;i++)
{c=1*i
cout<<"1x"<<i<<"="<<c<<endl;
}
for(i=0;i<;i++)
{c=2*i
cout<<"2x"<<i<<"="<<c<<endl;
}
for(i=0;i<;i++)
{c=3*i
cout<<"3x"<<i<<"="<<c<<endl;
}
for(i=0;i<;i++)
{c=4*i
cout<<"4x"<<i<<"="<<c<<endl;
}
for(i=0;i<;i++)
{c=5*i
cout<<"5x"<<i<<"="<<c<<endl;
}
for(i=0;i<;i++)
{c=6*i
cout<<"6x"<<i<<"="<<c<<endl;
}
for(i=0;i<;i++)
{c=7*i
cout<<"7x"<<i<<"="<<c<<endl;
}
for(i=0;i<;i++)
{c=8*i
cout<<"8x"<<i<<"="<<c<<endl;
}
for(i=0;i<;i++)
{c=9*i
cout<<"9x"<<i<<"="<<c<<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;
}