diff --git "a/9\354\233\22410\354\235\274-\354\212\244\355\203\235,\355\201\220,\353\215\261/10866.cpp" "b/9\354\233\22410\354\235\274-\354\212\244\355\203\235,\355\201\220,\353\215\261/10866.cpp"
deleted file mode 100644
index 36ee244..0000000
--- "a/9\354\233\22410\354\235\274-\354\212\244\355\203\235,\355\201\220,\353\215\261/10866.cpp"
+++ /dev/null
@@ -1,103 +0,0 @@
-#include <iostream>
-#include <deque>
-#include<string>
-using namespace  std;
-
-
-
-int main() {
-  	
-   //백준 10866번
-	ios_base::sync_with_stdio(false);
-	cin.tie(NULL);
-	
-	deque<int> q;
-	string s;
-	int n;
-	int m;
-	cin >> n;
-	while (n--) {
-
-		cin >> s;
-		if (s == "push_front") {
-			cin >> m;
-			q.push_front(m);
-
-		}
-		else if (s == "push_back") {
-			cin >> m;
-			q.push_back(m);
-		}
-		else if (s == "pop_front") {
-			if (!q.empty()) {
-				cout << q.front()<<'\n';
-				q.pop_front();
-			}
-			else {
-				cout << -1<<'\n';
-			}
-
-
-		}
-		else if (s == "pop_back") {
-			if (!q.empty()) {
-				cout << q.back() << '\n';
-				q.pop_back();
-			}
-			else {
-				cout << -1 << '\n';
-			}
-		}
-		else if (s == "size") {
-			cout << q.size()<<'\n';
-
-		}
-		else if (s == "empty") {
-			if (q.empty()) {
-				cout << 1<<'\n';
-			}
-			else {
-				cout << 0 << '\n';
-			}
-
-		}
-		else if (s == "front") {
-
-			if (q.empty()) {
-				cout << -1 << '\n';
-			}
-			else {
-				cout << q.front() << '\n';
-			}
-
-
-		}
-		else if (s == "back") {
-
-			if (q.empty()) {
-				cout << -1 << '\n';
-			}
-			else {
-				cout << q.back() << '\n';
-			}
-
-
-		}
-
-
-
-
-	}
-
-
-
-
-
-
-
-
-
-
-	
-	
-}
diff --git "a/9\354\233\22410\354\235\274-\354\212\244\355\203\235,\355\201\220,\353\215\261/1918.cpp" "b/9\354\233\22410\354\235\274-\354\212\244\355\203\235,\355\201\220,\353\215\261/1918.cpp"
deleted file mode 100644
index cd63e4a..0000000
--- "a/9\354\233\22410\354\235\274-\354\212\244\355\203\235,\355\201\220,\353\215\261/1918.cpp"
+++ /dev/null
@@ -1,89 +0,0 @@
-#define _CRT_SECURE_NO_WARNINGS
-#include <stdio.h>
-#include <stdbool.h>
-#include <stdlib.h>
-#include<iostream>
-#include<string>
-#include<stack>
-#define MAX 100
-
-using namespace  std;
-
-stack<char> tmp;
-string result="";
-
-
-void cal(string s) {
-	for (int i = 0; i < s.size(); i++) {
-		//스택에는 괄호나 연산자만 들어감,나오는건 연산자만 나옴
-
-		//피연산자는 바로 추가
-		if (s[i] >= 'A' && s[i] <= 'Z') {
-			result += s[i];
-
-		}
-		if (s[i] == '(') {
-
-			tmp.push(s[i]);
-
-		}
-		if (s[i] == ')') {
-			//왼쪽 괄호 나올때까지 모든 연산자 추가하기
-			while (!tmp.empty() && tmp.top() != '(') {
-
-				result += tmp.top();
-				tmp.pop();
-
-			}
-			//왼쪽 괄호 제거
-			tmp.pop();
-
-		}
-		if (s[i] == '*' || s[i] == '/') {
-			//자신들과 같은 우선순위 연산자만 빼고(앞에 있던 거니까) 자신을 추가하기
-			while (!tmp.empty()&&(tmp.top() == '*' || tmp.top() == '/')) {
-				
-					result += tmp.top();
-					tmp.pop();
-				
-			}
-			//뒤에 자신과 같은 우선순위 연산자 올수 있으니까 일단 스택에 넣기
-			tmp.push(s[i]);
-		}
-		if (s[i] == '+' || s[i] == '-') {
-			//자신들과 같고 우위의 연산자 빼기
-			while (!tmp.empty()&& tmp.top() != '(') {
-				
-					result += tmp.top();
-					tmp.pop();
-				
-			}
-			tmp.push(s[i]);
-		}
-		
-	}
-	while (!tmp.empty()) {
-		result += tmp.top();
-		tmp.pop();
-	}
-}
-
-
-
-int main() {
-
-	//백준 1918번
-
-	//중위 표기식을 후위 표기식으로 바꾸기
-	//우선순위
-	// ( <<<<  + - <<<< * /
-	string s;
-	cin >> s;
-	cal(s);
-	cout << result;
-	
-
-
-
-
-}
diff --git "a/9\354\233\22410\354\235\274-\354\212\244\355\203\235,\355\201\220,\353\215\261/20920.cpp" "b/9\354\233\22410\354\235\274-\354\212\244\355\203\235,\355\201\220,\353\215\261/20920.cpp"
deleted file mode 100644
index f23a849..0000000
--- "a/9\354\233\22410\354\235\274-\354\212\244\355\203\235,\355\201\220,\353\215\261/20920.cpp"
+++ /dev/null
@@ -1,66 +0,0 @@
-#include <iostream>
-#include <vector>
-#include<string>
-#include<algorithm>
-#include<map>
-
-using namespace  std;
-
-map<string, int> check;
-vector<string>v;
-int n, m; //길이가 m이상인거부터 외움
-string s;
-
-bool compare(string a, string b) {
-
-
-	if (a.size() == b.size()&&check[a] == check[b]) {  //여기서 순서바꾸면 시간초과 뜸
-		return a < b;
-	}
-	else if (check[a] == check[b]) {
-		return a.size() > b.size();
-	}
-
-
-	return check[a] > check[b];
-
-
-
-}
-
-
-int main() {
-
-	//백준 20920번
-
-	ios_base::sync_with_stdio(false);
-	cin.tie(NULL);
-	cout.tie(NULL);
-	//자주 나오는 단어-> 단어길이 길수록->알파벳 순
-
-
-	cin >> n >> m;
-	for (int i = 0; i < n; i++) {
-		cin >> s;
-		if (s.size() < m)continue;
-
-		//길이가 m이상인것만
-
-		if (check.find(s) == check.end()) {
-			check[s] = 0;
-			//처음 출현할떄만 
-			v.push_back(s);
-		}
-		check[s]++;
-
-	}
-
-	sort(v.begin(), v.end(), compare);
-
-	for (int i = 0; i < v.size(); i++) {
-		cout << v[i] << '\n';
-	}
-
-
-
-}