HDU 2964 Prime Bases（数论）

题目：

Given any integer base b >= 2, it is well known that every positive integer n can be uniquely represented in base b. That is, we can write

n = a0 + a1*b + a2*b*b + a3*b*b*b + ... 

where the coefficients a0, a1, a2, a3, ... are between 0 and b-1 (inclusive).

What is less well known is that if p0, p1, p2, ... are the first primes (starting from 2, 3, 5, ...), every positive integer n can be represented uniquely in the "mixed" bases as:

n = a0 + a1*p0 + a2*p0*p1 + a3*p0*p1*p2 + ... 

where each coefficient ai is between 0 and pi-1 (inclusive). Notice that, for example, a3 is between 0 and p3-1, even though p3 may not be needed explicitly to represent the integer n.

Given a positive integer n, you are asked to write n in the representation above. Do not use more primes than it is needed to represent n, and omit all terms in which the coefficient is 0.

Each line of input consists of a single positive 32-bit signed integer. The end of input is indicated by a line containing the integer 0.

For each integer, print the integer, followed by a space, an equal sign, and a space, followed by the mixed base representation of the integer in the format shown below. The terms should be separated by a space, a plus sign, and a space. The output for each integer should appear on its own line.

Simple Input:

123

456

123456

0

Simple Output:

123 = 1 + 1*2 + 4*2*3*5

456 = 1*2*3 + 1*2*3*5 + 2*2*3*5*7

123456 = 1*2*3 + 6*2*3*5 + 4*2*3*5*7 + 1*2*3*5*7*11 + 4*2*3*5*7*11*13

题目分析：本题大概就是讲给你一个64位的数可以分成以素数的乘积形式相加,只是其中确定系数的时候比较关键。还有就是输出格式（好几次都是显示格式不正确T^T）。

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int prime[10]={1,2,3,5,7,11,13,17,19,23};
int a[10],n[10];//a[10]存素数积，n[10]存系数
int main()
{
    int num,i,j;
    a[0]=1;
    for(i=1;i<10;i++)
        a[i]=a[i-1]*prime[i];//存前i个素数的乘积
    while(scanf("%d",&num)!=EOF)
    {
        if(num==0)
            break;
        memset(n,0,sizeof(n));
        int flag=0;//flag用于判断是不是第一个数
        printf("%d =",num);
        for(i=9;i>=0;i--)
        {
            if(num>=a[i])
            {
                n[i]=num/a[i];
                num%=a[i];
            }
        }
        for(i=0;i<10;i++)
        {
            if(n[i])
            {
                if(flag)
                {
                   printf(" +");
                }
                printf(" %d",n[i]);
                for(j=1;j<=i;j++)
                {
                    printf("*%d",prime[j]);
                }
                flag=1;
            }
        }
        printf("\n");
    }
    return 0;
}