Submission

Score: 100

User: letdown

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

Language: cpp

Time: 0.005 second

Submitted On: 2025-10-12 21:05:18

#include <iostream>

using namespace std;
int main() {
    string s;
    int n, l;
    cin >> s >> n;
    l = s.length();

    int last = l-1;

    cout << string(n, '.');
    for (int i = 0; i < l; i++) {
        cout << s[i];
        if (i != last) cout << string(2*(n)-2, '.');
    }
    cout << string(n, '.') << "\n";

    for (int i = 1; i < n; i++) {
        for (int j = 0; j < l; j++) {
            if (j == 0) cout << string(n-i, '.');
            cout << s[j] << string(1+2*(i-1), '.') << s[j];
            if (j != last) cout << string(2*(n-i) - 2, '.');
        }
        cout << string(n-i, '.') << "\n";
    }

    for (int i = 0; i < l; i++) {
        cout << s[i];
        if (i > 0) cout << s[i-1];
        cout << string(2*(n)-2 - (i > 0), '.');
    }
    cout << "." << s[l-1] << "\n";

    for (int i = n-1; i >= 1; i--) {
        for (int j = 0; j < l; j++) {
            if (j == 0) cout << string(n-i, '.');
            cout << s[j] << string(1+2*(i-1), '.') << s[j];
            if (j != last) cout << string(2*(n-i) - 2, '.');
        }
        cout << string(n-i, '.') << "\n";
    }

    cout << string(n, '.');
    for (int i = 0; i < l; i++) {
        cout << s[i];
        if (i != last) cout << string(2*(n)-2, '.');
    }
    cout << string(n, '.') << "\n";
}