amstrong_gist

amstrong.c

#include <stdio.h>
int digit_operation(int, int);
int main() {
    unsigned int number = 0, sum = 0, temp_copy = 0, remainder;

    printf("Enter a integer : ");
    scanf("%d", &number);

    temp_copy = number;

    while (number > 0) {
        remainder = number % 10;
        sum = digit_operation(sum, remainder);
        number = number / 10;
    }
    if (temp_copy == sum) {
        printf("%d = %d. It's an \"Amstrong number.\"\n", temp_copy, sum);
    } else {
        printf("%d =  %d. It is \"not\" an Amstrong number.\n", temp_copy, sum);
    }

    return 0;
}

int digit_operation(int sum, int remainder) {
    sum = (sum + (remainder * remainder * remainder));

    return sum;
}

Amstrong.java

import java.util.Scanner;
public class Amstrong {
	public static void main(String args[]) {
		int number = 0, remainder, temp_copy, sum = 0;
		System.out.print("Enter a Integer : ");
		Scanner scanner = new Scanner(System.in);
		number = scanner.nextInt();
		temp_copy = number;
		if(number == 0) {
			System.out.println("Input is zero.");
			System.exit(0);
		}
		while(number > 0) {
			remainder = number % 10;
			sum = digit_operation(sum, remainder);
			number = number / 10;
		}
		if(temp_copy == sum) 
			System.out.println(temp_copy +" = "+ sum + ". It's an \"Amstrong number.\"");
		else 	
			System.out.println(temp_copy +" = "+ sum + ". It's \"not\" an Amstrong number.");
	}
  
  // function to calculate
	private static int digit_operation(int sum, int remainder) {
		sum = sum + ( remainder * remainder * remainder);
		return sum;
	}
}