#include<stdio.h>
int gcd(int a,int b)
{
 if(b==0)return a;
 else return gcd(b,a%b);
}
int solve(int n,int m)
{int div;
 if(m==1)return 1;
 if(n==1&&m!=1)return 0;
 div=gcd(m,n);
 return solve(n-1,m/div);
}
int main()
{
 int i,j,k,m,n;
 while(scanf("%d%d",&n,&m)==2)
 {
  if(m==0){printf("0 does not divide %d!\n",n);continue;}
  
  if(n==0||n==1)
  {
   if(m==1)printf("1 divides %d!\n",n);
   else printf("%d does not divide %d!\n",m,n);
   continue;
  }
  if(n>=m){printf("%d divides %d!\n",m,n);continue;}
  k=solve(n,m);
  if(k)printf("%d divides %d!\n",m,n);
  else printf("%d does not divide %d!\n",m,n);
  
 }
}

• m为0 (723) luoxiaomao 2007-02-28 15:43:57
  • m为0偶已经考虑了呀，怎么还会RE呢？？ (0) ecjtubaowp 2007-02-28 16:12:37
    • Re:m为0偶已经考虑了呀，怎么还会RE呢？？ (8) xinghe 2007-02-28 19:58:54
      • n,m,都可能为0的 (12) luoxiaomao 2007-02-28 20:59:09
      • 我用质因数分解做的 (12) luoxiaomao 2007-02-28 21:00:38
      • 原来是递归太深堆栈溢出了呀，好危险呀！！！ (0) ecjtubaowp 2007-03-01 15:48:32
        • Re:原来是递归太深堆栈溢出了呀，好危险呀！！！ (15) keky 2007-09-20 17:02:08