实验五函数程序设计

谁借莪１个温暖的怀抱￠ 2022-01-07 06:53 221阅读 0赞

#include"stdio.h"
    void add(int a,int b)
    {
        int sum;
        sum = a+b;
        printf("%d\n",sum);
    }
    void minus(int a,int b)
    {
        int c;
        c = a-b;
        printf("%d\n",c);
    }
    void multip(int a,int b)
    {
        int c;
        c=a*b;
        printf("%d\n",c);
    }
    void quotient(int a,int b)
    {
        float c;
        c = a/b;
        printf("%f\n",c);
    }
    void mod(int a,int b)
    {
        int c;
        c = a%b;
        printf("%d\n",c);
    }
    int main()
    {
        int x,y;
        scanf("%d%d",&x,&y);
        add(x,y);
        minus(x,y);
        multip(x,y);
        quotient(x,y);
        mod(x,y);
        return 0;
    }

![1662199-20190520152418995-1908696138.png][]

#include"stdio.h"
    #include"math.h"
    int prime(int a)
    {
        int i,k;
        k = (int)sqrt(double(a));
        for(i = 2;i<=k;i++)
        {
            if(a%i==0)
            {
                return 0;
            }
        }
        return 1;
    
    
    }
    int main()
    {
        int a;
        scanf("%d",&a);
        if(prime(a)==0)
        {
            printf("%d不是素数",a);
        }
        else
            printf("%d是素数",a);
        return 0;
    }

![1662199-20190520152550229-125735805.png][]

#include"stdio.h"
    int max2(int a,int b)
    {
        int max;
        if(a>b)
            max = a;
        else
            max = b;
        return max;
    }
    int max4(int a,int b,int c,int d)
    {
        int max_1,max_2,MAX;
        max_1=max2(a,b);
        max_2=max2(c,d);
        if(max_1>max_2)
            MAX=max_1;
        else
            MAX=max_2;
        return MAX;
    }
    int main()
    {
        int a,b,c,d;
        scanf("%d%d%d%d",&a,&b,&c,&d);
        printf("%d\n",max4(a,b,c,d));
        return 0;
    }

![1662199-20190520152618257-531897056.png][]

#include"stdio.h"
    int digui(int a)
    {
        if(a==1||a==0)
            return 1;
        else return a*digui(a-1);
    
    }
    int main()
    {
        int n;
        scanf("%d",&n);
        printf("%d\n",digui(n));
        return 0;
    }

![1662199-20190520152645618-1590867513.png][]

转载于:https://www.cnblogs.com/p201821440032/p/10894029.html

[1662199-20190520152418995-1908696138.png]: /images/20211227/b6ae2ecdb5b74c80b409ac0d37e8b36c.png
[1662199-20190520152550229-125735805.png]: /images/20211227/a7fe4787b36d4520b8851b464881c1dd.png
[1662199-20190520152618257-531897056.png]: /images/20211227/3430b785265142858414078e4977200e.png
[1662199-20190520152645618-1590867513.png]: /images/20211227/8f802061738242e99aabd0f8870faf77.png