约数个数定理

约数个数定理以及简单的例题

一、约数个数定理的内容

二、例题：

原题链接

Problem Description

A number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 24, 25, 27, … shows the first 20 humble numbers.

Now given a humble number, please write a program to calculate the number of divisors about this humble number.For examle, 4 is a humble,and it have 3 divisors(1,2,4);12 have 6 divisors.

Input
The input consists of multiple test cases. Each test case consists of one humble number n,and n is in the range of 64-bits signed integer. Input is terminated by a value of zero for n.

Output
For each test case, output its divisor number, one line per case.

Sample Input
4
12
0

Sample Output
3
6

题意分析：我们把只有2、3、5、7质因数的数称作humble number，要求求出一个humble number的质因数的个数

代码如下：

#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
	ios::sync_with_stdio(0);
	ll n;
	while(cin >> n)
	{
		ll a[4] = {2, 3, 5, 7};
		ll cnt[4] = {1, 1, 1, 1};
		//the initial value of cnt is 1 because of the formula expression
		if(n == 0) return 0;
		for (ll i = 0; i < 4; i++)
		{
			while(n % a[i] == 0)
			{
				n /= a[i];
				cnt[i]++;
			}
		}
		cout << cnt[0] * cnt[1] * cnt[2] * cnt[3] << endl;
	}
	return 0;
}