实验五

1、

#include<stdio.h>

int add(int a,int b)

{

         return (a+b);

}

int minus(int a,int b)

{return (a-b);}

int multip(int a, int b)

{return (a*b);}

int quotient(int a,int b)

{return (a/b);}

int mod(int a,int b)

{return (a%b);}

int main()

{

         int x,y;

         scanf("%d %d",&x,&y);

         printf("%d\n",add(x,y));

         printf("%d\n",minus(x,y));

         printf("%d\n",multip(x,y));

         printf("%d\n",quotient(x,y));

         printf("%d\n",mod(x,y));

         return 0;

}

2、

#include<stdio.h>

int prime(int n)

{

         int a,b,flag=0;

         for(a=2;a<n/2;a++)

         {

                   if(n%a==0)

                            flag++;

         }

         if(flag!=0)

                   return 0;

         else

                   return 1;

}

int main()

{

         int n;

         scanf("%d",&n);

         printf("%d\n",prime(n));

         return 0;

}

3、

#include<stdio.h>

int max2(int a,int b)

{

         if(a>b)

                   return a;

         else

                   return b;

}

int max4(int m,int n,int i,int j)

{

         int max=0;

         max=max2(max2(m,n),max2(i,j));

         return max;

}

int main()

{

         int x,y,q,p;

         scanf("%d %d %d %d",&x,&y,&q,&p);

         printf("%d\n",max4(x,y,q,p));

         return 0;

}

4、

#include<stdio.h>

int add(int n)

{

         int a=1;

         if(n!=1)

                   a=n*add(n-1);

         if(n==1)

                   a=1;

         return a;

}

int main()

{

         int n;

         scanf("%d",&n);

         printf("%d\n",add(n));

         return 0;

}

转载于:https://www.cnblogs.com/P201821440028/p/10819517.html