207

来源:互联网 发布:二叉树的遍历 java 编辑:程序博客网 时间:2024/05/22 16:13
#include<iostream>#include<vector>#include<string>#include<map>#include<cmath>using namespace std;int main(){freopen("in.txt","r",stdin);long int n;cin>>n;cout<<n<<"=";if(n==1){cout<<1<<endl;return 0;}map<int,int> htable;while(n!=1){for(int i=2;i<=n;i++){if(n%i==0){htable[i]++;n=n/i;break;}}}for(map<int,int>::iterator itr=htable.begin();itr!=htable.end();++itr){if(itr!=htable.begin()){cout<<"*";}if(itr->second==1){cout<<itr->first;}else{cout<<itr->first<<"^"<<itr->second;}}}

0 0
原创粉丝点击