卬高杯
提出id | 提出時刻 | ユーザー名 | 問題 | 言語 | 判定状況 | 判定 | 実行時間 |
---|---|---|---|---|---|---|---|
115030 | 2023-10-26 06:10:57 | momoyuu | E | cpp | 54/54 | AC | 32 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
ll n;
cin>>n;
vector<pair<ll,ll>> use;
ll res = n;
for(ll i = 2;i*i<=n;i++){
if(res%i!=0) continue;
int cnt = 0;
while(res%i==0){
cnt++;
res /= i;
}
use.push_back(make_pair(i,cnt));
}
if(res!=1) use.push_back(make_pair(res,1));
int a = 0;
int b = 0;
vector<pair<ll,ll>> ans;
for(int i = 0;i<use.size();i++) {
if(use[i].first==3) a = use[i].second;
else if(use[i].first==19) b = use[i].second;
else ans.push_back(use[i]);
}
int can = min(a,b);
if(can>0) ans.push_back(make_pair(57,can));
if(a-can>0) ans.push_back(make_pair(3,a-can));
if(b-can>0) ans.push_back(make_pair(19,b-can));
sort(ans.begin(),ans.end());
int time = 0;
for(int i = 0;i<ans.size();i++){
for(int j = 0;j<ans[i].second;j++){
if(time++) cout<<" ";
cout<<ans[i].first;
}
}
cout<<endl;
}
sample1.txt AC 2 sample2.txt AC 2 sample3.txt AC 3 sample4.txt AC 6 case1.txt AC 6 case2.txt AC 6 case3.txt AC 6 case4.txt AC 7 case5.txt AC 7 case6.txt AC 7 case7.txt AC 6 case8.txt AC 6 case9.txt AC 6 case10.txt AC 6 case11.txt AC 6 case12.txt AC 6 case13.txt AC 6 case14.txt AC 7 case15.txt AC 7 case16.txt AC 7 case17.txt AC 7 case18.txt AC 7 case19.txt AC 7 case20.txt AC 7 case21.txt AC 7 case22.txt AC 7 case23.txt AC 7 case24.txt AC 7 case25.txt AC 7 case26.txt AC 7 case27.txt AC 7 case28.txt AC 7 case29.txt AC 7 case30.txt AC 7 case31.txt AC 7 case32.txt AC 7 case33.txt AC 7 case34.txt AC 7 case35.txt AC 7 case36.txt AC 7 case37.txt AC 7 case38.txt AC 7 case39.txt AC 7 case40.txt AC 7 case41.txt AC 7 case42.txt AC 7 case43.txt AC 7 case44.txt AC 7 case45.txt AC 7 case46.txt AC 13 case47.txt AC 29 case48.txt AC 32 case49.txt AC 5 case50.txt AC 11 32 AC32 AC