Go: package main

import (
	"fmt"
)

func main() {
	for i := 0; i < 9; i++ {
		for j := 0; j < 9; j++ {
			fmt.Printf("%dx%d=%d\n", i, j, 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 <stdio.h>
#include <iostream>

void main() {
	for (int i = 1; i < 9; i++)
	{
		std::cout << i * i << std::endl;
	}
	return;
}

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;
	int x;
	int y;
	for (i = 1; i <= 9; i++){
		for (x = 1; x <= 9; x++){

			y = i*x;
                        cout << i << "??" << x << "???" << y<<endl;

		}
	}
	return 0;
}

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>

int main(int, char**) {
  for(int i=0; i<10; ++i) {
   std::cout << i << "x" << i << "=" << (i*i)  << std::endl;;
  }
}

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

#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORTASC(c) sort((c).begin(), (c).end())
#define SORTDESC(c, t) sort((c).begin(), (c).end(), std::greater<t>());
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
                      << " " << __FILE__ << endl;

const double PI = acos(-1.0);

using ll = long long;
using namespace std;

int main()
{
    FOR(i, 1, 10){
        FOR(j, 1, 10){
            cout << i << "x" << j << "=" << i*j << endl;
        }
    }

    return 0;
}

C++: #include<iostream>

using namespace std;

int main(){

	for(int i1=0 ; i1<9 ; i1++){
		for(int i2=0 ; i2<9 ; i2++){
			cout << i1+1 << 'x' << i2+1 << '=' << (i1+1)*(i2+1) << 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<iostream>
using namespace std;

int main(){
	int i,j;
	
	for(i=1;i<10;i++){
		for(j=1;j<10;j++){
	cout <<i<<"x"<<j<<"="<<i*j<<"\n"<< endl;
		}
	}

    return 0;
}

C++: int main(){
auto x = 1;
return 0;
}

C++: #include<iostream>
#include<cstdio>

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 <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 <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);
	
	return 0;
}

C++: #include <iostream>
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(){
  int i,j;
  for(i=0;i<10;i++){
    for(j=0;j<10;j++){
        cout<<i<<'x'<<i<<'='<<i*i<<endl;
      }
   }
}

C++: #include <stdio.h>

int main(void)
{
	int a, b;
	a = 1;
	b = 1;
	
	while (a < 10) {
		while (b < 10) {
			printf("%dx%d=%d\n", a, b, a * b);
			++b;
		}
		++a;
		b = 1;
	}

	return 0;
}

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

int main() {
	int i, k;
	for (i = 1; i < 10; i++) {
		for (k = 1; k < 10; k++) {
			std::cout << i << "x" << k << "=" << i * k << std::endl;
		}
	}
	return 0;
}

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

void QQ()
{
    for(int i=1; i<10; i++)
        for(int j=1; j<10; j++)
    {
        cout<<i<<"x"<<j<<"="<<i*j<<endl;
    }
}


int main(){

    QQ();
    return 0;
}

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

int kakezan(int x) {
  int a;
  for (int i = 1; i <= 9; i++) {
    a = x * i;
    cout << x;
    cout << "x";
    cout << i;
    cout << "=";
    cout << a;
    cout << endl;
  }

  return 0;
}

int main(){
  for (int k = 1; k <= 9; k++) {
    kakezan(k);
  }

  return 0;
}

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

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

for($i = 1; $i < 10; $i++){
	for($j = 1; $j < 10; $j++){
		$sum = $i*$j;
		echo "{$i}x{$j}={$sum}<br>";
	}
}

 ?>

C++: #include<stdio.h>

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++: main(){__builtin_puts("1x1=1\n1x2=2\n1x3=3\n1x4=4\n1x5=5\n1x6=6\n1x7=7\n1x8=8\n1x9=9\n2x1=2\n2x2=4\n2x3=6\n2x4=8\n2x5=10\n2x6=12\n2x7=14\n2x8=16\n2x9=18\n3x1=3\n3x2=6\n3x3=9\n3x4=12\n3x5=15\n3x6=18\n3x7=21\n3x8=24\n3x9=27\n4x1=4\n4x2=8\n4x3=12\n4x4=16\n4x5=20\n4x6=24\n4x7=28\n4x8=32\n4x9=36\n5x1=5\n5x2=10\n5x3=15\n5x4=20\n5x5=25\n5x6=30\n5x7=35\n5x8=40\n5x9=45\n6x1=6\n6x2=12\n6x3=18\n6x4=24\n6x5=30\n6x6=36\n6x7=42\n6x8=48\n6x9=54\n7x1=7\n7x2=14\n7x3=21\n7x4=28\n7x5=35\n7x6=42\n7x7=49\n7x8=56\n7x9=63\n8x1=8\n8x2=16\n8x3=24\n8x4=32\n8x5=40\n8x6=48\n8x7=56\n8x8=64\n8x9=72\n9x1=9\n9x2=18\n9x3=27\n9x4=36\n9x5=45\n9x6=54\n9x7=63\n9x8=72\n9x9=81\n");}

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