Submission

Score: 40

User: TonnamSora

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

Language: cpp

Time: 0.002 second

Submitted On: 2025-10-08 15:59:28

#include <iostream>
using namespace std;

int a[91][250 * 45];

void draw(int N, int size, char c, int p){
    for(int i = 0; i < size; i++){
        for(int j = 0; j < size; j++){
            if(i + j == 3 * N || i + j == N || j - i == N || i - j == N){
                a[j + p][i] = c;
            }
        }
    }
}

int main(){
    string s;
    cin >> s;
    int N;
    cin >> N;
    int m = s.length();
    for(int i = 0; i < 2 * N + 1; i++){
        for(int j = 0; j < (2 * N - 1) * m + 2; j++){
            a[j][i] = '.';
        }
    }
    char c;
    int size = 2 * N + 1;
    int length = (2 * N - 1) * m + 2;
    /*for(int i = 0; i < size; i++){
        for(int j = 0; j < size; j++){
            if(i + j == 3 * N || i + j == N || j - i == N || i - j == N){
                a[j][i] = c;
            }
        }
    }*/
    int sum = 0;
    for(int i = 0; i < m; i++){
        c = s[i];
        draw(N, size, c, sum);
        sum += 2*N - 1;
    }
    for(int i = 0; i < size; i++){
        for(int j = 0; j < length; j++){
            cout << char(a[j][i]);
        }
        cout << "\n";
    }
}