← All problemsSign in

2549. Count Distinct Numbers on Board

LeetCodeArrayHash TableMathSimulationOpen on judge ↗

You are given a positive integer n, that is initially placed on a board. Every day, for 109 days, you perform the following procedure: - For each number x present on the board, find all numbers 1 <= i <= n such that x % i == 1. - Then, place those numbers on the board. Return the number of distinct integers present on the board after 109 days have elapsed. Note: - Once a number is placed on t

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start