zoukankan      html  css  js  c++  java
  • codeforces 371B

    #include<stdio.h>
    int count;
    int gcd(int a,int b) {
    if(b==0)
    return a;
        return gcd(b,a%b);
    }
    int seach(int a) {
    if(a%2==0) {
    count++;
    return seach(a/2);
    }
    if(a%3==0) {
    count++;
    return seach(a/3);
    }
    if(a%5==0) {
    count++;
    return seach(a/5);
    }
    return a;
    }
    int main() {
    int n,m,i,j,k,a,b,counta,countb,flag,sum;
    while(scanf("%d%d",&n,&m)!=EOF) {
    if(n==m) {
    printf("0 ");
    continue;
    }
      k=gcd(n,m);
       a=n/k;
    b=m/k;
    flag=0;
    count=0;sum=0;
       counta=seach(a);
    sum+=count;
    count=0;
    countb=seach(b);
    sum+=count;
    if(counta==1&&countb==1)
    printf("%d ",sum);
    else
    printf("-1 ");
    }
    return 0;
    }
  • 相关阅读:
    大数据
    入门
    bootstrap
    django 实现
    django
    爬虫
    汇编指令
    JavaScript
    那些年踩过的坑
    实现网页代码
  • 原文地址:https://www.cnblogs.com/thefirstfeeling/p/4410876.html
Copyright © 2011-2022 走看看