33

实验一：

#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, April~";
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);
}

运行：

讨论：在1000ms的时间内在n行n列里随机打印hi,April

实验二：

#include <stdio.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));
return 0;
} 
long long fac(int n)
{
static long long p = 1;
printf("p=%d\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;
}

　运行：　

讨论：答案：8 17

实验3：

#include <stdio.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);
} 
return 0;
}
long long func(int n)
{
	long long f;
	int ans=1;
	int i;
	for(i=1;i<=n;i++){
	ans=ans*2;
	}
	f=ans-1;
	return f;
	
}

　运行：　

 

实验四：

 

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

int main()
{
	int n, m;
	
	while(scanf("%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 || m == 0)
		return 1;
	else if(n < m)
		return 0;
	//else if(m == 1)
		//return n;
	else
		return (func(n - 1, m) + func(n -1, m - 1));
}　

运行：

 

 实验五：

#include <stdio.h>
double mypow(int x, int y); 

int main()
{
	int x, y; 
	double ans;
	
	while(scanf("%d%d", &x, &y) != EOF)
	{
		ans = mypow(x, y); 
		printf("%d的%d次方: %g\n\n", x, y, ans);
	}
	
	return 0;
}
double mypow(int x, int y)
{
	double s = 1;
	
	if(y == 0)
		return 1;
	else if(y > 0)
	{
		for( ; y > 0; y--)
			s *= x;
	}
	else if(y < 0)
	{
		for( ; y < 0; y++)
			s /= x;
	}
	
	return s;
}

　　

#include <stdio.h>
double mypow(int x, int y); 

int main()
{
	int x, y; 
	double ans;
	
	while(scanf("%d%d", &x, &y) != EOF)
	{
		ans = mypow(x, y);
		printf("%d的%d次方: %g\n\n", x, y, ans);
	}
	
	return 0;
}
double mypow(int x, int y)
{
	if(y == 0)
		return 1;
	else if(y > 0)
		return x*mypow(x, y-1);
	else if(y < 0)
		return mypow(x, y+1)/x;
		
}

　　运行：

实验六：

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

unsigned int i = 0;

int main()
{
	unsigned int n;
	
	while(scanf("%u", &n) != EOF)
	{
		i = 0;
		hanoi(n, 'A', 'B', 'C');
		printf("一共移动了%u次\n", i);
	}	
	
	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);
	}
	
	i++;
}

void moveplate(unsigned int n, char from, char to)
{
	printf("%u: %c-->%c\n", n, from, to);
}

　　运行：

实验七：

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

int main()
{
	int i, j, k;
	
	for( i = 2; i <= 10; i++)
	{			
		for( j = 2; j <= i; j++)
		{						
			if(is_prime(2*i - j) == 1 && is_prime(j) == 1)
			{
				printf("%d = %d + %d\n", 2*i, j, 2*i - j);
				break;
			}				
		}
	}
	
	return 0;
}

int is_prime(int n)
{
	int i;
	
	for( i = 2; i < n; i++)
	{		
		if(n % i == 0)
			return 0;						
	}
	
	return 1;
}

　　运行：

实验八：

#include <stdio.h>
#include <math.h>
long func(long s); 
int main() 
{

    long s, t;

    printf("Enter a number: ");
    while (scanf("%ld", &s) != EOF) 
	{
        t = func(s); 
        printf("new number is: %ld\n\n", t);
        printf("Enter a number: ");
    }

    return 0;
}
long func(long s)
{
	long i, j = 0;
	
	while(s != 0)
	{
		i = s % 10;
		s /= 10;
		
		if(i % 2 == 1)
			j = j*10 + i;
	}
	
	while(j != 0)
	{
		i = j % 10;
		j /= 10;
		s = s*10 + i;
	}
	
	return s;
}

　　运行：