diff --git a/README.md b/README.md
index d3b17d3..d9ee18c 100644
--- a/README.md
+++ b/README.md
@@ -1,3 +1,19 @@
 # atcoder_dpTask
 Solutions of atcoder dynamic programming educational contest
-Readme is yet to be made
+Done successfully using c++
+Questions are as follows
+
+frog 1
+There are N stones, numbered 1,2,…,N. For eachi (1≤i≤N), the height of Stone i is h i.
+There is a frog who is initially on Stone 1. He will repeat the following action some number of times to reach Stone N:
+If the frog is currently on Stone i, jump to Stone i+1 or Stone i+2. Here, a cost of |hi−hj| is incurred, where j is the stone to land on.
+Find the minimum possible total cost incurred before the frog reaches Stone N.
+
+frog 2
+There are N stones, numbered 1,2,…,N. For each i (1≤i≤N), the height of Stone i is hi.
+There is a frog who is initially on Stone 1. He will repeat the following action some number of times to reach Stone N:
+If the frog is currently on Stone i, jump to one of the following: Stone i+1,i+2,…,i+K. Here, a cost of |hi−hj| is incurred, where j is the stone to land on.
+Find the minimum possible total cost incurred before the frog reaches Stone N.
+
+find rest of the questions at
+https://atcoder.jp/contests/dp/tasks