Update README.md

README.md

@@ -8,8 +8,8 @@ With Given Weighted Graph and value K, We want to create a Path where total weig
 What is the least number of edges used to build this path
 
 #### INPUT :
-Number of Node : N(1~20)
-K value : K(1~99)
+Number of Node : N 1~20
+K value : K 1~99
 Weighted Edges
 
 #### Output :