bjfu1287字符串输出的大水题

不多说

/*
 * Author    : ben
 */
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <functional>
#include <numeric>
#include <cctype>
using namespace std;
const int MAXN = ;
char graph[MAXN][MAXN];

int main() {
    int n;
    while (scanf("%d", &n) == ) {
        memset(graph, ' ', sizeof(graph));
        int w =  * n + ;
        int in =  * n - ;
        for (int i = ; i < w; i++) {
            graph[i][] = '*';
            graph[i][w - ] = '*';
            graph[i][w] = ;
        }
        for (int j = ; j < w; j++) {
            graph[][j] = '*';
            graph[w - ][j] = '*';
        }
        for (int j = ; j < w - ; j++) {
            graph[][j] = '*';
            graph[w - ][j] = '*';
        }
        for (int i = ; i < w - ; i++) {
            graph[i][] = '*';
            graph[i][w - ] = '*';
        }
        for (int i = ; i < w; i++) {
            printf("%s\n", graph[i]);
        }
    }
    return ;
}