Title Link: http://acm.fzu.edu.cn/problem.php?pid=1075
Idea: Decomposition factor
#include <iostream>#include <cstring>#include <cstdio>using namespace STD;Const intmaxn=65535+5;typedef Long LongLL;BOOLPRIME[MAXN];intp[maxn/Ten];intKvoidIsPrime () {k=0; LL i,j;memset(Prime,true,sizeof(prime)); for(i=2; i<maxn; i++) {if(Prime[i]) {p[k++]=i; for(j=i*i; j<maxn; j+=i) {prime[j]=false; } } }}intnum[ +];intFAC[MAXN];intCntvoidFenjie (intm) {memset(Num,0,sizeof(num)); Cnt=0; for(intI=0; p[i]*p[i]<=m&&i<k; i++) {if(m%p[i]==0) {Fac[cnt]=p[i]; while(m%p[i]==0) {num[cnt]++; M/=p[i]; } cnt++; } }if(m>1) {fac[cnt]=m; num[cnt++]=1; }}intMain () {intT IsPrime ();scanf("%d", &t); while(t--) {intMscanf("%d", &m); Fenjie (m);//cout<< "cnt=" <<cnt<<endl; for(intI=0; i<cnt-1; i++) { for(intj=0; j<num[i]; J + +) {cout<<fac[i]<<"*"; } } for(intI=0; i<num[cnt-1]-1; i++)cout<<fac[cnt-1]<<"*";cout<<fac[cnt-1]<<endl; }return 0;}
Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.
FOJ 1075 factorization factor