Weekend Task - Happy Number

[akash-coded]

A happy number can be defined as a number that will yield 1 when it is replaced by the sum of the square of its digits repeatedly. If this process results in an endless cycle of numbers containing 4, then the number is called an unhappy number.

For example, 32 is a happy number as the process yields 1 as follows:

1. 3^2 + 2^2 = 13
2. 1^2 + 3^2 = 10
3. 1^2 + 0^2 = 1

Some of the other examples of happy numbers are 7, 28, 100, 320, and so on. The unhappy number will result in a cycle of 4, 16, 37, 58, 89, 145, 42, 20, 4. If a number is happy, then all members of its sequence are happy; if a number is unhappy, all members of the sequence are unhappy.

Check whether a number is a happy number, take 'k' as input, and print the first 'k' happy numbers from this number.

[Batchusatyasri]

import java.util.Scanner;

public class Happynumber {
public static int happy(int number) {
int rem = 0;
int temp = 0;
while (number > 0) {
rem = number % 10;
temp = temp + (rem * rem);
number = number / 10;
}
return temp;
}

public static void main(String[] args) {
    int k;
    Scanner sc = new Scanner(System.in);
    System.out.println("Enter k value");
    k = sc.nextInt();
    int result = k;
    while (result != 1 && result != 4) {
        result = happy(result);
        System.out.println(result);
    }
    if (result == 1) {
        System.out.println("it is nice number ");
    } else {
        System.out.println("It is not a happy number " + result);
    }
    sc.close();
}

}

[rakeshGit419]

public class HappyNumDriver{
    public static void main(String[] args) {
        int k = 4;
        System.out.println(k);
        checkHappyNumber(k);
    }

    private static void checkHappyNumber(int k) {
        int ori_k = k;
        while(k>1){
            k = getSquareDigits(k);
            System.out.println(k);
            if(k == ori_k) break;
        }
    }

    private static int getSquareDigits(int k) {
        if(k<=1) return k;
        int n = k%10;
        return (n*n)+getSquareDigits(k/10);
    }
}

[SabaMhabar]

import java.util.Scanner;

public class HappyNumbers {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("Enter a number: ");
int n = sc.nextInt();
int m = n;
int s = 0;
while (s != 4) {
s = 0;
while (m > 0) {
s += Math.pow(m % 10, 2);
m /= 10;
}
if (s == 1) {
System.out.println("Happy Number!");
break;
} else {
m = s;
}
}
if (s == 4)
System.out.println("Unhappy Number!");
sc.close();
}
}

[ratnadeepikavuddagiri]

`import java.util.Scanner;
public class HappyNumbers{
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int k,n,m;
k= scanner.nextInt();
m=k;
while(true){
n =squareDigitsSum(m);
if(n==1){
System.out.println("Happy Number");
break;
}
else if(n==k || n==4){
System.out.println("Not a happy number");
break;
}
else{
System.out.println(n);
m=n;
}
}
}

static int squareDigitsSum(int k) {
    int s=0;
    while(k>0){
        int r = k%10;
        s += r*r;
        k /= 10;
    }
    return s;
}

}`

[Mrafe]

import java.util.Scanner;

public class HappyNumber {
    static int sumOfSquares(int n) {
        int sum = 0;
        while (n > 0) {
            int k = n % 10;
            sum += k * k;
            n = n / 10;
        }
        return sum;
    }

    static boolean happy(int num) {
        int sum = sumOfSquares(num);
        while (sum != 1 && sum != 4) {
            sum = sumOfSquares(sum);
        }
        return (sum == 1);
    }

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        System.out.println("Enter the number");
        int num = scanner.nextInt();

        if (happy(num))
            System.out.println("It is a happy number");
        else
            System.out.println("It is not a happy number");

        System.out.println("Enter the limit : ");
        int k = scanner.nextInt();
        System.out.println(k + " happy numbers from " + num + " are :");
        int i = 0;
        int temp = num + 1;
        while (i <= k) {
            if (happy(temp)) {
                System.out.print(temp + " ");
                i++;
                temp++;
            } else {
                temp++;
            }
        }
        scanner.close();

    }
}

[Sarfinaa]

import java.util.Scanner;

public class HappyNumber {
    public static int digitSquareSum(int n) {
        int ans = 0;
        while (n > 0) {
            int r = n % 10;
            ans += (r * r);
            n /= 10;
        }
        return ans;
    }

    public static boolean isHappyNumber(int n) {

        int orgiginalN = n;
        while (true) {
            if (n == 1)
                return true;
            n = digitSquareSum(n);
            if (n == 4 || n == orgiginalN)
                return false;

        }
    }

    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        System.out.print("Enter the value of number:");
        int n = s.nextInt();
        if (isHappyNumber(n)) {
            System.out.println(n + " is a Happy Number");
            System.out.print("Enter the value of K:");
            int k = s.nextInt();
            System.out.print(k + " Happy Number from " + n + " are:");
            int t = n + 1;
            for (int i = 1; i <= k;) {
                if (isHappyNumber(t)) {
                    System.out.print(t + " ");
                    t++;
                    i++;
                } else
                    t++;
            }
        } else {
            System.out.println(n + " is not a Happy Number");
        }
    }
}

[ps030300]

import java.util.Scanner;

public class HappyNumber {
public static int happy(int n) {
int a = 0;
int temp = 0;
while (n > 0) {
a = n % 10;
temp = temp + (a * a);
n = n / 10;
}
return temp;
}

public static void main(String[] args) {
    int num;
    Scanner sc = new Scanner(System.in);
    System.out.println("Enter the Number");
    num = sc.nextInt();

    int result = num;
    while (result != 1 && result != 4) {
        result = happy(result);
        System.out.println(result);
    }
    if (result == 1) {
        System.out.println(+num + " : It is Happy number ");
    } else {
        System.out.println(+num + " : It is not a Happy number ");
    }
    sc.close();
}

}``

[amruth2211]

`import java.util.Scanner;

class Happy {
int n;

public Happy(int n) {
    this.n = n;
    System.out.println("The first happy numbers from "+this.n+" number is : ");
}

void check(int a) {
    int rem = 0;
    int sum = 0;

    while (a != 0) {
        rem = a % 10;
        sum += Math.pow(rem, 2);
        a /= 10;
    }
    System.out.println(sum);
    
    if (sum == 1) {
        System.out.println(this.n + " is a happy number");
    } else if (sum == this.n) {
        System.out.println(this.n + " is a unhappy number");
    } else
        check(sum);
}

}

public class HappyNum {
public static void main(String[] args) {
Scanner scr = new Scanner(System.in);
System.out.println("Enter the number");
int n = scr.nextInt();
Happy h = new Happy(n);
h.check(n);
scr.close();
}
}`

[preeti-max]

`import java.util.;
class HappyNumber {
static int squareSum(int n){
int sum=0;
while(n!=0){
int k=n%10;
sum+=kk;
n=n/10;
}
return sum;

}
public static void main(String[] args) {
    Scanner sc=new Scanner(System.in);
    int n=sc.nextInt();
    ArrayList<Integer>a=new ArrayList<Integer>();
    int k=n;
    while(n!=1 && n!=4 ){
        n=squareSum(n);
        a.add(n);

    }
    if(n==1){
        System.out.println("The first "+k+" happy numbers from the number are:");
        System.out.println(a);
    }
    else{
        System.out.println("Not a happy number");
    }
    
            
}

}
`

[Snehil6197]

HAPPY-UNHAPPY NUMBER
import java.util.;
public class MyClass {
public static void main(String args[]) {
String num="1";
int fixed_value=Integer.parseInt(num);
int changed_value=fixed_value;
System.out.print(num+" ");
if(fixed_value!=1){
do{
int sum=0;
char[] arr=num.toCharArray();
for(int i=0;i<num.length();i++)
{
int p=arr[i]-'0';
sum+=(pp);
}
changed_value=sum;
num=String.valueOf(sum);
System.out.print(changed_value+" ");
}while(changed_value!=1 && fixed_value!=changed_value);
}
System.out.print((changed_value==1) ? "HAPPY NUMBER":"UNHAPPY NUMBER");

}

}

[SaichaitanyareddyG]

** Happy Number**

`import java.util.Scanner;
class Main {
public static int happy(int number) {
int rem = 0;
int temp = 0;
while (number > 0) {
rem = number % 10;
temp = temp + (rem * rem);
number = number / 10;
}
return temp;
}

public static void main(String[] args) {

Scanner sc = new Scanner(System.in);
System.out.print("Enter n value : ");
int n;
n = sc.nextInt();


while (n != 1 && n != 4) {
    n = happy(n);
    System.out.println(n);
}
if (n == 1) {
    System.out.println("It is happy number ");
} else {
    System.out.println("It is not a happy number : " + n);
}

}
}`

[Khyati-tripathi]

import java.util.*;

public class HappyNumbers {

    static int digitSquares(int n) {
        int res = 0;
        while (n > 0) {
            int r = n % 10;
            res += (r * r);
            n /= 10;

        }

        return res;
    }

    static boolean isHappy(int n) {
        int res = digitSquares(n);

        while (res != 1 && res != 4) {
            res = digitSquares(res);
        }
        if (res == 1)
            return true;
        else
            return false;
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        System.out.println("Enter the number ");
        int num = sc.nextInt();
        if (isHappy(num)) {
            System.out.println("It is a happy number");
            System.out.println("enter value of k ");
            int k = sc.nextInt();
            System.out.println("The numbers are: ");
            int i = 0;
            int knum = num + 1;
            while (i != k) {
                if (isHappy(knum)) {
                    System.out.print(knum + " ");
                    i++;
                    knum++;
                } else
                    knum++;

            }
        } else
            System.out.println("It is a not happy number");

    }
}

[Amrit-Raj22]

import java.util.Scanner;

public class HappyNumber {
    public static boolean findHappy(int n) {
        int a = n, sum = n;
        while (sum > 9) {
            sum = 0;
            while (a > 0) {
                int d = a % 10;
                sum += d * d;
                a /= 10;
            }
            if (sum == 1) {
                return true;
            }
            a = sum;
        }
        if (sum == 7) {
            return true;
        }
        return false;
    }

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int count = 0;
        int temp = n;

        while (count < temp) {
            if (findHappy(n)) {
                count++;
                System.out.println(n);
            }
            n++;
        }

    }
}

[deepak775035]

package session10.weekendTask;

public class HappyNumber {
    
    static int squareAddDigit(int temp){
        int ans=0;
        int digit=0;

        while(temp>0){
            digit=temp%10;
            digit=digit*digit;
            ans+=digit;
            temp/=10;
        }

        return ans;
    }
    
    public static boolean isHappyNumber(int num){
        int temp=num;
        System.out.println("\nChecking for "+num);

        do {
            temp=squareAddDigit(temp);
            System.out.println(temp);
        } while (temp!=num && temp!=1);

        return temp==1;
    }
    
    public static void main(String[] args) {
        System.out.println(isHappyNumber(32));
        System.out.println();
        System.out.println(isHappyNumber(100));
        System.out.println();
        System.out.println(isHappyNumber(58));
        System.out.println();
        System.out.println(isHappyNumber(4));
       
    }
}

[Ashwesh09]

import java.util.Scanner;

public class HappyNumber {
    boolean isHappy(int n) {
        int sum = n;
        int temp = n;
        if (temp == 1 || temp == 7)
            return true;
        while (!(sum >= 0 && sum <= 9)) {
            sum = 0;
            while (temp > 0) {
                sum += Math.pow(temp % 10, 2);
                temp /= 10;
            }
            if (sum == 1)
                return true;
            temp = sum;
        }
        return false;
    }
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        HappyNumber hp = new HappyNumber();
        int k = sc.nextInt();
        for (int i = 0; i < k; i++) {
            if(hp.isHappy(i))
                System.out.println(i+" ");
        }
        sc.close();
    }
}

[Gaurav-Joshi-31]

import java.util.*;

public class HappyNumber {

    static int getSquares(int n) {
        int sq = 0;
        while (n > 0) {
            int temp = n % 10;
            sq += (temp * temp);
            n /= 10;

        }

        return sq;
    }

    static boolean checkHappyNumber(int n) {
        int res = getSquares(n);

        while (res != 1 && res != 4) {
            res = getSquares(res);
        }
        return res == 1;
    }

    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        System.out.println("Enter the number : ");
        int n = s.nextInt();
        if (checkHappyNumber(n)) {
            System.out.println("This number is a happy number");
            System.out.println("Enter value of k Happy Numbers: ");
            int k = s.nextInt();
            System.out.println("Numbers are as follows: ");
            int i = 0;
            int firstk = n + 1;
            while (i != k) {
                if (checkHappyNumber(firstk)) {
                    System.out.println(firstk);
                    i++;
                    firstk++;
                } else
                    firstk++;

            }
        } else
            System.out.println("This is a not happy number");
    }
}

[GantaGreeshma]

`import java.util.Scanner;

public class HappyNumber {
public static int happy(int n) {
int res = 0;
while (n != 0) {
int temp = n % 10;
res = res + temp * temp;
n = n / 10;
}
return res;
}

public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int number = sc.nextInt();
    int result = number;
    while (result > 4) {
        result = happy(result);
    }
    if (result == 1) {
        System.out.println("happy number");
    } else {
        System.out.println("not happy number");
    }
}

}
`

[KaminiJha]

import java.util.Scanner;
public class HappyNum {
    public static int helper(int n) {
        int sum = 0;

        while (n != 0) {
            int r = n % 10;
            n /= 10;
            sum += r * r;
        }
        return sum;
    }
    public static void isHappy(int n) {
        int res=0;
        do{
            res = helper(n);
            n=res;
        }
        while (res != 1 && res != 4);
        if (res == 1)
            System.out.println("Happy Number");
        else
            System.out.println("Unhappy Number");
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        System.out.println("Enter number ");
        int n = sc.nextInt();
        isHappy(n);
    }
}``

[Harshita-Joshi]

`import java.util.Scanner;

public class HappyNum {

static boolean isAHappyNum(int n){

    int res = squareDigitSum(n);
    while(res!=4){
        if(res==1){
            return true;
        }
        res = squareDigitSum(res);
    }

    return false;

}

static int squareDigitSum(int n){
    int s = 0;
    while(n!=0){
        s += Math.pow((n%10),2);
        n/=10;
    }
    return s;
}

public static void main(String[] args) {
    Scanner scn =  new Scanner(System.in);
    int k = scn.nextInt();

    for(int i=1; i<=k; i++){
        if(isAHappyNum(i)==true){
            System.out.println(i);
        }else{
            k++;
        }
    }

}

}
`

[VigneshVishwa]

`import java.util.*;

public class HappyNumber {
public static void sumOfSqDig(int t, int x) {
int sum = 0;
while (x > 0) {
int rem = x % 10;
sum += (rem * rem);
x = x / 10;

    }
    happyCheck(t, sum);
}

public static void happyCheck(int t1, int y) {
    if (y == 1) {
        System.out.println("HappyNumber");
    } else if (y == t1) {
        System.out.println("Unhappy Number");
    } else {
        sumOfSqDig(t1, y);
    }
}

public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    System.out.println("Enter the number");
    int n = sc.nextInt();
    int temp = n;
    sumOfSqDig(temp, n);

}

}`

[ujjwal18bit1167]

import java.util.Scanner;

public class Happynumber {
public static int happy(int number) {
int rem = 0;
int temp = 0;
while (number > 0) {
rem = number % 10;
temp = temp + (rem * rem);
number = number / 10;
}
return temp;
}

public static void main(String[] args) {
    int k;
    Scanner sc = new Scanner(System.in);
    System.out.println("Enter k value");
    k = sc.nextInt();
    int result = k;
    while (result != 1 && result != 4) {
        result = happy(result);
        System.out.println(result);
    }
    if (result == 1) {
        System.out.println("it is nice number ");
    } else {
        System.out.println("It is not a happy number " + result);
    }
    sc.close();
}

[Gauravgarje]

A happy number can be defined as a number that will yield 1 when it is replaced by the sum of the square of its digits repeatedly. If this process results in an endless cycle of numbers containing 4, then the number is called an unhappy number.

For example, 32 is a happy number as the process yields 1 as follows:

1. 3^2 + 2^2 = 13
2. 1^2 + 3^2 = 10
3. 1^2 + 0^2 = 1

Some of the other examples of happy numbers are 7, 28, 100, 320, and so on. The unhappy number will result in a cycle of 4, 16, 37, 58, 89, 145, 42, 20, 4. If a number is happy, then all members of its sequence are happy; if a number is unhappy, all members of the sequence are unhappy.

Check whether a number is a happy number, take 'k' as input, and print the first 'k' happy numbers from this number.

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

/*
A happy number can be defined as a number that will yield 1 when it is replaced by the sum of the square of its digits repeatedly. If this process results in an endless cycle of numbers containing 4, then the number is called an unhappy number.

For example, 32 is a happy number as the process yields 1 as follows:

3^2 + 2^2 = 13
1^2 + 3^2 = 10
1^2 + 0^2 = 1
Some of the other examples of happy numbers are 7, 28, 100, 320, and so on. The unhappy number will result in a cycle of 4, 16, 37, 58, 89, 145, 42, 20, 4. If a number is happy, then all members of its sequence are happy; if a number is unhappy, all members of the sequence are unhappy.

Check whether a number is a happy number, take 'k' as input, and print the first 'k' happy numbers from this number.
*/

public class HappyNumber {

static int squareAdder(int n) {
    int result = 0;
    while (n > 0) {
        int x = n % 10;
        n = n / 10;
        result += (x * x);
    }
    System.out.println(result);
    return result;
}

public static void main(String[] args) {

    Scanner scan = new Scanner(System.in);
    int number = scan.nextInt();

    List<Integer> list = new ArrayList<Integer>();
    int x = squareAdder(number);

    if (!list.contains(x)) // happy number
    {
        list.add(x);
        if (x == 1) 
        {
            System.out.println("The number is HAPPY NUMBER. First " + list.size() + " numbers are: ");
            for (Integer integer : list) {
                System.out.print(" " + integer + " ");
            }
            scan.close();
            return;
        }
        x = squareAdder(x);
    } else {
        System.out.println("The number is UNHAPPY NUMBER. First " + list.size() + " numbers are: ");
        for (Integer integer : list) {
            System.out.print(" " + integer + " ");
        }
    }

    scan.close();
}

}

[SrideviYamala]

import java.util.Scanner;
public class HappyNumber {
public static int check(int n) {
int r = 0;
int temp = 0;
while (n != 0) {
r = n % 10;
int squarenum = r * r;
temp = temp + squarenum;
n = n / 10;
}
return temp;
}

public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int num = sc.nextInt();
    int result = num;
    while (result != 1 && result != 4) {
        result = check(result);
        System.out.println(result);
    }
    if (result == 1) {
        System.out.println("Happy number");
    } else {
        System.out.println("Not a happy number");
    }
}
}

[Krishreddy460]

import java.util.*;
public class Happynum {

static int sumofdigits(int num)
{   int sum=0;
    while(num!=0)
    {   int rem=num%10;
        sum+=rem*rem;
        num=num/10;
    }
    return sum;
}  




static String happyNum(int num)
{  
    while(num!=1)
    {  
        num=sumofdigits(num);
        //System.out.println(num);
        if(num==4)
        {
        return "";
        }
    }
    return "Happynum";
}

public static void main(String[] args)
{
Scanner sc= new Scanner(System.in);

    int num=sc.nextInt();
    for(int i=1; i<num; i++)
    {
    System.out.println(i+"number is"+happyNum(i));
    }
}

}

[Prem-3]

`import java.util.Scanner;

public class HappyNumber {

public static int number(int n) {
    int t, d, sum = 0;
    while (n != 0) {
        d = n % 10;
        sum += (d * d);
        n = n / 10;
    }
    return sum;
}

public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    int k = n;
    while (k != 1 && k != 4) {
        k = number(k);
    }
    if (k == 1)
        System.out.println(n + " "+ "is a happy number");
    else
        System.out.println(n+" "+"is not a happy number");
}

}

`

[vysh675]

import java.util.Scanner;

public class Happy {
static int happynum(int number) {
int rem = 0;
int tem = 0;
while (number > 0) {
rem = number % 10;
tem = tem + (rem * rem);
number = number / 10;
}
return tem;
}

public static void main(String[] args) {
int k;
Scanner sc = new Scanner(System.in);
k = sc.nextInt();
int ans = k;
while (ans != 1 && ans != 4) {
ans = happynum(ans);
System.out.println(ans);
}
if (ans == 1) {
System.out.println("it is nice number ");
} else {
System.out.println("It is not happy number " + ans);
}
}
}

[PavanArvapally]

package Tasks;

import java.util.*;

class HappyNumber {
static int squareSum(int n){
int sum=0;
while(n!=0){
int square=n%10;
sum+= square * square;
n=n/10;
}
return sum;

}
public static void main(String[] args) {
    Scanner sc=new Scanner(System.in);
    int n=sc.nextInt();
    int k=n;
    while(n!=1 && n!=4){
        n=squareSum(n);
        System.out.println(n);
    }
    if(n==1){
        System.out.println(n + " is a happy number");
    }
    else{
        System.out.println(n + " is not a happy number");
    }
    
            
}
}

[mkaifahmed]

import java.util.Scanner;

public class HappyNumber {
    static int sumOfSquares(int n) {
        int sum = 0;
        while (n > 0) {
            int k = n % 10;
            sum += k * k;
            n = n / 10;
        }
        return sum;
    }

    static boolean happy(int num) {
        int sum = sumOfSquares(num);
        while (sum != 1 && sum != 4) {
            sum = sumOfSquares(sum);
        }
        return (sum == 1);
    }

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        System.out.println("Enter the number");
        int num = scanner.nextInt();

        if (happy(num))
            System.out.println("It is a happy number");
        else
            System.out.println("It is not a happy number");

        System.out.println("Enter the limit : ");
        int k = scanner.nextInt();
        System.out.println(k + " happy numbers from " + num + " are :");
        int i = 0;
        int temp = num + 1;
        while (i <= k) {
            if (happy(temp)) {
                System.out.print(temp + " ");
                i++;
                temp++;
            } else {
                temp++;
            }
        }
        scanner.close();

    }
}

[ShraddhaPenshanwar]

`import java.util.Scanner;

public class HappyNumber {
public static int happy(int n) {
int a = 0;
int temp = 0;
while (n > 0) {
a = n % 10;
temp = temp + (a * a);
n = n / 10;
}
return temp;
}

public static void main(String[] args) {
int num;
Scanner sc = new Scanner(System.in);
System.out.println("Enter the Number");
num = sc.nextInt();

int result = num;
while (result != 1 && result != 4) {
    result = happy(result);
    System.out.println(result);
}
if (result == 1) {
    System.out.println(+num + " : It is Happy number ");
} else {
    System.out.println(+num + " : It is not a Happy number ");
}
sc.close();

}
`

[DivikaAgrawal]

import java.util.Scanner;

class HappyNumber {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int k = sc.nextInt();
        int n;
        int m = k;
        while (true) {
            n = happynum(m);
            if (n == 1) {
                System.out.println("Happy Number");
                break;
            } else if (n == k || n == 4) {
                System.out.println("Not a happy number");
                break;
            } else {
                System.out.println(n);
                m = n;
            }
        }
    }

    private static int happynum(int m) {
        int rem = 0;
        int sum = 0;

        while (m > 0) {
            rem = m % 10;
            sum += rem * rem;
            m = m / 10;
        }
        return m;

    }
}