提出詳細

提出id	提出時刻	ユーザー名	問題	言語	判定状況	判定	実行時間
114731	2023-10-24 07:18:12	Eug1ena	E	cpp	54/54	AC	8

//#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
constexpr lint mod = 1e9 + 7;
#define all(x) begin(x), end(x)
#define bitcount(n) __builtin_popcountll((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzll(x))
#define rep(i, n) for(int i = 0; i < int(n); i++)
#define rep2(i, l, r) for(int i = int(l); i < int(r); i++)
#define repr(i, n) for(int i = int(n) - 1; i >= 0; i--)
#define repr2(i, l, r) for(int i = int(r) - 1; i >= int(l); i--)
#define accumulate you cannot use this word!
constexpr int inf9 = 1e9; constexpr lint inf18 = 1e18;
inline void Yes(bool condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class itr> void array_output(itr start, itr goal){ for(auto i = start; i != goal; i++) cout << (i == start ? "" : " ") << (*i); cout << endl; }
template<class itr> void cins(itr first, itr last){ for(auto i = first; i != last; i++){ cin >> (*i); } }
template<class T> T gcd(T a, T b){ if(b) return gcd(b, a % b); else return a; }
template<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; }
template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b){ if(b < a){ a = b; return 1; } return 0; }
inline int has(lint i, int j){ return (i >> j) & 1; }
int dy[4] = {1, 0, -1, 0}; int dx[4] = {0, 1, 0, -1};
bool is_inside(lint y, lint x, lint H, lint W){ return (0 <= y && y < H && 0 <= x && x < W); }

struct io_init {
    io_init() {
        cin.tie(nullptr); cout.tie(nullptr);
        std::ios::sync_with_stdio(false);
    }
} io_init;

int main(){
    lint n;
    cin >> n;
    vector<lint> facts;
    while(n % 57 == 0){
        facts.push_back(57);
        n /= 57;
    }
    
    for(lint i = 2; i * i <= n; ){
        if(n % i == 0){
            facts.push_back(i);
            n /= i;
        }else{
            i++;
        }
    }
    
    if(n > 1){
        facts.push_back(n);
    }
    
    sort(all(facts));
    array_output(all(facts));
}

sample1.txt AC 2
sample2.txt AC 2
sample3.txt AC 3
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 6
case20.txt AC 6
case21.txt AC 7
case22.txt AC 6
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 7
case47.txt AC 7
case48.txt AC 7
case49.txt AC 8
case50.txt AC 7
8 AC8 AC