Instantly share code, notes, and snippets.

# HYEONWOO KIM HyeonWooKim

Created February 26, 2016 17:50
스택을 이용한 수식 계산기
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode characters
 /********************** 수식 입력 계산기 제작 : 20103324(국민대학교) ***********************/ #include #include #define TRUE 1 #define FALSE 0
Created February 26, 2016 17:53
실전 C프로그래밍 문제모음
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode characters
 /************************************** 국민대학교 컴퓨터공학부 20103324 김현우 문제 8 : 시간 계산 ***************************************/ #include #include #include
Created February 26, 2016 18:08
스택을 이용한 BOJ 9012 풀이
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode characters
 #include #include using namespace std; int top; int main(){ int cases; cin>>cases;
Last active February 26, 2016 18:19
배열을 이용한 스택 구현(BOJ 10828)
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode characters
 #include #include using namespace std; int stack[10000],top; void push(int n){ stack[top++]=n; } void pop(){
Created February 26, 2016 18:29
스택을 이용한 문제 풀이 (BOJ 10799)
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode characters
 #include #include using namespace std; int top; int main(){ string s; cin>>s;
Created February 28, 2016 13:19
에디터 C++ 버전(BOJ 1406)
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode characters
 #include #include #include using namespace std; int main() { string s; stack lst,rst; int n;
Last active February 28, 2016 13:20
에디터 Python 버전(BOJ 1406)
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode characters
 s=input() lst=list(s);rst=[] k = int(input()) for i in range(0,k): cmd = input() if cmd=='L' and len(lst): rst.append(lst.pop()) elif cmd=='D' and len(rst): lst.append(rst.pop()) elif cmd=='B' and len(lst):
Created March 5, 2016 01:59
스택 수열(BOJ 1874)
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode characters
 #include #include using namespace std; int main() { int k,n=1,c=0,t; char b[200001]; stacks;
Created March 6, 2016 18:06
조세퍼스 문제(BOJ 1158)
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode characters
 #include #include using namespace std; int main() { int n,m,d; vector v; cin>>n>>m;
Created March 23, 2016 19:11
홀수일까 짝수일까(BOJ 5988)
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode characters
 #include using namespace std; int main() { int n; string s; cin>>n; for(int i=0;i