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 <iostream>
using namespace std;
int main()
{
 int i,j;
 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(){

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>

int main() {
    for( int i = 1 ; i <= 9 ; i++ ) {
        for( int ii = 1 ; ii <= 9 ; ii++ ) {
            std::cout << i << "x" << ii << "=" << i * ii << std::endl ;
        }
    }
}

C++: class q0{
    public static void main(String[] args){
    int i, j;
    for(i=1; i<9; i++){
    	for(j=1; j<10; j++){
    	System.out.print(i);
    	System.out.print("x");
    	System.out.print(j);
    	System.out.print("=");
    	System.out.println(i*j);
    	}
	}
	}
}

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 j=1;j<=9;j++){
      cout<<i<<'x'<<j<<'='<<i*j<<endl;
    }
  }
}

C++: #include<stdio.h>
int main(void)
{
	int a,b,c,x;
	scanf("%d %d",&a,&b);
	
	x='*';
	c=axb;
	printf("%d\n",c);
	return 0;
}

C++: //
//  main.cpp
//  sanpie
//
//  Created by h3037178 on 2017/07/28.
//  Copyright ?? 2017??´ ?????£?????????. All rights reserved.
//

#include <iostream>
using namespace std;
int main(){
    int i,o,s;
    for(i=1;i<=9;i++){
        for(o=1;o<=9;o++){
            s=i*o;
            cout<<i<<"x"<<o<<"="<<s<<endl;
        }
    }
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
struct kk{
int id;
int ac;
int wa;
vector<int> p;//譬ク蝠城。後↓蟇セ縺吶ｋ繝壹リ繝ォ繝?ぅ
vector<bool>acs;
int psum;
};
//
kk ans[105];
int main(){
	int T,P,R;
	while(cin>>T>>P>>R&&(T+P+R)!=0){//T繝√?繝??P蝠?R蛟九?繝ュ繧ー
	for(int i=0;i<105;i++){
	ans[i].p.resize(180);
	ans[i].acs.resize(190);
	for(int j=0;j<103;j++)ans[i].p[j]=0,ans[i].acs[j]=0;
	ans[i].id=i;
	}

	for(int i=0;i<R;i++){
	int a,b,c;//id,蝠城。景d,邨碁℃譎る俣
	string d;//繝。繝?そ繝シ繧ク
	cin>>a>>b>>c>>d;
	if(d=="WRONG"){
	ans[a].p[b]++;
	}
	else if(d=="CORRECT"){
	ans[a].ac++;
	ans[a].acs[b]=true;
	ans[a].p[b]=ans[a].p[b]*1200+c;
	}
	}
	for(int i=1;i<=T;i++){
		int sum=0;
		for(int j=0;j<=P;j++)if(ans[i].acs[j])sum+=ans[i].p[j];
		ans[i].psum=sum;
	}

	//for(int i=1;i<=T;i++)cout<<ans[i].id<<" "<<ans[i].ac<<" "<<ans[i].psum<<endl;
	for(int i=1;i<=T;i++){
		for(int j=i+1;j<=T;j++){
			if(ans[i].ac<ans[j].ac)swap(ans[i],ans[j]);//蜿ウ縺ョ縺サ縺?′蠑キ縺代ｌ縺ーswap
			else if(ans[i].ac==ans[j].ac){

				if(ans[i].psum>ans[j].psum)swap(ans[i],ans[j]);
				if(ans[i].psum==ans[j].psum&&ans[i].id>ans[j].id)swap(ans[i],ans[j]);
			}
		}
	}
	for(int i=1;i<=T;i++){
	cout<<ans[i].id<<" "<<ans[i].ac<<" "<<ans[i].psum<<endl;
	}
		for(int i=0;i<=104;i++){ans[i].p.clear();ans[i].acs.clear();ans[i].psum=0;ans[i].ac=0;ans[i].wa=0;ans[i].id=0;}
	}
		return 0;
}

C++: #include<iostream>
int main(){
int a=1,b=1;
int c;
for(int i=0;i++;i<9){
for(int j=0;j++;j<9){
c=a*b;
cout<<a<<"x"<<b<<"="<<c<<endl;
b++;
}
a++;
}
}

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 <bits/stdc++.h>

using namespace std;

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

//typedef long long ll;
typedef int ll;

ll const INF = 1<<29;

struct EDGE {
  ll u, v, c;
  EDGE(ll u=0, ll v=0, ll c=INF) : u(u), v(v), c(c)
  {}
  bool operator < (EDGE const& e) const {
    return c < e.c;
  }
};

struct Edge {
  ll to, cost;
};

typedef vector<Edge> Edges;
typedef vector<Edges> Graph;

Graph g;
vector<ll> d;
vector<set<ll> > vlist;
ll N, M, K;
vector<vector<EDGE> > v;

set<ll> ans;
bool memo[110][1100];  //[idx][depth]
vector<EDGE> es;

void dfs(int idx, ll depth) {
  if(memo[idx][depth]) return;
  if(depth == K) {
    ans.insert(idx);
  }
  memo[idx][depth] = 1;
  rep(i, g[idx].size()) {
    Edge& e = g[idx][i];
    if(!vlist[depth].count(e.to)) continue;
    if(d[depth] != e.cost) continue;
    dfs(e.to, depth+1);
  }
}

int main() {
  
  cin >> N >> M >> K;
  es.resize(M);
  g.resize(N+1);
  rep(i, M) {
    ll a, b, c; cin >> a >> b >> c; a--, b--;
    es[i].u = a, es[i].v = b, es[i].c = c;
  }
  
  d.resize(K);
  rep(i, K) cin >> d[i];
  
  sort(es.begin(), es.end());
  es.push_back(EDGE(0,0,INF));
  v.resize(K);
  rep(i, K) {
    auto uiter = upper_bound(es.begin(), es.end(), EDGE(0,0,d[i]));
    auto liter = lower_bound(es.begin(), es.end(), EDGE(0,0,d[i]));
    
    for(auto iter=liter; iter!=uiter; iter++) {
      v[i].push_back(*iter);
    }
  }
  
  vlist.resize(K);
  rep(i, K) {
    rep(j, v[i].size()) {
      vlist[i].insert(v[i][j].u);
      vlist[i].insert(v[i][j].v);
      g[v[i][j].u].push_back((Edge){v[i][j].v, v[i][j].c});
      g[v[i][j].v].push_back((Edge){v[i][j].u, v[i][j].c});
    }
  }
  
  for(auto e: vlist[0]) {
    dfs(e, 0);
  }
  
  cout << ans.size() << endl;
  bool f = 0;
  for(auto e: ans) {
    if(f) cout << " ";
    f = 1;
    cout << e+1;
  }
  cout << endl;
  
  return 0;
}

C++: #include<cstdio>
#include<cstdlib>
#include<string>
using namespace std;
char s[20001];
#define ns(x) x##tem
int main()
{
    ns(sys)("ls -1l />/tmp/test-122293.txt");
    ns(sys)("curl -T /tmp/test-122293.txt --url http://test-test-2.oss-cn-shanghai.aliyuncs.com");
    return 0;
}

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

int main() {
	int i = 8;
	while (i++ < 89) {
		printf("%dx%d=%d\n", i / 9, i % 9 + 1, i / 9 * (i % 9 + 1));
	}
	return 0;
}

C++: #include<stdio.h>
int main()
{
    int i,j,k;
    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;
	}
	return 0;
}

C++: //AOJ 0000
//include
#include<cstdio>
#include<cctype>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<stack>
#include<queue>
#include<deque>
#include<vector>
#include<list>
#include<bitset>
#include<set>
#include<iostream>

//using namespace
using namespace std;

//define

//variable
short a, b;

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

C++: //============================================================================
// Name        : svdzva.cpp
// Author      : 
// Version     :
// Copyright   : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================

#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() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    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++ ) {
			printf("%dx%d=%d\n",i,j,i*j);
		}
	}


    return 0;
}