Submission

Score: 40

User: TonnamSora

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

Language: cpp

Time: 0.004 second

Submitted On: 2025-10-13 12:26:01

#include <iostream>
using namespace std;

int a[100][25000];

int main() {
    string s;
    cin >> s;
    int N;
    cin >> N;
    int m = s.length();
    int size = 2 * N + 1;
    int length = (2 * N - 1) * m + 2;
    for (int i = 0; i < 2 * N + 1; i++) {
        for (int j = 0; j < (2 * N - 1) * m + 2; j++) {
            a[j][i] = '.';
        }
    }
    int sum = 0;
    for (int idx = 0; idx < m; idx++) {
        char c = s[idx];
        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 + sum][i] = c;
                }
            }
        }
        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";
    }
}