Mirror of Mahatma Gandhi : HackerEarth Problem Solution

Mirror of Mahatma Gandhi : HackerEarth Problem Solution

Input:

2 

101 

020

Output:

YES 

NO

Implementation:

#include <stdio.h> #define MAX 100000 int checkpalin(char s[],int len) { char des[len]; int i,j; des[len]='\0'; for(i=len-1,j=0;i>=0;i--,j++) { des[j]=s[i]; } return (strcmp(s,des)==0); } int main() { long int N,i; int flag,status; char str[MAX]; scanf("%ld",&N); while(N--) { flag=0; scanf("%s",&str); status=checkpalin(str,strlen(str)); if(status) { i=0; while(str[i]!='\0') { if(str[i]!='0' && str[i]!='1' && str[i]!='8') { flag=1; break; } i++; } if(flag==0) printf("YES\n"); else printf("NO\n"); } else printf("NO\n"); } return 0; }