Submission

Score: 20

User: cheetah

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

Language: cpp

Time: 0.031 second

Submitted On: 2026-07-17 15:45:21

#include<bits/stdc++.h>
using namespace std;

int main () {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    string s;
    int n;
    cin >> s >> n;
    char ar[(2 * n) + 1][((2 * n) + 1) + (s.size() - 1) * (2 * n)];

    for (int i = 0; i < 2 * n + 1; ++i) {
        for (int j = 0; j < ((2 * n) + 1) + (s.size() - 1) * (2 * n); ++j) {
            ar[i][j] = '.';
        }
    }

    for (int k = 0; k < s.size(); ++k) {
        int x = n + k * (2 * n);
        for (int i = 0; i < 2 * n + 1; ++i) {
            int d;
            if (i <= n) {
                d = n - i;;
            }
            else {
                d = i - n;
            }
            ar[i][x - (n - d)] = s[k];
            ar[i][x + (n - d)] = s[k];
        }
    }

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

    return 0;
}