Codeforces Round #290 (Div. 2) A. Fox and Snake__codeforces

A. Fox and Snake time limit/test 2 seconds memory limit per test 256 megabytes input standard input Output standard OU Tput

Fox Ciel starts to learn programming. The ' a ' is drawing a fox! However, that's 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 L EFT to (3, 1) and,.

Your task is to draw this snake for Fox ciel:the empty cells should be represented as dot characters ('. ') and the snake Cells should is 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. Examples Input Copy

3 3

Output Copy

###
.. #
###

Input Copy

3 4

Output Copy

####
...#
####

Input Copy

5 3

Output Copy

###
.. #
###
#..
###

#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
int main ()
{
	int n,m;
	while (Cin>>n>>m)
	{for
		(int i=1;i<=n;i++)
		{
			if (i&1) {for
				(int j=0;j <m;j++)
					cout<< "#";
			}
			else
			{
				int k=i/2;
				if (k&1)
				{for
					(int i=1;i<m;i++)
						cout<< ".";
					cout<< "#";
				}
				else
				{
					cout<< "#";
					for (int i=1;i<m;i++)
						cout<< ".";
				}
			}
			cout<<endl;
		}
	}
	return 0;
}