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

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 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++: #include<iostream>
using namespace std;

int main(){

    return 0;
}

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

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

C++: #include <iostream>
using namespace std;
int main(void){
    int x;
    for(int m=1;m<10;m++){
        for(int n=1;n<10;n++){
            x=m*n;
            cout <<m<<"x"<<n<<"="<<x<<endl;
        }
    }
}

C++: #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include "boost/format.hpp"

using namespace std;

int main()
{
	vector<string> sv;
	for (int i = 1; i <= 9; i++){
		for (int j = 1; j <= 9; j++){
			string temp = (boost::format("%1%%2%%3%%4%%5%%6%") % i % '*' % j % '=' % (i*j) % '\n').str();
			sv.push_back(temp);
		}
	}

	for_each(sv.begin(), sv.end() ,
		[](string tmp){
		cout << tmp;
		}
	);
	getchar();
}

C++: #include<stdio.h>

int main(){

	for(int i=1; i<10; i++)
	{	
		for(int j=1; j<10; j++)
		{
			printf("%d*%d = %d",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.h>
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 << "\n";
        }
    }
    
    
    return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
  for (int a=1; a<=9; a++){
    for (int b=1; b<=9; b++){
      cout << a << "x" << b << "=" << a*b << endl;
    }
    
  }
  
  
  
  
  
}

C++: #include<iostream>
#include<cstdio>
#include<algorithm>
#include<climits>
#include<string>
#include<vector>
#include<list>
#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<cstring>
using namespace std;

signed main(){
    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<<"*"<<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++: 

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

 
Compile Error Logs: 


 
 
Status 
Judge: 1/1  C++  CPU: 00.00 sec  Memory: 3036 KB  Length: 193 B  2017-03-15 15:52  2017-03-15 15:52  
Results for testcases 
Case # Verdict CPU Time Memory In Out Case Name

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

int main(){
for(int i = 1;i<10;i++)
for(int j = 1;j<10;j++)
{
 printf("%d ?? %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++: #include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 999999999
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define SORT(c) sort((c).begin(),(c).end())
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> Vi;
int a[100][100];
int main(){
  FOR(i,1,10){
	  FOR(j,1,10){
		  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("%d x %d=%d", i, j, i * j);
}
}

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>
#define rep(i,a,b) for(int i=a;i<b;i++)
using namespace std;
int main(){
	rep(i,1,10)
	rep(j,1,10)
	cout<<i<<'x'<<j<<'='<<i*j<<endl;
	return 0;
}