Menu Close

Compute the sum of all the digits of N

You’re given an integer N. Write a program to calculate the sum of all the digits of N.


Input
The input integer N
Output
Calculate the sum of digits of N.

Input:  
Enter the Number:  56

Output:
Sum=  11     // 5+6=11
import java.io.*;
import java.util.*;
import java.lang.*;
public class temp {
	   public static void main(String[] args) {
       int number,sum=0,rem;
       Scanner scan = new Scanner(System.in);
       System.out.println("Enter the Number:  ");
       number = scan.nextInt();
       while(number>0){
         rem = ( number%10);
         sum += rem;
         number = number/10;
       }
       System.out.println("Sum= "+sum);
	}
}

INPUT_1:
Enter the Number:
12345

OUTPUT:
Sum= 15


INPUT_2:
Enter the Number:
31203

OUTPUT:
Sum= 9


INPUT_3:
Enter the Number:
250

OUTPUT:
Sum= 7


INPUT_4:
Enter the Number:
4589

OUTPUT:
Sum= 26


INPUT_5:
Enter the Number:
666666

OUTPUT:
Sum= 36


ILLUSTRATION – eXecuted using javac in linux terminal

eXecuted using javac in linux terminal

Morae Q!

  1. Convert from binary number to decimal number.
  2. Swap two numbers by using division and multiplication.
  3. Compute foot and inches into centimetres.
  4. Concatenate Strings.
  5. Convert lowercase letters to uppercase letters.
  6. Compute the sum of all the digits of N.
  7. Compute the area of the pentagon.
  8.  Get input using scanner.
  9. Find the distance between two points (x1,y1) and (x2,y2).
  10. Finding patterns in a file using frep and egrep .
  11. Detecting a cycle in a directed graph using Depth First Traversal.
  12. Topological ordering in a Graph.
  13. Storing graphs using adjacency list.
  14. Introduction to graph theory.
  15. Graph Adjacency Matrix pseudo code.
  16. Adjacency Matrix for storing graphs.
  17. Dijkstra’s shortest path algorithm .
  18. Breadth first search (BFS) Algorithm.
  19. Find the multiple of given number in the list of integers.
  20. Finding patterns in files using grep .