Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- package com.company;
- import java.util.Scanner;
- public class Main {
- static String NotEq = "Digit capacity is not equal, try again";
- static String ValidErr = "Validation: Entered value is no integer";
- static int EnterValue(String msg) {
- Scanner in = new Scanner(System.in);
- try {
- System.out.println(msg);
- return in.nextInt();
- } catch (Exception ex) {
- in.nextLine();
- System.out.println(ValidErr);
- return EnterValue(msg);
- }
- }
- static boolean CheckValue(int Max, int Min, int Num) {
- if (Max < Num || Num < Min) {
- System.out.println("Ur value is not belongs [" + Min + " ; " + Max + "]");
- return false;
- }
- return true;
- }
- static void PrintArray(String msg, int[] array) {
- System.out.println(msg);
- for (int i = array.length - 1; i >= 0; i--) {
- if (i != array.length - 1) {
- System.out.print(", ");
- }
- System.out.print(array[i]);
- }
- }
- static int EnterCheckValue(int Max, int Min, int Num, String msg) {
- Scanner in = new Scanner(System.in);
- do {
- Num = EnterValue(msg);
- }
- while (!CheckValue(Max, Min, Num));
- return Num;
- }
- static int CheckCapacity(int Num) {
- int i = 1;
- do {
- Num /= 10;
- i++;
- } while (Num / 10 != 0);
- return i;
- }
- static boolean BitComparison(int Num1, int Num2) {
- if (CheckCapacity(Num1) != CheckCapacity(Num2)) {
- System.out.println(NotEq);
- return false;
- }
- return true;
- }
- static int[] ArraySplit(int[] Arr, int Num) {
- for (int i = 0; i < Arr.length; i++) {
- Arr[i] = Num % 10;
- Num = Num / 10;
- }
- return Arr;
- }
- public static void main(String[] args) {
- final int MaxValue = 9999999;
- final int MinValue = 100;
- int FirstNum = 0;
- int SecondNum = 0;
- do {
- FirstNum = EnterCheckValue(MaxValue, MinValue, FirstNum, "Enter first num");
- SecondNum = EnterCheckValue(MaxValue, MinValue, SecondNum, "Enter second num");
- } while (!BitComparison(FirstNum, SecondNum));
- int[] ArrOf1 = new int[CheckCapacity(FirstNum)];
- int[] ArrOf2 = new int[CheckCapacity(SecondNum)];
- ArrOf1 = ArraySplit(ArrOf1, FirstNum);
- ArrOf2 = ArraySplit(ArrOf2, SecondNum);
- for (int i = 0; i < ArrOf1.length; i++) {
- ArrOf1[i] -= ArrOf2[i];
- }
- PrintArray("Final array", ArrOf1);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement