結果
問題 |
No.811 約数の個数の最大化
|
ユーザー |
![]() |
提出日時 | 2020-05-01 08:48:09 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 118 ms / 2,000 ms |
コード長 | 1,232 bytes |
コンパイル時間 | 3,746 ms |
コンパイル使用メモリ | 199,260 KB |
最終ジャッジ日時 | 2025-01-10 03:55:39 |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 12 |
コンパイルメッセージ
In file included from /usr/include/c++/13/istream:41, from /usr/include/c++/13/sstream:40, from /usr/include/c++/13/complex:45, from /usr/include/c++/13/ccomplex:39, from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:127, from main.cpp:1: In member function ‘std::basic_ostream<_CharT, _Traits>::__ostream_type& std::basic_ostream<_CharT, _Traits>::operator<<(long long int) [with _CharT = char; _Traits = std::char_traits<char>]’, inlined from ‘int main()’ at main.cpp:47:11: /usr/include/c++/13/ostream:204:25: warning: ‘ans’ may be used uninitialized [-Wmaybe-uninitialized] 204 | { return _M_insert(__n); } | ~~~~~~~~~^~~~~ main.cpp: In function ‘int main()’: main.cpp:34:8: note: ‘ans’ was declared here 34 | ll ans,cnt=0; | ^~~
ソースコード
#include<bits/stdc++.h> using namespace std; #define ALL(x) x.begin(),x.end() #define rep(i,n) for(int i=0;i<(n);i++) #define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl; #define INF 1000000000 #define mod 1000000007 using ll=long long; const ll LINF=1001002003004005006ll; int dx[]={1,0,-1,0}; int dy[]={0,1,0,-1}; // ll gcd(ll a,ll b){return b?gcd(b,a%b):a;} template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;} template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;} map<ll, int> PrimeFactor(ll n){ map<ll,int> ret; for(ll i=2;i*i<=n;i++){ while(n%i==0){ ret[i]++; n/=i; } } if(n!=1) ret[n]=1; return ret; } signed main(){ cin.tie(0); ios::sync_with_stdio(0); ll n,k;cin>>n>>k; auto pfn=PrimeFactor(n); ll ans,cnt=0; for(ll i=1;i<n;i++){ auto mp=PrimeFactor(i); ll t=0; for(auto p:mp){ if(pfn.count(p.first)) t+=min(p.second,pfn[p.first]); } if(t>=k){ ll x=1; for(auto p:mp) x*=(p.second+1ll); if(chmax(cnt,x)) ans=i; } } cout<<ans<<endl; return 0; }