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 |
|---|---|---|---|---|---|---|---|
p03141 | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class S, class T> using P = pair<S, T>;
template <class S, class T, class U> using TP = tuple<S, T, U>;
using ll = long long;
using ull = unsi... | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class S, class T> using P = pair<S, T>;
template <class S, class T, class U> using TP = tuple<S, T, U>;
using ll = long long;
using ull = unsi... | [
"identifier.change",
"call.function.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 941,757 | 941,756 | u211681714 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class S, class T> using P = pair<S, T>;
template <class S, class T, class U> using TP = tuple<S, T, U>;
using ll = long long;
using ull = unsi... | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class S, class T> using P = pair<S, T>;
template <class S, class T, class U> using TP = tuple<S, T, U>;
using ll = long long;
using ull = unsi... | [
"call.remove"
] | 941,758 | 941,759 | u211681714 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class S, class T> using P = pair<S, T>;
template <class S, class T, class U> using TP = tuple<S, T, U>;
using ll = long long;
using ull = unsi... | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class S, class T> using P = pair<S, T>;
template <class S, class T, class U> using TP = tuple<S, T, U>;
using ll = long long;
using ull = unsi... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 941,760 | 941,759 | u211681714 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class S, class T> using P = pair<S, T>;
template <class S, class T, class U> using TP = tuple<S, T, U>;
using ll = long long;
using ull = unsi... | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class S, class T> using P = pair<S, T>;
template <class S, class T, class U> using TP = tuple<S, T, U>;
using ll = long long;
using ull = unsi... | [
"call.remove"
] | 941,758 | 941,761 | u211681714 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class S, class T> using P = pair<S, T>;
template <class S, class T, class U> using TP = tuple<S, T, U>;
using ll = long long;
using ull = unsi... | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class S, class T> using P = pair<S, T>;
template <class S, class T, class U> using TP = tuple<S, T, U>;
using ll = long long;
using ull = unsi... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 941,760 | 941,761 | u211681714 | cpp |
p03141 | #include <bits/stdc++.h>
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define debug(x) cerr << #x << ": " << x << endl
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pll;
typedef pair<int, int> Pii;
const ll MOD = 1000000007;
const long double EPS = 1e-10;
const int dyx[4]... | #include <bits/stdc++.h>
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define debug(x) cerr << #x << ": " << x << endl
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pll;
typedef pair<int, int> Pii;
const ll MOD = 1000000007;
const long double EPS = 1e-10;
const int dyx[4]... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 941,762 | 941,763 | u986399983 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int pre = 0;
vector<int> line(n);
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
line.at(i) = a + b;
pre -= b;
}
sort(line.begin(), line.end());
reverse(line.begin(), line.end());
int answer = 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long pre = 0;
vector<int> line(n);
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
line.at(i) = a + b;
pre -= b;
}
sort(line.begin(), line.end());
reverse(line.begin(), line.end());
long long ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 941,764 | 941,765 | u361777955 | cpp |
p03141 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
// printf("%.12lf\n",mid);
// const long long sze = 2*(2^(long long)(ceil(log(100000)/log(2))));
/*
// get part of decimal
double intpart;
double thiss = modf((double)(n*m)/(double)k, &intpart);
*/
const long long mod = 1000000007;
const double eps = .00... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
// printf("%.12lf\n",mid);
// const long long sze = 2*(2^(long long)(ceil(log(100000)/log(2))));
/*
// get part of decimal
double intpart;
double thiss = modf((double)(n*m)/(double)k, &intpart);
*/
const long long mod = 1000000007;
const double eps = .00... | [
"call.function.change",
"call.arguments.change"
] | 941,770 | 941,771 | u381394404 | cpp |
p03141 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, q) for (int i = 0; (q) > i; i++)
#define pb push_back
#define MAX 1000000000
#define MOD 1000000007
typedef pair<int, int> Paint;
bool Pairfirst(const Paint &pf, Paint &ps) { // sortCompare
return (pf.first + pf.second) < (... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, q) for (int i = 0; (q) > i; i++)
#define pb push_back
#define MAX 1000000000
#define MOD 1000000007
typedef pair<int, int> Paint;
bool Pairfirst(const Paint &pf, Paint &ps) { // sortCompare
return (pf.first + pf.second) > (... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 941,779 | 941,780 | u466161487 | cpp |
p03141 | #include <algorithm>
#include <array>
#include <cmath>
#include <cstring>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
const int MOD = 1000000007;
using namespace std;
typedef long long ll;
typedef tuple<ll, int, int> tup;
typedef vector<int> v... | #include <algorithm>
#include <array>
#include <cmath>
#include <cstring>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
const int MOD = 1000000007;
using namespace std;
typedef long long ll;
typedef tuple<ll, int, int> tup;
typedef vector<int> v... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 941,786 | 941,787 | u945017646 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
main() {
ll n, turn = 0, ans = 0;
cin >> n;
ll a[n], b[n];
pair<ll, ll> c[n];
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
c[i].first = a[i] + b[i];
c[i].second = i;
}
sort(c, c + n,
[](pair<int, int> p, pair<... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
main() {
ll n, turn = 0, ans = 0;
cin >> n;
ll a[n], b[n];
pair<ll, ll> c[n];
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
c[i].first = a[i] + b[i];
c[i].second = i;
}
sort(c, c + n,
[](pair<int, int> p, pair<... | [
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 941,793 | 941,794 | u268571052 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
using lli = long long int;
using ulli = unsigned long long int;
#define debug(x) cerr << #x << " : " << x << endl
#define debugv(x) \
cerr << #x << " : {"; ... | #include <bits/stdc++.h>
using namespace std;
using lli = long long int;
using ulli = unsigned long long int;
#define debug(x) cerr << #x << " : " << x << endl
#define debugv(x) \
cerr << #x << " : {"; ... | [
"call.function.change",
"call.arguments.change"
] | 941,800 | 941,801 | u031593168 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define all(a) (a).begin(), (a).end()
typedef long long ll;
int main(void) {
int n;
cin >> n;
vector<ll> a(n), b(n);
using P = pair<ll, int>;
vector<P> vp(n);
rep(i, n) {
cin >> a[i] >> b[i];
vp[i] = {m... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define all(a) (a).begin(), (a).end()
typedef long long ll;
int main(void) {
int n;
cin >> n;
vector<int> a(n), b(n);
using P = pair<int, int>;
vector<P> vp(n);
rep(i, n) {
cin >> a[i] >> b[i];
vp[i] = ... | [
"call.remove",
"call.arguments.change"
] | 941,802 | 941,803 | u241615199 | cpp |
p03141 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int MOD = (int)1e9 + 7, INF = (1 << 27);
const ll INFLL = (1LL << 55);
#define FOR(i, a, b) for (int(i) = (a); (i) < (int)(b); (i)++)
#define rep(i, n) FOR(i, 0, n)
template <typename T, typename U> inline void chmax(T... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int MOD = (int)1e9 + 7, INF = (1 << 27);
const ll INFLL = (1LL << 55);
#define FOR(i, a, b) for (int(i) = (a); (i) < (int)(b); (i)++)
#define rep(i, n) FOR(i, 0, n)
template <typename T, typename U> inline void chmax(T... | [
"call.function.change",
"call.arguments.change"
] | 941,804 | 941,805 | u258647915 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
#include <algorithm>
int main() {
int N, A, B;
cin >> N;
vector<int> Sum(N);
int ans = 0;
for (int i = 0; i < N; i++) {
cin >> A >> B;
Sum[i] = A + B;
ans -= B;
}
sort(Sum.begin(), Sum.end(), greater<int>());
for (int i = 0; i < N; i += 2) {
... | #include <bits/stdc++.h>
using namespace std;
#include <algorithm>
int main() {
int N, A, B;
cin >> N;
vector<int> Sum(N);
long long ans = 0;
for (int i = 0; i < N; i++) {
cin >> A >> B;
Sum[i] = A + B;
ans -= B;
}
sort(Sum.begin(), Sum.end(), greater<int>());
for (int i = 0; i < N; i += 2) ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 941,806 | 941,807 | u030090262 | cpp |
p03141 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
long long n;
cin >> n;
long long a[100000], b[100000];
vector<pair<long, long>> v;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
v.push_back(make_pair(b[i] - a[i], a[i]));
}
sort(v.rbegin(), v.rend());
long lon... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
long long n;
cin >> n;
long long a[100000], b[100000];
vector<pair<long, long>> v;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
v.push_back(make_pair(a[i] + b[i], a[i]));
}
sort(v.rbegin(), v.rend());
long lon... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change"
] | 941,808 | 941,809 | u546943614 | cpp |
p03141 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
#ifdef _DEBUG_
#define dump(val) cerr << __LINE__ << ":\t" << #val << " = " << (val) << endl
#else
#define dump(val)
#endif
using namespace std;
typedef long long int ll;
template ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
#ifdef _DEBUG_
#define dump(val) cerr << __LINE__ << ":\t" << #val << " = " << (val) << endl
#else
#define dump(val)
#endif
using namespace std;
typedef long long int ll;
template ... | [] | 941,810 | 941,811 | u451748673 | cpp |
p03141 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
vector<tuple<int, int, int>> vt(n);
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
int c = abs(a - b);
vt.at(i) = make_tuple(c, a, b);
}
sort(rbegin(vt), rend(vt));
ll taka = 0, aoki =... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
vector<tuple<int, int, int>> vt(n);
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
int c = a + b;
vt.at(i) = make_tuple(c, a, b);
}
sort(rbegin(vt), rend(vt));
ll taka = 0, aoki = 0;
... | [
"call.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 941,812 | 941,813 | u479371430 | cpp |
p03141 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
vector<tuple<int, int, int>> vt(n);
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
int c = a - b;
vt.at(i) = make_tuple(c, a, b);
}
sort(rbegin(vt), rend(vt));
ll taka = 0, aoki = 0;
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
vector<tuple<int, int, int>> vt(n);
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
int c = a + b;
vt.at(i) = make_tuple(c, a, b);
}
sort(rbegin(vt), rend(vt));
ll taka = 0, aoki = 0;
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 941,814 | 941,813 | u479371430 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = n - 1; i >= (0); i--)
#define reps(i, f, n) for (int i = (f); i < (n); i++)
#define each(i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = n - 1; i >= (0); i--)
#define reps(i, f, n) for (int i = (f); i < (n); i++)
#define each(i... | [
"assignment.value.change",
"identifier.change"
] | 941,817 | 941,818 | u029876051 | cpp |
p03141 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define pb push_back
#define int long long int
using namespace std;
typedef pair<int, int> pii;
int n;
struct mypair1 {
int x, y, z, index;
mypair1(int a, int b, int c... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define pb push_back
#define int long long int
using namespace std;
typedef pair<int, int> pii;
int n;
struct mypair1 {
int x, y, z, index;
mypair1(int a, int b, int c... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 941,822 | 941,823 | u733823138 | cpp |
p03141 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define pb push_back
#define int long long int
using namespace std;
typedef pair<int, int> pii;
int n;
struct mypair1 {
int x, y, z, index;
mypair1(int a, int b, int c... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define pb push_back
#define int long long int
using namespace std;
typedef pair<int, int> pii;
int n;
struct mypair1 {
int x, y, z, index;
mypair1(int a, int b, int c... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 941,824 | 941,823 | u733823138 | cpp |
p03141 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define pb push_back
#define int long long int
using namespace std;
typedef pair<int, int> pii;
int n;
struct mypair1 {
int x, y, z, index;
mypair1(int a, int b, int c... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define pb push_back
#define int long long int
using namespace std;
typedef pair<int, int> pii;
int n;
struct mypair1 {
int x, y, z, index;
mypair1(int a, int b, int c... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change",
"expression.operator.arithmetic.change",
"call.arguments.change"
] | 941,825 | 941,823 | u733823138 | cpp |
p03141 | #include <algorithm>
#include <iostream>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
using namespace std;
typedef tuple<ll, ll, ll> ituple;
int N;
ll A[100005];
ll B[100005];
ll C[100005];
vector<ituple> y;
int main() {
cin >> N;
rep(i, N) {
cin >> A[... | #include <algorithm>
#include <iostream>
#include <tuple>
//#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
using namespace std;
typedef tuple<ll, ll, ll> ituple;
int N;
ll A[100005];
ll B[100005];
ll C[100005];
vector<ituple> y;
int main() {
cin >> N;
rep(i... | [
"call.function.change",
"call.arguments.change"
] | 941,836 | 941,837 | u180262908 | cpp |
p03141 | #include <algorithm>
#include <iostream>
#include <tuple>
//#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
using namespace std;
typedef tuple<ll, ll, ll> ituple;
int N;
ll A[100005];
ll B[100005];
ll C[100005];
vector<ituple> y;
int main() {
cin >> N;
rep(i... | #include <algorithm>
#include <iostream>
#include <tuple>
//#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
using namespace std;
typedef tuple<ll, ll, ll> ituple;
int N;
ll A[100005];
ll B[100005];
ll C[100005];
vector<ituple> y;
int main() {
cin >> N;
rep(i... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.function.change",
"call.arguments.change"
] | 941,838 | 941,837 | u180262908 | cpp |
p03141 | #include <algorithm>
#include <iostream>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
using namespace std;
typedef tuple<ll, ll, ll> ituple;
int N;
ll A[100005];
ll B[100005];
ll C[100005];
vector<ituple> y;
int main() {
cin >> N;
rep(i, N) {
cin >> A[... | #include <algorithm>
#include <iostream>
#include <tuple>
//#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
using namespace std;
typedef tuple<ll, ll, ll> ituple;
int N;
ll A[100005];
ll B[100005];
ll C[100005];
vector<ituple> y;
int main() {
cin >> N;
rep(i... | [
"call.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 941,839 | 941,837 | u180262908 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
#define lint long long
#define P pair<int, int>
#define LLP pair<long long, long long>
#define REP(i, x, n) for (int i = (x), i##_len = (int)(n); i < i##_len; ++i)
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; ++i)
#define repr(i, n) for (int i = (int)... | #include <bits/stdc++.h>
using namespace std;
#define lint long long
#define P pair<int, int>
#define LLP pair<long long, long long>
#define REP(i, x, n) for (int i = (x), i##_len = (int)(n); i < i##_len; ++i)
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; ++i)
#define repr(i, n) for (int i = (int)... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.for.condition.change",
"function.return_value.change",
"expression.operation.binary.change",
"expression.operator.compare.change"
] | 941,849 | 941,850 | u895641117 | cpp |
p03141 | #include <bits/stdc++.h>
/**/
using namespace std;
int main() {
long long int N;
cin >> N;
map<pair<long long int, long long int>, long long int> count;
vector<pair<long long int, pair<long long int, long long int>>> A, B;
for (size_t i = 0; i < N; i++) {
long long int a, b;
cin >> a >> b;
aut... | #include <bits/stdc++.h>
/**/
using namespace std;
int main() {
long long int N;
cin >> N;
map<pair<long long int, long long int>, long long int> count;
vector<pair<long long int, pair<long long int, long long int>>> A, B;
for (size_t i = 0; i < N; i++) {
long long int a, b;
cin >> a >> b;
aut... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 941,858 | 941,859 | u779353743 | cpp |
p03141 | #include <bits/stdc++.h>
/**/
using namespace std;
int main() {
long long int N;
cin >> N;
map<pair<long long int, long long int>, long long int> count;
vector<pair<long long int, pair<long long int, long long int>>> A, B;
for (size_t i = 0; i < N; i++) {
long long int a, b;
cin >> a >> b;
aut... | #include <bits/stdc++.h>
/**/
using namespace std;
int main() {
long long int N;
cin >> N;
map<pair<long long int, long long int>, long long int> count;
vector<pair<long long int, pair<long long int, long long int>>> A, B;
for (size_t i = 0; i < N; i++) {
long long int a, b;
cin >> a >> b;
aut... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 941,860 | 941,859 | u779353743 | cpp |
p03141 | #include <bits/stdc++.h>
/**/
using namespace std;
int main() {
long long int N;
cin >> N;
map<pair<long long int, long long int>, long long int> count;
vector<pair<long long int, pair<long long int, long long int>>> A, B;
for (size_t i = 0; i < N; i++) {
long long int a, b;
cin >> a >> b;
aut... | #include <bits/stdc++.h>
/**/
using namespace std;
int main() {
long long int N;
cin >> N;
map<pair<long long int, long long int>, long long int> count;
vector<pair<long long int, pair<long long int, long long int>>> A, B;
for (size_t i = 0; i < N; i++) {
long long int a, b;
cin >> a >> b;
aut... | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 941,861 | 941,859 | u779353743 | cpp |
p03141 | #include <algorithm>
#include <bitset>
#include <chrono>
#include <complex>
#include <cstdio>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, x, y) for (ll i = x; i <= y; i++)
#def... | #include <algorithm>
#include <bitset>
#include <chrono>
#include <complex>
#include <cstdio>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, x, y) for (ll i = x; i <= y; i++)
#def... | [
"identifier.change",
"variable_access.subscript.index.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 941,866 | 941,867 | u834354741 | cpp |
p03141 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<ll> a(n), b(n);
for (int i = 0; i < n; ++i)
cin >> a[i] >> b[i];
vector<pair<ll, int>> c;
ll t = 0, k = 0;
for (int i = 0; i < n; ++i) {
c.empla... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<ll> a(n), b(n);
for (int i = 0; i < n; ++i)
cin >> a[i] >> b[i];
vector<pair<ll, int>> c;
ll t = 0, k = 0;
for (int i = 0; i < n; ++i) {
c.empla... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 941,868 | 941,869 | u054652697 | cpp |
p03142 | #include <array>
#include <bits/stdc++.h>
using namespace std;
using ULL = unsigned long long;
using UL = unsigned;
using LL = long long;
#define rep(i, n) for (UL i = 0; i < (n); i++)
struct Problem {
void Solve() {
UL N, M;
cin >> N >> M;
vector<vector<UL>> E(N);
vector<UL> F(N);
vector<UL> P(... | #include <array>
#include <bits/stdc++.h>
using namespace std;
using ULL = unsigned long long;
using UL = unsigned;
using LL = long long;
#define rep(i, n) for (UL i = 0; i < (n); i++)
struct Problem {
void Solve() {
UL N, M;
cin >> N >> M;
vector<vector<UL>> E(N);
vector<UL> F(N);
vector<UL> P(... | [] | 941,881 | 941,882 | u331948661 | cpp |
p03142 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >> N >> M;
vector<vector<int>> G(N + 1);
vector<int> PC(N + 1, 0);
for (int i = 0; i < N + M - 1; i++) {
int a, b;
cin >> a >> b;
G[a].emplace_back(b);
PC[b]++;
}
vector<... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >> N >> M;
vector<vector<int>> G(N + 1);
vector<int> PC(N + 1, 0);
for (int i = 0; i < N + M - 1; i++) {
int a, b;
cin >> a >> b;
G[a].emplace_back(b);
PC[b]++;
}
vector<... | [
"assignment.change"
] | 941,892 | 941,893 | u782098901 | cpp |
p03142 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define INF 1LL << 60
typedef long long int LL;
typedef long long int ll;
#define pll pair<ll, ll>
#define F first
#define S sec... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define INF 1LL << 60
typedef long long int LL;
typedef long long int ll;
#define pll pair<ll, ll>
#define F first
#define S sec... | [
"expression.operation.binary.add"
] | 941,899 | 941,900 | u587857074 | cpp |
p03142 | #include <bits/stdc++.h>
#define mx 100005
using namespace std;
vector<int> ch[mx];
stack<int> st;
int n, m, a, b, rt, nm[mx], pa[mx];
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < n + m - 1; i++) {
scanf("%d%d", &a, &b);
ch[a].push_back(b);
nm[b]++;
}
for (rt = 1; !nm[rt]; rt++)
;... | #include <bits/stdc++.h>
#define mx 100005
using namespace std;
vector<int> ch[mx];
stack<int> st;
int n, m, a, b, rt, nm[mx], pa[mx];
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < n + m - 1; i++) {
scanf("%d%d", &a, &b);
ch[a].push_back(b);
nm[b]++;
}
for (rt = 1; nm[rt]; rt++)
;
... | [
"expression.operation.unary.logical.remove"
] | 941,903 | 941,904 | u309985845 | cpp |
p03142 | #include <bits/stdc++.h>
using namespace std;
struct edge {
int to, dir;
};
struct graph {
int n;
vector<vector<int>> g;
vector<bool> used;
vector<int> ts;
vector<int> pr;
graph(int _n) {
n = _n;
g.resize(n);
used.resize(n, false);
pr.resize(n, -1);
};
void add_edge(int a, int b) {... | #include <bits/stdc++.h>
using namespace std;
struct edge {
int to, dir;
};
struct graph {
int n;
vector<vector<int>> g;
vector<bool> used;
vector<int> ts;
vector<int> pr;
graph(int _n) {
n = _n;
g.resize(n);
used.resize(n, false);
pr.resize(n, -1);
};
void add_edge(int a, int b) {... | [] | 941,909 | 941,910 | u731175398 | cpp |
p03142 | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#in... | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#in... | [
"call.arguments.change"
] | 941,911 | 941,912 | u508571192 | cpp |
p03142 | #include <bits/stdc++.h>
using namespace std;
const int MAXn = 1e5 + 10;
int indeg[MAXn], par[MAXn], n, m;
vector<int> g[MAXn], vec;
void del(int v) {
for (int i = 0; i < g[v].size(); i++) {
indeg[g[v][i]]--;
if (!indeg[g[v][i]]) {
par[g[v][i]] = v;
vec.push_back(g[v][i]);
}
}
}
int main()... | #include <bits/stdc++.h>
using namespace std;
const int MAXn = 1e5 + 10;
int indeg[MAXn], par[MAXn], n, m;
vector<int> g[MAXn], vec;
void del(int v) {
for (int i = 0; i < g[v].size(); i++) {
indeg[g[v][i]]--;
if (!indeg[g[v][i]]) {
par[g[v][i]] = v + 1;
vec.push_back(g[v][i]);
}
}
}
int ma... | [
"assignment.change"
] | 941,913 | 941,914 | u138661009 | cpp |
p03145 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> pll;
const ll mod = 1e9 + 7;
// const ll mod=998244353;
const ll inf = 5e18;
int main() {
ll a, b, c;
cin >> a >> b >> c;
cout << a * b << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> pll;
const ll mod = 1e9 + 7;
// const ll mod=998244353;
const ll inf = 5e18;
int main() {
ll a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
} | [
"expression.operation.binary.add"
] | 941,977 | 941,978 | u718758485 | cpp |
p03145 | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
auto &errStream = cerr;
... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
auto &errStream = cerr;
... | [
"call.arguments.add"
] | 941,983 | 941,984 | u700484101 | cpp |
p03145 | #include <iostream>
using namespace std;
int main(void) {
int a, b, c, ans;
cin >> a >> b >> c;
ans = (a * b) / 2;
cout << ans << '¥n';
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
int a, b, c, ans;
cin >> a >> b >> c;
ans = (a * b) / 2;
cout << ans;
return 0;
}
| [
"expression.operation.binary.remove"
] | 941,985 | 941,986 | u700484101 | cpp |
p03145 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int l, m, n;
scanf("%d%d%d", &l, &m, &n);
printf("%d\n", (l + m) / 2);
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int l, m, n;
scanf("%d%d%d", &l, &m, &n);
printf("%d\n", (l * m) / 2);
return 0;
}
| [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 942,078 | 942,079 | u684448032 | cpp |
p03145 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a * c / 2 << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
} | [
"identifier.change",
"io.output.change"
] | 942,083 | 942,084 | u299863190 | cpp |
p03145 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
int a, b, c;
cin >> b >> c;
cout << a * b / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
} | [
"expression.operation.binary.add"
] | 942,104 | 942,105 | u796273093 | cpp |
p03145 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> c;
cout << (a * b) / 2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (a * b) / 2 << endl;
}
| [
"expression.operation.binary.add"
] | 942,110 | 942,111 | u006937669 | cpp |
p03145 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> c;
cout << a * b / 2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (a * b) / 2 << endl;
}
| [
"expression.operation.binary.add"
] | 942,112 | 942,111 | u006937669 | cpp |
p03145 | #include "bits/stdc++.h"
using namespace std;
// GNU C Compiler
// template<class T> inline string toString(T x) { ostringstream sout; sout <<
// x; return sout.str(); }
// type
using ll = int_fast64_t;
using ull = uint_fast64_t;
using LL = long long;
using ULL = unsigned long long;
using PII = pair<int, int>;
// usi... | #include "bits/stdc++.h"
using namespace std;
// GNU C Compiler
// template<class T> inline string toString(T x) { ostringstream sout; sout <<
// x; return sout.str(); }
// type
using ll = int_fast64_t;
using ull = uint_fast64_t;
using LL = long long;
using ULL = unsigned long long;
using PII = pair<int, int>;
// usi... | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 942,127 | 942,128 | u585586208 | cpp |
p03145 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << (A + B) / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << (A * B) / 2 << endl;
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 942,131 | 942,132 | u602711435 | cpp |
p03145 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5, M = 1e6 + 6, OO = 0x3f3f3f3f;
int a, b, c;
int main() {
cin >> a >> b >> c;
cout << (b + 1) / 2 * a << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5, M = 1e6 + 6, OO = 0x3f3f3f3f;
int a, b, c;
int main() {
cin >> a >> b >> c;
cout << (b * a) / 2 << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 942,149 | 942,150 | u411546337 | cpp |
p03145 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5, M = 1e6 + 6, OO = 0x3f3f3f3f;
int a, b, c;
int main() {
cin >> a >> b >> c;
cout << b / 2 * a << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5, M = 1e6 + 6, OO = 0x3f3f3f3f;
int a, b, c;
int main() {
cin >> a >> b >> c;
cout << (b * a) / 2 << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 942,151 | 942,150 | u411546337 | cpp |
p03145 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b... | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 942,170 | 942,171 | u646962247 | cpp |
p03145 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define fin(ans) cout << (ans) << endl;
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef long long lli;
type... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define fin(ans) cout << (ans) << endl;
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef long long lli;
type... | [
"call.arguments.change"
] | 942,211 | 942,212 | u743889070 | cpp |
p03145 | // include
// ------------------------------------------------
#include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <vector>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
string upper(string str); // 英字を大文字に変換する。
string l... | // include
// ------------------------------------------------
#include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <vector>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
string upper(string str); // 英字を大文字に変換する。
string l... | [
"expression.operation.binary.remove"
] | 942,247 | 942,248 | u610897920 | cpp |
p03145 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a * b / c << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
return 0;
} | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 942,259 | 942,260 | u955202970 | cpp |
p03145 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = a * b;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int ans = a * b / 2;
cout << ans << endl;
}
| [
"assignment.change"
] | 942,285 | 942,286 | u578871832 | cpp |
p03145 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a * (b / 2) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (a * b) / 2 << endl;
} | [] | 942,310 | 942,311 | u654240084 | cpp |
p03145 | #include <bits/stdc++.h>
using namespace std;
#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 a, b, c;
cin >> a >> b >> c;
cout << a * b << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#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 a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 942,312 | 942,313 | u685800831 | cpp |
p03145 | #include <bits/stdc++.h>
using namespace std;
int main() {
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << AB * BC << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << AB * BC / 2 << endl;
} | [
"expression.operation.binary.add"
] | 942,375 | 942,376 | u629548179 | cpp |
p03145 | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort(ALL(V)) //小さい方からソート
#define REV(V) reverse(ALL(V)) //リバース
#define RSORT(V) ... | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort(ALL(V)) //小さい方からソート
#define REV(V) reverse(ALL(V)) //リバース
#define RSORT(V) ... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 942,403 | 942,404 | u154645927 | cpp |
p03145 | #include <bits/stdc++.h>
using namespace std;
int main() {
int ab, bc, ca;
cin >> ab, bc, ca;
cout << ab * bc / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << ab * bc / 2 << endl;
} | [] | 942,433 | 942,434 | u071019032 | cpp |
p03145 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
int res;
res = a * b / 2;
printf("%lf", res);
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
int res;
res = a * b / 2;
printf("%d", res);
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 942,444 | 942,445 | u405620865 | cpp |
p03145 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
double a, b, c;
cin >> a >> b >> c;
double res;
res = a * b / 2.0;
printf("%lf", res);
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
int res;
res = a * b / 2;
printf("%d", res);
return 0;
}
| [
"variable_declaration.type.primitive.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 942,446 | 942,445 | u405620865 | cpp |
p03145 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
double a, b, c;
cin >> a >> b >> c;
double res;
res = a * b / 2;
printf("%lf", res);
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
int res;
res = a * b / 2;
printf("%d", res);
return 0;
}
| [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 942,447 | 942,445 | u405620865 | cpp |
p03145 | #include <bits/stdc++.h>
#define rep(i, m, n) for (int i = m; i < n; i++)
#define co(n) cout << n << endl
using namespace std;
int main() {
int a, b;
cin >> a, b;
co(a * b / 2);
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, m, n) for (int i = m; i < n; i++)
#define co(n) cout << n << endl
using namespace std;
int main() {
int a, b;
cin >> a >> b;
co(a * b / 2);
return 0;
}
| [] | 942,492 | 942,493 | u558115145 | cpp |
p03145 | #include <iostream>
using namespace std;
int main(void) {
int AB, BC;
cin >> AB >> BC;
cout << AB * BC << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
int AB, BC;
cin >> AB >> BC;
cout << AB * BC / 2 << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 942,494 | 942,495 | u976833038 | cpp |
p03145 | #include <iostream>
#include <string>
using namespace std;
int main() {
int x, y, z;
cin >> x >> y >> z;
cout << (x + y) / 2 << endl;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int x, y, z;
cin >> x >> y >> z;
cout << (x * y) / 2 << endl;
}
| [
"expression.operator.arithmetic.change",
"io.output.change"
] | 942,526 | 942,527 | u902803949 | cpp |
p03142 | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdarg>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <s... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdarg>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <s... | [
"expression.operation.binary.add"
] | 942,560 | 942,561 | u307578234 | cpp |
p03142 |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cstdio>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <type... |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cstdio>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <type... | [
"expression.operation.binary.remove"
] | 942,562 | 942,563 | u304121198 | cpp |
p03142 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
vector<int> degrees;
vector<int> fa;
map<int, vector<int>> mp;
int main() {
int n, m;
cin >> n >> m;
degrees.resize(n, 0);
fa.resize(n, 0);
for (int i = 0; i < n + m - 1; i++) {... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
vector<int> degrees;
vector<int> fa;
map<int, vector<int>> mp;
int main() {
int n, m;
cin >> n >> m;
degrees.resize(n + 1, 0);
fa.resize(n + 1, 0);
for (int i = 0; i < n + m - 1... | [
"expression.operation.binary.add"
] | 942,568 | 942,569 | u656732735 | cpp |
p03142 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
vector<int> degrees;
vector<int> fa;
map<int, vector<int>> mp;
int main() {
int n, m;
cin >> n >> m;
degrees.resize(n, 0);
fa.resize(n, -1);
for (int i = 0; i < n + m - 1; i++) ... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
vector<int> degrees;
vector<int> fa;
map<int, vector<int>> mp;
int main() {
int n, m;
cin >> n >> m;
degrees.resize(n + 1, 0);
fa.resize(n + 1, 0);
for (int i = 0; i < n + m - 1... | [
"call.arguments.change",
"expression.operation.unary.arithmetic.remove",
"call.arguments.add"
] | 942,570 | 942,569 | u656732735 | cpp |
p03142 | /***********************
* Author: xuziyuan *
***********************/
#include <bits/stdc++.h>
#define rt0 return 0
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
#define replet(c) for (char c = 'a'; c <= 'z'; c++)
#define LL long long
#define pii pair<int, int>
#... | /***********************
* Author: xuziyuan *
***********************/
#include <bits/stdc++.h>
#define rt0 return 0
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
#define replet(c) for (char c = 'a'; c <= 'z'; c++)
#define LL long long
#define pii pair<int, int>
#... | [
"identifier.replace.add",
"literal.replace.remove",
"function.return_value.change"
] | 942,571 | 942,572 | u977365687 | cpp |
p03142 | #include <bits/stdc++.h>
using namespace std;
int deep[100010], par[100010];
vector<int> v[100010];
int a, b, in[100010], n, m;
int dfs(int x) {
if (deep[x] != -1)
return deep[x];
deep[x] = 0;
for (int i = 0; i < v[x].size(); ++i)
deep[x] = max(deep[x], deep[v[x][i]] + 1);
return deep[x];
}
void dfs2(in... | #include <bits/stdc++.h>
using namespace std;
int deep[100010], par[100010];
vector<int> v[100010];
int a, b, in[100010], n, m;
int dfs(int x) {
if (deep[x] != -1)
return deep[x];
deep[x] = 0;
for (int i = 0; i < v[x].size(); ++i)
deep[x] = max(deep[x], dfs(v[x][i]) + 1);
return deep[x];
}
void dfs2(int... | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 942,573 | 942,574 | u989325410 | cpp |
p03142 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF (1 << (4 * 4 - 1))
#define MOD 1000000007
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
in... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF (1 << (4 * 4 - 1))
#define MOD 1000000007
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
in... | [
"control_flow.loop.for.condition.change",
"call.arguments.change"
] | 942,585 | 942,586 | u864171425 | cpp |
p03142 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define INF 0x3f3f3f3f // 3f3f3f3f
#define ll long long
#define ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define INF 0x3f3f3f3f // 3f3f3f3f
#define ll long long
#define ... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 942,589 | 942,590 | u800506905 | cpp |
p03142 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <set>
#include <vector>
#define REP(i, N) for (int i = 0; i < N; i++)
using namespace std;
using vi = vector<int>;
int main() {
int N, M, root;
cin >> N >> M;
vi A(N - 1 + M), B(N - 1 + M), visited(N), sorted, sortedinv(N);
... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <set>
#include <vector>
#define REP(i, N) for (int i = 0; i < N; i++)
using namespace std;
using vi = vector<int>;
int main() {
int N, M, root;
cin >> N >> M;
vi A(N - 1 + M), B(N - 1 + M), visited(N), sorted, sortedinv(N);
... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 942,591 | 942,592 | u486021106 | cpp |
p03142 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define REP(NAME, NUM) for (int NAME = 0; NAME < (NUM); ++NAME)
#define BREP(NAME, NUM) for (int NAME = (NUM)-1; NAME >= 0; --NAME)
#define VEC(TYPE, A, NAME, INIT) vector<TYPE> NAME(A, INIT)
#de... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define REP(NAME, NUM) for (int NAME = 0; NAME < (NUM); ++NAME)
#define BREP(NAME, NUM) for (int NAME = (NUM)-1; NAME >= 0; --NAME)
#define VEC(TYPE, A, NAME, INIT) vector<TYPE> NAME(A, INIT)
#de... | [
"literal.number.change",
"assignment.value.change"
] | 942,598 | 942,599 | u627427672 | cpp |
p03145 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, z;
cin >> x >> y >> z;
cout << x * (y / 2) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, z;
cin >> x >> y >> z;
cout << (x * y) / 2 << endl;
}
| [] | 942,604 | 942,605 | u222613738 | cpp |
p03145 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c;
cin >> a >> b >> c;
cout << 1 / 2 * a * b;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c;
cin >> a >> b >> c;
cout << a * b / 2;
return 0;
}
| [
"expression.operation.binary.remove"
] | 942,632 | 942,633 | u562321612 | cpp |
p03145 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int b[100000];
signed main() {
int a, b, c, d;
cin >> a >> b >> c;
cout << b * c / 2 << "\n";
return (0);
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int b[100000];
signed main() {
int a, b, c, d;
cin >> a >> b >> c;
cout << a * b / 2 << "\n";
return (0);
} | [
"identifier.change",
"io.output.change"
] | 942,675 | 942,676 | u240895927 | cpp |
p03145 | #include <iostream>
using namespace std;
int main() {
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << double(bc * ca) / 2 << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int ab, bc, ca;
cin >> ab >> bc >> ca;
cout << bc * ab / 2 << endl;
return 0;
} | [
"call.remove",
"identifier.change",
"io.output.change",
"call.arguments.change"
] | 942,700 | 942,701 | u057810841 | cpp |
p03145 | #include <algorithm>
#define _USE_MATH_DEFINES
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(a) a.begin(), a.... | #include <algorithm>
#define _USE_MATH_DEFINES
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(a) a.begin(), a.... | [
"identifier.change",
"io.output.change"
] | 942,704 | 942,705 | u382102154 | cpp |
p03145 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int d = a / 2;
cout << d * b;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int d = a * b;
cout << d / 2;
return 0;
} | [] | 942,719 | 942,720 | u484351040 | cpp |
p03145 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << A * B;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << A * B / 2;
} | [
"expression.operation.binary.add"
] | 942,799 | 942,800 | u383166010 | cpp |
p03145 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdexcept>
#include <string>
using namespace std;
int main() {
int a, b, c, d, e;
char g[20];
string h, i;
cin >> a >> b >> c;
cout << a * b;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdexcept>
#include <string>
using namespace std;
int main() {
int a, b, c, d, e;
char g[20];
string h, i;
cin >> a >> b >> c;
cout << a * b / 2;
} | [
"expression.operation.binary.add"
] | 942,827 | 942,828 | u768204022 | cpp |
p03145 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdexcept>
#include <string>
using namespace std;
int main() {
int a, b, c, d, e;
char g[20];
string h, i;
cin >> a, b, c;
cout << a * b;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdexcept>
#include <string>
using namespace std;
int main() {
int a, b, c, d, e;
char g[20];
string h, i;
cin >> a >> b >> c;
cout << a * b / 2;
} | [
"expression.operation.binary.add"
] | 942,829 | 942,828 | u768204022 | cpp |
p03145 | #include <bits/stdc++.h>
int main(void) {
std::vector<int> len(3);
for (int i = 0; i < 3; i++) {
std::cin >> len.at(i);
}
std::cout << len.at(0) * len.at(1) << std::endl;
return 0;
} | #include <bits/stdc++.h>
int main(void) {
std::vector<int> len(3);
for (int i = 0; i < 3; i++) {
std::cin >> len.at(i);
}
std::cout << len.at(0) * len.at(1) / 2 << std::endl;
return 0;
} | [
"expression.operation.binary.add"
] | 942,854 | 942,855 | u801884816 | cpp |
p03145 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main(int argc, char const *argv[]) {
int a, b, c;
cin >> a >> b >> c;
cout << (a + b) / 2 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main(int argc, char const *argv[]) {
int a, b, c;
cin >> a >> b >> c;
cout << (a * b) / 2 << endl;
return 0;
}
| [
"expression.operator.arithmetic.change",
"io.output.change"
] | 942,890 | 942,891 | u029876051 | cpp |
p03145 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main(int argc, char const *argv[]) {
int a, b, c;
cin >> a >> b >> c;
cout << (double)(a + b) / 2 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main(int argc, char const *argv[]) {
int a, b, c;
cin >> a >> b >> c;
cout << (a * b) / 2 << endl;
return 0;
}
| [
"expression.operator.arithmetic.change",
"io.output.change"
] | 942,892 | 942,891 | u029876051 | cpp |
p03145 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << (AB * CA) / 2 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << (AB * BC) / 2 << endl;
}
| [
"identifier.change",
"io.output.change"
] | 942,906 | 942,907 | u983062344 | cpp |
p03145 | #include <bits/stdc++.h>
using namespace std;
int main() {
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << (AB + BC) / 2 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << (AB * BC) / 2 << endl;
}
| [
"expression.operator.arithmetic.change",
"io.output.change"
] | 942,908 | 942,907 | u983062344 | cpp |
p03145 | #include <bits/stdc++.h>
using namespace std;
int main() {
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << (AB + CA) / 2 << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << (AB * BC) / 2 << endl;
}
| [] | 942,909 | 942,907 | u983062344 | cpp |
p03145 | // https://atcoder.jp/contests/abc116/tasks/abc116_a
#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main();
i... | // https://atcoder.jp/contests/abc116/tasks/abc116_a
#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main();
i... | [
"expression.operation.binary.add"
] | 942,990 | 942,991 | u141378465 | cpp |
p03145 | #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 1;
int A, B, C;
cin >> A >> B >> C;
ans = A * C;
// cout << ans <<endl;
cout << ans / 2 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 1;
int A, B, C;
cin >> A >> B >> C;
ans = A * B;
// cout << ans <<endl;
cout << ans / 2 << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 943,010 | 943,011 | u355424600 | cpp |
p03145 | #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 1;
int A, B, C;
cin >> A >> B >> C;
ans = A * C;
// cout << ans <<endl;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 1;
int A, B, C;
cin >> A >> B >> C;
ans = A * B;
// cout << ans <<endl;
cout << ans / 2 << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 943,012 | 943,011 | u355424600 | cpp |
p03145 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int AB, BC, CA;
cin >> AB >> BC >> CA;
int ans = AB * BC;
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int AB, BC, CA;
cin >> AB >> BC >> CA;
int ans = AB * BC / 2;
cout << ans << endl;
return 0;
}
| [
"assignment.change"
] | 943,020 | 943,021 | u791220701 | cpp |
p03145 | #include <iostream>
using namespace std;
int main() {
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << AB * BC << endl;
} | #include <iostream>
using namespace std;
int main() {
int AB, BC, CA;
cin >> AB >> BC >> CA;
cout << AB * BC / 2 << endl;
} | [
"expression.operation.binary.add"
] | 943,068 | 943,069 | u096717230 | cpp |
p03145 | #include <bits/stdc++.h>
using namespace std;
int main() {
int ab, bc, ca, answer;
cin >> ab >> bc;
answer == ab *bc / 2;
cout << answer << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int ab, bc, ca, answer;
cin >> ab >> bc;
answer = ab * bc / 2;
cout << answer << endl;
}
| [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 943,099 | 943,100 | u003761219 | cpp |
p03145 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (a + b + c) / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 943,117 | 943,118 | u539675863 | cpp |
p03145 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a * b << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a * b / 2 << endl;
}
| [
"expression.operation.binary.add"
] | 943,218 | 943,219 | u535810324 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.