codeforces #290 A&&510A Fox And Snake（水题）

A. Fox And Snake

点击打开题目链接

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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

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

水题，签到题；

代码：

#include <iostream>
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<vector>
#include<stdlib.h>
#include<string>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<math.h>
#define inf 0x3f3f3f3f
#define eps 1e-5
#define max(a,b) (a)>(b)?(a):(b)
#define min(a,b) (a)<(b)?(a):(b)
using namespace std;
int main()
{
    int n,m,i,j;
    while(~scanf("%d%d",&n,&m))
    {
      bool flag=false;
        for(i=0; i<n; i++)
        {
            for(j=0; j<m; j++)
            {
                if(i%2&&j<m-1&&!flag)
                {
                    printf(".");
                }
                else if(i%2&&j==m-1&&!flag)
                {
                    printf("#");
                }
                else if(i%2&&j==0&&flag)
                {
                    printf("#");
                }
                else if(i%2&&j<m&&flag)
                {
                    printf(".");
                }
                else
                    printf("#");
            }
            printf("\n");
            if(i%2)
                flag=flag?false:true;
        }
    }
    return 0;
}