Participate in exhilarating programming contests, solve unique algorithm and data structure challenges and be a part of an awesome community.
Byang is going to join a new school. His new class has students.
Each of the students are identified by their roll numbers starting from to . Byang’s roll number will be .
Byang plans to make friends with only those whose roll numbers are a divisor of his roll number.
Can you help Byang count how many friends he could potentially make? You can assume everyone wants to be Byang’s friend.
The input will contain an integer ().
Print the number of friends Byang will make in his new class.
Input | Output |
---|---|
6 | 3 |
96% Solution Ratio
hasanakhiarEarliest,
hasanakhiarFastest, 0.0s
HurayraIITLightest, 0 B
n4o847Shortest, 34B
Login to submit