Submission

Score: 100

User: Kidmaiok

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

Language: cpp

Time: 0.031 second

Submitted On: 2026-10-15 23:32:36

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define space << ' '
#define nl << endl

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    string a;
    int b;
    cin >> a >> b;
    for(int i =0; i < b; i ++){
        cout << ".";
        for(int j = 0; j < a.size();j++){
            for(int k =0; k < ((2*b)-1) ; k++){
                if(k == b-1-i || k == b-1+i){
                    cout << a[j];
                }else{
                    cout << ".";
                }
            }
        }
        cout << ".";
        cout << "\n";
    }
    cout << a[0] << '.';
    for(int i = 1; i < a.size();i++){
        for(int j = 0; j < ((b*2)-1); j++){
            if(j == ((b*2)-1)-2){
                cout << a[i];
            }else if(j == ((b*2)-1)-1){
                cout << a[i-1];
            }else{
                cout << ".";
            }
        }
    }
    for(int i =0; i < (2*b)-2;i++){
        cout << ".";
    }
    cout << a[a.size()-1] << "\n";






    for(int i =0; i < b; i ++){
        cout << ".";
        for(int j = 0; j < a.size();j++){
            for(int k =0; k < ((2*b)-1) ; k++){
                if(k == 0+i || k == ((2*b)-1)-1-i){
                    cout << a[j];
                }else{
                    cout << ".";
                }
            }
        }
        cout << ".";
        cout << "\n";
    }
    
}