Go: package main

import (
	"fmt"
)

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

C++: #include <algorithm>
#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
#define M 100010
int wa[M], wb[M], WS[M], wv[M];
int rk[M], sa[M], height[M];
int RMQ[21][M], mp[M], vis[M];
char s[M];
int a[M];
#define LL long long
LL sum[M];

int min(int x, int y)
{
    return x < y? x: y;
}

bool cmp(int *r, int i, int j, int len)
{
    return r[i] == r[j] && r[i+len] == r[j+len];
}

void suffix(int *r, int n, int m)
{
    int *x = wa, *y = wb, *t;
    int i, j, p;
    for(i = 0; i < m; i++) WS[i] = 0;
    for(i = 0; i < n; i++) WS[x[i] = r[i]]++;
    for(i = 1; i < m; i++) WS[i] += WS[i-1];
    for(i = n - 1; i >= 0; i--) sa[--WS[x[i]]] = i;

    for(j = 1, p = 0; p < n; j <<= 1, m = p){
        p = 0;
        for(i = n-j; i < n; i++) y[p++] = i;
        for(i = 0; i < n; i++) if(sa[i] >= j) y[p++] = sa[i] - j;
        for(i = 0; i < m; i++) WS[i] = 0;
        for(i = 0; i < n; i++) WS[wv[i] = x[y[i]]]++;
        for(i = 1; i < m; i++) WS[i] += WS[i-1];
        for(i = n-1; i >= 0; i--) sa[--WS[wv[i]]] = y[i];

        t = x; x = y; y = t; x[sa[0]] = 0;
        for(i = 1, p = 1; i < n; i++)
            x[sa[i]] = cmp(y, sa[i], sa[i-1], j) ? p - 1: p++;
    }
}

void setHeight(int *r, int n)
{
    int i, j, k;
    for(i = 0; i <= n; i++)
        rk[sa[i]] = i;
    for(i=0, k=0; i < n; height[rk[i++]] = k)
        for(k = k?k-1: 0, j = sa[rk[i]-1]; r[i+k] == r[j+k]; k++);
}

int minv[21][M];

void setRMQ(int n)
{
    mp[0] = -1;
    int i, j, a, b, x, y;
    for(i = 1; i <= n; i++)
        if((i&(i-1)) == 0) mp[i] = mp[i-1] + 1;
        else mp[i] = mp[i-1];
    for(i = 0; i <= n; i++) RMQ[0][i] = height[i], minv[0][i] = sa[i];
    for(j = 1; j <= mp[n]; j++)
        for(i = 0; i+(1<<j)-1<=n; i++){
            a = RMQ[j-1][i]; x = minv[j-1][i];
            b = RMQ[j-1][i+(1<<(j-1))]; y = minv[j-1][i+(1<<(j-1))];
            RMQ[j][i] = min(a, b);
            minv[j][i] = min( x, y );
        }
}

int find(int a, int b)
{
    if( a > b ) swap( a, b );
    if( a == b ) return M;
    ++a;
    int j = mp[b-a+1];
    int x = RMQ[j][a];
     b -= (1<<j) - 1;
    int y = RMQ[j][b];
    return min(x, y);
}
int fMin( int a, int b )
{
    int j = mp[ b - a + 1 ];
    int x = minv[j][a];
    b -= ( 1 << j ) - 1;
    int y = minv[j][b];
    return min( x, y );
}

void init( int n )
{
    sum[0] = 0;
    for( int i = 1; i <= n; ++i ){
        sum[i] = n - sa[i] - height[i];
        sum[i] += sum[i-1];
    }
}

int l, r;
void cal( LL k, int n )
{
    if( k > sum[n] ){
        l = 0, r = 0;
        return;
    }
    int x, y, mid;
    int i = lower_bound( sum, sum + 1 + n, k ) - sum;
    l = sa[i];
    x = sum[i] - sum[i-1];
    r = l + height[i] + x - 1;
    //++l, ++r;
    x = 0, y = i, mid;
    while( y > x ){
        mid = ( x + y ) >> 1;
        if( find( mid, i ) >= r - l + 1 ) y = mid;
        else x = mid + 1;
    }
    int ll = x;
    x = i, y = n;
    while( y > x ){
        mid = ( x + y + 1 ) >> 1;
        if( find( i, mid ) >= r - l + 1 ) x = mid;
        else y = mid - 1;
    }
    int rr = y;
    
    x = fMin( ll, rr );
    y = x + r - l;

    l = x, r = y;
    ++l, ++r;
}
int main()
{
    int n, m, len;
    LL k;
    while( scanf( "%s", s ) == 1 ){
        int n = strlen( s );
        for( int i = 0; i < n; ++i ) a[i] = s[i] - 'a' + 1;
        a[n] = 0;
        suffix( a, n + 1, 30 );
        setHeight( a, n );
        setRMQ( n );
        init( n );
        scanf( "%d", &m );
        l = r = 0;
        while( m-- ){
            scanf( "%lld", &k );
            k = ( k ^ l ^ r ) + 1;
            cal( k, n );
            printf( "%d %d\n", l, r );
        }
    }
}

C++: #include <iostream>

using namespace std;

int main()
{
cin >>;
    cout <<;
 
}

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

int main() {
	for(int i=1;i<=9;i++){
		for(int s=1;s<=9;s++){
			cout << i << "x" << s << "=" << i * s << 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 <stdio.h>

#define FOR(i,a,b) for(int i=(int)a;i<(int)b;++i)
#define REP(i,n) FOR(i,0,n)

int main()
{
  FOR(i,1,10) {
    FOR(j,1,10) {
      printf("%dx%d=%d\n",i,j,i*j);
    }
  }
  return 0;
}

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

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

  return 0;
}

C++: #include <cstdio>

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 <cstdio>
#include <cstring>

char a[60][60];
int dx[]={0,0,1,-1},dy[]={1,-1,0,0};//r,l,d,u;

int main()
{
    int n,i,j,k;
    int tmpx,tmpy,ans,legal,lenth[5];
    while(1)
    {
        scanf("%d",&n);
        if(!n) break;
        ans=0;
        for(i=0;i<n;i++) scanf("%s",a[i]);
        for(i=0;i<n;i++)
            for(j=0;j<n;j++)
            {
                if(a[i][j]!='#') continue;
                legal=1;
                for(k=0;k<4;k++) lenth[k]=0;

                tmpx=i,tmpy=j;
                while(1)
                {
                    tmpx+=dx[0],tmpy+=dy[0];
                    if(tmpx<0||tmpx>=n||tmpy<0||tmpy>=n||a[tmpx][tmpy]!='#') break;
                    lenth[0]++;
                    if((tmpx-1>=0&&a[tmpx-1][tmpy]=='#')||(tmpx+1<n&&a[tmpx+1][tmpy]=='#'))
                    {
                        legal=0;
                        break;
                    }
                }

                tmpx=i,tmpy=j;
                while(1)
                {
                    tmpx+=dx[1],tmpy+=dy[1];
                    if(tmpx<0||tmpx>=n||tmpy<0||tmpy>=n||a[tmpx][tmpy]!='#') break;
                    lenth[1]++;
                    if((tmpx-1>=0&&a[tmpx-1][tmpy]=='#')||(tmpx+1<n&&a[tmpx+1][tmpy]=='#'))
                    {
                        legal=0;
                        break;
                    }
                }

                tmpx=i,tmpy=j;
                while(1)
                {
                    tmpx+=dx[2],tmpy+=dy[2];
                    if(tmpx<0||tmpx>=n||tmpy<0||tmpy>=n||a[tmpx][tmpy]!='#') break;
                    lenth[2]++;
                    if((tmpy-1>=0&&a[tmpx][tmpy-1]=='#')||(tmpy+1<n&&a[tmpx][tmpy+1]=='#'))
                    {
                        legal=0;
                        break;
                    }
                }

                tmpx=i,tmpy=j;
                while(1)
                {
                    tmpx+=dx[3],tmpy+=dy[3];
                    if(tmpx<0||tmpx>=n||tmpy<0||tmpy>=n||a[tmpx][tmpy]!='#') break;
                    lenth[3]++;
                    if((tmpy-1>=0&&a[tmpx][tmpy-1]=='#')||(tmpy+1<n&&a[tmpx][tmpy+1]=='#'))
                    {
                        legal=0;
                        break;
                    }
                }
                printf("\n%d %d:\n",i,j);
                for(i=0;i<4;i++) printf("%d ",lenth[i]);
                printf("\n");
                if(!legal) continue;
                if(lenth[0]>0&&lenth[0]==lenth[1]&&lenth[1]==lenth[2]&&lenth[2]==lenth[3])
                    ans++;
            }
        printf("%d\n",ans);
    }
    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;
        }
    }
}

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

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

    return 0;
}