Marks :10
: 2 | : 0
You can jump from $$$A$$$ to $$$B$$$, if and only if $$$B \; \% \; (B-A) = 0$$$, where $$$ \% $$$ is the modulo operator. You are given an integer $$$N$$$. Find the number of ways to reach N, if you can only use the above jumps and start at 1. Since the answer can be large, find the answer modulo $$$10^9+7$$$.
The first line of input consists of a single integer $$$N$$$. $$$(1 \leq N \leq 10^5)$$$
The output should consist of a single integer, the total number of ways to reach $$$N$$$.
1
1
2
1
5
2
10
31
1337
37318587
You need to login to view your submissions.
You need to login to view all submissions.
Result : Executed
Feel something is wrong with the test cases?
Result : Accepted
Test Cases :
But to Run or Submit the Problem, you need to Log In.
Continue to Log InYour challenge has been submitted successfully.
You will get a response soon via WhatsApp or Email.
Do let us know your issue.