卬高杯
提出id | 提出時刻 | ユーザー名 | 問題 | 言語 | 判定状況 | 判定 | 実行時間 |
---|---|---|---|---|---|---|---|
114821 | 2023-10-24 08:31:41 | euommo | E | cpp | 54/54 | TLE | 2022 |
#include <bits/stdc++.h>
int main() {
std::cin.tie(0)->sync_with_stdio(0);
std::cin.exceptions(std::cin.failbit);
int64_t N;
std::cin >> N;
std::vector<int64_t> fs;
while (N % 57 == 0) {
fs.push_back(57);
N /= 57;
}
for (int64_t i = 1; i * i <= N; ++i) {
while (N % i == 0) {
fs.push_back(i);
N /= i;
}
}
if (N > 1) fs.push_back(N);
std::sort(fs.begin(), fs.end());
for (int i = 0; i < (int) fs.size(); ++i)
std::cout << fs[i] << " \n"[i + 1 == (int) fs.size()];
return 0;
}
sample1.txt TLE 2021 sample2.txt TLE 2021 sample3.txt TLE 2021 sample4.txt TLE 2021 case1.txt TLE 2021 case2.txt TLE 2021 case3.txt TLE 2021 case4.txt TLE 2021 case5.txt TLE 2021 case6.txt TLE 2021 case7.txt TLE 2021 case8.txt TLE 2021 case9.txt TLE 2021 case10.txt TLE 2021 case11.txt TLE 2021 case12.txt TLE 2021 case13.txt TLE 2021 case14.txt TLE 2021 case15.txt TLE 2021 case16.txt TLE 2021 case17.txt TLE 2021 case18.txt TLE 2021 case19.txt TLE 2021 case20.txt TLE 2021 case21.txt TLE 2021 case22.txt TLE 2021 case23.txt TLE 2021 case24.txt TLE 2021 case25.txt TLE 2021 case26.txt TLE 2021 case27.txt TLE 2021 case28.txt TLE 2021 case29.txt TLE 2021 case30.txt TLE 2021 case31.txt TLE 2021 case32.txt TLE 2021 case33.txt TLE 2021 case34.txt TLE 2021 case35.txt TLE 2021 case36.txt TLE 2021 case37.txt TLE 2021 case38.txt TLE 2021 case39.txt TLE 2021 case40.txt TLE 2022 case41.txt TLE 2021 case42.txt TLE 2021 case43.txt TLE 2021 case44.txt TLE 2021 case45.txt TLE 2021 case46.txt TLE 2021 case47.txt TLE 2021 case48.txt TLE 2021 case49.txt TLE 2021 case50.txt TLE 2021 2022 RE2022 TLE