提出詳細

提出id	提出時刻	ユーザー名	問題	言語	判定状況	判定	実行時間
114844	2023-10-24 08:51:11	Fysty	E	cpp	54/54	AC	8

#include <bits/stdc++.h>
#include <random>
#include <chrono>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<double,double> pdd;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

template<typename T> void _do(T x){cerr<<x<<"\n";}
template<typename T,typename ...U> void _do(T x,U ...y){cerr<<x<<", ";_do(y...);}
#define dbg(...) cerr<<#__VA_ARGS__<<" = ";_do(__VA_ARGS__);

const int MOD1=1e9+7;
const int MOD2=998244353;
const ll INF=3e18;

ll fpow(ll a,ll b,ll m)
{
    if(!b) return 1;
    ll tmp=1;
    for(ll cur=a;b;b>>=1,cur=cur*cur%m) if(b&1) tmp=tmp*cur%m;
    return tmp;
}
ll inv(ll a,ll m) {return fpow(a,m-2,m);}

#define MottoHayaku ios::sync_with_stdio(false);cin.tie(0);
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define F first
#define S second
#define pb push_back
#define uni(c) c.resize(distance(c.begin(),unique(c.begin(),c.end())))
#define unisort(c) sort(c.begin(),c.end()),uni(c)


void solve()
{
    ll n;
    cin>>n;
    vector<ll> ans;
    while(n%57==0)
    {
        n/=57;
        ans.pb(57);
    }
    for(ll i=2;i<=sqrt(n);i++)
    {
        if(n%i==0)
        {
            while(n%i==0)
            {
                ans.pb(i);
                n/=i;
            }
        }
    }
    if(n>1) ans.pb(n);
    sort(ans.begin(),ans.end());
    rep(i,ans.size()) cout<<ans[i]<<" \n"[i+1==ans.size()];
}

signed main()
{
    MottoHayaku
    int t;
    //cin>>t;
    t=1;
    while(t--)
    {
        solve();
    }
}

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 6
case5.txt AC 6
case6.txt AC 6
case7.txt AC 7
case8.txt AC 7
case9.txt AC 7
case10.txt AC 6
case11.txt AC 6
case12.txt AC 6
case13.txt AC 6
case14.txt AC 6
case15.txt AC 6
case16.txt AC 6
case17.txt AC 6
case18.txt AC 6
case19.txt AC 6
case20.txt AC 6
case21.txt AC 6
case22.txt AC 6
case23.txt AC 6
case24.txt AC 6
case25.txt AC 6
case26.txt AC 6
case27.txt AC 6
case28.txt AC 6
case29.txt AC 6
case30.txt AC 6
case31.txt AC 6
case32.txt AC 6
case33.txt AC 6
case34.txt AC 6
case35.txt AC 6
case36.txt AC 6
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 6
case49.txt AC 8
case50.txt AC 7
8 AC8 AC