数论练习一 B题

题目链接：https://vjudge.net/contest/373436#problem/B

【问题】

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.

【输入】

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.

【输出】

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

【思路】

这道题还是问的别人，代码看了好久才理解
很简单一道题目。首先他要求这个数能被2，3，5，7整除，那么找四个数a、b、d表示给定的数n中有a-1个2，b-1个3 ，c-1个5，d-1个7，然后a * b * c * d代表总的因子的数目，这里可以考虑成排列组合，举个例子，当n = 12时，，此时c = d = 1，a = 3，b = 2，因子有{1，2，3，4，6，12}即{1，(2 * 1 * 1 * 1)，(1 * 3 * 1 * 1)，((2 * 2) * 1 * 1 * 1)，(2 * 3 * 1 * 1)，((2 * 2) * 3 * 1 * 1)}，即与2有关的情况有三种，无2，一个2，两个2，与三有关的情况有两种，无3，一个3，与5、7有关的情况都只有一种，无5，无7，即3 * 2 * 1 * 1 = 6总共6种.
感觉说的有点乱，再具体参考代码吧

【源代码】

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
#include<cstring>
#include<iomanip>
#include<cmath>
using namespace std;
#define ll  long long 
int main()
{
 ll n; 
 ll a, b, c, d;
 while (cin >> n && n)
 {
  a = b = c = d = 1;
  while (n != 1)
  {
   if (n % 2 == 0)
    a++, n /= 2;
   if (n % 3 == 0)
    b++, n /= 3;
   if (n % 5 == 0)
    c++, n /= 5;
   if (n % 7 == 0)
    d++, n /= 7;
  }
  cout << a * b * c * d << endl;
 }
}