POJ 3421

#include<iostream>#include<time.h>#include<string.h>#include<stdio.h>using namespace std;#define size 1025int a[size+1];bool b[size+1];int f[20][20];/*筛法求素数求[1,n]的所有素数,素数放入a[]中，返回有多少个素数*/int prime(int *a,int n){memset(b,1,sizeof(bool)*(n+1));b[0]=0;b[1]=0;for(int i=2;i*i<n+1;i++)for(int j=i*i;j<n+1;j+=i)b[j]=0;int k=0;for(int i=1;i<n+1;i++)if(b[i]){a[k++]=i;}return k;}long long A(int n){if(n<2)return 1;return A(n-1)*n;}int main(){freopen("1.txt","r",stdin);int k,k1,n;memset(f,0,sizeof(f));k=prime(a,size);while(scanf("%d",&n)!=EOF){int count=0;int pcount=0;int flag=1;long long a2=1;int num=0;for(int i=0;(i<k)&&n;i++){pcount=0;while(n%a[i]==0){count++;pcount++;n/=a[i];}a2*=A(pcount);}if(n!=1)count++;printf("%d %d/n",count,A(count)/a2);}}