The ADV-98 algorithm improves the number of divisors

Enter a positive integer N (1

sample input

12

Sample output

6

Sample description

　　Divisors of 12 include: 1, 2, 3, 4, 6, 12. 6 in total

Code:

#include<iostream>
using namespace std;

intmain()
{
	int num,i = 1,count = 0;
	cin>>num;
	while(i<=num)
	{
		if(num%i == 0) count++;
		i++;
	}
	cout<<count;
	
	return 0;
}