fork(1) 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.  
  19. 	printf("比較\n");
  20. 	for(int k=0;s[k]==t[k];k++){
  21. 		printf("s[%d] %c t[%d] %c\n", k, s[k], k, t[k]);
  22. 		if(s[k]=='\0'){
  23. 			return 1;
  24. 		} 
  25. 	}
  26. 	return 0;
  27.  
  28. }
  29.  
  30. int main(){
  31.     char s[100];
  32.     scanf("%s",s);
  33.     printf("%s -> %d\n",s,isPalindrome(s));
  34.     return 0;
  35. }
Success #stdin #stdout 0s 5284KB
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
dvd -> 0
https://ideone.com/wsoYsJ
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!