Submission

Score: 100

User: anusitt

Problemset: ห่วงโซ่ (Chain)

Language: cpp

Time: 0.041 second

Submitted On: 2026-07-24 21:04:22

#include <bits/stdc++.h>
using namespace std;
char arr[91][250*91];
int main() {
    int n;
    string name;
    cin >> name;
    cin >> n;
    for (int i=0;i<2*n+1;i++) {
        for (int j=0;j<=1+name.size()*(2*n-1);j++) {
            arr[i][j] = '.';
        }
    }

    for (int a=0;a<name.size();a++) {
        for (int i=0;i<2*n+1;i++) {
            for (int j=0;j<2*n+1;j++) {
                if (i==-j+n||i==j+n||i==-j+3*n||i==j-n) arr[i][j+(2*n-1)*a]= name[a];
            }
        }
    }


    for (int i=0;i<2*n+1;i++) {
        for (int j=0;j<=1+name.size()*(2*n-1);j++) {
            cout << arr[i][j];
        }
        cout << '\n';
    }




    return 0;
   
}