HDU 1164 Eddy's research I 数论

题意：把一个数表示成它的素因子乘积。

思路：暴力找出它的素因子，然后输出即可。

/*********************************************
Problem : HDU 1164
Author  : NMfloat
InkTime (c) NM . All Rights Reserved .
********************************************/

#include <map>
#include <set>
#include <queue>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>

#define rep(i,a,b)  for(int i = (a) ; i <= (b) ; i ++)
#define rrep(i,a,b) for(int i = (b) ; i >= (a) ; i --)
#define repE(p,u) for(Edge * p = G[u].first ; p ; p = p -> next)
#define cls(a,x)   memset(a,x,sizeof(a))
#define eps 1e-8

using namespace std;

const int MOD = 1e9+7;
const int INF = 0x3f3f3f3f;
const int MAXN = 1e5+5;
const int MAXE = 2e5+5;

typedef long long LL;
typedef unsigned long long ULL;

int T,n,m,k;

int ans[1005];

void input() {

}

void solve() {
int tmp = n ;
int pos = 0 ;
for(int i = 2 ; i * i <= tmp ; i ++) {
if(tmp % i == 0) {
while(tmp % i == 0) {
ans[++pos] = i;
tmp /= i;
}
}
}
if(tmp > 1) ans[++pos] = tmp;
rep(i,1,pos) {
printf("%d",ans[i]);
if(i == pos) puts("");
else printf("*");
}
}

int main(void) {
//freopen("a.in","r",stdin);
//scanf("%d",&T); while(T--) {
//while(~scanf("%d %d",&n,&m)) {
while(~scanf("%d",&n)) {
input();
solve();
}
return 0;
}