Go: package main

import "fmt"

var (
	min = 1
	max = 9
)

func main() {
	for i := min; i <= max; i++ {
		for j := min; j <= max; j++ {
			fmt.Printf("%dx%d=%d\n", i, j, i*j)
		}
	}
}

C++: #include <iostream>
using namespace std;
 
const int MAXN=1010;
const int MAXM=10010;
typedef struct{int v,next,rt,cost,bt,bv;}edge;
 
int N,M,eid;
int rt,w;//ä¸å®æ ¹
int p[MAXN],In[MAXN],ind[MAXN],hash[MAXN];;
edge e[MAXM];
bool vist[MAXN];
int clen;
 
inline void init(){eid=0;memset(p,-1,sizeof(p));}
 
inline void insert(int from , int to , int cost)
{
    if (from==to) return;
    e[eid].next=p[from];
    e[eid].v=to;
    e[eid].rt=from;
    e[eid].bv=to;
    e[eid].bt=from;
    e[eid].cost=cost;
    p[from]=eid++;
}
 
// å®æ ¹
// inline void dfs(int pos)
// {
//     int j;
//     for (j=p[pos];j!=-1;j=e[j].next)
//     {
//         if(!vist[e[j].v])
//         {
//             vist[e[j].v]=true;
//             dfs(e[j].v);
//         }
//     }
// }
int Cnt;
int st;
inline bool c_dfs(int pos)
{
    int x=ind[pos];
 
    if (x==-1)
    {
        return false;
    }
 
    int v=e[x].rt;
 
    if (!vist[v])
    {
        vist[v]=true;
        if(c_dfs(v))
        {
            hash[v]=Cnt;
            return true;
        }
        vist[v]=false;
    }
    else
    {
        return st==v;
    }
 
    return false;
}
 
int fit;
 
inline int Rtree()
{
    int i;
    //ä»¥ä¸ä¸ºä¸å®æ ¹
    ++w;
    rt=N;
    for (i=0;i<N;++i) insert(rt,i,w);
    ++N;
    ///////////////////
    //å®æ ¹ä¸ç¨
    //rt=0
    //memset(vist,0,sizeof(vist));    
    //vist[rt]=true;
    //dfs(rt);
    //for (i=0;i<N;++i) if(!vist[i]) {return -1;}
    ///////////////////
 
    int res=0;
    for (i=0;i<N;++i) hash[i]=i;
    bool flag=true;
 
    int bbt=rt;
    int ct;
 
    fit=INT_MAX;
 
    while(1)
    {
        ct=clen=Cnt=0;
        for (i=0;i<N;++i) In[i]=INT_MAX,ind[i]=-1;
 
        //æ¾æå°è¾¹
        for (i=0;i<eid;++i)
        {
            int ff=e[i].rt;
            int tt=e[i].v;
 
            if (ff==tt)
            {
                continue;
            }
 
            if (e[i].cost<In[tt])
            {
                In[tt]=e[i].cost;
                ind[tt]=i;    
            }
        }
 
        In[rt]=0;    
        ind[rt]=-1;
 
        for (i=0;i<N;++i)
        {
            int x=ind[i];
            if(x==-1) continue;
            if(e[x].bt==bbt)
            {
                ++ct;
                if(e[x].bv<fit) fit=e[x].bv;
            }
        }
 
        memset(vist,0,sizeof(vist));
 
        //æ¾ç¯
 
        for (i=0;i<N;++i)
        {
            if(!vist[i])
            {
                vist[i]=true;
                hash[i]=Cnt;
                st=i;
                if(c_dfs(i))
                {
                    ++clen;
                    ++Cnt;
                    continue;
                }
                vist[i]=false;
                ++Cnt;
            }
        }
 
        for (i=0;i<N;++i)
        {
            res+=In[i];
        }
 
        if (clen==0)
        {
            break;
        }
 
        //ç¼©ç¹å¹¶æ¹è¾¹
        for (i=0;i<eid;++i)
        {
            int ff,tt;
            ff=e[i].rt;
            tt=e[i].v;
            e[i].rt=hash[e[i].rt];
            e[i].v=hash[e[i].v];
 
            if (e[i].rt!=e[i].v)
            {
                e[i].cost-=In[tt];
            }
        }
 
        N=Cnt;
        rt=hash[rt];
    }
 
    if(ct!=1) return -1;
    return res-w;
}

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

int main()
{
    int i = 1;
    int j = 1;

    while (i < 10){
        while (j <= 9){
            cout << i << 'x' << j << '=' << i*j << endl;
            j ++ ;
        }
        if (j == 10){
            j = 1;
            i ++ ;
            }
    }
    return 0;
}

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

int main()
{
    ios_base::sync_with_stdio(false);

    for(int i=1; i<=9; i++)
        for(int j=1; j<=10; j++)
            cout << i<<"*"<<j<<"="<<i*j<<"\n";
    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>
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 << '*' << j << '=' << i*j << endl;
	return 0;
}

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

int main(){

	for(i=1;i<=9;i++){

		for(j=1;j<=9;j++){
				cout<<i<<"x"<<j<<"="<<endl;
				
				}
		

	}



    return 0;
}

C++: #include<iostream>
#include<cmath>
int main() {
	for (int i = 1; i <= 9; ++i) {
		for (int j = 1; j <= 9; ++j) {
			std::cout << i << "*" << j << "=" << i*j << std::endl;
		}
	}
	return 0;
}

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 <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<10;i++){
    for(int j=1;j<10;j++){

      cout <<i<<"x"<<j<<"="<<i*j<<endl;
    }
  }
  return 0;
}

C++: #include<stdio.h>
int main(void){

  int i;
  for(i=1;i<10;i++){
    printf("%dx1=%d\n",i,i*1);
    printf("%dx2=%d\n",i,i*2);
    printf("%dx3=%d\n",i,i*3);
    printf("%dx4=%d\n",i,i*4);
    printf("%dx5=%d\n",i,i*5);
    printf("%dx6=%d\n",i,i*6);
    printf("%dx7=%d\n",i,i*7);
    printf("%dx8=%d\n",i,i*8);
    printf("%dx9=%d\n",i,i*9);

  }


  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>
using namespase std;

int main{
return 0;
}

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;
			}
		}
	system("pause");
    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 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++)
		cout<<i<<"x"<<i<<"="<<i*i<<endl;
	return 0;
}

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

int main(){
while(1){}
}

C++: #include<iostream>

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

	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++){
           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;
}