Skip to main content

C program to find a given number is pallindrome or not


#include<stdio.h>
#include<conio.h>
void main()
{
int no,d,sc,rev=0;
clrscr();
printf("\nenter no(chek for pallinrome)=");
scanf("%d",&no);
sc=no; //second copy of no
while(no>0)
{
d=no%10;
rev=rev*10+d;
no=no/10;
}
if(rev==sc)
{
printf("\n \n %d is pallindrome",sc);
}
else
{
printf("\n \n%d is not pallindrome",sc);
}
getch();
}

OUTPUT


enter no(chek for pallinrome)=121
121 is palindrome
enter no(chek for pallinrome)=132
132 is not pallindrome


Comments

Popular posts from this blog

8 common methods for server performance optimization

  1. Use an in-memory database In-memory database is actually a database that puts data in memory and operates directly. Compared with the disk, the data read and write speed of the memory is several orders of magnitude higher. Saving the data in the memory can greatly improve the performance of the application compared to accessing it from the disk. The memory database abandoned the traditional way of disk data management, redesigned the architecture based on all data in memory, and made corresponding improvements in data caching, fast algorithms, and parallel operations, so the data processing speed is faster than that of traditional databases. Data processing speed is much faster.       But the problem of security can be said to be the biggest flaw in the memory database. Because the memory itself has the natural defect of power loss, when we use the memory database, we usually need to take some protection mechanisms for the data on the memory in advance, such...

Recursion-maze problem - Rat in the Maze - Game

  package com.bei.Demo01_recursion; public class MiGong {     public static void main(String[] args)  {         //First create a two-dimensional array to simulate the maze         int [][]map=new int[8][7];         //Use 1 for wall         for (int i = 0; i <7 ; i++) {             map[0][i]=1;             map[7][i]=1;         }         for (int i = 0; i <8 ; i++) {             map[i][0]=1;             map[i][6]=1;         }         //Set the bezel         map[3][1]=1;         map[3][2]=1;         //Output         for (int i = 0; i <8 ; i++) {             for (int j = 0; j ...

AirBnB Infographic Journey to IPO

  Full Post at  https://techpomelo.com/2020/10/infographics-airbnb-milestone-journey-to-ipo/