Friday 13 April 2018

A program to find whether given no. is Armstrong or not



Example : Input – 153 Output – 1^3 + 5^3 + 3^3 = 153, so it is Armstrong no. */

class Armstrong
{
public static void main(String args[])

{
int num = Integer.parseInt(args[0]);
int n = num; //use to check at last time
int check=0,remainder;
while(num > 0)

{
remainder = num % 10;
check = check + (int)Math.pow(remainder,3);
num = num / 10;
}
if(check == n)
System.out.println(n+” is an Armstrong Number”);
else
System.out.println(n+” is not a Armstrong Number”);
}
}

0 Comments:

Post a Comment

Popular Posts

Categories

AI (24) Android (24) AngularJS (1) Assembly Language (2) aws (17) Azure (7) BI (10) book (4) Books (101) C (77) C# (12) C++ (82) Course (60) Coursera (169) coursewra (1) Cybersecurity (22) data management (9) Data Science (73) Data Strucures (6) Deep Learning (9) Django (6) Downloads (3) edx (2) Engineering (14) Excel (13) Factorial (1) Finance (5) flutter (1) FPL (17) Google (17) Hadoop (3) HTML&CSS (46) IBM (19) IoT (1) IS (25) Java (92) Leet Code (4) Machine Learning (39) Meta (18) MICHIGAN (4) microsoft (3) Pandas (3) PHP (20) Projects (29) Python (702) Python Coding Challenge (136) Questions (2) R (70) React (6) Scripting (1) security (3) Selenium Webdriver (2) Software (17) SQL (38) UX Research (1) web application (8)

Followers

Person climbing a staircase. Learn Data Science from Scratch: online program with 21 courses