Happy Number

-
Guys, I'm back with a new program and it is also in C language. 
So get ready to find your lucky number now..😃


Happy Number..
          Doesn't it seem interesting.. 😉
          Yeah off course it is..!

           What is a happy number. If the repeated sum of digits of  any number is '1', then it is considered to be a happy.. And if it is not then it is sad number. 
         Also when the sum of  digits of a number becomes 4..we cannot get '1' as a result because it requires so many iterations and we remain messed up into an infinite loop.., so if sum of digits is 4 then it is also a sad number.
           Let's take an example.Suppose we have a number 19. 

19 -> 1 and 9 
1^2 + 9^2 = 82
again,
82 -> 8 and 2
8^2 + 2^2 = 68
again,
68-> 6 and 8
6^2 + 8 ^2 = 100
again,
100 -> 1 0 and 0
1^2 + 0^2 + 0 ^2 = 1


Yeeh..we got 1. Thus the number 19 is a happy number.😄

So which one is the sad number.. Let's take an example of it. Examples are always better.
           Suppose we have a number 11.

11 means 1 and 1
1^2 + 1^2 = 2
2^2 = 4 ... 

Ohh..here we get the number 4. Our number '11' is a sad number.😢

So this is the concept of happy number and the sad one.

          Now let's see the program for calculating whether the number you have entered is happy or sad. I've also shown the square operation to help you know the number of iterations required.

#include<stdio.h>
#include<conio.h>
int main()
{
int sum=0,temp=0,i=1;
long num=0;
clrscr();
printf("Enter the number to check whether it is happy or sad!: ");
scanf("%d",&num);
do  // loop for taking sum again as input
{
while(num>=1) //loop for separating and summing up the digits
{
temp = num % 10;
sum =sum+ (temp*temp);
printf("Sum of square operation no %d performed is %d.\n",i,sum); //to show iteration
i++;
num = num /10;
}
if(sum==4) //sad condition;exit
break;

num = sum;
sum=0;
}
while(num>1);
if(num==1)
printf("Your number is happy!");
else
printf("Your number is sad..!");
getch();
return 0;
}

Here's the output of above program:=>
happy number
Output of the above program
           So guys.. I keep updating my blog regularly with new and interesting programs . Follow for getting a notification . Feel free to ask any queries in the comment box below.

Comments

Post a Comment

Popular posts from this blog

POLYGON CLIPPING PROGRAM IN C | SUTHERLAND HODGEMAN ALGORITHM FOR POLYGON CLIPPING

-
Image
POLYGON CLIPPING PROGRAM IN C | SUTHERLAND - HODGEMAN ALGORITHM FOR POLYGON CLIPPING In computer graphics, we have to study the Sutherland - Hodgeman polygon clipping algorithm. The algorithm according to the book by A. P. Godse is as follows:  Algorithm:-        Step 1- Read coordinates of all the vertices of polygon        Step 2- Read coordinates of the clipping window        Step 3- Consider the left edge of window        Step 4- Compare the vertices of each edge of the                                polygon , individually with clipping plane.        Step 5-Save the resulting intersections and vertices in                         the new list of vertices according to four possible          ...
Read more

Traffic Signal Simulator in C graphics

-
Image
Hey Guys..              I'm back with a new program and guess what? It's also in C .            I have built a program of Traffic Signal Simulator using Graphics. It simply shows a simulation of traffic signal like red,yellow and green lights lighting after regular intervals. Here you go ---> #include<conio.h> #include<graphics.h> #include<stdlib.h> #include<dos.h> int main() { int gd,gm,midx,midy; detectgraph(&gd,&gm); initgraph(&gd,&gm,"c:\\turboc3\\bgi");//initialize graphics midx=getmaxx()/2;//midpoint of x axis // midy=getmaxy()/2;midpoint of y axis settextstyle(0,HORIZ_DIR,2); outtextxy(150,50,"TRAFFIC SIGNAL SIMULATOR"); setcolor(WHITE); rectangle(midx-40,100,midx+40,320); rectangle(midx-15,320,midx+15,480); floodfill(midx-14,321,WHITE); circle(midx,140,30); circle(midx,210,30); circle(midx,280,30); w...
Read more

Floyd's triangle and reverse Floyd's triangle in java

-
Image
Hello friends, Let's see what is Floyd's triangle! The concept of Floyd's Triangle  was invented by the computer scientist Robert Floyd. Floyd's Triangle is a right angled triangle filled by natural numbers, which is having n rows. In this triangle nth row will have n natural numbers. So in the first row there will  be only 1 element, that is, 1, in the second row there will be 2 elements next to one, 2 and 3, in third row there will be 3 elements 4,5 and 6. In this way the triangle so formed is called Floyd's Triangle. 1 2 3 4 5 6 7 8 9 10 This is the Floyd's Triangle having 4 rows. Reverse Floyd's Triangle:- Now let us see what is Reverse Floyd's Triangle. It is simply reverse of Floyd's Triangle. The natural numbers are written from end to start. For example, the Reverse Floyd's Triangle for 4 rows will be: 10 9 8 7 6 5 4 3 2 1 This is the Reverse Floyd's Triangle having 4 rows. Here's a program to print Floyd...
Read more