add solution of Ladders E-Olymp (dynamic programming)

Contributors.html

@@ -225,6 +225,8 @@ <h1 class="animated rubberBand delay-4s">Contributors</h1>
 	<a class="box-item" href="https://github.com/akash-10-23"><span>Akash Ratan Verma</span></a>
 	<a class="box-item" href="https://github.com/ana2407"><span>Vibhuti Negi</span></a>
 	<a class="box-item" href="https://github.com/ananya2407"><span>Ananya Sajwan</span></a>
+  <a class="box-item" href="https://github.com/husinassegaff"><span>Husin Muhammad Assegaff</span></a>
+
       </div>
     </div>
 </div>

Program's_Contributed_By_Contributors/Dynamic Programming/Ladders.cpp

@@ -0,0 +1,21 @@
+// Solution of problem Ladders - E-Olymp (https://www.e-olymp.com/en/problems/989)
+
+#include <cstdio>
+using namespace std;
+
+int n, dp[100];
+
+int main()
+{
+    scanf("%d", &n);
+    dp[0] = 1;
+    for (int i = 1; i <= n; i++)
+    {
+        for (int j = n; j >= 0; j--)
+        {
+            if (i + j <= n)
+                dp[j + i] += dp[j];
+        }
+    }
+    printf("%d\n", dp[n]);
+}