卬高杯
提出id | 提出時刻 | ユーザー名 | 問題 | 言語 | 判定状況 | 判定 | 実行時間 |
---|---|---|---|---|---|---|---|
114783 | 2023-10-24 08:06:36 | hiikunZ | E | cpp | 54/54 | AC | 9 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const ll MAX = 1e18;
int main(){
ll N;
cin >> N;
ll three = 0,nineteen = 0;
while(N % 3 == 0){
N /= 3;
three++;
}
while(N % 19 == 0){
N /= 19;
nineteen++;
}
vector<ll> A;
ll tmp = min(three,nineteen);
for(ll i = 0;i < tmp;i++) A.push_back(3 * 19);
three -= tmp;
nineteen -= tmp;
for(ll i = 0;i < three;i++) A.push_back(3);
for(ll i = 0;i < nineteen;i++) A.push_back(19);
for(ll i = 2;i * i <= N;i++){
while(N % i == 0){
N /= i;
A.push_back(i);
}
}
if(N != 1) A.push_back(N);
sort(A.begin(),A.end());
for(ll i = 0;i < A.size();i++){
cout << A[i];
if(i != A.size() - 1) cout << " ";
}
cout << endl;
}
sample1.txt AC 2 sample2.txt AC 3 sample3.txt AC 7 sample4.txt AC 7 case1.txt AC 7 case2.txt AC 7 case3.txt AC 7 case4.txt AC 7 case5.txt AC 7 case6.txt AC 7 case7.txt AC 7 case8.txt AC 7 case9.txt AC 7 case10.txt AC 7 case11.txt AC 7 case12.txt AC 7 case13.txt AC 7 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 8 case29.txt AC 7 case30.txt AC 7 case31.txt AC 8 case32.txt AC 8 case33.txt AC 8 case34.txt AC 8 case35.txt AC 8 case36.txt AC 8 case37.txt AC 8 case38.txt AC 8 case39.txt AC 8 case40.txt AC 8 case41.txt AC 8 case42.txt AC 8 case43.txt AC 8 case44.txt AC 8 case45.txt AC 8 case46.txt AC 8 case47.txt AC 8 case48.txt AC 8 case49.txt AC 9 case50.txt AC 8 9 AC9 AC