Submission

Status:

-----PP---

Subtask/Task Score:

20/100

Score: 20

User: NovemNotes

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

Language: cpp

Time: 0.032 second

Submitted On: 2025-10-16 09:56:05

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

int main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    string s;cin >> s;
    int n;cin >> n;
    for(int i=-n;i<=n;i++){
        for(int k=0;k<s.size();k++){
            for(int j=-n;j<=n;j++){
                if(abs(i)+abs(j)==n)cout << s[k];
                else cout << ".";
            }
        }
        cout << "\n";
    }
    return 0;
}