fork download
copy 
  1. # include <stdio.h>
  2.  
  3. int isPalindrome(char s[]){
  4. 	int t[100];
  5. 	int count=0;
  6.  
  7. 	for(int i=0;s[i]!='\0';i++){
  8. 		count++;
  9. 	}
  10.  
  11. 	printf("count=%d\n",count);
  12.  
  13. 	printf("配列t に代入\n");
  14. 	for(int j=0;j<count;j++){
  15. 		t[j]=s[count-j-1];
  16. 		printf("t[%d] %c s[%d] %c\n",j,t[j],count-j-1,s[count-j-1]);
  17. 	}
  18. 	t[count]='\0';
  19.  
  20. 	printf("比較\n");
  21. 	for(int k=0;s[k]==t[k];k++){
  22. 		printf("s[%d] %c t[%d] %c\n", k, s[k], k, t[k]);
  23. 		if(s[k]=='\0'){
  24. 			return 1;
  25. 		} 
  26. 	}
  27. 	return 0;
  28.  
  29. }
  30.  
  31. int main(){
  32.     char s[100];
  33.     scanf("%s",s);
  34.     printf("%s -> %d\n",s,isPalindrome(s));
  35.     return 0;
  36. }
Success #stdin #stdout 0.01s 5276KB
comments (?)
stdin
copy 
dvd
stdout
copy 
count=3
配列t に代入
t[0] d s[2] d
t[1] v s[1] v
t[2] d s[0] d
比較
s[0] d t[0] d
s[1] v t[1] v
s[2] d t[2] d
s[3]  t[3] 
dvd -> 1
https://ideone.com/LlTCMU
language:
C (gcc 8.3)
created:
6 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!