Submission

Score: 0

User: sundopoz

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

Language: cpp

Time: 0.005 second

Submitted On: 2026-10-08 20:25:20

/*
this is my template :>
*/
#include<iostream>
#include<cmath>
#include<array>
#include<vector>
#include<algorithm>
#include<string>
/*
#include <map>
#include <numeric>
#include <set>
#include <stack>
#include <queue>
// */

// #include <bits/stdc++.h>

using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef size_t st;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvll;
template <typename T>
istream& operator>>(istream& is, vector<T>& v){
    for (T& x:v) cin>>x;
    return is;
}
template <typename T>
using ar = std::array<T,2>;
const int mod107=1000000007;
const int mod67=676767677;
ll n,m,q;

// this is my solution
auto solve(){
    cin>>n;
    for (int i=1;i<n*2;i++){
        int ii = n-abs(i-n);
        char ch = 'A' +n-ii;
        for (int j=0;j<ii;j++){
            cout<<" ";
        }
        cout<<ch;
        int len = n-ii;
        for (int j=0;j<len;j++){
            cout<<" ";
        }
        for (int j=1;j<len;j++){
            cout<<" ";
        }
        if (ii!=n) cout<<ch;
        for (int j=0;j<ii;j++){
            cout<<" ";
        }
        cout<<' ';
        for (int j=1;j<ii;j++){
            cout<<" ";
        }
        cout<<'*';
        len = n-ii;
        for (int j=0;j<len;j++){
            cout<<" ";
        }
        for (int j=1;j<len;j++){
            cout<<" ";
        }
        if (ii!=n) cout<<"*";
        cout<<'\n';
    }
    return;
}
int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    size_t testcase=1;
    //cin>>testcase;
    while(testcase--){
        solve();
    }
    return 0;
}