結果
問題 | No.1058 素敵な数 |
ユーザー |
![]() |
提出日時 | 2020-05-22 21:53:02 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 1,517 bytes |
コンパイル時間 | 2,414 ms |
コンパイル使用メモリ | 197,792 KB |
最終ジャッジ日時 | 2025-01-10 14:40:13 |
ジャッジサーバーID (参考情報) |
judge5 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 9 |
コンパイルメッセージ
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 ‘void solve()’ at main.cpp:84:10: /usr/include/c++/13/ostream:204:25: warning: ‘x’ may be used uninitialized [-Wmaybe-uninitialized] 204 | { return _M_insert(__n); } | ~~~~~~~~~^~~~~ main.cpp: In function ‘void solve()’: main.cpp:78:12: note: ‘x’ was declared here 78 | ll x; | ^
ソースコード
#include<bits/stdc++.h>#define rep(i,a) for(int i=(int)0;i<(int)a;++i)#define rrep(i,a) for(int i=(int)a-1;i>=0;--i)#define REP(i,a,b) for(int i=(int)a;i<(int)b;++i)#define RREP(i,a,b) for(int i=(int)a-1;i>=b;--i)#define pb push_back#define eb emplace_back#define all(x) x.begin(),x.end()#define rall(x) x.rbegin(),x.rend()using ll=long long;constexpr ll mod = 1e9 + 7;constexpr ll INF = 1LL << 60;template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}ll gcd(ll n, ll m) {ll tmp;while (m!=0) {tmp = n % m;n = m;m = tmp;}return n;}ll lcm(ll n, ll m) {return abs(n) / gcd(n, m)*abs(m);//gl=xy}using namespace std;bool is_prime(int64_t x) {for(int64_t i = 2; i * i <= x; i++) {if(x % i == 0) return false;}return true;}void solve(){int n;cin>>n;if(n==1){cout << 1 << endl;return;}n--;priority_queue<ll, vector<ll>, greater<ll>> pq;vector<ll> v;for (ll i = 1e5 + 1;; ++i){if(is_prime(i)){v.pb(i);rep(j,v.size()){pq.emplace(i * v[j]);}if(pq.size()>=2*n){break;}}}ll x;rep(i, n){x = pq.top();pq.pop();}cout << x << endl;}int main(){ios::sync_with_stdio(false);cin.tie(0);cout<<fixed<<setprecision(15);solve();return 0;}