UVa 112. Tree summing by Java. AC. -_-.....

package test; import java.io.*; public class Main { static DataInputStream dis; static int target; static boolean what; static boolean plus; public static boolean getTarget() throws Exception { int temp1, start = 0; while (((temp1 = dis.read()) != -1)) { if (temp1 == '-') { plus = false; start++; continue; } if (temp1 == '(') { what = true; return true; } if (temp1 == -1) { return false; } if (temp1 == ' ' || temp1 == '\n' || temp1 == '\r') { if (start == 0) { continue; } break; } target = target * 10 + (temp1 - '0'); start++; } if (temp1 == -1) { return false; } if (plus == false) { target *= -1; plus = true; } return true; } public static int getTree(int sum, int target, int treelevel) throws Exception { int temp1; int node = 0; int result1, result2; while ((temp1 = dis.read()) != '(') { if (temp1 == ')') { return 0; } if (temp1 == ' ' || temp1 == '\n' || temp1 == '\r') { continue; } if (temp1 == '-') { plus = false; continue; } node = node * 10 + temp1 - '0'; } if (plus == false) { node *= -1; plus = true; } result1 = getTree(sum + node, target, treelevel + 1); while ((temp1 = dis.read()) != '('); result2 = getTree(sum + node, target, treelevel + 1); while ((temp1 = dis.read()) != ')'); if (result1 == 0 && result2 == 0) { if (sum + node == target) { return 1; } else { return -1; } } if (result1 == 1 || result2 == 1) { return 1; } else { return -1; } } public static void main(String[] args) throws Exception { int sum = 0, result, tmp; boolean one; dis = new DataInputStream(System.in); while (true) { what = false; plus = true; target = 0; one = getTarget(); if (one == false) { break; } if (one == true) { if (what == false) { while((tmp = dis.read()) != '('); } } result = getTree(sum, target, 1); if (result == 1) { System.out.println("yes"); } else { System.out.println("no"); } } } }

....

넷빈스 코딩판입니다.

.....

그냥 죤내 돌렸심..

찾아본 결과... 자바로 만든 솔루션중 웹에 올려놓는건 세계 최초일지도... -_-;