实验3 函数应用编程

标签：return 函数 int 编程 long char 实验 func include

 实验任务1

#include<stdio.h>
#include<stdlib.h>
#include<time.h>
#include<windows.h>
#define N 80

void print_text(int line, int col, char text[]);
void print_spaces(int n);
void print_blank_lines(int n);

int main()
{
    int line, col, i;
    char text[N] = "hi,November";

    srand(time(0));

    for (i = 1; i <= 10; ++i)
    {
        line = rand() % 25;
        col = rand() % 80;
        print_text(line, col, text);
        Sleep(1000);
    }
    return 0;
}
void print_spaces(int n)
{
    int i;

    for (i = 1; i <= n; i++)
    {
        printf(" ");
    }
}
void print_blank_lines(int n)
{
    int i;
    for (i = 1; i <= n; i++)
    {

        printf("\n");
    }
}
void print_text(int line, int col, char text[])
{
    print_blank_lines(line - 1);
    print_spaces(col - 1);
    printf("%s", text);
}

在任意一行一列输出10次“hi，November"。

实验任务2

 

#include<stdio.h>
long long fac(int n);

int main()
{
    int i, n;
    printf("Enter n:");
    scanf_s("%d", &n);
    for (i = 1; i <= n; i++)
    {
        printf("%d!=%lld\n", i, fac(i));
    }
    return 0;
}
long long fac(int n)
{
    static long long p = 1;
    printf("p=%lld\n", p);
    p = p * n;
    return p;
}

 

#include<stdio.h>
int func(int, int);
int main()
{
    int k = 4, m = 1, p1, p2;
    p1 = func(k, m);
    p2 = func(k, m);
    printf("%d,%d\n", p1, p2);
    return 0;
}
int func(int a, int b)
{
    static int m = 0, i = 2;
    i += m + 1;
    m = i + a + b;
    return m;

}

用static定义的变量在第一次赋值以后，之后再用static定义不重新赋值，而是用原来的值进行之后的程序

实验任务3

#include<stdio.h>
long long func(int n);
int main()
{
    int n;
    long long f;
    while (scanf_s("%d", &n) != EOF)
    {
        f = func(n)-1;
        printf("n=%d,f=%lld\n", n, f);
    }
    return 0;
}
long long func(int n)
{
    if (n == 0)
        return 1;
    return 2*func(n - 1);
}

实验任务4

#include<stdio.h>
int func(int n, int m);

int main()
{
    int n, m;
    while (scanf_s("%d %d", &n, &m) != EOF)
    {
        printf("n = %d,m = %d,ans = %d\n", n, m, func(n, m));
    }
    return 0;
}
int func(int n, int m)
{
    if (n < m)
    {
        return 0;
    }
    if (n == m)
    {
        return 1;
    }
    if (n > m && m == 0)
    {
        return 1;
    }
    return func(n - 1, m) + func(n - 1, m - 1);
}

实验任务5

#include<stdio.h>
int mul(int n, int m);
int main()
{
    int n, m;
    while (scanf_s("%d %d", &n, &m) != EOF)

    {
        printf("%d * %d = %d\n", n, m, mul(n, m));
    }
    return 0;
}
int mul(int n, int m)
{
    if (n > m)
    {
        int t = 0;
        t = n;
        n = m;
        m = t;
    }
    if (n == 0)
    {
        return 1;
    }
    if (n == 1)
    {
        return m;
    }
    return m +mul(n - 1, m);
}

实验任务6

#include<stdio.h>
#include<stdlib.h>
void hanoi(unsigned int n, char from, char temp, char to);
void moveplate(unsigned int n, char from, char to);
int func(int m);
int main()
{
    unsigned int n;
    while (scanf_s("%d", &n) != EOF)
    {
        hanoi(n, 'A', 'B', 'C');
        printf("一共移动了%d次.\n", func(n)-1);
    }
    system("pause");
    return 0;
}
void hanoi(unsigned int n, char from, char temp, char to)
{
    if (n == 1)
    {
        moveplate(n, from, to);
    }
    else
    {
        hanoi(n - 1, from, to, temp);
        moveplate(n, from, to);
        hanoi(n - 1, temp, from, to);
    }
}
void moveplate(unsigned int n, char from, char to)
{
    printf("%u:%c-->%c\n", n, from, to);
}

int func(int n)
{
    if (n == 1)
        return 2;
    return 2 * func(n - 1);
}

实验任务7

#include<stdio.h>
int is_prime(int i);
int main()
{
    int sum,number_1,number_2=0;
    for (sum = 1; sum <= 20; sum++)
    {
        for (number_1 = 1; number_1 <= sum; number_1++)
        {
            number_2 = sum - number_1;
            if (number_2 <= 1)
                break;
            is_prime(number_1);
            is_prime(number_2);
            if (is_prime(number_1 )==1 && is_prime(number_2 )==1)
                break;
        }
        if (number_2 <= 1)
            continue;
        if(sum%2==0)
         printf("%d=%d+%d\n", sum, number_1, number_2);
    }
}
is_prime(int i)
{
    int j;
    if (i == 1)
    {
        return 0;
    }
    for (j = 2; j <i; j++)
    {
        if (i % j == 0)
            break;
    }
    if (i>j)
        return 0;
    return 1;
}

实验任务8

 

#include<stdio.h>
#include<math.h>
#define N 100
long fun(long s);

int main()
{
    long s, t;
    printf("Enter a number：");
    while (scanf_s("%ld", &s) != EOF)
    {
        t = fun(s);
        printf("new number is:%ld\n\n", t);
        printf("Enter a number:");
    }
    return 0;
}
long fun(long s)
{
    int i, j, k = 0;
    long number = 0;
    int a[N];
    for (i = 0;; i++)
    {
        a[i] = s % 10;
        s = s / 10;
        if (s == 0)
            break;
    }
    for (j = 0; j<=i; j++)
    {
        if (a[j] % 2 != 0)
        {
            number = number+ a[j] * pow(10, k);
            k++;
        }
    }
    return number;
}

 

 

标签：return,函数,int,编程,long,char,实验,func,include
From： https://www.cnblogs.com/w2230189056/p/16859850.html