Company: UIDAI_16dec
Difficulty: medium
Islands Problem body { font-family: -apple-system, BlinkMacSystemFont, "Segoe UI", "Roboto", "Oxygen", "Ubuntu", "Cantarell", "Fira Sans", "Droid Sans", "Helvetica Neue", sans-serif; line-height: 1.6; color: #333; max-width: 800px; margin: 20px auto; padding: 0 20px; } h1, h2 { border-bottom: 2px solid #eee; padding-bottom: 10px; } h1 { font-size: 2em; } h2 { font-size: 1.5em; } pre { background-color: #f4f4f4; padding: 15px; border-radius: 5px; white-space: pre-wrap; word-wrap: break-word; } code { font-family: "SFMono-Regular", Consolas, "Liberation Mono", Menlo, Courier, monospace; } ul { padding-left: 20px; } li { margin-bottom: 10px; } Islands Problem Description The map contains Islands, named from Island 1 to Island N. For any two islands I and Island J (where I ≠ J), you can go to Island J from Island I only if the value I divides J (i.e., I is a divisor of J). Given the value for the last island, N, find the number of ways to reach Island N from the first Island, that is, Isla