Update Frogs_and_jumps.cpp

STREIN-11 · Oct 26, 2024 · 03fded8 · 03fded8
1 parent e96b2d4
commit 03fded8
Showing 1 changed file with 3 additions and 0 deletions.
diff --git a/Daily/Frogs_and_jumps.cpp b/Daily/Frogs_and_jumps.cpp
@@ -6,6 +6,9 @@ a frog having strength 2 will visit the leaves 2, 4, 6, ...  etc. while crossing
 Given the strength of each frog and the number of leaves, your task is to find the number of leaves that not be visited by any 
 of the frogs when all frogs have reached the other end of the pond. 
 
+
+
+
 Input:
 N = 3
 leaves = 4