Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.lang.reflect.Array;
- import java.util.*;
- public class Main {
- public static void main(String[] args) {
- Scanner scan = new Scanner(System.in);
- int n = Integer.parseInt(scan.nextLine());
- Integer[] array = new Integer[n];
- for (int i = 0; i < n; i++) {
- array[i] = Integer.parseInt(scan.nextLine());
- }
- String[] firstDigitfirstNumber = new String[n];
- for (int v = 0; v < firstDigitfirstNumber.length; v++) {
- firstDigitfirstNumber[v] = Integer.toString(array[v] / 10);
- }
- String[] lastDigitSecondNumber = new String[n - 1];
- for (int e = 0; e < lastDigitSecondNumber.length; e++) {
- lastDigitSecondNumber[e] = Integer.toString(array[e + 1] % 10);
- }
- String[] secondDigit = new String[n - 1];
- for (int j = 0; j < secondDigit.length; j++) {
- secondDigit[j] = Integer.toString(array[j] % 10);
- }
- String[] firstDigit = new String[n - 1];
- for (int k = 0; k < firstDigit.length; k++) {
- firstDigit[k] = Integer.toString(array[k + 1] / 10);
- }
- String[] merged = new String[n - 1];
- for (int a = 0; a < merged.length; a++) {
- merged[a] = secondDigit[a] + firstDigit[a];
- }
- int counter = 0;
- String[] middle = new String[n - 1];
- for (int b = 0; b < middle.length; b++) {
- counter = Integer.parseInt(firstDigit[b]) + Integer.parseInt(secondDigit[b]);
- if (counter > 10) {
- counter = counter %10;
- middle[b] = Integer.toString(counter);
- } else if(counter ==10){
- counter =0;
- middle[b] = Integer.toString(counter);
- }
- else{
- middle[b] = Integer.toString(counter);
- }
- }
- String[] squashed = new String[n - 1];
- for (int m = 0; m < squashed.length; m++) {
- squashed[m] = firstDigitfirstNumber[m] + middle[m] + lastDigitSecondNumber[m];
- }
- System.out.print(String.join(" ", merged));
- System.out.println();
- System.out.print(String.join(" ", squashed));
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement