Go: package main

import (
	"fmt"
)

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

C++: #include <bits/stdc++.h>
using namespace std;
void solve()
{
for(int i=1; i<10; i++)
for(int j=1;j<10; j++)
cout << i << "x" << j << "=" << i*j << endl;
}
int main() {
unordered_map<int, int> umap;

solve();
return 0;
}

C++: #include <cstdio>
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(void){
	for (int i = 1; i <= 9; i++){
		for (int j = 1; j <= 9; j++){
			std::cout << i<<"x"<<i<<"="<< i << endl;
		}
	}

	return 0;
}

C++: #include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#define ll long long
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define ll long long

#define INF 999999999

using namespace std;

int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
// input

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    FOR(i, 1, 10)
    {
        FOR(j, 1, 10)
        {
            cout << i << "x" << j << "=" << i * j << "\n";
        }
    }
}

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

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

C++: #include<bits/stdc++.h>
#define ll long long int
#define FOR(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n)
using namespace std;
 /*temp*/

int main(){
    REP1(i,10){
        REP1(j,10){
            cout << i << 'x' << j << '=' << i*j << '\n';
        }
    }
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
int a = 1;
for(int i = 0; i < 1e9; i++){
a *= 10;
a %= 10000;
}
return 0;
}

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

C++: #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
const int    INF = 100000000;
const double EPS = 1e-10;
const int    MOD = 1000000007;
using namespace std;
typedef pair<int,int> P;

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

C++: #inclde<iostream>
using namespace std;
int main()
{int c,i;
for(i=1;i<10;i++)
{c=1*i
cout<<"1x"<<i<<"="<<c<<endl;
}
for(i=1;i<;i++)
{c=2*i
cout<<"2x"<<i<<"="<<c<<endl;
}
for(i=1;i<;i++)
{c=3*i
cout<<"3x"<<i<<"="<<c<<endl;
}
for(i=1;i<;i++)
{c=4*i
cout<<"4x"<<i<<"="<<c<<endl;
}
for(i=1;i<;i++)
{c=5*i
cout<<"5x"<<i<<"="<<c<<endl;
}
for(i=1;i<;i++)
{c=6*i
cout<<"6x"<<i<<"="<<c<<endl;
}
for(i=1;i<;i++)
{c=7*i
cout<<"7x"<<i<<"="<<c<<endl;
}
for(i=1;i<;i++)
{c=8*i
cout<<"8x"<<i<<"="<<c<<endl;
}
for(i=1;i<;i++)
{c=9*i
cout<<"9x"<<i<<"="<<c<<endl;
}
return 0;
}

C++: #include<stdio.h>
#include<string.h>
#include<math.h>
#include<iostream>
#include<algorithm>
#include<set>
#include<queue>
#include<string>
#include<vector>
#include<map>
#include<stack>
#include<list>
using namespace std;
#define inf 0x3f3f3f3f

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

C++: #include <iostream>
 
using namespace std;
 
int main(){
   for(int i=1; i<=9; i++){
     for(int j=0; j<=9; j++){
         printf("%d\n",i*j);
      }
   }


return 0;
}

C++: #include <cstring>

int a[100000000];

int main()
{
memset(a, -1, sizeof(a));
return 0;
}

C++: import java.util.*;
public class Main{
	public static void main(String args[]){
		ArrayList[] a;
		a=new ArrayList[10];
		a[1]=new ArrayList<Integer>();
		//a[1].add(3);
		for(int i=1;i<=9;i++){
			for(int j=1;j<=9;j++){
				System.out.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<<"x"<<j<<"="<<i*j<<endl;}}
return 0;}

C++: - submit, private

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++: import java.io.*;
class a0000{
	public static void main(String[] args){
		for(int i=1;i<10;i++)
		for(int j=1;j<10;j++)
		System.out.println(i+"x"+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>

using namespace std;

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

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

C++: #include <iostream>

using namespace std;

int main(){
	int a;
	for(int i=1;i<=9;i++){
		for(int j=1;j<=9;j++){
			a=i*j;
			cout <<i<<"x"<<j<<"="<<a<<endl;
		}
	}
	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>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<functional>
#include<algorithm>
#include<cstdio>
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 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)
{
for(int f1=1;f1<=9;f1++){
for(int f2=1;f2<=9;f2++){
printf("%dx%d=%d\n",f1,f2,f1*f2);
return 0;
}