結果
問題 |
No.8114 Prime Checker+1
|
ユーザー |
|
提出日時 | 2025-02-23 21:22:44 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 5,676 bytes |
コンパイル時間 | 5,686 ms |
コンパイル使用メモリ | 426,700 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2025-02-23 21:22:52 |
合計ジャッジ時間 | 7,157 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 30 |
コンパイルメッセージ
main.cpp:140:1: warning: ISO C++ forbids declaration of ‘main’ with no type [-Wreturn-type] 140 | main(){ | ^~~~
ソースコード
#ifdef syssys #define _GLIBCXX_DEBUG #endif #include <bits/stdc++.h> using namespace std; using uint = unsigned; using ull = unsigned long long; using ll = long long; using ld = long double; using lll = __int128; #define el '\n' #define all(x) begin(x), end(x) #define initv2(t,a,...) a, vector<t>(__VA_ARGS__) #define initv3(t,a,b,...) a, vector<vector<t>>(b, vector<t>(__VA_ARGS__)) #define pair(a,b) pair<a, b> #define vec vector #define elif else if #define pri_q priority_queue #ifndef syssys struct fast_io{fast_io(){ios::sync_with_stdio(0); cin.tie(0);}} _fast_io; #endif namespace Myb{ constexpr long long LLINF = 1ll<<62; constexpr int INF = 1<<30; template<typename T, typename U> istream& operator>>(istream& ist, pair<T, U>& p) {cin >> p.first >> p.second; return ist;} template<typename T> istream& operator>>(istream& ist, vector<T>& v) {for(T& i : v) cin >> i; return ist;} istream& operator>>(istream& ist, _Float128& x) {long double n; cin >> n; x = n; return ist;} void read_d_graph(vector<vector<pair<long long, int>>>& v, int m, int num = -1){ int a, b; long long c; for(int _ = 0; _ < m; _++){ cin >> a >> b >> c; a += num; b += num; v[a].emplace_back(c, b); } } void read_d_graph(vector<vector<int>>& v, int m, int num = -1){ int a, b; for(int _ = 0; _ < m; _++){ cin >> a >> b; a += num; b += num; v[a].emplace_back(b); } } void read_ud_graph(vector<vector<pair<long long, int>>>& v, int m, int num = -1){ int a, b; long long c; for(int _ = 0; _ < m; _++){ cin >> a >> b >> c; a += num; b += num; v[a].emplace_back(c, b); v[b].emplace_back(c, a); } } void read_ud_graph(vector<vector<int>>& v, int m, int num = -1){ int a, b; for(int _ = 0; _ < m; _++){ cin >> a >> b; a += num; b += num; v[a].emplace_back(b); v[b].emplace_back(a); } } template<typename T> void read_multi() {} template<typename T, typename... U> void read_multi(int n, vector<T>& v, U&&... args){ if(n < ssize(v)) {cin >> v[n]; read_multi(args..., n+1, v);} } template<typename T, typename... U> void read_multi(vector<T>& v, U&&... args) {read_multi(args..., 0, v);} string input() {string res; cin >> res; return res;} long long inputl() {long long res; cin >> res; return res;} template<typename T, typename U> ostream& operator<<(ostream& ost, const pair<T, U> p) {cerr << '{'; ost << p.first << ' ' << p.second; cerr << '}'; return ost;} template<typename T> ostream& operator<<(ostream& ost, const vector<T>& v) {for(int i = 0; i < ssize(v); i++) {ost << (i ? " " : "") << v[i];} return ost;} template<typename T> ostream& operator<<(ostream& ost, const vector<vector<T>>& v) {for(int i = 0; i < ssize(v); i++) {ost << (i ? "\n" : "") << v[i];} return ost;} long long add_each(long long n) {return n;} template<typename T, typename... U> void add_each(long long n, vector<T>& v, U&... args){ for(auto& i : v) i += n; add_each(n, args...); } template<typename T, typename U> inline bool chmin(T& a, U b) {if(a > b){a = b; return true;} return false;} template<typename T, typename U> inline bool chmax(T& a, U b) {if(a < b){a = b; return true;} return false;} template<typename T> inline T minv(const vector<T>& v) {return *min_element(v.begin(), v.end());} template<typename T> inline T maxv(const vector<T>& v) {return *max_element(v.begin(), v.end());} long long power(long long val, long long num, long long mod = 0){ assert(mod >= 0); assert(num >= 0); long long res = 1; if(mod){ val %= mod; while(num){ if(num&1) res = (res*val)%mod; val = (val*val)%mod; num >>= 1; } } else { while(num){ if(num&1) res = (res*val); val = (val*val); num >>= 1; } } return res; } long long comb(long long N, long long K, int mod = 0){ constexpr int COMBSIZ = 200000; assert(mod >= 0); if(N < K || K < 0) return 0; if(mod != 0){ assert(N <= COMBSIZ); static vector<long long> combf(COMBSIZ+9, -1); if(combf[0] == -1){ combf[0] = 1; for(long long i = 1; i <= COMBSIZ; i++) combf[i] = (combf[i-1]*i)%mod; } return (combf[N]*power((combf[N-K]*combf[K])%mod, mod-2, mod))%mod; } else { long long a=1, b=1; K = min(K, N-K); for(long long i = N; i > N-K; i--) a *= i; for(long long i = 2; i <= K; i++) b *= i; return a/b; } } } using namespace Myb; #if __has_include(<atcoder/modint>) #include <atcoder/modint> using namespace atcoder; using mint9 = modint998244353; using mint1 = modint1000000007; ostream& operator<<(ostream& ost, const mint1& x) {ost << x.val(); return ost;} ostream& operator<<(ostream& ost, const mint9& x) {ost << x.val(); return ost;} #endif /*vvv^vvvv^vvvvv^^^^^^^^^vv^^^^^^vvvvv^^^vvvvv^^^^^^^^vvvvvvvvv^^^^^^^vvvvvvvvv^^^vv^^^vvvvvvvv^^^^vvvvvv^^vvvvvv^^^^vvv^^^vvvvvvvv^^^vv^^^^^^^vvvvvvvvv^^^^^_^^vvvvvvvv^^^^^^^^vvvv^vvvvvvvvv^^^^^^^v*/ main(){ string s; cin >> s; if(s == "2") cout << "0\nYes\n"; else { if((s.back()-'0')%2 == 0) cout << "0\nNo\n"; else cout << "1\nNo\n"; } }