算法竞赛入门经典（第2版）程序（第3章）

程序3-1 逆序输出

#include<stdio.h>
#define maxn 105
int a[maxn];
int main()
{
	int x, n = 0;
	while(scanf("%d", &x) == 1)	//ctrl+z结束 
		a[n++] = x;		
	for (int i = n-1; i >= 1; i--)
		printf("%d ", a[i]);
	printf("%d\n", a[0]);
	return 0;
}

程序3-2 开灯问题

#include<stdio.h>
#include<string.h>
#define maxn 1010
int a[maxn];
int main()
{
	int n, k, first = 1;
	memset(a, 0, sizeof(a));	//把数组a清零，在string.h中定义 
	scanf("%d%d", &n, &k);
	for (int i = 1; i <= k; i++)
		for (int j = 1; j <= n; j++)
			if (j % i == 0)
				a[j] = !a[j];
	for (int i = 1; i <= n; i++)
		if (a[i])
		{
			if (first)
				first = 0;
			else
				printf(" ");
			printf("%d", i);
		}
	printf("\n");
	return 0;
}

程序3-3 蛇形填数

#include<stdio.h>
#include<string.h>
#define maxn 20
int a[maxn][maxn];
int main()
{
	int n, x, y, tot = 0;
	scanf("%d", &n);
	memset(a, 0, sizeof(a));
	tot = a[x=0][y=n-1] = 1;
	while(tot < n*n)
	{
		while(x+1 < n && !a[x+1][y]) a[++x][y] = ++tot;
		while(y-1 >= 0 && !a[x][y-1]) a[x][--y] = ++tot;
		while(x-1 >= 0 && !a[x-1][y]) a[--x][y] = ++tot;
		while(y+1 < n && !a[x][y+1]) a[x][++y] = ++tot;
	}
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < n; j++)
			printf("%3d", a[i][j]);
		printf("\n");
	}
	return 0;
}

程序3-4 竖式问题

#include<stdio.h>
#include<string.h>
int main()
{
	int count = 0;
	char s[20], buf[99];
	scanf("%s", s);	//s前面没有“&”符号 
	for (int abc = 111; abc <= 999; abc++)
		for (int de = 11; de <= 99; de++)
		{
			int x = abc*(de%10), y = abc*(de/10), z = abc*de;
			sprintf(buf, "%d%d%d%d%d", abc, de, x, y, z);	//输出到字符串 
			int ok = 1;
			for (int i = 0; i < strlen(buf); i++)	//结束标记之前的字符个数 
				if (strchr(s, buf[i]) == NULL)	//在一个字符串中查找单个字符。查找字符buf[i]在s中的位置,成功则返回要查找字符第一次出现的位置，失败返回NULL
					ok = 0;
			if (ok)
			{
				printf("<%d>\n", ++count);
				printf("%5d\nX%4d\n-----\n%5d\n%4d\n-----\n%5d\n\n", abc, de, x, y, z);
			}
		}
	printf("The number of solutions = %d\n", count);
	return 0;
}