提出詳細

提出id	提出時刻	ユーザー名	問題	言語	判定状況	判定	実行時間
114818	2023-10-24 08:28:57	TKTYI	E	cpp	54/54	AC	7

#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vvvi> vvvvi;
typedef pair<ll,ll> pi;
typedef pair<ll,pi> ppi;
typedef pair<ll,ppi> pppi;
typedef pair<ll,pppi> ppppi;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) (UB(A,x)-LB(A,x))
#define sz(c) ((ll)(c).size())
/*
#include<boost/multiprecision/cpp_int.hpp>
namespace mp=boost::multiprecision;
using Bint=mp::cpp_int;
*/
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>&v){REP(i,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
ld dist(ld x1,ld y1,ld x2,ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}
const ll mod=998244353;
const ld EPS=1e-8;
/*
const ll mod=1000000007;
//*/
int main(){
  ll N;cin>>N;
  vi ans;
  while(N%57==0){N/=57;ans.emplace_back(57);}
  ll d=2;
  while(d*d<=N){
    while(N%d==0){N/=d;ans.emplace_back(d);}
    d++;
  }
  if(N>1)ans.emplace_back(N);
  sort(ALL(ans));
  cout<<ans<<endl;
  return 0;
}

sample1.txt AC 2
sample2.txt AC 2
sample3.txt AC 2
sample4.txt AC 3
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 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 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 6
case38.txt AC 6
case39.txt AC 6
case40.txt AC 6
case41.txt AC 6
case42.txt AC 6
case43.txt AC 6
case44.txt AC 6
case45.txt AC 6
case46.txt AC 6
case47.txt AC 6
case48.txt AC 6
case49.txt AC 7
case50.txt AC 6
7 AC7 AC