#include #include int i,no; int Pale(int n){ int q,w,e,t,y; int r[6]; q=n; // Self explanatory if (n<10){ printf("Single digit numbers are palindrome"); exit(0); } /*the array r stores GIF for n/10^something, which will be used by us to calculate the digits*/ r[0]=n/10; r[1]=n/100; r[2]=n/1000; r[3]=n/10000; r[4]=n/100000; r[5]=n/1000000; //store the first digit of the number for (int p = 0; p < no-1; p++) { q=q/10; } w=n%10; //last digit of the number //terminate if first and last digits dont match if(w!=q){ exit(0);} //if only 2 digit number then no need to continue, needed to mention n<100 for 101 like numbers. if (r[0]<10&&n<100){printf("This is a palindrome"); exit(0); } // subtract the ns place like 1021-1000=021, we subtract the thousands digit. e=q*10; for (int TE = 0; TE < no-2; TE++) { e=e*10; } e=n-e; //calculate the 2nd last digit of the number t=r[1]%10; //now calculate 2nd digit for (int p = 0; p < no-2; p++) { e=e/10; } //if both digit match continue else terminate if(e!=t){ exit(0); } printf("This is a palindrome"); return 0; } //This takes in the input int main() { printf("Please enter your number\n" ); scanf("%d",&i); printf("How many digits in your number?\n" ); scanf("%d",&no); int k; k=no%2; // call the required funcion for even/odd number of digits if (k==0||i<10){ Pale(i);} //else { // Palo(i); //} return 0; }

12/19/2021 22:01