problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k โ | fixed_code stringlengths 12 526k โ | labels listlengths 0 15 โ | buggy_submission_id int64 1 1.54M โ | fixed_submission_id int64 2 1.54M โ | user_id stringlengths 10 10 โ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p03071 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << max(A, B), max(max(A, B) - 1, min(A, B));
return 0;
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << max(A, B) + max(max(A, B) - 1, min(A, B));
return 0;
} | [
"io.output.change"
] | 880,533 | 880,534 | u921628708 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << max((max(a, b) << 1 - 1), a + b) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << max((2 * max(a, b)) - 1, a + b) << endl;
return 0;
} | [
"io.output.change",
"call.arguments.change"
] | 880,537 | 880,538 | u679682246 | cpp |
p03071 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b;
if (b > a) {
cout << b + b - 1;
} else if (a == b) {
cout << 2 * a;
} else if (a < b) {
cout << a + a - 1;
}
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b > a) {
cout << b + b - 1;
} else if (a == b) {
cout << 2 * a;
} else if (a > b) {
cout << a + a - 1;
}
} | [
"variable_declaration.remove",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 880,541 | 880,542 | u860150008 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int a, b, ans = 0;
cin >> a >> b;
for (int i = 0; i < 2; i++) {
if (a >= b) {
ans += a;
a--;
}
if (b > a) {
ans += b;
b--;
}
}
cout << ans;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, ans = 0;
cin >> a >> b;
for (int i = 0; i < 2; i++) {
if (a >= b) {
ans += a;
a--;
} else if (b > a) {
ans += b;
b--;
}
}
cout << ans;
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 880,545 | 880,546 | u713574885 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int a, b, ans = 0;
cin >> a >> b;
for (int i = 0; i < 2; i++) {
if (a > b) {
ans += a;
a--;
}
if (b > a) {
ans += b;
b--;
}
}
cout << ans;
} | #include <iostream>
using namespace std;
int main() {
int a, b, ans = 0;
cin >> a >> b;
for (int i = 0; i < 2; i++) {
if (a >= b) {
ans += a;
a--;
} else if (b > a) {
ans += b;
b--;
}
}
cout << ans;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 880,547 | 880,546 | u713574885 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
signed main() {
int A, B;
scanf("%d%d", &A, &B);
printf("%d\n", (A == B) ? (A + B) : (max(A, B) - 1));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
signed main() {
int A, B;
scanf("%d%d", &A, &B);
printf("%d\n", (A == B) ? (A + B) : (2 * max(A, B) - 1));
return 0;
} | [
"expression.operation.binary.add"
] | 880,548 | 880,549 | u208608367 | cpp |
p03071 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define irep(it, stl) for (auto it = stl.begin(); it != stl.end(); it++)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define mes(a) cout << (a) << endl
#define dmes(a, b) cout << (a) << " " << (b) << endl
#define re0 return 0
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define rSort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
#define itn int
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
struct io {
io() {
ios::sync_with_stdio(false);
cin.tie(0);
}
};
const int INF = INT_MAX;
const ll LLINF = 1LL << 60;
const ll MOD = 1000000007;
const double EPS = 1e-19;
signed main() {
ll a, b;
cin >> a >> b;
ll r = 0;
r += max(a, b);
if (r == a)
a--;
if (r == b)
b--;
r += max(a, b);
mes(r);
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define irep(it, stl) for (auto it = stl.begin(); it != stl.end(); it++)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define mes(a) cout << (a) << endl
#define dmes(a, b) cout << (a) << " " << (b) << endl
#define re0 return 0
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define rSort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
#define itn int
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
struct io {
io() {
ios::sync_with_stdio(false);
cin.tie(0);
}
};
const int INF = INT_MAX;
const ll LLINF = 1LL << 60;
const ll MOD = 1000000007;
const double EPS = 1e-19;
signed main() {
ll a, b;
cin >> a >> b;
ll r = 0;
r += max(a, b);
if (r == a)
a--;
else if (r == b)
b--;
r += max(a, b);
mes(r);
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 880,550 | 880,551 | u038537254 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A, B;
int X = max(A, B);
int Y = min(A, B);
int ans = X;
int M = max(X - 1, Y);
ans += M;
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int X = max(A, B);
int Y = min(A, B);
int ans = X;
int M = max(X - 1, Y);
ans += M;
cout << ans;
}
| [] | 880,552 | 880,553 | u025773431 | cpp |
p03071 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const int mod = 1000000007;
class mint {
long long x;
public:
mint(long long x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint &a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint &a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint &a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint &a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint &a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint &a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint &a) { return (*this) *= a.inv(); }
mint operator/(const mint &a) const {
mint res(*this);
return res /= a;
}
friend ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
};
int ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
ll gcd(ll a, ll b) {
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); };
// fixed << setprecision(2)
//ๅฐๆๅญ=ๅคงๆๅญ+32
int main() {
int a, b;
cin >> a >> b;
int ans = 0;
if (a > b) {
ans += a;
a--;
} else {
ans += b;
}
if (a > b) {
ans += a;
a--;
} else {
ans += b;
}
cout << ans;
}
| #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const int mod = 1000000007;
class mint {
long long x;
public:
mint(long long x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint &a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint &a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint &a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint &a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint &a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint &a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint &a) { return (*this) *= a.inv(); }
mint operator/(const mint &a) const {
mint res(*this);
return res /= a;
}
friend ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
};
int ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
ll gcd(ll a, ll b) {
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); };
// fixed << setprecision(2)
//ๅฐๆๅญ=ๅคงๆๅญ+32
int main() {
int a, b;
cin >> a >> b;
int ans = 0;
if (a > b) {
ans += a;
a--;
} else {
ans += b;
b--;
}
if (a > b) {
ans += a;
a--;
} else {
ans += b;
}
cout << ans;
}
| [
"expression.unary.arithmetic.add"
] | 880,554 | 880,555 | u272628953 | cpp |
p03071 | //---------------------------------------------------------------
#include <bits/stdc++.h>
using namespace std;
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <numeric>
#include <sstream>
#include <vector>
//---------------------------------------------------------------
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define SIZE 100005
#define INF 1000000000000000LL
#define all(x) x.begin(), x.end()
#define fi first
#define se second
using pint = pair<int, int>;
using vec = vector<int>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
//---------------------------------------------------------------
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;
}
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
//---------------------------------------------------------------
//โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int a, b;
cin >> a >> b;
int ans = 0;
ans = max(a * 2 - 1, max(b * 2 - 1, a + b - 1));
cout << ans << endl;
} | //---------------------------------------------------------------
#include <bits/stdc++.h>
using namespace std;
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <numeric>
#include <sstream>
#include <vector>
//---------------------------------------------------------------
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define SIZE 100005
#define INF 1000000000000000LL
#define all(x) x.begin(), x.end()
#define fi first
#define se second
using pint = pair<int, int>;
using vec = vector<int>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
//---------------------------------------------------------------
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;
}
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
//---------------------------------------------------------------
//โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int a, b;
cin >> a >> b;
int ans = 0;
ans = max(a * 2 - 1, max(b * 2 - 1, a + b));
cout << ans << endl;
} | [
"expression.operation.binary.remove"
] | 880,556 | 880,557 | u825601908 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set tree<int, null_type,less<int>,
// rb_tree_tag,tree_order_statistics_node_update>
#define FS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long int
#define ld long double
#define pb push_back
#define bp __builtin_popcount
#define sz size()
#define ff first
#define ss second
#define vll vector<ll>
#define vbool vector<bool>
#define vpll vector<pair<ll, ll>>
#define pll pair<ll, ll>
#define vllv vector<vector<ll>>
#define setpri(x) cout << setprecision(x) << fixed;
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define yesr \
{ \
cout << "YES" << endl; \
return; \
}
#define nor \
{ \
cout << "NO" << endl; \
return; \
}
// getline (std::cin,name);
ll MOD = 1e9 + 7;
ll ceil1(ll n, ll x) { return (n - 1) / x + (n > 0); }
ll gcd(ll a, ll b) { return __gcd(a, b); }
ll lcm(ll a, ll b) { return (max(a, b) / gcd(a, b)) * min(a, b); }
ll pow1(ll n, ll m, ll mod = MOD);
ll pow2(ll n, ll k);
ll modinv(ll n, ll mod = MOD) { return pow1(n, mod - 2, mod); }
bool func(pair<ll, ll> &a, pair<ll, ll> &b) {
if (a.ff != b.ff)
return a.ff < b.ff;
return a.ss > b.ss;
}
ll const N = (ll)2e5 + 11;
ll const LG = (ll)log2(N) + 1;
void solve() {
ll i, j, k, l, n, m, x, y, z, r;
cin >> n >> m;
ll ans = max({n, n - 1, m, m - 1, n + m});
cout << ans << endl;
}
int main() {
FS;
ll i, j, k, n, m, x, y, z, q;
q = 1;
// cin>>q;
for (ll tc = 1; tc <= q; tc++) {
// cout<<"Case #"<<tc<<": ";
solve();
}
return 0;
}
ll pow1(ll n, ll m, ll mod) {
if (m == 0)
return 1;
if (m % 2 == 0)
return pow1((n * n) % mod, m / 2, mod);
return (pow1((n * n) % mod, m / 2, mod) * n) % mod;
}
ll pow2(ll n, ll k) {
ll ans = 1;
while (k > 0) {
if (k % 2 == 1)
ans = ans * n;
n = n * n;
k /= 2;
}
return ans;
}
| #include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set tree<int, null_type,less<int>,
// rb_tree_tag,tree_order_statistics_node_update>
#define FS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long int
#define ld long double
#define pb push_back
#define bp __builtin_popcount
#define sz size()
#define ff first
#define ss second
#define vll vector<ll>
#define vbool vector<bool>
#define vpll vector<pair<ll, ll>>
#define pll pair<ll, ll>
#define vllv vector<vector<ll>>
#define setpri(x) cout << setprecision(x) << fixed;
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define yesr \
{ \
cout << "YES" << endl; \
return; \
}
#define nor \
{ \
cout << "NO" << endl; \
return; \
}
// getline (std::cin,name);
ll MOD = 1e9 + 7;
ll ceil1(ll n, ll x) { return (n - 1) / x + (n > 0); }
ll gcd(ll a, ll b) { return __gcd(a, b); }
ll lcm(ll a, ll b) { return (max(a, b) / gcd(a, b)) * min(a, b); }
ll pow1(ll n, ll m, ll mod = MOD);
ll pow2(ll n, ll k);
ll modinv(ll n, ll mod = MOD) { return pow1(n, mod - 2, mod); }
bool func(pair<ll, ll> &a, pair<ll, ll> &b) {
if (a.ff != b.ff)
return a.ff < b.ff;
return a.ss > b.ss;
}
ll const N = (ll)2e5 + 11;
ll const LG = (ll)log2(N) + 1;
void solve() {
ll i, j, k, l, n, m, x, y, z, r;
cin >> n >> m;
ll ans = max({n + n - 1, m + m - 1, n + m});
cout << ans << endl;
}
int main() {
FS;
ll i, j, k, n, m, x, y, z, q;
q = 1;
// cin>>q;
for (ll tc = 1; tc <= q; tc++) {
// cout<<"Case #"<<tc<<": ";
solve();
}
return 0;
}
ll pow1(ll n, ll m, ll mod) {
if (m == 0)
return 1;
if (m % 2 == 0)
return pow1((n * n) % mod, m / 2, mod);
return (pow1((n * n) % mod, m / 2, mod) * n) % mod;
}
ll pow2(ll n, ll k) {
ll ans = 1;
while (k > 0) {
if (k % 2 == 1)
ans = ans * n;
n = n * n;
k /= 2;
}
return ans;
}
| [
"call.arguments.change"
] | 880,577 | 880,578 | u293991054 | cpp |
p03071 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A < B)
swap(A, B);
int ans = max(A + A + 1, A + B);
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A < B)
swap(A, B);
int ans = max(A + A - 1, A + B);
cout << ans << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 880,594 | 880,595 | u618263300 | cpp |
p03071 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == B) {
cout << A + B << endl;
} else {
if (A >= B - 1) {
cout << 2 * A - 1 << endl;
} else {
cout << 2 * B - 1 << endl;
}
}
} | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == B) {
cout << A + B << endl;
} else {
if (A > B) {
cout << 2 * A - 1 << endl;
} else {
cout << 2 * B - 1 << endl;
}
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 880,598 | 880,599 | u158677249 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define cvector vector<char>
#define svector vector<string>
#define lque queue<ll>
#define lpque priority_queue<ll>
#define dlpque priority_queue<ll, lvector, greater<ll>>
#define P pair<ll, ll>
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define print(a) cout << (a) << endl
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll a, b;
cin >> a >> b;
print(min({a + b, a + a - 1ll, b + b - 1ll}));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define cvector vector<char>
#define svector vector<string>
#define lque queue<ll>
#define lpque priority_queue<ll>
#define dlpque priority_queue<ll, lvector, greater<ll>>
#define P pair<ll, ll>
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define print(a) cout << (a) << endl
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll a, b;
cin >> a >> b;
print(max({a + b, a + a - 1ll, b + b - 1ll}));
return 0;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"io.output.change"
] | 880,608 | 880,609 | u894339989 | cpp |
p03071 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main(void) {
int a, b;
cin >> a >> b;
if (a - 1 >= b)
cout << a * a - a << endl;
else if (a == b)
cout << a + b << endl;
else
cout << b * b - b << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main(void) {
int a, b;
cin >> a >> b;
if (a - 1 >= b)
cout << 2 * a - 1 << endl;
else if (a == b)
cout << a + b << endl;
else
cout << 2 * b - 1 << endl;
return 0;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 880,615 | 880,616 | u917518913 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (max(a, b) - min(a, b) < 2) {
cout << 2 * max(a, b) - 1 << endl;
} else {
cout << a + b << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (max(a, b) - min(a, b) >= 2) {
cout << 2 * max(a, b) - 1 << endl;
} else {
cout << a + b << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 880,617 | 880,618 | u637669066 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a, b;
cin >> a >> b;
if (a > b) {
cout << 2 * a - 1 << endl;
} else if (a > b) {
cout << 2 * b - 1 << endl;
} else {
cout << 2 * a << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a, b;
cin >> a >> b;
if (a > b) {
cout << 2 * a - 1 << endl;
} else if (a < b) {
cout << 2 * b - 1 << endl;
} else {
cout << 2 * a << endl;
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 880,633 | 880,634 | u680574634 | cpp |
p03071 | // testcode.cpp
#include <iostream>
#include <utility>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
if (a < b) {
swap(a, b);
}
if (a == b) {
c == 2 * a;
}
else {
c == 2 * a - 1;
}
cout << c << endl;
} | // testcode.cpp
#include <iostream>
#include <utility>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
if (a < b) {
swap(a, b);
}
if (a == b) {
c = 2 * a;
}
else {
c = 2 * a - 1;
}
cout << c;
} | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo",
"expression.operation.binary.remove"
] | 880,641 | 880,642 | u928108659 | cpp |
p03071 | // testcode.cpp
#include <iostream>
#include <utility>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
if (a < b) {
swap(a, b);
}
if (a == b) {
c == 2 * a;
}
else {
c == 2 * a - 1;
}
cout << c;
} | // testcode.cpp
#include <iostream>
#include <utility>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
if (a < b) {
swap(a, b);
}
if (a == b) {
c = 2 * a;
}
else {
c = 2 * a - 1;
}
cout << c;
} | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 880,643 | 880,642 | u928108659 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == B) {
cout << A * B << endl;
} else {
cout << max(A, B) + (max(A, B) - 1) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == B) {
cout << A + B << endl;
} else {
cout << max(A, B) + (max(A, B) - 1) << endl;
}
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 880,650 | 880,651 | u164730704 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == B) {
cout << A * B << endl;
} else {
cout << max(A, B) * (max(A, B) - 1) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == B) {
cout << A + B << endl;
} else {
cout << max(A, B) + (max(A, B) - 1) << endl;
}
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 880,652 | 880,651 | u164730704 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int Max = max(A, B);
if (A = B)
cout << 2 * Max << endl;
else
cout << 2 * Max - 1 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int Max = max(A, B);
if (A == B)
cout << 2 * Max << endl;
else
cout << 2 * Max - 1 << endl;
return 0;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 880,660 | 880,661 | u101018317 | cpp |
p03071 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int a, b;
cin >> a >> b;
int ans;
if (abs(a - b) >= 2) {
ans = 2 * max(a, b) - 1;
} else
ans = a + b - 1;
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int a, b;
cin >> a >> b;
int ans;
if (abs(a - b) >= 2) {
ans = 2 * max(a, b) - 1;
} else
ans = a + b;
cout << ans << endl;
} | [
"expression.operation.binary.remove"
] | 880,662 | 880,663 | u937618939 | cpp |
p03071 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int s = max(a, b);
cout << max(a, b) + max(s, min(a, b)) << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int s = max(a, b) - 1;
cout << max(a, b) + max(s, min(a, b)) << endl;
} | [
"assignment.change"
] | 880,664 | 880,665 | u206390098 | cpp |
p03071 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <new>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
typedef long long ll;
typedef long double ld;
using namespace std;
using Graph = vector<vector<ll>>;
#define rep(i, N) for (ll i = 0; i < (ll)(N); ++i)
#define ALL(a) (a).begin(), (a).end()
const ll inf = 1e18 + 7;
const ll mod = 1e9 + 7;
ll GetDigit(ll num) {
unsigned digit = 0;
while (num != 0) {
num /= 10;
digit++;
}
return digit;
}
int main() {
ll a, b;
cin >> a >> b;
if (a > b) {
cout << a + (a - 1) << endl;
} else if (b < a) {
cout << b + (b - 1) << endl;
} else {
cout << a * 2 << endl;
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <new>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
typedef long long ll;
typedef long double ld;
using namespace std;
using Graph = vector<vector<ll>>;
#define rep(i, N) for (ll i = 0; i < (ll)(N); ++i)
#define ALL(a) (a).begin(), (a).end()
const ll inf = 1e18 + 7;
const ll mod = 1e9 + 7;
ll GetDigit(ll num) {
unsigned digit = 0;
while (num != 0) {
num /= 10;
digit++;
}
return digit;
}
int main() {
ll a, b;
cin >> a >> b;
if (a > b) {
cout << a + (a - 1) << endl;
} else if (a < b) {
cout << b + (b - 1) << endl;
} else {
cout << a * 2 << endl;
}
return 0;
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 880,675 | 880,676 | u441865202 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << max({2 * a + 1, 2 * b + 1, a + b}) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << max({2 * a - 1, 2 * b - 1, a + b}) << endl;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 880,680 | 880,681 | u492660436 | cpp |
p03071 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int max_1 = a + a - 1;
int max_2 = a + b;
int max_3 = b + b + 1;
cout << max(max(max_1, max_2), max_3) << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int max_1 = a + a - 1;
int max_2 = a + b;
int max_3 = b + b - 1;
cout << max(max(max_1, max_2), max_3) << endl;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 880,682 | 880,683 | u816145694 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == B) {
cout << A + A - 1 << endl;
} else {
int tmp = max(A, B);
cout << tmp + tmp - 1 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == B) {
cout << A + A << endl;
} else {
int tmp = max(A, B);
cout << tmp + tmp - 1 << endl;
}
} | [
"expression.operation.binary.remove"
] | 880,684 | 880,685 | u760748346 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B;
if (A = B) {
cout << 2 * A << endl;
} else {
cout << 2 * max(A, B) - 1 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == B) {
cout << 2 * A << endl;
} else {
cout << 2 * max(A, B) - 1 << endl;
}
} | [
"variable_declaration.remove",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 880,690 | 880,691 | u978640776 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > b)
cout << max(a + b, max(a + a - 1, b + b - 1));
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << max(a + b, max(a + a - 1, b + b - 1));
} | [] | 880,700 | 880,701 | u746310630 | cpp |
p03071 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cstdio>
#include <ctime>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == b)
cout << 2 * a;
if (a > b)
cout << a + (a - 1);
else
cout << b + (b - 1);
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cstdio>
#include <ctime>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == b)
cout << 2 * a;
if (a > b)
cout << a + (a - 1);
if (a < b)
cout << b + (b - 1);
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 880,713 | 880,714 | u018713014 | cpp |
p03071 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(), (a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
typedef long long ll;
int main() {
int a, b;
cin >> a >> b;
if (a + 1 >= b)
dunk(a + a - 1);
if (a == b)
dunk(a + b);
if (a < b)
dunk(b + b - 1);
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(), (a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
typedef long long ll;
int main() {
int a, b;
cin >> a >> b;
if (a > b)
dunk(a + a - 1);
if (a == b)
dunk(a + b);
if (a < b)
dunk(b + b - 1);
} | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 880,721 | 880,722 | u454081619 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
const unsigned int MOD = 1000000007;
#define ll long long
#define PI 3.1416
string day[] = {"SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"};
vector<string> v;
void dfs(string str, string t = "", int cnt = 0) {
if (cnt == 2) {
v.push_back(t);
return;
} else {
for (int i = 0; i < str.size(); i++) {
dfs(str, t + str[i], cnt + 1);
}
}
}
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
int a, b;
while (cin >> a >> b) {
if (a - b >= 2)
cout << (a) + (a - 1) << endl;
else if (a == b) {
if (a == 1)
cout << "2" << endl;
else
cout << a + b << endl;
} else if (a - b == 1)
cout << b + 1 << endl;
else
cout << b + (b - 1) << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const unsigned int MOD = 1000000007;
#define ll long long
#define PI 3.1416
string day[] = {"SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"};
vector<string> v;
void dfs(string str, string t = "", int cnt = 0) {
if (cnt == 2) {
v.push_back(t);
return;
} else {
for (int i = 0; i < str.size(); i++) {
dfs(str, t + str[i], cnt + 1);
}
}
}
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
int a, b;
while (cin >> a >> b) {
if (a - b >= 2)
cout << (a) + (a - 1) << endl;
else if (a == b) {
if (a == 1)
cout << "2" << endl;
else
cout << a + b << endl;
} else if (a - b == 1)
cout << a + b << endl;
else
cout << b + (b - 1) << endl;
}
return 0;
}
| [
"identifier.change",
"io.output.change",
"identifier.replace.add",
"literal.replace.remove"
] | 880,731 | 880,732 | u207235471 | cpp |
p03071 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int count = 0, sum = 0;
while (count > 2) {
if (A > B) {
sum += A;
--A;
} else {
sum += B;
--B;
}
++count;
}
cout << sum << endl;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int count = 0, sum = 0;
while (count < 2) {
if (A > B) {
sum += A;
--A;
} else {
sum += B;
--B;
}
++count;
}
cout << sum << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 880,740 | 880,741 | u323542775 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina cout << ' '
#define in(n) cin >> n
#define in2(n, m) cin >> n >> m
#define in3(n, m, l) cin >> n >> m >> l
#define out(n) cout << n
const ll mei = (ll)1e9 + 7;
int main() {
ll a, b;
in2(a, b);
if (a > b)
out(2 * a - 1);
else if (a = b)
out(2 * a);
else
out(2 * b - 1);
memi;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina cout << ' '
#define in(n) cin >> n
#define in2(n, m) cin >> n >> m
#define in3(n, m, l) cin >> n >> m >> l
#define out(n) cout << n
const ll mei = (ll)1e9 + 7;
int main() {
ll a, b;
in2(a, b);
if (a > b)
out(2 * a - 1);
else if (a == b)
out(2 * a);
else
out(2 * b - 1);
memi;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 880,746 | 880,747 | u917049698 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = max(a, b);
if (ans == a)
cout << max(a, b) + max(a - 1, b);
else
cout << max(a, b) + max(a, b - b);
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = max(a, b);
if (ans == a)
cout << max(a, b) + max(a - 1, b);
else
cout << max(a, b) + max(a, b - 1);
}
| [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 880,748 | 880,749 | u639300218 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > b) {
int c = a;
a = b;
b = c;
}
if (a == b)
cout << a + b << endl;
else
cout << b * 2 + 1 << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > b) {
int c = a;
a = b;
b = c;
}
if (a == b)
cout << a + b << endl;
else
cout << b * 2 - 1 << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 880,752 | 880,753 | u993074316 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
template <typename T> void print(T x) { cout << x << endl; }
int main(void) {
int a, b;
cin >> a >> b;
if (a < b)
swap(a, b);
int mx = (2 * a - 1, a + b);
cout << mx;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
template <typename T> void print(T x) { cout << x << endl; }
int main(void) {
int a, b;
cin >> a >> b;
if (a < b)
swap(a, b);
int mx = max(2 * a - 1, a + b);
cout << mx;
}
| [
"call.add"
] | 880,764 | 880,765 | u243407720 | cpp |
p03064 | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)
#define irep(i, m, n) \
for (long long i = (long long)(m); i < (long long)(n); ++i)
#define ireps(i, m, n) \
for (long long i = (long long)(m); i <= (long long)(n); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v + n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cout(d) cout << d << endl;
#define coutd(d) cout << std::setprecision(10) << d << endl;
#define cinline(n) getline(cin, n);
#define replace_all(s, b, a) replace(s.begin(), s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) long long(x.size())
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
using vtp = vector<tuple<ll, ll, ll>>;
using vb = vector<bool>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
const ll LINF = 1e18;
// https://betrue12.hateblo.jp/entry/2019/04/21/150214
const ll maxj = 300 * 300 + 5;
ll dp1[305][maxj];
ll dp2[305][maxj];
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vll a(n);
ll sum = 0;
rep(i, n) {
cin >> a[i];
sum += a[i];
}
dp1[0][0] = dp2[0][0] = 1;
rep(i, n) {
rep(j, maxj) {
(dp1[i + 1][j + a[i]] += dp1[i][j]) %= MOD;
(dp1[i + 1][j] += (dp1[i][j] * 2) % MOD) %= MOD;
(dp2[i + 1][j + a[i]] += dp2[i][j]) %= MOD;
(dp2[i + 1][j] += dp2[i][j]) %= MOD;
}
}
ll ng = 0;
irep(j, (sum + 1) / 2, maxj) { (ng += dp1[n][j]) %= MOD; }
if (sum % 2 == 0) {
(ng += MOD - dp2[n][sum / 2]) %= MOD;
}
(ng *= 3) %= MOD;
ll ans = 1;
rep(i, n)(ans *= 3) %= MOD;
(ans += MOD - ng) %= MOD;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)
#define irep(i, m, n) \
for (long long i = (long long)(m); i < (long long)(n); ++i)
#define ireps(i, m, n) \
for (long long i = (long long)(m); i <= (long long)(n); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v + n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cout(d) cout << d << endl;
#define coutd(d) cout << std::setprecision(10) << d << endl;
#define cinline(n) getline(cin, n);
#define replace_all(s, b, a) replace(s.begin(), s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) long long(x.size())
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
using vtp = vector<tuple<ll, ll, ll>>;
using vb = vector<bool>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll INF = 1e9;
// const ll MOD = 1e9+7;
const ll MOD = 998244353;
const ll LINF = 1e18;
// MOD ใฏ 1000000007 ใจใฏ้ใใชใ๏ผ
// https://betrue12.hateblo.jp/entry/2019/04/21/150214
// a[i]ใฎ้
ๅใฎๅ
จ้ใๆฐ3^nใใใ3่งๅฝขใๆใใชใๅฒใๆฏใๆนใฎ้ใๆฐใๅผใ
// ใใฎ้ใๆฐใๆฑใใ้ใซ้่คใๆ้คใใๆซๅคใใใใฎใงใใใใdp2ใใๆฑใใ
const ll maxj = 300 * 300 + 5;
ll dp1[305]
[maxj]; // i็ช็ฎใฎ่พบใพใงใฎ่ฒใฎๅกใๅใใๆฑบใใๆ Rใฎ้ทใใjใจใใ้ใๆฐ
// a[i]ใRใซ้
ๅใใใชใใฐใdp[i+1][j+a[i]]ใธ้ท็งปใใ้
ๅใใชใใชใdp[i+1][j]ใธ้ท็งปใใ
// ๅพ่
ใฎ้ท็งปใฏG,Bใฎไบ่ฒใซใคใใฆๆใๅพใใฎใง*2้ใใจใชใ
// a[i]ใฎๅ่จใsumใจใใใชใใฐ,j>=ceil(sum/2)ใซใคใใฆใ
// dp1[n][j]ใฎๅ่จใใใไธ่ฒใซใคใใฆ็็ฎใใๆใซไธ่งๅฝขใใคใใใชใๅฒใๆฏใๆนใฎ้ใๆฐใจใชใ
ll dp2[305][maxj]; // 2่พบใซใใๅฒใๆฏใใชใใจๆฑบใใฆใi็ช็ฎใฎ่พบใพใงใฎ่ฒใฎๅกใๅใใๆฑบใใๆ
// Rใฎ้ทใใjใจใใ้ใๆฐ
// a[i]ใRใซ้
ๅใใใชใใฐใdp[i+1][j+a[i]]ใธ้ท็งปใใ้
ๅใใชใใชใdp[i+1][j]ใธ้ท็งปใใ
// ใใกใใฏdp1ใจ้ใRใซ้
ๅใใชใๅ ดๅใฏใใไธ่ฒใซๅฒใๅฝใฆใใจ่ใใใใใฎใง*2ใฏ่กใใชใ
// sum%==2 ใชใใฐใRใฎ้ทใ=Gใฎ้ทใ=sum/2 ใจใชใใใจใๆใๅพใ
// ใใใฏdp1ใฎ3่งๅฝขใๆใใชใ้ใๆฐใใๆ้คใในใ้่คใฎใใใdp[n][sum/2]ใๆฑใใฆcomb(3,2)ๅใใใใฎใๅผใ
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vll a(n);
ll sum = 0;
rep(i, n) {
cin >> a[i];
sum += a[i];
}
dp1[0][0] = dp2[0][0] = 1;
rep(i, n) {
rep(j, maxj) {
(dp1[i + 1][j + a[i]] += dp1[i][j]) %= MOD;
(dp1[i + 1][j] += (dp1[i][j] * 2) % MOD) %= MOD;
(dp2[i + 1][j + a[i]] += dp2[i][j]) %= MOD;
(dp2[i + 1][j] += dp2[i][j]) %= MOD;
}
}
ll ng = 0;
irep(j, (sum + 1) / 2, maxj) { (ng += dp1[n][j]) %= MOD; }
if (sum % 2 == 0) {
(ng += MOD - dp2[n][sum / 2]) %= MOD;
}
(ng *= 3) %= MOD;
ll ans = 1;
rep(i, n)(ans *= 3) %= MOD;
(ans += MOD - ng) %= MOD;
cout << ans << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 880,778 | 880,779 | u530107518 | cpp |
p03064 | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)
#define irep(i, m, n) \
for (long long i = (long long)(m); i < (long long)(n); ++i)
#define ireps(i, m, n) \
for (long long i = (long long)(m); i <= (long long)(n); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v + n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cout(d) cout << d << endl;
#define coutd(d) cout << std::setprecision(10) << d << endl;
#define cinline(n) getline(cin, n);
#define replace_all(s, b, a) replace(s.begin(), s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) long long(x.size())
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
using vtp = vector<tuple<ll, ll, ll>>;
using vb = vector<bool>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
const ll LINF = 1e18;
// https://betrue12.hateblo.jp/entry/2019/04/21/150214
const ll maxj = 300 * 300 + 5;
ll dp1[305][maxj];
ll dp2[305][maxj];
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vll a(n);
ll sum = 0;
rep(i, n) {
cin >> a[i];
sum += a[i];
}
dp1[0][0] = dp2[0][0] = 1;
rep(i, n) {
rep(j, maxj) {
(dp1[i + 1][j + a[i]] += dp1[i][j]) %= MOD;
(dp1[i + 1][j] += (dp1[i][j] * 2) % MOD) %= MOD;
(dp2[i + 1][j + a[i]] += dp2[i][j]) %= MOD;
(dp2[i + 1][j] += dp2[i][j]) %= MOD;
}
}
ll ng = 0;
irep(j, (sum + 1) / 2, maxj) { (ng += dp1[n][j]) %= MOD; }
if (sum % 2 == 0) {
(ng += MOD - dp2[n][sum / 2]) %= MOD;
}
(ng *= 3) %= MOD;
ll ans = 1;
rep(i, n)(ans *= 3) %= MOD;
(ans += MOD - ng) %= MOD;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)
#define irep(i, m, n) \
for (long long i = (long long)(m); i < (long long)(n); ++i)
#define ireps(i, m, n) \
for (long long i = (long long)(m); i <= (long long)(n); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v + n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cout(d) cout << d << endl;
#define coutd(d) cout << std::setprecision(10) << d << endl;
#define cinline(n) getline(cin, n);
#define replace_all(s, b, a) replace(s.begin(), s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) long long(x.size())
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
using vtp = vector<tuple<ll, ll, ll>>;
using vb = vector<bool>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll INF = 1e9;
// const ll MOD = 1e9+7;
const ll MOD = 998244353;
const ll LINF = 1e18;
// https://betrue12.hateblo.jp/entry/2019/04/21/150214
const ll maxj = 300 * 300 + 5;
ll dp1[305][maxj];
ll dp2[305][maxj];
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vll a(n);
ll sum = 0;
rep(i, n) {
cin >> a[i];
sum += a[i];
}
dp1[0][0] = dp2[0][0] = 1;
rep(i, n) {
rep(j, maxj) {
(dp1[i + 1][j + a[i]] += dp1[i][j]) %= MOD;
(dp1[i + 1][j] += (dp1[i][j] * 2) % MOD) %= MOD;
(dp2[i + 1][j + a[i]] += dp2[i][j]) %= MOD;
(dp2[i + 1][j] += dp2[i][j]) %= MOD;
}
}
ll ng = 0;
irep(j, (sum + 1) / 2, maxj) { (ng += dp1[n][j]) %= MOD; }
if (sum % 2 == 0) {
(ng += MOD - dp2[n][sum / 2]) %= MOD;
}
(ng *= 3) %= MOD;
ll ans = 1;
rep(i, n)(ans *= 3) %= MOD;
(ans += MOD - ng) %= MOD;
cout << ans << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 880,778 | 880,780 | u530107518 | cpp |
p03064 | #include <bits/stdc++.h>
#define l_ength size
const int inf = (1 << 30);
const int mod = 998244353;
using ll = long long;
using namespace std;
const int bound = 100000;
ll sp[310][bound];
ll dp[310][bound];
int main() {
int n;
cin >> n;
vector<int> a(n);
for (auto &k : a)
cin >> k;
dp[0][0] = 1;
ll sum = 0;
ll product = 1;
for (int i = 0; i < n; ++i) {
sum += a[i];
product *= 3;
product %= mod;
for (int x = 0; x < bound - 500; ++x) {
dp[i + 1][x] += (dp[i][x] * 2);
dp[i + 1][x] %= mod;
dp[i + 1][x + a[i]] += (dp[i][x]) % mod;
dp[i + 1][x + a[i]] %= mod;
}
}
ll ngsum = 0;
for (int x = (sum + 1) / 2; x < bound; ++x) {
ngsum += dp[n][x];
}
if (sum % 2 == 0) {
sp[0][0] = 1;
for (int i = 0; i < n; ++i) {
for (int x = 0; x < bound - 500; ++x) {
sp[i + 1][x] += sp[i][x];
sp[i + 1][x] %= mod;
sp[i + 1][x + a[i]] += (sp[i][x]) % mod;
sp[i + 1][x + a[i]] %= mod;
}
}
}
cout << (product - (ngsum - sp[n][sum / 2] + mod) * 3 + mod) % mod << endl;
} | #include <bits/stdc++.h>
#define l_ength size
const int inf = (1 << 30);
const int mod = 998244353;
using ll = long long;
using namespace std;
const int bound = 100000;
ll sp[310][bound];
ll dp[310][bound];
int main() {
int n;
cin >> n;
vector<int> a(n);
for (auto &k : a)
cin >> k;
dp[0][0] = 1;
ll sum = 0;
ll product = 1;
for (int i = 0; i < n; ++i) {
sum += a[i];
product *= 3;
product %= mod;
for (int x = 0; x < bound - 500; ++x) {
dp[i + 1][x] += (dp[i][x] * 2);
dp[i + 1][x] %= mod;
dp[i + 1][x + a[i]] += (dp[i][x]) % mod;
dp[i + 1][x + a[i]] %= mod;
}
}
ll ngsum = 0;
for (int x = (sum + 1) / 2; x < bound; ++x) {
ngsum += dp[n][x];
}
if (sum % 2 == 0) {
sp[0][0] = 1;
for (int i = 0; i < n; ++i) {
for (int x = 0; x < bound - 500; ++x) {
sp[i + 1][x] += sp[i][x];
sp[i + 1][x] %= mod;
sp[i + 1][x + a[i]] += (sp[i][x]) % mod;
sp[i + 1][x + a[i]] %= mod;
}
}
}
cout << (product - (ngsum - sp[n][sum / 2] + mod) * 3 % mod + mod) % mod
<< endl;
} | [
"expression.operation.binary.add"
] | 880,785 | 880,786 | u548624367 | cpp |
p03064 | #include <bits/stdc++.h>
#define l_ength size
const int inf = (1 << 30);
using ll = long long;
const ll mod = 998244353;
using namespace std;
const int bound = 100000;
ll sp[310][bound];
ll dp[310][bound];
int main() {
int n;
cin >> n;
vector<ll> a(n);
for (auto &k : a)
cin >> k;
dp[0][0] = 1;
ll sum = 0;
ll product = 1;
for (int i = 0; i < n; ++i) {
sum += a[i];
sum %= mod;
product *= 3;
product %= mod;
for (int x = 0; x < bound - 500; ++x) {
dp[i + 1][x] += 2 * dp[i][x] % mod;
dp[i + 1][x] %= mod;
dp[i + 1][x + a[i]] += dp[i][x] % mod;
dp[i + 1][x + a[i]] %= mod;
}
}
ll ngsum = 0;
for (int x = (sum + 1) / 2; x < bound; ++x) {
ngsum += dp[n][x];
ngsum %= mod;
}
if (sum % 2 == 0) {
sp[0][0] = 1;
for (int i = 0; i < n; ++i) {
for (int x = 0; x < bound - 500; ++x) {
sp[i + 1][x] += sp[i][x];
sp[i + 1][x] %= mod;
sp[i + 1][x + a[i]] += sp[i][x] % mod;
sp[i + 1][x + a[i]] %= mod;
}
}
}
cout << (product - 3 * (ngsum - sp[n][sum / 2]) + mod) % mod << endl;
} | #include <bits/stdc++.h>
#define l_ength size
const int inf = (1 << 30);
using ll = long long;
const ll mod = 998244353;
using namespace std;
const int bound = 100000;
ll sp[310][bound];
ll dp[310][bound];
int main() {
int n;
cin >> n;
vector<ll> a(n);
for (auto &k : a)
cin >> k;
dp[0][0] = 1;
ll sum = 0;
ll product = 1;
for (int i = 0; i < n; ++i) {
sum += a[i];
sum %= mod;
product *= 3;
product %= mod;
for (int x = 0; x < bound - 500; ++x) {
dp[i + 1][x] += 2 * dp[i][x] % mod;
dp[i + 1][x] %= mod;
dp[i + 1][x + a[i]] += dp[i][x] % mod;
dp[i + 1][x + a[i]] %= mod;
}
}
ll ngsum = 0;
for (int x = (sum + 1) / 2; x < bound; ++x) {
ngsum += dp[n][x];
ngsum %= mod;
}
if (sum % 2 == 0) {
sp[0][0] = 1;
for (int i = 0; i < n; ++i) {
for (int x = 0; x < bound - 500; ++x) {
sp[i + 1][x] += sp[i][x];
sp[i + 1][x] %= mod;
sp[i + 1][x + a[i]] += sp[i][x] % mod;
sp[i + 1][x + a[i]] %= mod;
}
}
}
cout << (product - 3 * (ngsum - sp[n][sum / 2]) + 500 * mod) % mod << endl;
} | [
"expression.operation.binary.add"
] | 880,787 | 880,788 | u268977772 | cpp |
p03064 | #include <algorithm>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
struct Debug {
int cnt = 0;
bool on = false;
char debug[10] = "debug";
template <class T> Debug &operator<<(const T &v) {
if (on && cnt++ == 0)
cerr << "debug: ";
if (on)
cerr << v << ' ';
return *this;
}
Debug &operator<<(ostream &(*pManip)(ostream &)) {
if (on)
cerr << (*pManip);
cnt = 0;
return *this;
}
} debug;
#define rep(i, a, b) for (auto i = (a); i < (b); i++)
#define rrep(i, a, b) for (auto i = (a); i > (b); i--)
#define all(v) (v).begin(), (v).end()
#define print(v) \
{ \
if (debug.on) { \
for (auto x : v) \
debug << x; \
debug << endl; \
} \
}
#define printn(v, n) \
{ \
if (debug.on) { \
for (int _i = 0; _i < n; _i++) \
debug << *(v + _i); \
debug << endl; \
} \
}
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
struct mint {
long long x;
long long mod = 998244353;
mint() : x(0) {}
mint(long long _x) : x(_x) {}
operator long long() { return x; }
mint operator+(const mint &b) const { return (x + b.x) % mod; }
mint operator-(const mint &b) const { return (x - b.x + mod) % mod; }
mint operator*(const mint &b) const { return (x * b.x) % mod; }
template <class T> mint operator^(T b) const {
if (!b)
return 1;
mint tmp = (*this) ^ (b / 2);
return b % 2 ? tmp * tmp * (*this) : tmp * tmp;
}
mint inv() const {
static unordered_map<long long, long long> inv_dp;
if (inv_dp.count(x))
return inv_dp.count(x);
else if (inv_dp.size() < 100000)
return inv_dp[x] = (*this) ^ (mod - 2);
else
return (*this) ^ (mod - 2);
}
mint operator/(const mint &b) const { return (*this) * b.inv(); }
};
// unordered_map<long long, long long> mint::inv_dp;
const int MAXN = 300 + 20, MAXM = 90000 + 20;
int n;
int a[MAXN];
mint dp[MAXM];
mint dp2[MAXM];
int main(int argc, char *argv[]) {
ios_base::sync_with_stdio(0);
cin.tie(0);
if (argc > 1 && !strcmp(argv[1], debug.debug))
debug.on = true;
cin >> n;
int tot = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
tot += a[i];
}
dp[0] = mint(2) ^ n;
dp2[0] = mint(1);
for (int i = 1; i <= n; i++) {
for (int j = tot; j >= 0; j--) {
if (j - a[i] >= 0) {
dp[j] = dp[j] + dp[j - a[i]] / mint(2);
dp2[j] = dp2[j] + dp2[j - a[i]];
}
}
debug << i << endl;
for (int i = 0; i < 10; i++)
debug << dp[i].x;
debug << endl;
}
mint res = 0;
for (int i = (tot + 1) / 2; i <= tot; i++) {
res = res + dp[i];
if (i * 2 == tot)
res = res - dp2[i];
debug << i << res.x << endl;
}
debug << (mint(3) ^ n).x << res.x << endl;
res = (mint(3) ^ n) - res * mint(3);
debug << res.x << (mint(3) ^ n).x << endl;
cout << res.x << endl;
return 0;
}
| #include <algorithm>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
struct Debug {
int cnt = 0;
bool on = false;
char debug[10] = "debug";
template <class T> Debug &operator<<(const T &v) {
if (on && cnt++ == 0)
cerr << "debug: ";
if (on)
cerr << v << ' ';
return *this;
}
Debug &operator<<(ostream &(*pManip)(ostream &)) {
if (on)
cerr << (*pManip);
cnt = 0;
return *this;
}
} debug;
#define rep(i, a, b) for (auto i = (a); i < (b); i++)
#define rrep(i, a, b) for (auto i = (a); i > (b); i--)
#define all(v) (v).begin(), (v).end()
#define print(v) \
{ \
if (debug.on) { \
for (auto x : v) \
debug << x; \
debug << endl; \
} \
}
#define printn(v, n) \
{ \
if (debug.on) { \
for (int _i = 0; _i < n; _i++) \
debug << *(v + _i); \
debug << endl; \
} \
}
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
struct mint {
long long x;
long long mod = 998244353;
mint() : x(0) {}
mint(long long _x) : x(_x) {}
operator long long() { return x; }
mint operator+(const mint &b) const { return (x + b.x) % mod; }
mint operator-(const mint &b) const { return (x - b.x + mod) % mod; }
mint operator*(const mint &b) const { return (x * b.x) % mod; }
template <class T> mint operator^(T b) const {
if (!b)
return 1;
mint tmp = (*this) ^ (b / 2);
return b % 2 ? tmp * tmp * (*this) : tmp * tmp;
}
mint inv() const {
static unordered_map<long long, long long> inv_dp;
if (inv_dp.count(x))
return inv_dp[x];
else if (inv_dp.size() < 100000)
return inv_dp[x] = (*this) ^ (mod - 2);
else
return (*this) ^ (mod - 2);
}
mint operator/(const mint &b) const { return (*this) * b.inv(); }
};
// unordered_map<long long, long long> mint::inv_dp;
const int MAXN = 300 + 20, MAXM = 90000 + 20;
int n;
int a[MAXN];
mint dp[MAXM];
mint dp2[MAXM];
int main(int argc, char *argv[]) {
ios_base::sync_with_stdio(0);
cin.tie(0);
if (argc > 1 && !strcmp(argv[1], debug.debug))
debug.on = true;
cin >> n;
int tot = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
tot += a[i];
}
dp[0] = mint(2) ^ n;
dp2[0] = mint(1);
for (int i = 1; i <= n; i++) {
for (int j = tot; j >= 0; j--) {
if (j - a[i] >= 0) {
dp[j] = dp[j] + dp[j - a[i]] / mint(2);
dp2[j] = dp2[j] + dp2[j - a[i]];
}
}
debug << i << endl;
for (int i = 0; i < 10; i++)
debug << dp[i].x;
debug << endl;
}
mint res = 0;
for (int i = (tot + 1) / 2; i <= tot; i++) {
res = res + dp[i];
if (i * 2 == tot)
res = res - dp2[i];
debug << i << res.x << endl;
}
debug << (mint(3) ^ n).x << res.x << endl;
res = (mint(3) ^ n) - res * mint(3);
debug << res.x << (mint(3) ^ n).x << endl;
cout << res.x << endl;
return 0;
}
| [
"function.return_value.change",
"call.remove",
"call.arguments.change"
] | 880,789 | 880,790 | u096453658 | cpp |
p03064 | #include <bits/stdc++.h>
#include <ext/numeric>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#define oo 0x3f3f3f3f
#define OO 0x3f3f3f3f3f3f3f3f
#define popcount(n) __builtin_popcount(n)
#define popcountll(n) __builtin_popcountll(n)
using namespace std;
using namespace __gnu_cxx;
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const double PI = acos(-1.0), EPS = 1e-6;
const long long inf = 2e12 + 12;
const int MAXN = 1000006, MAXM = 102, Mod = 998244353, MAXLog = 20;
int solve1(int n, int idx, int sum, int half, vector<int> &arr,
vector<vector<int>> &memo) {
if (idx == n)
return sum >= half;
int &ret = memo[idx][sum];
if (~ret)
return ret;
ret = solve1(n, idx + 1, sum, half, arr, memo) * 2;
ret %= Mod;
ret += solve1(n, idx + 1, sum + arr[idx], half, arr, memo);
ret %= Mod;
return ret;
}
int solve2(int n, int idx, int sum, int half, vector<int> &arr,
vector<vector<int>> &memo) {
if (idx == n)
return sum == half;
int &ret = memo[idx][sum];
if (~ret)
return ret;
ret = solve2(n, idx + 1, sum, half, arr, memo);
ret %= Mod;
ret += solve2(n, idx + 1, sum + arr[idx], half, arr, memo);
ret %= Mod;
return ret;
}
int power(int b, int e, int mod = Mod) {
if (e == 0)
return 1;
int x = power(b, e >> 1, mod);
x = 1LL * x * x % mod;
if (e & 1)
x = 1LL * x * b % mod;
return x;
}
int main() {
#ifndef ONLINE_JUDGE
// freopen("input.txt", "rt", stdin);
// freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0), cout.precision(9),
cout << fixed;
int n;
cin >> n;
vector<int> arr(n);
int sum = 0;
for (int i = 0; i < n; ++i) {
cin >> arr[i];
sum += arr[i];
}
vector<vector<int>> memo1(n, vector<int>(90001, -1));
int ans = (power(3, n) -
3LL * solve1(n, 0, 0, (sum + 1) / 2, arr, memo1) % Mod + Mod) %
Mod;
vector<vector<int>> memo2(n, vector<int>(90001, -1));
cout << ans +
((sum & 1) ? 0 : 3LL * solve2(n, 0, 0, sum / 2, arr, memo2) % Mod)
<< '\n';
return 0;
} | #include <bits/stdc++.h>
#include <ext/numeric>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#define oo 0x3f3f3f3f
#define OO 0x3f3f3f3f3f3f3f3f
#define popcount(n) __builtin_popcount(n)
#define popcountll(n) __builtin_popcountll(n)
using namespace std;
using namespace __gnu_cxx;
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const double PI = acos(-1.0), EPS = 1e-6;
const long long inf = 2e12 + 12;
const int MAXN = 1000006, MAXM = 102, Mod = 998244353, MAXLog = 20;
int solve1(int n, int idx, int sum, int half, vector<int> &arr,
vector<vector<int>> &memo) {
if (idx == n)
return sum >= half;
int &ret = memo[idx][sum];
if (~ret)
return ret;
ret = solve1(n, idx + 1, sum, half, arr, memo) * 2;
ret %= Mod;
ret += solve1(n, idx + 1, sum + arr[idx], half, arr, memo);
ret %= Mod;
return ret;
}
int solve2(int n, int idx, int sum, int half, vector<int> &arr,
vector<vector<int>> &memo) {
if (idx == n)
return sum == half;
int &ret = memo[idx][sum];
if (~ret)
return ret;
ret = solve2(n, idx + 1, sum, half, arr, memo);
ret %= Mod;
ret += solve2(n, idx + 1, sum + arr[idx], half, arr, memo);
ret %= Mod;
return ret;
}
int power(int b, int e, int mod = Mod) {
if (e == 0)
return 1;
int x = power(b, e >> 1, mod);
x = 1LL * x * x % mod;
if (e & 1)
x = 1LL * x * b % mod;
return x;
}
int main() {
#ifndef ONLINE_JUDGE
// freopen("input.txt", "rt", stdin);
// freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0), cout.precision(9),
cout << fixed;
int n;
cin >> n;
vector<int> arr(n);
int sum = 0;
for (int i = 0; i < n; ++i) {
cin >> arr[i];
sum += arr[i];
}
vector<vector<int>> memo1(n, vector<int>(90001, -1));
int ans = (power(3, n) -
3LL * solve1(n, 0, 0, (sum + 1) / 2, arr, memo1) % Mod + Mod) %
Mod;
vector<vector<int>> memo2(n, vector<int>(90001, -1));
cout << (ans +
((sum & 1) ? 0 : 3LL * solve2(n, 0, 0, sum / 2, arr, memo2) % Mod)) %
Mod
<< '\n';
return 0;
} | [
"expression.operation.binary.add"
] | 880,791 | 880,792 | u381626581 | cpp |
p03064 | #include <iostream>
using namespace std;
typedef long long ll;
const int MAX_N = 303;
const int MAX_A = 303;
const ll MOD = 998244353;
ll A[MAX_N], dp[MAX_N][MAX_N * MAX_A], sub_dp[MAX_N][MAX_N * MAX_A];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
ll sum = 0;
for (int i = 1; i <= N; i++) {
cin >> A[i];
sum += A[i];
}
// main
dp[0][0] = 1;
for (int i = 1; i <= N; i++) {
for (int j = 0; j <= sum; j++) {
dp[i][j] = (dp[i][j] + (dp[i - 1][j] * 2) % MOD) % MOD;
if (j - A[i] >= 0)
dp[i][j] = (dp[i][j] + dp[i - 1][j - A[i]]) % MOD;
}
}
// sub
sub_dp[0][0] = 1;
for (int i = 1; i <= N; i++) {
for (int j = 0; j <= sum; j++) {
sub_dp[i][j] = (sub_dp[i][j] + sub_dp[i - 1][j]) % MOD;
if (j - A[i] >= 0)
sub_dp[i][j] = (sub_dp[i][j] + sub_dp[i - 1][j - A[i]]) % MOD;
}
}
ll not_ans = (MOD - (sum % 2 == 0 ? sub_dp[N][sum / 2] : 0)) % MOD;
for (int i = (sum + 1) / 2; i <= sum; i++) {
not_ans = (not_ans + dp[N][i]) % MOD;
}
ll ans = 1;
for (int i = 0; i < N; i++)
ans = (ans * 3) % MOD;
cout << (ans - 3 * not_ans + MOD) % MOD << endl;
return 0;
} | #include <iostream>
using namespace std;
typedef long long ll;
const int MAX_N = 303;
const int MAX_A = 303;
const ll MOD = 998244353;
ll A[MAX_N], dp[MAX_N][MAX_N * MAX_A], sub_dp[MAX_N][MAX_N * MAX_A];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
ll sum = 0;
for (int i = 1; i <= N; i++) {
cin >> A[i];
sum += A[i];
}
// main
dp[0][0] = 1;
for (int i = 1; i <= N; i++) {
for (int j = 0; j <= sum; j++) {
dp[i][j] = (dp[i][j] + (dp[i - 1][j] * 2) % MOD) % MOD;
if (j - A[i] >= 0)
dp[i][j] = (dp[i][j] + dp[i - 1][j - A[i]]) % MOD;
}
}
// sub
sub_dp[0][0] = 1;
for (int i = 1; i <= N; i++) {
for (int j = 0; j <= sum; j++) {
sub_dp[i][j] = (sub_dp[i][j] + sub_dp[i - 1][j]) % MOD;
if (j - A[i] >= 0)
sub_dp[i][j] = (sub_dp[i][j] + sub_dp[i - 1][j - A[i]]) % MOD;
}
}
ll not_ans = (MOD - (sum % 2 == 0 ? sub_dp[N][sum / 2] : 0)) % MOD;
for (int i = (sum + 1) / 2; i <= sum; i++) {
not_ans = (not_ans + dp[N][i]) % MOD;
}
ll ans = 1;
for (int i = 0; i < N; i++)
ans = (ans * 3) % MOD;
cout << (ans - (3 * not_ans) % MOD + MOD) % MOD << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 880,805 | 880,806 | u134519179 | cpp |
p03064 | // Copyright ยฉ 2019 Diego Garcia Rodriguez del Campo. All rights reserved.
#include <bits/stdc++.h>
#define MAX 305
#define MOD 998244353
using namespace std;
#define optimiza_io \
cin.tie(0); \
ios_base::sync_with_stdio(0);
typedef long long i64;
i64 N, sum;
i64 a[MAX];
i64 memo[MAX][90005];
i64 dp(i64 x, i64 s) {
if (x > N) {
if (s >= (sum + 1) / 2)
return 1;
return 0;
}
if (memo[x][s] != -1)
return memo[x][s];
i64 ans = 0;
ans += 2 * dp(x + 1, s);
ans += dp(x + 1, s + a[x]);
ans %= MOD;
return memo[x][s] = ans;
}
i64 dp2(i64 x, i64 s) {
if (x > N) {
if (s == sum / 2)
return 1;
return 0;
}
if (memo[x][s] != -1)
return memo[x][s];
i64 ans = dp2(x + 1, s) + dp2(x + 1, s + a[x]);
ans %= MOD;
return memo[x][s] = ans;
}
int main() {
optimiza_io memset(memo, -1, sizeof memo);
cin >> N;
i64 ansi = 1;
for (i64 i = 1; i <= N; i++) {
cin >> a[i];
sum += a[i];
ansi *= 3;
ansi %= MOD;
}
i64 tmp = 3 * dp(1, 0);
if (sum % 2 == 0) {
memset(memo, -1, sizeof memo);
tmp -= 3 * dp2(1, 0);
tmp %= MOD;
tmp += MOD;
tmp %= MOD;
}
cout << (ansi - tmp + MOD) % MOD << "\n";
return 0;
}
/*
*/ | // Copyright ยฉ 2019 Diego Garcia Rodriguez del Campo. All rights reserved.
#include <bits/stdc++.h>
#define MAX 305
#define MOD 998244353
using namespace std;
#define optimiza_io \
cin.tie(0); \
ios_base::sync_with_stdio(0);
typedef long long i64;
i64 N, sum;
i64 a[MAX];
i64 memo[MAX][90005];
i64 dp(i64 x, i64 s) {
if (x > N) {
if (s >= (sum + 1) / 2)
return 1;
return 0;
}
if (memo[x][s] != -1)
return memo[x][s];
i64 ans = 0;
ans += 2 * dp(x + 1, s);
ans += dp(x + 1, s + a[x]);
ans %= MOD;
return memo[x][s] = ans;
}
i64 dp2(i64 x, i64 s) {
if (x > N) {
if (s == sum / 2)
return 1;
return 0;
}
if (memo[x][s] != -1)
return memo[x][s];
i64 ans = dp2(x + 1, s) + dp2(x + 1, s + a[x]);
ans %= MOD;
return memo[x][s] = ans;
}
int main() {
optimiza_io memset(memo, -1, sizeof memo);
cin >> N;
i64 ansi = 1;
for (i64 i = 1; i <= N; i++) {
cin >> a[i];
sum += a[i];
ansi *= 3;
ansi %= MOD;
}
i64 tmp = 3 * dp(1, 0);
if (sum % 2 == 0) {
memset(memo, -1, sizeof memo);
tmp -= 3 * dp2(1, 0);
tmp %= MOD;
tmp += MOD;
tmp %= MOD;
}
cout << (((ansi - tmp) % MOD) + MOD) % MOD << "\n";
return 0;
} | [] | 880,815 | 880,816 | u414944342 | cpp |
p03064 | #include <bits/stdc++.h>
#include <fstream>
#include <iostream>
#define ll long long
using namespace std;
int main() {
int N;
cin >> N;
int S = 0;
int mod = 998244353;
vector<int> a(N + 1, 0);
for (int i = 1; i <= N; i++) {
cin >> a[i];
S += a[i];
}
vector<vector<ll>> dp1(N + 1, vector<ll>(S + 1, 0));
vector<vector<ll>> dp2(N + 1, vector<ll>(S + 1, 0));
dp1[0][0] = dp2[0][0] = 1;
for (int i = 1; i < N; i++) {
for (int r = 0; r <= S; r++) {
dp1[i + 1][r] = 2 * dp1[i][r] % mod;
dp2[i + 1][r] = dp2[i][r] % mod;
if (r >= a[i + 1]) {
dp1[i + 1][r] = (dp1[i + 1][r] + dp1[i][r - a[i + 1]]) % mod;
dp2[i + 1][r] = (dp2[i + 1][r] + dp2[i][r - a[i + 1]]) % mod;
}
}
}
ll ans = 1;
for (int i = 0; i < N; i++) {
ans = (ans * 3) % mod;
}
for (int r = S / 2 + 1; r <= S; r++) {
ans = ans - 3 * dp1[N][r];
while (ans < 0)
ans += mod;
ans %= mod;
}
if (S % 2 == 0) {
ans = ans - 3 * dp1[N][S / 2];
while (ans < 0)
ans += mod;
ans = (ans + 3 * dp2[N][S / 2]) % mod;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#include <fstream>
#include <iostream>
#define ll long long
using namespace std;
int main() {
int N;
cin >> N;
int S = 0;
int mod = 998244353;
vector<int> a(N + 1, 0);
for (int i = 1; i <= N; i++) {
cin >> a[i];
S += a[i];
}
vector<vector<ll>> dp1(N + 1, vector<ll>(S + 1, 0));
vector<vector<ll>> dp2(N + 1, vector<ll>(S + 1, 0));
dp1[0][0] = dp2[0][0] = 1;
for (int i = 0; i < N; i++) {
for (int r = 0; r <= S; r++) {
dp1[i + 1][r] = 2 * dp1[i][r] % mod;
dp2[i + 1][r] = dp2[i][r] % mod;
if (r >= a[i + 1]) {
dp1[i + 1][r] = (dp1[i + 1][r] + dp1[i][r - a[i + 1]]) % mod;
dp2[i + 1][r] = (dp2[i + 1][r] + dp2[i][r - a[i + 1]]) % mod;
}
}
}
ll ans = 1;
for (int i = 0; i < N; i++) {
ans = (ans * 3) % mod;
}
for (int r = S / 2 + 1; r <= S; r++) {
ans = ans - 3 * dp1[N][r];
while (ans < 0)
ans += mod;
ans %= mod;
}
if (S % 2 == 0) {
ans = ans - 3 * dp1[N][S / 2];
while (ans < 0)
ans += mod;
ans = (ans + 3 * dp2[N][S / 2]) % mod;
}
cout << ans << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 880,827 | 880,828 | u119098168 | cpp |
p03064 | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define FOR(i, k, n) for (int(i) = (k); (i) < (n); ++(i))
#define rep(i, n) FOR(i, 0, n)
#define all(v) begin(v), end(v)
#define debug(x) // std::cerr<<#x<<": "<<x<<"\n"
#define debug2(x, y) // std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<"\n"
#define debug3( \
x, y, \
z) // std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<", "<<#z<<": "<<z<<"\n"
using ll = long long;
using vi = std::vector<int>;
using vvi = std::vector<vi>;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
template <typename T> using vvec = std::vector<std::vector<T>>;
template <typename T> auto make_v(size_t sz) { return std::vector<T>(sz); }
template <typename T, typename... Ts> auto make_v(size_t sz, Ts... ts) {
return std::vector<decltype(make_v<T>(ts...))>(sz, make_v<T>(ts...));
}
template <typename T> void fill_v(T &var, const T &x) { var = x; }
template <typename V, typename T> void fill_v(V &v, const T &x) {
for (auto &&w : v) {
fill_v(w, x);
}
}
template <typename T>
std::ostream &operator<<(std::ostream &s, const std::vector<T> &v) {
int sz = v.size();
s << "\n";
rep(i, sz) {
s << v[i];
if (i < sz - 1) {
s << "\t";
}
}
s << "\n";
return s;
}
template <typename T>
std::ostream &operator<<(std::ostream &s,
const std::vector<std::vector<T>> &v) {
for (auto &&w : v) {
s << w;
}
return s;
}
template <typename T>
std::ostream &operator<<(std::ostream &s, const std::deque<T> &v) {
int sz = v.size();
s << "\n";
rep(i, sz) {
s << v[i];
if (i < sz - 1) {
s << "\t";
}
}
s << "\n";
return s;
}
template <typename T>
std::ostream &operator<<(std::ostream &s, const std::deque<std::deque<T>> &v) {
for (auto &&w : v) {
s << w;
}
return s;
}
template <typename T>
std::ostream &operator<<(std::ostream &s, const std::set<T> &v) {
s << "\n";
for (auto &&elm : v) {
s << elm << "\t";
}
s << "\n";
return s;
}
inline void scan(int &a) { scanf("%d", &a); }
inline void scan(ll &a) { scanf("%lld", &a); }
inline void scan(char &a) { scanf(" %c", &a); }
inline void scan(double &a) { scanf("%lf", &a); }
inline void scan(std::string &s) {
char BUF[3000000];
scanf(" %s", BUF);
s = std::string(BUF);
}
template <typename T> inline void scan(std::vector<T> &v) {
for (auto &&sv : v) {
scan(sv);
}
}
template <typename First, typename... Args>
inline void scan(First &f, Args &...args) {
scan(f);
scan(args...);
}
inline void print(int a) { printf("%d\n", a); }
inline void print(ll a) { printf("%lld\n", a); }
inline void print(double a) { printf("%.12f\n", a); }
inline void print(std::string s) { std::cout << s << "\n"; }
using namespace std;
void test() {
int m = 50;
int mm = m * (m + 1) / 2 + 10;
vi a(m);
rep(i, m) { a[i] = i + 1; }
vvll dp(m + 1, vll(mm, 0));
dp[0][0] = 1;
rep(i, m) {
dp[i + 1] = dp[i];
rep(j, mm) {
if (j + a[i] >= mm) {
break;
}
dp[i + 1][j + a[i]] += dp[i][j];
}
}
debug(dp[m]);
}
int mod = 998244353;
int main() {
int n;
scan(n);
vi a(n);
scan(a);
int sum_all = 0;
rep(i, n) { sum_all += a[i]; }
vvll dp(n + 1, vll(sum_all + 1, 0));
dp[0][0] = 1;
rep(i, n) {
rep(j, sum_all + 1) { dp[i + 1][j] = dp[i][j] * 2 % mod; }
rep(j, sum_all + 1) {
int j2 = j + a[i];
if (j2 > sum_all) {
break;
}
dp[i + 1][j2] = (dp[i + 1][j2] + dp[i][j]) % mod;
}
}
ll ans = 1;
rep(i, n) { ans = ans * 3 % mod; }
int sum_half = (sum_all + 1) / 2;
FOR(i, sum_half, sum_all + 1) { ans = (ans + (mod - dp[n][i]) * 3) % mod; }
// debug(dp);
if (sum_all % 2 == 0) {
vvll dp2(n + 1, vll(sum_half + 1, 0));
dp2[0][0] = 1;
rep(i, n) {
dp2[i + 1] = dp2[i];
rep(j, sum_half + 1) {
int j2 = j + a[i];
if (j2 > sum_half) {
break;
}
dp2[i + 1][j2] = (dp2[i + 1][j2] + dp2[i][j]) % mod;
}
}
// debug(dp2);
ll target = dp2[n][sum_half] * 3;
ans = (ans + target) % mod;
}
assert(ans > 0);
print(ans);
return 0;
}
| #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define FOR(i, k, n) for (int(i) = (k); (i) < (n); ++(i))
#define rep(i, n) FOR(i, 0, n)
#define all(v) begin(v), end(v)
#define debug(x) // std::cerr<<#x<<": "<<x<<"\n"
#define debug2(x, y) // std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<"\n"
#define debug3( \
x, y, \
z) // std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<", "<<#z<<": "<<z<<"\n"
using ll = long long;
using vi = std::vector<int>;
using vvi = std::vector<vi>;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
template <typename T> using vvec = std::vector<std::vector<T>>;
template <typename T> auto make_v(size_t sz) { return std::vector<T>(sz); }
template <typename T, typename... Ts> auto make_v(size_t sz, Ts... ts) {
return std::vector<decltype(make_v<T>(ts...))>(sz, make_v<T>(ts...));
}
template <typename T> void fill_v(T &var, const T &x) { var = x; }
template <typename V, typename T> void fill_v(V &v, const T &x) {
for (auto &&w : v) {
fill_v(w, x);
}
}
template <typename T>
std::ostream &operator<<(std::ostream &s, const std::vector<T> &v) {
int sz = v.size();
s << "\n";
rep(i, sz) {
s << v[i];
if (i < sz - 1) {
s << "\t";
}
}
s << "\n";
return s;
}
template <typename T>
std::ostream &operator<<(std::ostream &s,
const std::vector<std::vector<T>> &v) {
for (auto &&w : v) {
s << w;
}
return s;
}
template <typename T>
std::ostream &operator<<(std::ostream &s, const std::deque<T> &v) {
int sz = v.size();
s << "\n";
rep(i, sz) {
s << v[i];
if (i < sz - 1) {
s << "\t";
}
}
s << "\n";
return s;
}
template <typename T>
std::ostream &operator<<(std::ostream &s, const std::deque<std::deque<T>> &v) {
for (auto &&w : v) {
s << w;
}
return s;
}
template <typename T>
std::ostream &operator<<(std::ostream &s, const std::set<T> &v) {
s << "\n";
for (auto &&elm : v) {
s << elm << "\t";
}
s << "\n";
return s;
}
inline void scan(int &a) { scanf("%d", &a); }
inline void scan(ll &a) { scanf("%lld", &a); }
inline void scan(char &a) { scanf(" %c", &a); }
inline void scan(double &a) { scanf("%lf", &a); }
inline void scan(std::string &s) {
char BUF[3000000];
scanf(" %s", BUF);
s = std::string(BUF);
}
template <typename T> inline void scan(std::vector<T> &v) {
for (auto &&sv : v) {
scan(sv);
}
}
template <typename First, typename... Args>
inline void scan(First &f, Args &...args) {
scan(f);
scan(args...);
}
inline void print(int a) { printf("%d\n", a); }
inline void print(ll a) { printf("%lld\n", a); }
inline void print(double a) { printf("%.12f\n", a); }
inline void print(std::string s) { std::cout << s << "\n"; }
using namespace std;
void test() {
int m = 50;
int mm = m * (m + 1) / 2 + 10;
vi a(m);
rep(i, m) { a[i] = i + 1; }
vvll dp(m + 1, vll(mm, 0));
dp[0][0] = 1;
rep(i, m) {
dp[i + 1] = dp[i];
rep(j, mm) {
if (j + a[i] >= mm) {
break;
}
dp[i + 1][j + a[i]] += dp[i][j];
}
}
debug(dp[m]);
}
int mod = 998244353;
int main() {
int n;
scan(n);
vi a(n);
scan(a);
int sum_all = 0;
rep(i, n) { sum_all += a[i]; }
vvll dp(n + 1, vll(sum_all + 1, 0));
dp[0][0] = 1;
rep(i, n) {
rep(j, sum_all + 1) { dp[i + 1][j] = dp[i][j] * 2 % mod; }
rep(j, sum_all + 1) {
int j2 = j + a[i];
if (j2 > sum_all) {
break;
}
dp[i + 1][j2] = (dp[i + 1][j2] + dp[i][j]) % mod;
}
}
ll ans = 1;
rep(i, n) { ans = ans * 3 % mod; }
int sum_half = (sum_all + 1) / 2;
FOR(i, sum_half, sum_all + 1) { ans = (ans + (mod - dp[n][i]) * 3) % mod; }
// debug(dp);
if (sum_all % 2 == 0) {
vvll dp2(n + 1, vll(sum_half + 1, 0));
dp2[0][0] = 1;
rep(i, n) {
dp2[i + 1] = dp2[i];
rep(j, sum_half + 1) {
int j2 = j + a[i];
if (j2 > sum_half) {
break;
}
dp2[i + 1][j2] = (dp2[i + 1][j2] + dp2[i][j]) % mod;
}
}
// debug(dp2);
ll target = dp2[n][sum_half] * 3;
ans = (ans + target) % mod;
}
assert(ans >= 0);
print(ans);
return 0;
}
| [
"expression.operator.compare.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 880,842 | 880,843 | u500496457 | cpp |
p03064 | #include <iostream>
#include <vector>
typedef long long TI;
std::vector<TI> cdp(std::vector<TI> A, TI S, TI m, TI Mod) {
TI N = A.size();
auto dp = std::vector<std::vector<TI>>(N + 1);
for (TI i = 0; i <= N; ++i) {
dp[i] = std::vector<TI>(S + 1, 0);
}
dp[0][0] = 1;
TI t = 0;
for (TI i = 0; i < N; ++i) {
auto a = A[i];
for (TI s = 0; s <= t; ++s) {
auto n = dp[i][s];
dp[i + 1][s + a] = (dp[i + 1][s + a] + n) % Mod;
dp[i + 1][s] = (dp[i + 1][s] + m * n) % Mod;
}
t += a;
}
return dp[N];
}
int main() {
TI Mod = 998244353;
TI N;
std::vector<TI> A;
std::cin >> N;
for (TI i = 0; i < N; ++i) {
TI a;
std::cin >> a;
A.push_back(a);
}
TI Z = 1;
TI S = 0;
for (TI i = 0; i < N; ++i) {
Z = Z * 3 % Mod;
S += A[i];
}
auto D1 = cdp(A, S, 2, Mod);
TI X = 0;
for (TI s = (S + 1) / 2; s <= S; ++s) {
X = (X + D1[s]) % Mod;
}
TI Y = 0;
if (S % 2 == 0) {
Y = cdp(A, S, 1, Mod)[S / 2] % Mod;
}
auto ans = Z - 3 * (X - Y);
if (ans < 0) {
ans += Mod;
}
ans %= Mod;
std::cout << ans << std::endl;
}
| #include <iostream>
#include <vector>
typedef long long TI;
std::vector<TI> cdp(std::vector<TI> A, TI S, TI m, TI Mod) {
TI N = A.size();
auto dp = std::vector<std::vector<TI>>(N + 1);
for (TI i = 0; i <= N; ++i) {
dp[i] = std::vector<TI>(S + 1, 0);
}
dp[0][0] = 1;
TI t = 0;
for (TI i = 0; i < N; ++i) {
auto a = A[i];
for (TI s = 0; s <= t; ++s) {
auto n = dp[i][s];
dp[i + 1][s + a] = (dp[i + 1][s + a] + n) % Mod;
dp[i + 1][s] = (dp[i + 1][s] + m * n) % Mod;
}
t += a;
}
return dp[N];
}
int main() {
TI Mod = 998244353;
TI N;
std::vector<TI> A;
std::cin >> N;
for (TI i = 0; i < N; ++i) {
TI a;
std::cin >> a;
A.push_back(a);
}
TI Z = 1;
TI S = 0;
for (TI i = 0; i < N; ++i) {
Z = Z * 3 % Mod;
S += A[i];
}
auto D1 = cdp(A, S, 2, Mod);
TI X = 0;
for (TI s = (S + 1) / 2; s <= S; ++s) {
X = (X + D1[s]) % Mod;
}
TI Y = 0;
if (S % 2 == 0) {
Y = cdp(A, S, 1, Mod)[S / 2] % Mod;
}
auto ans = Z - 3 * (X - Y);
while (ans < 0) {
ans += Mod;
}
ans %= Mod;
std::cout << ans << std::endl;
}
| [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove"
] | 880,875 | 880,876 | u670503797 | cpp |
p03064 | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
using ll = long long;
const ll mod = 998244353;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REP_FROM(i, j, n) for (int i = (j); i < (n); ++i)
#define all(x) (x).begin(), (x).end()
ll power(ll base, ll exponent, ll module) {
if (exponent % 2) {
return power(base, exponent - 1, module) * base % module;
} else if (exponent) {
ll root_ans = power(base, exponent / 2, module);
return root_ans * root_ans % module;
} else {
return 1;
}
}
ll inverse(ll x) { return power(x, mod - 2, mod); }
struct combination {
vector<ll> fact, inv;
combination(int sz) : fact(sz + 1), inv(sz + 1) {
fact[0] = 1;
for (int i = 1; i <= sz; i++) {
fact[i] = fact[i - 1] * i % mod;
}
inv[sz] = power(fact[sz], mod - 2, mod);
for (int i = sz - 1; i >= 0; i--) {
inv[i] = inv[i + 1] * (i + 1) % mod;
}
}
ll C(int p, int q) const {
if (q < 0 || p < q)
return 0;
return (fact[p] * inv[q] % mod * inv[p - q] % mod);
}
};
combination table(300);
ll sum_a;
ll lower_invalid;
ll dp[301][300 * 301];
ll dp2[301][300 * 301];
signed main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<ll> a(n);
REP(i, n) cin >> a[i];
REP(i, n) sum_a += a[i];
// cout << sum_a << endl;
lower_invalid = sum_a / 2 + (sum_a % 2 == 0 ? 0 : 1);
ll db[301], tr[301];
tr[0] = 1;
db[0] = 1;
REP(i, 300) {
tr[i + 1] = tr[i] * 3 % mod;
db[i + 1] = db[i] * 2 % mod;
}
ll ans = 0;
dp[0][0] = 1;
ll even = 0;
// cout << lower_invalid << endl;
REP(i, n) {
REP(j, lower_invalid) {
dp[i + 1][j] += dp[i][j] * 2;
dp[i + 1][j] %= mod;
dp[i + 1][j + a[i]] += dp[i][j];
dp[i + 1][j + a[i]] %= mod;
// if((j + a[i]) * 2 == sum_a) {
// ll tmp = ((tr[n-i-1] - 1) * dp[i][j]) % mod;
// ans += tmp;
// ans %= mod;
// } else
if (j + a[i] >= lower_invalid) {
ll tmp = tr[n - i - 1] * dp[i][j] % mod;
// cout << tmp << " " << i << j << endl;
ans += tmp;
ans %= mod;
}
}
// dp[i+1][lower_invalid] += dp[i][lower_invalid] * 2;
}
// if(sum_a % 2 == 0) even = dp[n][lower_invalid];
if (sum_a % 2 == 0) {
dp2[0][0] = 1;
REP(i, n) {
REP(j, sum_a / 2 + 1) {
dp2[i + 1][j] += dp2[i][j];
dp2[i + 1][j] %= mod;
dp2[i + 1][j + a[i]] += dp2[i][j];
dp2[i + 1][j + a[i]] %= mod;
}
}
even = dp[n][sum_a / 2];
}
ans = tr[n] - (ans * 3) % mod + even;
if (ans < 0) {
ans += mod;
}
ans %= mod;
cout << ans << endl;
// REP(i, n+1) {
// REP(j, lower_invalid+10) {
// cout << dp[i][j] << " ";
// }
// cout << endl;
// }
return 0;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
using ll = long long;
const ll mod = 998244353;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REP_FROM(i, j, n) for (int i = (j); i < (n); ++i)
#define all(x) (x).begin(), (x).end()
ll power(ll base, ll exponent, ll module) {
if (exponent % 2) {
return power(base, exponent - 1, module) * base % module;
} else if (exponent) {
ll root_ans = power(base, exponent / 2, module);
return root_ans * root_ans % module;
} else {
return 1;
}
}
ll inverse(ll x) { return power(x, mod - 2, mod); }
struct combination {
vector<ll> fact, inv;
combination(int sz) : fact(sz + 1), inv(sz + 1) {
fact[0] = 1;
for (int i = 1; i <= sz; i++) {
fact[i] = fact[i - 1] * i % mod;
}
inv[sz] = power(fact[sz], mod - 2, mod);
for (int i = sz - 1; i >= 0; i--) {
inv[i] = inv[i + 1] * (i + 1) % mod;
}
}
ll C(int p, int q) const {
if (q < 0 || p < q)
return 0;
return (fact[p] * inv[q] % mod * inv[p - q] % mod);
}
};
combination table(300);
ll sum_a;
ll lower_invalid;
ll dp[301][300 * 301];
ll dp2[301][300 * 301];
signed main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<ll> a(n);
REP(i, n) cin >> a[i];
REP(i, n) sum_a += a[i];
// cout << sum_a << endl;
lower_invalid = sum_a / 2 + (sum_a % 2 == 0 ? 0 : 1);
ll db[301], tr[301];
tr[0] = 1;
db[0] = 1;
REP(i, 300) {
tr[i + 1] = tr[i] * 3 % mod;
db[i + 1] = db[i] * 2 % mod;
}
ll ans = 0;
dp[0][0] = 1;
ll even = 0;
// cout << lower_invalid << endl;
REP(i, n) {
REP(j, lower_invalid) {
dp[i + 1][j] += dp[i][j] * 2;
dp[i + 1][j] %= mod;
dp[i + 1][j + a[i]] += dp[i][j];
dp[i + 1][j + a[i]] %= mod;
// if((j + a[i]) * 2 == sum_a) {
// ll tmp = ((tr[n-i-1] - 1) * dp[i][j]) % mod;
// ans += tmp;
// ans %= mod;
// } else
if (j + a[i] >= lower_invalid) {
ll tmp = tr[n - i - 1] * dp[i][j] % mod;
// cout << tmp << " " << i << j << endl;
ans += tmp;
ans %= mod;
}
}
// dp[i+1][lower_invalid] += dp[i][lower_invalid] * 2;
}
// if(sum_a % 2 == 0) even = dp[n][lower_invalid];
if (sum_a % 2 == 0) {
dp2[0][0] = 1;
REP(i, n) {
REP(j, sum_a / 2 + 1) {
dp2[i + 1][j] += dp2[i][j];
dp2[i + 1][j] %= mod;
dp2[i + 1][j + a[i]] += dp2[i][j];
dp2[i + 1][j + a[i]] %= mod;
}
}
even = dp2[n][sum_a / 2] * 3 % mod;
}
ans = tr[n] - (ans * 3) % mod + even;
if (ans < 0) {
ans += mod;
}
ans %= mod;
cout << ans << endl;
// REP(i, n+1) {
// REP(j, lower_invalid+10) {
// cout << dp[i][j] << " ";
// }
// cout << endl;
// }
// cout << "=====" << endl;
// REP(i, n+1) {
// REP(j, lower_invalid+10) {
// cout << dp2[i][j] << " ";
// }
// cout << endl;
// }
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"assignment.change"
] | 880,885 | 880,886 | u702582248 | cpp |
p03064 | #include <iomanip>
#include <iostream>
//#include<cstdio>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
const ll P = 998244353;
int N;
const int Nmax = 300;
int A[Nmax];
int main() {
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
int S = 0;
for (int i = 0; i < N; i++)
S += A[i];
vector<vector<ll>> dp(N + 1, vector<ll>(S + 1));
for (int i = 0; i <= N; i++)
dp[i][0] = 1;
for (int i = 0; i < N; i++) {
for (int j = 0; j <= S; j++) {
dp[i + 1][j] = 2 * dp[i][j];
if (j >= A[i])
dp[i + 1][j] += dp[i][j - A[i]];
dp[i + 1][j] %= P;
}
}
vector<vector<ll>> dp1(N + 1, vector<ll>(S + 1));
for (int i = 0; i <= N; i++)
dp1[i][0] = 1;
for (int i = 0; i < N; i++) {
for (int j = 0; j <= S; j++) {
dp1[i + 1][j] = dp1[i][j];
if (j >= A[i])
dp1[i + 1][j] += dp1[i][j - A[i]];
dp1[i + 1][j] %= P;
}
}
// for(int j=0; j<=N; j++) for(int i=0; i<=S; i++) cout << dp[j][i] <<
// (i==S?'\n':' '); for(int j=0; j<=N; j++) for(int i=0; i<=S; i++) cout <<
// dp1[j][i] << (i==S?'\n':' ');
ll ans = 1;
for (int i = 0; i < N; i++)
ans = 3 * ans % P;
ll x = 0;
for (int i = (S + 1) / 2; i <= S; i++)
x += dp[N][i];
if (S % 2 == 0)
x = (x - dp1[N][S / 2] + P) % P;
// cout << x << " " << dp1[N][S/2] << endl;
ans = (ans - 3 * x + P) % P;
cout << ans << endl;
return 0;
}
| #include <iomanip>
#include <iostream>
//#include<cstdio>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
const ll P = 998244353;
int N;
const int Nmax = 300;
int A[Nmax];
int main() {
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
int S = 0;
for (int i = 0; i < N; i++)
S += A[i];
vector<vector<ll>> dp(N + 1, vector<ll>(S + 1));
for (int i = 0; i <= N; i++)
dp[i][0] = 1;
for (int i = 0; i < N; i++) {
for (int j = 0; j <= S; j++) {
dp[i + 1][j] = 2 * dp[i][j];
if (j >= A[i])
dp[i + 1][j] += dp[i][j - A[i]];
dp[i + 1][j] %= P;
}
}
vector<vector<ll>> dp1(N + 1, vector<ll>(S + 1));
for (int i = 0; i <= N; i++)
dp1[i][0] = 1;
for (int i = 0; i < N; i++) {
for (int j = 0; j <= S; j++) {
dp1[i + 1][j] = dp1[i][j];
if (j >= A[i])
dp1[i + 1][j] += dp1[i][j - A[i]];
dp1[i + 1][j] %= P;
}
}
// for(int j=0; j<=N; j++) for(int i=0; i<=S; i++) cout << dp[j][i] <<
// (i==S?'\n':' '); for(int j=0; j<=N; j++) for(int i=0; i<=S; i++) cout <<
// dp1[j][i] << (i==S?'\n':' ');
ll ans = 1;
for (int i = 0; i < N; i++)
ans = 3 * ans % P;
ll x = 0;
for (int i = (S + 1) / 2; i <= S; i++)
x += dp[N][i];
if (S % 2 == 0)
x = (x - dp1[N][S / 2] + P) % P;
// cout << x << " " << dp1[N][S/2] << endl;
ans = (ans - 3 * x % P + P) % P;
cout << ans << endl;
return 0;
}
| [
"assignment.change"
] | 880,902 | 880,903 | u534998883 | cpp |
p03064 | #include <iomanip>
#include <iostream>
//#include<cstdio>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
const int P = 998244353;
int N;
const int Nmax = 300;
int A[Nmax];
int main() {
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
int S = 0;
for (int i = 0; i < N; i++)
S += A[i];
vector<vector<ll>> dp(N + 1, vector<ll>(S + 1));
for (int i = 0; i <= N; i++)
dp[i][0] = 1;
for (int i = 0; i < N; i++) {
for (int j = 0; j <= S; j++) {
dp[i + 1][j] = 2 * dp[i][j];
if (j >= A[i])
dp[i + 1][j] += dp[i][j - A[i]];
dp[i + 1][j] %= P;
}
}
vector<vector<ll>> dp1(N + 1, vector<ll>(S + 1));
for (int i = 0; i <= N; i++)
dp1[i][0] = 1;
for (int i = 0; i < N; i++) {
for (int j = 0; j <= 2 * S; j++) {
dp1[i + 1][j] = dp1[i][j];
if (j >= A[i])
dp1[i + 1][j] += dp1[i][j - A[i]];
dp1[i + 1][j] %= P;
}
}
// for(int j=0; j<=N; j++) for(int i=0; i<=S; i++) cout << dp[j][i] <<
// (i==S?'\n':' '); for(int j=0; j<=N; j++) for(int i=0; i<=S; i++) cout <<
// dp1[j][i] << (i==S?'\n':' ');
ll ans = 1;
for (int i = 0; i < N; i++)
ans = 3 * ans % P;
ll x = 0;
for (int i = (S + 1) / 2; i <= S; i++)
x += dp[N][i];
if (S % 2 == 0)
x = (x - dp1[N][S / 2] + P) % P;
// cout << x << " " << dp1[N][S/2] << endl;
ans = (ans - 3 * x + P) % P;
cout << ans << endl;
return 0;
}
| #include <iomanip>
#include <iostream>
//#include<cstdio>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
const ll P = 998244353;
int N;
const int Nmax = 300;
int A[Nmax];
int main() {
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
int S = 0;
for (int i = 0; i < N; i++)
S += A[i];
vector<vector<ll>> dp(N + 1, vector<ll>(S + 1));
for (int i = 0; i <= N; i++)
dp[i][0] = 1;
for (int i = 0; i < N; i++) {
for (int j = 0; j <= S; j++) {
dp[i + 1][j] = 2 * dp[i][j];
if (j >= A[i])
dp[i + 1][j] += dp[i][j - A[i]];
dp[i + 1][j] %= P;
}
}
vector<vector<ll>> dp1(N + 1, vector<ll>(S + 1));
for (int i = 0; i <= N; i++)
dp1[i][0] = 1;
for (int i = 0; i < N; i++) {
for (int j = 0; j <= S; j++) {
dp1[i + 1][j] = dp1[i][j];
if (j >= A[i])
dp1[i + 1][j] += dp1[i][j - A[i]];
dp1[i + 1][j] %= P;
}
}
// for(int j=0; j<=N; j++) for(int i=0; i<=S; i++) cout << dp[j][i] <<
// (i==S?'\n':' '); for(int j=0; j<=N; j++) for(int i=0; i<=S; i++) cout <<
// dp1[j][i] << (i==S?'\n':' ');
ll ans = 1;
for (int i = 0; i < N; i++)
ans = 3 * ans % P;
ll x = 0;
for (int i = (S + 1) / 2; i <= S; i++)
x += dp[N][i];
if (S % 2 == 0)
x = (x - dp1[N][S / 2] + P) % P;
// cout << x << " " << dp1[N][S/2] << endl;
ans = (ans - 3 * x % P + P) % P;
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"assignment.change"
] | 880,904 | 880,903 | u534998883 | cpp |
p03064 | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long dp[305][90005] = {}, dp2[305][90005] = {}, res = 0;
long long int rui(long long int a, long long int b, long long mod) {
int memo[65] = {};
long long int A[65] = {};
long long int tmp = 1;
for (int i = 0; i < 65; i++) {
memo[i] = b % 2;
b /= 2;
}
A[0] = a;
A[0] %= mod;
for (int i = 1; i < 65; i++) {
A[i] = A[i - 1] * A[i - 1];
A[i] %= mod;
}
for (int i = 0; i < 65; i++) {
if (memo[i] == 1) {
tmp *= A[i];
tmp %= mod;
}
}
tmp %= mod;
return tmp;
}
int main() {
map<long long int, long long int> mp;
// cout << fixed << setprecision(10);
long long int n, m = 0, a[200005] = {}, p[200005] = {}, sosu[100005], sum = 0,
d, w, h;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum += a[i];
}
dp[0][0] = 1;
dp2[0][0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= sum; j++) {
dp[i][j + a[i]] += dp[i - 1][j];
dp[i][j] += 2 * dp[i - 1][j];
dp[i][j] %= 998244353;
dp2[i][j + a[i]] += dp2[i - 1][j];
dp2[i][j] += dp2[i - 1][j];
dp2[i][j] %= 998244353;
}
}
res = rui(3, n, 998244353);
for (int j = sum; j * 2 >= sum; j--) {
res -= 3 * dp[n][j];
res = (res + 998244353) % 998244353;
if (j * 2 == sum) {
res += 3 * dp2[n][j];
}
}
cout << res;
}
| #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long dp[305][90005] = {}, dp2[305][90005] = {}, res = 0;
long long int rui(long long int a, long long int b, long long mod) {
int memo[65] = {};
long long int A[65] = {};
long long int tmp = 1;
for (int i = 0; i < 65; i++) {
memo[i] = b % 2;
b /= 2;
}
A[0] = a;
A[0] %= mod;
for (int i = 1; i < 65; i++) {
A[i] = A[i - 1] * A[i - 1];
A[i] %= mod;
}
for (int i = 0; i < 65; i++) {
if (memo[i] == 1) {
tmp *= A[i];
tmp %= mod;
}
}
tmp %= mod;
return tmp;
}
int main() {
map<long long int, long long int> mp;
// cout << fixed << setprecision(10);
long long int n, m = 0, a[200005] = {}, p[200005] = {}, sosu[100005], sum = 0,
d, w, h;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum += a[i];
}
dp[0][0] = 1;
dp2[0][0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= sum; j++) {
dp[i][j + a[i]] += dp[i - 1][j];
dp[i][j] += 2 * dp[i - 1][j];
dp[i][j] %= 998244353;
dp2[i][j + a[i]] += dp2[i - 1][j];
dp2[i][j] += dp2[i - 1][j];
dp2[i][j] %= 998244353;
}
}
res = rui(3, n, 998244353);
for (int j = sum; j * 2 >= sum; j--) {
res -= 3 * dp[n][j];
res = (res % 998244353) + 998244353;
if (j * 2 == sum) {
res += 3 * dp2[n][j];
}
}
cout << res % 998244353;
}
| [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 880,922 | 880,921 | u018872912 | cpp |
p03064 | #include <bits/stdc++.h>
#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if (!(p))
#define until(p) while (!(p))
using ll = std::int64_t;
using P = std::tuple<int, int>;
template <typename T> T mod_expt(T a, std::int64_t n, T mod) {
T power{1};
while (n > 0) {
if (n & 1) {
power = power * a % mod;
}
a = a * a % mod;
n >>= 1;
}
return power;
}
constexpr ll MOD = 998244353ll;
int N, S;
int A[310];
ll dp[310][310 * 310], dp2[310][310 * 310];
ll rec(int i, int s) {
if (i == N) {
return (2 * s >= S) ? 1 : 0;
}
if (dp[i][s] != -1) {
return dp[i][s];
}
return dp[i][s] = (rec(i + 1, s + A[i]) + 2ll * rec(i + 1, s) % MOD) % MOD;
}
ll rec2(int i, int s) {
if (i == N) {
return (2 * s == S) ? 1 : 0;
}
if (dp2[i][s] != -1) {
return dp2[i][s];
}
return dp2[i][s] = (rec2(i + 1, s + A[i]) + rec2(i + 1, s)) % MOD;
}
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
std::cin >> N;
for (int i = 0; i < N; ++i) {
std::cin >> A[i];
}
S = std::accumulate(A, A + N, 0);
memset(dp, -1, sizeof(dp));
memset(dp2, -1, sizeof(dp));
ll res =
(mod_expt<ll>(3ll, N, MOD) + MOD - 3ll * rec(0, 0) + 3ll * rec2(0, 0)) %
MOD;
std::cout << res << std::endl;
}
| #include <bits/stdc++.h>
#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if (!(p))
#define until(p) while (!(p))
using ll = std::int64_t;
using P = std::tuple<int, int>;
template <typename T> T mod_expt(T a, std::int64_t n, T mod) {
T power{1};
while (n > 0) {
if (n & 1) {
power = power * a % mod;
}
a = a * a % mod;
n >>= 1;
}
return power;
}
constexpr ll MOD = 998244353ll;
int N, S;
int A[310];
ll dp[310][310 * 310], dp2[310][310 * 310];
ll rec(int i, int s) {
if (i == N) {
return (2 * s >= S) ? 1 : 0;
}
if (dp[i][s] != -1) {
return dp[i][s];
}
return dp[i][s] = (rec(i + 1, s + A[i]) + 2ll * rec(i + 1, s) % MOD) % MOD;
}
ll rec2(int i, int s) {
if (i == N) {
return (2 * s == S) ? 1 : 0;
}
if (dp2[i][s] != -1) {
return dp2[i][s];
}
return dp2[i][s] = (rec2(i + 1, s + A[i]) + rec2(i + 1, s)) % MOD;
}
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
std::cin >> N;
for (int i = 0; i < N; ++i) {
std::cin >> A[i];
}
S = std::accumulate(A, A + N, 0);
memset(dp, -1, sizeof(dp));
memset(dp2, -1, sizeof(dp));
ll res = (mod_expt<ll>(3ll, N, MOD) + MOD - 3ll * rec(0, 0) % MOD +
3ll * rec2(0, 0)) %
MOD;
std::cout << res << std::endl;
}
| [
"assignment.change"
] | 880,929 | 880,930 | u764058295 | cpp |
p03064 | #include <cstdint>
#include <iostream>
using namespace std; // 575
const int MAX = 301;
const int MAX2 = 90001;
const int MOD = 998244353;
int64_t pow(int64_t a, int b) {
if (b == 0)
return 1;
if (b == 1)
return a;
if (b == 2)
return a * a % MOD;
return pow(pow(a, b >> 1), 2) * pow(a, b & 1) % MOD;
}
int main() {
int N, a[MAX2];
cin >> N;
for (int i = 0; i < N; ++i)
cin >> a[i];
static int64_t sum = 0, dp[MAX][MAX2], dp2[MAX][MAX2], ans = 0;
for (int i = 0; i < N; ++i)
sum += a[i];
for (int i = 0; i < MAX2; ++i)
dp[0][i] = dp2[0][i] = 0;
dp[0][0] = dp2[0][0] = 1;
for (int i = 0; i < N; ++i) {
for (int j = 0; j < a[i]; ++j) {
dp[i + 1][j] = (dp[i][j] * 2) % MOD;
dp2[i + 1][j] = dp2[i][j];
}
for (int j = a[i]; j <= sum; ++j) {
dp[i + 1][j] = (dp[i][j - a[i]] + dp[i][j] * 2) % MOD;
dp2[i + 1][j] = (dp2[i][j - a[i]] + dp2[i][j]) % MOD;
}
}
for (int i = sum + 1 >> 1; i <= sum; ++i)
ans += dp[N][i] * 3;
if (sum % 2 == 0)
(ans -= dp2[N][sum / 2] * 3) %= MOD;
cout << (pow(3, N) - ans + MOD) % MOD;
return 0;
}
/*
31536000ใฎใณใกใณใ่งฃ่ชฌๆฌ
ใใใใณใใฌใง็จๆใใฆใใใใAๅ้กใจใใ ใจใใฎๅ
็ฉบๆฌใฎๅฑ้บใใ
ใพใใใณใณใในใๅพใซ https://31536000.hatenablog.com/
ใง่งฃ่ชฌใใฆใใใจๆใใฎใงใ่ฏใใฃใใ่ชญใใงใญใผ
RโงG,Bใจใใฆใไธ่ฌๆงใๅคฑใใชใ
โฆโฆ่งฃ่ชฌ่ฆใใRโงS/2ใ ใ้คๅคใใใ็ตใใ๏ผใชใฎใโฆโฆๆฒใใใญ
*/ | #include <cstdint>
#include <iostream>
using namespace std; // 575
const int MAX = 301;
const int MAX2 = 90001;
const int MOD = 998244353;
int64_t pow(int64_t a, int b) {
if (b == 0)
return 1;
if (b == 1)
return a;
if (b == 2)
return a * a % MOD;
return pow(pow(a, b >> 1), 2) * pow(a, b & 1) % MOD;
}
int main() {
int N, a[MAX2];
cin >> N;
for (int i = 0; i < N; ++i)
cin >> a[i];
static int64_t sum = 0, dp[MAX][MAX2], dp2[MAX][MAX2], ans = 0;
// dp[i][j]ใฏiๅใฎ่ฆ็ด ใ3่ฒใซๅกใๅใใใจใใ็ด
่ฒใjใจใชใใใใชใใฎใฎๅๆฐ
// dp2[i][j]ใฏiๅใฎ่ฆ็ด ใ2่ฒใซๅกใๅใใใจใใ็ด
่ฒใjใจใชใใใใชใใฎใฎๅๆฐ
for (int i = 0; i < N; ++i)
sum += a[i];
for (int i = 0; i < MAX2; ++i)
dp[0][i] = dp2[0][i] = 0;
dp[0][0] = dp2[0][0] = 1;
for (int i = 0; i < N; ++i) {
for (int j = 0; j < a[i]; ++j) {
dp[i + 1][j] = (dp[i][j] * 2) % MOD;
dp2[i + 1][j] = dp2[i][j];
}
for (int j = a[i]; j <= sum; ++j) {
dp[i + 1][j] = (dp[i][j - a[i]] + dp[i][j] * 2) % MOD;
dp2[i + 1][j] = (dp2[i][j - a[i]] + dp2[i][j]) % MOD;
}
}
for (int i = sum + 1 >> 1; i <= sum; ++i)
(ans += dp[N][i] * 3) %= MOD;
if (sum % 2 == 0)
(ans -= dp2[N][sum / 2] * 3) %= MOD;
cout << (pow(3, N) - ans + MOD) % MOD;
return 0;
}
/*
31536000ใฎใณใกใณใ่งฃ่ชฌๆฌ
ใใใใณใใฌใง็จๆใใฆใใใใAๅ้กใจใใ ใจใใฎๅ
็ฉบๆฌใฎๅฑ้บใใ
ใพใใใณใณใในใๅพใซ https://31536000.hatenablog.com/
ใง่งฃ่ชฌใใฆใใใจๆใใฎใงใ่ฏใใฃใใ่ชญใใงใญใผ
RโงG,Bใจใใฆใไธ่ฌๆงใๅคฑใใชใ
โฆโฆ่งฃ่ชฌ่ฆใใRโงS/2ใ ใ้คๅคใใใ็ตใใ๏ผใชใฎใโฆโฆๆฒใใใญ
*/ | [
"assignment.change"
] | 880,940 | 880,941 | u550314572 | cpp |
p03064 | #include <iostream>
using namespace std;
const int MOD = 998244353;
typedef long long ll;
ll dp[90001];
ll dp_[90001];
ll dp1[90001];
ll dp1_[90001];
void copy() {
for (int i = 0; i <= 90001; i++) {
dp_[i] = dp[i];
dp1_[i] = dp1[i];
}
}
int main() {
int N;
int a[300];
ll ans;
cin >> N;
ll sum = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
sum += a[i];
}
ans = 1;
for (int i = 0; i < N; i++) {
ans = ans * 3;
ans %= MOD;
}
dp[0] = 1;
dp1[0] = 1;
for (int i = 0; i < N; i++) {
copy();
for (int j = 0; j <= 90000; j++) {
dp[j] *= 2;
dp[j] %= MOD;
}
for (int j = 0; j + a[i] <= 90000; j++) {
dp[j + a[i]] += dp_[j];
dp[j + a[i]] %= MOD;
dp1[j + a[i]] += dp1_[j];
dp1[j + a[i]] %= MOD;
}
}
for (int i = (sum + 1) / 2; i <= 90000; i++) {
ans -= dp[i] * 3;
ans %= MOD;
ans += MOD;
ans %= MOD;
}
if (sum % 2 == 0) {
ans += 3 * dp1[sum / 2];
}
// cout << dp1[sum/2] << endl;
cout << ans << endl;
} | #include <iostream>
using namespace std;
const int MOD = 998244353;
typedef long long ll;
ll dp[90001];
ll dp_[90001];
ll dp1[90001];
ll dp1_[90001];
void copy() {
for (int i = 0; i <= 90001; i++) {
dp_[i] = dp[i];
dp1_[i] = dp1[i];
}
}
int main() {
int N;
int a[300];
ll ans;
cin >> N;
ll sum = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
sum += a[i];
}
ans = 1;
for (int i = 0; i < N; i++) {
ans = ans * 3;
ans %= MOD;
}
dp[0] = 1;
dp1[0] = 1;
for (int i = 0; i < N; i++) {
copy();
for (int j = 0; j <= 90000; j++) {
dp[j] *= 2;
dp[j] %= MOD;
}
for (int j = 0; j + a[i] <= 90000; j++) {
dp[j + a[i]] += dp_[j];
dp[j + a[i]] %= MOD;
dp1[j + a[i]] += dp1_[j];
dp1[j + a[i]] %= MOD;
}
}
for (int i = (sum + 1) / 2; i <= 90000; i++) {
ans -= dp[i] * 3;
ans %= MOD;
ans += MOD;
ans %= MOD;
}
if (sum % 2 == 0) {
ans += 3 * dp1[sum / 2];
}
ans %= MOD;
// cout << dp1[sum/2] << endl;
cout << ans << endl;
} | [
"assignment.add"
] | 880,942 | 880,943 | u693133807 | cpp |
p03071 | #include <stdio.h>
main() {
int a, b, sum;
scanf("%d %d", &a, &b);
if (a - b >= 1)
sum = 2 * a - 1;
else if (a - b <= 1)
sum = 2 * b - 1;
else
sum = a + b;
printf("%d", sum);
}
| #include <stdio.h>
main() {
int a, b, sum;
scanf("%d %d", &a, &b);
if (a - b >= 1)
sum = 2 * a - 1;
else if (a - b <= -1)
sum = 2 * b - 1;
else
sum = a + b;
printf("%d", sum);
}
| [
"control_flow.branch.if.condition.change"
] | 880,956 | 880,957 | u110688573 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
#define ll long long // long long็็ฅ
#define pb push_back // push_back็็ฅ
#define mp make_pair // make_pair็็ฅ
#define fi first // first็็ฅ
#define se second // second็็ฅ
#define itn int // int่ชคๅญไฟ้บ
#define count cout // cout่ชคๅญไฟ้บ
#define vecotr vector // vector่ชคๅญไฟ้บ
#define ednl endl // endl่ชคๅญไฟ้บ
#define opt() \
cin.tie(0); \
ios::sync_with_stdio(false) // ๅ
ฅๅบๅ้ๅบฆๆนๅ
#define rep(i, l, r) \
for (ll i = (l); i < (r); i++) // ็ฏๅฒ[l, r)ใงๅปใฟ1ใฎforๆ(้ ๆนๅ)
#define repp(i, l, r, k) \
for (ll i = (l); i < (r); i += (k)) // ็ฏๅฒ[l, r)ใงๅปใฟkใฎforๆ(้ ๆนๅ)
#define rrep(i, l, r) \
for (ll i = (r - 1); i >= (l); i--) // ็ฏๅฒ[l, r)ใงๅปใฟ1ใฎforๆ(้ๆนๅ)
#define rrepp(i, l, r, k) \
for (ll i = (r - 1); i >= (l); i -= (k)) // ็ฏๅฒ[l, r)ใงๅปใฟkใฎforๆ(้ๆนๅ)
#define all(x) (x).begin(), (x).end() // vectorใฎใใคใณใฟไฝ็ฝฎๆๅฎ็จ
#define max(p, q) ((p) > (q) ? (p) : (q)) // maxๆกๅผต
#define min(p, q) ((p) < (q) ? (p) : (q)) // minๆกๅผต
#define bit(n, m) (((n) >> (m)) & 1) // ๅคๆฐnใฎm็ช็ฎใฎbitใๅใๅบใ
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int dy[] = {0, 1, 0, -1}; // 4ๆนๅ่ฟๅ
int dx[] = {1, 0, -1, 0}; // 4ๆนๅ่ฟๅ
int main() {
ll a, b;
cin >> a >> b;
if (a == b)
cout << 2 * a << ednl;
else
cout << (a < b ? 2 * b : 2 * a) << ednl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long // long long็็ฅ
#define pb push_back // push_back็็ฅ
#define mp make_pair // make_pair็็ฅ
#define fi first // first็็ฅ
#define se second // second็็ฅ
#define itn int // int่ชคๅญไฟ้บ
#define count cout // cout่ชคๅญไฟ้บ
#define vecotr vector // vector่ชคๅญไฟ้บ
#define ednl endl // endl่ชคๅญไฟ้บ
#define opt() \
cin.tie(0); \
ios::sync_with_stdio(false) // ๅ
ฅๅบๅ้ๅบฆๆนๅ
#define rep(i, l, r) \
for (ll i = (l); i < (r); i++) // ็ฏๅฒ[l, r)ใงๅปใฟ1ใฎforๆ(้ ๆนๅ)
#define repp(i, l, r, k) \
for (ll i = (l); i < (r); i += (k)) // ็ฏๅฒ[l, r)ใงๅปใฟkใฎforๆ(้ ๆนๅ)
#define rrep(i, l, r) \
for (ll i = (r - 1); i >= (l); i--) // ็ฏๅฒ[l, r)ใงๅปใฟ1ใฎforๆ(้ๆนๅ)
#define rrepp(i, l, r, k) \
for (ll i = (r - 1); i >= (l); i -= (k)) // ็ฏๅฒ[l, r)ใงๅปใฟkใฎforๆ(้ๆนๅ)
#define all(x) (x).begin(), (x).end() // vectorใฎใใคใณใฟไฝ็ฝฎๆๅฎ็จ
#define max(p, q) ((p) > (q) ? (p) : (q)) // maxๆกๅผต
#define min(p, q) ((p) < (q) ? (p) : (q)) // minๆกๅผต
#define bit(n, m) (((n) >> (m)) & 1) // ๅคๆฐnใฎm็ช็ฎใฎbitใๅใๅบใ
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int dy[] = {0, 1, 0, -1}; // 4ๆนๅ่ฟๅ
int dx[] = {1, 0, -1, 0}; // 4ๆนๅ่ฟๅ
int main() {
ll a, b;
cin >> a >> b;
if (a == b)
cout << 2 * a << ednl;
else
cout << (a < b ? 2 * b - 1 : 2 * a - 1) << ednl;
}
| [
"expression.operation.binary.add"
] | 880,960 | 880,961 | u547754910 | cpp |
p03071 | #include <iostream>
//#include <iomanip>
//#include <algorithm>
//#include <numeric>
//#include <queue>
//#include <stack>
//#include <math.h>
//#include <vector>
//#include <string>
// typedef long long LL;
using namespace std;
int main() {
int a;
int b;
int ans = 0;
cin >> a >> b;
for (int i = 0; i < 2; i++) {
if (a > b) {
ans += a;
a--;
} else {
ans += b;
b--;
}
cout << ans << endl;
}
} | #include <iostream>
//#include <iomanip>
//#include <algorithm>
//#include <numeric>
//#include <queue>
//#include <stack>
//#include <math.h>
//#include <vector>
//#include <string>
// typedef long long LL;
using namespace std;
int main() {
int a;
int b;
int ans = 0;
cin >> a >> b;
for (int i = 0; i < 2; i++) {
if (a > b) {
ans += a;
a--;
} else {
ans += b;
b--;
}
}
cout << ans << endl;
} | [] | 880,962 | 880,963 | u755310927 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = max(a + b - 1, max(a + a - 1, b + b - 1));
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = max(a + b, max(a + a - 1, b + b - 1));
cout << ans << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 880,967 | 880,968 | u522506260 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = max(a + b - 2, max(a + a - 2, b + b - 2));
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = max(a + b, max(a + a - 1, b + b - 1));
cout << ans << endl;
return 0;
} | [
"expression.operation.binary.remove",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 880,969 | 880,968 | u522506260 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << max({A + B, A * 2, B * 2}) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << max({A + B, A * 2 - 1, B * 2 - 1}) << endl;
}
| [
"expression.operation.binary.add"
] | 880,970 | 880,971 | u979078704 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == b) {
cout << a + a;
}
if (a > b) {
cout << a + a - 1;
} else {
cout << b + b - 1;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == b) {
cout << a + b;
} else {
if (a > b) {
cout << a + a - 1;
} else {
cout << b + b - 1;
}
}
return 0;
}
| [
"identifier.change",
"io.output.change",
"control_flow.branch.else.add"
] | 880,976 | 880,977 | u562321612 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == b) {
cout << a + b;
}
if (a > b) {
cout << a + a - 1;
} else {
cout << b + b - 1;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == b) {
cout << a + b;
} else {
if (a > b) {
cout << a + a - 1;
} else {
cout << b + b - 1;
}
}
return 0;
}
| [
"control_flow.branch.else.add"
] | 880,978 | 880,977 | u562321612 | cpp |
p03071 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
int ans = max(b + b - 1, max(a + a - 1, a + b - 1));
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
int ans = max(b + b - 1, max(a + a - 1, a + b));
cout << ans << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 880,991 | 880,992 | u980485808 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main(void) {
int a, b;
cin >> a >> b;
if (a == b)
cout << max(a, b) * 2 - 1 << endl;
else
cout << max(a, b) * 2 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main(void) {
int a, b;
cin >> a >> b;
if (a == b)
cout << max(a, b) * 2 << endl;
else
cout << max(a, b) * 2 - 1 << endl;
return 0;
}
| [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"control_flow.branch.else.remove"
] | 880,993 | 880,994 | u326152409 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int coin = 0;
if (a > b) {
coin += a;
a--;
coin += a;
} else if (a < b) {
coin += b;
b--;
coin += b;
} else if (a == b) {
coin += 2 * b - 1;
}
cout << coin << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int coin = 0;
if (a > b) {
coin += a;
a--;
coin += a;
} else if (a < b) {
coin += b;
b--;
coin += b;
} else if (a == b) {
coin += a + b;
}
cout << coin << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 881,004 | 881,005 | u550374978 | cpp |
p03071 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int sum = max(a, b);
if (sum == a) {
a = a--;
} else {
b = b--;
}
sum += max(a, b);
cout << sum << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int sum = max(a, b);
if (sum == a) {
a--;
} else {
b--;
}
sum += max(a, b);
cout << sum << endl;
} | [
"assignment.change"
] | 881,014 | 881,015 | u840731541 | cpp |
p03071 | #include <array>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = 0;
for (int i = 0; i < 2; i++) {
if (a <= b) {
ans = ans + b;
b = b--;
} else if (b < a) {
ans = ans + a;
a = a--;
}
}
cout << ans << endl;
} | #include <array>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = 0;
for (int i = 0; i < 2; i++) {
if (a <= b) {
ans = ans + b;
b = --b;
} else if (b < a) {
ans = ans + a;
a = --a;
}
}
cout << ans << endl;
} | [] | 881,016 | 881,017 | u840731541 | cpp |
p03071 | #include <array>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = 0;
for (int i = 0; i < 2; i++) {
if (a <= b) {
ans = ans + b;
b = b--;
} else if (b < a) {
ans = ans + a;
a = a--;
}
}
cout << ans << endl;
} | #include <array>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = 0;
for (int i = 0; i < 2; i++) {
if (a <= b) {
ans = ans + b;
b--;
} else if (b < a) {
ans = ans + a;
a--;
}
}
cout << ans << endl;
} | [
"assignment.change"
] | 881,016 | 881,018 | u840731541 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = 0;
if (a = b)
ans = a * 2;
else
ans += max(a, b) * 2 - 1;
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = 0;
if (a == b)
ans = a * 2;
else
ans += max(a, b) * 2 - 1;
cout << ans;
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 881,021 | 881,022 | u260907804 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = 0;
if (a > b)
ans = a + a - 1;
if (a < b)
ans = b + b - 1;
else
ans = a + b;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = 0;
if (a > b)
ans = a + a - 1;
else if (a < b)
ans = b + b - 1;
else
ans = a + b;
cout << ans << endl;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 881,029 | 881,030 | u417563928 | cpp |
p03071 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
const int MOD = 1000000007;
const int INF_32 = 1LL << 30;
const int64_t INF_64 = 1LL << 60;
int main() {
int A, B;
cin >> A >> B;
int ans = max({A + A - 1, A + B - 1, B + B - 1});
cout << ans << endl;
} | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
const int MOD = 1000000007;
const int INF_32 = 1LL << 30;
const int64_t INF_64 = 1LL << 60;
int main() {
int A, B;
cin >> A >> B;
int ans = max({A + A - 1, A + B, B + B - 1});
cout << ans << endl;
} | [
"expression.operation.binary.remove"
] | 881,031 | 881,032 | u715366261 | cpp |
p03071 | #include <iostream>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (a > b + 1) {
cout << a + (a - 1);
}
if (a + 1 < b) {
cout << b + (b - 1);
} else {
cout << a + b;
}
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int a, b;
cin >> a >> b;
if (a > b + 1) {
cout << a + (a - 1);
}
else if (a + 1 < b) {
cout << b + (b - 1);
}
else {
cout << a + b;
}
return 0;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 881,033 | 881,034 | u618714790 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
int b;
cin >> b;
if (a == b)
return cout << a + b, 0;
return (max(a, b) * 2) - 1;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
int b;
cin >> b;
if (a == b)
return cout << a + b, 0;
cout << (max(a, b) * 2) - 1;
} | [
"io.output.change"
] | 881,045 | 881,046 | u901813121 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
#ifdef _DEBUG
#define dlog(str) cout << "====" << str << endl;
#else
#define dlog(str)
#endif
#define INF 999999999
#define MOD 1000000007
#define REP(i, n) for (int i = 0, i##_l = (n); i < i##_l; i++)
#define FOR(i, s, e) for (int i = s, i##_l = (e); i < i##_l; i++)
#define LLI long long int
#define _min(a, b) ((a < b) ? a : b)
#define _max(a, b) ((a < b) ? b : a)
#define chmax(a, b) a = _max(a, b)
#define chmin(a, b) a = _min(a, b)
#define bit(a, shift) ((a>>shift)&1))
#define pm(a) ((a) ? 1 : -1)
#define SORT(v) sort(v.begin(), v.end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
// int 2.14Eยฑ9 lli 9.2Eยฑ18 double 1.7Eยฑ380
int main() {
cout << fixed << setprecision(10);
int A, B;
cin >> A >> B;
int ans = 0;
if (A < B) {
ans += A;
A--;
} else {
ans += B;
B--;
}
if (A < B) {
ans += A;
A--;
} else {
ans += B;
B--;
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#ifdef _DEBUG
#define dlog(str) cout << "====" << str << endl;
#else
#define dlog(str)
#endif
#define INF 999999999
#define MOD 1000000007
#define REP(i, n) for (int i = 0, i##_l = (n); i < i##_l; i++)
#define FOR(i, s, e) for (int i = s, i##_l = (e); i < i##_l; i++)
#define LLI long long int
#define _min(a, b) ((a < b) ? a : b)
#define _max(a, b) ((a < b) ? b : a)
#define chmax(a, b) a = _max(a, b)
#define chmin(a, b) a = _min(a, b)
#define bit(a, shift) ((a>>shift)&1))
#define pm(a) ((a) ? 1 : -1)
#define SORT(v) sort(v.begin(), v.end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
// int 2.14Eยฑ9 lli 9.2Eยฑ18 double 1.7Eยฑ380
int main() {
cout << fixed << setprecision(10);
int A, B;
cin >> A >> B;
int ans = 0;
if (A > B) {
ans += A;
A--;
} else {
ans += B;
B--;
}
if (A > B) {
ans += A;
A--;
} else {
ans += B;
B--;
}
cout << ans;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 881,047 | 881,048 | u840105874 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > b)
swap(a, b);
int res = 0;
res += b;
b -= 1;
if (a < b)
swap(a, b);
res += b;
cout << res << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > b)
swap(a, b);
int res = 0;
res += b;
b -= 1;
if (a > b)
swap(a, b);
res += b;
cout << res << '\n';
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 881,049 | 881,050 | u217173261 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > b - 1)
cout << 2 * a - 1 << '\n';
else if (a == b)
cout << 2 * a << '\n';
else
cout << 2 * b - 1 << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > b)
cout << 2 * a - 1 << '\n';
else if (a == b)
cout << 2 * a << '\n';
else
cout << 2 * b - 1 << '\n';
return 0;
} | [
"expression.operation.binary.remove"
] | 881,051 | 881,052 | u551519692 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int A, B;
int coin = 0;
cin >> A >> B;
for (int i = 1; i < 3; ++i) {
if (A > B) {
coin += A;
--A;
} else if (A < B) {
coin += B;
--B;
} else if (A == B) {
coin += A;
--A;
--B;
}
}
cout << coin << endl;
} | #include <iostream>
using namespace std;
int main() {
int A, B;
int coin = 0;
cin >> A >> B;
for (int i = 1; i < 3; ++i) {
if (A > B) {
coin += A;
--A;
} else if (A < B) {
coin += B;
--B;
} else if (A == B) {
coin += A;
--A;
}
}
cout << coin << endl;
} | [
"expression.unary.arithmetic.remove"
] | 881,063 | 881,064 | u949097771 | cpp |
p03071 | #include <iostream>
#include <string>
using namespace std;
#define rep(i, n) for (int(i) = 1; (i) <= (n); (i)++)
int main() {
int a, b, ans;
cin >> a >> b;
if (a > b)
ans = a + (a - 1);
if (a < b)
ans = b + (b - 1);
else
ans = a + b;
cout << ans << endl;
}
| #include <iostream>
#include <string>
using namespace std;
#define rep(i, n) for (int(i) = 1; (i) <= (n); (i)++)
int main() {
int a, b, ans;
cin >> a >> b;
if (a > b)
ans = a + (a - 1);
else if (a < b)
ans = b + (b - 1);
else
ans = a + b;
cout << ans << endl;
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 881,079 | 881,080 | u902803949 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int x = a * 2 - 1, y = b * 2 - 1, z = a * b;
int ans = max(x, y);
ans = max(ans, z);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int x = a * 2 - 1, y = b * 2 - 1, z = a + b;
int ans = max(x, y);
ans = max(ans, z);
cout << ans << endl;
} | [
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 881,088 | 881,089 | u351265848 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
int ans = 0;
cin >> a >> b;
if (a > b)
ans = 2 * a - 1;
if (a == b)
ans = 2 * a;
else
ans = 2 * b - 1;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
int ans = 0;
cin >> a >> b;
if (a > b)
ans = 2 * a - 1;
else if (a == b)
ans = 2 * a;
else
ans = 2 * b - 1;
cout << ans << endl;
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 881,093 | 881,094 | u332153950 | cpp |
p03071 | #include <iostream>
#include <string>
using namespace std;
int main() {
int A;
int B;
cin >> A >> B;
int ans;
if (A > B)
ans = A * (A - 1);
else if (A < B)
ans = B * (B - 1);
else
ans = A + B;
cout << ans << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int A;
int B;
cin >> A >> B;
int ans;
if (A > B)
ans = A + (A - 1);
else if (A < B)
ans = B + (B - 1);
else
ans = A + B;
cout << ans << endl;
} | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 881,104 | 881,105 | u419501474 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
cout << max({a + a, a + b, b + b}) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
cout << max({a + a - 1, a + b, b + b - 1}) << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 881,108 | 881,109 | u720447689 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > b)
cout << 2 * a - 1;
else if (a = b)
cout << 2 * a;
else
cout << 2 * b - 1;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > b)
cout << 2 * a - 1;
else if (a == b)
cout << 2 * a;
else
cout << 2 * b - 1;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 881,118 | 881,119 | u404145225 | cpp |
p03071 | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= (b + 1))
cout << a + a + 1 << endl;
else if (a == b)
cout << a + a << endl;
else if (b >= (a + 1))
cout << b + b + 1 << endl;
} | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= (b + 1))
cout << a + a - 1 << endl;
else if (a == b)
cout << a + a << endl;
else if (b >= (a + 1))
cout << b + b - 1 << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 881,125 | 881,126 | u192280767 | cpp |
p03071 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
int main() {
int a, b;
cin >> a >> b;
if (a == b) {
cout << a + b << endl;
} else if (a > b) {
cout << a * (a - 1) << endl;
} else {
cout << b * (b - 1) << endl;
}
return 0;
}
/*ใๅพ่ผฉใฏใใใฐๅบๆฅใๅญใงใใใ
ใใใใโฉโฉ
ใใใ๏ผยด๏ฝฅฯ๏ฝฅ๏ผ
ใใ ๏ผฟ|ใโ๏ผ(๏ผฟ๏ผฟ_
ใ๏ผใโ-(๏ผฟ๏ผฟ๏ผฟ_๏ผ
ใ๏ฟฃ๏ฟฃ๏ฟฃ๏ฟฃ๏ฟฃ๏ฟฃ๏ฟฃ
ใใใๆฐใฏใพใ ใชใ
ใใ โโ๏ผใฝ-ใ๏ผฟ_
ใ๏ผโ_/๏ผฟ๏ผฟ๏ผฟ๏ผฟ ๏ผ
ใ๏ฟฃ๏ฟฃ๏ฟฃ๏ฟฃ๏ฟฃ๏ฟฃ๏ฟฃใใ*/
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
int main() {
int a, b;
cin >> a >> b;
if (a == b) {
cout << a + b << endl;
} else if (a > b) {
cout << a + (a - 1) << endl;
} else {
cout << b + (b - 1) << endl;
}
return 0;
}
/*ใๅพ่ผฉใฏใใใฐๅบๆฅใๅญใงใใใ
ใใใใโฉโฉ
ใใใ๏ผยด๏ฝฅฯ๏ฝฅ๏ผ
ใใ ๏ผฟ|ใโ๏ผ(๏ผฟ๏ผฟ_
ใ๏ผใโ-(๏ผฟ๏ผฟ๏ผฟ_๏ผ
ใ๏ฟฃ๏ฟฃ๏ฟฃ๏ฟฃ๏ฟฃ๏ฟฃ๏ฟฃ
ใใใๆฐใฏใพใ ใชใ
ใใ โโ๏ผใฝ-ใ๏ผฟ_
ใ๏ผโ_/๏ผฟ๏ผฟ๏ผฟ๏ผฟ ๏ผ
ใ๏ฟฃ๏ฟฃ๏ฟฃ๏ฟฃ๏ฟฃ๏ฟฃ๏ฟฃใใ*/
| [
"expression.operator.arithmetic.change",
"io.output.change"
] | 881,129 | 881,130 | u852449189 | cpp |
p03071 | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<vector<int>>> vvvi;
const ll N = 1e9 + 7;
const int n_max = 1e5 + 10;
int main() {
int a, b;
cin >> a >> b;
int sum = 0;
sum += max(a, b);
if (a <= b)
sum += max(a, b - 1);
else
sum = max(a - 1, b);
cout << sum << endl;
return 0;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<vector<int>>> vvvi;
const ll N = 1e9 + 7;
const int n_max = 1e5 + 10;
int main() {
int a, b;
cin >> a >> b;
int sum = 0;
sum += max(a, b);
if (a <= b)
sum += max(a, b - 1);
else
sum += max(a - 1, b);
cout << sum << endl;
return 0;
}
| [
"assignment.value.change"
] | 881,131 | 881,132 | u899645116 | cpp |
p03071 | // template
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<long long, long long> LP;
#define INF 999999999
#define MOD 1000000007
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; i++)
#define REP_AB(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define ALL(v) v.begin(), v.end()
#define SORT(v) sort(ALL(v))
#define UNIQUE(v) \
sort(ALL(v)); \
v.erase(unique(ALL(v)), v.end());
#define SIZE(x) ((ll)(x).size())
#define REVERSE(v) reverse(ALL(v))
// true / false
#define BIN_SEARCH(v, a) binary_search(ALL(v), a)
// index
#define BIN_LEFT(v, a) (lower_bound(ALL(v), a) - v.begin())
#define BIN_RIGHT(v, a) (upper_bound(ALL(v), a) - v.begin())
#define BIN_INSERT(v, a) (v.insert(v.begin() + BIN_LEFT(v, a), a))
#define DEL(v, i) v.erase(v.begin() + i)
#define INSERT(v, i, a) v.insert(v.begin() + i, a)
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
#define out cout
#define in cin
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
// template end
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll A, B;
in >> A >> B;
// vector<ll> X(N);
if (A > B) {
out << 2 * A << endl;
} else if (B > A) {
out << 2 * B << endl;
} else if (B == A) {
out << A + B << endl;
}
} | // template
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<long long, long long> LP;
#define INF 999999999
#define MOD 1000000007
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; i++)
#define REP_AB(i, a, b) for (ll i = ll(a); i < ll(b); i++)
#define ALL(v) v.begin(), v.end()
#define SORT(v) sort(ALL(v))
#define UNIQUE(v) \
sort(ALL(v)); \
v.erase(unique(ALL(v)), v.end());
#define SIZE(x) ((ll)(x).size())
#define REVERSE(v) reverse(ALL(v))
// true / false
#define BIN_SEARCH(v, a) binary_search(ALL(v), a)
// index
#define BIN_LEFT(v, a) (lower_bound(ALL(v), a) - v.begin())
#define BIN_RIGHT(v, a) (upper_bound(ALL(v), a) - v.begin())
#define BIN_INSERT(v, a) (v.insert(v.begin() + BIN_LEFT(v, a), a))
#define DEL(v, i) v.erase(v.begin() + i)
#define INSERT(v, i, a) v.insert(v.begin() + i, a)
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
#define out cout
#define in cin
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
// template end
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll A, B;
in >> A >> B;
// vector<ll> X(N);
if (A > B) {
out << 2 * A - 1 << endl;
} else if (B > A) {
out << 2 * B - 1 << endl;
} else if (B == A) {
out << A + B << endl;
}
} | [
"expression.operation.binary.add"
] | 881,135 | 881,136 | u703877026 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int k, l, m;
k = a * (a - 1);
l = a * b;
m = b * (b - 1);
cout << max(max(k, l), m) << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int k, l, m;
k = a + (a - 1);
l = a + b;
m = b + (b - 1);
cout << max(max(k, l), m) << endl;
return 0;
} | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 881,139 | 881,140 | u553183019 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a, b;
int coins;
for (int i = 0; i < 2; i++) {
if (a >= b) {
coins += a;
a--;
} else {
coins += b;
b--;
}
}
cout << coins << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int coins = 0;
for (int i = 0; i < 2; i++) {
if (a >= b) {
coins += a;
a--;
} else {
coins += b;
b--;
}
}
cout << coins << endl;
return 0;
} | [
"variable_declaration.value.change"
] | 881,161 | 881,162 | u318027064 | cpp |
p03071 | #include <algorithm>
#include <float.h>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <string.h>
#include <vector>
#define rep(i, a, n) for (ll int(i) = (a); (i) < (n); (i)++)
#define urep(i, a, n) for (ll int(i) = (a); (i) > (n); (i)--)
#define MOD 1000000007
#define ll long long
using namespace ::std;
int jo(ll int jxo, ll int jyo) {
ll int jhogeo = 1;
rep(jinto, 0, jyo) jhogeo = jhogeo * jxo;
return jhogeo;
}
char tobig(char toxbig) { return (toxbig - 0x20); }
char tolow(char toxlow) { return (toxlow + 0x20); }
int main() {
vector<int> a(2);
cin >> a[0] >> a[1];
sort(a.begin(), a.end());
cout << (a[1] == a[0] ? 2 * a[1] - 1 : a[1] + a[0]);
}
// int *p = new int[N];
// vector<int> ๅคๆฐๅ(่ฆ็ด ๆฐ);
// sort(ๅคๆฐๅ.begin(),ๅคๆฐๅ.end());//ๆ้ ใฝใผใ
// vector<vector<int>> ๅคๆฐๅ(ๅทฆใฎๅๆฐ, vector<int>(ๅณใฎๅๆฐ));
//
| #include <algorithm>
#include <float.h>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <string.h>
#include <vector>
#define rep(i, a, n) for (ll int(i) = (a); (i) < (n); (i)++)
#define urep(i, a, n) for (ll int(i) = (a); (i) > (n); (i)--)
#define MOD 1000000007
#define ll long long
using namespace ::std;
int jo(ll int jxo, ll int jyo) {
ll int jhogeo = 1;
rep(jinto, 0, jyo) jhogeo = jhogeo * jxo;
return jhogeo;
}
char tobig(char toxbig) { return (toxbig - 0x20); }
char tolow(char toxlow) { return (toxlow + 0x20); }
int main() {
vector<int> a(2);
cin >> a[0] >> a[1];
sort(a.begin(), a.end());
cout << (a[1] != a[0] ? 2 * a[1] - 1 : a[1] + a[0]);
}
// int *p = new int[N];
// vector<int> ๅคๆฐๅ(่ฆ็ด ๆฐ);
// sort(ๅคๆฐๅ.begin(),ๅคๆฐๅ.end());//ๆ้ ใฝใผใ
// vector<vector<int>> ๅคๆฐๅ(ๅทฆใฎๅๆฐ, vector<int>(ๅณใฎๅๆฐ));
//
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 881,163 | 881,164 | u319945100 | cpp |
p03071 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
vector<int> X(1);
cin >> X[0] >> X[1];
int cnt = 0;
sort(X.begin(), X.end());
cnt = X[1] + max(X[1] - 1, X[0]);
cout << cnt << endl;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
vector<int> X(2);
cin >> X[0] >> X[1];
int cnt = 0;
sort(X.begin(), X.end());
cnt = X[1] + max(X[1] - 1, X[0]);
cout << cnt << endl;
} | [
"literal.number.change",
"call.arguments.change"
] | 881,165 | 881,166 | u431929942 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << max(a, b) + max(max(a, b) - 1, min(a, b) - 1) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << max(a, b) + max(max(a, b) - 1, min(a, b)) << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 881,184 | 881,185 | u366115355 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A > B + 2) {
cout << 2 * A - 1 << endl;
} else {
if (A == B) {
cout << 2 * A << endl;
} else {
cout << 2 * B - 1 << endl;
}
}
}
| #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A >= B + 1) {
cout << 2 * A - 1 << endl;
} else {
if (A == B) {
cout << 2 * A << endl;
} else {
cout << 2 * B - 1 << endl;
}
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 881,198 | 881,199 | u938317342 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans;
ans = max(a * (a - 1), b * (b - 1));
ans = max(ans, a * b);
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans;
ans = max(a + (a - 1), b + (b - 1));
ans = max(ans, a + b);
cout << ans << endl;
}
| [
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 881,200 | 881,201 | u653482689 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= b + 1)
cout << a * 2 << endl;
else if (b >= a + 1)
cout << b * 2 << endl;
else
cout << a + b << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= b + 1)
cout << a * 2 - 1 << endl;
else if (b >= a + 1)
cout << b * 2 - 1 << endl;
else
cout << a + b << endl;
}
| [
"expression.operation.binary.add"
] | 881,210 | 881,211 | u469953228 | cpp |
p03071 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A > B + 1) {
cout << A + (A - 1) << endl;
} else if (A == B) {
cout << A + B << endl;
} else {
cout << B + (B - 1) << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A > B) {
cout << A + (A - 1) << endl;
} else if (A == B) {
cout << A + B << endl;
} else {
cout << B + (B - 1) << endl;
}
} | [
"expression.operation.binary.remove"
] | 881,212 | 881,213 | u436741428 | cpp |
p03071 | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int i, j, k = 0;
cin >> i >> j;
if (i > j) {
k += i;
i++;
} else {
k += j;
j--;
}
if (i > j) {
k += i;
} else
k += j;
cout << k << endl;
return 0;
} | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int i, j, k = 0;
cin >> i >> j;
if (i > j) {
k += i;
i--;
} else {
k += j;
j--;
}
if (i > j) {
k += i;
} else
k += j;
cout << k << endl;
return 0;
} | [] | 881,214 | 881,215 | u199768991 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > b) {
cout << 2 * a - 1 << endl;
} else if (a == b) {
cout << 2 * a << endl;
} else {
cout << 2 * b << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > b) {
cout << 2 * a - 1 << endl;
} else if (a == b) {
cout << 2 * a << endl;
} else {
cout << 2 * b - 1 << endl;
}
return 0;
} | [
"expression.operation.binary.add"
] | 881,230 | 881,231 | u432194969 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.