实验3 函数应用编辑

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

task1.c

#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~10次

task2_1.c

#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;
}

 

 

task2_2.c

#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;
}

 

只赋予一次值，后续改变值保留

 task2_2.c

#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, f);
	}
}
long long func(n) {
	if (n == 1){return 1;
	}
	else { return 2 * func(n - 1) + 1; }
}

　　

 

 task4.c

#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(n, m) {
    if (m > n) { return 0; }
    else {
        if (m == 0) { return 1; }
        if (m == 1) { return n; }
        else if (n == m) { return 1; }
        else { return func(n - 1, m) + func(n - 1, m - 1); }
    }
}

 

 task5.c

#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(n, m)
{
	if (m == 0){return 0;
}
	if (m == 1) { return n; }
	else { return  n+mul(n, m - 1) ;
}
}

　　

 

 task6.c

#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);
long long func(int n);
int main()
{
	unsigned int n;
	while (scanf_s("%u", &n) != EOF) {
		hanoi(n, 'A', 'B', 'C');
		printf("一共移动了%lld次。", func(n)); }
		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);
}
long long func(n) {
	if (n == 1) {
		return 1;
	}
	else { return 2 * func(n - 1) + 1; }
}

　　

 

 task7.c

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

　　

 

 task8.c

#include <stdio.h>
#include<math.h>
#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(s) {
	int a,c=1,g = 0;
	for (; s > 0; s /= 10) {
		a = s % 10;
		if (a % 2 != 0) { a *= c; g += a; c *= 10; }
	}return g;
}

　　

 

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