Submission

Score: 100

User: bananakung

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

Language: cpp

Time: 0.050 second

Submitted On: 2025-12-18 21:58:11

#include<bits/stdc++.h>
using namespace std;
char pic[1000][30000];
void draw(char in,int n,int dx)
{
	int r=2*n+1;
	
	for(int i=0;i<r;i++)
	{
		for(int  j=0;j<r;j++)
		{
			if(i+j==n  ||  j-i==n  ||  i+j==n+2*n || i-j==n) pic[i][j+dx]=in;
		}
	}
	
}

void print(int n,string word)
{
	int r=2*n+1;
	for(int i=0;i<r;i++)
	{
		for(int  j=0;j<  2*n+ ((2*n-1)*(word.length()-1))+1  ;j++)
		{
			cout<<pic[i][j];
		}
		cout<<"\n";
	}
	
}


int main()
{
	memset(pic,'.',sizeof pic);
	string word;
	int n;
	cin>>word>>n;
	for(int i=0;i<word.length();i++)
	{
		draw(word[i],n,(2*n-1)*i);
	}
	print(n,word);
	
	
}