Submission

Score: 100

User: aomILOVEMYFRIEND

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

Language: cpp

Time: 0.039 second

Submitted On: 2025-10-10 14:50:15

#include<bits/stdc++.h>
#pragma GCC optimize ("Ofast")
#define int long long
using namespace std;
string s;
int n;
signed main(){
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>s>>n;
    for(int i=0;i<2*n+1;i++){
        for(int j=0;j<(2*n+1)*s.size()-2*s.size()+2;j++){
            if((i+j-n)%(2*n-1)==0&&i<=n&&(i+j-n)/(2*n-1)<s.size()){
                cout<<s[(i+j-n)/(2*n-1)];
            }
            else if((j-i-n)%(2*n-1)==0&&i<=n&&j>n&&(j-i-n)/(2*n-1)<s.size()){
                cout<<s[(j-i-n)/(2*n-1)];
            }
            else if((j-i+n)%(2*n-1)==0&&i>n&&j>0&&(j-i+n)/(2*n-1)<s.size()){
                cout<<s[(j-i+n)/(2*n-1)];
            }
            else if((i+j-3*n)%(2*n-1)==0&&i>n&&j>n&&(i+j-3*n)/(2*n-1)<s.size()){
                cout<<s[(i+j-3*n)/(2*n-1)];
            }
            else{
                cout<<'.';
            }
        }
        cout<<'\n';
    }
}