fract.cpp

#include <cstdio>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <vector>
#include <set>
#include <stack>
#include <bitset>
#include <string>
 
using namespace std;
 
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef set<int> si;
typedef set<ii> sii;
 
#define MP make_pair
#define PB push_back
#define REP(i,a) for ( int i = 0; i < int(a); i++)
#define FOR(i,a,b) for ( int i = int(a); i<=int(b); i++)
#define FORD(i,a,b) for(int i= int(a); i>=int(b); i--)
 
const int INF = 1<<29;
typedef long long int ll;
 
int main(){
  int n, sum;
  while ( scanf("%*d%*c%d", &n) == 1) {
    sum = 0;
    for ( int y = n+1; ; y++) {
      if ( (n*y) % (y-n) == 0 ){
        sum++;
        if ( (n*y)/(y-n) == y ) break;
      }
    }
    printf("%d\n", sum);   
  }
  return 0;
}