Skip to main content

PROGRAMMING FOR PROBLEM SOLVING LAB : Program 23


Write a C program to find the sum of individual digits of a positive integer and test given number is palindrome.

(Palindrome number is such number which when reversed is equal to the original number. For example: 121, 12321, 1001 etc.)

#include <stdio.h>

void main()

{

int n, temp, r=0,sum=0, rev = 0; 

clrscr();

printf("\n Enter an integer: \n"); 

scanf("%d", &n);

/* original number is stored at temp */

temp = n; 

while (n > 0)

{

r = n % 10;

sum=sum+r; // sum of Individual Numbers 

rev = rev * 10 + r;

n = n/10;

}

printf("\n Given number is = %d\n", temp);

printf(“\n Sum of individual digits of a given number is:%d”, sum); 

printf("\n Its reverse is = %d\n", rev);

if (temp == rev)

printf("\n %d Number is a palindrome \n", temp); 

else

printf("\n %d is Number is not a palindrome \n", temp); 

getch();

}


OUTPUT:

Enter an integer: 
545
Given number is = 545

 Sum of individual digits of a given number is:14
 Its reverse is = 545

 545 Number is a palindrome 

Comments

Popular posts from this blog

EAMCET and ECET Web Options Guidance For Data Science, AI and Machine Learning.

EAMCET and ECET WEB OPTIONS GUIDANCE   Data Science, AI ,Machine Learning and CSE:  These NEW courses are trending now and according to the research these courses are having  tremendous  future in coming days. All these branches are sub branches of CSE and now it became separate Technologies. For video explanation click on  click here                Branch Name                                                                      Branch code 1. CSE(Artificial Intelligence and Machine Learning)                                            CSM 2. CSE...

PROGRAMMING FOR PROBLEM SOLVING LAB : Program 19

Write a C program that uses non recursive function to search for a Key value in a given List of integers using linear search method. Algorithm: 1. 1. Start 2. 2. Read the value of n 3. 3. for i=1 to n increment in steps of 1 Read the value of ith element into array 4. 4. Read the element(x) to be searched 5. 5. search<--linear(a,n,x) 6. 6. if search equal to 0 goto step 7 otherwise goto step 8 7. 7. print unsuccessful search 8. 8. print successful search 9. 9. stop PROGRAM: #include <stdio.h> long linear_search(long a[100], long, long);  void main() { long array[100], search, i, n, position;  //clrscr(); printf("\n Entered N values:\n");  scanf("%ld", &n); printf("\n Entered %d numbers:\n", n);  for (i= 0; i < n; i++) scanf("%ld", &array[i]); printf("\n Enter number to search: \n");  scanf("%ld", &search); position = linear_search(array, n, search);  if (position == -1) printf("%l...