Go: package main

import "fmt"

func main() {
    var max_num = 9
    for i := 1; i<= max_num; i++{
        for j := 1; j<= max_num; 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() {
#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>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
//ranker
using namespace std;

#define REPS(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (int i = (a); i >= n; --i)
#define DEP(i, n) DEPS(i, n, 0)

using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using pis = pair<int, string>;
using psi = pair<string, int>;
using D = double;


const int Max=10000000;
bool prime[Max];
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 <iostream>
#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 <iostream>
using namespace std;


int main(){
    for (int i = 1; i < 10; i++){
	for (int j = 1; j < 10; j++){
	    printf("%dx%d=%d", i, j, i*j);
	}
    }
}

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

int main(){
	long double d=1111.11111111111111111111111111111111111111111111111;
	printf("%.11451419lf\n",d);
}

C++: #include<boost\graph\edge_coloring.hpp>
#include<cstdio>

using namespace std;
using namespace boost;

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 <iostream>

int main(){
  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;
}

C++: #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",i,j,i*j);
		}
	}
	return 0;
}

C++: #include <iostream>
#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<bits/stdc++.h>
using namespace std;
int main()
{
    for(int i=1,j;i<=9;++i)
        for(j=1;j<=9;++j)
        printf("%dx%d=%d\n",i,j,i*j);
    return 0;
}

C++: #include <iostream>

int main(int argc, char **argv){
	for(int i = 1; i < 10; i++){
		for(int j = 1;j < 10; j++){
			std::cout << i << "x" << j << "=" << i * j;
			/* if(!(i == 9 && j == 9)){ */
				std::cout << std::endl;
			/* } */
		}
	}
}

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=0;i<81;i++)cout<<i/9+1<<'x'<<i%9+1<<'='<<(i/9+1)*(i%9+1)<<endl;
}

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 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 <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<iostream>

int main(){
	int a,b;
	for(a=1;a<=9;a++){
		for(b=1;b<=9;b++)
		std::cout<< a << "x" << b << "=" << a*b <<std::endl;
	}
	return 0;
	}

C++: package HelloWorld;

public class Main {

	public static void main(String[] args) {
		// TODO ?????????????????????????????????????????????

		for (int i = 1; i < 10 ; i++) {
			for (int j = 1; j < 10; j++)
			{
				System.out.println(i + "*" + j + "=" + i*j);
			}
		}
		
	
	}

}

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

int main(int argc, char const *argv[])
{
	for(int i = 1;i < 10;i++)
		for(int j = i;j < 10;j++)
			cout<<i<<"*"<<j<<"="<<i*j<<endl;
	return 0;
}

C++: object Main {
  def main(args: Array[String]): Unit = {
    for (i <- 1 to 9; j <- 1 to 9)
      println(i + "x" + j + "=" + i * j)
  }
}

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

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

int main(){
	int index,jndex;
	for(index = 1; index <= 9 ; index++){
		for(jndex = 1 ; jndex <= 9 ; jndex++){
			//cout<<index<<"x"<<jndex<<"="<<index*jndex<<endl;
			printf("%dx%d=%d\n",index,jndex,index*jndex);
		}
	}
	
}

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

int main() {
	// your code goes here
	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 a=1;a<=9;a++){
      for(int b=1;b<=9;b++){
            cout<<a<<"*"<<b<<"="<<a*b<<endl;
        }
}
return 0;
}

C++: #include <bits/stdc++.h>

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<iostream>
using std::cout;
using std::endl;

int main()
{
	for (int x = 1; x <= 9; x++)
	{
		for (int y = 1; y <= 9; y++)
		{
			cout << x << "??" << y << "???" << x*y << 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;
}