实验3

task1

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

　

 

 

task2

#define _CRT_SECURE_NO_WARNINGS

// 利用局部static变量的特性，计算阶乘
#include <stdio.h>
#include<stdlib.h>
long long fac(int n); // 函数声明
int main() {
int i, n;
printf("Enter n: ");
scanf("%d", &n);
for (i = 1; i <= n; ++i)
printf("%d! = %lld\n", i, fac(i));
system("pause");
return 0;
}

// 函数定义
long long fac(int n) {
static long long p = 1; //只初始化一次p的值

printf("p=%11d\n", p);
p = p * n;
return p;
}

　　

 

 

#define _CRT_SECURE_NO_WARNINGS


#include <stdio.h>
#include<stdlib.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);
system("pause");
return 0;
}

int func(int a, int b) {
static int m = 0, i = 2;
i += m + 1;
m = i + a + b;
return m;
}

　　

 

 task3

#include <stdio.h>
#include<stdlib.h>
long long func(int n);
int main() {
int n;
long long f;
while (scanf("%d", &n) != EOF) {
f = func(n); 
printf("n = %d, f = %lld\n", n, f);
}
system("pause");
return 0;
}
long long func(int n) {

int i, s = 1;
if (n == 0) return -1; if (n <= 1) return 1;
for (i = 1; i < n; i++)
{
s = 2 * s + 1;

}

return s;

}

　　

 

 task4

#include <stdio.h>
#include<stdlib.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));
system("pause");
return 0;
}

int func(int n, int m) {

if (m == 0) { return 1; }

else if (m == n) { return 1; }
else if (m > n) { return 0; }
else
{
return func(n - 1, m) + func(n - 1, m - 1);
}
}

　　

 

 task5

#include <stdio.h>
#include<stdlib.h>
int mul(int n, int m);
int main() {
int n, m;


while (scanf("%d%d", &n, &m) != EOF)
printf("%d * %d = %d\n", n, m, mul(n, m));
system("pause");
return 0;
}
int mul(int n, int m) {

if (m >= n) {
if (n == 0) { return 0; }
else { return mul(n - 1, m) + m; }
}

else
{
if (m == 0) { return 0; }
else { return mul(n, m - 1) + n; }
}

}

　　

 

 task6

#include<stdio.h>
#include<stdlib.h>
void moveplate(unsigned int n, char from, char to);
void hanoi(unsigned int n, char from, char temp, char to);
int count = 0;
int main()
{
unsigned int n;
printf("请输入你需要进行移动的盘子数：\n");
while (scanf_s("%d", &n) != EOF)
{
count = 0;
printf("请输入你需要进行移动的盘子数：\n");
hanoi(n, 'A', 'B', 'C');
printf("移动盘子的总次数为：%d\n", count);
}

system("pause");
return 0;

}
void moveplate(unsigned int n, char from, char to)
{
printf("%u:%c-->%c\n", n, from, to);
count++;
}
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);
}
}

　　

 

 task7

老师，这题想不出，所以没写

task8

#include<stdio.h>
#include<stdlib.h>
long fun(long s); 
int main() {
long s, t;
printf("Enter a number: ");
while (scanf("%ld", &s) != EOF) {
t = fun(s); 
printf("new number is: %ld\n\n", t);
printf("Enter a number: ");
}
system("pause");
return 0;
}
long fun(long s) {
int i, j, m, n; int num[100];
i = 0; j = s; n = 0;
while (j != 0)
{
if (j % 2 == 1)
{
num[i] = j % 10; i++;

}
j = j / 10;
}
for (m = i-1; m >= 0; m--)
{
n = n * 10 + num[m];
}return n;


}