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

C++: #include <cstdio>
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);
	}
}

C++: #include <stdio.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <math.h>
#include <string>
#include <string.h>
#include <queue>
#include <map>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define MAX_N 105
int vx [4]= {1,0,-1,0};
int vy [4]= {0,1,0,-1};
long long  dp[MAX_N][4][4];//dp[date][today][yesterday]
int V[MAX_N],W[MAX_N];
int data[MAX_N],B[MAX_N];
int K ,N;
using namespace std;
void init(){
}
void solve(){
  init();
  FOR(i,1,10)FOR(x,1,10)cout<<i<<"テδ?<<x << '='<<i*x<<endl;

}
int main(){
    solve();
}

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++: /*
 * http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0000
 */
#include<iostream>
#define B 9
using namespace std;
int main(){
  for(int i=0;i<B*B;cout<<(i/B+1)<<'x'<<(i%B+1)<<'='<<(i/B+1)*(i%B+1)<<endl,i++){}
  return 0;
}

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++: # -*-coding: utf8 -*-
for i in xrange(1, 10):
    for j in xrange(1, 10):
        print "%d??%d=%d" % (i, j, i * j)

C++: #include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
using namespace std;
#define N 120
const double eps = 1e-9;

inline int sig(double x){
    return (x>eps)-(x<-eps);
}

struct node{
    int x1, x2, y1, y2;
    double k, c;
    void in(){
        scanf("%d %d %d %d", &x1, &y1, &x2, &y2);
    }
    void get_kc(){
        k = (y2-y1)*1.0/(x2-x1);
        c = y2*1.0 - k*x2;
    }
};
node p[N], que[N];
int w, n;

bool cmp(node a, node b)
{
    if(fabs(a.k-b.k) < eps) return a.c > b.c;
    else    return a.k > b.k;
}

void deal()
{
    int i, ct = 0, ps;
    sort(p, p+n, cmp);
    que[++ct] = p[0];
    for(i = 1; i < n; i++)
    {
        if(fabs(p[i].k-que[ct].k) < eps && fabs(p[i].c-que[ct].c) < eps)
            continue;
        else    que[++ct] = p[i];
    }
    //cout << "...ct " << ct << endl;
    int cnt, kps;
    if(fabs(que[ct].k-que[0].k) < eps)
    {
        if(ct+1 >= w) puts("0");
        else
        {
            cnt = 0, kps = ct;
            while(kps < w){
                cnt++;
                kps = ((ct+cnt)<<1);
            }
            printf("%d\n", cnt);
            return ;
        }
    }
    else
    {
        ps = (ct<<1);
        if(ps >= w) puts("0");
        else{
            cnt = 0, kps = ct;
            while(kps < w){
                cnt++;
                kps = ((ct+cnt)<<1);
            }
            printf("%d\n", cnt);
            return ;
        }
    }
    return ;
}

int main()
{
    freopen("in.txt", "r", stdin);
    while(~scanf("%d %d", &w, &n))
    {
        for(int i = 0; i < n; i++) {
            p[i].in();
            p[i].get_kc();
        }
        deal();
    }
    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;
		}
	}

}

C++: #include<stdio.h>
int main(void)
{
    int i,j;
    for(i = 1; i <= 9; i++){
        for(j = 1; j <= 9; j++){
            printf("%d x %d = %d",i,j,i*j);
        }
        printf("\n");
    }
    return 0;
}

C++: #include <stdio.h>
 
int i, j;
int main() {
 
for(i=1; i<9+1; i++) {
for(j=1; j<9+1; 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 = 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(){

int i,j,p;

for(i=1; i<10; i++){
  for(j=1; j<10; j++){
    p=i*j;
    cout << i << "x" <<j << "=" << p <<"\n";
  }
}

    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 << "x" << j << "=" << i * j << endl;
        }
    }
    return 0;
}

C++: i = range(1,10)
for  i in ['%dx%d=%d' % (x,y,x*y) for x in i for y in i]:
    print i

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

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

int main(){
int val=0;
for(int i=1;i<=9;i++){
for(int j=1;j<=9;j++){
if(i>=j)
cout << i << "x" << j << "="<<i*j<<std::endl;
else
break;
}
}
    return 0;
}

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

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