首页 > 其他分享 >实验3

实验3

时间:2022-11-03 21:23:06浏览次数:40  
标签: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);
}

在任意行任意列输出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!=%11d\n",i,fac(i));
    return 0;
}
long long fac(int n)
{
    static long long p = 1;
    printf("p=%11d\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变量再一次被使用时会保留上一次的值

实验任务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);
        printf("n=%d,f=%lld\n", n, f);
    }
    return 0;
}
long long func(int n)
{
    long long a;
    if (n==1)
        return 1;
    a=2*func(n - 1)+1;
    return a;
}

实验任务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)
{
    int a;
    if (n < m)
        return 0;
    else if (m == 0)
        return 1;
    a = func(n - 1, m) + func(n - 1, m - 1);
    return a;
}

实验任务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)
{
    int t,a;
    if (m > n)
    {
        t = m; m = n; n = t;
    }
    if(m == 0)
        return 0;
    if (m == 1)
        return n;
    a = n + mul(n, m - 1);
    return a;
}

实验任务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 count;
int main()
{
    unsigned int n; 
    while (scanf_s("%u", &n) != EOF)
    {
        count = 0;
        hanoi(n, 'A', 'B', 'C');
        printf("一共移动了%d次\n", count);
    }
    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)
{
    count += 1;
    printf("%u: %c-->%c\n", n, from, to);
}

实验任务7

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

实验任务8

#include <stdio.h>
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 m=1,sum=0;
    while (s != 0)
    {
        if ((s%10) % 2 == 1)
        {
            sum += (s%10)* m;
            m=m * 10;
        }
        s=s / 10;
    }
    return sum;
}

 

标签:return,int,long,char,实验,func,include
From: https://www.cnblogs.com/hcguiwhcai/p/16855865.html

相关文章

  • 实验二:逻辑回归算法实验
    |20大数据三班||学号201613334|  【实验目的】1.理解逻辑回归算法原理,掌握逻辑回归算法框架;2.理解逻辑回归的sigmoid函数;3.理解逻辑回归的损失函数;4.针对特定应......
  • 实验四
    实验任务五vectorInt.hpp#pragmaonce#include<iostream>#include<cassert>usingnamespacestd;classvectorInt{public:vectorInt(intn);vectorInt(......
  • 实验3
    task_11#include<stdio.h>2#include<stdlib.h>3#include<time.h>4#include<windows.h>5#defineN806voidprint_text(intline,intcol,charte......
  • 实验三
    #include<stdio.h>#include<stdlib.h>#include<time.h>#include<windows.h>#defineN80voidprint_text(intline,intcol,chartext[]);//函数声明void......
  • 实验6:开源控制器实践——RYU
    一、实验要求(一)基本要求1.搭建下图所示SDN拓扑,协议使用OpenFlow1.0,并连接Ryu控制器,通过Ryu的图形界面查看网络拓扑。查看网络拓扑2.阅读Ryu文档的TheFirstApplic......
  • 实验七:基于REST API的SDN北向应用实践
    一、实验目的1.能够编写程序调用OpenDaylightRESTAPI实现特定网络功能;2.能够编写程序调用RyuRESTAPI实现特定网络功能。二、实验环境1.下载虚拟机软件OracleVisua......
  • 使用Wireshark完成实验3-IP
    1、使用Wireshark打开ip-ethereal-trace-1,如图 电脑IP地址为192.168.1.1022、如图,IP包头中上层协议字段的值为1,代表为ICMP 3、如图,IP头中有20字节  IP数据......
  • 实验7:基于REST API的SDN北向应用实践
    实验目的能够编写程序调用OpenDaylightRESTAPI实现特定网络功能;能够编写程序调用RyuRESTAPI实现特定网络功能。实验要求(一)基本要求编写Python程序,调用OpenDayligh......
  • 实验3
    task1#include<stdio.h>#include<stdlib.h>#include<time.h>#include<windows.h>#defineN80voidprint_text(intline,intcol,chartext[]);//函数声明......
  • 实验四 类与数组,指针
    实验任务5:task5.hpp#pragmaonce#include<iostream>#defineMAXSIZE10000usingnamespacestd;classvectorInt{public: //构造函数与析构函数 vectorInt(in......