//課題2
#include <stdio.h>
#include <stdlib.h>
int myStrlen(char s[]){
int i;
for(i=0;s[i]!='\0';i++);
return i;
}
// 関数の中でtmpに対してmallocして
// そこに回文を代入してreturnで返しましょう
char *setPalindrome(char s[]){
char *tmp;
//以下に必要な宣言を含めて書いてください
int i;
int l;
int k;
int q;
l=myStrlen(s);
k=l*2;
q=l-1;
tmp
=(char*)malloc(sizeof(char)*(k
+1)); if(tmp==NULL){
}
for(i=0;i<l;i++){
tmp[i]=s[i];
}
for(i=0;i<4;i++){
tmp[l+i]=s[q-i];
}
tmp[k]='\0';
return tmp;
}
//メイン関数はいじる必要はありません
int main(){
// int i;
char nyuryoku[1024]; //入力
char *kaibun; //回文を受け取る
kaibun = setPalindrome(nyuryoku);
printf("%s\n -> %s\n",nyuryoku
,kaibun
); return 0;
}
Ly/oqrLpoYzvvJIKCiNpbmNsdWRlIDxzdGRpby5oPgojaW5jbHVkZSA8c3RkbGliLmg+CgppbnQgbXlTdHJsZW4oY2hhciBzW10pewogICAgaW50IGk7CiAgICBmb3IoaT0wO3NbaV0hPSdcMCc7aSsrKTsKICAgIHJldHVybiBpOwp9CgovLyDplqLmlbDjga7kuK3jgad0bXDjgavlr77jgZfjgaZtYWxsb2PjgZfjgaYKLy8g44Gd44GT44Gr5Zue5paH44KS5Luj5YWl44GX44GmcmV0dXJu44Gn6L+U44GX44G+44GX44KH44GGCmNoYXIgKnNldFBhbGluZHJvbWUoY2hhciBzW10pewoJY2hhciAqdG1wOwoJCgkvL+S7peS4i+OBq+W/heimgeOBquWuo+iogOOCkuWQq+OCgeOBpuabuOOBhOOBpuOBj+OBoOOBleOBhAoJaW50IGk7CglpbnQgbDsKCWludCBrOwoJaW50IHE7CglsPW15U3RybGVuKHMpOwoJaz1sKjI7CglxPWwtMTsKCXRtcD0oY2hhciopbWFsbG9jKHNpemVvZihjaGFyKSooaysxKSk7CglpZih0bXA9PU5VTEwpewogICAgCXByaW50ZigiRVJST1JcbiIpOwogICAgfQoJCglmb3IoaT0wO2k8bDtpKyspewoJCXRtcFtpXT1zW2ldOwoJfQoJZm9yKGk9MDtpPDQ7aSsrKXsKCQl0bXBbbCtpXT1zW3EtaV07Cgl9CgkKCXRtcFtrXT0nXDAnOwoJCglyZXR1cm4gdG1wOwoJCn0KCgovL+ODoeOCpOODs+mWouaVsOOBr+OBhOOBmOOCi+W/heimgeOBr+OBguOCiuOBvuOBm+OCkwppbnQgbWFpbigpewogIC8vICBpbnQgaTsKICAgIGNoYXIgbnl1cnlva3VbMTAyNF07IC8v5YWl5YqbCiAgICBjaGFyICprYWlidW47ICAgLy/lm57mlofjgpLlj5fjgZHlj5bjgosKICAgIHNjYW5mKCIlcyIsbnl1cnlva3UpOwogICAga2FpYnVuID0gc2V0UGFsaW5kcm9tZShueXVyeW9rdSk7CiAgICBwcmludGYoIiVzXG4gIC0+ICVzXG4iLG55dXJ5b2t1LGthaWJ1bik7CiAgICBmcmVlKGthaWJ1bik7CiAgICByZXR1cm4gMDsKfQo=