[스택/큐/덱] 2월 26일

01-정렬/필수/11478.cpp

@@ -0,0 +1,18 @@
+#include <iostream>
+#include <string>
+#include <set>
+
+using namespace std;
+int main() {
+    string str;
+    cin >> str;
+    set<string> S;
+    int N = str.size();
+    for (int i = 0; i < N; i++) {
+        for (int len = 1; len <= N - i; len++) {
+            S.insert(str.substr(i, len));
+        }
+    }
+    cout << S.size();
+    return 0;
+}

01-정렬/필수/1431.cpp

@@ -8,23 +8,7 @@ int compare(string a, string b) {
     int b_size = b.size();
     int a_sum = 0;
     int b_sum = 0;
-    if (a_size != b_size) {
-        return a_size < b_size;
-    }
-    else {
-        for (int i = 0; i < a_size; i++) {
-            if (a[i] >= '0' && a[i] <= '9') {
-                a_sum += int(a[i]) - 48;
-            }
-            if (b[i] >= '0' && b[i] <= '9') {
-                b_sum += int(b[i]) - 48;
-            }
-        }
-        if (a_sum != b_sum) {
-            return a_sum < b_sum;
-        }
-    }
-    return a < b;
+
 }
 int main() {
     int N;

01-정렬/필수/19636.cpp

@@ -0,0 +1,41 @@
+#include <iostream>
+#include <cmath>
+using namespace std;
+
+int main() {
+	int W0, I0, T, D, I, A;
+
+	cin >> W0 >> I0 >> T;
+	cin >> D >> I >> A;
+
+	int W1 = W0; //���ʴ�緮 ��ȭ �ݿ� ����
+	int W2 = W0; //���� ��緮 ��ȭ �ݿ� ��
+
+	int I1 = I0; //��ȭ�� ���ʴ�緮 ����
+
+	for (int i = 0; i < D; i++) {
+		W1 += I - (I0 + A);
+		W2 += I - (I1 + A);
+		if (abs(I - (I1 + A)) > T) {
+			I1 += floor((I - (I1 + A)) / 2.0);
+		}
+	}
+	if (W1 <= 0 || I0 <= 0) {
+		cout << "Danger Diet\n";
+	}
+	else {
+		cout << W1 << ' ' << I0 << '\n';
+	}
+	if (W2 <= 0 || I1 <= 0) {
+		cout << "Danger Diet";
+	}
+	else {
+		cout << W2 << ' ' << I1 << ' ';
+		if (I0 - I1 > 0) {
+			cout << "YOYO";
+		}
+		else {
+			cout << "NO";
+		}
+	}
+}

02-스택,큐,덱/필수/10757.cpp

@@ -0,0 +1,28 @@
+#include <iostream>
+#include <string>
+#include <algorithm>
+using namespace std;
+
+int main() {
+    string A, B;
+    cin >> A >> B;
+
+    //�� ������ ���̸� ���� ª�� �� �տ� 0�� �߰���
+    while (A.length() < B.length()) A = '0' + A;
+    while (B.length() < A.length()) B = '0' + B;
+
+    string result = "";
+    int round = 0; //�ڸ��ø�����
+
+    //�ڿ��� ���� ���ʴ�� ����
+    for (int i = A.length() - 1; i >= 0; i--) {
+        int sum = (A[i] - '0') + (B[i] - '0') + round;
+        round = sum / 10; //10�� ������ 1�� �ø�
+        result += (sum % 10) + '0'; //�ڸ��� �ϳ� �߰���
+    }
+
+    if (round) result += '1'; //���������� �ø��� ���������� �ڸ��� �ø�
+    reverse(result.begin(), result.end()); //�ڿ��� ���� ��������� reverse�� ����� ���
+
+    cout << result;
+}

02-스택,큐,덱/필수/2164.cpp

@@ -0,0 +1,31 @@
+#include <iostream>
+#include <queue>
+using namespace std;
+
+int main() {
+    ios::sync_with_stdio(false);
+    cin.tie(NULL); cout.tie(NULL);
+
+    //N�� �Է¹ޱ�
+    int N;
+    cin >> N;
+
+    //1���� N���� ��� queue����
+    queue<int> Q;
+    for (int i = 1; i <= N; i++) {
+        Q.push(i);
+    }
+
+    //���� ���Ǵ�� ������ �ϳ��� ���� ������ ����
+    while (Q.size() != 1) {
+        //���� �տ� �ִ� �� ����
+        Q.pop();
+        //�״������� �տ� �ִ� ���� queue�� ����
+        Q.push(Q.front());
+        //���� �տ� �ִ� �� ����. �̷��� ��������� �տ� �ִ� ���� �ڷ� �������� �ȴ�.
+        Q.pop();
+    }
+
+    cout << Q.front();
+    return 0;
+}

02-스택,큐,덱/필수/4949.cpp

@@ -0,0 +1,57 @@
+#include <iostream>
+#include <string>
+#include <stack>
+using namespace std;
+
+int main() {
+    ios::sync_with_stdio(false);
+    cin.tie(NULL); cout.tie(NULL);
+    while (true) {
+        //�ٺ��� ���� �Է¹ޱ�
+        string input;
+        getline(cin, input);
+
+        //.�� �ԷµǸ� while�� ������
+        if (input == ".") {
+            break;
+        }
+        //������ ��ȣ�� ���� stack�� yes/no�� ǥ���� result ����
+        stack<char> S;
+        bool result = true;
+        for (int i = 0; i < input.length(); i++) {
+            //����ȿ� ���� ��ȣ�� ������ stack�� ���(push)
+            if (input[i] == '[' || input[i] == '(') {
+                S.push(input[i]);
+            }
+            //����ȿ� �ݴ� ��ȣ�� ������
+            if (input[i] == ']') {
+                //stack�� ������� �ʰ�(empty()�� 0) stack�� ���� ���� ���� ¦�� ���� ��ȣ�̸� stack�� ���� ���� ���� ����(pop)
+                if (S.empty() == 0 && S.top() == '[') {
+                    S.pop();
+                }
+                //�ƴ϶�� result�� false�� �ٲٰ� while�� ����
+                else {
+                    result = false;
+                    break;
+                }
+            }
+            if (input[i] == ')') {
+                if (S.empty() == 0 && S.top() == '(') {
+                    S.pop();
+                }
+                else {
+                    result = false;
+                    break;
+                }
+            }
+        }
+        //stack�� ����ְ� result�� true��� yes���
+        if (S.empty() == 1 && result == true) {
+            cout << "yes" << endl;
+        }
+        //�ƴ϶�� no���
+        else {
+            cout << "no" << endl;
+        }
+    }
+}