Solutions/Fanta's Solution UVa. 112, PKU 1145. Tree Summing. AC 지환태 2008. 12. 15. 19:24 #include <stdio.h> int num,yes; char ch; int func(int sum) { int n,leaf=0; if(scanf(" %d",&n)) { sum+=n; scanf(" %c",&ch); leaf+=func(sum); scanf(" %c",&ch); leaf+=func(sum); if(leaf==2 && sum==num) { yes=1; } } else { if(scanf(" %c",&ch)) { if(ch==')') return 1; } } if(scanf(" %c",&ch)) { if(ch==')') return 0; } } main() { while (scanf("%d", &num) != EOF) { scanf(" %c",&ch); func(0); if(yes==1) puts("yes"); else puts("no"); yes=0; } } Run ID User Problem Result Memory Time Language Code Length Submit Time 4487384 jht009 1145 Accepted 200K 16MS C 558B 2008-12-15 18:12:21지각인가요 알콜코딩 성공 ㅎㅎㅎㅎ 취하지도 않고 냄새만 맡아가면서 해봤어요. 사람이 할 짓은 아닌 듯 ㅇㅅㅇ 술 왜마시죠??????????