Submission

Score: 100

User: anonymous

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

Language: cpp

Time: 0.378 second

Submitted On: 2026-10-02 16:28:34

#include <bits/stdc++.h>
using namespace std;
int main () {
	string s; cin >> s;
	int n; cin >> n;
	int size = 2 * n + 1;
    int m = s.length();
	
	int l =  (2 * n - 1)*m + 2;
	
	for (int i = 0; i < size; i++){
        for (int j = 0; j < l; 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";
    }
}