10.1 CountFactors

Solution

int solution(int N) { // write your code in C++11 (g++ 4.8.2) unsigned int i = 1; int num = 0; while (i * i < (unsigned int)N) { if (N % i == 0) { num += 2; } i++; } if (i * i == N) { num++; } return int(num);}