Submission

Score: 100

User: sakuragichan

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

Language: cpp

Time: 0.032 second

Submitted On: 2026-10-09 21:45:05

#include <iostream>
#include <string>
#include <vector>
using namespace std;

int main(){
	cin.tie(0)->sync_with_stdio(0);
	vector<vector<char>> arr(100,vector<char>(25000,'.'));
	string s;
	int n,start = 0;
	cin >> s >>n;
	for(char c:s){
		for (int i = 0;i <= n;i++){
			arr[i][start+n-i] = c;
			arr[i][start+n+i] = c;
			arr[n+i][start+n*2-i] = c;
			arr[n+i][start+i] = c;
		}
		start+=(n*2-1);
	}
	for (int i = 0;i < n*2+1;i++){
		for (int j = 0;j<n*2*s.length()-(s.length()-2);j++){
			cout << arr[i][j];
		}
		cout << '\n';
	}
	return 0;
}