ME

Number of Ways to Reach Island N

The map contains islands named from 1 to n. For any two islands i and j, you can go to j from i only if i divides j. Find the number of ways to reach island n starting from island 1. You can't move from island i to i. There are t test cases, each denoted by a single integer n, the island that you have to reach.

Example 1:

Input:[4]

Output:2

Example 2:

Input:[5]

Output:1

Example 3:

Input:[6]

Output:3

Constraints:

1 ≤ t ≤ 10^5
1 < n < 10^6

Loading...

Run code to see test results

00:00 / 69:42

Number of Ways to Reach Island N

MediumMed•233 views

The map contains islands named from 1 to n. For any two islands i and j, you can go to j from i only if i divides j. Find the number of ways to reach island n starting from island 1. You can't move from island i to i. There are t test cases, each denoted by a single integer n, the island that you have to reach.