杭电2012年笔试

52Tiramisu

于 2021-03-03 21:11:23 发布

阅读量126

点赞数

分类专栏：杭电笔试

本文链接：https://blog.csdn.net/gsj9086/article/details/114334080

版权

杭电笔试专栏收录该内容

9 篇文章 0 订阅

订阅专栏

1.十进制 -> 十六进制

写一程序将十进制转换为十六进制，每行输入一个十进制数，当输入数为0的时候，程序结束。

输入样例：

5
242
0

输出样例：

5
F2

思路：

十进制->Q进制：除基取余法

#define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
// 当输出大于9的数字时，输出对应的字符数组
char hexa[6] = { 'A','B', 'C', 'D', 'E', 'F' };
int main() {
	int n, Q = 16;
	scanf("%d", &n);
	do {
		int z[40], pNum = 0; // 存放余数数组和下标
		while (n != 0) {
			z[pNum++] = n % Q; // 取余数
			n = n / Q; 
		}
        // 输出当前Q进制数
		for (int i = pNum - 1; i >= 0; i--) {
			if (z[i] > 9)
				printf("%c", hexa[z[i] - 10]);
			else
				printf("%d", z[i]);
			if (i == 0)
				printf("\n");
		}
        // 再录入十进制数n
		scanf("%d", &n);
	} while (n != 0);
	return 0;
	
}

2. 贪吃蛇

Worm is an old computer game. There are many versions, but all involve maneuvering a "worm" around the screen, trying to avoid running the worm into itself or an obstacle.

We'll simulate a very simplified version here. The game will be played on a 50*50 board, numbered so that the square at the upper left is numbers (1, 1). The worm is initially a string of 20 connected squares. Connected squares are adjacent horizontally or vertically. The worm starts stretched out horizontally in positions (25, 11) through (25, 30), with the head of the worm at (25, 30). The worm can move either East (E), West (W), North (N) or South (S), but will never move back on itself. So, in the initial position, a W move is not possible. Thus the only two squares occupied by the worm that change in any move are its head and tail. Note that the head of the worm can move to the square just vacated by the worm's tail.

You will be given a series of moves and will simulate the moves until either the worm runs into itself, the worm runs off the board, or the worm successfully negotiates its list of moves. In the first two cases you should ignore the remaining moves in the list.

INPUT

There will be multiple problems instances. The input for each problem instance will be on two lines. The first line is an integer n (<100) indicating the number of moves to follow. (A value of n = 0 indicates end of input.) The next line contains n characters (either E, W, N or S), with no spaces separating the letter, indicating the sequence of moves.

OUTPUT

Generate one line of output for each problem instance. The output line should be one of the follow three:

The worm ran into itself on move m.

The worm ran off the board on move m.

The worm successfully made all m moves.

Where m is for you to determine and the first move is move 1.