algorithms software expert

소프트웨어 익스퍼트 1218 (software expert 1218)

2020.01.17 ·

소프트웨어 익스퍼트 1218 (software expert 1218)

목차

• 코드
• 설명

소프트웨어 익스퍼트 1218

Software Expert Academy 1218

소프트웨어 익스퍼트 아카데미 1218 (Software Expert Academy 1218)

https://swexpertacademy.com

코드

import java.io.*;
import java.util.Stack;

public class SWE1218 {
    static int t = 10, n;
    static String in;
    static boolean isVPS;
    static Stack<Character> s = new Stack<>();
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
        while (t-- != 0) {
            n = Integer.parseInt(br.readLine());
            in = br.readLine();isVPS = true;
            for (int i = 0; i < in.length(); i++) {
                switch (in.charAt(i)) {
                    case '(':case '[':case '<':case '{': s.push(in.charAt(i));break;
                    case ')': if (s.peek() == '(') s.pop();else isVPS = false;break;
                    case ']': if (s.peek() == '[') s.pop();else isVPS = false;break;
                    case '>': if (s.peek() == '<') s.pop();else isVPS = false;break;
                    case '}': if (s.peek() == '{') s.pop();else isVPS = false;break;
                }
            }
            bw.write("#" + (10 - t) + " " + (isVPS && s.isEmpty() ? "1" : "0") + "\n");
            bw.flush();s.clear();
        }
        bw.close();
    }
}

설명