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 <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
#define FI first
#define SE second
#define MP make_pair
using namespace std;
const double EPS = 1e-8;
const int MAXN = 205;
const int INF = 1111111111;
const double PI = acos(-1.0);
inline int dcmp(double x)
{
	if(fabs(x)<EPS) return 0;
	return x<0?-1:1;
}
inline double sqr(double x){return x*x;}
struct Point{
	double x,y;
	Point(){}
	Point(double a,double b):x(a),y(b){}
	Point operator+(const Point&a)const{return Point(x+a.x,y+a.y);}
	Point operator-(const Point&a)const{return Point(x-a.x,y-a.y);}
	void input(){scanf("%lf%lf",&x,&y);}
}c[MAXN];

int solve(double r,int n)
{
	vector<pair<double,int> > v;
	int ret = 1,s;
	for(int i = 0; i < n; i++)
	{
		v.clear();
		v.push_back(MP(-PI,1));
		v.push_back(MP(PI,-1));
		for(int j = 0; j < n; j++)
		{
			if(i==j) continue;
			Point q = c[j]-c[i];
			double ab = sqrt(q.x*q.x+q.y*q.y),ac = r,bc = r;
			if(dcmp(ab+ac-bc)<=0)
			{
				v.push_back(MP(-PI,1));
				v.push_back(MP(PI,-1));
				continue;
			}
			if(dcmp(ab+bc-ac)<=0||dcmp(ab-ac-bc)>0)
				continue;
			double th = atan2(q.y,q.x);
			double fai = acos((sqr(ac)+sqr(ab)-sqr(bc))/(2*ac*ab));
			double a0 = th-fai,a1 = th+fai;
			if(dcmp(a0+PI)<0) a0+=2*PI;
			if(dcmp(a1-PI)>0) a1-=2*PI;
			if(dcmp(a0-a1)>0)
			{
				v.push_back(MP(a0,1));
				v.push_back(MP(PI,-1));
				v.push_back(MP(-PI,1));
				v.push_back(MP(a1,-1));
			}
			else
			{
				v.push_back(MP(a0,1));
				v.push_back(MP(a1,-1));
			}
		}
		sort(v.begin(),v.end());
		s = 1;
		for(int j = 0;j<v.size(); j++)
		{
			s+=v[j].SE;
			ret = max(ret,s);
		}
	}
	return ret;
}
int main()
{
	freopen("/home/qitaishui/code/in.txt","r",stdin);
	int n;
	double r1,r2;
	while(scanf("%d",&n)!=EOF)
	{
		for(int i = 0; i < n; i++)
			c[i].input();
		scanf("%lf%lf",&r1,&r2);
		printf("%d\n",solve(r1-r2,n));
	}
	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>

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