結果

問題 No.1860 Magnets
ユーザー anmichianmichi
提出日時 2022-03-04 21:25:22
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 2,277 bytes
コンパイル時間 2,067 ms
コンパイル使用メモリ 198,792 KB
最終ジャッジ日時 2025-01-28 04:47:19
ジャッジサーバーID
(参考情報)
judge4 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 22 WA * 6
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
template <class T, class U>
inline bool chmax(T& a, U b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T, class U>
inline bool chmin(T& a, U b) {
if (a > b) {
a = b;
return true;
}
return false;
}
constexpr int INF = 1000000000;
constexpr ll llINF = 3000000000000000000;
constexpr int mod = 998244353;
const ll half = (mod + 1) / 2;
constexpr double eps = 1e-10;
vector<int> prime_list(int n) {
vector<int> v(n + 1), res;
for (int i = n; i >= 2; i--) {
for (int j = i; j <= n; j += i) v[j] = i;
}
for (int i = 2; i <= n; i++) {
if (v[i] == i) res.push_back(i);
}
return res;
}
vector<int> next_divisor(int n) {
vector<int> v(n + 1);
for (int i = n; i >= 2; i--) {
for (int j = i; j <= n; j += i) v[j] = i;
}
return v;
}
ll modpow(ll a, ll b, ll m = mod) {
ll res = 1;
while (b) {
if (b & 1) {
res *= a;
res %= m;
}
a *= a;
a %= m;
b >>= 1;
}
return res;
}
vector<ll> inv, fact, factinv;
void init_fact(int n) {
inv.resize(n + 1);
fact.resize(n + 1);
factinv.resize(n + 1);
inv[0] = 0;
inv[1] = 1;
fact[0] = 1;
factinv[0] = 1;
for (ll i = 1; i <= n; i++) {
if (i >= 2) inv[i] = mod - ((mod / i) * inv[mod % i] % mod);
fact[i] = (fact[i - 1] * i) % mod;
factinv[i] = factinv[i - 1] * inv[i] % mod;
}
}
ll modinv(ll a, ll m = mod) {
// gcd(a,m) must be 1
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
ll comb(int a, int b) {
if (a < b || a < 0 || b < 0) return 0;
return fact[a] * factinv[a - b] % mod * factinv[b] % mod;
}
void solve() {
int a, b;
cin >> a >> b;
if (a > b) swap(a, b);
// a<=b
cout << 2 * a + (b - a) * 2 - 1 << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
/*int t;
cin >> t;
while (t--)*/
solve();
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0