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 8
values |
|---|---|---|---|---|---|---|---|
p03096 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, l, r) for (int i = (int)(l); i < (int)(r); i++)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)x.size())
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, l, r) for (int i = (int)(l); i < (int)(r); i++)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)x.size())
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> ... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 907,205 | 907,206 | u057866967 | cpp |
p03096 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int mod = 1000000007;
void solve();
int main(void) {
int N;
cin >> N;
int C[N + 1] = {};
rep(i, N) cin >> C[i + 1];
ll dp[N + 1][2];
int prev_c[N + 1] = {}; // prev_c[i]: 色c_iが一番最近に現れた場所
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int mod = 1000000007;
void solve();
int main(void) {
int N;
cin >> N;
int C[N + 1] = {};
rep(i, N) cin >> C[i + 1];
ll dp[N + 1][2];
int prev_c[200001] = {}; // prev_c[i]: 色iが一番最近に現れた場所
d... | [
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 907,211 | 907,212 | u882620594 | cpp |
p03096 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
constexpr ll infl = 10000000000000000LL;
constexpr int inf = 1000000000;
int... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
constexpr ll infl = 10000000000000000LL;
constexpr int inf = 1000000000;
int... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 907,217 | 907,218 | u577747009 | cpp |
p03096 | //#define _AOJ_
/*vvv>
zzzzzI
.---. zzuzuI .vgggg&,.
+++++= dAC:|I .WbbWo JMM9^```?TMB` ..&gNNg,. gggggggJ, qgggggggg]
(&&&&&&&&[ c+OA&J, (&&&&&&+J, .cJeAA&-. (&&&&&&&&x .&AA&=-.
+++++= dTqk|I Xpbpbp JM#` (M#^ ?MMp MM| +TMN. JMF '
|yk ` dVY 7Vk,... | //#define _AOJ_
/*vvv>
zzzzzI
.---. zzuzuI .vgggg&,.
+++++= dAC:|I .WbbWo JMM9^```?TMB` ..&gNNg,. gggggggJ, qgggggggg]
(&&&&&&&&[ c+OA&J, (&&&&&&+J, .cJeAA&-. (&&&&&&&&x .&AA&=-.
+++++= dTqk|I Xpbpbp JM#` (M#^ ?MMp MM| +TMN. JMF '
|yk ` dVY 7Vk,... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 907,225 | 907,226 | u675296835 | cpp |
p03096 | //#define _AOJ_
/*vvv>
zzzzzI
.---. zzuzuI .vgggg&,.
+++++= dAC:|I .WbbWo JMM9^```?TMB` ..&gNNg,. gggggggJ, qgggggggg]
(&&&&&&&&[ c+OA&J, (&&&&&&+J, .cJeAA&-. (&&&&&&&&x .&AA&=-.
+++++= dTqk|I Xpbpbp JM#` (M#^ ?MMp MM| +TMN. JMF '
|yk ` dVY 7Vk,... | //#define _AOJ_
/*vvv>
zzzzzI
.---. zzuzuI .vgggg&,.
+++++= dAC:|I .WbbWo JMM9^```?TMB` ..&gNNg,. gggggggJ, qgggggggg]
(&&&&&&&&[ c+OA&J, (&&&&&&+J, .cJeAA&-. (&&&&&&&&x .&AA&=-.
+++++= dTqk|I Xpbpbp JM#` (M#^ ?MMp MM| +TMN. JMF '
|yk ` dVY 7Vk,... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 907,227 | 907,228 | u675296835 | cpp |
p03096 | #include <algorithm> // minmax, sort, swap
#include <climits> // INT_MIN, LLONG_MIN
#include <cmath> // long, trig, pow
#include <cstdio> // printf, scanf
#include <deque> // deque
#include <functional> // std::function<void(int)>
#include <iomanip> // cout<<setprecision(n)
#in... | #include <algorithm> // minmax, sort, swap
#include <climits> // INT_MIN, LLONG_MIN
#include <cmath> // long, trig, pow
#include <cstdio> // printf, scanf
#include <deque> // deque
#include <functional> // std::function<void(int)>
#include <iomanip> // cout<<setprecision(n)
#in... | [
"call.remove"
] | 907,233 | 907,234 | u128456980 | cpp |
p03096 | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
typedef long long ll;
typedef long double ld;
typedef complex<ld... | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
typedef long long ll;
typedef long double ld;
typedef complex<ld... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.variable.change"
] | 907,237 | 907,238 | u728498447 | cpp |
p03096 | #include <bits/stdc++.h>
using namespace std;
int main() {
const int mod = 1000000007;
int n, patterns = 1, prev = 0;
cin >> n;
vector<int> p(n + 1);
for (int i = 0; i < n; i++) {
int c, w;
cin >> c;
if (c == prev)
continue;
w = (patterns + p.at(c)) % mod;
patterns = w;
p.at(c) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
const int mod = 1000000007;
int n, patterns = 1, prev = 0;
cin >> n;
vector<int> p(200001);
for (int i = 0; i < n; i++) {
int c, w;
cin >> c;
if (c == prev)
continue;
w = (patterns + p.at(c)) % mod;
patterns = w;
p.at(c)... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 907,243 | 907,244 | u697658632 | cpp |
p03096 | #include <bits/stdc++.h>
#define maxn 200010
#define mod 1000000007
using namespace std;
int a[maxn], f[maxn], sum[maxn];
int main() {
int n, cur = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
int x;
scanf("%d", &x);
if (cur == 0 || x != a[cur])
a[++cur] = x;
}
f[0] = 1;
for (int i =... | #include <bits/stdc++.h>
#define maxn 200010
#define mod 1000000007
using namespace std;
int a[maxn], f[maxn], sum[maxn];
int main() {
int n, cur = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
int x;
scanf("%d", &x);
if (cur == 0 || x != a[cur])
a[++cur] = x;
}
f[0] = 1;
for (int i =... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"io.output.change"
] | 907,265 | 907,266 | u276642373 | cpp |
p03096 | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> C;
for (int i = 0; i < N; i++) {
int c;
cin >> c;
if (i == 0) {
C.emplace_back(c);
} else if (C.back() != c) {
C.emplace_back(c);
}
}
vec... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> C;
for (int i = 0; i < N; i++) {
int c;
cin >> c;
if (i == 0) {
C.emplace_back(c);
} else if (C.back() != c) {
C.emplace_back(c);
}
}
vec... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 907,267 | 907,268 | u413492096 | cpp |
p03096 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
ll const MOD = 1e9 + 7;
int main() {
int N;
cin >> N;
vi C;
for (int i = 0; i < N; ++i) {
int c;
cin >> c;
C.push_back(c);
}
ll dp[N];
ll c_cum[N + 1];
memset(c_cum, 0, sizeof(c_cum));
dp[0] = 1;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
ll const MOD = 1e9 + 7;
int main() {
int N;
cin >> N;
vi C;
for (int i = 0; i < N; ++i) {
int c;
cin >> c;
C.push_back(c);
}
ll dp[200010];
ll c_cum[200010];
memset(c_cum, 0, sizeof(c_cum));
dp[0]... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 907,278 | 907,279 | u826487371 | cpp |
p03096 | #include <bits/stdc++.h>
using namespace std;
#define reps(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) reps(i, 0, n)
int N;
int mod = 1000000007;
int main() {
int mx = 200000;
cin >> N;
vector<int> memoi(N, 0);
vector<int> memoans(mx, 0);
unsigned int ans = 1;
int nowc;
rep(i, N) {
cin >... | #include <bits/stdc++.h>
using namespace std;
#define reps(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) reps(i, 0, n)
int N;
int mod = 1000000007;
int main() {
int mx = 200000;
cin >> N;
vector<int> memoi(mx, 0);
vector<int> memoans(mx, 0);
unsigned int ans = 1;
int nowc;
rep(i, N) {
cin ... | [
"identifier.change",
"call.arguments.change"
] | 907,281 | 907,282 | u016531517 | cpp |
p03096 | #include <bits/stdc++.h>
using namespace std;
#define reps(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) reps(i, 0, n)
int N;
int mod = 1000000007;
int main() {
int mx = 200000;
cin >> N;
vector<int> memoi(N, 0);
vector<int> memoans(mx, 0);
unsigned int ans = 1;
int nowc;
rep(i, N) {
cin >... | #include <bits/stdc++.h>
using namespace std;
#define reps(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) reps(i, 0, n)
int N;
int mod = 1000000007;
int main() {
int mx = 300000;
cin >> N;
vector<int> memoi(mx, 0);
vector<int> memoans(mx, 0);
unsigned int ans = 1;
int nowc;
rep(i, N) {
cin ... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"call.arguments.change"
] | 907,281 | 907,283 | u016531517 | cpp |
p03096 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define getchar ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define getchar ... | [
"call.add"
] | 907,286 | 907,287 | u096883693 | cpp |
p03096 | #include <iostream>
#include <vector>
int main() {
long long mod = 1000000007;
int n;
std::vector<int> aList;
std::vector<int> colorList;
std::vector<long long> dpList;
std::cin >> n;
aList.resize(n);
colorList.resize(n + 1, -1);
dpList.resize(n, 0);
for (int i = 0; i < n; i++)
std::cin >> a... | #include <iostream>
#include <vector>
int main() {
long long mod = 1000000007;
int n;
std::vector<int> aList;
std::vector<int> colorList;
std::vector<long long> dpList;
std::cin >> n;
aList.resize(n);
colorList.resize(200001, -1);
dpList.resize(n, 0);
for (int i = 0; i < n; i++)
std::cin >> ... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 907,302 | 907,303 | u865621256 | cpp |
p03096 | #include <iostream>
#include <vector>
int main() {
long long mod = 1000000007;
int n;
std::vector<int> aList;
std::vector<int> colorList;
std::vector<long long> dpList;
std::cin >> n;
aList.resize(n);
colorList.resize(n + 1, -1);
dpList.resize(n, 0);
for (int i = 0; i < n; i++)
std::cin >> a... | #include <iostream>
#include <vector>
int main() {
long long mod = 1000000007;
int n;
std::vector<int> aList;
std::vector<int> colorList;
std::vector<long long> dpList;
std::cin >> n;
aList.resize(n);
colorList.resize(200001, -1);
dpList.resize(n, 0);
for (int i = 0; i < n; i++)
std::cin >> ... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 907,304 | 907,303 | u865621256 | cpp |
p03096 | // i ll be the king
#include <bits/stdc++.h>
#define ll long long int
#define sync \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define input(arr, n) ... | // i ll be the king
#include <bits/stdc++.h>
#define ll long long int
#define sync \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define input(arr, n) ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.add"
] | 907,305 | 907,306 | u181228520 | cpp |
p03096 | #include <iostream>
#include <vector>
using namespace std;
int N;
int mod = 1e9 + 7;
int main() {
cin >> N;
vector<long long> dp(N + 1, 1);
vector<int> p(N + 1, -1); // p[i]: 最後の色iの位置
int c;
cin >> c;
p[c] = 1;
dp[0] = 1;
for (int i = 1; i < N; i++) {
cin >> c;
dp[i] = dp[i - 1];
if (p[c] ... | #include <iostream>
#include <vector>
using namespace std;
int N;
int mod = 1e9 + 7;
int main() {
cin >> N;
vector<long long> dp(N + 1, 1);
vector<int> p(2e5 + 1, -1); // p[i]: 最後の色iの位置
int c;
cin >> c;
p[c] = 1;
dp[0] = 1;
for (int i = 1; i < N; i++) {
cin >> c;
dp[i] = dp[i - 1];
if (p[c... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change"
] | 907,307 | 907,308 | u430527172 | cpp |
p03096 | #include <bits/stdc++.h>
#define N 200010
using namespace std;
const int p = 1e9 + 7;
int n, cnt, x, a[N], pre;
int dp[N], ans[N];
inline int read() {
int x = 0, sgn = 1;
char ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-')
sgn = -1;
for (; isdigit(ch); ch = getchar())
x = (x <... | #include <bits/stdc++.h>
#define N 200010
using namespace std;
const int p = 1e9 + 7;
int n, cnt, x, a[N], pre;
long long dp[N], ans[N];
inline int read() {
int x = 0, sgn = 1;
char ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-')
sgn = -1;
for (; isdigit(ch); ch = getchar())
x ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"io.output.change"
] | 907,311 | 907,312 | u416562035 | cpp |
p03096 | #include <bits/stdc++.h>
#define N 100010
using namespace std;
const int p = 1e9 + 7;
int n, cnt, x, a[N], pre;
int dp[N], ans[N];
inline int read() {
int x = 0, sgn = 1;
char ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-')
sgn = -1;
for (; isdigit(ch); ch = getchar())
x = (x <... | #include <bits/stdc++.h>
#define N 200010
using namespace std;
const int p = 1e9 + 7;
int n, cnt, x, a[N], pre;
long long dp[N], ans[N];
inline int read() {
int x = 0, sgn = 1;
char ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-')
sgn = -1;
for (; isdigit(ch); ch = getchar())
x ... | [
"preprocessor.define.value.change",
"literal.integer.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change",
"call.a... | 907,313 | 907,312 | u416562035 | cpp |
p03096 | #include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = long long;
using std::cin;
using std::cout;
using std::endl;
int main() {
int n;
scanf("%d", &n);
std::vector<int> c(n);
for (int i = 0; i < n; i++) {
scanf("%d", &c[i]);
c[i]--;
}
const int M = 2e5 + 10;
std::... | #include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = long long;
using std::cin;
using std::cout;
using std::endl;
int main() {
int n;
scanf("%d", &n);
std::vector<int> c(n);
for (int i = 0; i < n; i++) {
scanf("%d", &c[i]);
c[i]--;
}
const int M = 2e5 + 10;
std::... | [
"identifier.change",
"call.arguments.change"
] | 907,323 | 907,324 | u424655672 | cpp |
p03096 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | [
"assignment.value.change"
] | 907,333 | 907,334 | u811004127 | cpp |
p03096 | #include <bits/stdc++.h>
using namespace std;
//#define double long double
typedef pair<int, int> ii;
typedef pair<int, long long> il;
typedef pair<long long, long long> ll;
typedef pair<ll, int> lli;
typedef pair<long long, int> li;
typedef pair<double, double> dd;
typedef pair<ii, int> iii;
typedef pair<double, in... | #include <bits/stdc++.h>
using namespace std;
//#define double long double
typedef pair<int, int> ii;
typedef pair<int, long long> il;
typedef pair<long long, long long> ll;
typedef pair<ll, int> lli;
typedef pair<long long, int> li;
typedef pair<double, double> dd;
typedef pair<ii, int> iii;
typedef pair<double, in... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 907,335 | 907,336 | u837724941 | cpp |
p03096 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
typedef long long LL;
typedef pair<int, int> PII;
const int MOD = int(1e9) + 7;
int n;
int c[200005], d[200005];
int pos[200005];
int main() {
scanf("%d", &n);
forn(i, n... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
typedef long long LL;
typedef pair<int, int> PII;
const int MOD = int(1e9) + 7;
int n;
int c[200005], d[200005];
int pos[200005];
int main() {
scanf("%d", &n);
forn(i, n... | [] | 907,337 | 907,338 | u155202361 | cpp |
p03096 | #include <bits/stdc++.h>
using namespace std;
const int MaxN = 2e5 + 25;
const int MOD = 1e9 + 7;
int dp[MaxN];
int n, a[MaxN];
int sumDP[MaxN];
void add(int &x, int y) {
x += y;
if (x >= MOD)
x -= MOD;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// freopen("input.txt", "r", s... | #include <bits/stdc++.h>
using namespace std;
const int MaxN = 2e5 + 25;
const int MOD = 1e9 + 7;
int dp[MaxN];
int n, a[MaxN];
int sumDP[MaxN];
void add(int &x, int y) {
x += y;
if (x >= MOD)
x -= MOD;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// freopen("input.txt", "r", s... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 907,341 | 907,342 | u784576081 | cpp |
p03096 | #include <bits/stdc++.h>
#define MOD (1000000007)
using namespace std;
const int N = 2e5 + 10;
int f[N], g[N];
int num[N], p;
int main() {
ios::sync_with_stdio(false), cin.tie(0);
int n;
cin >> n;
int v;
for (int i = 0; i < n; i++) {
cin >> v;
if (num[p] != v)
num[++p] = v;
}
f[0] = 1;
f... | #include <bits/stdc++.h>
#define MOD (1000000007)
using namespace std;
const int N = 2e5 + 10;
int f[N], g[N];
int num[N], p;
int main() {
ios::sync_with_stdio(false), cin.tie(0);
int n;
cin >> n;
int v;
for (int i = 0; i < n; i++) {
cin >> v;
if (num[p] != v)
num[++p] = v;
}
f[0] = 1;
f... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 907,353 | 907,354 | u484351360 | cpp |
p03096 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) a.begin(), a.end()
const int MOD = 1e9 + 7;
struct mint {
int n;
mint(int n_ = 0) : n(n... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) a.begin(), a.end()
const int MOD = 1e9 + 7;
struct mint {
int n;
mint(int n_ = 0) : n(n... | [] | 907,362 | 907,363 | u006493569 | cpp |
p03096 | #include <bits/stdc++.h>
#define maxn 200005
#define ll long long
#define ld double
#define mod 1000000007
using namespace std;
ll dp[maxn];
ll sum[maxn];
int n;
int c[maxn];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> c[i];
dp[n + 1] = 1;
for (int i = n; i >= 1; i--) {
dp[i] = dp[i + 1];... | #include <bits/stdc++.h>
#define maxn 200005
#define ll long long
#define ld double
#define mod 1000000007
using namespace std;
ll dp[maxn];
ll sum[maxn];
int n;
int c[maxn];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> c[i];
dp[n + 1] = 1;
for (int i = n; i >= 1; i--) {
dp[i] = dp[i + 1];... | [
"assignment.change"
] | 907,364 | 907,365 | u286411981 | cpp |
p03097 | #include <bits/stdc++.h>
#define pb push_back
#define pll pair<ll, ll>
#define mp make_pair
#define pyshnapyshnakaa \
ios_base ::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
#define pb push_back
#define pll pair<ll, ll>
#define mp make_pair
#define pyshnapyshnakaa \
ios_base ::sync_with_stdio(0); \
cin.tie(0); ... | [
"identifier.change",
"call.arguments.change"
] | 907,370 | 907,371 | u051270344 | cpp |
p03097 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ALL(obj) (obj).begin(), (obj).end()
#define SPEED \
cin.tie(0); \
ios::sync_with_stdio(false);
template <cla... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ALL(obj) (obj).begin(), (obj).end()
#define SPEED \
cin.tie(0); \
ios::sync_with_stdio(false);
template <cla... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 907,372 | 907,373 | u898651494 | cpp |
p03095 | // スタックサイズ: 100MB
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef int64_t ll;
const ll IN... | // スタックサイズ: 100MB
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef int64_t ll;
const ll IN... | [] | 907,396 | 907,397 | u511401499 | cpp |
p03095 | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
vector<int> cnt(26);
for (int i = 0; i < N; i++) {
cnt[S[i] - 'a']++;
}
long long ans = 1;
long long MOD = pow(10, 9) + 7;
for (int i = 0; i < 26; i++) {
ans *= cnt[i] + 1;
ans %= MOD;
}
if (ans... | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
vector<int> cnt(26);
for (int i = 0; i < N; i++) {
cnt[S[i] - 'a']++;
}
long long ans = 1;
long long MOD = pow(10, 9) + 7;
for (int i = 0; i < 26; i++) {
ans *= cnt[i] + 1;
ans %= MOD;
}
if (ans... | [
"expression.operation.binary.add"
] | 907,408 | 907,409 | u365956698 | cpp |
p03095 | //#include "pch.h"
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <bitset>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define ll long long
#define fri(n) for... | //#include "pch.h"
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <bitset>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define ll long long
#define fri(n) for... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 907,410 | 907,411 | u705931757 | cpp |
p03095 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include ... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include ... | [
"assignment.change"
] | 907,426 | 907,427 | u896838289 | cpp |
p03095 | #include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <cstring>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
... | #include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <cstring>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 907,430 | 907,431 | u003873207 | cpp |
p03096 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 907,450 | 907,451 | u880221923 | cpp |
p03096 | #include <bits/stdc++.h>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
/*
struct Edge
{
int to;
int weight;
Edge(int t, int w) : to(t), weight(w) {}
};
using Graph = vector<vector<Edge>>;
*/
using Graph = vector<vector... | #include <bits/stdc++.h>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
/*
struct Edge
{
int to;
int weight;
Edge(int t, int w) : to(t), weight(w) {}
};
using Graph = vector<vector<Edge>>;
*/
using Graph = vector<vector... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 907,456 | 907,457 | u665871498 | cpp |
p03096 | #include <bits/stdc++.h>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
/*
struct Edge
{
int to;
int weight;
Edge(int t, int w) : to(t), weight(w) {}
};
using Graph = vector<vector<Edge>>;
*/
using Graph = vector<vector... | #include <bits/stdc++.h>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
/*
struct Edge
{
int to;
int weight;
Edge(int t, int w) : to(t), weight(w) {}
};
using Graph = vector<vector<Edge>>;
*/
using Graph = vector<vector... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 907,458 | 907,457 | u665871498 | cpp |
p03096 | #include <bits/stdc++.h>
#define all(X) (X).begin(), (X).end()
#define rall(X) (X).rbegin(), (X).rend()
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define ff first
#define ss second
#define P 1000000007
#define in(x, a, b) (a <= x && x < b)
using namespace std;
using ll = l... | #include <bits/stdc++.h>
#define all(X) (X).begin(), (X).end()
#define rall(X) (X).rbegin(), (X).rend()
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define ff first
#define ss second
#define P 1000000007
#define in(x, a, b) (a <= x && x < b)
using namespace std;
using ll = l... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 907,459 | 907,460 | u425619511 | cpp |
p03096 | /*------------------------------------
........Bismillahir Rahmanir Rahim....
..........created by Abdul Aziz.......
------------------------------------*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#i... | /*------------------------------------
........Bismillahir Rahmanir Rahim....
..........created by Abdul Aziz.......
------------------------------------*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#i... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 907,463 | 907,462 | u931901821 | cpp |
p03097 | #include <iostream>
#include <stdio.h>
using namespace std;
int B[(1 << 18) + 1], N;
void solve(int m, int a, int b) {
if (m == 0)
return;
if (B[m]) {
printf("%d %d ", a, b);
return;
}
int bit = B[m & -m];
int s1 = a >> bit & 1, s2 = b >> bit & 1, p;
if (s1 != s2) {
int q = m ^ (1 << bit);
... | #include <iostream>
#include <stdio.h>
using namespace std;
int B[(1 << 18) + 1], N;
void solve(int m, int a, int b) {
if (m == 0)
return;
if (B[m] || m == 1) {
printf("%d %d ", a, b);
return;
}
int bit = B[m & -m];
int s1 = a >> bit & 1, s2 = b >> bit & 1, p;
if (s1 != s2) {
int q = m ^ (1 ... | [
"control_flow.branch.if.condition.change"
] | 907,488 | 907,489 | u931404549 | cpp |
p03097 | #include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef pair<double, double> pdd;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef vector<pii> vii;
typedef vector<int> vi;
typedef vector<vi> ... | #include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef pair<double, double> pdd;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef vector<pii> vii;
typedef vector<int> vi;
typedef vector<vi> ... | [
"assignment.change"
] | 907,502 | 907,503 | u640230853 | cpp |
p03098 | #include <cstdio>
#include <cstring>
#define RI register int
#define CI const int &
using namespace std;
const int N = 100005;
int n, k;
struct permutation {
int a[N];
inline permutation(void) { memset(a, 0, sizeof(a)); }
inline int &operator[](CI x) { return a[x]; }
inline friend permutation operator~(permutat... | #include <cstdio>
#include <cstring>
#define RI register int
#define CI const int &
using namespace std;
const int N = 100005;
int n, k;
struct permutation {
int a[N];
inline permutation(void) { memset(a, 0, sizeof(a)); }
inline int &operator[](CI x) { return a[x]; }
inline friend permutation operator~(permutat... | [
"assignment.change"
] | 907,517 | 907,518 | u803115645 | cpp |
p03098 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <queue>
using namespace std;
#define vi vector<int>
int n, k;
vi a[15];
int read() {
char c = getchar();
int res = 0;
while (c < '0' || c > '9')
c = getchar();
while (c >= '0' && c <= '... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <queue>
using namespace std;
#define vi vector<int>
int n, k;
vi a[7];
int read() {
char c = getchar();
int res = 0;
while (c < '0' || c > '9')
c = getchar();
while (c >= '0' && c <= '9... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.change",
"control_flow.loop.condition.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change"
] | 907,524 | 907,525 | u562042360 | cpp |
p03098 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define re... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define re... | [
"expression.operation.binary.add"
] | 907,526 | 907,527 | u742529680 | cpp |
p03098 | #include <bits/stdc++.h>
#include <complex>
#define pb push_back
#define pll pair<ll, ll>
#define MOMI using namespace std;
#define mp make_pair
#define pyshnapyshnakaa \
ios_base ::sync_with_stdio(0); \
cin.tie(0);... | #include <bits/stdc++.h>
#include <complex>
#define pb push_back
#define pll pair<ll, ll>
#define MOMI using namespace std;
#define mp make_pair
#define pyshnapyshnakaa \
ios_base ::sync_with_stdio(0); \
cin.tie(0);... | [
"expression.operation.binary.add"
] | 907,535 | 907,536 | u051270344 | cpp |
p03098 | #include <bits/stdc++.h>
#define vi vector<int>
using namespace std;
vi p, q, a[7];
int n, k, x;
vi mul(vi x, vi y) {
vi z;
for (int i = 0; i < x.size(); i++)
z.push_back(x[y[i]]);
return z;
}
vi inv(vi x) {
vi y(n);
for (int i = 0; i < x.size(); i++)
y[x[i]] = i;
return y;
}
vi qpow(vi x, int y) {
... | #include <bits/stdc++.h>
#define vi vector<int>
using namespace std;
vi p, q, a[7];
int n, k, x;
vi mul(vi x, vi y) {
vi z;
for (int i = 0; i < x.size(); i++)
z.push_back(x[y[i]]);
return z;
}
vi inv(vi x) {
vi y(n);
for (int i = 0; i < x.size(); i++)
y[x[i]] = i;
return y;
}
vi qpow(vi x, int y) {
... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 907,541 | 907,542 | u676323984 | cpp |
p03098 | #include <bits/stdc++.h>
using namespace std;
int n, m;
vector<int> inv(vector<int> a) {
vector<int> b(n);
for (int i = 0; i < n; i++) {
b[a[i]] = i;
}
return b;
}
vector<int> &operator*=(vector<int> &a, vector<int> b) {
vector<int> c(n);
for (int i = 0; i < n; i++) {
c[i] = a[b[i]];
}
a = c... | #include <bits/stdc++.h>
using namespace std;
int n, m;
vector<int> inv(vector<int> a) {
vector<int> b(n);
for (int i = 0; i < n; i++) {
b[a[i]] = i;
}
return b;
}
vector<int> &operator*=(vector<int> &a, vector<int> b) {
vector<int> c(n);
for (int i = 0; i < n; i++) {
c[i] = a[b[i]];
}
a = c... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 907,543 | 907,544 | u242534780 | cpp |
p03098 | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define SZ(x) ((int)x.size())
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define FORD(i, a, b) for (int i = a; i >= b; --i)
using namespace std;
typedef long long LL;
typedef pair<int, int> pa;
typedef vector<in... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define SZ(x) ((int)x.size())
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define FORD(i, a, b) for (int i = a; i >= b; --i)
using namespace std;
typedef long long LL;
typedef pair<int, int> pa;
typedef vector<in... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"io.output.change"
] | 907,545 | 907,546 | u651830993 | cpp |
p03098 | #include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define MAXN 100005
#define eps 1e-10
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef ... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define MAXN 100005
#define eps 1e-10
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 907,547 | 907,548 | u845980916 | cpp |
p03098 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
using vpii = vector<pii>;
vi fastexp(const vi &perm, int x) {
if (x > 1) {
int n = perm.size();
vi halfexp = fastexp(perm, x / 2);
vi re... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
using vpii = vector<pii>;
vi fastexp(const vi &perm, int x) {
if (x > 1) {
int n = perm.size();
vi halfexp = fastexp(perm, x / 2);
vi re... | [
"identifier.change",
"expression.operation.binary.change"
] | 907,555 | 907,556 | u839511400 | cpp |
p03098 | #include <bits/stdc++.h>
#define int long long
using namespace std;
void print(vector<int> a) {
for (int i = 0; i < a.size(); i++)
cout << a[i] + 1 << " ";
exit(0);
}
vector<int> rev(vector<int> &a) {
int n = a.size();
vector<int> res(n);
for (int i = 0; i < n; i++)
res[a[i]] = i;
return res;
}
vect... | #include <bits/stdc++.h>
#define int long long
using namespace std;
void print(vector<int> a) {
for (int i = 0; i < a.size(); i++)
cout << a[i] + 1 << " ";
exit(0);
}
vector<int> rev(vector<int> &a) {
int n = a.size();
vector<int> res(n);
for (int i = 0; i < n; i++)
res[a[i]] = i;
return res;
}
vect... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 907,557 | 907,558 | u053547321 | cpp |
p03098 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include... | [
"expression.operation.binary.add"
] | 907,559 | 907,560 | u035969230 | cpp |
p03098 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef complex<double> point;
#define xx real()
#define yy imag()
#define REP(i, a, b) for (int i = (a); i < (int)(b); i++)
#define REPN(i, a, b) for (int ... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef complex<double> point;
#define xx real()
#define yy imag()
#define REP(i, a, b) for (int i = (a); i < (int)(b); i++)
#define REPN(i, a, b) for (int ... | [
"literal.number.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 907,561 | 907,562 | u308650788 | cpp |
p03098 | #define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/STACK:256000000")
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#... | #define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/STACK:256000000")
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#... | [
"assignment.change"
] | 907,564 | 907,565 | u644276233 | cpp |
p03098 | #include <iostream>
using namespace std;
int n, k;
int a[100001];
int one[100001];
int t[100001];
void cpy(int *u, int *w) {
for (int i = 1; i <= n; i++)
w[i] = u[i];
}
int out(int *u) {
for (int i = 1; i <= n; i++)
cout << u[i] << ' ';
cout << endl;
return 0;
}
void mul(int *u, int *v, int *w) {
for ... | #include <iostream>
using namespace std;
int n, k;
int a[100001];
int one[100001];
int t[100001];
void cpy(int *u, int *w) {
for (int i = 1; i <= n; i++)
w[i] = u[i];
}
int out(int *u) {
for (int i = 1; i <= n; i++)
cout << u[i] << ' ';
cout << endl;
return 0;
}
void mul(int *u, int *v, int *w) {
for ... | [
"call.arguments.change",
"call.arguments.add"
] | 907,568 | 907,569 | u707303246 | cpp |
p03099 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <queue>
using namespace std;
long long read() {
char c = getchar();
long long res = 0;
while (c < '0' || c > '9')
c = getchar();
while (c >= '0' && c <= '9')
res = (res << 1) + (res... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <queue>
using namespace std;
long long read() {
char c = getchar();
long long res = 0;
while (c < '0' || c > '9')
c = getchar();
while (c >= '0' && c <= '9')
res = (res << 1) + (res... | [
"expression.operation.unary.arithmetic.add",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 907,579 | 907,580 | u562042360 | cpp |
p03101 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int H, W, h, w;
cin >> H >> W;
cin >> h >> W;
cout << ((H - h) * (W - w)) << endl;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int H, W, h, w;
cin >> H >> W;
cin >> h >> w;
cout << ((H - h) * (W - w)) << endl;
} | [
"identifier.change",
"expression.operation.binary.change"
] | 907,595 | 907,596 | u879294842 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << H * W - h * W - H * w - w * h;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << H * W - h * W - H * w + w * h;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 907,599 | 907,600 | u466865328 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, A, B;
cin >> H >> W >> A >> B;
cout << (H - A) * (W * B) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, A, B;
cin >> H >> W >> A >> B;
cout << (H - A) * (W - B) << endl;
}
| [
"expression.operator.arithmetic.change",
"io.output.change"
] | 907,617 | 907,618 | u740002394 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (ll)(n); i++)
int main() {
ll h, w;
cin >> h >> w;
ll n, m;
cin >> n >> m;
ll res = h * w;
res -= n * w + m * h;
res += n * w;
cout << res << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (ll)(n); i++)
int main() {
ll h, w;
cin >> h >> w;
ll n, m;
cin >> n >> m;
ll res = h * w;
res -= n * w + m * h;
res += n * m;
cout << res << endl;
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 907,623 | 907,624 | u785492958 | cpp |
p03101 | #include <bits/stdc++.h>
#define test \
int t; \
cin >> t; \
while (t--)
#define fast ... | #include <bits/stdc++.h>
#define test \
int t; \
cin >> t; \
while (t--)
#define fast ... | [
"expression.operation.binary.remove"
] | 907,625 | 907,626 | u446732668 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
//*
int a, b, c, d;
cin >> a >> b >> c >> d;
//*/
/*
vector<int> vec(3);
cin >> vec.at(0) >> vec.at(1) >> vec.at(2) ;
sort(vec.begin(), vec.end());
//*/
/*
if( b / a < c ){
cout << b / a << endl;
} else {
cout << c <<... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
//*
int a, b, c, d;
cin >> a >> b >> c >> d;
//*/
/*
vector<int> vec(3);
cin >> vec.at(0) >> vec.at(1) >> vec.at(2) ;
sort(vec.begin(), vec.end());
//*/
/*
if( b / a < c ){
cout << b / a << endl;
} else {
cout << c <<... | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 907,627 | 907,628 | u316555166 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << H * W - h * H - w * W + h * w << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << H * W - h * W - w * H + h * w << endl;
return 0;
}
| [
"identifier.change",
"io.output.change"
] | 907,635 | 907,636 | u319965179 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << (H - h) * (W * w) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << (H - h) * (W - w) << endl;
return 0;
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 907,637 | 907,638 | u381860804 | cpp |
p03101 | #include <iostream>
#include <string.h>
using namespace std;
int main() {
int H, W;
int h, w;
cin >> H >> W;
cin >> h, w;
int Z, z;
Z = H * W;
z = h * W + H * w;
if (H == h or W == w) {
std::cout << 0 << std::endl;
} else {
int R, r;
r = h * w;
R = Z - z + r;
std::cout << R << st... | #include <iostream>
#include <string.h>
using namespace std;
int main() {
int H, W;
int h, w;
cin >> H >> W;
cin >> h >> w;
int Z, z;
Z = H * W;
z = h * W + H * w;
if (H == h or W == w) {
std::cout << 0 << std::endl;
} else {
int R, r;
r = h * w;
R = Z - z + r;
std::cout << R << ... | [] | 907,642 | 907,643 | u863311660 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << (a - c) * (d - b) << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << (a - c) * (b - d) << endl;
} | [
"expression.operation.binary.remove"
] | 907,648 | 907,649 | u225777148 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pi... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 907,658 | 907,659 | u789323170 | cpp |
p03101 | #include <bits/stdc++.h>
#include <vector>
using namespace std;
int main() {
int R, C, r, c;
cin >> R >> C;
cin >> r >> c;
int ans = R * C - (r * C + c * R);
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <vector>
using namespace std;
int main() {
int R, C, r, c;
cin >> R >> C;
cin >> r >> c;
int ans = R * C - (r * C + (c * R - c * r));
cout << ans << endl;
return 0;
}
| [] | 907,668 | 907,669 | u278032600 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << (a - c) * (b - c) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << (a - c) * (b - d) << endl;
} | [
"identifier.change",
"io.output.change"
] | 907,672 | 907,673 | u652660628 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w, i, j;
cin >> h >> w >> i >> j;
int ans = (h - i) * (w - j);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w, i, j;
cin >> h >> w >> i >> j;
int ans = (h - i) * (w - j);
cout << ans;
return 0;
}
| [] | 907,674 | 907,675 | u000770457 | cpp |
p03101 | #include <algorithm>
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(obj) (obj).begin(), (obj).end()
using namespace std;
typedef long long ll;
int main() {
int H, W, h, w;
cin >> W >> H >> h >> w;
cout << (H - h) * (W - w) << endl;
return 0;
}
| #include <algorithm>
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(obj) (obj).begin(), (obj).end()
using namespace std;
typedef long long ll;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << (H - h) * (W - w) << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 907,676 | 907,677 | u941353203 | cpp |
p03101 | #include <bits/stdc++.h>
#define int long long
#define mod 1000000007
#define trace(x) cerr << #x << ": " << x << " " << endl
#define tarce(x) cerr << #x << ": " << x << " " << endl
#define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl
#define trace3(x, y, z) ... | #include <bits/stdc++.h>
#define int long long
#define mod 1000000007
#define trace(x) cerr << #x << ": " << x << " " << endl
#define tarce(x) cerr << #x << ": " << x << " " << endl
#define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl
#define trace3(x, y, z) ... | [
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 907,678 | 907,679 | u125467827 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
int h, w;
cin >> h >> w;
cout << (H - h) * (W - h) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
int h, w;
cin >> h >> w;
cout << (H - h) * (W - w) << endl;
} | [
"identifier.change",
"io.output.change"
] | 907,680 | 907,681 | u515131769 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << H * W - h * W - H * w << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << H * W - h * W - H * w + h * w << endl;
}
| [
"expression.operation.binary.add"
] | 907,692 | 907,693 | u834753207 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int H, W;
cin >> H >> W;
int h, w;
cin >> h >> w;
int ans = 0;
ans += H * W;
ans -= h * W;
ans -= w * H;
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int H, W;
cin >> H >> W;
int h, w;
cin >> h >> w;
int ans = 0;
ans += H * W;
ans -= h * W;
ans -= w * (H - h);
cout << ans;
return 0;
} | [] | 907,694 | 907,695 | u109191542 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
#define fo(x, n) for (int i = x; i <= n; i++)
#define all(x) x.begin(), x.end()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int MOD = 1e9 + 7;
void solve() {
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << H * W - h * W - w * H - w... | #include <bits/stdc++.h>
using namespace std;
#define fo(x, n) for (int i = x; i <= n; i++)
#define all(x) x.begin(), x.end()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int MOD = 1e9 + 7;
void solve() {
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << H * W - h * W - w * H + w... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 907,696 | 907,697 | u024616993 | cpp |
p03101 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
int main(void) {
int H, W;
cin >> H >> W;
int h, w;
cin >> h >> w;
int ans = H * W - h * W - w;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
int main(void) {
int H, W;
cin >> H >> W;
int h, w;
cin >> h >> w;
int ans = (H - h) * (W - w);
cout << ans << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 907,705 | 907,706 | u905170328 | cpp |
p03101 | #include <bits/stdc++.h>
#include <vector>
using namespace std;
int main(void) {
int A, B;
int N, M;
cin >> A >> B >> N >> M;
cout << A * B - (A * N + B * M) + N * M;
} | #include <bits/stdc++.h>
#include <vector>
using namespace std;
int main(void) {
int A, B;
int N, M;
cin >> A >> B >> N >> M;
cout << A * B - (A * M + B * N) + N * M;
} | [
"identifier.change",
"io.output.change"
] | 907,717 | 907,718 | u994956045 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
signed main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << (a - b) * (c - d) << "\n";
} | #include <bits/stdc++.h>
using namespace std;
signed main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << (a - c) * (b - d) << "\n";
} | [
"identifier.change",
"io.output.change"
] | 907,724 | 907,725 | u652908807 | cpp |
p03101 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int Min(int a, int b, int c) {
if (a <= b) {
return std::min(a, c);
} else
return std::min(b, c);
}
int main(void) {
int a, b, c, d;
cin >> a >> b ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int Min(int a, int b, int c) {
if (a <= b) {
return std::min(a, c);
} else
return std::min(b, c);
}
int main(void) {
int a, b, c, d;
cin >> a >> b ... | [
"identifier.change",
"io.output.change"
] | 907,728 | 907,729 | u467561544 | cpp |
p03101 | #include <iostream>
int main() {
int W, H;
std::cin >> H >> W;
int w, h;
std::cin >> h >> w;
int sum = W * H - w * H + h * W - w * h;
std::cout << sum << std::endl;
return 0;
} | #include <iostream>
int main() {
int W, H;
std::cin >> H >> W;
int w, h;
std::cin >> h >> w;
int sum = W * H - w * H - h * W + w * h;
std::cout << sum << std::endl;
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 907,734 | 907,735 | u922974720 | cpp |
p03101 | #include <algorithm>
#include <array>
#include <iostream>
#include <math.h>
#include <numeric>
#include <unordered_set>
#include <vector>
using namespace std;
using s64 = int64_t;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, x, n) for (int i = x; i < n; ++i)
int main() {
int H, W, h, w;
cin >> H >... | #include <algorithm>
#include <array>
#include <iostream>
#include <math.h>
#include <numeric>
#include <unordered_set>
#include <vector>
using namespace std;
using s64 = int64_t;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, x, n) for (int i = x; i < n; ++i)
int main() {
int H, W, h, w;
cin >> H >... | [
"expression.operation.binary.remove"
] | 907,736 | 907,737 | u445401544 | cpp |
p03101 | #include <iostream>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << H * W - (H * h + W * w - h * w) << endl;
} | #include <iostream>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << H * W - (H * w + W * h - h * w) << endl;
} | [
"identifier.change",
"io.output.change"
] | 907,742 | 907,743 | u404145225 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W;
cin >> h >> w;
cout << h * W + w * H - h * w << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W;
cin >> h >> w;
cout << W * H - (h * W + w * H - h * w) << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 907,754 | 907,755 | u681869152 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W;
cin >> h >> w;
cout << h * W + w * H - h * w << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W;
cin >> h >> w;
cout << W * H - (h * W + w * H - h * w) << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 907,754 | 907,756 | u681869152 | cpp |
p03101 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int inf = 1001001001;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << H * W - H * h - W * w + h * w << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int inf = 1001001001;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << H * W - H * w - W * h + h * w << endl;
} | [
"identifier.change",
"io.output.change"
] | 907,761 | 907,762 | u886613668 | cpp |
p03101 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <stdio.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
//===========================... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <stdio.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
//===========================... | [
"expression.operation.binary.remove"
] | 907,765 | 907,766 | u465760322 | cpp |
p03101 | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using vll = vector<long lo... | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using vll = vector<long lo... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 907,770 | 907,771 | u757628628 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
int h, w;
cin >> h >> w;
cout << (H * W) - (h * H) - (w * W) + (h * w) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
int h, w;
cin >> h >> w;
cout << (H * W) - (h * W) - (w * H) + (h * w) << endl;
} | [
"identifier.change",
"io.output.change"
] | 907,774 | 907,775 | u955282280 | cpp |
p03101 | #include <iostream>
using namespace std;
int main() {
int h, w, hb, wb, ans;
cin >> h >> w >> hb >> wb;
ans = h * w - (hb * h + wb * w - hb * wb);
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int h, w, hb, wb, ans;
cin >> h >> w >> hb >> wb;
ans = h * w - (hb * w + wb * (h - hb));
cout << ans << endl;
return 0;
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 907,778 | 907,779 | u608258653 | cpp |
p03101 | //保留所有权利。
#include <algorithm> //辞書順はnext_permutationだよ
#include <cmath>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stdio.h> //printするよ
#include <string.h>
#include <string>
#include <time.h>
#include <utility> //swapで数値交換するよ
#... | //保留所有权利。
#include <algorithm> //辞書順はnext_permutationだよ
#include <cmath>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stdio.h> //printするよ
#include <string.h>
#include <string>
#include <time.h>
#include <utility> //swapで数値交換するよ
#... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 907,782 | 907,783 | u742306624 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << H * W - h * W - w * h + w * h << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << H * W - h * W - w * H + w * h << endl;
} | [
"identifier.change",
"io.output.change"
] | 907,788 | 907,789 | u649915042 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int H, W;
cin >> H >> W;
int h, w;
cin >> h >> w;
cout << H * W - h * W - w * H + h * W << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int H, W;
cin >> H >> W;
int h, w;
cin >> h >> w;
cout << H * W - h * W - w * H + h * w << endl;
return 0;
} | [
"identifier.change",
"io.output.change"
] | 907,790 | 907,791 | u917518913 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << H - h + W - w << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << (H - h) * (W - w) << endl;
return 0;
}
| [
"io.output.change"
] | 907,792 | 907,793 | u652712806 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << H * W - (h * H + w * W - h * w) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << H * W - (h * W + w * H - h * w) << endl;
}
| [
"identifier.change",
"io.output.change"
] | 907,808 | 907,809 | u681084651 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
int H, W, h, w;
cin >> H >> W >> h >> w;
int sum = 0;
sum = H * w + h * W;
sum -= h * w;
cout << sum << endl;
}
signed main() {
// while(1)
solve();
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
int H, W, h, w;
cin >> H >> W >> h >> w;
int sum = 0;
sum = H * w + h * W;
sum -= h * w;
cout << H * W - sum << endl;
}
signed main() {
// while(1)
solve();
}
| [
"expression.operation.binary.add"
] | 907,814 | 907,815 | u134181243 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, h, W, w;
cin >> H >> h >> W >> w;
cout << (H - h) * (W - w) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, h, W, w;
cin >> H >> h >> W >> w;
cout << (H - W) * (h - w) << endl;
return 0;
} | [
"identifier.change",
"io.output.change"
] | 907,816 | 907,817 | u805906007 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int H, W;
cin >> H >> W;
int x, y;
cin >> x >> y;
cout << W * x + H * y - x * y << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int H, W;
cin >> H >> W;
int x, y;
cin >> x >> y;
cout << H * W - (W * x + H * y - x * y) << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 907,822 | 907,823 | u904123392 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w, a, b, sum;
cin >> h >> w;
cin >> a >> b;
sum = h * w - (a * h + b * w - a * b);
cout << sum << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w, a, b, sum;
cin >> h >> w;
cin >> a >> b;
sum = h * w - (a * w + b * h - a * b);
cout << sum << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 907,837 | 907,838 | u144029820 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.