Submission

Score: 100

User: navysrimuang

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

Language: cpp

Time: 0.039 second

Submitted On: 2025-09-28 18:54:21

#include<bits/stdc++.h>
using namespace std;
#define endl "\n"



int main(){
    
    string s;
    int n;
    cin >> s;
    cin >> n;
    int len = s.length();
    
    int N = 2*n+1;
    int M = (2*n-1)*len + 2;
    int k = 0;
    vector<string> v (N, string(M,'.'));
    
    //first diamond
    k = 0;
    for(int cpy = 0;cpy<len;cpy++){
        
        for(int i = 0;i<N;i++){
            for(int j = 0;j<N;j++){
                if(i+j == (N-1)/2 || j - i == (N-1)/2 || i - j == (N-1)/2 || i + j == 3*(N-1)/2 ){
                    v[i][j + k] = s[cpy];
                }
                
            
            }
        }
        k+=(2*n - 1);
    }
    
 
    
    //just printing
    for(int i = 0;i<N;i++){
        for(int j = 0;j<M;j++){
            cout << v[i][j];
        }
        cout << endl;
    }
    return 0;
}