Fox And Snake

简介: Fox And Snake

文章目录

一、Fox And Snake

总结


一、Fox And Snake

本题链接:


题目:

A. Fox And Snake

time limit per test2 seconds

memory limit per test256 megabytes

inputstandard input

outputstandard 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.


Examples

input

3 3

output

###

..#

###

input

3 4

output

####

...#

####

input

5 3

output

###

..#

###

#..

###


input

9 9

output

#########

........#

#########

#........

#########

........#

#########

#........

#########

本博客给出本题截图

image.png

image.png

题意:按照如图所示的样子打印出来结即可

AC代码

#include <iostream>
#include <algorithm>
using namespace std;
const int N = 55;
char g[N][N];
int main()
{
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i ++ )
        for (int j = 1; j <= m; j ++ )
        {
            if (i % 2) g[i][j] = '#';
            else
            {
                if (j == 1 && !(i % 4))
                {
                    g[i][j]=  '#';
                    continue;
                }
                else if (j == m && !(i % 2) && g[i][1] != '#')
                {
                    g[i][j]=  '#';
                    continue;
                }
                g[i][j] = '.';
            }
        }
    for (int i = 1; i <= n; i ++ )
    {
        for (int j = 1; j <= m; j ++ )
            cout << g[i][j];
        puts("");
    }
    return 0;
}

总结

水题,不解释

目录
相关文章
|
Python
python实现简单的snake game!
python实现简单的snake game!
120 0
[LeetCode]--412. Fizz Buzz
Write a program that outputs the string representation of numbers from 1 to n. But for multiples of three it should output “Fizz” instead of the number and for the multiples of five output
1038 0
|
NoSQL JavaScript 前端开发
|
算法
[LeetCode]--55. Jump Game
Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Dete
1268 0
|
9月前
|
算法 数据安全/隐私保护 数据格式
BUUCTF snake 1
BUUCTF snake 1
199 0
[LeetCode]--400. Nth Digit
Find the nth digit of the infinite integer sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, … Note: n is positive and will fit within the range of a 32-bit signed integer (n &lt; 231). Exampl
1212 0
[LeetCode]--118. Pascal&#39;s Triangle
Given numRows, generate the first numRows of Pascal’s triangle. For example, given numRows = 5, Return [ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1] ] 我是用数组做的,在草稿纸上稍微画一画应该就能找
1370 0
[LeetCode]--119. Pascal&#39;s Triangle II
Given an index k, return the kth row of the Pascal’s triangle. For example, given k = 3, Return [1,3,3,1]. Note: Could you optimize your algorithm to use only O(k) extra space? public
1074 0
|
决策智能
[LeetCode]--292. Nim Game
You are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 stones. The one who removes the last stone
1098 0

热门文章

最新文章