“Nomor Armstrong” Kode Jawaban

Nomor Armstrong

// C++ Program to find
// Nth Armstrong Number
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
 
// Function to find Nth Armstrong Number
int NthArmstrong(int n)
{
    int count = 0;
 
    // upper limit from integer
    for (int i = 1; i <= INT_MAX; i++) {
        int num = i, rem, digit = 0, sum = 0;
 
        // Copy the value for num in num
        num = i;
 
        // Find total digits in num
        digit = (int)log10(num) + 1;
 
        // Calculate sum of power of digits
        while (num > 0) {
            rem = num % 10;
            sum = sum + pow(rem, digit);
            num = num / 10;
        }
        // Check for Armstrong number
        if (i == sum)
            count++;
        if (count == n)
            return i;
    }
}
 
// Driver Function
int main()
{
    int n = 12;
    cout << NthArmstrong(n);
    return 0;
}
 
// This Code is Contributed by 'jaingyayak'
Anonymous

Nomor Armstrong

// ARMSTRONG NUMBER
// 153

let sum = 0;
const number = 153;
// create a temporary variable
let temp = number;
while (temp > 0) {
  // finding the one's digit
  let remainder = temp % 10;

  sum += remainder * remainder * remainder;

  // removing last digit from the number
  temp = parseInt(temp / 10); // convert float into integer
}
// check the condition
if (sum == number) {
  console.log(`${number} is an Armstrong number`);
} else {
  console.log(`${number} is not an Armstrong number.`);
}
Abhishek

Jawaban yang mirip dengan “Nomor Armstrong”

Pertanyaan yang mirip dengan “Nomor Armstrong”

Lebih banyak jawaban terkait untuk “Nomor Armstrong” di JavaScript

Jelajahi jawaban kode populer menurut bahasa

Jelajahi bahasa kode lainnya

Shell/Bash
C#
C++
C
CSS
HTML
Java
JavaScript
Objective-C
PHP
Python
Sql
Swift
Ruby
TypeScript
Go
Kotlin
Assembly
R
VBA
Scala
Rust
Dart
Elixir
Clojure
Haskell
Matlab
Erlang
Cobol
Fortran
Scheme
Perl
Groovy
Lua
Julia
Delphi
Abap
Lisp
Prolog
Pascal
ActionScript
Basic
Solidity
PowerShell
GDScript
Excel