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

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>
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<stdio.h>

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

C++: #include<stdio.h>

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


    return 0;
}

C++: #include <stdlib.h>

int main(){system("cat 0000.txt");}

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++: #include<iostream>
#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
using namespace std;

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

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

C++: 
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

#define rep(i,n) for(int i = 0; i < n; i++)
#define REP(i,j,n) for(int i = j; i < n; i++)


int main(){

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

	return 0;
}

C++: #define _USE_MATH_DEFINES
#include <iostream>
#include <vector>
#include <math.h>
#include <string>
#include <string.h>
#include <stack>
#include <algorithm>
#include <stdio.h>
#include <functional>
using namespace std;

//??°?????????????????°

void function()
{
    //??¢??°
}
 
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++: public class Main {
	
	public static void main(String[] args){
		
		 for(int i=1; i<=9; ++i) for(int n=1; n<=9; ++n)        System.out.println(i+"x"+n+"="+i*n);
		}
}

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

int main(){
    int i,j;   
    for(i=1;i<10;i++){
        for(j=1;j<11;j++){
            cout<<i<<"*"<<j<<"="<<i*j<<endl;
        }
    }
    return 0;
}

C++: #include <iostream>

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

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

int main(){
for(int i=10;i++<100)cout<<i/10<<"x"<<i%10<<i/10*1%10<<endl;
return 0;
}

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

using namespace std;

int level[6][2]={{100,85},{84,80},{79,75},{74,70},{69,60},{59,0}};

int main()
{
    int T_T;
    scanf("%d",&T_T);
    while(T_T--)
    {
        int f,n;
        double mi=20.,mx=-20.;
        scanf("%d%d",&f,&n);
        for(int l1=0;l1<=n;l1++)
        {
            int res1=n-l1;
            for(int l2=0;l2<=res1;l2++)
            {
                int res2=n-l1-l2;
                for(int l3=0;l3<=res2;l3++)
                {
                    int res3=n-l1-l2-l3;
                    for(int l4=0;l4<=res3;l4++)
                    {
                        int res4=n-l1-l2-l3-l4;
                        for(int l5=0;l5<=res4;l5++)
                        {
                            int l6=0;
                          //  printf("%d %d %d %d %d %d \n",l1,l2,l3,l4,l5,l6);
                            int minsorce=level[0][1]*l1+level[1][1]*l2+level[2][1]*l3+
                            level[3][1]*l4+level[4][1]*l5+level[5][1]*l6;
                            int maxsorce=level[0][0]*l1+level[1][0]*l2+level[2][0]*l3+
                            level[3][0]*l4+level[4][0]*l5+level[5][0]*l6;
                           // printf("%d %d %d %d %d %d \n",level[0][0]*l1,level[1][0]*l2,level[2][0]*l3,
                           // level[3][0]*l4,level[4][0]*l5,level[5][0]);
                           // cout<<minsorce<<" <---> "<<maxsorce<<endl;
                            if(f*n<=maxsorce&&f*n>=minsorce)
                            {
                                 mi=min(mi,(4.*l1+3.5*l2+3.*l3+2.5*l4+2.*l5)/n);
                                mx=max(mx,(4.*l1+3.5*l2+3.*l3+2.5*l4+2.*l5)/n);
                                if((4.*l1+3.5*l2+3.*l3+2.5*l4+2.*l5)/n<=2.000)
                                {
                                cout<<"mi: "<<mi<<endl;
                                printf("%d %d %d %d %d %d \n",l1,l2,l3,l4,l5,l6);
                                cout<<"credit: "<<4.*l1+3.5*l2+3.*l3+2.5*l4+2.*l5<<endl;
                                cout<<minsorce<<" <-"<< f*n <<"--> "<<maxsorce<<endl;

                                }
                            }
                        }
                    }
                }
            }
        }
        printf("%.4lf %.4lf\n",mi,mx);
    }
    return 0;
}

C++: #define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <iostream>
#include <vector>
#include <list>
#include <map>
#include<string>
#include <algorithm>
#include <functional>
#include <cmath>
using namespace std;
typedef vector <int> ivector;

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