WIKIOI P2964题解

#include <iostream>
using namespace std;
int n,m,ans;
int prime(int n){
   int i;
   if (n==1 || n==0)return 0;
   if (n==2)return 1;
   for(i=2;i*i<n;i++)
       if(n%i==0)return 0;
   if(i*i==n)return 0;
   return 1;
}
int solve(){
   int a=n,b=m,c=a%b;
   while(c!=0){
       a=b;
       b=c;
       c=a%b;
   }
   return b;
}
void work(int n){
   int i=2;
   while(n!=1){
       if(n%i==0 && prime(i)==1){ans++;n/=i;}
       else i++;
   }
   cout<<ans<<endl;
}
int main(){
   int s;
   cin>>n>>m;
   s=solve();
   work(s);
   return 0;
}