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>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<algorithm>
typedef long long ll;
const int N = 55;
const int Fuck=95041567;
using namespace std;

int pri[]={31,37,41,43,47};
int nn,m,n;
int b[N][N];
ll ans[10];

void init(int p){
    b[1][1]=1;
    b[2][1]=1,b[2][2]=2;
    for(int i=3;i<50;i++){
        b[i][1]=b[i-1][i-1];
        for(int j=2;j<=i;j++){
            b[i][j]=(b[i-1][j-1]+b[i][j-1])%p;
        }
    }
//    for(int i=1;i<50;i++){
//        for(int j=1;j<=i;j++) printf("%d ",b[i][j]);
//        puts("");
//    }
}

struct Mat{
    int val[N][N];
    void unit() {
        zero();
        for (int i=0; i<N; i++) val[i][i]=1;
    }
    void zero() {
        memset(val,0,sizeof(val));
    }
};

Mat operator *(const Mat &a,const Mat &b) {
    Mat tmp;
    tmp.zero();
    for (int k=1; k<=nn; k++) {
        for (int i=1; i<=nn; i++) {
            if (a.val[i][k]) {
                for (int j=1; j<=nn; j++) {
                    tmp.val[i][j]+=(a.val[i][k]*b.val[k][j])%m;
                    if (tmp.val[i][j]>=m) tmp.val[i][j]%=m;
                }
            }
        }
    }
    return tmp;
}

Mat operator ^(Mat x,int n) {
    Mat tmp;
    tmp.unit();
    while (n) {
        if (n&1) tmp=tmp*x;
        x=x*x;
        n>>=1;
    }
    return tmp;
}


void Gcd(ll a,ll b,ll &d,ll &x,ll &y) {
    if (!b) {
        d=a,x=1,y=0;
    }else {
        Gcd(b,a%b,d,y,x);
        y-=x*(a/b);
    }
}

ll inv(ll a,ll b,ll n, ll &d) {
    ll x,y;
    Gcd(a,n,d,x,y);
    if (b%d) return -1;
    return ((x*b/d)%n+n)%n;
}

ll getans() {
    ll m1,m2,a1,a2,x,d;
    m1=pri[0];
    a1=ans[0];
    bool flag=false;
    for (int i=1; i<5; i++) {
        if (flag) continue;
        m2=pri[i],a2=ans[i];
        x=inv(m1,a2-a1,m2,d);
        if (x==-1) {flag=true; continue;}
        a1=m1*x+a1;
//        printf("%lld ",a1);
        m1=m1*m2/d;
        a1=(a1%m1+m1)%m1;
    }
 //   puts("");
    if (flag) a1=-1;
//    return a1;
    return (a1%Fuck+Fuck)%Fuck;
}

ll solve(int n,int p){
    m=p,nn=p+1;
    Mat tmd;
    tmd.zero();
    for(int i=1;i<=p;i++){
        tmd.val[i][i+1]=1;
    }
    tmd.val[p+1][1]=1,tmd.val[p+1][2]=1;
    init(p);
    Mat res;
    res.zero();
    for(int i=1;i<=p+1;i++){
        res.val[i][1]=b[i][i];
    }
    res=(tmd^(n-1))*res;
    return res.val[1][1];
}

int main(){
//    init(47);
//    freopen("in","r",stdin);
    int T;
//    scanf("%d",&T);
    while (1) {
        scanf("%d",&n);
        for (int i=0; i<5; i++) {
            ans[i]=solve(n,pri[i]);
            cout<<ans[i]<<" ";
        }
        cout<<endl;
        ll res=getans();
        cout<<res<<endl;
    }
    return 0;
}

C++: #include <stdio.h>
int main()
{
	long int i,j;
		for(i=1;i<10;i++){
			for(j=1;j<=10;j++){
			printf("%ld * %ld = %ld\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)
  {
   printf("%dx%d=%d\n" , i , j , i*j);
  }
 }
    return 0;
}

C++: #include<stdio.h>
main() {
//??????????????????????????????????????????????????¢?????¢?????????????????????????????¶?????¶???
	for (int i = 1; i <= 9; i++)for (int j = 1; j <= 9; j++)printf("%dx%d=%d", i, j, i*j);
}

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

C++: b;main(a){for(;a<=9;(b%=9)||a++)printf("%dx%d=%d\n",a,++b,a*b+a);}

C++: #include <stdio.h>
main(){
  int a,b,c;
  a=1;
  b=1;
  while(a<10){
    while(b<10){
      c=a*b;
      printf("%dx%d=%d\n",a,b,c);
      b++;
    }
    b=1;
    a++;
  }
return 0;
}

C++: // test
#include <string>
using namespace std;

int main(){
    string s=to_string(100);
}

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

C++: #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <cmath>
#include <queue>
#include <map>
#include <stack>
#include <list>
#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>
using namespace std;


int main(){
	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<<endl;
		}
	}
	return 0;
}

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

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(){
    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 <=9; i++){
for(int k = 1; k <=9; k++){
cout << k << "x" << i <<"=" <<i*k << 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("ixj=%d\n",i*j);
}
}

    return 0;
}

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

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

C++: #include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
int n,m;
int main()
{
    int T;
    scanf("%d",&T);
    for(int cas=1;cas<=T;++cas)
    {
        printf("Case #%d:\n",cas);
        scanf("%d%d",&n,&m);
        int s=1;
        for(int i=1;i<=3;++i){
            if((i+i+n-1)*n/2%3==0){
                s=i;
                break;
            }
        }
        for(int i=s;i<s+n;++i)
        {
            printf("%d %d %d\n",i-s+1,(i-s+1)%n+1,i);
        }
        int num[3];
        memset(num,0,sizeof num);
        for(int i=1;i<s;++i) ++num[i%3],cout<<i<<endl;
        for(int i=s+n;i<=m;++i) ++num[i%3],cout<<i<<endl;
        cout<<"s="<<s<<endl;
        for(int i=0;i<n;++i)
        {
            int sum=(i+s)%3;
            for(int j=(i+1)%n;j!=i-1;j=(j+1)%n)
            {
                sum=(sum+j+s)%3;
                if(num[sum]>0){
                    printf("%d %d %d\n",i+1,(j+1)%n+1,sum);
                    --num[sum];
                }
                cout<<"sum="<<sum<<endl;
                getchar();
            }
        }
    }
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define REP(i,N) for(int i = 0; i < (int)N; i++)

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