-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy path510A - Fox And Snake.cpp
92 lines (71 loc) · 1.59 KB
/
510A - Fox And Snake.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
/*
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
inputCopy
3 3
outputCopy
###
..#
###
inputCopy
3 4
outputCopy
####
...#
####
inputCopy
5 3
outputCopy
###
..#
###
#..
###
inputCopy
9 9
outputCopy
#########
........#
#########
#........
#########
........#
#########
#........
#########
*/
#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int m, n;
cin >> m >> n;
char a[m][n];
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if(i % 2 == 0) a[i][j] = '#';
else a[i][j] = '.';
}
}
bool last = true;
for (int i = 1; i < m; i += 2) {
if(last) a[i][n - 1] = '#';
else a[i][0] = '#';
last = !last;
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
cout << a[i][j];
}
cout << endl;
}
}