Hdu 1164 Eddy's research I

简单模拟。注意数组别越界！

CODE：

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;

const int maxn = 65534;

__int64 prime[maxn];
__int64 save[maxn];
int vis[maxn] = {0};
int cnt = 0;

void init()
{
__int64 i, j;
for(i = 2; i < maxn ; i++) if(!vis[i])
{
prime[cnt++] = i;
for(j = i*i; j < maxn; j += i) vis[j] = 1;
}
return ;
}

int main()
{
int i, j;
__int64 N;
init();
while(~scanf("%I64d", &N))
{
int tot = 0;
memset(save, 0, sizeof(save));
for(i = 0 ; i < cnt ; i++)
{
while(N%prime[i] == 0)
{
N /= prime[i];
save[tot++] = prime[i];
}
}
for(i = 0 ; i < tot ; i++)
{
printf(i!=tot-1?"%d*":"%d\n", save[i]);
}
}
return 0;}