You can count the devisors between 1 and sqrt(n) and double it.
Then if n is a square number, subtract 1 from the result.
Search found 2 matches
- Sun Apr 22, 2012 10:27 pm
- Forum: Algorithms
- Topic: Total Number Of Divisors
- Replies: 6
- Views: 5072
- Sat Nov 26, 2011 8:19 pm
- Forum: Volume 7 (700-799)
- Topic: 706 - LCD Display
- Replies: 221
- Views: 60112
Please help!
Removed after AC