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 |
|---|---|---|---|---|---|---|---|
p03101 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using llint = long long;
using vint = vector<int>;
int main() {
int h, w, x, y;
cin >> h >> w >> x >> y;
cout << h * w - (x * w + y * h - h * w) << endl;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using llint = long long;
using vint = vector<int>;
int main() {
int h, w, x, y;
cin >> h >> w >> x >> y;
cout << h * w - (x * w + y * h - x * y) << endl;
} | [
"identifier.change",
"io.output.change"
] | 907,841 | 907,842 | u932319885 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
#define ll long long // long long省略
#define pb push_back // push_back省略
#define mp make_pair // make_pair省略
#define fi first // first省略
#define se second // second省略
#define itn int // int誤字保険
#define count cout // cout誤字保険
#define vecotr vector // vect... | #include <bits/stdc++.h>
using namespace std;
#define ll long long // long long省略
#define pb push_back // push_back省略
#define mp make_pair // make_pair省略
#define fi first // first省略
#define se second // second省略
#define itn int // int誤字保険
#define count cout // cout誤字保険
#define vecotr vector // vect... | [
"identifier.change",
"io.output.change"
] | 907,843 | 907,844 | u547754910 | 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;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 907,845 | 907,846 | u882039496 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
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;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
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,847 | 907,848 | u854161810 | 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 + h * w;
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 - H * w + h * w;
return 0;
}
| [
"identifier.change",
"io.output.change"
] | 907,851 | 907,852 | u533749093 | cpp |
p03101 | using namespace std;
#include <bits/stdc++.h>
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
int S = H * W;
int A = h * W + w * H;
int B = h * W;
int ans = S - A + B;
cout << ans << endl;
}
| using namespace std;
#include <bits/stdc++.h>
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
int S = H * W;
int A = h * W + w * H;
int B = h * w;
int ans = S - A + B;
cout << ans << endl;
}
| [
"identifier.change",
"expression.operation.binary.change"
] | 907,853 | 907,854 | u615258936 | cpp |
p03096 | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
#define _USE_MATH_DEFINES
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#... | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
#define _USE_MATH_DEFINES
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#... | [] | 907,860 | 907,861 | u655723240 | cpp |
p03096 | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
#define _USE_MATH_DEFINES
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#... | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
#define _USE_MATH_DEFINES
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#... | [
"call.remove"
] | 907,862 | 907,861 | u655723240 | cpp |
p03096 | #include <algorithm>
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll ans, n;... | #include <algorithm>
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll ans, n;... | [
"assignment.change"
] | 907,871 | 907,872 | u419307948 | cpp |
p03096 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> c(N + 1);
for (int i = 1; i <= N; i++) {
cin >> c.at(i);
}
vector<int> dp(N + 1);
dp.at(0) = 1;
vector<int> colour(N + 1);
colour.at(c.at(1)) = dp.at(0);
for (int i = 1; i <= N; i++) {
if (i == 1) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> c(N + 1);
for (int i = 1; i <= N; i++) {
cin >> c.at(i);
}
vector<unsigned int> dp(N + 1);
dp.at(0) = 1;
vector<unsigned int> colour(200010);
colour.at(c.at(1)) = dp.at(0);
for (int i = 1; i <= N; i++) {
... | [
"variable_declaration.type.widen.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 907,892 | 907,890 | u686805923 | cpp |
p03096 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const int N = 2e5 + 5;
ll dp[N][2], pre[N];
int n, c[N];
int main() {
ios::sync_with_stdio(false);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> c[i];
}
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
if (c[i]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const int N = 2e5 + 5;
ll dp[N][2], pre[N];
int n, c[N];
int main() {
ios::sync_with_stdio(false);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> c[i];
}
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
if (c[i]... | [] | 907,921 | 907,922 | u777892860 | cpp |
p03096 | // by yjz
#include <bits/stdc++.h>
using namespace std;
#define FF first
#define SS second
#define PB push_back
#define MP make_pair
#define foreach(it, s) \
for (__typeof((s).begin()) it = (s).begin(); it != (s).end(); it++)
#ifndef LOCAL
#define cerr ... | // by yjz
#include <bits/stdc++.h>
using namespace std;
#define FF first
#define SS second
#define PB push_back
#define MP make_pair
#define foreach(it, s) \
for (__typeof((s).begin()) it = (s).begin(); it != (s).end(); it++)
#ifndef LOCAL
#define cerr ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 907,923 | 907,924 | u563764376 | cpp |
p03096 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define all(a) begin(a), end(a)
#define FOR(x, val, to) for (int x = (val); x < int((to)); ++x)
#define FORE(x, val, to) for (auto x = (val); x <= (to); ++x)
#define FORR(x, a... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define all(a) begin(a), end(a)
#define FOR(x, val, to) for (int x = (val); x < int((to)); ++x)
#define FORE(x, val, to) for (auto x = (val); x <= (to); ++x)
#define FORR(x, a... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 907,928 | 907,929 | u761407600 | cpp |
p03096 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long md = 1e9 + 7;
int N;
cin >> N;
int bef = -1;
vector<int> C;
for (int i = 0; i < N; i++) {
int c;
cin >> c;
if (c != bef)
C.push_back(c);
bef = c;
}
int Clen = C.size();
vector<long long> dp(Clen, 0);
dp[0]++;... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long md = 1e9 + 7;
int N;
cin >> N;
int bef = -1;
vector<int> C;
for (int i = 0; i < N; i++) {
int c;
cin >> c;
if (c != bef)
C.push_back(c);
bef = c;
}
int Clen = C.size();
vector<long long> dp(Clen, 0);
dp[0]++;... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change"
] | 907,942 | 907,943 | u636387751 | cpp |
p03096 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#inc... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#inc... | [] | 907,946 | 907,947 | u049420296 | cpp |
p03096 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, a, b) fo... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, a, b) fo... | [
"expression.operation.binary.add"
] | 907,951 | 907,952 | u834415466 | cpp |
p03096 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, a, b) fo... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, a, b) fo... | [
"expression.unary.arithmetic.add"
] | 907,953 | 907,952 | u834415466 | cpp |
p03096 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, a, b) fo... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, a, b) fo... | [
"assignment.change"
] | 907,953 | 907,954 | u834415466 | cpp |
p03096 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, a, b) fo... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, a, b) fo... | [
"assignment.change",
"expression.operation.binary.add"
] | 907,955 | 907,954 | u834415466 | cpp |
p03096 | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;
const long long MOD = (long long)1e9 + 7;
int n, ans, c[200009], pre[200009], nxt[200009], dp[200009];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;... | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;
const long long MOD = (long long)1e9 + 7;
int n, c[200009], pre[200009], nxt[200009], dp[200009];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
fo... | [
"variable_declaration.remove",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 907,958 | 907,959 | u398025421 | cpp |
p03096 |
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int MOD = 1000000007;
int N;
cin >> N;
vector<int> C(N + 1), right(210000);
vector<long long> dp(N + 1);
for (int i = 0; i <=... |
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int MOD = 1000000007;
int N;
cin >> N;
vector<int> C(N + 1), right(210000);
vector<long long> dp(N + 1);
for (int i = 0; i <=... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 907,964 | 907,965 | u394033362 | cpp |
p03096 |
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int MOD = 1000000007;
int N;
cin >> N;
vector<int> C(N + 1), right(200001);
vector<long long> dp(N + 1);
for (int i = 0; i <=... |
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int MOD = 1000000007;
int N;
cin >> N;
vector<int> C(N + 1), right(210000);
vector<long long> dp(N + 1);
for (int i = 0; i <=... | [
"literal.number.change",
"call.arguments.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 907,966 | 907,965 | u394033362 | cpp |
p03096 |
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int MOD = 1000000007;
int N;
cin >> N;
vector<int> C(N + 1), right(210000);
vector<long long> dp(210000);
for (int i = 0; i <... |
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int MOD = 1000000007;
int N;
cin >> N;
vector<int> C(N + 1), right(210000);
vector<long long> dp(N + 1);
for (int i = 0; i <=... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 907,967 | 907,965 | u394033362 | cpp |
p03096 |
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int MOD = 1000000007;
int N;
cin >> N;
vector<int> C(N + 1), right(N + 1);
vector<long long> dp(N + 1);
for (int i = 0; i <= ... |
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int MOD = 1000000007;
int N;
cin >> N;
vector<int> C(N + 1), right(210000);
vector<long long> dp(N + 1);
for (int i = 0; i <=... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"control_flow.loop.for.condition.change"
] | 907,968 | 907,965 | u394033362 | cpp |
p03096 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define ll long long
#define pii pair<int, int>
#define f first
#define s second
#define y1 Emilia
#define forit(s) for (__typeof(s.begin()) it = s.begin... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define ll long long
#define pii pair<int, int>
#define f first
#define s second
#define y1 Emilia
#define forit(s) for (__typeof(s.begin()) it = s.begin... | [] | 907,993 | 907,994 | u463508647 | cpp |
p03096 | #include <algorithm>
#include <cassert>
#include <cstring>
#include <iostream>
#include <vector>
#define TRACE(x) std::cout << #x << " = " << x << "\n"
#define _ << " _ " <<
template <int32_t P> struct IntModT {
int32_t value;
IntModT() : value(0){};
explicit IntModT(int32_t value) : value(value){};
IntModT... | #include <algorithm>
#include <cassert>
#include <cstring>
#include <iostream>
#include <vector>
#define TRACE(x) std::cout << #x << " = " << x << "\n"
#define _ << " _ " <<
template <int32_t P> struct IntModT {
int32_t value;
IntModT() : value(0){};
explicit IntModT(int32_t value) : value(value){};
IntModT... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"misc.opposites"
] | 907,995 | 907,996 | u678841350 | cpp |
p03096 | #include <algorithm>
#include <cassert>
#include <cstring>
#include <iostream>
#include <vector>
#define TRACE(x) std::cout << #x << " = " << x << "\n"
#define _ << " _ " <<
template <int32_t P> struct IntModT {
int32_t value;
IntModT() : value(0){};
explicit IntModT(int32_t value) : value(value){};
IntModT... | #include <algorithm>
#include <cassert>
#include <cstring>
#include <iostream>
#include <vector>
#define TRACE(x) std::cout << #x << " = " << x << "\n"
#define _ << " _ " <<
template <int32_t P> struct IntModT {
int32_t value;
IntModT() : value(0){};
explicit IntModT(int32_t value) : value(value){};
IntModT... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"misc.opposites"
] | 907,997 | 907,996 | u678841350 | cpp |
p03096 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n;
cin >> n;
ll b[n];
vector<ll> a;
for (int i = 0; i < n; i++) {
cin >> b[i];
if (i != 0) {
if (b[i] == b[i - 1])
continue;
}
a.push_back(b[i]);
}
vector<bool> bo(200010, false);
vector<ll> ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n;
cin >> n;
ll b[n];
vector<ll> a;
for (int i = 0; i < n; i++) {
cin >> b[i];
if (i != 0) {
if (b[i] == b[i - 1])
continue;
}
a.push_back(b[i]);
}
vector<bool> bo(200010, false);
vector<ll> ... | [
"expression.operation.binary.add"
] | 908,002 | 908,003 | u987476436 | cpp |
p03096 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int dp[200002][2] = {};
int n;
int c[200002];
int par[200002];
int sosen[200002];
int sison[200002];
int mod(int a) { return a % 1000000007; }
int main() {
cin >> n;
int a;
for (int i = 1; i <= n; i++) {
cin >> a;
if (i - 1)
... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int dp[200002][2] = {};
int n;
int c[200002];
int par[200002];
int sosen[200002];
int sison[200002];
int mod(int a) { return a % 1000000007; }
int main() {
cin >> n;
int a;
for (int i = 1; i <= n; i++) {
cin >> a;
if (i - 1)
... | [
"expression.operation.binary.remove"
] | 908,011 | 908,012 | u587724217 | cpp |
p03096 | #include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
// definition {{{ 1
// scaning {{{ 2
#define Scd(x) scanf("%d", &x)
#define Scd2(x, y) scanf("%d%d", &x, &y)
#define Scd3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x, y) scanf("%llu%llu", &x, &... | #include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
// definition {{{ 1
// scaning {{{ 2
#define Scd(x) scanf("%d", &x)
#define Scd2(x, y) scanf("%d%d", &x, &y)
#define Scd3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x, y) scanf("%llu%llu", &x, &... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"identifier.replace.add",
"literal.replace.remove"
] | 908,017 | 908,018 | u550398291 | cpp |
p03096 | #include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
// definition {{{ 1
// scaning {{{ 2
#define Scd(x) scanf("%d", &x)
#define Scd2(x, y) scanf("%d%d", &x, &y)
#define Scd3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x, y) scanf("%llu%llu", &x, &... | #include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
// definition {{{ 1
// scaning {{{ 2
#define Scd(x) scanf("%d", &x)
#define Scd2(x, y) scanf("%d%d", &x, &y)
#define Scd3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x, y) scanf("%llu%llu", &x, &... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 908,020 | 908,018 | u550398291 | cpp |
p03096 | #include <iostream>
#include <vector>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> arr;
int pre = 0;
for (int i = 0; i < n; i++) {
int c;
cin >> c;
if (pre != c) {
arr.push_back(c);
pre = c;
}
}
n = arr.size();
... | #include <iostream>
#include <vector>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> arr;
int pre = 0;
for (int i = 0; i < n; i++) {
int c;
cin >> c;
if (pre != c) {
arr.push_back(c);
pre = c;
}
}
n = arr.size();
... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 908,028 | 908,029 | u508729896 | cpp |
p03096 | // B.
#include <iostream>
#include <sstream>
#include <vector>
using namespace std;
typedef long long LL;
static const LL MOD = 1000000007LL;
int n;
vector<int> c;
LL solve() {
vector<LL> memo = vector<LL>(n + 1, 1);
vector<int> p(n + 1, -1);
LL r = 1;
int last = c[0];
p[c[0]] = 0;
memo[0] = r;
for (... | // B.
#include <iostream>
#include <sstream>
#include <vector>
using namespace std;
typedef long long LL;
static const LL MOD = 1000000007LL;
int n;
vector<int> c;
LL solve() {
vector<LL> memo = vector<LL>(n + 1, 1);
vector<int> p(200001, -1);
LL r = 1;
int last = c[0];
p[c[0]] = 0;
memo[0] = r;
for ... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"literal.number.change",
"assignment.value.change"
] | 908,045 | 908,044 | u586336940 | cpp |
p03096 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> C(N + 1);
vector<int> latest(N + 1, -1);
vector<int> DP(N + 1, 0);
for (int i = 1; i <= N; i++) {
cin >> C[i];
}
DP[0] = 1;
for (int i = 1; i <= N; i++) {
if (latest[C[i]] >= 0 && latest[C[... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> C(N + 1);
vector<int> latest(200002, -1);
vector<unsigned int> DP(N + 1, 0);
for (int i = 1; i <= N; i++) {
cin >> C[i];
}
DP[0] = 1;
for (int i = 1; i <= N; i++) {
if (latest[C[i]] >= 0 &&... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"variable_declaration.type.widen.change"
] | 908,054 | 908,055 | u604023588 | cpp |
p03096 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> C(N);
vector<int> latest(N + 1, -1);
vector<int> DP(N + 1, 0);
for (int i = 1; i <= N; i++) {
cin >> C[i];
}
DP[0] = 1;
for (int i = 1; i <= N; i++) {
if (latest[C[i]] >= 0 && latest[C[i]] ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> C(N + 1);
vector<int> latest(200002, -1);
vector<unsigned int> DP(N + 1, 0);
for (int i = 1; i <= N; i++) {
cin >> C[i];
}
DP[0] = 1;
for (int i = 1; i <= N; i++) {
if (latest[C[i]] >= 0 &&... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"variable_declaration.type.widen.change"
] | 908,056 | 908,055 | u604023588 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
int N = H * W - H * h - W * w + h * w;
cout << N << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
int N = H * W - H * w - W * h + h * w;
cout << N << endl;
} | [
"identifier.change",
"expression.operation.binary.change"
] | 908,061 | 908,062 | u701589684 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w;
scanf("%d%d%d%d", &H, &W, &h, &w);
int X = H * W;
int Y = H * h + W * w - h * w;
printf("%d", X - Y);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w;
scanf("%d%d%d%d", &H, &W, &h, &w);
int X = H * W;
int Y = H * w + W * h - h * w;
printf("%d", X - Y);
}
| [
"identifier.change",
"expression.operation.binary.change"
] | 908,069 | 908,070 | u290679562 | 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 - 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 - h) * w << endl;
}
| [
"identifier.change",
"io.output.change"
] | 908,082 | 908,083 | u401900157 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << 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;
}
| [
"expression.operation.binary.add"
] | 908,086 | 908,087 | u393754572 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double 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_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#d... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double 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_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#d... | [
"expression.operation.binary.remove"
] | 908,088 | 908,089 | u430974466 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double 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_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#d... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double 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_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#d... | [
"expression.operation.binary.remove",
"identifier.change",
"io.output.change"
] | 908,090 | 908,089 | u430974466 | cpp |
p03101 | #include "bits/stdc++.h"
using namespace std;
const int MOD = 1e9 + 7;
typedef long long lint;
const int INF = 1e7;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, k, n) for (int i = (k); i < (int)(n); ++i)
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define all(x) (x).begi... | #include "bits/stdc++.h"
using namespace std;
const int MOD = 1e9 + 7;
typedef long long lint;
const int INF = 1e7;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, k, n) for (int i = (k); i < (int)(n); ++i)
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define all(x) (x).begi... | [
"expression.operation.binary.remove"
] | 908,099 | 908,100 | u177382472 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W;
cin >> h >> w;
int x = H - W;
int y = h - w;
cout << x * y << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W;
cin >> h >> w;
int x = H - h;
int y = W - w;
cout << x * y << endl;
} | [
"identifier.change",
"expression.operation.binary.change"
] | 908,108 | 908,109 | u041855176 | 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));
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << ((H - h) * (W - w));
} | [] | 908,116 | 908,117 | u383166010 | cpp |
p03101 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int a, b, c, d;
char g[6];
cin >> a >> b >> c >> d;
cout << (c - a) * (b - d);
} | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int a, b, c, d;
char g[6];
cin >> a >> b >> c >> d;
cout << (c - a) * (d - b);
} | [
"expression.operation.binary.remove"
] | 908,122 | 908,123 | u768204022 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int H, W, h, w;
int main() {
cin >> H >> W >> h >> w;
cout << (H * W) - h * W - w * H + 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int H, W, h, w;
int main() {
cin >> H >> W >> h >> w;
cout << (H * W) - h * W - w * H + h * w << endl;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 908,136 | 908,137 | u943070796 | cpp |
p03101 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define INF 210000000
#define int long long
int gcd(int a, int b) {
int amari = a % b;
int c = b;
if (amari == 0) {
return ... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define INF 210000000
#define int long long
int gcd(int a, int b) {
int amari = a % b;
int c = b;
if (amari == 0) {
return ... | [] | 908,138 | 908,139 | u005570675 | 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 - h) << 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) << endl;
return 0;
} | [
"identifier.change",
"io.output.change"
] | 908,140 | 908,141 | u366115355 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w, X, R;
cin >> H >> W >> h >> w;
X = H * W - (h * W) + (H * w) - (h * w);
cout << X;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w, X, R;
cin >> H >> W >> h >> w;
X = H * W - (h * W + H * w - h * w);
cout << X;
} | [] | 908,144 | 908,145 | u677149659 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w, X;
cin >> H >> W >> h >> w;
X == H *W - (h * W + H * w - h * w);
cout << X;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w, X, R;
cin >> H >> W >> h >> w;
X = H * W - (h * W + H * w - h * w);
cout << X;
} | [
"variable_declaration.add",
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 908,146 | 908,145 | u677149659 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w, X;
cin >> H >> W >> h >> w;
X == H *W - (h * W + H * w - h - w);
cout << X;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w, X, R;
cin >> H >> W >> h >> w;
X = H * W - (h * W + H * w - h * w);
cout << X;
} | [
"variable_declaration.add",
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 908,148 | 908,145 | u677149659 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << 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;
} | [
"expression.operation.binary.add"
] | 908,155 | 908,156 | u263715385 | 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) << 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)) << endl;
}
| [] | 908,161 | 908,162 | u653482689 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << W * H - h * W - w * H + w + h - 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << W * H - h * W - w * H + w * h << endl;
}
| [
"expression.operator.arithmetic.change",
"io.output.change",
"expression.operation.binary.remove"
] | 908,165 | 908,166 | u469953228 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H, W;
int h, w;
cin >> h, w;
int ans = (W - w) * (H - h);
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
int h, w;
cin >> h >> w;
int ans = (W - w) * (H - h);
cout << ans << endl;
}
| [] | 908,167 | 908,168 | u224951113 | cpp |
p03101 | #include <iostream>
using namespace std;
int main() {
int H, W;
int h, w;
cin >> H >> W;
cin >> h >> w;
cout << H * W - H * w - W * h + h * W << endl;
}
| #include <iostream>
using namespace std;
int main() {
int H, W;
int h, w;
cin >> H >> W;
cin >> h >> w;
cout << H * W - H * w - W * h + h * w << endl;
}
| [
"identifier.change",
"io.output.change"
] | 908,173 | 908,174 | u096717230 | cpp |
p03101 | #include <iostream>
using namespace std;
int main() {
int H, W;
int h, w;
cin >> H >> W;
cin >> h >> w;
cout << H * W - H * w - W * h + h * W << endl;
} | #include <iostream>
using namespace std;
int main() {
int H, W;
int h, w;
cin >> H >> W;
cin >> h >> w;
cout << H * W - H * w - W * h + h * w << endl;
}
| [
"identifier.change",
"io.output.change"
] | 908,175 | 908,174 | u096717230 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
int h, w;
cin >> h >> w;
int ans;
ans = H * W - (h * w) + min(h, w);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
int h, w;
cin >> h >> w;
int ans;
ans = H * W - (h * W + w * H) + (h * w);
cout << ans << endl;
} | [
"assignment.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 908,178 | 908,179 | u307834890 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
int x, y;
cin >> x >> y;
cout << ((h * w) - (x * w + y * h - max(x, y)));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
int x, y;
cin >> x >> y;
cout << ((h * w) - (x * w + y * h - x * y));
return 0;
} | [
"call.remove",
"io.output.change",
"call.arguments.change"
] | 908,180 | 908,181 | u223389479 | 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;
} | #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;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 908,185 | 908,186 | u885523920 | cpp |
p03101 | #include <iostream>
using namespace std;
int main(void) {
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << (H * W) - (H * w) - (W - h) + (w * h) << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << (H * W) - (H * w) - (W * h) + (w * h) << endl;
return 0;
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 908,189 | 908,190 | u121243942 | cpp |
p03101 |
#include <algorithm>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define LL long long
#define ALF "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define LLBIG 1999999999999999999LL
#define INTBIG 11... |
#include <algorithm>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define LL long long
#define ALF "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define LLBIG 1999999999999999999LL
#define INTBIG 11... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 908,199 | 908,200 | u657512990 | cpp |
p03101 | #include <iostream>
#include <string.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << (a - b) * (b - d) << endl;
return 0;
} | #include <iostream>
#include <string.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << (a - c) * (b - d) << endl;
return 0;
} | [
"identifier.change",
"io.output.change"
] | 908,209 | 908,210 | u127768253 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W >> w >> h;
cout << H * W - w * H - h * W + 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 - w * H - h * W + w * h << endl;
} | [
"expression.operation.binary.remove"
] | 908,213 | 908,214 | u425834921 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w, ans;
cin >> H >> W >> h >> w;
ans = (H * W) - (h * W) - (w * H);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w, ans;
cin >> H >> W >> h >> w;
ans = (H * W) - (h * W) - (w * H) + (w * h);
cout << ans << endl;
}
| [
"assignment.change"
] | 908,220 | 908,221 | u871709179 | cpp |
p03101 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
int h, w;
cin >> h >> w;
cout << h * w + h * (W - w) + w * (H - h) << endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
int h, w;
cin >> h >> w;
cout << W * H - (h * w + h * (W - w) + w * (H - h)) << endl;
}
| [
"expression.operation.binary.add"
] | 908,226 | 908,227 | u166632863 | cpp |
p03101 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll long long
#define INF 1e+9
#define MOD 1000000007
using namespace std;... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll long long
#define INF 1e+9
#define MOD 1000000007
using namespace std;... | [
"expression.operation.binary.add"
] | 908,232 | 908,233 | u251433890 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
int area = H * W;
int black = h * w + w * (H - w);
cout << area - black << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
int area = H * W;
int black = h * W + w * (H - h);
cout << area - black << endl;
}
| [
"identifier.change",
"expression.operation.binary.change"
] | 908,234 | 908,235 | u372299304 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
int area = H * W;
int black = h * w + w * (h - w);
cout << area - black << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
int area = H * W;
int black = h * W + w * (H - h);
cout << area - black << endl;
}
| [
"identifier.change",
"expression.operation.binary.change"
] | 908,236 | 908,235 | u372299304 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
int h, w;
cin >> h >> w;
int ans;
ans = (H - h) + (W - w);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
int h, w;
cin >> h >> w;
int ans;
ans = (H - h) * (W - w);
cout << ans << endl;
} | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 908,237 | 908,238 | u832995587 | cpp |
p03101 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int c, d;
cin >> c >> d;
int mas = a * b;
mas -= (a * c) + (b * d);
mas += (c * d);
cout << mas << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int c, d;
cin >> c >> d;
int mas = a * b;
mas -= (a * d) + (b * c);
mas += (c * d);
cout << mas << endl;
return 0;
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 908,248 | 908,249 | u653903116 | cpp |
p03101 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
const double 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_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
... |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
const double 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_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
... | [
"expression.operation.binary.remove"
] | 908,290 | 908,291 | u800551451 | cpp |
p03101 | #include <iostream>
#include <math.h>
#include <string>
#include <vector>
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;
return 0;
} | #include <iostream>
#include <math.h>
#include <string>
#include <vector>
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;
return 0;
} | [
"identifier.change",
"io.output.change"
] | 908,292 | 908,293 | u899108527 | cpp |
p03101 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
typedef long long unsigned int ll;
int main() {
int a, b, c, d;
cin >> a;
cin >> b;
cin >> c;
cin >> d;
cout << a * b - c * a - b * d + c * d << endl;
return 0;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
typedef long long unsigned int ll;
int main() {
int a, b, c, d;
cin >> a;
cin >> b;
cin >> c;
cin >> d;
cout << a * b - d * a - b * c + c * d << endl;
return 0;
}
| [
"identifier.change",
"io.output.change"
] | 908,294 | 908,295 | u032337012 | cpp |
p03101 | #include <iostream>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
int h, w;
cin >> h >> w;
int a;
a = H * W - (h * W + w * H) - h * w;
cout << a << endl;
}
| #include <iostream>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
int h, w;
cin >> h >> w;
int a;
a = H * W - (h * W + w * H) + h * w;
cout << a << endl;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 908,303 | 908,304 | u464725395 | 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 + 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;
} | [
"identifier.change",
"io.output.change"
] | 908,305 | 908,306 | u069652661 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define UM unordered_map
#define ALL(a) (a).begin(), (a).end()
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll, ll> pii;
const long long INF = 1LL << ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define UM unordered_map
#define ALL(a) (a).begin(), (a).end()
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll, ll> pii;
const long long INF = 1LL << ... | [
"call.remove",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 908,315 | 908,316 | u913836622 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
#define lp(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
#define sz(v) (int(v.size()))
typedef unsigned long long ul;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<vector<int>> vii;
type... | #include <bits/stdc++.h>
using namespace std;
#define lp(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
#define sz(v) (int(v.size()))
typedef unsigned long long ul;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<vector<int>> vii;
type... | [
"identifier.change",
"io.output.change"
] | 908,320 | 908,321 | u026389788 | cpp |
p03101 | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int H, W, w, h;
cin >> H >> W;
cin >> h >> w;
int remaining = H * W - (h * W - H * w) + h * w;
cout << remaining;
} | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int H, W, w, h;
cin >> H >> W;
cin >> h >> w;
int remaining = H * W - (h * W + H * w) + h * w;
cout << remaining;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 908,322 | 908,323 | u387480576 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int W, H, w, h;
cin >> H >> W >> h >> w;
cout << (H - W) * (h - w) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int W, H, w, h;
cin >> H >> W >> h >> w;
cout << (H - h) * (W - w) << endl;
}
| [
"identifier.change",
"io.output.change"
] | 908,324 | 908,325 | u466983830 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, h1, w, w1;
scanf("%d %d %d %d", &h, &h1, &w, &w1);
printf("%d", (h - h1) * (w - w1));
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int h, h1, w, w1;
scanf("%d %d %d %d", &h, &h1, &w, &w1);
printf("%d", (h - w) * (h1 - w1));
}
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 908,334 | 908,335 | u897518464 | cpp |
p03101 | #include <iostream>
using namespace std;
int H, W, h, w;
int main() {
cin >> H >> W >> h >> w;
int total = H * W;
int a = total - h * W;
int ans = a - w;
cout << ans << endl;
return 0;
}
| #include <iostream>
using namespace std;
int H, W, h, w;
int main() {
cin >> H >> W >> h >> w;
int total = H * W;
int a = total - h * W;
int ans = a - (H - h) * w;
cout << ans << endl;
return 0;
}
| [
"assignment.change"
] | 908,342 | 908,343 | u926089862 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, a, b;
scanf("%d %d", &n, &m);
scanf("%d %d", &a, &b);
printf("%d", (n - a) * (n - b));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, a, b;
scanf("%d %d", &n, &m);
scanf("%d %d", &a, &b);
printf("%d", (n - a) * (m - b));
return 0;
} | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 908,349 | 908,350 | u963399321 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w;
cin >> W >> H >> h >> w;
cout << (H - h) * (W - w) << endl;
} | #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;
}
| [
"expression.operation.binary.remove"
] | 908,358 | 908,359 | u464957469 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
scanf("%d %d %d", &a, &b, &c, &d);
printf("%d", (a - c) * (b - d));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
scanf("%d %d %d %d", &a, &b, &c, &d);
printf("%d", (a - c) * (b - d));
return 0;
} | [
"literal.string.change",
"call.arguments.change"
] | 908,363 | 908,364 | u858741867 | cpp |
p03101 | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d;
e = a * b - (c * b + d * a) - c * d;
cout << e << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d;
e = a * b - (c * b + d * a) + c * d;
cout << e << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 908,365 | 908,366 | u133765395 | cpp |
p03101 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#... | [
"expression.operation.binary.add"
] | 908,369 | 908,370 | u335104842 | cpp |
p03101 | #include <iostream>
using namespace std;
int main() {
int H, W;
int h, w;
cin >> H >> W >> h >> w;
cout << H * W - h * W - w * H + h * W << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int H, W;
int h, w;
cin >> H >> W >> h >> w;
cout << H * W - h * W - w * H + h * w << endl;
return 0;
}
| [
"identifier.change",
"io.output.change"
] | 908,371 | 908,372 | u033620890 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << h * W + H * w - h * w << '\n';
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << H * W - (h * W + H * w - h * w) << '\n';
} | [
"expression.operation.binary.add"
] | 908,378 | 908,379 | u496254754 | cpp |
p03101 | #include <iostream>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
int h, w;
cin >> h >> w;
int sum = H * W;
int minus = h * W + w * H + h * w;
cout << sum - minus;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
int h, w;
cin >> h >> w;
int sum = H * W;
int minus = h * W + w * H - h * w;
cout << sum - minus;
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 908,387 | 908,388 | u196746947 | cpp |
p03101 | /*
author : s@if
*/
#include <bits/stdc++.h>
using namespace std;
#define NIL -1
#define fi first
#define sec second
#define MAX INT_MAX
#define INF 99999999
#define ll long long
#define PI acos(-1.0)
#define MOD 1000000007
#define PLL pair<ll, ll>
#define PII pair<int, int>
#define triplell pair<pair<ll, ll>, l... | /*
author : s@if
*/
#include <bits/stdc++.h>
using namespace std;
#define NIL -1
#define fi first
#define sec second
#define MAX INT_MAX
#define INF 99999999
#define ll long long
#define PI acos(-1.0)
#define MOD 1000000007
#define PLL pair<ll, ll>
#define PII pair<int, int>
#define triplell pair<pair<ll, ll>, l... | [
"call.remove"
] | 908,395 | 908,396 | u253790619 | cpp |
p03101 | #include <iostream>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W;
cin >> h >> W;
cout << (H - h) * (W - w) << endl;
} | #include <iostream>
using namespace std;
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"
] | 908,399 | 908,400 | u113589326 | cpp |
p03101 | #include <stdio.h>
int main() {
int a, b, c, d;
scanf("%d %d", &a, &b);
scanf("%d,%d", &c, &d);
printf("%d\n", (a - c) * (b - d));
return 0;
} | #include <stdio.h>
int main() {
int a, b, c, d;
scanf("%d %d", &a, &b);
scanf("%d %d", &c, &d);
printf("%d\n", (a - c) * (b - d));
return 0;
} | [
"literal.string.change",
"call.arguments.change"
] | 908,403 | 908,404 | u047702244 | cpp |
p03101 | #include <iostream>
int main() {
int H, W, h, w;
std::cin >> H >> W >> h >> w;
std::cout << H * W - h * W - H * w + h + w;
return 0;
} | #include <iostream>
int main() {
int H, W, h, w;
std::cin >> H >> W >> h >> w;
std::cout << H * W - h * W - H * w + h * w << std::endl;
return 0;
} | [
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 908,418 | 908,419 | u975701785 | cpp |
p03101 | #include <iostream>
int main() {
int H, W, h, w;
std::cin >> H >> W >> h >> w;
std::cout << H * W - h * W - H * w + h + w << std::endl;
return 0;
} | #include <iostream>
int main() {
int H, W, h, w;
std::cin >> H >> W >> h >> w;
std::cout << H * W - h * W - H * w + h * w << std::endl;
return 0;
} | [
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 908,420 | 908,419 | u975701785 | cpp |
p03101 | #include <iostream>
using namespace std;
int main() {
int H, W;
int h, w;
cin >> H >> W;
cin >> h >> w;
cout << (h * W) + ((H - h) * w);
return 0;
} | #include <iostream>
using namespace std;
int main() {
int H, W;
int h, w;
cin >> H >> W;
cin >> h >> w;
cout << H * W - (h * W + (H - h) * w);
return 0;
} | [
"expression.operation.binary.add"
] | 908,443 | 908,444 | u393081853 | cpp |
p03101 | #include <iostream>
using namespace std;
int main() {
int H, W, h, w;
cin >> H;
cin >> W;
cin >> h;
cin >> w;
return (H - h) * (W - w);
} | #include <iostream>
using namespace std;
int main() {
int H, W, h, w;
cin >> H;
cin >> W;
cin >> h;
cin >> w;
cout << (H - h) * (W - w);
return 0;
}
| [
"io.output.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 908,448 | 908,449 | u362403871 | 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;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
// cout << H << "," << W << "," << h << "," << w <<endl;
cout << (H - h) * (W - w) << endl;
} | [] | 908,454 | 908,455 | u596562693 | cpp |
p03101 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
map<int, int> mp;
map<int, int> mm... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
map<int, int> mp;
map<int, int> mm... | [
"identifier.change",
"expression.operation.binary.change"
] | 908,456 | 908,457 | u154672915 | cpp |
p03101 | #include <iostream>
#include <string>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << H * W - h * H - w * W + h * w;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
cout << H * W - w * H - h * W + h * w;
} | [
"identifier.change",
"io.output.change"
] | 908,458 | 908,459 | u644568158 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.