Submission

Score: 100

User: TonnamSora

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

Language: cpp

Time: 0.373 second

Submitted On: 2025-10-13 12:30:30

#include <iostream>
using namespace std;

int main() {
    string s;
    cin >> s;
    int N;
    cin >> N;
    int size = 2 * N + 1;
    int m = s.length();
    int length = (2 * N - 1) * m + 2;
    for (int i = 0; i < size; i++){
        for (int j = 0; j < length; j++){
            char c = '.';
            for (int k = 0; k < m; k++){
                int p = k * (2 * N - 1);
                int x = j - p;
                if (x >= 0 && x < size) {
                    if (i + x == 3 * N || i + x == N || x - i == N || i - x == N) {
                        c = s[k];
                        break;
                    }
                }
            }
            cout << c;
        }
        cout << "\n";
    }
}