diff --git "a/\354\235\264\353\213\210\354\247\200\354\210\230/15650_N\352\263\274 M(2).py" "b/\354\235\264\353\213\210\354\247\200\354\210\230/15650_N\352\263\274 M(2).py"
new file mode 100644
index 0000000..c2643b0
--- /dev/null
+++ "b/\354\235\264\353\213\210\354\247\200\354\210\230/15650_N\352\263\274 M(2).py"	
@@ -0,0 +1,9 @@
+import itertools
+
+n, m = map(int, input().split())
+numlist = list(range(1, n+1))
+num = list(itertools.combinations(numlist ,m))
+for i in num:
+    for j in i:
+        print(j, end= ' ')
+    print()
\ No newline at end of file
diff --git "a/\354\235\264\353\213\210\354\247\200\354\210\230/1978_\354\206\214\354\210\230 \354\260\276\352\270\260.py" "b/\354\235\264\353\213\210\354\247\200\354\210\230/1978_\354\206\214\354\210\230 \354\260\276\352\270\260.py"
new file mode 100644
index 0000000..262b50b
--- /dev/null
+++ "b/\354\235\264\353\213\210\354\247\200\354\210\230/1978_\354\206\214\354\210\230 \354\260\276\352\270\260.py"	
@@ -0,0 +1,15 @@
+n = int(input())
+num = map(int, input().split())
+
+sum = 0
+for i in num:
+    zeroNum = 0
+    if i == 1:                
+        zeroNum +=1
+    else:
+        for j in range(2, int(i)):
+            if i % j == 0:
+                zeroNum+=1
+    if zeroNum == 0:
+        sum+=1
+print(sum)
\ No newline at end of file
diff --git "a/\354\235\264\353\213\210\354\247\200\354\210\230/5567_\352\262\260\355\230\274\354\213\235.py" "b/\354\235\264\353\213\210\354\247\200\354\210\230/5567_\352\262\260\355\230\274\354\213\235.py"
new file mode 100644
index 0000000..c2bd080
--- /dev/null
+++ "b/\354\235\264\353\213\210\354\247\200\354\210\230/5567_\352\262\260\355\230\274\354\213\235.py"
@@ -0,0 +1,43 @@
+# 5567 결혼식
+
+# 입력 값
+
+# 6
+# 5
+# 1 2
+# 1 3
+# 3 4
+# 2 3
+# 4 5
+
+import sys
+from collections import deque
+
+N = int(sys.stdin.readline())
+M = int(sys.stdin.readline())
+
+graph = [[False] * (N + 1) for _ in range(N + 1)]
+
+for _ in range(M):
+    a, b = map(int, sys.stdin.readline().split())
+    graph[a].append(b) # a 인덱스에 b 넣기
+    graph[b].append(a) # b 인덱스에 a 넣기
+
+visited = [0] * (N + 1)  # false 대신 0 넣기 -> 더해야돼서!
+
+def bfs(V):
+    q = deque([V])  
+    visited[V] = 1  
+    while q:
+        V = q.popleft()
+        for i in graph[V]:  
+            if visited[i] == 0: 
+                q.append(i)
+                visited[i] = visited[V] + 1
+bfs(1)
+result = 0
+for i in range(2,N+1):
+    # 본인이거나 친구거나, 친구의 친구거나 경우의 수가 최대 3개
+    if 0 < visited[i] <=3:
+        result += 1
+print(result)
diff --git "a/\354\235\264\353\213\210\354\247\200\354\210\230/5567\353\274\210\353\214\200.py" "b/\354\235\264\353\213\210\354\247\200\354\210\230/5567\353\274\210\353\214\200.py"
new file mode 100644
index 0000000..8fc1a8e
--- /dev/null
+++ "b/\354\235\264\353\213\210\354\247\200\354\210\230/5567\353\274\210\353\214\200.py"
@@ -0,0 +1,38 @@
+# 5567 결혼식
+
+# 입력 값
+
+# 6
+# 5
+# 1 2
+# 1 3
+# 3 4
+# 2 3
+# 4 5
+
+import sys
+from collections import deque
+
+# N 과 M 입력 받는 방법 다름
+N = 
+M = 
+
+graph = [[False] * (N + 1) for _ in range(N + 1)]
+
+for _ in range(M):
+    a, b = map(int, sys.stdin.readline().split())
+    #그래프 초기 세팅 다름
+
+visited = [0] * (N + 1)  # false 대신 0
+
+def bfs(V):
+    q = deque([V])  
+    visited[V] = 1 # 숫자 덧셈에 필요
+    while q:
+        V = q.popleft()
+        for i in range(1, N + 1):  #for문 범위 수정
+            if not visited[i] and graph[V][i]: # visited[i] 관련 조건 다름
+                q.append(i)
+                visited[i] =  # visited[i] 구하는 방법 다름
+bfs(1)
+# 추가 코드