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


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

	for(i=1;i<=9;i++)
	{
		for(j=1;j<=10;j++)
		{
			if(i==9 && j==10)
                         {

			  }	
			printf("%d*%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>
#include <algorithm>
#include <cstdio>
#include <string.h>
#include <stack>
#include <vector>
#include <set>
#include <cmath>
using namespace std;

#define REP(i, n) for (int i = 0; i < n; ++i)
#define PB push_back
#define MP make_pair


const double eps = 1e-8;
const double PI  = acos(-1.0);

int sgn(double x) { return x > eps ? 1 : x < -eps ? -1 : 0;}
double sqr(double x) { return x*x; }

//莠檎サエ轤ケ
struct pt
{
    double x,y;
    pt(double _x = 0,double _y = 0) { x = _x; y = _y;}
    pt operator + (const pt &a) const { return pt(x+a.x, y+a.y);}
    pt operator - (const pt &a) const { return pt(x-a.x, y-a.y);}
    pt operator * (const double r) const { return pt(x * r, y * r);}
    pt operator / (const double r) const { return pt(x / r, y / r);}
    
	bool operator == (const pt &a) const { return sgn(x-a.x) == 0 && sgn(y-a.y) == 0; }
    
	double len() { return sqrt(x*x + y*y); }
    double ang() { return atan2(y, x); }
	
	pt unit() { double l = len(); return pt(x/l, y/l); }
	pt per()  { return pt(-y, x); }
    pt trunc(double s) { return unit() * s; }
    pt rotate(double ang) { return pt(x*cos(ang)-y*sin(ang), x*sin(ang)+y*cos(ang)); }
	void read() { scanf("%lf%lf",&x,&y);}
    void write() { printf("(%.2f, %.2f) ",x, y); }
};

double det(const pt &a,const pt &b) { return a.x*b.y - a.y*b.x; }
double dot(const pt &a,const pt &b) { return a.x*b.x + a.y*b.y; } 

double dis(const pt &a,const pt &b) { return sqrt((a.x-b.x)*(a.x-b.x) + (a.y-b.y)*(a.y-b.y));}

double vp, v, r, v_ang, R;
pt a, b, peak;
pt o(0, 0);
double tangent_ang, start_ang;
double tangent_dis;

double Angle(pt a, pt b) {
    double ang = atan2(a.y, a.x) - atan2(b.y, b.x);
    if (ang > PI+eps) ang -= 2*PI;
    if (ang < -PI+eps) ang += 2*PI;
    return ang;
}
bool in(double l, double r, double ang) {
    return sgn(ang-l) > 0 && sgn(ang-r) < 0;
}
bool intervalCover(double l, double r, double ang) {
    if (r > PI) {
        return in(l, PI, ang) || in(-PI, r-2*PI, ang); 
    } else {
        return in(l, r, ang);
    }
}
bool cover(double ang, double& t) {
    if (ang < tangent_ang) {
        t = dis(a, peak.rotate(ang)) / v;
    } else {
        double delta = ang - acos(r/R) - tangent_ang;
        double len = tangent_dis + PI*delta  + sqrt(R*R-r*r);
        t = len / v;
    }
    double end_ang = start_ang + t * v_ang;
    bool tmp = intervalCover(start_ang, end_ang, ang) || 
           intervalCover(start_ang, end_ang, -ang);
    cout << tmp << endl;
    return tmp;
}

int main() {
    b.read();
    scanf("%lf",&vp);
    
    a.read();
    scanf("%lf%lf",&v, &r);
    
    R = b.len();
    v_ang = vp / R;
    peak = a.trunc(R);
    
    start_ang = Angle(a, b);
    
    double d = a.len();
    tangent_ang = acos(r / d); 
    tangent_dis = sqrt(d*d-r*r);
    
    //printf("tangent_ang = %f\n",tangent_ang);
    
    double meet, ans;
    double l = 0.0, r = PI;
    for (int run = 0; run < 100; ++run) {
        double mid = (l + r) * 0.5;
        if (cover(mid, meet)) {
            l = mid;
        } else {
            r = mid;
            ans = meet;
        }            
    }
    printf("%.10f\n",ans);
}

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<cstdio>
#define LOOP(i,f,t) for(int i=f;i<=t;++i)
int main(){
  LOOP(i,1,9){
    LOOP(j,1,9){
      printf("%dx%d=%d\n",i,j,i*j);
    }
  }
}

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>

int main(){

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

C++: #include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
typedef long long LL;
int main(){
	REP(i,9){
	    REP(j,9){
	        cout<<i+1<<"x"<<j+1<<"="<<(i+1)*(j+1)<<endl;
	    }
	}
	return(0);
}

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()
{
	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(){
    enum{
        STARTMULTITABLE = 1,
        ENDMULTITABLE = 9
    };
    
    int i;
    for(i = STARTMULTITABLE; i <= ENDMULTITABLE; i++){
        int k;
        for(k = STARTMULTITABLE; k <= ENDMULTITABLE; k++){
            cout << i << "x" << k << "=" << (i*k) << endl;
        }
    }
    return 0;
}

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

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

C++: #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0;i<n;i++)

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

C++: #include<iostream>
int main(void){
int i=1,j=1
for(i;i<10;i++){
for(j=1;j<10;j++){
std::cout<<i<<"x"<<j<<"="<<i*j<<std::endl;
}}

return 0;
}