12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667
#include <bits/stdc++.h>
using namespace std;
class Solution {
private:
/* Function to count the
number of digits in N */
int countDigit(int n) {
int count = log10(n) + 1;
return count;
}
public:
/* Function to find whether the
number is Armstrong or not */
bool isArmstrong(int n) {
// Store the count of digits
int count = countDigit(n);
// Variable to store the sum
int sum = 0;
// Variable to store the copy
int copy = n;
/* Iterate through each
digit of the number */
while(n > 0){
// Extract the last digit
int lastDigit = n % 10;
// Update sum
sum += pow(lastDigit, count);
/* Remove the last digit
from the number */
n = n / 10;
}
/* Check if the sum of digits raised to the
power of k equals the original number */
if(sum == copy) return true;
return false;
}
};
int main() {
int n = 153;
/* Creating an instance of
Solution class */
Solution sol;
/* Function call to find whether the
given number is Armstrong or not */
bool ans = sol.isArmstrong(n);
if(ans) {
cout << n << " is an Armstrong number." << endl;
} else {
cout << n << " is not an Armstrong number." << endl;
}
return 0;
}
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263
import java.util.*;
class Solution {
/* Function to count the
number of digits in N */
private int countDigit(int n) {
int count = (int)(Math.log10(n) + 1);
return count;
}
/* Function to find whether the
number is Armstrong or not */
public boolean isArmstrong(int n) {
// Store the count of digits
int count = countDigit(n);
// Variable to store the sum
int sum = 0;
// Variable to store the copy
int copy = n;
/* Iterate through each
digit of the number */
while (n > 0) {
// Extract the last digit
int lastDigit = n % 10;
// Update sum
sum += Math.pow(lastDigit, count);
/* Remove the last digit
from the number */
n = n / 10;
}
/* Check if the sum of digits raised to the
power of k equals the original number */
if (sum == copy) return true;
return false;
}
public static void main(String[] args) {
int n = 153;
/* Creating an instance of
Solution class */
Solution sol = new Solution();
/* Function call to find whether the
given number is Armstrong or not */
boolean ans = sol.isArmstrong(n);
if (ans) {
System.out.println(n + " is an Armstrong number.");
} else {
System.out.println(n + " is not an Armstrong number.");
}
}
}
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364
import math
class Solution:
""" Function to count the
number of digits in N """
def countDigit(self, n):
# Base case
if n == 0:
return 1
count = int(math.log10(n)) + 1
return count
""" Function to find whether the
number is Armstrong or not """
def isArmstrong(self, n):
# Store the count of digits
count = self.countDigit(n)
# Variable to store the sum
sum = 0
# Variable to store the copy
copy = n
# Iterate through each
# digit of the number
while n > 0:
# Extract the last digit
lastDigit = n % 10
# Update sum
sum += pow(lastDigit, count)
# Remove the last digit
# from the number
n = n // 10
# Check if the sum of digits raised to the
# power of k equals the original number
if sum == copy:
return True
return False
# Main function
if __name__ == "__main__":
n = 153
# Creating an instance of
# Solution class
sol = Solution()
# Function call to find whether the
# given number is Armstrong or not
ans = sol.isArmstrong(n)
if ans:
print(f"{n} is an Armstrong number.")
else:
print(f"{n} is not an Armstrong number.")
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
class Solution {
/* Function to count the
number of digits in N */
countDigit(n) {
let count = Math.floor(Math.log10(n)) + 1;
return count;
}
/* Function to find whether the
number is Armstrong or not */
isArmstrong(n) {
// Store the count of digits
let count = this.countDigit(n);
// Variable to store the sum
let sum = 0;
// Variable to store the copy
let copy = n;
/* Iterate through each
digit of the number */
while (n > 0) {
// Extract the last digit
let lastDigit = n % 10;
// Update sum
sum += Math.pow(lastDigit, count);
/* Remove the last digit
from the number */
n = Math.floor(n / 10);
}
/* Check if the sum of digits raised to the
power of k equals the original number */
if (sum == copy) return true;
return false;
}
}
// Main function
let n = 153;
// Creating an instance of
// Solution class
let sol = new Solution();
/* Function call to find whether the
given number is Armstrong or not */
let ans = sol.isArmstrong(n);
if (ans) {
console.log(`${n} is an Armstrong number.`);
} else {
console.log(`${n} is not an Armstrong number.`);
}
