algorithms 코드포스 (codeforces)

코드포스 61A (codeforces 61A)

2019.08.12 ·

코드포스 61A (codeforces 61A) 문제 풀이 및 코드 (description and code)

Problem - 61A - Codeforces

Codeforces 61A

코드포스 61A (codeforces 61A) 문제 풀이 및 코드 (description and code)

https://codeforces.com/problemset/problem/61/A

코드

import java.io.*;

public class CF61A {
    static String s1, s2, s;
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
        s1 = br.readLine();s2 =br.readLine();
        StringBuffer sb = new StringBuffer();
        for (int i = 0; i < s1.length(); i++) {
            sb.append("" + ((s1.charAt(i) - 48) ^ (s2.charAt(i) - 48)));
        }
        bw.write(sb.toString() + "\n");
        bw.flush();bw.close();
    }
}

설명