Yyds dry goods inventory ＃ solve the real problem of famous enterprises: cycle number comparison

1. sketch ：

describe

For any two positive integers x and k, We define repeat(x, k) For will x Repeat k Number of times , for example repeat(1234, 3) = 123412341234,repeat(20,2) = 2020. Niuniu now gives 4 It's an integer x1, k1, x2, k2, among v1 = (x1, k1), v2 = (x2, k2), Please compare v1 and v2 Size .

Input description ：

Input includes one line , There is... In the line 4 A positive integer x1, k1, x2, k2(1 ≤ x1,x2 ≤ 10^9, 1 ≤ k1,k2 ≤ 50), Split by space

Output description ：

If v1 Less than v2 Output "Less",v1 be equal to v2 Output "Equal",v1 Greater than v2 Output "Greater".

Example 1

Input ：

Log in and copy

      
      

       
       1010 3 101010 2
      
      
      
      

       
       
1.
      
      

Output ：

Log in and copy

      
      

       
       Equal
      
      
      
      

       
       
1.
      
      

2. Code implementation ：

Log in and copy

      
      

       
       import java.math.BigInteger;
       
       
import java.util.Scanner;
       
       
public class Main {
       
       
    public static void main(String []args) {
       
       
        Scanner input = new Scanner(System.in);
       
       
        String a = input.nextLine();
       
       
        String[] array = a.split(" ");
       
       
        if(array.length != 4) {
       
       
            System.out.println(" Illegal input ! " + array.length);
       
       
        } else {
       
       
            StringBuilder sb1 = new StringBuilder();
       
       
            int k1 = Integer.valueOf(array[1]);
       
       
            for (int i=0; i< k1; i++) {
       
       
                sb1.append(array[0]);
       
       
            }
       
       

       
       
            StringBuilder sb2 = new StringBuilder();
       
       
            int k2 = Integer.valueOf(array[3]);
       
       
            for (int i=0; i< k2; i++) {
       
       
                sb2.append(array[2]);
       
       
            }
       
       

       
       
            BigInteger v1 = new BigInteger(sb1.toString());
       
       

       
       
            BigInteger v2 = new BigInteger(sb2.toString());
       
       
            int num = v1.compareTo(v2);
       
       
            if (num < 0) {
       
       
                System.out.println("Less");
       
       
            } else if (num == 0) {
       
       
                System.out.println("Equal");
       
       
            } else if (num > 0) {
       
       
                System.out.println("Greater");
       
       
            }
       
       
        }
       
       
    }
       
       
}
      
      
      
      

       
       
1.
       
       
2.
       
       
3.
       
       
4.
       
       
5.
       
       
6.
       
       
7.
       
       
8.
       
       
9.
       
       
10.
       
       
11.
       
       
12.
       
       
13.
       
       
14.
       
       
15.
       
       
16.
       
       
17.
       
       
18.
       
       
19.
       
       
20.
       
       
21.
       
       
22.
       
       
23.
       
       
24.
       
       
25.
       
       
26.
       
       
27.
       
       
28.
       
       
29.
       
       
30.
       
       
31.
       
       
32.
       
       
33.
       
       
34.
       
       
35.
       
       
36.