The city of Fishtopia can be imagined as a grid of 44 rows and an odd number of columns. It has two main villages; the first is located at the top-left cell (1,1)(1,1), people who stay there love fishing at the Tuna pond at the bottom-right cell (4,n)(4,n). The second village is located at (4,1)(4,1) and its people love the Salmon pond at (1,n)(1,n).
The mayor of Fishtopia wants to place kk hotels in the city, each one occupying one cell. To allow people to enter the city from anywhere, hotels should not be placed on the border cells.
A person can move from one cell to another if those cells are not occupied by hotels and share a side.
Can you help the mayor place the hotels in a way such that there are equal number of shortest paths from each village to its preferred pond?InputThe first line of input contain two integers, nn and kk (3≤n≤993≤n≤99, 0≤k≤2×(n−2)0≤k≤2×(n−2)), nn is odd, the width of the city, and the number of hotels to be placed, respectively.OutputPrint “YES”, if it is possible to place all the hotels in a way that satisfies the problem statement, otherwise print “NO”.
If it is possible, print an extra 44 lines that describe the city, each line should have nn characters, each of which is “#” if that cell has a hotel on it, or “.” if not.Examples
Input
7 2
Output
YES
…
.#…
.#…
…
Input
5 3
Output
YES
…
.###.
…
…
题目大意:左上角的人走到右下角,右下角的人走到左上角,插入一些点,使得从左上角到右下角和从右下角到左上角的距离相等
思路:如果k是奇数,就按照左右对称,如果k是偶数,就按照上下对称
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N =110;
char map[5][N];
int n, k;
int main(){
cin >> n >> k;
for (int i = 0; i < 4; i ++)
for (int j = 0; j < n; j ++)
map[i][j] = '.';
if (k % 2 == 0){
int s = k / 2;
for (int i = 1; i <= s; i ++)
map[1][i] = '#';
for (int i = 1; i <= s; i ++)
map[2][i] = '#';
puts("YES");
for (int i = 0; i < 4; i ++)
cout << map[i] << endl;
}
else{
int s = n / 2;
map[1][s] = '#';
k --;
for (int i = 1; i < n / 2; i ++){
if (k == 0)
break;
else{
map[1][i] = '#';
map[1][n - i - 1] = '#';
k -= 2;
}
}
for (int i = 1; i < n / 2; i ++){
if (k == 0)
break;
else{
map[2][i] = '#';
map[2][n - i + 1] = '#';
k -= 2;
}
}
puts("YES");
for (int i = 0; i < 4; i ++)
cout << map[i] << endl;
}
return 0;
}