Submission

Score: 100

User: njoop

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

Language: cpp

Time: 0.029 second

Submitted On: 2025-05-24 17:51:25

#include <iostream>
#include <vector>
using namespace std;
int main()
{
    string st;
    int i,j,k,n,h;
    cin >> st; n = st.length();
    cin >> h;
    vector <vector <char> > scr(2*h+1,vector<char>(n*(2*h-1)+2,'.'));
    for (i=0;i<n;i++)
        for (j=0;j<2*h+1;j++)
            for (k=0;k<2*h+1;k++)
                if (j+k==h || j+k==3*h || j-k == h || k-j==h)
                    scr[j][k+i*(2*h-1)]=st[i];
    for (i=0;i<2*h+1;i++)
    {
        for (j=0;j<n*(2*h-1)+2;j++)
            cout << scr[i][j];
        cout << endl;
    }
    return 0;
}