Submission
Status:
-----PP---
Subtask/Task Score:
20/100
Score: 20
User: peilin
Problemset: ห่วงโซ่ (Chain)
Language: c
Time: 0.013 second
Submitted On: 2025-10-12 22:53:38
#include <stdio.h>
#include <string.h>
int main() {
char s[260];
int h;
fgets(s, sizeof(s), stdin);
s[strcspn(s, "\n")] = 0;
scanf("%d", &h);
int n = strlen(s);
int size = 2 * h + 1;
for (int i = 0; i < size; i++) {
int t = i <= h ? i : 2 * h - i;
for (int j = 0; j < n; j++) {
for (int k = 0; k < size; k++) {
if (k == h - t || k == h + t)
printf("%c", s[j]);
else
printf(".");
}
}
printf("\n");
}
return 0;
}