Go: package main

import "fmt"


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

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

C++: #include <stdio.h>

int main(void) {
    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() {
  int a = 1;
  int b = 1;
  for () {
    cout << a << "x" << b << "=" << a*b << endl;
    ++b;
    if ( b = 10;) {
      ++a;
      int b = 1;
    } else if ( a == 9 && b == 10;) {
      break;
    }

  }

  return 0;
}

C++: #include<stdio.h>
int main(void)
{
	int a,b,c,;
	scanf("%d %d",&a,&b);
	
	x=*;
	c=axb;
	printf("%d\n",c);
	return 0;
}

C++: #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
using namespace std;
static const double EPS = 1e-5;
typedef long long ll;
#define FOR(i,n) for(i=0;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)

int main(){
	rep(i,9){
		rep(j,9){
			printf("%dx%d=%d\n",i+1,j+1,(i+1)*(j+1));
		}
	}
	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 << "\n";
    }
  }
  return 0;
}

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

#define fi first
#define se second
#define all(r) (r).begin(),(r).end()
#define vmax_v(ary) *max_element(all(ary))
#define vmin_v(ary) *min_element(all(ary))
#define vmax_id(ary) distance((ary).begin(),max_element(all(ary)))
#define vmin_id(ary) distance((ary).begin(),min_element(all(ary)))

using ll = int64_t;
using pll = pair<ll,ll>;
using vl = vector<ll>;

const ll INF=INT64_MAX;
const double EPS=1e-10;
const double PI=acos(-1.0);

void init(){cin.tie(0);ios::sync_with_stdio(false);}
//----------------------------------------------------

int main(){
    init();

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

C++: 
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <cmath>
#include <cstdio>
#include <string>
#include <sstream>

using namespace std;

#define rep(i, n) for(int i = 0; i < (int)n; ++i)
#define repn(i, n) for(int i = 1; i <= (int)n; ++i)
#define pb push_back
#define lb lower_bound
#define mp make_pair
#define ite iterator
#define max2(x, y) ((x) > (y)) ? (x) : (y)
#define max3(x,y,z) max2((x), max2((y),(z)))
#define max4(v,w,x,y) max2(max2((v),(w)), max2((x),(y)))
#define min2(x, y) ((x) > (y)) ? (y) : (x)
#define min3(x,y,z) min2((x), min2((y),(z)))
#define min4(v,w,x,y) min2(min2((v),(w)), min2((x),(y)))
#define ul unsigned long
#define ull unsigned long long
#define INF 1000000007
#define MOD 1000000007
#define fs first
#define sd second

template<typename T>
bool elem(set<T> st, T val){
	return (st.find(val) != st.end());
}

template<typename T>
void printv(vector<T> vt){
    rep(i, vt.size() - 1)
        cout << vt[i] << " ";
    cout << vt[vt.size() - 1] << endl;
}

typedef vector<int> vint;
typedef vector<ul> vul;
typedef vector<ull> vull;
typedef pair<int, int> pii;

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

C++: #include <iostream>
using namespace std;
int main()
{
	for(int i = 1; i<=9; i++)
	{
		for (int n = 1; n<= 9;n++)
		{
			cout<<i<<'x'<<n<<'='<<i*n<<endl;
		}
	}
	return 0;
}

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

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

    return 0;
}

C++: #include <stdio.h>
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);
    }
  }
}

C++: #include<stdio.h>

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

C++: #include <stdio.h>

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

C++: - submit, private

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1e9 + 7/*998244353*/;
const ll INF = 1LL << 60;
ll mod_pow(ll, ll, ll); ll mod_fact(ll, ll); ll mod_inv(ll, ll); ll gcd(ll, ll); ll lcm(ll, ll);
//
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 <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>

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

C++: #include<stdio.h>

    int main(){
    
            int x,y,z;
    
            for(x=1;x<=9;x++){
                    
                        for(y=1;y<=9;y++){
                                        
                            z=x*y;
                            printf("%d??%d=%d" " ",x,y,z);

                                        }
                 printf("\n");
                            }
         return 0;
                   }

C++: #include <cstdlib>  
#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<stdio.h>
int main(void){
	int a,b;
	for(a=1;a<10;a++){
		for(b=1;b<10;b++){
			printf("%dx%d=%d\n",a,b,a*b);
		}
	}
	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>
#include <math.h>
#include <stdio.h>
#include <string>
#include <string.h>
#include <algorithm>

using namespace std;

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

  return 0;
}

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