Submission

Score: 100

User: patsa_v

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

Language: cpp

Time: 0.032 second

Submitted On: 2025-10-15 11:47:59

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

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

    string s;
    int n;
    cin >> s >> n;

    int h = 2*n+1;

    for(int i = 0;i<h;i++){
        for(int k =0 ;k<s.size();k++){
            int p = 0;
            if(k == 0){
                p = 0;
            }else if (k>0){
                p = 2;
            }

           for(int j = p;j<h;j++){
                if(i+j == n || i-j == n || j-i == n|| j+i == 3*n){
                    cout << s[k];
                }else if(i == n && j == h-2 && k != s.size()-1){
                    cout << s[k+1];
                }else if((i == n-1 || i == n+1) && j == h-1 && k != s.size()-1){
                    cout << s[k+1];
                }else{
                    cout << '.';
                }
            } 
        }
        cout << '\n';
    }

    return 0 ;
}