結果
問題 | No.1973 Divisor Sequence |
ユーザー | recososo |
提出日時 | 2022-10-08 16:18:23 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
CE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 6,226 bytes |
コンパイル時間 | 2,729 ms |
コンパイル使用メモリ | 237,732 KB |
最終ジャッジ日時 | 2024-04-27 05:11:38 |
合計ジャッジ時間 | 3,088 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。(リジャッジ後のコンパイルエラーは公開されます)
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
main.cpp: In instantiation of 'void OUT(Head&&, Tail&& ...) [with Head = atcoder::static_modint<1000000007>&; Tail = {}]': main.cpp:139:8: required from here main.cpp:79:80: error: no match for 'operator<<' (operand types are 'std::ostream' {aka 'std::basic_ostream<char>'} and 'atcoder::static_modint<1000000007>') 79 | template <class Head, class... Tail>void OUT(Head&& head, Tail&&... tail){cout << head;if(sizeof...(tail)) cout << " ";OUT(move(tail)...);} | ~~~~~^~~~~~~ In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/istream:39, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/sstream:38, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/complex:45, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ccomplex:39, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/x86_64-pc-linux-gnu/bits/stdc++.h:54, from main.cpp:3: /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ostream:108:7: note: candidate: 'std::basic_ostream<_CharT, _Traits>::__ostream_type& std::basic_ostream<_CharT, _Traits>::operator<<(__ostream_type& (*)(__ostream_type&)) [with _CharT = char; _Traits = std::char_traits<char>; __ostream_type = std::basic_ostream<char>]' 108 | operator<<(__ostream_type& (*__pf)(__ostream_type&)) | ^~~~~~~~ /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ostream:108:36: note: no known conversion for argument 1 from 'atcoder::static_modint<1000000007>' to 'std::basic_ostream<char>::__ostream_type& (*)(std::basic_ostream<char>::__ostream_type&)' {aka 'std::basic_ostream<char>& (*)(std::basic_ostream<char>&)'} 108 | operator<<(__ostream_type& (*__pf)(__ostream_type&)) | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ /home/linuxbr
ソースコード
#pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include<bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; #define REP(i, n) for (int i = 0; i < (n); ++i) #define REPR(i, n) for (int i = n - 1; i >= 0; --i) #define FOR(i, m, n) for (int i = m; i < n; ++i) #define FORR(i, m, n) for (int i = m; i >= n; --i) #define ALL(v) (v).begin(),(v).end() #define ALLR(v) (v).rbegin(),(v).rend() #define SORT(v) sort(ALL(v)) #define RSORT(v) sort(ALLR(v)) #define REV(v) reverse(ALL(v)) #define UNIQUE(x) SORT(x), x.erase(unique(ALL(x)), x.end()) #define fi first #define se second #define PB push_back #define EB emplace_back using pii = pair<int, int>; using pll = pair<ll, ll>; template <typename T> using vc = vector<T>; template <typename T> using vvc = vector<vc<T>>; template <typename T> using vvvc = vector<vvc<T>>; using vi = vc<int>; using vl = vc<ll>; using vpi = vc<pii>; using vpl = vc<pll>; // noimi #define INT(...) int __VA_ARGS__;IN(__VA_ARGS__) #define LL(...) ll __VA_ARGS__;IN(__VA_ARGS__) #define STR(...) string __VA_ARGS__;IN(__VA_ARGS__) #define DBL(...) double __VA_ARGS__;IN(__VA_ARGS__) #define VEC(type, name, size) vector<type> name(size);IN(name) #define VEC2(type, name1, name2, size) vector<type> name1(size), name2(size);for(int i = 0; i < size; i++) IN(name1[i], name2[i]) #define VEC3(type, name1, name2, name3, size) vector<type> name1(size), name2(size), name3(size);for(int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i]) #define VEC4(type, name1, name2, name3, name4, size) vector<type> name1(size), name2(size), name3(size), name4(size); for(int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i], name4[i]); #define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w));IN(name) int scan() { return getchar(); } void scan(int &a) { cin >> a; } void scan(long long &a) { cin >> a; } void scan(char &a) { cin >> a; } void scan(double &a) { cin >> a; } void scan(string &a) { cin >> a; } template <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); } template <class T> void scan(vector<T> &); template <class T> void scan(vector<T> &a) {for(auto &i : a) scan(i);} template <class T> void scan(T &a) { cin >> a; } void IN() {} template <class Head, class... Tail> void IN(Head &head, Tail &...tail) {scan(head);IN(tail...);} // tute7627 template<typename T> using PQ = priority_queue<T>; template<typename T> using QP = priority_queue<T,vector<T>,greater<T>>; template<typename T>void stout(const T &v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cout<<v[i][j]<<" \n"[j==w-1];}}; template<typename T>void stout(const T &v,ll n){for(ll i=0;i<n;i++)cout<<v[i]<<" \n"[i==n-1];}; template<typename T>void stout(const vector<T>&v){stout(v,v.size());} template<typename T>void stout(const vector<vector<T>>&v){for(auto &vv:v)stout(vv,vv.size());} template<typename T>void debug(const T &v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cerr<<v[i][j]<<" \n"[j==w-1];}}; template<typename T>void debug(const T &v,ll n){for(ll i=0;i<n;i++)cerr<<v[i]<<" \n"[i==n-1];}; template<typename T>void debug(const vector<T>&v){debug(v,v.size());} template<typename T>void debug(const vector<vector<T>>&v){for(auto &vv:v)debug(vv,vv.size());} template<typename T>void debug(stack<T> st){while(!st.empty()){cerr<<st.top()<<" ";st.pop();}cerr<<endl;} template<typename T>void debug(queue<T> st){while(!st.empty()){cerr<<st.front()<<" ";st.pop();}cerr<<endl;} template<typename T>void debug(deque<T> st){while(!st.empty()){cerr<<st.front()<<" ";st.pop_front();}cerr<<endl;} template<typename T>void debug(PQ<T> st){while(!st.empty()){cerr<<st.top()<<" ";st.pop();}cerr<<endl;} template<typename T>void debug(QP<T> st){while(!st.empty()){cerr<<st.top()<<" ";st.pop();}cerr<<endl;} template<typename T>void debug(const set<T>&v){for(auto z:v)cerr<<z<<" ";cerr<<endl;} template<typename T>void debug(const multiset<T>&v){for(auto z:v)cerr<<z<<" ";cerr<<endl;} template<typename T,size_t size>void debug(const array<T, size> &a){for(auto z:a)cerr<<z<<" ";cerr<<endl;} template<typename T,typename V>void debug(const map<T,V>&v){for(auto z:v)cerr<<"["<<z.first<<"]="<<z.second<<",";cerr<<endl;} int popcount(ll x){return __builtin_popcountll(x);}; int poplow(ll x){return __builtin_ctzll(x);}; int pophigh(ll x){return 63 - __builtin_clzll(x);}; void OUT() {cout << "\n";} template <class Head, class... Tail>void OUT(Head&& head, Tail&&... tail){cout << head;if(sizeof...(tail)) cout << " ";OUT(move(tail)...);} void ERR() {cerr << "\n";} template <class Head, class... Tail>void ERR(Head&& head, Tail&&... tail){cerr << head;if(sizeof...(tail)) cerr << " ";ERR(move(tail)...);} void fsp(int n){cout << fixed << setprecision(n);} 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; } const ll INF=1LL<<60; const int inf=(1<<30)-1; const int mod=998244353; // const int mod=1e9+7; int dx[8]={1,0,-1,0,-1,-1,1,1}; int dy[8]={0,1,0,-1,-1,1,-1,1}; #include<atcoder/all> using namespace atcoder; // using mint=modint998244353; using mint=modint1000000007; ostream &operator<<(ostream &os, const mint &p) {return os << p.val();} istream &operator>>(istream &is, mint &a) {int64_t t;is >> t;a = mint(t);return (is);} int main(){ cin.tie(0); ios::sync_with_stdio(false); LL(n,m); vc<mint> mem(40); vc<bool> b(40); auto f=[&](ll x)->mint{ if(b[x]) return mem[x]; vc<mint> dp(x+1); dp[0]=1; REP(i,n){ vc<mint> tp(x+2); REP(j,x+1){ tp[0]+=dp[j]; tp[x-j+1]-=dp[j]; } REP(j,x+1){ tp[j+1]+=tp[j]; dp[j]=tp[j]; } } mint res=0; REP(i,x+1) res+=dp[i]; // debug(dp); b[x]=true; return mem[x]=res; }; mint ans=1; ll mm=m; for(ll i=2;i*i<=m;i++){ if(mm%i!=0) continue; int cnt=0; while(mm%i==0){ cnt++; mm/=i; } if(cnt) ans*=f(cnt); // ERR(i,cnt,ans); } if(mm!=1) ans*=f(1); OUT(ans); }