Fedora Project
Easy Peasy Lemon Squeezy
Given an integer N, write a program that counts how many positive divisors have N.
(Optional) To be considered as a good quality task you can't calculate every division
INPUT: The integer N. You can assume that 1≤N≤1000000. OUTPUT: An integer which is the count of positive divisors of N.
Examples:
- input 5 output 2
- input 10 output 4
Task tags
Students who completed this task
Ilia, sonnet, skr1p7, Rajvardhan, Ujjwal, Rudra Choubey, Blackhawk, Vedant V.S., BenMan, SS25, Cormac, zxyl, m1m3, cfalas, rt, Aker, Shreeniket987, Adit, espagueti, Gap, jaagrav, Gautham Varma K, Ching367436, KshitijTeotia06, UTx10101, Ari, Adrian2901, paraxor, D3ni, Merco, Sairaj, Goldengold, EmperorAj, Santhu, utkm, VH-tech, p014ri5, g_if, Mukundan314, Suhaas D, Ayush19, HooriaIshtiaq, akshayprogrammer, Suhas, ShridharS
Task type
- code Code