For this Question: Given two strings A and B which are binary representation of integers, the task is to count possible values of X that satisfies the condition A OR X = B. Length of both A and B is same.The first line contains the string A.
The next line contains the string B.

Constraints:
|A| = |B|
1 <= |A| <= 30Print the number of values of X that satisfy the condition A OR X = B.Sample input 1:
10
11

Output:
2

Explanation:
X = 1. Then (10) | (01) = (11)
X = 3. Then (10) | (11) = (11)
So there are two possible values of X.

Sample input 2:
101
111

Output:
4

Explanation:
X = 2. Then (101) | (010) = (111)
X = 3. Then (101) | (011) = (111)
X = 6. Then (101) | (110) = (111)
X = 7. Then (101) | (111) = (111)
So there are four possible values of X., I have written this Solution Code: import java.io.*;
import java.util.*;



class Main
{
    public static void main (String[] args)
    {
        Scanner sc = new Scanner(System.in);
        String a = sc.nextLine();
         String b = sc.nextLine();
         int x = conversion(a,b);
         System.out.println(x);
    }
    static int conversion(String a, String b)
    {
        int c = Integer.parseInt(b,2);
        int d=  Integer.parseInt(a,2);
        int y =0;
        for(int i=1; i<=c; i++)
        {
            if((d|i)==c)
            {
                y+=1;
            }
        }
        return y;
    }
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?