(Baekjoon) etc.. - (1) 이진수 연산

https://www.acmicpc.net/problem/12813

12813번: 이진수 연산

bitmask 문제에 앞서서 손풀기

 

package etc;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.nio.Buffer;

public class _12813{

    public static void main(String args[]) throws IOException{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        String A[] = br.readLine().split("");
        String B[] = br.readLine().split("");

        for (int i = 0; i < A.length; i++) {
            System.out.print(Integer.parseInt(A[i]) & Integer.parseInt(B[i]));
        }
        System.out.println();
        for (int i = 0; i < A.length; i++) {
            System.out.print(Integer.parseInt(A[i]) | Integer.parseInt(B[i]));
        }
        System.out.println();
        
        for (int i = 0; i < A.length; i++) {
            System.out.print(Integer.parseInt(A[i]) ^ Integer.parseInt(B[i]));
        }
        System.out.println();
        
        for (int i = 0; i < A.length; i++) {
            System.out.print(Integer.parseInt(A[i]) ^ 1);
        }
        System.out.println();
        
        for (int i = 0; i < A.length; i++) {
            System.out.print(Integer.parseInt(B[i]) ^ 1);
        }

    }
}

 

 

 

 

 

 

 

백준문제풀이Github : 

https://github.com/sdk0213/baekjoon-study

sdk0213/baekjoon-study