#include <iostream> #include <cmath> using namespace std; int Primes[1250]; int Len; void getprime() { bool flag[10001] = { false }; for (int i = 2; i < 101; ++i) if (!flag[i]) for (int j = i + i; j < 10001; j += i) flag[j] = true; for (int i = 2; i < 10001; ++i) if (!flag[i]) Primes[Len++] = i; } int main() { int p,q,r,s; getprime(); while (cin >> p >> q >> r >> s) { int num[6],headdim,enddim,max = 0; num[0] = p,num[1] = s,num[2] = r-s,num[3] = q, num[4] = r, num[5] = p-q; for (int i = 0; i < 5; ++i) if (max < num[i]) max = num[i]; double mul = 1.0; for (int i = 0; i < Len && Primes[i] <= max; ++i) { int temp; headdim = enddim = 0; for (int j = 0; j < 3; ++j) { for (temp = Primes[i]; temp <= num[j]; temp *= Primes[i]) headdim += num[j] / temp; for (temp = Primes[i]; temp <= num[j+3]; temp *= Primes[i]) enddim += num[j+3] / temp; } if (headdim != enddim) mul *= pow((double)Primes[i],(double)(headdim-enddim)); } printf("%.5lf/n",mul); } return 0; }