CT156

Lantern Keeper’s Divisor Tally

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

A keeper counts every positive divisor of a lantern batch number. Task: Count the positive divisors of n, including 1 and n. Input format: One positive integer n. Output format: One integer: the divisor count. Constraints: 1 <= n <= 10^9 Edge rules: Apply the stated zero, tie, boundary, and ordering conventions exactly.

Example 1:

Input: 1
Output: 1

Example 2:

Input: 2
Output: 2

Example 3:

Input: 12
Output: 6

Constraints:

1 <= n <= 10^9

Tags:

divisors loops
Loading...
Test Cases:No test cases
No test cases available.
Lantern Keeper’s Divisor Tally - EASY Coding Problem | CodeTikki