质因数分解

#include<cstdio>#include<vector>#define F first#define S secondusing namespace std;vector<pair<int,int> >prime;int main(){long long n;scanf("%lld",&n);int sum;for(int i=2;i*i<=n;i++)if(n%i==0){sum=0;while(n%i==0)n/=i,sum++;prime.push_back(make_pair(i,sum));}if(n>1) prime.push_back(make_pair(n,1));int siz=prime.size();for(int i=0;i<siz-1;i++)printf("%d^%d*",prime[i].F,prime[i].S);if(siz) printf("%d^%d",prime[siz-1].F,prime[siz-1].S);}