Submission

Score: 100

User: Bestzu

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

Language: cpp

Time: 0.033 second

Submitted On: 2025-10-16 11:54:25

#include<bits/stdc++.h>
using namespace std;

int main() {
	ios::sync_with_stdio(false); cin.tie(0);
	
	string s; cin >> s;
	int r; cin >> r;
	
	int n = 2*r+1, m = (2*r+1) + ((s.size()-1) * (2*r-1)); 
//	cout << n << " " << m << endl;
	
	int start = 0;
	int ci = r, cj = r;
	vector<vector<char>> a(n, vector<char>(m, '.'));
	for(int k = 0; k < s.size(); k++) {
//		cout << "k = " << k << endl;
		for(int i = 0; i < n; i++) {
			for(int j = start; j <= start+2*r; j++) {
				if(abs(i-ci) + abs(j-cj) == r) {
					a[i][j] = s[k];
				}
			}
		}
//		cout << start << endl;
		cj += 2*r-1;
		start += 2*r-1;
	}
	
	for(int i = 0; i < n; i++) {
		for(int j = 0; j < m; j++) {
			cout << a[i][j];
		}
		cout << '\n';
	}
	return 0;
}