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 |
|---|---|---|---|---|---|---|---|
p03059 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << b / a * c;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << c / a * b;
} | [
"identifier.change",
"io.output.change"
] | 872,255 | 872,256 | u220820597 | cpp |
p03059 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
b /= a;
cout << b * c;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
c /= a;
cout << b * c;
} | [
"assignment.variable.change",
"identifier.change"
] | 872,257 | 872,258 | u242718608 | cpp |
p03059 | #include <algorithm>
#include <iostream>
#include <string.h>
#include <vector>
using namespace std;
int main(void) {
int A, B, T;
cin >> A >> B >> T;
cout << A / T * B;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string.h>
#include <vector>
using namespace std;
int main(void) {
int A, B, T;
cin >> A >> B >> T;
cout << T / A * B;
return 0;
}
| [
"expression.operation.binary.remove"
] | 872,299 | 872,300 | u238235808 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << (T % A) * B;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << (T / A) * B;
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 872,305 | 872,306 | u261514692 | cpp |
p03059 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (a / c) * b << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (c / a) * b << endl;
}
| [
"expression.operation.binary.remove"
] | 872,321 | 872,322 | u401900157 | cpp |
p03059 | #include <iostream>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << b * (t % a) << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << b * (t / a) << endl;
return 0;
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 872,346 | 872,347 | u288042356 | cpp |
p03059 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#define ll long long
#define P pair<int, int>
#define FOR(i, N) for (int i = 0; i < (int)N; i++... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#define ll long long
#define P pair<int, int>
#define FOR(i, N) for (int i = 0; i < (int)N; i++... | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 872,380 | 872,381 | u656771711 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
typedef long long lli;
typedef pair<lli, lli> pll;
typedef vector<lli> vcL;
void solve() {
int n = 3;
// cin >> n;
int s[n + 5];
for (int i = 0; i < n; ++i)
cin >> s[i];
cout << s[2] / s[0] * s[1] << '\n';
}
int main() {
int t;
// cin >> t;
while (t-... | #include <bits/stdc++.h>
using namespace std;
typedef long long lli;
typedef pair<lli, lli> pll;
typedef vector<lli> vcL;
void solve() {
int n = 3;
// cin >> n;
int s[n + 5];
for (int i = 0; i < n; ++i)
cin >> s[i];
cout << s[2] / s[0] * s[1] << '\n';
}
int main() {
int t = 1;
// cin >> t;
while... | [
"variable_declaration.value.change"
] | 872,382 | 872,383 | u516708338 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N, M, Q, A, B, C, arr[200005];
string s, p;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> N;
cin >> A >> B >> N;
cout << (N / A) * B << '\n';
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N, M, Q, A, B, C, arr[200005];
string s, p;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> A >> B >> N;
cout << (N / A) * B << '\n';
} | [] | 872,394 | 872,395 | u496254754 | cpp |
p03059 | #include <bits/stdc++.h>
#define mod 1000000007
#define ll long long
#define inf 999999999999
#define mx 200005
#define gcd __gcd
#define pb push_back
#define mk make_pair
#define bs binary_search
#define ub upper_bound
#define lb lower_bound
#define endl "\n"
#define vl vector<ll>
#define vs vector<string>
using names... | #include <bits/stdc++.h>
#define mod 1000000007
#define ll long long
#define inf 999999999999
#define mx 200005
#define gcd __gcd
#define pb push_back
#define mk make_pair
#define bs binary_search
#define ub upper_bound
#define lb lower_bound
#define endl "\n"
#define vl vector<ll>
#define vs vector<string>
using names... | [
"identifier.change",
"expression.operation.binary.change"
] | 872,396 | 872,397 | u720296041 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << t / b * a << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
cout << t / a * b << endl;
} | [
"expression.operation.binary.remove"
] | 872,400 | 872,401 | u325586706 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int d = c / a;
cout << d * c << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int d = c / a;
cout << d * b << endl;
}
| [
"identifier.change",
"io.output.change"
] | 872,407 | 872,408 | u066647962 | cpp |
p03059 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using std::cin;
using std::cout;
using std::deque;
using std::make_pair;
using std::next_permutation;
using std::pair;
using std::priority_queue;
using std::queue;
using std::setfill;
using... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using std::cin;
using std::cout;
using std::deque;
using std::make_pair;
using std::next_permutation;
using std::pair;
using std::priority_queue;
using std::queue;
using std::setfill;
using... | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 872,411 | 872,412 | u032455837 | cpp |
p03059 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
c = c / a;
b = a * b;
cout << b << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
c = c / a;
b = c * b;
cout << b << endl;
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 872,413 | 872,414 | u618604643 | cpp |
p03060 | #include <bitset>
#include <cmath>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
int main() {
int N;
std::cin >> N;
std::vector<int> V(N);
std::vector<int> C(N);
for (int i = 0; i < N; i++) {
std::cin >> V.at(i);
}
for (int i = 0; i < N; i++) {
std::cin >> C.at(i);
... | #include <bitset>
#include <cmath>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
int main() {
int N;
std::cin >> N;
std::vector<int> V(N);
std::vector<int> C(N);
for (int i = 0; i < N; i++) {
std::cin >> V.at(i);
}
for (int i = 0; i < N; i++) {
std::cin >> C.at(i);
... | [
"expression.operation.binary.remove"
] | 872,425 | 872,426 | u327750344 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define ll long long
ll INF = 10001000100;
int main() {
int n;
cin >> n;
vector<int> v(n);
vector<int> c(n);
rep(i, n) cin >> v[i];
rep(i, n) cin >> c[i];
bitset<20> sum;
int ans = 0;
rep(i, 1 << n) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define ll long long
ll INF = 10001000100;
int main() {
int n;
cin >> n;
vector<int> v(n);
vector<int> c(n);
rep(i, n) cin >> v[i];
rep(i, n) cin >> c[i];
bitset<20> sum;
int ans = 0;
rep(i, n) {
i... | [
"expression.operation.binary.remove"
] | 872,427 | 872,428 | u769530239 | cpp |
p03060 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
int tmp_x = 0;
int tmp_y = 0;
int result;
cin >> n;
vector<int> v(n);
vector<int> c(n);
int tmp = 0;
int i = 0;
while (cin >> tmp) {
v[i] = tmp;
i++;
if (i >= n) {
break;
}
}
while (cin >> ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
int tmp_x = 0;
int tmp_y = 0;
int result;
cin >> n;
vector<int> v(n);
vector<int> c(n);
int tmp = 0;
int i = 0;
while (cin >> tmp) {
v[i] = tmp;
i++;
if (i >= n) {
break;
}
}
i = 0;
whil... | [
"assignment.add"
] | 872,431 | 872,432 | u437095746 | cpp |
p03060 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <regex>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
using dd = long double;
const ll MOD = 1e9 + 7;
ll gcd(ll a, ll b) {
if (... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <regex>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
using dd = long double;
const ll MOD = 1e9 + 7;
ll gcd(ll a, ll b) {
if (... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 872,433 | 872,434 | u789199225 | cpp |
p03060 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <regex>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
using dd = long double;
const ll MOD = 1e9 + 7;
ll gcd(ll a, ll b) {
if (... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <regex>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
using dd = long double;
const ll MOD = 1e9 + 7;
ll gcd(ll a, ll b) {
if (... | [
"variable_declaration.name.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 872,435 | 872,434 | u789199225 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const long long INF = 1LL << 58;
// aを常に小さい値にする 大きい値にする
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> void chmax(T &a, T b... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const long long INF = 1LL << 58;
// aを常に小さい値にする 大きい値にする
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> void chmax(T &a, T b... | [
"control_flow.branch.if.condition.change"
] | 872,442 | 872,443 | u067267880 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const double PI = 3.14159265358979;
const ll INF = pow(10, 18);
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
string abc ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const double PI = 3.14159265358979;
const ll INF = pow(10, 18);
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
string abc ... | [] | 872,450 | 872,451 | u328811800 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, X = 0, Y = 0;
cin >> n;
vector<int> x(n);
vector<int> y(n);
rep(i, n) cin >> x.at(i);
rep(i, n) cin >> y.at(i);
rep(i, n) {
if (x.at(i) > y.at(i)) {
X += x.at(i);
Y += y.at(i);
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, X = 0, Y = 0;
cin >> n;
vector<int> x(n);
vector<int> y(n);
rep(i, n) cin >> x.at(i);
rep(i, n) cin >> y.at(i);
rep(i, n) {
if (x.at(i) > y.at(i)) {
X += x.at(i);
Y += y.at(i);
... | [
"expression.operation.binary.remove"
] | 872,452 | 872,453 | u893297141 | cpp |
p03060 | #include <iostream>
using namespace std;
int v[21];
int c[21];
int main() {
int n, i, j, value = 0;
cin >> n;
for (i = 0; i < n; i++)
cin >> v[i];
for (i = 0; i < n; i++)
cin >> c[i];
for (i = 0; i < n; i++) {
if (v[i] > c[i])
value = v[i] - c[i];
}
cout << value;
}
| #include <iostream>
using namespace std;
int v[21];
int c[21];
int main() {
int n, i, j, value = 0;
cin >> n;
for (i = 0; i < n; i++)
cin >> v[i];
for (i = 0; i < n; i++)
cin >> c[i];
for (i = 0; i < n; i++) {
if (v[i] > c[i])
value = value + (v[i] - c[i]);
}
cout << value;
}
| [
"assignment.change"
] | 872,462 | 872,463 | u746310630 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> V(N);
vector<int> C(N);
for (int i = 0; i < N; i++) {
cin >> V.at(i);
}
for (int i = 0; i < N; i++) {
cin >> C.at(i);
}
int i = 0; // カウンタ変数
int S = 0;
while (i < N) {
if (V[i] - C[i] > 0) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> V(N);
vector<int> C(N);
for (int i = 0; i < N; i++) {
cin >> V.at(i);
}
for (int i = 0; i < N; i++) {
cin >> C.at(i);
}
int i = 0; // カウンタ変数
int S = 0;
while (i < N) {
if (V[i] - C[i] > 0) {
... | [
"assignment.value.change"
] | 872,464 | 872,465 | u016183710 | cpp |
p03060 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> v(n);
vector<int> c(n);
for (int i = 0; i < n; i++)
cin >> v[i];
for (int i = 0; i < n; i++)
cin >> c[i];
int ans = 0;
for (int i = 0; i < n; i++)
ans += max(0, v[i] - c[i]);
cout << ans << endl;
re... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
vector<int> c(n);
for (int i = 0; i < n; i++)
cin >> v[i];
for (int i = 0; i < n; i++)
cin >> c[i];
int ans = 0;
for (int i = 0; i < n; i++)
ans += max(0, v[i] - c[i]);
cout << ans <... | [] | 872,469 | 872,470 | u411418267 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina... | [
"call.add"
] | 872,475 | 872,476 | u917049698 | cpp |
p03060 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define __ \
{ ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define __ \
{ ... | [] | 872,477 | 872,478 | u724012411 | cpp |
p03060 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a, b;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
int ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] > b[i])
ans += a[i] - b[i];
}
cout << ans;
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n);
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
int ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] > b[i])
ans += a[i] - b[i];
}
cout <<... | [] | 872,479 | 872,480 | u724012411 | cpp |
p03060 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, ans = 0;
cin >> n;
vector<int... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, ans = 0;
cin >> n;
vector<int... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 872,481 | 872,482 | u388372553 | cpp |
p03060 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 1 << 30;
const int MOD = (int)1e9 + 7;
const int MAX_N = (int)1e5 + 5... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 1 << 30;
const int MOD = (int)1e9 + 7;
const int MAX_N = (int)1e5 + 5... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 872,483 | 872,484 | u952094438 | cpp |
p03060 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, ans = 0;
cin >> N;
vector<int> kachi(N);
vector<int> cost(N);
for (int i = 0; i < N; i++) {
cin >> kachi.at(i);
}
for (int i = 0; i < N; i++) {
cin >> cost.at(i);
}
for (int i = 0; i < N; i++) {
if (k... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, ans = 0;
cin >> N;
vector<int> kachi(N);
vector<int> cost(N);
for (int i = 0; i < N; i++) {
cin >> kachi.at(i);
}
for (int i = 0; i < N; i++) {
cin >> cost.at(i);
}
for (int i = 0; i < N; i++) {
if (k... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 872,485 | 872,486 | u138273120 | cpp |
p03060 | #include <iostream>
using namespace std;
void func() {
int N;
int values[N], cost[N];
;
for (int i = 0; i < N; ++i) {
cin >> values[i];
}
for (int i = 0; i < N; ++i) {
cin >> cost[i];
}
int ans = 0;
for (int i = 0; i < N; ++i) {
if (values[i] > cost[i]) {
ans += values[i] - cost[i];... | #include <iostream>
using namespace std;
void func() {
int N;
cin >> N;
int values[N], cost[N];
for (int i = 0; i < N; ++i) {
cin >> values[i];
}
for (int i = 0; i < N; ++i) {
cin >> cost[i];
}
int ans = 0;
for (int i = 0; i < N; ++i) {
if (values[i] > cost[i]) {
ans += values[i] - ... | [] | 872,487 | 872,488 | u152122148 | cpp |
p03060 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define print(n) std::cout << n << std::endl
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
vector<int> c(n);
rep(i, n) cin >> v[i];
rep(i, n) cin >> c[i];
int sum = 0;
for (int i = 0; i < n; ++i) {
if (... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define print(n) std::cout << n << std::endl
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
vector<int> c(n);
rep(i, n) cin >> v[i];
rep(i, n) cin >> c[i];
int sum = 0;
for (int i = 0; i < n; ++i) {
if (... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 872,489 | 872,490 | u999788719 | cpp |
p03060 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {... | [
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 872,497 | 872,498 | u151236434 | cpp |
p03060 | #include <bits/stdc++.h>
#define ll long long int
#define ff first
#define ss second
#define eps 1e-9
using namespace std;
int main() {
ll t, n, m, f, a, b, c, l, r, q, k, x, y, z, ans, mn, mx, sum = 0;
cin >> n;
vector<pair<ll, ll>> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i].ff;
}
for (... | #include <bits/stdc++.h>
#define ll long long int
#define ff first
#define ss second
#define eps 1e-9
using namespace std;
int main() {
ll t, n, m, f, a, b, c, l, r, q, k, x, y, z, ans, mn, mx, sum = 0;
cin >> n;
vector<pair<ll, ll>> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i].ff;
}
for (... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 872,501 | 872,502 | u089230684 | cpp |
p03060 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <string>
#include <vector>
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <string>
#include <vector>
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | [] | 872,503 | 872,504 | u319329587 | cpp |
p03060 |
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0); ... |
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0); ... | [
"variable_declaration.type.change"
] | 872,507 | 872,508 | u126859973 | cpp |
p03060 |
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0); ... |
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0); ... | [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 872,509 | 872,508 | u126859973 | cpp |
p03060 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> V(N);
vector<int> C(N);
int ans = 0;
for (int i = 0; i < N; i++) {
cin >> V[i];
}
for (int i = 0; i < N; i++) {
cin >> C[i];
}
vector<int> sa(N);
for (int i = 0; i < N; i++) {
... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> V(N);
vector<int> C(N);
int ans = 0;
for (int i = 0; i < N; i++) {
cin >> V[i];
}
for (int i = 0; i < N; i++) {
cin >> C[i];
}
vector<int> sa(N);
for (int i = 0; i < N; i++) {
... | [] | 872,516 | 872,517 | u350046688 | cpp |
p03060 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
std::cin >> N;
std::vector<int> V;
std::vector<int> C;
int ref;
for (int i = 0; i < N; i++) {
std::cin >> ref;
V.push_back(ref);
}
for (int i = 0; i < N; i++) {
std::cin >> ref;
C.push_b... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
std::cin >> N;
std::vector<int> V;
std::vector<int> C;
int ref;
for (int i = 0; i < N; i++) {
std::cin >> ref;
V.push_back(ref);
}
for (int i = 0; i < N; i++) {
std::cin >> ref;
C.push_b... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 872,520 | 872,521 | u187013893 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
int ans, v[21], c, n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> v[i];
for (int i = 0; i < n; i++) {
cin >> c;
ans += max(0, v[i] - c);
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
int ans = 0, v[21], c, n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> v[i];
for (int i = 0; i < n; i++) {
cin >> c;
ans += max(0, v[i] - c);
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.value.change"
] | 872,525 | 872,526 | u163700211 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(v) v.begin(), v.end()
int main() {
ll N;
cin >> N;
vector<vector<ll>> vec(2, vector<ll>(N));
for (ll i = 0; i < N; i++) {
for (ll j = 0; j < N; j++) {
cin >> vec[i][j];
}
}
ll ans = 0;
for (ll i = 0; i < N; i+... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(v) v.begin(), v.end()
int main() {
ll N;
cin >> N;
vector<vector<ll>> vec(2, vector<ll>(N));
for (ll i = 0; i < 2; i++) {
for (ll j = 0; j < N; j++) {
cin >> vec[i][j];
}
}
ll ans = 0;
for (ll i = 0; i < N; i+... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 872,530 | 872,531 | u072293789 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N = 0;
cin >> N;
vector<int> V(N);
for (int i = 0; i < N; i++) {
cin >> V.at(i);
}
vector<int> C(N);
for (int i = 0; i < N; i++) {
cin >> C.at(i);
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (V.at(i) > C.at(i)) {
an... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N = 0;
cin >> N;
vector<int> V(N);
for (int i = 0; i < N; i++) {
cin >> V.at(i);
}
vector<int> C(N);
for (int i = 0; i < N; i++) {
cin >> C.at(i);
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (V.at(i) > C.at(i)) {
an... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 872,532 | 872,533 | u856957535 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> V(n);
for (int i = 0; i < n; i++) {
cin >> V.at(i);
}
vector<int> C(n);
for (int i = 0; i < n; i++) {
cin >> C.at(i);
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (V.at(i) > C.at(i)) {
ans = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> V(n);
for (int i = 0; i < n; i++) {
cin >> V.at(i);
}
vector<int> C(n);
for (int i = 0; i < n; i++) {
cin >> C.at(i);
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (V.at(i) > C.at(i)) {
ans +=... | [
"assignment.value.change"
] | 872,534 | 872,535 | u856957535 | cpp |
p03060 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
#define INF 10010010010
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long lon... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
#define INF 10010010010
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long lon... | [
"assignment.value.change"
] | 872,538 | 872,539 | u971166345 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define ALL(x) (x).begin(), (x).end()
const int IINF = 1e9;
const LL LINF = 1e18;
const LL mod = 1e9 + 7;
int main() {
int N;
vector<int> v... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define ALL(x) (x).begin(), (x).end()
const int IINF = 1e9;
const LL LINF = 1e18;
const LL mod = 1e9 + 7;
int main() {
int N;
cin >> N;
v... | [] | 872,540 | 872,541 | u697421413 | cpp |
p03060 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vn;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
vn.push_back(a);
}
vector<int> vc;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
vc.push_... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vn;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
vn.push_back(a);
}
vector<int> vc;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
vc.push_... | [
"control_flow.loop.condition.change"
] | 872,544 | 872,545 | u798665594 | cpp |
p03060 | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
vector<int> c(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
for (int i = 0; i < n; i++) {
cin >> c[i];
}
int gain = 0;
for (int i = 0; i < n; i++) {
i... | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
vector<int> c(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
for (int i = 0; i < n; i++) {
cin >> c[i];
}
int gain = 0;
for (int i = 0; i < n; i++) {
i... | [
"assignment.change"
] | 872,548 | 872,549 | u904995051 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
vector<int> v(n), c(n), d(n);
for (int i = 0; i < n; ++i) {
cin >> c[i];
}
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
for (int i = 0; i < n; ++i) {
d[i] = v[i] - c[i];
}
for (int i = 0; i < n; ++i) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
vector<int> v(n), c(n), d(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
for (int i = 0; i < n; ++i) {
cin >> c[i];
}
for (int i = 0; i < n; ++i) {
d[i] = v[i] - c[i];
}
for (int i = 0; i < n; ++i) {
... | [
"identifier.change",
"expression.operation.binary.change"
] | 872,550 | 872,551 | u060965067 | cpp |
p03060 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int a[N], b[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
cin >> b[i];
}
int sum = 0;
for (int i = 0; i < N; i++) {
if (a[i] > b[i])
sum = sum + a[i] > b[i];
}
cout << sum <<... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int a[N], b[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
cin >> b[i];
}
int sum = 0;
for (int i = 0; i < N; i++) {
if (a[i] > b[i])
sum = sum + a[i] - b[i];
}
cout << sum <<... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 872,557 | 872,558 | u984200859 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ans = 0, i;
cin >> N;
vector<int> v(N);
vector<int> c(N);
for (i = 0; i < N; i++) {
cin >> v.at(i);
}
for (i = 0; i < N; i++) {
cin >> c.at(i);
}
for (i = 0; i < N; i++) {
if (v.at(i) - c.at(i)) {
ans += v.at(i) - c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ans = 0, i;
cin >> N;
vector<int> v(N);
vector<int> c(N);
for (i = 0; i < N; i++) {
cin >> v.at(i);
}
for (i = 0; i < N; i++) {
cin >> c.at(i);
}
for (i = 0; i < N; i++) {
if (v.at(i) > c.at(i)) {
ans += v.at(i) - c... | [
"control_flow.branch.if.condition.change"
] | 872,559 | 872,560 | u979163294 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, s, i, v[20], c[20];
cin >> n;
for (i = 0; i < n; i++) {
cin >> v[i];
}
for (i = 0; i < n; i++) {
cin >> c[i];
if (v[i] > c[i])
s += v[i] - c[i];
}
cout << s;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, s = 0, i, v[20], c[20];
cin >> n;
for (i = 0; i < n; i++) {
cin >> v[i];
}
for (i = 0; i < n; i++) {
cin >> c[i];
if (v[i] > c[i])
s += v[i] - c[i];
}
cout << s;
} | [
"variable_declaration.value.change"
] | 872,565 | 872,566 | u206772137 | cpp |
p03060 | #include <algorithm>
#include <functional>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n);
for (int i = 0; i < n; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
int sum = 0;
for (int i = 0; i < ... | #include <algorithm>
#include <functional>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n);
for (int i = 0; i < n; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
int sum = 0;
for (int i = 0; i < ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 872,569 | 872,570 | u465760322 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N;
vector<int> A(N);
vector<int> B(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
if (A.at(i) > B.at(i)) {
X = A.at(i) - B.a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N;
vector<int> A(N);
vector<int> B(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
X = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) > B.at(i)) {
X = X + ... | [
"assignment.add",
"assignment.change"
] | 872,571 | 872,572 | u697858600 | cpp |
p03060 | #include <algorithm>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main() {
int n;
int i;
vector<int> v(21);
vector<int> c(21);
rep(i, n) { cin >> v[i]; }
r... | #include <algorithm>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main() {
int n;
int i;
vector<int> v(21);
vector<int> c(21);
cin >> n;
rep(i, n) { cin >>... | [] | 872,576 | 872,577 | u924770834 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
int main() {
int n, x, y;
cin >> n;
vector<int> v(n);
vector<int> c(n);
rep(i, n) { cin >> v[i]; }
rep(i, n) { cin >> c[i]; }
rep(i, n) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
int main() {
int n;
int x = 0, y = 0;
cin >> n;
vector<int> v(n);
vector<int> c(n);
rep(i, n) { cin >> v[i]; }
rep(i, n) { cin >> c[i]; }
re... | [
"variable_declaration.value.change"
] | 872,586 | 872,587 | u902803949 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int x[n];
int y[n];
int i;
for (i = 0; i < n; i++) {
cin >> x[i];
}
for (i = 0; i < n; i++) {
cin >> y[i];
}
int z = 0;
for (i = 0; i < n; i++) {
if (x[i] - y[i] > 0)
z += x[i] + y[i];
}
cout << z;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int x[n];
int y[n];
int i;
for (i = 0; i < n; i++) {
cin >> x[i];
}
for (i = 0; i < n; i++) {
cin >> y[i];
}
int z = 0;
for (i = 0; i < n; i++) {
if (x[i] - y[i] > 0)
z += x[i] - y[i];
}
cout << z;
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 872,588 | 872,589 | u621527413 | cpp |
p03060 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> v(n), c(n);
for (auto &i : v) {
cin >> i;
}
for (auto &i : c) {
cin >> i;
}
int ret = 0;
for (int i = 0; i < n; ++i) {
int diff = v[i] - c[i];
if (0 < diff) {
ret += diff;
}
}
cou... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n), c(n);
for (auto &i : v) {
cin >> i;
}
for (auto &i : c) {
cin >> i;
}
int ret = 0;
for (int i = 0; i < n; ++i) {
int diff = v[i] - c[i];
if (0 < diff) {
ret += diff;
... | [] | 872,590 | 872,591 | u611571299 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, kotae = 0;
cin >> n;
vector<int> kati(n), cost(n);
for (int i = 0; i < n; i++) {
cin >> kati.at(i);
}
for (int j = 0; j < n; j++) {
cin >> cost.at(j);
}
for (int k = 0; k < n; k++) {
if (kati.at(k) >> cost.at(k)) {
kotae... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, kotae = 0;
cin >> n;
vector<int> kati(n), cost(n);
for (int i = 0; i < n; i++) {
cin >> kati.at(i);
}
for (int j = 0; j < n; j++) {
cin >> cost.at(j);
}
for (int k = 0; k < n; k++) {
if (kati.at(k) > cost.at(k)) {
kotae ... | [
"control_flow.branch.if.condition.change"
] | 872,592 | 872,593 | u448058760 | cpp |
p03060 | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
int C[20];
int i = 0;
while (i < N) {
cin >> C[i];
i++;
}
int V[20];
i = 0;
while (i < N) {
cin >> V[i];
i++;
}
int answer = 0;
i = 0;
while (i < N) {
if (V[i] > C[i]) {
answer = answer + V... | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
int V[20];
int i = 0;
while (i < N) {
cin >> V[i];
i++;
}
int C[20];
i = 0;
while (i < N) {
cin >> C[i];
i++;
}
int answer = 0;
i = 0;
while (i < N) {
if (V[i] > C[i]) {
answer = answer + V... | [
"variable_declaration.remove",
"expression.unary.arithmetic.remove",
"expression.unary.arithmetic.add",
"variable_declaration.add",
"assignment.add"
] | 872,596 | 872,597 | u422592877 | cpp |
p03060 | #include "bits/stdc++.h"
using namespace std;
#define LL long long
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define PB push_back
#define MP make_pair
#define all(x) x.begin(), x.end()
int N, C[20], V[20];
int main() {
cin >> N;
for (int i = 0; i < N; i++)
cin >> V[i];
for (int i = 0; i < N; i++)... | #include "bits/stdc++.h"
using namespace std;
#define LL long long
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define PB push_back
#define MP make_pair
#define all(x) x.begin(), x.end()
int N, C[20], V[20];
int main() {
cin >> N;
for (int i = 0; i < N; i++)
cin >> V[i];
for (int i = 0; i < N; i++)
... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 872,598 | 872,599 | u422592877 | cpp |
p03060 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n), c(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
for (int i = 0; i < n; ++i)
cin >> c[i];
int k = pow(2, n);
int x, y;
int ans = 0;
for (int i = 0; i < k - 1; ++i) {
... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n), c(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
for (int i = 0; i < n; ++i)
cin >> c[i];
int k = pow(2, n);
int x, y;
int ans = 0;
for (int i = 0; i < k; ++i) {
x =... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 872,606 | 872,607 | u886790158 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
a = 0;
b = 0;
cin >> n;
int v[n], c[n];
for (int i = 0; i < n; i++) {
cin >> v[i];
}
for (int i = 0; i < n; i++) {
cin >> c[i];
}
for (int i = 0; i < n; i++) {
if (v[i] > c[i]) {
a += v[i];
b += v[i];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
a = 0;
b = 0;
cin >> n;
int v[n], c[n];
for (int i = 0; i < n; i++) {
cin >> v[i];
}
for (int i = 0; i < n; i++) {
cin >> c[i];
}
for (int i = 0; i < n; i++) {
if (v[i] > c[i]) {
a += v[i];
b += c[i];
... | [
"assignment.value.change",
"identifier.change"
] | 872,618 | 872,619 | u626360077 | cpp |
p03060 | #include <iostream>
#include <string>
using namespace std;
int main() {
int V[20];
int C[20];
int x = 0;
cin >> x;
for (int i = 0; i < x; i++) {
cin >> V[i];
}
for (int i = 0; i < x; i++) {
cin >> C[i];
}
int GO = 0;
for (int i = 0; i < x; i++) {
if (V[i] > C[i]) {
GO = V[i] - C[i... | #include <iostream>
#include <string>
using namespace std;
int main() {
int V[20];
int C[20];
int x = 0;
cin >> x;
for (int i = 0; i < x; i++) {
cin >> V[i];
}
for (int i = 0; i < x; i++) {
cin >> C[i];
}
int GO = 0;
for (int i = 0; i < x; i++) {
if (V[i] > C[i]) {
GO += V[i] - C[... | [
"assignment.value.change"
] | 872,622 | 872,623 | u743473047 | cpp |
p03060 | #include <iostream>
#include <vector>
//#include <fstream>
using namespace std;
int main(int argc, const char *argv[]) {
// ifstream in("input.txt");
// cin.rdbuf(in.rdbuf());
int N;
cin >> N;
int max = 0;
vector<int> V, C;
for (int i = 0; i < N; i++) {
cin >> V[i];
}
for (int i = 0; i <... | #include <iostream>
#include <vector>
//#include <fstream>
using namespace std;
int main(int argc, const char *argv[]) {
// ifstream in("input.txt");
// cin.rdbuf(in.rdbuf());
int N;
cin >> N;
int max = 0;
vector<int> V(N), C(N);
for (int i = 0; i < N; i++) {
cin >> V[i];
}
for (int i = ... | [] | 872,624 | 872,625 | u848433916 | cpp |
p03060 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> cost(n);
vector<int> value(n);
for (int i = 0; i < n; i++)
cin >> cost[i];
for (int i = 0; i < n; i++)
cin >> value[i];
int sum = 0;
int diff;
for (int i = 0; i < n; i++) {
diff = value[i... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> cost(n);
vector<int> value(n);
for (int i = 0; i < n; i++)
cin >> value[i];
for (int i = 0; i < n; i++)
cin >> cost[i];
int sum = 0;
int diff;
for (int i = 0; i < n; i++) {
diff = value[i... | [
"identifier.change",
"expression.operation.binary.change"
] | 872,628 | 872,629 | u683667335 | cpp |
p03060 | #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> cost(n);
vector<int> value(n);
rep(i, n) cin >> cost[i];
rep(i, n) cin >> value[i];
int ans = 0;
rep(i, n) {
if (cost[i] < value[i]) {
ans += valu... | #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> value(n);
vector<int> cost(n);
rep(i, n) cin >> value[i];
rep(i, n) cin >> cost[i];
int ans = 0;
rep(i, n) {
if (cost[i] < value[i]) {
ans += valu... | [
"variable_declaration.remove",
"variable_declaration.add",
"call.arguments.change",
"expression.operation.binary.remove"
] | 872,630 | 872,631 | u953753178 | cpp |
p03060 | #include <iostream>
using namespace std;
#define ll long long
int main() {
ll N, i;
cin >> N;
ll V[N], C[N];
for (i = 0; i < N; i++) {
cin >> V[i];
}
for (i = 0; i < N; i++) {
cin >> C[i];
}
ll ans = 0;
for (i = 0; i < N; i++) {
ans += max(ans, ans + V[i] - C[i]);
}
cout << ans;
retu... | #include <iostream>
using namespace std;
#define ll long long
int main() {
ll N, i;
cin >> N;
ll V[N], C[N];
for (i = 0; i < N; i++) {
cin >> V[i];
}
for (i = 0; i < N; i++) {
cin >> C[i];
}
ll ans = 0;
for (i = 0; i < N; i++) {
ans = max(ans, ans + V[i] - C[i]);
}
cout << ans;
retur... | [
"assignment.value.change"
] | 872,636 | 872,637 | u770161743 | cpp |
p03060 | #include <iostream>
using namespace std;
#define ll long long
int main() {
ll N, i;
cin >> N;
ll V[N], C[N];
for (i = 0; i < N; i++) {
cin >> V[N];
}
for (i = 0; i < N; i++) {
cin >> C[N];
}
ll ans = 0;
for (i = 0; i < N; i++) {
ans = max(ans, ans + V[i] - C[i]);
}
cout << ans;
retur... | #include <iostream>
using namespace std;
#define ll long long
int main() {
ll N, i;
cin >> N;
ll V[N], C[N];
for (i = 0; i < N; i++) {
cin >> V[i];
}
for (i = 0; i < N; i++) {
cin >> C[i];
}
ll ans = 0;
for (i = 0; i < N; i++) {
ans = max(ans, ans + V[i] - C[i]);
}
cout << ans;
retur... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 872,638 | 872,637 | u770161743 | cpp |
p03060 | #include <iostream>
#include <string>
using namespace std;
int main() {
int v[20];
int c[20];
int n;
int sum1 = 0;
int x;
cin >> n;
for (int i = 0; i < n; i++)
cin >> v[i];
for (int i = 0; i < n; i++)
cin >> c[i];
for (int i = 0; i < n; i++) {
if (v[i] >= c[i])
x = v[i] - c[i];
s... | #include <iostream>
#include <string>
using namespace std;
int main() {
int v[20];
int c[20];
int n;
int sum1 = 0;
int x;
cin >> n;
for (int i = 0; i < n; i++)
cin >> v[i];
for (int i = 0; i < n; i++)
cin >> c[i];
for (int i = 0; i < n; i++) {
if (v[i] >= c[i]) {
x = v[i] - c[i];
... | [] | 872,639 | 872,640 | u060012684 | cpp |
p03060 | #include <stdio.h>
int main(void) {
int n;
int V[21];
int C[21];
int ans = 0;
scanf("%d", &n);
for (int i = 0; i > n; i++) {
scanf("%d", &V[i]);
}
for (int i = 0; i < n; i++) {
scanf("%d", &C[i]);
if (V[i] > C[i]) {
ans += V[i] - C[i];
}
}
printf("%d", ans);
return 0;
} | #include <stdio.h>
int main(void) {
int n;
int V[21];
int C[21];
int ans = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &V[i]);
}
for (int i = 0; i < n; i++) {
scanf("%d", &C[i]);
if (V[i] > C[i])
ans += V[i] - C[i];
}
printf("%d", ans);
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 872,643 | 872,644 | u195269284 | cpp |
p03060 | #include <algorithm>
#include <cmath> //切り上げceil()
#include <deque>
#include <iomanip> //setprecision()
#include <iostream>
#include <list>
#include <map>
#include <numeric> //xとyの最大公約数は__gcd(x,y),xとyの最小公倍数は(x*y)/__gcd
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <bits/... | #include <algorithm>
#include <cmath> //切り上げceil()
#include <deque>
#include <iomanip> //setprecision()
#include <iostream>
#include <list>
#include <map>
#include <numeric> //xとyの最大公約数は__gcd(x,y),xとyの最小公倍数は(x*y)/__gcd
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <bits/... | [] | 872,657 | 872,658 | u667375816 | cpp |
p03060 | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
int main(int argc, char *argv[]) {
int N;
std::cin >> N;
std::vector<int> X(N);
int V;
for (auto &x : X) {
std::cin >> V;
x = V;
}
int C;
for (auto &x : X) {
std::cin >> C;
x -= C;
}
std::sort(X.beg... | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
int main(int argc, char *argv[]) {
int N;
std::cin >> N;
std::vector<int> X(N);
int V;
for (auto &x : X) {
std::cin >> V;
x = V;
}
int C;
for (auto &x : X) {
std::cin >> C;
x -= C;
}
std::sort(X.beg... | [
"variable_declaration.value.change"
] | 872,662 | 872,663 | u436832975 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n;
vector<int> arr(n, 0);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
for (int i = 0; i < n; i++) {
cin >> x;
arr[i] -= x;
}
sort(arr.begin(), arr.end(), greater<int>());
int sum = 0;
for (int i = 0; i < n; i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n;
vector<int> arr(n, 0);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
for (int i = 0; i < n; i++) {
cin >> x;
arr[i] -= x;
}
sort(arr.begin(), arr.end(), greater<int>());
int sum = 0;
for (int i = 0; i < n; i... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 872,668 | 872,669 | u859421710 | cpp |
p03060 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> V(n);
rep(i, n) { cin >> V[i]; }
vector<int> C(n);
rep(i, n) { cin >> C[i]; }
int ans = 0;
rep(i, n) {
if (V[i] >> C[i]) {
ans += V[i] - C[i];
}
}
cout... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> V(n);
rep(i, n) { cin >> V[i]; }
vector<int> C(n);
rep(i, n) { cin >> C[i]; }
int ans = 0;
rep(i, n) {
if (V[i] > C[i]) {
ans += V[i] - C[i];
}
}
cout ... | [
"control_flow.branch.if.condition.change"
] | 872,670 | 872,671 | u631558039 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n), c(n), a(n);
for (int i = 0; i < n; i++) {
cin >> v.at(i);
}
for (int i = 0; i < n; i++) {
cin >> c.at(i);
}
for (int i = 0; i < n; i++) {
a.at(i) == v.at(i) - c.at(i);
}
int sum = 0;
for... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n), c(n), a(n);
for (int i = 0; i < n; i++) {
cin >> v.at(i);
}
for (int i = 0; i < n; i++) {
cin >> c.at(i);
}
for (int i = 0; i < n; i++) {
a.at(i) = v.at(i) - c.at(i);
}
int sum = 0;
for ... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 872,677 | 872,678 | u522993719 | cpp |
p03060 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <stdexcept>
#include <string>
using namespace std;
int main() {
char t[4];
long long int a, b[120], c = 0, d[120], e[120];
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b[i];
}
for (int i = 0; i < a; i++) {
cin >> d[i];
e[i] = ... |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <stdexcept>
#include <string>
using namespace std;
int main() {
char t[4];
long long int a, b[120], c = 0, d[120], e[120];
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b[i];
}
for (int i = 0; i < a; i++) {
cin >> d[i];
e[i] = ... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 872,681 | 872,682 | u768204022 | cpp |
p03060 | #include <iostream>
using namespace std;
int main() {
// get integers
int i;
int N;
cin >> N;
int V[N], C[N];
for (i = 0; i <= N - 1; i++) {
cin >> V[i];
}
for (i = 0; i <= N - 1; i++) {
cin >> C[i];
}
// Compute
int Ans = 0;
for (i = 1; i <= N; i++) {
if ((V[i] - C[i]) > 0) {
... | #include <iostream>
using namespace std;
int main() {
// get integers
int i;
int N;
cin >> N;
int V[N], C[N];
for (i = 0; i <= N - 1; i++) {
cin >> V[i];
}
for (i = 0; i <= N - 1; i++) {
cin >> C[i];
}
// Compute
int Ans = 0;
for (i = 0; i <= N - 1; i++) {
if ((V[i] - C[i]) > 0) {
... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 872,695 | 872,696 | u801654910 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
int a[100];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (x > a[i])
ans += (x - a[i]);
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int a[100];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (x < a[i])
ans += (a[i] - x);
}
cout << ans;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove",
"assignment.change"
] | 872,697 | 872,698 | u576216182 | cpp |
p03060 | //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#... | //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#... | [
"identifier.change",
"call.function.change",
"call.arguments.change",
"call.arguments.add"
] | 872,707 | 872,708 | u057611820 | cpp |
p03060 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define For(i, m, n) for (ll i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
typedef long double ld;
using namespace std;
struct Fast {
Fast() {
std::cin.tie(0);
... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define For(i, m, n) for (ll i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
typedef long double ld;
using namespace std;
struct Fast {
Fast() {
std::cin.tie(0);
... | [] | 872,716 | 872,717 | u050445028 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ans = 0;
cin >> N;
vector<int> V(N), C(N), dif(N);
for (int i = 0; i < N; i++) {
cin >> V.at(i);
}
for (int i = 0; i < N; i++) {
cin >> C.at(i);
dif.at(i) = V.at(i) - C.at(i);
if (dif.at(i) > 0)
ans = +dif.at(i);
els... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ans = 0;
cin >> N;
vector<int> V(N), C(N), dif(N);
for (int i = 0; i < N; i++) {
cin >> V.at(i);
}
for (int i = 0; i < N; i++) {
cin >> C.at(i);
dif.at(i) = V.at(i) - C.at(i);
if (dif.at(i) > 0)
ans += dif.at(i);
els... | [
"assignment.value.change",
"expression.operation.unary.arithmetic.remove"
] | 872,718 | 872,719 | u050045886 | cpp |
p03060 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int V[N], C[N];
for (int i = 0; i < N; i++)
cin >> V[i];
for (int i = 0; i < N; i++)
cin >> C[i];
int ans = 0;
int add = 0;
for (int i = 0; i < N; i++) {
add = V[i] - C[i];
if (add > 0)
ans += add;
}
cou... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int V[N], C[N];
for (int i = 0; i < N; i++)
cin >> V[i];
for (int i = 0; i < N; i++)
cin >> C[i];
int ans = 0;
int add = 0;
for (int i = 0; i < N; i++) {
add = V[i] - C[i];
if (add > 0)
ans += add;
}
cou... | [
"identifier.change",
"io.output.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 872,746 | 872,747 | u344977358 | cpp |
p03060 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int V[N], C[N];
for (int i = 0; i < N; i++)
cin >> V[i];
for (int i = 0; i < N; i++)
cin >> C[i];
int ans = 0;
int add = 0;
for (int i = 0; i < N; i++) {
add = V[i] - C[i];
if (add > 0)
ans += add;
}
cou... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int V[N], C[N];
for (int i = 0; i < N; i++)
cin >> V[i];
for (int i = 0; i < N; i++)
cin >> C[i];
int ans = 0;
int add = 0;
for (int i = 0; i < N; i++) {
add = V[i] - C[i];
if (add > 0)
ans += add;
}
cou... | [
"identifier.change",
"io.output.change"
] | 872,748 | 872,747 | u344977358 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
#define C continue;
#define D double
#define ll long long
#define ld long double
#define ull unsigned long long
#define pb push_back
#define vi vector<int>
#define vs vector<string>
#define vb vector<bool>
#define vd vector<D>
#define vll vector<ll>
#define vull vector<ul... | #include <bits/stdc++.h>
using namespace std;
#define C continue;
#define D double
#define ll long long
#define ld long double
#define ull unsigned long long
#define pb push_back
#define vi vector<int>
#define vs vector<string>
#define vb vector<bool>
#define vd vector<D>
#define vll vector<ll>
#define vull vector<ul... | [] | 872,753 | 872,754 | u389438219 | cpp |
p03060 | #include <iostream>
using namespace std;
int main() {
int n, i, sum;
cin >> n;
int v[n], c[n];
for (i = 0; i < n; i++)
cin >> v[i];
for (i = 0; i < n; i++)
cin >> c[i];
for (i = 0; i < n; i++) {
v[i] -= c[i];
sum += max(0, v[i]);
}
cout << sum << endl;
}
| #include <iostream>
using namespace std;
int main() {
int n, i, sum = 0;
cin >> n;
int v[n], c[n];
for (i = 0; i < n; i++)
cin >> v[i];
for (i = 0; i < n; i++)
cin >> c[i];
for (i = 0; i < n; i++) {
v[i] -= c[i];
sum += max(0, v[i]);
}
cout << sum << endl;
}
| [
"variable_declaration.value.change"
] | 872,759 | 872,760 | u103505524 | cpp |
p03060 | #include <iostream>
using namespace std;
int main() {
int a, b[20], c[20];
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b[i];
}
for (int i = 0; i < a; i++) {
cin >> c[i];
}
a = 0;
for (int i = 0; i < a; i++) {
if (b[i] > c[i]) {
a += b[i] - c[i];
}
}
cout << a << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b[20], c[20], ans;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b[i];
}
for (int i = 0; i < a; i++) {
cin >> c[i];
}
ans = 0;
for (int i = 0; i < a; i++) {
if (b[i] > c[i]) {
ans += b[i] - c[i];
}
}
cout << ans <<... | [
"variable_declaration.add",
"assignment.variable.change",
"identifier.change",
"io.output.change"
] | 872,761 | 872,762 | u382826454 | cpp |
p03060 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int *a = new int[n];
int *b = new int[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int x;
for (int i = 0; i < n; i++) {
// cout << a[i] << endl;
// cout << b[i] <... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int *a = new int[n];
int *b = new int[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int x = 0;
for (int i = 0; i < n; i++) {
if (a[i] > b[i]) {
x += a[i] - b[i];... | [
"variable_declaration.value.change"
] | 872,763 | 872,764 | u130834452 | cpp |
p03060 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int *a = new int[n];
int *b = new int[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int x;
for (int i = 0; i < n; i++) {
if (a[i] > b[i]) {
x += a[i] - b[i];
... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int *a = new int[n];
int *b = new int[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int x = 0;
for (int i = 0; i < n; i++) {
if (a[i] > b[i]) {
x += a[i] - b[i];... | [
"variable_declaration.value.change"
] | 872,765 | 872,764 | u130834452 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int sum = 0;
vector<int> v, c;
for (int i = 0; i < n; i++) {
cin >> v[i];
}
for (int i = 0; i < n; i++) {
cin >> c[i];
}
for (int i = 0; i < n; i++) {
if (v[i] - c[i] > 0) {
sum += v[i] - c[i];
}
}
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int sum = 0;
vector<int> v(n), c(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
for (int i = 0; i < n; i++) {
cin >> c[i];
}
for (int i = 0; i < n; i++) {
if (v[i] - c[i] > 0) {
sum += v[i] - c[i];
}
... | [] | 872,768 | 872,769 | u422506696 | cpp |
p03060 | #include <iostream>
using namespace std;
int main() {
int n, c[25], v[25], ans;
cin >> n;
for (int i = 0; i < n; i++)
cin >> v[i];
for (int i = 0; i < n; i++) {
cin >> c[i];
if (v[i] - c[i] > 0)
ans += v[i] - c[i];
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, c[25], v[25], ans = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> v[i];
for (int i = 0; i < n; i++) {
cin >> c[i];
if (v[i] - c[i] > 0)
ans += v[i] - c[i];
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.value.change"
] | 872,770 | 872,771 | u830055383 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
int C[N];
int V[N];
for (int i = 0; i < N; i++) {
cin >> V[i];
}
for (int i = 0; i < N; i++) {
cin >> C[i];
}
int max = 0;
for (int i = 0; i < N; i++) {
if (V[i] > C[i])
max = V[i]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
int C[N];
int V[N];
for (int i = 0; i < N; i++) {
cin >> V[i];
}
for (int i = 0; i < N; i++) {
cin >> C[i];
}
int max = 0;
for (int i = 0; i < N; i++) {
if (V[i] > C[i])
max += V[i... | [
"assignment.value.change"
] | 872,782 | 872,783 | u792423109 | cpp |
p03060 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
#define X first
#define Y second
#define vsort(v) sort(v.begin(), v.end())
#define vrev(v) reverse(v.begin(), v.end())
#d... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
#define X first
#define Y second
#define vsort(v) sort(v.begin(), v.end())
#define vrev(v) reverse(v.begin(), v.end())
#d... | [] | 872,785 | 872,786 | u493080913 | cpp |
p03060 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int V[100] = {};
for (int i = 0; i < N; i++) {
cin >> V[i];
}
int C[100] = {};
int i = 0;
for (i = 0; i < N; i++) {
cin >> C[i];
}
int cp[50];
for (int i = 0; i < N; i++) {
cp[i] = V[i] - C[... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int V[100] = {};
for (int i = 0; i < N; i++) {
cin >> V[i];
}
int C[100] = {};
int i = 0;
for (i = 0; i <= N; i++) {
cin >> C[i];
}
int cp[50];
for (int i = 0; i <= N; i++) {
cp[i] = V[i] - ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 872,797 | 872,798 | u451206510 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, c[20], v[20];
for (int i = 0; i < n; i++)
cin >> c[i];
for (int i = 0; i < n; i++)
cin >> v[i];
for (int i = 0; i < n; i++)
c[i] = c[i] - v[i];
v[0] = 0;
for (int i = 0; i < n; i++)
if (c[i] > 0)
v[0] += c[i];
cout <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, c[20], v[20];
cin >> n;
for (int i = 0; i < n; i++)
cin >> c[i];
for (int i = 0; i < n; i++)
cin >> v[i];
for (int i = 0; i < n; i++)
c[i] = c[i] - v[i];
v[0] = 0;
for (int i = 0; i < n; i++)
if (c[i] > 0)
v[0] += c[... | [] | 872,799 | 872,800 | u785442356 | cpp |
p03060 | #include <stdio.h>
int main() {
int N;
int Cost[20], Value[20];
int diff;
int max = 0;
int i;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &Value[i]);
}
for (i = 0; i < N; i++) {
scanf("%d", &Value[i]);
}
for (i = 0; i < N; i++) {
diff = Value[i] - Cost[i];
if (diff ... | #include <stdio.h>
int main() {
int N;
int Cost[20], Value[20];
int diff;
int max = 0;
int i;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &Value[i]);
}
for (i = 0; i < N; i++) {
scanf("%d", &Cost[i]);
}
for (i = 0; i < N; i++) {
diff = Value[i] - Cost[i];
if (diff >... | [
"identifier.change",
"call.arguments.change"
] | 872,803 | 872,804 | u355520191 | cpp |
p03060 | #include <stdio.h>
int main() {
int N;
int Cost[20], Value[20];
int diff;
int max = 0;
int i;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &Cost[i]);
}
for (i = 0; i < N; i++) {
scanf("%d", &Value[20]);
}
for (i = 0; i < N; i++) {
diff = Value[i] - Cost[i];
if (diff ... | #include <stdio.h>
int main() {
int N;
int Cost[20], Value[20];
int diff;
int max = 0;
int i;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &Value[i]);
}
for (i = 0; i < N; i++) {
scanf("%d", &Cost[i]);
}
for (i = 0; i < N; i++) {
diff = Value[i] - Cost[i];
if (diff >... | [
"identifier.change",
"call.arguments.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change"
] | 872,805 | 872,804 | u355520191 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> C(N, 0);
vector<int> V(N, 0);
for (int i = 0; i < N; i++) {
cin >> V[i];
}
for (int i = 0; i < N; i++) {
cin >> C[i];
}
int reward = 0;
for (int i = 0; i > N; i++) {
if (V[i] - C[i] > 0) {
r... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> C(N, 0);
vector<int> V(N, 0);
for (int i = 0; i < N; i++) {
cin >> V[i];
}
for (int i = 0; i < N; i++) {
cin >> C[i];
}
int reward = 0;
for (int i = 0; i < N; i++) {
if (V[i] - C[i] > 0) {
r... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"io.output.newline.add"
] | 872,808 | 872,809 | u111653921 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> C(N, 0);
vector<int> V(N, 0);
for (int i = 0; i < N; i++) {
cin >> C[i];
}
for (int i = 0; i < N; i++) {
cin >> V[i];
}
int reward = 0;
for (int i = 0; i > N; i++) {
if (V[i] - C[i] > 0) {
r... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> C(N, 0);
vector<int> V(N, 0);
for (int i = 0; i < N; i++) {
cin >> V[i];
}
for (int i = 0; i < N; i++) {
cin >> C[i];
}
int reward = 0;
for (int i = 0; i < N; i++) {
if (V[i] - C[i] > 0) {
r... | [
"identifier.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.newline.add"
] | 872,810 | 872,809 | u111653921 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, cost;
int res = 0;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
for (int i = 0; i < n; i++) {
cin >> cost;
if (cost > v[i])
res += cost - v[i];
}
cout << res;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, cost;
int res = 0;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
for (int i = 0; i < n; i++) {
cin >> cost;
if (cost < v[i])
res += v[i] - cost;
}
cout << res;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove",
"assignment.change"
] | 872,833 | 872,834 | u899641160 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.