Advertisement
GabrielHr00

EqualSumsEvenOddPosition

Dec 5th, 2022
102
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.16 KB | None | 0 0
  1. import java.util.Scanner;
  2.  
  3. public class EqualSumsEvenOddPosition {
  4. public static void main(String[] args) {
  5. Scanner scanner = new Scanner(System.in);
  6. int firstNum = Integer.parseInt(scanner.nextLine());
  7. int secondNum = Integer.parseInt(scanner.nextLine());
  8.  
  9. for (int i = firstNum; i <= secondNum; i++) {
  10. // save current num
  11. int currentNum = i;
  12.  
  13. int evenSum = 0;
  14. int oddSum = 0;
  15. for(int j = 0; j < 6; j++) {
  16. // get last digit from number
  17. int lastDigit = currentNum % 10;
  18. // cut last digit, so we can iterate for the next (last) digit
  19. currentNum = currentNum / 10;
  20.  
  21. // even position
  22. if(j % 2 == 0) {
  23. evenSum = evenSum + lastDigit;
  24. }
  25. // odd position
  26. else {
  27. oddSum = oddSum + lastDigit;
  28. }
  29. }
  30.  
  31. // check if both sums are equal
  32. if(evenSum == oddSum) {
  33. System.out.print(i + " ");
  34. }
  35. }
  36. }
  37. }
  38.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement