Java - Happy Number Program.

 


 Happy Number Program.


import java.util.Scanner;
class  HappyNum
{
    public static void main(String[] args)
    {
        Scanner sc=new Scanner(System.in);
        System.out.println("Enter Number");
        int num=sc.nextInt();
        int rem=0;
        int sqr=0;
        while(num>9)
        {
            int sum=0;
            while(num>0)
            {
                rem=num%10;
                sqr=rem*rem;
                sum=sum+sqr;
                num=num/10;
            }
            num=sum;
        }
        if(num==1)
        {
            System.out.println("Happy Number");
        }
        else
        {
            System.out.println("Not Happy");
        }
    }
}

 

Location: 14/A/6/4, Thitenagar Lane No 6, Thite Vasti, Kharadi, Pune, Maharashtra 411014, India

Popular posts from this blog

In this problem, you will practice your knowledge on interfaces - Hacker Rank Solution.

  A Java interface can only contain method signatures and fields. The interface can be used to achieve polymorphism. In this problem, you will practice your knowledge on interfaces. You are given an interface  AdvancedArithmetic  which contains a method signature  int divisor_sum(int n) . You need to write a class called MyCalculator which implements the interface. divisorSum  function just takes an integer as input and return the sum of all its divisors. For example divisors of 6 are 1, 2, 3 and 6, so  divisor_sum  should return 12. The value of n will be at most 1000. Read the partially completed code in the editor and complete it. You just need to write the MyCalculator class only.  Your class shouldn't be public. Sample Input 6 Sample Output I implemented: AdvancedArithmetic 12 Explanation Divisors of 6 are 1,2,3 and 6. 1+2+3+6=12. Solution : - import java.io.*; import java.util.*; interface AdvancedArithmatic{     int divisor_su...
Read more

Find the difference between the total number of CITY entries in the table and the number of distinct CITY entries in the table.

Image
  The   STATION   table is described as follows: SOLUTION: SELECT COUNT(CITY)-COUNT(DISTINCT CITY) FROM STATION; Explanation: COUNT(*) counts all rows (including duplicates and nulls in other columns, but not in CITY directly). COUNT(DISTINCT CITY) counts unique cities only . Subtracting the two gives you the number of duplicate city entries .
Read more

Query the Name of any student in STUDENTS who scored higher than 75 Marks - Hacker Rank Solution.

Image
Query the   Name   of any student in   STUDENTS   who scored higher than    75  Marks . Order your output by the   last three characters   of each name. If two or more students both have names ending in the same last three characters (i.e.: Bobby, Robby, etc.), secondary sort them by ascending   ID . Input Format The  STUDENTS  table is described as follows:   The  Name  column only contains uppercase ( A - Z ) and lowercase ( a - z ) letters. Sample Input Sample Output Ashley Julia Belvet Solution : SELECT Name FROM STUDENTS WHERE Marks > 75 ORDER BY SUBSTR(Name, -3) ASC, ID ASC;
Read more