fl.cpp
#include <algorithm>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define DEBUG(x) cout << ">>> " << #x << " : " << x << endl;
#define REP(i,a) for (int i = 0; i < (a); ++i)
#define FOR(i,a,b) for (int i = (a); i <= (b); ++i)
#define FORD(i,a,b) for (int i = (a); i >= (b); --i)
inline bool EQ(double a, double b) { return fabs(a-b) < 1e-9; }
const int INF = 1<<29;
typedef long long ll;
///////////////////////////////////////////////////////////////////////////
int main()
{
int x, y, n;
while (scanf("%d/%d", &x, &n) == 2)
{
int res = 0;
for (ll x = n+1; ; ++x)
{
ll a = n*x, b = x-n;
if (a%b == 0)
{
ll y = a/b;
if (y < x) break;
++res;
//cout << x << " " << y << endl;
if (y == x) break;
}
}
printf("%d\n", res);
}
return 0;
}