Armstrong Number

 

Write a Program to determine if the given number is Armstrong number or not. Print true if number is armstrong, otherwise print false.

An Armstrong number is a number (with digits n) such that the sum of its digits raised to nth power is equal to the number itself.

For example,

371, as 3^3 + 7^3 + 1^3 = 371
1634, as 1^4 + 6^4 + 3^4 + 4^4 = 1634
Sample Input 1 :
103

Sample Output 1 :
false
import java.util.Scanner;
import java.math.*;

public class Armstrong {

	public static void main(String[] args) {
		
		Scanner s = new Scanner(System.in);
		int n=s.nextInt();
		
		int t=n;
		int num=n;
		int c=0;
		// d=0;
		int sum=0;
		while(num>0)
		{
			c++;
			num=num/10;
		}
		
		while(n>0)
		{
			sum=(int)(sum+(Math.pow(n%10, c)));
			n=n/10;
			
		}
		if(t==sum)
		{
			System.out.println("true");
		}
		else
		{
		System.out.println("false");
	}
	}
}

Comments

Post a Comment

Popular posts from this blog

Minimum Length Word

  Given a string S (that can contain multiple words), you need to find the word which has minimum length. Sample Input 1 : this is test string Sample Output 1 : is public class Solution { public static String minLengthWord(String input){ String[] arr=input.split(" "); int i=0; int minlength; minlength=Integer.MAX_VALUE; String smallest; smallest = ""; for(i=0;i<arr.length;i++) { if(arr[i].length() < minlength) { smallest=arr[i]; minlength=arr[i].length(); } } return smallest; } }
Read more

Check Number Sequence

  You are given S, a sequence of n integers i.e. S = s1, s2, ..., sn. Compute if it is possible to split S into two parts : s1, s2, ..., si and si+1, si+2, ….., sn (0 <= i <= n) in such a way that the first part is strictly decreasing while the second is strictly increasing one. Note : We say that x is strictly larger than y when x > y. So, a strictly increasing sequence can be 1 4 8. However, 1 4 4 is NOT a strictly increasing sequence. That is, in the sequence if numbers are decreasing, they can start increasing at one point. And once the sequence of numbers starts increasing, they cannot decrease at any point further. Sequence made up of only increasing numbers or only decreasing numbers is a valid sequence. So, in both the cases, print true. You just need to print true/false. No need to split the sequence. Sample Input 1 : 5 9 8 4 5 6 Sample Output 1 : true import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner s = new Scanner (Sys
Read more

Star Pattern

Image
  Pattern for N = 4 import java.util.Scanner; public class StarPattern { public static void main(String[] args) { Scanner s = new Scanner(System.in); int n= s.nextInt(); for(int i=1;i<=n;i++) { for(int j=1;j<=n-i;j++) { System.out.print(" "); } for(int k=1;k<=2*i-1;k++) { System.out.print("*"); } System.out.println(); } } }
Read more