Submission

Score: 100

User: dddrrrr

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

Language: cpp

Time: 0.036 second

Submitted On: 2025-10-16 10:22:06

#include <bits/stdc++.h>
using namespace std;
int main(){
	cin.tie(0)->sync_with_stdio(0);
	cout.tie(0)->sync_with_stdio(0);
	
	string str;
	cin >> str;
	int n;
	cin >> n;
	int m = str.size();
	
	vector <vector <char>> vec(2*n+1 ,vector <char>((2*n - 1)*m +2   ,'.'));
	
	int c = 0;
	for(int k=0 ;k<m ;k++){
		
		for(int i=-n ;i<=n ;i++){
			for(int j=-n ;j<=n ;j++){
				if(abs(i) + abs(j) == n)vec[i+n][j+n+c] = str[k];
			}
		}
		c+=2*n - 1;
	}
	
	for(auto row : vec){
		for(auto col : row){
			cout << col;
		}
		cout << "\n";
	}
	
	return 0;
}