Submission

Score: 100

User: ChanakanStudy

Problemset: กังหันสี่ทิศ

Language: cpp

Time: 0.003 second

Submitted On: 2026-10-11 17:16:03

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <utility>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <numeric>
#include <iomanip>
using namespace std;
using ll = long long;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    int range = 2*n-1;
    for(int i = 0;i<range;i++) {
        for(int j =0;j<range;j++) {
            if((i == j || (j == range - i - 1)) && (i < n)) {
                cout << char(n+65-i-1);
            }
            // else if (i == n && j == i){
            //     cout << 'A';
            // }
            else if((i == range - j - 1 || j == i) &&(i >= n)) {
                cout << char(65 + i - n+1);
            }
            else {
                cout << " ";
            }
        }
        cout << " ";
        for(int k = 0;k<range;k++) {
            if((i == k) || (k == range - i -1)) {
                cout << "*";
            }
            else {
                cout << " ";
            }
        }

        // for(int k = 0;k<range;k++) {

        // }
        cout << '\n';
    }

    return 0;
}