fork download
  1. //課題3
  2. # include <stdio.h>
  3.  
  4. int isPalindrome(char s[]){
  5. int i,h_counts,counts;
  6. for(i=0;s[i]!='\0';i++){
  7. ;
  8. }
  9. counts=i;
  10. h_counts=i-1;
  11. if(counts%2==0){
  12. for(i=0;s[i]==s[h_counts-i];i++){
  13. if(i==h_counts/2)return 1;
  14. }
  15. }else if(counts%2==1){
  16. for(i=0;s[i]==s[h_counts-i];i++){
  17. if(i==counts/2)return 1;
  18. }
  19. }
  20. return 0;
  21.  
  22. }
  23.  
  24. //メイン関数は書き換えなくてよいです
  25. int main(){
  26. char s[100];
  27. scanf("%s",s);
  28. printf("%s -> %d\n",s,isPalindrome(s));
  29. return 0;
  30. }
  31.  
Success #stdin #stdout 0s 5320KB
stdin
abbb
stdout
abbb -> 0