数论：zoj 1577 GCD & LCM

[转]http://cupdish.com/2011/08/zoj-1577-gcd-lcm-%E8%A7%A3%E9%A2%98%E6%8A%A5%E5%91%8A/

 

#include <iostream>
#include <cmath>
 
using namespace std;
 
int main()
{
  int a,b,x,ans,count;
  while(cin >> a >> b)
  {
    count=0;
    if(b%a!=0)
      ans=0;
    else
    {
      x=b/a;
      ans=1;
      for(int i=2;i<=b/a;i++)
        if(x%i==0)
        {
          //cout << i << endl;
          count++;
          x=x/i;
          while(x%i==0)
            x=x/i;
        }
      for(int i=1;i<=count;i++)
        ans=ans*2;
    }
    cout << ans << endl;
  }
  return 0;
}