Submission

Score: 100

User: NovemNotes

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

Language: cpp

Time: 0.033 second

Submitted On: 2025-10-16 10:18:44

#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;
    int m = s.size();
    vector<vector<char>> vec(2*n+1+2,vector<char>((2*n+1)*m+2,'.'));
    int stx=0,sty=0;
    int last=0;
    for(int k=0;k<m;k++){
        for(int i=-n;i<=n;i++){
            for(int j=-n;j<=n;j++){
                if(abs(i)+abs(j)==n){
                    vec[i+n+stx][j+n+sty]=s[k];
                    last=max(last,j+n+sty);
                }
            }
        }
        sty+=(2*n-1);
    }
    for(int i=0;i<=2*n;i++){
        for(int j=0;j<=last;j++){
            cout << vec[i][j];
        }cout << "\n";
    }
    return 0;
}
/*
Luffy
5
-3

LALISA
6
-4

TOI
4
-1
*/