lc3吧 关注:5贴子:33
  • 1回复贴,共1

用于判断是否能整除的C++程序

只看楼主收藏回复

             #include<stdio.h>
             int Di(int a,int b);
             int main()
             {
             int numbera;
             int numberb;
             int result;
             printf("Please input a number:");
             scanf("%d",&numbera);
             printf("Please input another number:");
             scanf("%d",&numberb);
              result=Di(numbera,numberb);
             printf("the result is %d\n",result);
             }
             int Di(int a, int b)
             {
             if(a%b==0)
             return   1;
             else
             return 0;
             }


IP属地:辽宁1楼2010-01-06 20:26回复
                     #include<stdio.h>
                 #define     TRUE   1
                 #define     FALSE   0
            int Fe(int a);
            int main()
            {
                int number=1;
                int result;
                do   
                {result=TRUE;
                   result=Fe(number);
                   if (result==TRUE)
                       printf("The result is %d\n",number);
                   number++;
                }
                while (result==FALSE);
            }
            int Fe(int a)
            {
                int b=TRUE;
                int index=1;
                for(index=1;index<10;index++){
                    if (a%index!=0)
                        b=FALSE;
                }
                return b;
            }
                求能被一至十整除的最小正整数


    IP属地:辽宁2楼2010-01-06 20:43
    回复