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 |
|---|---|---|---|---|---|---|---|
p03008 | #include <algorithm>
#include <cfloat>
#include <complex>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
#define fs first
... | #include <algorithm>
#include <cfloat>
#include <complex>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
#define fs first
... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 822,228 | 822,229 | u852158538 | cpp |
p03008 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <time.h>
#include <tup... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <time.h>
#include <tup... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 822,234 | 822,235 | u399527088 | cpp |
p03008 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <time.h>
#include <tup... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <time.h>
#include <tup... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 822,236 | 822,235 | u399527088 | cpp |
p03008 | //#pragma comment(linker, "/STACK:134217728")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#incl... | //#pragma comment(linker, "/STACK:134217728")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#incl... | [
"literal.number.change",
"call.arguments.change"
] | 822,239 | 822,240 | u115089744 | cpp |
p03008 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define PPC(x) __builtin_popcount((x))
#define ALL(x) (x).begin(), (x).end()
#define pb push_back
using namespace std;
vector<pair<int, int>> p;
long long res;
int limit;
void go(int d, int prev, long long sum) {
if (d == p.size() or prev... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define PPC(x) __builtin_popcount((x))
#define ALL(x) (x).begin(), (x).end()
#define pb push_back
using namespace std;
vector<pair<int, int>> p;
long long res;
int limit;
void go(int d, int prev, long long sum) {
if (d == p.size() or prev... | [
"expression.operation.binary.remove"
] | 822,247 | 822,248 | u716895502 | cpp |
p03008 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <complex>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <unis... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <complex>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <unis... | [
"variable_declaration.name.change",
"identifier.change",
"variable_declaration.add"
] | 822,249 | 822,250 | u006204672 | cpp |
p03008 | #include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int i = 0; i < v.size(); i++) ... | #include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int i = 0; i < v.size(); i++) ... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 822,251 | 822,252 | u579152247 | cpp |
p03008 | #include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int i = 0; i < v.size(); i++) ... | #include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int i = 0; i < v.size(); i++) ... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"identifier.change"
] | 822,253 | 822,252 | u579152247 | cpp |
p03008 | #include <bits/stdc++.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
long long g[2], s[2], b[2];
int main() {
int n = ri();
for (int i = 0; i < 2; i++) {
g[i] = ri();
s[i] = ri();
b[i] = ri();
}
long long res = n;
{
long long dp[res + 1];
dp[res] = 0;
for (int i = 0; i < res... | #include <bits/stdc++.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
long long g[2], s[2], b[2];
int main() {
int n = ri();
for (int i = 0; i < 2; i++) {
g[i] = ri();
s[i] = ri();
b[i] = ri();
}
long long res = n;
{
long long dp[res + 1];
dp[res] = 0;
for (int i = 0; i < res... | [
"assignment.change"
] | 822,254 | 822,255 | u040490988 | cpp |
p03008 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <unordered_map>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
typedef unsigned long long ul;
typedef long long ll;
typedef pair<int, int> PAIR;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <unordered_map>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
typedef unsigned long long ul;
typedef long long ll;
typedef pair<int, int> PAIR;
... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 822,256 | 822,257 | u211490974 | cpp |
p03008 | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define ii pair<ll, ll>
ll n, g[2], s[2], b[2];
ll ans[10000], finalAns = 0;
bool visited[10000];
ll dp(ll num, ll ma, ll sa, ll mb, ll sb, ll mc, ll sc) {
if (visited[num])
return ans[num];
visited[num] = true;
ans[num] = num;
if (num >=... | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define ii pair<ll, ll>
ll n, g[2], s[2], b[2];
ll ans[10000], finalAns = 0;
bool visited[10000];
ll dp(ll num, ll ma, ll sa, ll mb, ll sb, ll mc, ll sc) {
if (visited[num])
return ans[num];
visited[num] = true;
ans[num] = num;
if (num >=... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 822,260 | 822,261 | u198150045 | cpp |
p03008 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define ll long long
#define pb push_back
#define sz(x) (int)(x).size()
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define D(x) cerr << #x << " is " <<... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define ll long long
#define pb push_back
#define sz(x) (int)(x).size()
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define D(x) cerr << #x << " is " <<... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 822,262 | 822,263 | u013064880 | cpp |
p03008 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vector<ll> a(3), b(3);
for (int i = 0; i < 3; i++)
cin >> a[i];
for (int i = 0; i < 3; i++)
cin >> b[i];
vector<ll> dp(n + 1, -1);
dp[0] = 0;
for (int... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vector<ll> a(3), b(3);
for (int i = 0; i < 3; i++)
cin >> a[i];
for (int i = 0; i < 3; i++)
cin >> b[i];
vector<ll> dp(n + 1, -1);
dp[0] = 0;
for (int... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 822,474 | 822,475 | u553623615 | cpp |
p03008 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=... | [
"assignment.value.change",
"expression.operation.unary.remove"
] | 822,483 | 822,484 | u762921614 | cpp |
p03008 | #pragma GCC optimize(3)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define MAXN 5005
#define INF 1000000000
#define MOD 1000000007
#define F first
#define S second
using namespace std;
using namespace __gnu_pbds;
typedef... | #pragma GCC optimize(3)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define MAXN 5005
#define INF 1000000000
#define MOD 1000000007
#define F first
#define S second
using namespace std;
using namespace __gnu_pbds;
typedef... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 822,491 | 822,492 | u237254894 | cpp |
p03008 | #include <bits/stdc++.h>
#define pa pair<int, int>
#define CLR(a, x) memset(a, x, sizeof(a))
#define MP make_pair
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef long double ld;
const int maxn = 25e6 + 10;
inline char gc() {... | #include <bits/stdc++.h>
#define pa pair<int, int>
#define CLR(a, x) memset(a, x, sizeof(a))
#define MP make_pair
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef long double ld;
const int maxn = 25e6 + 10;
inline char gc() {... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 822,493 | 822,494 | u371295315 | cpp |
p03008 | #include <bits/stdc++.h>
using namespace std;
const double eps = 1e-9;
long long n, ga, sa, ba, gb, sb, bb, w, id[4], dp[25555555];
long long trans(long long n, int ga, int sa, int ba, int gb, int sb, int bb) {
memset(dp, 0, sizeof(dp));
for (int i = 1; i <= n; i++) {
if (i >= ga)
dp[i] = max(dp[i], dp[i ... | #include <bits/stdc++.h>
using namespace std;
const double eps = 1e-9;
long long n, ga, sa, ba, gb, sb, bb, w, id[4], dp[25555555];
long long trans(long long n, int ga, int sa, int ba, int gb, int sb, int bb) {
memset(dp, 0, sizeof(dp));
for (int i = 1; i <= n; i++) {
if (i >= ga)
dp[i] = max(dp[i], dp[i ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 822,499 | 822,500 | u900309151 | cpp |
p03008 | #include <bits/stdc++.h>
using namespace std;
const double eps = 1e-9;
long long n, ga, sa, ba, gb, sb, bb, w, id[4], dp[25555555];
long long trans(long long n, int ga, int sa, int ba, int gb, int sb, int bb) {
memset(dp, 0, sizeof(dp));
for (int i = 1; i <= n; i++) {
if (i >= ga)
dp[i] = max(dp[i], dp[i ... | #include <bits/stdc++.h>
using namespace std;
const double eps = 1e-9;
long long n, ga, sa, ba, gb, sb, bb, w, id[4], dp[25555555];
long long trans(long long n, int ga, int sa, int ba, int gb, int sb, int bb) {
memset(dp, 0, sizeof(dp));
for (int i = 1; i <= n; i++) {
if (i >= ga)
dp[i] = max(dp[i], dp[i ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.return.add"
] | 822,501 | 822,500 | u900309151 | cpp |
p03008 | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define REP(i, n) for (int(i) = 0; (i) < (... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define REP(i, n) for (int(i) = 0; (i) < (... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 822,506 | 822,507 | u051493691 | cpp |
p03008 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 822,508 | 822,509 | u287305727 | cpp |
p03008 | #include <algorithm>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define vel vector<long long>
#define vvel vector<vel>
#define rep(i, n) for (long long i = 0; i < n; i++)
#define rp(i, n) for (long long i = 1; i < n... | #include <algorithm>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define vel vector<long long>
#define vvel vector<vel>
#define rep(i, n) for (long long i = 0; i < n; i++)
#define rp(i, n) for (long long i = 1; i < n... | [
"expression.operation.binary.add"
] | 822,514 | 822,515 | u021034020 | cpp |
p03008 | // vvvvvvvvvvvv TEMPLATE vvvvvvvvvvvv
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll linf = 1e18;
const double eps = 1e-12, pi = acos(-1);
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##... | // vvvvvvvvvvvv TEMPLATE vvvvvvvvvvvv
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll linf = 1e18;
const double eps = 1e-12, pi = acos(-1);
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##... | [
"call.arguments.change",
"expression.operation.binary.change"
] | 822,517 | 822,518 | u518019145 | cpp |
p03008 | // https://atcoder.jp/contests/diverta2019-2/tasks/diverta2019_2_d
/*<head>*/
// #include "Template.hpp"
/*</head>*/
/*<body>*/
/* #region header */
/* #region 1*/
/**
* @file Template.hpp
* @brief 競技プログラミング用テンプレート
* @author btk15049
* @date 2019/05/02
*/
#include <bits/stdc++.h>
using namespace std;
/* #region ... | // https://atcoder.jp/contests/diverta2019-2/tasks/diverta2019_2_d
/*<head>*/
// #include "Template.hpp"
/*</head>*/
/*<body>*/
/* #region header */
/* #region 1*/
/**
* @file Template.hpp
* @brief 競技プログラミング用テンプレート
* @author btk15049
* @date 2019/05/02
*/
#include <bits/stdc++.h>
using namespace std;
/* #region ... | [
"identifier.change",
"call.arguments.change"
] | 822,527 | 822,528 | u613658617 | cpp |
p03008 | #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
ll knapsack(const vector<pair<ll, ll>> &items, ll max_w) {
vector<ll> res(max_w + 1, 0);
for (auto pr : items) {
ll val = pr.first;
ll wei = pr.second;
for (int j = 0; j + wei <= max_w; ++j) {
res[j + wei] = max(res[... | #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
ll knapsack(const vector<pair<ll, ll>> &items, ll max_w) {
vector<ll> res(max_w + 1, 0);
for (auto pr : items) {
ll val = pr.first;
ll wei = pr.second;
for (int j = 0; j + wei <= max_w; ++j) {
res[j + wei] = max(res[... | [
"call.arguments.change",
"identifier.change"
] | 822,529 | 822,530 | u347328826 | cpp |
p03008 | #pragma GCC optimize("O2,Ofast,inline,unroll-all-loops,-ffast-math")
#pragma GCC target("popcnt")
#include <bits/stdc++.h>
#define maxn 25000010
#define ll long long
#define ull unsigned long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define pob pop_back... | #pragma GCC optimize("O2,Ofast,inline,unroll-all-loops,-ffast-math")
#pragma GCC target("popcnt")
#include <bits/stdc++.h>
#define maxn 25000010
#define ll long long
#define ull unsigned long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define pob pop_back... | [
"identifier.change",
"control_flow.loop.for.initializer.change"
] | 822,542 | 822,543 | u086813340 | cpp |
p03009 | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set... | [
"assignment.add"
] | 822,548 | 822,549 | u021034020 | cpp |
p03009 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7, N = 1e6 + 5;
ll n, h, d, f[N], sum[N], s;
int main() {
scanf("%lld%lld%lld", &n, &h, &d);
f[0] = 1;
for (int i = 1; i <= n; i++)
f[i] = f[i - 1] * i % mod, s = (s + f[i]) % mod;
sum[1] = 1;
for (int i = 2; i <= h;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7, N = 1e6 + 5;
ll n, h, d, f[N], sum[N], s;
int main() {
scanf("%lld%lld%lld", &n, &h, &d);
f[0] = 1;
for (int i = 1; i <= n; i++)
f[i] = f[i - 1] * i % mod, s = (s + f[i]) % mod;
sum[1] = 1;
for (int i = 2; i <= h;... | [
"call.arguments.change"
] | 822,552 | 822,553 | u676323984 | cpp |
p03009 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// queue を考えて, 同じ数字は入れるときに順番を決めて, 出てきた順に値を更新する
#define mod 1000000007
#define MAX_N 1000001 // = MAX_H
ll fact[MAX_N]; // iの階乗
ll fact_sum[MAX_N]; // i>0での累積和
// 最大値がi個の時の場合の数
ll dp[MAX_N];
int main() {
int N, H, D;
cin >> N >> H >> D;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// queue を考えて, 同じ数字は入れるときに順番を決めて, 出てきた順に値を更新する
#define mod 1000000007
#define MAX_N 1000001 // = MAX_H
ll fact[MAX_N]; // iの階乗
ll fact_sum[MAX_N]; // i>0での累積和
// 最大値がi個の時の場合の数
ll dp[MAX_N];
int main() {
int N, H, D;
cin >> N >> H >> D;
... | [
"assignment.value.change",
"assignment.change"
] | 822,554 | 822,555 | u590088474 | cpp |
p03009 | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
#define MOD ((ll)1e9 + 7)
ll moddiv(ll a, ll b) {
a %= MOD;
b %= MOD;
... | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
#define MOD ((ll)1e9 + 7)
ll moddiv(ll a, ll b) {
a %= MOD;
b %= MOD;
... | [
"assignment.change"
] | 822,558 | 822,559 | u259396003 | cpp |
p03009 | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath> // 変数名にy1が使えなくなるかも…。
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vec... | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath> // 変数名にy1が使えなくなるかも…。
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vec... | [
"assignment.change"
] | 822,562 | 822,563 | u370768058 | cpp |
p03009 | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#define LL long long
using namespace std;
const LL mod = 1e9 + 7;
LL n, h, d, fac[1000010], f[1000010], s[1000010];
int main() {
scanf("%lld %lld %lld", &n, &h, &d);
fac[0] = fac[1] = 1;
for (LL i = 2; i <= n; i++)
fac[i] = fac[i - 1]... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#define LL long long
using namespace std;
const LL mod = 1e9 + 7;
LL n, h, d, fac[1000010], f[1000010], s[1000010];
int main() {
scanf("%lld %lld %lld", &n, &h, &d);
fac[0] = fac[1] = 1;
for (LL i = 2; i <= n; i++)
fac[i] = fac[i - 1]... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"io.output.change"
] | 822,566 | 822,567 | u038798747 | cpp |
p03009 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#inclu... |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#inclu... | [
"assignment.change"
] | 822,572 | 822,573 | u614497125 | cpp |
p03009 | #include <cstdio>
typedef long long ll;
const int mod = 1000000007;
int f[1000050], g[1000050], s[1000050];
int main() {
int n, h, d, p, i;
scanf("%d%d%d", &n, &h, &d);
f[0] = f[1] = 1;
for (i = 2; i <= n; ++i)
f[i] = (ll)f[i - 1] * i % mod;
p = 2;
for (i = 2; i <= n; ++i)
p = (p + f[i]) % mod;
s[... | #include <cstdio>
typedef long long ll;
const int mod = 1000000007;
int f[1000050], g[1000050], s[1000050];
int main() {
int n, h, d, p, i;
scanf("%d%d%d", &n, &h, &d);
f[0] = f[1] = 1;
for (i = 2; i <= n; ++i)
f[i] = (ll)f[i - 1] * i % mod;
p = 2;
for (i = 2; i <= n; ++i)
p = (p + f[i]) % mod;
s[... | [
"assignment.change"
] | 822,574 | 822,575 | u070422134 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vb = vector<bool>;
using vvb = vector<vb>;
using vd = vector<double>;
using vvd = vector<vd>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using pll = pair<ll, ll>;
using tll = tuple<ll, ll>;
usin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vb = vector<bool>;
using vvb = vector<vb>;
using vd = vector<double>;
using vvd = vector<vd>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using pll = pair<ll, ll>;
using tll = tuple<ll, ll>;
usin... | [
"assignment.variable.change",
"call.function.change"
] | 822,278 | 822,279 | u364618491 | cpp |
p03007 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9 + 7;
ll a[100000];
vector<P> te;
int main() {
int n;
ll ans = 0;
cin >> n;
for (int i = 0; i ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9 + 7;
ll a[100000];
vector<P> te;
int main() {
int n;
ll ans = 0;
cin >> n;
for (int i = 0; i ... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"literal.number.change",
"expression.operation.binary.change"
] | 822,292 | 822,293 | u863507492 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define mp make_pair
#define pb push_back
#define pii pair<int, int>
#define pll pair<LL, LL>
#define x first
#define y second
#define pi acos(-1)
#define sqr(x) ((x) * (x))
#define pdd pair<double, double>
#define MEMS(x) memset(x, -1, sizeof(x))
#defi... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define mp make_pair
#define pb push_back
#define pii pair<int, int>
#define pll pair<LL, LL>
#define x first
#define y second
#define pi acos(-1)
#define sqr(x) ((x) * (x))
#define pdd pair<double, double>
#define MEMS(x) memset(x, -1, sizeof(x))
#defi... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 822,294 | 822,295 | u682550266 | cpp |
p03007 | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), ... | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), ... | [] | 822,296 | 822,297 | u452725238 | cpp |
p03007 | #include <algorithm>
#include <iostream>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define mad(a, b) a = (a + b) % mod;
#define N 100010
typedef pair<ll, ll> P;
vector<P> v;
ll n, a[N];
int main() {
cin >> n;
... | #include <algorithm>
#include <iostream>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define mad(a, b) a = (a + b) % mod;
#define N 100010
typedef pair<ll, ll> P;
vector<P> v;
ll n, a[N];
int main() {
cin >> n;
... | [
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 822,300 | 822,301 | u924885571 | cpp |
p03008 | #include <bits/stdc++.h>
using namespace std;
#ifdef _DEBUG
#include "_DEBUG.hpp"
#endif
#define int long long
const int INF = 1LL << 60;
template <class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts.... | #include <bits/stdc++.h>
using namespace std;
#ifdef _DEBUG
#include "_DEBUG.hpp"
#endif
#define int long long
const int INF = 1LL << 60;
template <class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts.... | [
"expression.operation.binary.remove"
] | 822,314 | 822,315 | u344122377 | cpp |
p03008 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#inc... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#inc... | [
"variable_declaration.type.change",
"identifier.change",
"call.arguments.change"
] | 822,322 | 822,321 | u190018920 | cpp |
p03008 | // Template
#include <bits/stdc++.h>
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, r) for (int i = (l); i < (r); ++i)
#define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size(... | // Template
#include <bits/stdc++.h>
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, r) for (int i = (l); i < (r); ++i)
#define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size(... | [
"variable_declaration.type.change",
"identifier.change"
] | 822,327 | 822,326 | u826189900 | cpp |
p03008 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <float.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#inclu... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <float.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#inclu... | [
"control_flow.break.remove",
"control_flow.continue.add"
] | 822,328 | 822,329 | u577774192 | cpp |
p03008 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <float.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#inclu... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <float.h>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#inclu... | [
"control_flow.break.remove",
"control_flow.continue.add",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 822,330 | 822,329 | u577774192 | cpp |
p03008 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
// output
#define SPBR(w, n) std::cout << (w... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
// output
#define SPBR(w, n) std::cout << (w... | [
"expression.operation.binary.add"
] | 822,344 | 822,345 | u812973725 | cpp |
p03008 | #include <bits/stdc++.h>
#define int long long
#define endl '\n'
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0... | #include <bits/stdc++.h>
#define int long long
#define endl '\n'
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 822,350 | 822,351 | u392058778 | cpp |
p03008 | /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
// GCC
#define _GLIBCXX_DEBUG
// Clang
//#define _LIBCPP_DEBUG 0
#include <bits/stdc++.h>
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#define f(i, n) for (int... | /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
// GCC
#define _GLIBCXX_DEBUG
// Clang
//#define _LIBCPP_DEBUG 0
#include <bits/stdc++.h>
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#define f(i, n) for (int... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 822,356 | 822,357 | u943070796 | cpp |
p03008 | /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
// GCC
#define _GLIBCXX_DEBUG
// Clang
//#define _LIBCPP_DEBUG 0
#include <bits/stdc++.h>
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#define f(i, n) for (int... | /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
// GCC
#define _GLIBCXX_DEBUG
// Clang
//#define _LIBCPP_DEBUG 0
#include <bits/stdc++.h>
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#define f(i, n) for (int... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 822,358 | 822,359 | u943070796 | cpp |
p03008 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, n - 1, 0)
#define all(v) v.begin(), v.end()
const int inf = 1e9 + 7... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, n - 1, 0)
#define all(v) v.begin(), v.end()
const int inf = 1e9 + 7... | [
"assignment.value.change",
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 822,369 | 822,368 | u137747137 | cpp |
p03008 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, n - 1, 0)
#define all(v) v.begin(), v.end()
const int inf = 1e9 + 7... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, n - 1, 0)
#define all(v) v.begin(), v.end()
const int inf = 1e9 + 7... | [
"assignment.value.change",
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 822,370 | 822,368 | u137747137 | cpp |
p03008 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define ll long long
#define ull unsigned long long
#define ld long double
#define vl vector<long long>
#define vvl vector<vector<long long>>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#d... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define ll long long
#define ull unsigned long long
#define ld long double
#define vl vector<long long>
#define vvl vector<vector<long long>>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#d... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 822,375 | 822,376 | u190580703 | cpp |
p03008 | #include <bits/stdc++.h>
using namespace std;
#define mid ((s + e) / 2)
#define makefast \
ios::sync_with_stdio(0); \
cin.tie(0); \
cou... | #include <bits/stdc++.h>
using namespace std;
#define mid ((s + e) / 2)
#define makefast \
ios::sync_with_stdio(0); \
cin.tie(0); \
cou... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 822,386 | 822,387 | u766633720 | cpp |
p03008 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i, s, n) for (int i = s; i < n; i++)
#define NUM 2520
#define INF (1LL << 50)
#define DEBUG 1
#define mp(a, b) make_pair(a, b)
#define SORT(V) sort(V.begin(), V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) #Var... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i, s, n) for (int i = s; i < n; i++)
#define NUM 2520
#define INF (1LL << 50)
#define DEBUG 1
#define mp(a, b) make_pair(a, b)
#define SORT(V) sort(V.begin(), V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) #Var... | [
"expression.operation.binary.add"
] | 822,392 | 822,393 | u041513069 | cpp |
p03008 | #include <bits/stdc++.h>
using namespace std;
long long Price[3][2];
vector<int> V;
long long Ans;
void dfs(int pos, long long Left, long long Sum) {
if ((int)(V.size()) == 0) {
Ans = Sum;
return;
}
int Realpos = V[pos];
long long mx = Left / Price[Realpos][0];
if (pos == (int)(V.size()) - 1) {
An... | #include <bits/stdc++.h>
using namespace std;
long long Price[3][2];
vector<int> V;
long long Ans;
void dfs(int pos, long long Left, long long Sum) {
if ((int)(V.size()) == 0) {
Ans = Sum;
return;
}
int Realpos = V[pos];
long long mx = Left / Price[Realpos][0];
if (pos == (int)(V.size()) - 1) {
An... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 822,399 | 822,400 | u538921909 | cpp |
p03008 | #include <algorithm>
#include <cstdio>
using namespace std;
typedef long long ll;
ll dp[25000000];
int main() {
ll n, g[2], s[2], b[2], ans = 0LL, a = 0LL;
scanf("%lld", &n);
for (int i = 0; i < 2; i++) {
scanf("%lld%lld%lld", &g[i], &s[i], &b[i]);
}
for (int i = 0; i <= n; i++) {
a = max(a, dp[i]);... | #include <algorithm>
#include <cstdio>
using namespace std;
typedef long long ll;
ll dp[25000000];
int main() {
ll n, g[2], s[2], b[2], ans = 0LL, a = 0LL;
scanf("%lld", &n);
for (int i = 0; i < 2; i++) {
scanf("%lld%lld%lld", &g[i], &s[i], &b[i]);
}
for (int i = 0; i <= n; i++) {
a = max(a, dp[i]);... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 822,406 | 822,407 | u855429581 | cpp |
p03008 | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < int(n); i++)
using namespace... | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < int(n); i++)
using namespace... | [
"assignment.change"
] | 822,427 | 822,428 | u801102476 | cpp |
p03008 | #include <array>
#include <bits/stdc++.h>
using namespace std;
using ULL = unsigned long long;
using UL = unsigned;
using LL = long long;
#define rep(i, n) for (UL i = 0; i < (n); i++)
struct Problem {
void Solve() {
ULL N;
cin >> N;
int A[3], B[3];
rep(i, 3) cin >> A[i];
rep(i, 3) cin >> B[i];
... | #include <array>
#include <bits/stdc++.h>
using namespace std;
using ULL = unsigned long long;
using UL = unsigned;
using LL = long long;
#define rep(i, n) for (UL i = 0; i < (n); i++)
struct Problem {
void Solve() {
ULL N;
cin >> N;
int A[3], B[3];
rep(i, 3) cin >> A[i];
rep(i, 3) cin >> B[i];
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 822,429 | 822,430 | u331948661 | cpp |
p03008 | #include <algorithm>
#include <cstdio>
using namespace std;
#define ll long long
ll solve(ll n, ll a[], ll b[]) {
ll dp[n + 1];
dp[0] = 0;
for (ll i = 1; i <= n; i++) {
dp[i] = 0;
for (ll j = 0; j < 4; j++) {
if (i - a[j] >= 0)
dp[i] = max(dp[i], dp[i - a[j]] + b[j]);
}
}
return dp[n... | #include <algorithm>
#include <cstdio>
using namespace std;
#define ll long long
ll solve(ll n, ll a[], ll b[]) {
ll dp[n + 1];
dp[0] = 0;
for (ll i = 1; i <= n; i++) {
dp[i] = 0;
for (ll j = 0; j < 4; j++) {
if (i - a[j] >= 0)
dp[i] = max(dp[i], dp[i - a[j]] + b[j]);
}
}
return dp[n... | [
"expression.operation.binary.remove"
] | 822,433 | 822,434 | u340969800 | cpp |
p03008 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> gsb_A(3), gsb_B(3);
cin >> gsb_A[0] >> gsb_A[1] >> gsb_A[2];
cin >> gsb_B[0] >> gsb_B[1] >> gsb_B[2];
// A -> B
// dp[n] := with n acrons, chokudai can gain dp[n] profit
// dp[n] = max(dp[n], dp[n - ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> gsb_A(3), gsb_B(3);
cin >> gsb_A[0] >> gsb_A[1] >> gsb_A[2];
cin >> gsb_B[0] >> gsb_B[1] >> gsb_B[2];
// A -> B
// dp[n] := with n acrons, chokudai can gain dp[n] profit
// dp[n] = max(dp[n], dp[n - ... | [
"assignment.change"
] | 822,435 | 822,436 | u425351967 | cpp |
p03008 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 100500;
const int mod = 1e9 + 7;
#define int long long
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
int gg[2], ss[2], bb[2];
cin >> n;
for (int i = 0; i < 2; ++i)
cin >> gg[i] >> ss[i] >> bb[i];
vector<pair<i... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 100500;
const int mod = 1e9 + 7;
#define int long long
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
int gg[2], ss[2], bb[2];
cin >> n;
for (int i = 0; i < 2; ++i)
cin >> gg[i] >> ss[i] >> bb[i];
vector<pair<i... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 822,447 | 822,448 | u386842336 | cpp |
p03008 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 100500;
const int mod = 1e9 + 7;
#define int long long
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
int gg[2], ss[2], bb[2];
cin >> n;
for (int i = 0; i < 2; ++i)
cin >> gg[i] >> ss[i] >> bb[i];
vector<pair<i... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 100500;
const int mod = 1e9 + 7;
#define int long long
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
int gg[2], ss[2], bb[2];
cin >> n;
for (int i = 0; i < 2; ++i)
cin >> gg[i] >> ss[i] >> bb[i];
vector<pair<i... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 822,449 | 822,448 | u386842336 | cpp |
p03008 | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
... | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
... | [
"io.output.change",
"io.output.newline.add"
] | 822,454 | 822,455 | u844133200 | cpp |
p03008 | #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 N, a[2][3], b[3];
cin >> N;
rep(i, 2) rep(j, 3) cin >> a[i][j];
rep(i, 3) b[i] = a[1][i] - a[0][i];
vector<vector<ll>> dp1(4, vector<ll>(N + 1, 0));
rep(i, 3) {
rep(j, N +... | #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 N, a[2][3], b[3];
cin >> N;
rep(i, 2) rep(j, 3) cin >> a[i][j];
rep(i, 3) b[i] = a[1][i] - a[0][i];
vector<vector<ll>> dp1(4, vector<ll>(N + 1, 0));
rep(i, 3) {
rep(j, N +... | [
"literal.number.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 822,458 | 822,459 | u555962250 | cpp |
p03008 | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define lfs cout << fixed << setprecision(10)
#define ALL(a) (a).begin(), (a).end()
#define ALLR(a) (a).rbegin(), (a).rend()
#define spa << " " <<
#define test cout << "test" << endl;
#define fi first
#define se second
#define MP make_pair
#define PB push... | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define lfs cout << fixed << setprecision(10)
#define ALL(a) (a).begin(), (a).end()
#define ALLR(a) (a).rbegin(), (a).rend()
#define spa << " " <<
#define test cout << "test" << endl;
#define fi first
#define se second
#define MP make_pair
#define PB push... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 822,460 | 822,461 | u898167769 | cpp |
p03008 | // #define DEBUGGING
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()
template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
template <typename T, typename U> using P = pair<T, U>;
using ll = int... | // #define DEBUGGING
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()
template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
template <typename T, typename U> using P = pair<T, U>;
using ll = int... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 822,462 | 822,463 | u216962796 | cpp |
p03008 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using ll = long long;
using P = pair<ll, ll>;
ll solve(vector<P> p, ll n) {
ll ans = n;
if (p.size() == 1) {
ans = n / p[0].first * p[0].second + n % p[0].first;
} else if (p.size() == 2) {
for (ll i = 0; i <... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using ll = long long;
using P = pair<ll, ll>;
ll solve(vector<P> p, ll n) {
ll ans = n;
if (p.size() == 1) {
ans = n / p[0].first * p[0].second + n % p[0].first;
} else if (p.size() == 2) {
for (ll i = 0; i <... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 822,466 | 822,467 | u970690920 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, k;
cin >> i >> j >> k;
cout << min(i, j) + min(j, k) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, k;
cin >> i >> j >> k;
cout << min(i, j) + min(max(i, j), k) << endl;
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 822,585 | 822,586 | u319965179 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a + b + c - (max(a, b) && max(b, c)) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a + b + c - max(max(a, b), max(b, c)) << endl;
}
| [
"call.add",
"io.output.change"
] | 822,589 | 822,590 | u751515087 | cpp |
p03011 | #include <iostream>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
cout << p + q + r - min(min(p, q), r) << endl;
} | #include <iostream>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
cout << p + q + r - max(max(p, q), r) << endl;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 822,591 | 822,592 | u880449276 | cpp |
p03011 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int p, q, r;
cin >> p >> q >> r;
if (p > q && p > r)
cout << q + r << endl;
else if (q > p && q > r)
cout << p + r << endl;
else
cout << p + q << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int p, q, r;
cin >> p >> q >> r;
if (p >= q && p >= r)
cout << q + r << endl;
else if (q >= p && q >= r)
cout << p + r << endl;
else
cout << p + q << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 822,599 | 822,600 | u965095643 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int m;
m = max((a, b), c);
cout << a + b + c - m << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int m;
m = max(max(a, b), c);
cout << a + b + c - m << endl;
} | [
"call.add",
"call.arguments.change"
] | 822,614 | 822,615 | u668010224 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int m;
m = max((a, b), c);
cout << a + b + c - m << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int m;
m = max({a, b, c});
cout << a + b + c - m << endl;
} | [
"assignment.value.change",
"call.arguments.change"
] | 822,614 | 822,616 | u668010224 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
int main() {
int P, Q, R;
cin >> P... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
int main() {
int P, Q, R;
cin >> P... | [
"identifier.change",
"io.output.change"
] | 822,617 | 822,618 | u893239355 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, p, q, r;
cin >> p >> q >> r;
if (p > q && p > r) {
a = q + r;
}
if (q > p && q > r) {
a = p + r;
}
if (r > p && r > q) {
a = p + q;
}
cout << a;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, p, q, r;
cin >> p >> q >> r;
if (p >= q && p >= r) {
a = q + r;
}
if (q >= p && q >= r) {
a = p + r;
}
if (r >= p && r >= q) {
a = p + q;
}
cout << a;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 822,623 | 822,622 | u642426958 | cpp |
p03011 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath> //sqrt pow
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath> //sqrt pow
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include... | [
"misc.opposites",
"identifier.change",
"call.function.change"
] | 822,632 | 822,633 | u396266329 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
cout << min(P, min(Q, R));
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
cout << min(P + Q, min(Q + R, R + P));
} | [
"expression.operation.binary.add"
] | 822,640 | 822,641 | u391725672 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int m = max(a, (b, c));
cout << a + b + c - m << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int d = max(a, max(b, c));
cout << a + b + c - d << endl;
}
| [
"variable_declaration.name.change",
"identifier.change",
"call.add",
"call.arguments.change",
"io.output.change"
] | 822,661 | 822,662 | u258387753 | cpp |
p03011 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define ll long long
#define MAX 100005
#define NIL -1
int n, pos;
vector<int> pre, in, post;
void rec(int l, int r) {
if (l >= 0)
return;
int root = pre[pos++];
int m = distance(in.beg... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define ll long long
#define MAX 100005
#define NIL -1
int n, pos;
vector<int> pre, in, post;
void rec(int l, int r) {
if (l >= 0)
return;
int root = pre[pos++];
int m = distance(in.beg... | [
"assignment.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 822,663 | 822,664 | u101048376 | cpp |
p03011 | #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 p, q, r;
cin >> p >> q >> r;
int ans = min(r + q, min(p + q, q + r));
cout << ans << endl;
return 0;
}
| #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 p, q, r;
cin >> p >> q >> r;
int ans = min(r + p, min(p + q, q + r));
cout << ans << endl;
return 0;
}
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 822,667 | 822,668 | u194930818 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define vvec(m, n) vector<vector<int>>(int(m), vector<int>(n))
#define ALL(a) (a).begin(), (a).end()
using ll = long long;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
int ans = P + Q + R - min(P, min(Q, R));
cout ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define vvec(m, n) vector<vector<int>>(int(m), vector<int>(n))
#define ALL(a) (a).begin(), (a).end()
using ll = long long;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
int ans = P + Q + R - max(P, max(Q, R));
cout ... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 822,693 | 822,694 | u842897677 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int p, q, r, pq, qr, rp;
cin >> p >> q >> r;
pq = p + q;
qr = q + r;
rp = r + p;
cout << min(pq, (qr, rp)) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int p, q, r, pq, qr, rp;
cin >> p >> q >> r;
pq = p + q;
qr = q + r;
rp = r + p;
cout << min(pq, min(qr, rp)) << endl;
} | [
"call.add",
"call.arguments.change"
] | 822,698 | 822,699 | u921792500 | cpp |
p03011 | #include <stdio.h>
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
int sum = a + b, ans = b + c, num = c + a;
int temp;
if (sum < ans) {
temp = sum;
sum = ans;
ans = temp;
}
if (num < ans) {
temp = num;
num = ans;
ans = num;
}
printf("%d", ans);
return 0;
}
| #include <stdio.h>
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
int sum = a + b, ans = b + c, num = c + a;
int temp;
if (sum < ans) {
temp = sum;
sum = ans;
ans = temp;
}
if (num < ans) {
temp = num;
num = ans;
ans = temp;
}
printf("%d", ans);
return 0;
}
| [
"assignment.value.change",
"identifier.change"
] | 822,700 | 822,701 | u018679195 | cpp |
p03011 | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (long long)(n); ++i)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <clas... | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (long long)(n); ++i)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <clas... | [
"identifier.change",
"io.output.change"
] | 822,702 | 822,703 | u371149954 | cpp |
p03011 | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
int p, q, r;
cin >> p >> q >> r;
cout << min({p + r, q + r, r + p}) << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
int p, q, r;
cin >> p >> q >> r;
cout << min({p + q, q + r, r + p}) << endl;
return 0;
}
| [
"identifier.change",
"io.output.change"
] | 822,704 | 822,705 | u371149954 | cpp |
p03011 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = ... | [
"identifier.change",
"io.output.change"
] | 822,729 | 822,730 | u366581326 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a < b)
swap(a, b);
if (b < c)
swap(b, c);
cout << a + b << '\n';
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a > b)
swap(a, b);
if (b > c)
swap(b, c);
cout << a + b << '\n';
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 822,735 | 822,736 | u600244905 | cpp |
p03011 | #include <bits/stdc++.h>
#define rep0(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
vector<int> v(3);
v[0] = P;
v[1] = Q;
v[2] = R;
sort(v.begin(), v.... | #include <bits/stdc++.h>
#define rep0(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
vector<int> v(3);
v[0] = P;
v[1] = Q;
v[2] = R;
sort(v.begin(), v.... | [
"call.function.change",
"call.arguments.change"
] | 822,739 | 822,740 | u290292036 | cpp |
p03011 | #include <bits/stdc++.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++)
typedef long long int ll;
typedef unsigned long long int ull;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c, ans;
string s, t;
cin ... | #include <bits/stdc++.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++)
typedef long long int ll;
typedef unsigned long long int ull;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c, ans;
string s, t;
cin ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 822,754 | 822,755 | u906199847 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
// TYPEDEF
// ----------------------------------------
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pair;
typedef vector<ll> vll;
typedef vector<vector<ll>> Graph;
typedef vector<string> vs;
typedef vector<pair<ll, ll>> Pll;
typedef queue<ll> qll;
//... | #include <bits/stdc++.h>
using namespace std;
// TYPEDEF
// ----------------------------------------
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pair;
typedef vector<ll> vll;
typedef vector<vector<ll>> Graph;
typedef vector<string> vs;
typedef vector<pair<ll, ll>> Pll;
typedef queue<ll> qll;
//... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 822,756 | 822,757 | u644224332 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << min(min(A, B), C) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << min(min(A + B, B + C), A + C) << endl;
} | [
"expression.operation.binary.add"
] | 822,758 | 822,759 | u991713078 | cpp |
p03011 | // BISMILLAHHIR RAHMANIR RAHIM
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
#define min3(a, b, c) min(a, min(b, c))
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define PI 2 * acos(0.0)
#define MOD 998244353
int main() {
int ... | // BISMILLAHHIR RAHMANIR RAHIM
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
#define min3(a, b, c) min(a, min(b, c))
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define PI 2 * acos(0.0)
#define MOD 998244353
int main() {
int ... | [] | 822,785 | 822,786 | u605722102 | cpp |
p03011 | // BISMILLAHHIR RAHMANIR RAHIM
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
#define min3(a, b, c) min(a, min(b, c))
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define PI 2 * acos(0.0)
#define MOD 998244353
int main() {
int ... | // BISMILLAHHIR RAHMANIR RAHIM
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
#define min3(a, b, c) min(a, min(b, c))
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define PI 2 * acos(0.0)
#define MOD 998244353
int main() {
int ... | [
"assignment.add"
] | 822,787 | 822,786 | u605722102 | cpp |
p03011 | // BISMILLAHHIR RAHMANIR RAHIM
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
#define min3(a, b, c) min(a, min(b, c))
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define PI 2 * acos(0.0)
#define MOD 998244353
int main() {
int ... | // BISMILLAHHIR RAHMANIR RAHIM
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
#define min3(a, b, c) min(a, min(b, c))
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define PI 2 * acos(0.0)
#define MOD 998244353
int main() {
int ... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.add"
] | 822,788 | 822,786 | u605722102 | cpp |
p03011 | #include <bits/stdc++.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int a, b, c, d;
cin >> a >> b >> c;
d = a + b + c;
cout << max(a, max(b, c)) + (d - max(a, max(b, c)) - min(a, min(b, c)));
}
| #include <bits/stdc++.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int a, b, c, d;
cin >> a >> b >> c;
d = a + b + c;
cout << min(a, min(b, c)) + (d - max(a, max(b, c)) - min(a, min(b, c)));
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 822,791 | 822,792 | u683078179 | cpp |
p03011 |
#include <bits/stdc++.h>
using namespace std;
void Main() {
int p, q, r;
cin >> p >> q >> r;
cout << p + q + r - min({p, q, r});
}
int main(void) {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed << std::setprecision(10);
#ifdef DEBUG_BUILD
while (true) {
Main();
c... |
#include <bits/stdc++.h>
using namespace std;
void Main() {
int p, q, r;
cin >> p >> q >> r;
cout << p + q + r - max({p, q, r});
}
int main(void) {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed << std::setprecision(10);
#ifdef DEBUG_BUILD
while (true) {
Main();
c... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 822,801 | 822,802 | u588369531 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, m;
cin >> a >> b >> c;
m = min({a, b, c});
cout << a + b + c - m << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, m;
cin >> a >> b >> c;
m = max({a, b, c});
cout << a + b + c - m << endl;
}
| [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 822,803 | 822,804 | u522993719 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
ll a, b, c;
cin >> a >> b >> c;
ll d = min(c, min(a, b));
cout << a + b + c - d;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
ll a, b, c;
cin >> a >> b >> c;
ll d = max(max(a, b), c);
cout << a + b + c - d;
return 0;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"call.arguments.add"
] | 822,805 | 822,806 | u548977290 | cpp |
p03011 | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint mod = 998244353;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
template <class T> inline void YES(T cond... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint mod = 998244353;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
template <class T> inline void YES(T cond... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 822,807 | 822,808 | u115888500 | cpp |
p03011 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min((a + b, b + c), a + c) << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(min(a + b, b + c), a + c) << endl;
return 0;
} | [
"call.add",
"call.arguments.change"
] | 822,815 | 822,816 | u745267317 | cpp |
p03011 | #include <iostream>
using namespace std;
int main(void) {
int p, q, r;
cin >> p >> q >> r;
int ac, ab, bc;
ac = p + q;
ab = q + r;
bc = r + p;
if (ac < ab && ac < bc) {
cout << ac << endl;
} else if (ab < bc && ab < ac) {
cout << ab << endl;
} else {
cout << bc << endl;
}
} | #include <iostream>
using namespace std;
int main(void) {
int p, q, r;
cin >> p >> q >> r;
int ac, ab, bc;
ac = p + q;
ab = q + r;
bc = r + p;
if (ac <= ab && ac <= bc) {
cout << ac << endl;
} else if (ab <= bc && ab <= ac) {
cout << ab << endl;
} else {
cout << bc << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 822,819 | 822,820 | u693378622 | cpp |
p03011 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define bcnt __builtin_popcountll
using namespace std;
#ifdef LOCAL
#include <... |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define bcnt __builtin_popcountll
using namespace std;
#ifdef LOCAL
#include <... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 822,824 | 822,825 | u089177147 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.