Codeforces Round #290 (Div. 二) - - A. Fox And Snake （画图）

Codeforces Round #290 (Div. 2) - - A. Fox And Snake （画图）

Fox Ciel starts to learn programming. The first task is drawing a fox! However, that turns out to be too hard for a beginner, so she decides to draw a snake instead.

A snake is a pattern on a n by m table. Denote c-th cell of r-th row as (r, c). The tail of the snake is located at (1, 1), then it's body extends to (1, m), then goes down 2 rows to (3, m), then goes left to (3, 1) and so on.

Your task is to draw this snake for Fox Ciel: the empty cells should be represented as dot characters ('.') and the snake cells should be filled with number signs ('#').

Consider sample tests in order to understand the snake pattern.

Input

The only line contains two integers: n and m (3 ≤ n, m ≤ 50).

n is an odd number.

Output

Output n lines. Each line should contain a string consisting of m characters. Do not output spaces.

Sample test(s)

input
3 3

output
###
..#
###

input
3 4

output
####
...#
####

input
5 3

output
###
..#
###
#..
###

input
9 9

output
#########
........#
#########
#........
#########
........#
#########
#........
#########

题意：就是要你去画一个蛇形图

AC代码：

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

char map[55][55];

int main()
{
	int n, m;
	while(scanf("%d %d", &n, &m) != EOF)
	{
		for(int i = 0; i < n; i++)
		{
			for(int j = 0; j < m; j++)
			{
				if((i + 1) & 1) map[i][j] = '#';
				else map[i][j] = '.';
			}
			if( (i + 1) % 4 == 0) map[i][0] = '#';
			else map[i][m-1] = '#';
		}
		for(int i=0; i<n; i++)
		{
			for(int j=0; j<m; j++)
				printf("%c", map[i][j]);
			printf("\n");
		}
	}
	return 0;
}

Codeforces Round #290 (Div. 二) - - A. Fox And Snake （画图）

相关推荐