結果
問題 | No.1699 Unfair RPS |
ユーザー |
|
提出日時 | 2021-10-08 21:51:21 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 3,687 bytes |
コンパイル時間 | 3,856 ms |
コンパイル使用メモリ | 233,564 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-07-23 03:53:16 |
合計ジャッジ時間 | 4,412 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 9 |
ソースコード
/*#include <iostream> // cout, endl, cin#include <string> // string, to_string, stoi#include <vector> // vector#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound#include <utility> // pair, make_pair#include <tuple> // tuple, make_tuple#include <cstdint> // int64_t, int*_t#include <cstdio> // printf#include <map> // map#include <queue> // queue, priority_queue#include <set> // set#include <stack> // stack#include <deque> // deque#include <unordered_map> // unordered_map#include <unordered_set> // unordered_set#include <bitset> // bitset#include <cctype> // isupper, islower, isdigit, toupper, tolower#include <iomanip>//fixed,setprecision#include <limits.n>//INT_MAX#include <math.n>//M_PI#include <random>#include <regex> // 正規表現#include <time.h>*/#include <bits/stdc++.h>using namespace std;#include <atcoder/all>using namespace atcoder;//using mint = modint1000000007;using mint = modint998244353;//std::chrono::time_point<std::chrono::steady_clock> start;template <typename T> bool chmax(T &u, const T z) { if (u < z) {u = z; return true;} else return false; }template <typename T> bool chmin(T &u, const T z) { if (u > z) {u = z; return true;} else return false; }#define ll long long#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)typedef pair<int, int> P;using vi=vector<int>;using vvi=vector<vi>;ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }ll lcm(ll a, ll b){return a * b / gcd(a, b);}template<class T, class U>//contain(string s,string v) sにvが含まれるかを判定bool contain(const std::basic_string<T>& s, const U& v) {return s.find(v) != std::basic_string<T>::npos;}//const int mod=1000000007;const int mod=998244353;struct combination {vector<mint> fact, ifact;combination(int n):fact(n+1),ifact(n+1) {assert(n < mod);fact[0] = 1;for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;ifact[n] = fact[n].inv();for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;}mint operator()(int n, int k) {if (k < 0 || k > n) return 0;return fact[n]*ifact[k]*ifact[n-k];}}c(205);//エラトステネスの篩(素因数分解の高速化)struct Sieve {int n;vector<int> f, primes;Sieve(int n=1):n(n), f(n+1) {f[0] = f[1] = -1;for (ll i = 2; i <= n; ++i) {if (f[i]) continue;primes.push_back(i);f[i] = i;for (ll j = i*i; j <= n; j += i) {if (!f[j]) f[j] = i;}}}bool isPrime(int x) { return f[x] == x;}vector<int> factorList(int x) {vector<int> res;while (x != 1) {res.push_back(f[x]);x /= f[x];}return res;}vector<P> factor(int x) {vector<int> fl = factorList(x);if (fl.size() == 0) return {};vector<P> res(1, P(fl[0], 0));for (int p : fl) {if (res.back().first == p) {res.back().second++;} else {res.emplace_back(p, 1);}}return res;}};struct Matrix {long long p[3][3] = { {0, 0,0}, {0, 0,0} , {0, 0,0}};};Matrix Multiplication(Matrix A, Matrix B) {Matrix C;for (int i = 0; i < 3; i++) {for (int k = 0; k < 3; k++) {for (int j = 0; j < 3; j++) {C.p[i][j] += A.p[i][k] * B.p[k][j];C.p[i][j] %= 1000000007;}}}return C;}Matrix Power(Matrix A, long long n) {Matrix P = A, Q; bool flag = false;for (int i = 0; i < 60; i++) {if ((n & (1LL << i)) != 0LL) {if (flag == false) { Q = P; flag = true; }else { Q = Multiplication(Q, P); }}P = Multiplication(P, P);}return Q;}int main(){int b,c;cin>>b>>c;if(b!=c)cout<<"No"<<endl;else cout<<"Yes"<<endl;return 0;}