A. Fox And Snake
time limit per test
memory limit per test
input
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.
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 the snake cells should be filled with number signs ('#').
Consider sample tests in order to understand the snake pattern.
Input
n and m (3 ≤ n, m ≤ 50).
n is an odd
Output
n lines. Each line should contain a string consisting of m
Sample test(s)
input
3 3
output
### ..# ###
input
3 4
output
#### ...# ####
input
5 3
output
### ..# ### #.. ###
input
9 9
output
#########
........#
#########
#........
#########
........#
#########
#........
#########
#include<iostream>
#include<algorithm>
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
using namespace std;
int main()
{
int n,m;
while(scanf("%d%d",&n,&m)!=EOF)
{
for(int i=1;i<=n;i++)
{
if(i%2 == 1)
{
for(int j=1;j<=m;j++)
{
printf("#");
}
printf("\n");
}
else
{
if(i%2 == 0 && i%4 == 0)
{
printf("#");
for(int j=2;j<=m;j++)
{
printf(".");
}
printf("\n");
}
else if(i%2 == 0 && i%4!=0)
{
for(int j=1;j<m;j++)
{
printf(".");
}
printf("#\n");
}
}
}
}
return 0;
}