View Code of Problem 102

#include <iostream>
#include <sstream>
#include <string>
#include <cstdio>
#include <algorithm>
#include <cmath> 

using namespace std;
typedef long long ll;
int main(){
	ll x0,y0;
	while(cin>>x0>>y0){
		ll mutify=x0*y0;
		int count=0;
		int flag=0;
		for(ll i=1;i<=sqrt(mutify);i++){
			if(mutify%i!=0){
				continue;
			}
			else{
				if(x0==__gcd(i,mutify/i)){
					ll kk=mutify/i;
					if(i==kk){
						flag=1;	
					}
					count++;
				}	
			}
			
		}
		if(flag==0){
			cout<<count*2<<endl;
		}
		else{
			cout<<count*2-1<<endl;
		}
		
	}
	return 0; 
}