Merge pull request #1 from CASPER-REPSAC/gsniper777

Gsniper777

Author: Floodnut

baekjoon/1874/gsniper777/1874.c

@@ -0,0 +1,64 @@
+#include<stdio.h>
+#include<stdlib.h>
+
+typedef struct SQ {
+	int data;
+	struct SQ* link;
+}SQ;
+
+SQ* TAIL;
+
+int isEmpty() {
+	if (TAIL == NULL) return 1;
+	else return 0;
+}
+
+void Push(int seq) {
+	SQ* tmp = (SQ*)malloc(sizeof(SQ));
+	tmp->data = seq;
+	tmp->link = TAIL;
+	TAIL = tmp;
+}
+
+int Pop() {
+	int pData;
+	SQ* popT = TAIL;
+	if (TAIL == NULL) return 0;
+	else {
+		pData = popT->data;
+		TAIL = popT->link;
+		free(popT);
+		return pData;
+	}
+}
+
+int top() {
+	if (TAIL == NULL) return 0;
+	else return TAIL->data;
+}
+int main() {
+	int n,s=0,i,j=0;
+	scanf("%d", &n);
+	char* print=(char*)malloc(sizeof(char)*2*n);
+	int* Seq = (int*)malloc(sizeof(int)*n);
+
+	for (i = 0; i < n; i++) {
+		scanf("%d",&Seq[i]);
+	}
+	for (i = 1; i <= n; i++) {
+		Push(i);
+		print[s++] = '+';
+		while (!isEmpty() && top() == Seq[j]) {
+			Pop();
+			print[s++] = '-';
+			j++;
+		}
+	}
+	if (!isEmpty()) printf("NO");
+	else {
+		for (i = 0; i < 2*n; i++) {
+			printf("%c\n", print[i]);
+		}
+	}
+	return 0;
+}

baekjoon/1874/gsniper777/README.md

@@ -0,0 +1,3 @@
+|제출 번호|아이디|문제|결과|메모리|시간|언어|코드길이|
+|:---|:---|:---|:---|:---|:---|:---|:---|
+|27036089|jjongmin77|1874|맞았습니다!!|2232KB|32ms|C++17|958B|