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 <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() {
	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 <stdio.h>

int main(void){

	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 <iostream>
#include <Windows.h>
#define DEBUG 0
using namespace std;

int main(void)
{
	for (int i = 1; i <= 9; ++i) {
		for (int j = 1; j <= 9; ++j) {
			cout << i << "x" << j << "=" << i*j << endl;
		}
	}
#if DEBUG
	system("pause");
#endif

	return 0;
}

C++: //#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
//#include <cmath>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
#include <list>
#include <queue>
#include <set>
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;
}

/*
for(i=0;i<N;i++){
cin >> X[i];
}


for(i=0;i<N;i++){
for(j=0;j<N;j++){
cin >> X[i][j];
}
}
*/

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

C++: /*
 * ITP1_1_D.c
 *
 *  Created on: 2017/05/11
 *      Author: sl2-user
 */
#include<stdio.h>

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

C++: #include <bits/stdc++.h>
using namespace std;

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

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 <stdio.h>

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

C++: #define _USE_MATH_DEFINES
#define INF 0x3f3f3f3f
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#include <bitset>
#include <list>

using namespace std;

typedef long long ll;
typedef pair<int,string> P;

const static ll MOD = 1000000007;

class BinaryIndexedTree {
private:
  int* bit;
  int n;
public:
  BinaryIndexedTree(int _size){
    bit = new int[_size];
    n = _size;
    fill(bit,bit+_size,0);
  }
  int sum(int i){
    int s = 0;
    while(i > 0){
      s += bit[i];
      i -= i & -i;
    }
    return s;
  }
  
  void add(int i, int x){
    while(i <= n){
      bit[i] += x;
      i += i & -i;
    }
  }
};

int main(){
  int N,R;
  ll dp[100001];
  ll target[100001];

  while(~scanf("%d %d",&N,&R)){
    if(N == 0) break;

    memset(dp,0,sizeof(dp));
    dp[0] = 1;

    for(int i=1;i<=N;i++){
      target[i] = i;
      // 4
      // v v v v
      //  1 2 3
      dp[i] = dp[i-1] * i % MOD;
    }
    for(int r = 0; r< R;r++){
      int from_idx;
      int to_idx;
      scanf("%d %d",&from_idx,&to_idx);
      swap(target[from_idx],target[to_idx]);
    }

    ll res = 0;
    BinaryIndexedTree BIT(100001);
    for(int i=N,j=0;i>=1;i--,j++){
      res += ((dp[j] % MOD) * (BIT.sum(target[i] - 1) % MOD) % MOD);
      res %= MOD;
      BIT.add(target[i],1);
    }
    printf("%lld\n",res);
  }
}

C++: #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#define ll long long
using namespace std;
int main()
{
    //int k,i,j,tep,x,a[170],m;
    int a,b,c,d,e,f,n;
   // long long int n;
    for(a=1;a<=9;a++)
        for(b=1;b<=9;b++)
          cout<<a<<"x"<<b<<"="<<a*b<<endl;
   // cout<<endl;

    return 0;
}

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

void QQ(int i,int j){
	if(1 <= i){ QQ(i - 1, j)};
	if(1 <= j){ QQ(i, j - 1)};
	cout << i << "x" << j << "=" << i*j << endl;
}

int main(){
    QQ(9,9);
    return 0;
}

C++: #include <iostream>
#include <stdio.h>
using namespace std;
int main(void){
    // Here your code !
    for(int i=0;i<9;i++) {
        for(int j=0;j<9;j++) {
            printf("%dx%d=%d\n", i+1, j+1, (i+1)*(j+1));
        }
    }
}

C++: #include <iostream>
#include <stdio.h>
#include <string>
#include <math.h>
#include <algorithm>
using namespace std;
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(){
    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 <bits/stdc++.h>

using namespace std;

int array[64][1024][1024];
#define rep(i, v) for (int i = 0; i < v; i++)
int main()
{
        int N;

        scanf("%d", &N);
        rep(i, 64) rep(j, 1024) rep(k, 1024) array[i][j][k] = i * j * k;
        for (int i = 0; i < N; i++) printf("A\n");

        return (0);
}

C++: source

C++: #include<iostream>
#include<cstdlib>
#include<cstring>
#include<stack>
#include<queue>
#include<algorithm>
#include<vector>
#include<math.h>
#include<bitset>
using namespace std;

typedef stack<int> IntStack;
typedef queue<int> IntQueue;

/*ここまでテンプレ*//*ここまでテンプレ*//*ここまでテンプレ*//*ここまでテンプレ*/



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