#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,j,count,count2;
	count=myStrlen(s);
	tmp=(char*)malloc(sizeof(char)*count*2);
 
	for(i=0;i<count;i++){
		tmp[i]=s[i];
	}
	count2=count;
	for(i=count2;i<count2*2;i++){
		tmp[i]=s[count-1];
		count--;
	}
	tmp[count2*2]='\0';
	return tmp;
}
 
 
//メイン関数はいじる必要はありません
int main(){
    int i;
    char nyuryoku[1024]; //入力
    char *kaibun;   //回文を受け取る
    scanf("%s",nyuryoku);
    kaibun = setPalindrome(nyuryoku);
    printf("%s\n  -> %s\n",nyuryoku,kaibun);
    free(kaibun);
    return 0;
}
 

I2luY2x1ZGUgPHN0ZGlvLmg+CiNpbmNsdWRlIDxzdGRsaWIuaD4KCi8v5paH5a2X5YiX44Gu5pWw44KS44Kr44Km44Oz44OI44GZ44KL6Zai5pWwCmludCBteVN0cmxlbihjaGFyIHNbXSl7CiAgICBpbnQgaTsKICAgIGZvcihpPTA7c1tpXSE9J1wwJztpKyspOwogICAgcmV0dXJuIGk7Cn0KCi8vIOmWouaVsOOBruS4reOBp3RtcOOBq+WvvuOBl+OBpm1hbGxvY+OBl+OBpgovLyDjgZ3jgZPjgavlm57mlofjgpLku6PlhaXjgZfjgaZyZXR1cm7jgafov5TjgZfjgb7jgZfjgofjgYYKY2hhciAqc2V0UGFsaW5kcm9tZShjaGFyIHNbXSl7CgljaGFyICp0bXA7CgkvL+S7peS4i+OBq+W/heimgeOBquWuo+iogOOCkuWQq+OCgeOBpuabuOOBhOOBpuOBj+OBoOOBleOBhAoJaW50IGksaixjb3VudCxjb3VudDI7Cgljb3VudD1teVN0cmxlbihzKTsKCXRtcD0oY2hhciopbWFsbG9jKHNpemVvZihjaGFyKSpjb3VudCoyKTsKCQoJZm9yKGk9MDtpPGNvdW50O2krKyl7CgkJdG1wW2ldPXNbaV07Cgl9Cgljb3VudDI9Y291bnQ7Cglmb3IoaT1jb3VudDI7aTxjb3VudDIqMjtpKyspewoJCXRtcFtpXT1zW2NvdW50LTFdOwoJCWNvdW50LS07Cgl9Cgl0bXBbY291bnQyKjJdPSdcMCc7CglyZXR1cm4gdG1wOwp9CgoKLy/jg6HjgqTjg7PplqLmlbDjga/jgYTjgZjjgovlv4XopoHjga/jgYLjgorjgb7jgZvjgpMKaW50IG1haW4oKXsKICAgIGludCBpOwogICAgY2hhciBueXVyeW9rdVsxMDI0XTsgLy/lhaXlipsKICAgIGNoYXIgKmthaWJ1bjsgICAvL+WbnuaWh+OCkuWPl+OBkeWPluOCiwogICAgc2NhbmYoIiVzIixueXVyeW9rdSk7CiAgICBrYWlidW4gPSBzZXRQYWxpbmRyb21lKG55dXJ5b2t1KTsKICAgIHByaW50ZigiJXNcbiAgLT4gJXNcbiIsbnl1cnlva3Usa2FpYnVuKTsKICAgIGZyZWUoa2FpYnVuKTsKICAgIHJldHVybiAwOwp9Cg==

ZmN0b2t5bw==

fctokyo