/*第2回課題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 cnt=myStrlen(s);
tmp
=(char *)malloc(sizeof(char)*(cnt
*2+1));
for(i=0; i<cnt; i++){
tmp[i]=s[i];
}
for(i=0; i<cnt; i++){
tmp[cnt+i]=s[cnt-1-i];
}
tmp[cnt*2]='\0';
return tmp;
}
//メイン関数はいじる必要はありません
int main(){
int i; //不要
char nyuryoku[1024]; //入力
char *kaibun; //回文を受け取る
kaibun = setPalindrome(nyuryoku);
printf("%s\n -> %s\n",nyuryoku
,kaibun
); return 0;
}
LyrnrKwy5Zue6Kqy6aGM77ySKi8KI2luY2x1ZGUgPHN0ZGlvLmg+CiNpbmNsdWRlIDxzdGRsaWIuaD4KCmludCBteVN0cmxlbihjaGFyIHNbXSl7CiAgICBpbnQgaTsKICAgIGZvcihpPTA7c1tpXSE9J1wwJztpKyspOwogICAgcmV0dXJuIGk7Cn0KCi8vIOmWouaVsOOBruS4reOBp3RtcOOBq+WvvuOBl+OBpm1hbGxvY+OBl+OBpgovLyDjgZ3jgZPjgavlm57mlofjgpLku6PlhaXjgZfjgaZyZXR1cm7jgafov5TjgZfjgb7jgZfjgofjgYYKY2hhciAqc2V0UGFsaW5kcm9tZShjaGFyIHNbXSl7CgljaGFyICp0bXA7CgkvL+S7peS4i+OBq+W/heimgeOBquWuo+iogOOCkuWQq+OCgeOBpuabuOOBhOOBpuOBj+OBoOOBleOBhAoJaW50IGk7CglpbnQgY250PW15U3RybGVuKHMpOwoJCgl0bXA9KGNoYXIgKiltYWxsb2Moc2l6ZW9mKGNoYXIpKihjbnQqMisxKSk7CgkKCWZvcihpPTA7IGk8Y250OyBpKyspewoJCXRtcFtpXT1zW2ldOwoJfQoJCglmb3IoaT0wOyBpPGNudDsgaSsrKXsKCQl0bXBbY250K2ldPXNbY250LTEtaV07Cgl9CgkKCXRtcFtjbnQqMl09J1wwJzsKCQoJcmV0dXJuIHRtcDsKfQoKCi8v44Oh44Kk44Oz6Zai5pWw44Gv44GE44GY44KL5b+F6KaB44Gv44GC44KK44G+44Gb44KTCmludCBtYWluKCl7CiAgICBpbnQgaTsgIC8v5LiN6KaBCiAgICBjaGFyIG55dXJ5b2t1WzEwMjRdOyAvL+WFpeWKmwogICAgY2hhciAqa2FpYnVuOyAgIC8v5Zue5paH44KS5Y+X44GR5Y+W44KLCiAgICBzY2FuZigiJXMiLG55dXJ5b2t1KTsKICAgIGthaWJ1biA9IHNldFBhbGluZHJvbWUobnl1cnlva3UpOwogICAgcHJpbnRmKCIlc1xuICAtPiAlc1xuIixueXVyeW9rdSxrYWlidW4pOwogICAgZnJlZShrYWlidW4pOwogICAgcmV0dXJuIDA7Cn0K