Submission

Score: 0

User: spammer_destroyer

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

Language: cpp

Time: 0.041 second

Submitted On: 2025-10-27 07:25:58

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

int main() 
{
    string str;
    int n,i,j,l;
    cin >> str >> n;
    int len=str.length();
    vector<vector<char>> arr(2*n+1,vector<char>(len*(2*n+1)-n+1,'.'));
    int sum=0;
    for(i=0;i<2*n+1;i++) {
      for(l=0;l<len;l++) {
        for(j=0;j<2*n+1;j++) {
          if(i+j==n||i+j==n*3||i-j==n||j-i==n) {
            arr[i][sum+j]=str[l];
          }
        }
        sum+=(2*n-1);
      }
      sum=0;
      cout << "\n";
    }
    //print out array
    for(i=0;i<2*n+1;i++) {
      for(j=0;j<len*(2*n+1)-2*n+2;j++) {
        cout << arr[i][j];
      }
      cout << "\n";
    }
    return 0;
}