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>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>

using namespace std;

const int MAXN = (int)1e3 + 10 ;


vector< pair<int,int> > e[MAXN] ;
int low[MAXN] , dfn[MAXN] , visit[MAXN] , step ;
vector<int> bg ;

int n , m ;

void tarjan(int u,int fa){
    bool flag = true ;
    visit[u] = 1 ;
    dfn[u] = low[u] = ++step ;
    for (int i = 0 ; i < e[u].size() ; i++){
        int v = e[u][i].first ;
        if (v == fa && flag){
            flag = false ;
            continue ;
        }
        if (!dfn[v]){
            tarjan(v,u) ;
            low[u] = min(low[u],low[v]);
            if (low[v] > dfn[u])
                bg.push_back(e[u][i].second) ;
        }else if (visit[v]==1)
            low[u] = min(low[u],dfn[v]) ;
    }
    visit[u]=2;
}

int main() {
	while (~scanf("%d%d",&n,&m)){
        if (n==0 && m==0) break ;
        for (int i = 0 ; i < n ; i++) e[i].clear() ;
        for (int i = 0 ; i < m ; i++){
            int u , v , w;
            scanf("%d%d%d",&u,&v,&w) ;
            u--; v--;
            e[u].push_back(make_pair(v,w)) ;
            e[v].push_back(make_pair(u,w)) ;
        }
        for (int i = 0 ; i < n ; i++) dfn[i] = visit[i] = 0 ; step = 0 ;
        bg.clear() ;
        int cnt = 0 ;
        for (int i = 0 ; i < n ; i++)
            if (!dfn[i]) { tarjan(i,-1) ; cnt++ ; }
        if (cnt>1){
            printf("0\n");
            continue ;
        }
        if (bg.size()==0)
            printf("-1\n");
        else {
            int mx = 0x3f3f3f3f ;
            for (int i = 0 ; i < bg.size() ; i++)
                if (bg[i] < mx) mx = bg[i] ;
            printf("%d\n",mx) ;
        }
	}
    return 0;
}

C++: f

C++: #include <iostream>

using namespace std;


int main(int argc, char **argv)
{
	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<cstdio>
int x=1,y=1;main(){if(y>=10)return 0;printf("%dx%d=%d\n",y,x,x*y);++x;(x==10)?x=1,++y:0;main();}

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

C++: #include <iostream>

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

C++: #include <iostream>
#include <queue>
#include <vector>
#include <set>
#include <algorithm>
#include <stdio.h>
//#define int long long
inline int in() { int32_t x; scanf("%d", &x); return x ;}
using namespace std;
//const int INF = 1e18;
const int MAX_N = 1e5 + 5;
int32_t main()
{
    for (int i = 1 ; i <= 9 ; i ++)
    {
        for (int x = 1 ; x <= 9 ; x ++)
        {
            printf("%d*%d=%d\n",i,x,i*x);
        }
    }
}

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

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

int main(void)
{
	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 <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 <= 9; i++)
	{
		for (size_t j = 1; j <= 9; j++)
		{
			int ans = i * j;
			cout << i << "x" << j << "=" << ans;
		}
	}
    return 0;
}

C++: #include<cstdio>
#include<iostream>
using namespace std;
int main()
{
    int ans=0,a,b,c,d,e,f;
    scanf("%d%d%d%d%d%d",&a,&b,&c,&d,&e,&f);
    if(a>b) swap(a,b);
    if(a>c) swap(a,c);
    if(a>d) swap(a,d);
    if(e>f) ans+=e;
    else ans+=f;
    ans+=b+c+d;
    printf("%d\n",ans);
    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(){
	
	int a,b,c;
	
	for (a=1; a<10; a++){
		
		for (b=1; b<10; b++){
			
			c=a*b;
			cout << a <<"x"<< b <<"="<< c <<"\n";
			
		}
	
	}
	
	return 0;
	
}

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

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

    return 0;
}

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

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

int main() {
	for (int i = 0; i < 9; ++i) {
		for (int j = 0; j < 9; ++j) {
			cout << i + 1 << 'x' << j + 1 << '=' << (i + 1)*(j + 1) << endl;
		}
	}
	return 0;
}

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

C++: #include <iostream>
#include <queue>
#include <vector>
#include <set>
#include <algorithm>
#include <stdio.h>
//#define int long long
inline int in() { int32_t x; scanf("%d", &x); return x ;}
using namespace std;
const int INF = 1e18;
const int MAX_N = 1e5 + 5;
int32_t main()
{
    for (int i = 1 ; i <= 9 ; i ++)
    {
        for (int x = 1 ; x <= 9 ; x ++)
        {
            printf("%d*%d=%d\n",i,x,i*x);
        }
    }
}

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\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++){
			cout << i << "*" << j << "=" << i * j << endl;
		}
	}
	return 0;
}

C++: #include<stdio.h>
main(i){}

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++: ????????????????????????????????????????????????

C++: #include <stdio.h>
  
int main(void)
{
 
  float x, y;
 
  /* a,b */
  printf("a: x = ");
  scanf("%f", &x);
  printf("b: y = ");
  scanf("%f", &y);
 
  /* 掛け算の計算・出力 */
  printf("x * y = %.3f\n", x*y);
 
  /* 割り算の計算・出力 */
  printf("x / y = %.3f\n", x/y);
 
  return 0;
}

C++: #include<iostream>

using namespace std;

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

C++: #include <iostream>

int main() {
    for( int i = 1 ; i <= 9 ; i++ ) {
        for( int ii = 1 : ii <= 9 ; ii++ ) {
            std::cout << i << "x" << ii << "=" << i * ii << std::endl ;
        }
    }
}

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(){
int i;
int 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 <cstdio>
#include <iostream>
#include <algorithm>

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) {
            cout << i << 'x' << j << '=' << i * j << endl;
        }
    }
    return 0;
}

C++: #include <iostream>

using namespace std;

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

	}
	return 0;
}