problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9 values |
|---|---|---|---|---|---|---|---|
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++)
#define FORIN(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define LAST(x) (x)[(x).size() - 1]
#define GI(name) \
int(name); \
scanf("%d", &(name))
#define GI2(name1, name2) \
int(name1), (name2); \
scanf("%d %d", &(name1), &(name2))
#define GI3(name1, name2, name3) \
int(name1), (name2), (name3); \
scanf("%d %d %d", &(name1), &(name2), &(name3))
#define GVI(name, size) \
vector<int>(name)(size); \
FOR(i, (size)) scanf("%d", &(name)[i])
#define MOD 1000000007
using namespace std;
string to_hex(int x) {
stringstream ss;
ss << hex << x;
return ss.str();
}
inline int get_int() {
int ret;
scanf("%d", &ret);
return ret;
}
inline vector<int> get_ints(int n) {
vector<int> ret(n);
FOR(i, n) { scanf("%d", &ret[i]); }
return ret;
}
inline string get_str() {
string ret;
cin >> ret;
return ret;
}
bool is_prime(int n) {
int s = sqrt(n) + 1;
for (int i = 2; i <= s; ++i) {
if (n % i == 0) {
return 0;
}
}
return 1;
}
vector<P> prime_division(int n) {
vector<P> ret;
int s = sqrt(n) + 1;
int c = 0;
for (int i = 2; i <= n; ++i) {
if (n % i == 0) {
c = 0;
do {
++c;
n /= i;
} while (n % i == 0);
ret.push_back(P(i, c));
}
}
return ret;
}
struct UnionFind {
vector<int> data;
UnionFind(int size) { data = vector<int>(size, -1); }
bool union_set(int x, int y) {
x = root(x);
y = root(y);
if (x != y) {
if (data[y] < data[x])
swap(x, y);
data[x] += data[y];
data[y] = x;
}
return x != y;
}
bool find(int x, int y) { return root(x) == root(y); }
int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
int size(int x) { return -data[root(x)]; }
};
string to_string(string s) { return s; }
template <class T> string to_string(vector<T> v) {
string ret = "{";
FOR(i, v.size() - 1) { ret += to_string(v[i]) + ","; }
if (v.size() > 0) {
ret += to_string(LAST(v));
}
ret += "}";
return ret;
}
void debug_print() { cerr << endl; }
template <class Head, class... Tail> void debug_print(Head head, Tail... tail) {
cerr << to_string(head) << " ";
debug_print(tail...);
}
template <class... T> void debug(T... args) {
cerr << "[" << __LINE__ << "]: ";
debug_print(args...);
}
void print() { cout << endl; }
template <class Head, class... Tail> void print(Head head, Tail... tail) {
cout << to_string(head);
print(tail...);
}
int main() {
GI3(A, B, T);
print(B + (T / A));
return 0;
} | #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++)
#define FORIN(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define LAST(x) (x)[(x).size() - 1]
#define GI(name) \
int(name); \
scanf("%d", &(name))
#define GI2(name1, name2) \
int(name1), (name2); \
scanf("%d %d", &(name1), &(name2))
#define GI3(name1, name2, name3) \
int(name1), (name2), (name3); \
scanf("%d %d %d", &(name1), &(name2), &(name3))
#define GVI(name, size) \
vector<int>(name)(size); \
FOR(i, (size)) scanf("%d", &(name)[i])
#define MOD 1000000007
using namespace std;
string to_hex(int x) {
stringstream ss;
ss << hex << x;
return ss.str();
}
inline int get_int() {
int ret;
scanf("%d", &ret);
return ret;
}
inline vector<int> get_ints(int n) {
vector<int> ret(n);
FOR(i, n) { scanf("%d", &ret[i]); }
return ret;
}
inline string get_str() {
string ret;
cin >> ret;
return ret;
}
bool is_prime(int n) {
int s = sqrt(n) + 1;
for (int i = 2; i <= s; ++i) {
if (n % i == 0) {
return 0;
}
}
return 1;
}
vector<P> prime_division(int n) {
vector<P> ret;
int s = sqrt(n) + 1;
int c = 0;
for (int i = 2; i <= n; ++i) {
if (n % i == 0) {
c = 0;
do {
++c;
n /= i;
} while (n % i == 0);
ret.push_back(P(i, c));
}
}
return ret;
}
struct UnionFind {
vector<int> data;
UnionFind(int size) { data = vector<int>(size, -1); }
bool union_set(int x, int y) {
x = root(x);
y = root(y);
if (x != y) {
if (data[y] < data[x])
swap(x, y);
data[x] += data[y];
data[y] = x;
}
return x != y;
}
bool find(int x, int y) { return root(x) == root(y); }
int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
int size(int x) { return -data[root(x)]; }
};
string to_string(string s) { return s; }
template <class T> string to_string(vector<T> v) {
string ret = "{";
FOR(i, v.size() - 1) { ret += to_string(v[i]) + ","; }
if (v.size() > 0) {
ret += to_string(LAST(v));
}
ret += "}";
return ret;
}
void debug_print() { cerr << endl; }
template <class Head, class... Tail> void debug_print(Head head, Tail... tail) {
cerr << to_string(head) << " ";
debug_print(tail...);
}
template <class... T> void debug(T... args) {
cerr << "[" << __LINE__ << "]: ";
debug_print(args...);
}
void print() { cout << endl; }
template <class Head, class... Tail> void print(Head head, Tail... tail) {
cout << to_string(head);
print(tail...);
}
int main() {
GI3(A, B, T);
print(B * (T / A));
return 0;
} | [
"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--) {
solve();
}
return 0;
} | #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 (t--) {
solve();
}
return 0;
} | [
"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 namespace std;
bool isp[mx];
void sv() {
ll i, j;
memset(isp, true, sizeof(isp));
isp[1] = false;
for (i = 2; i * i < mx; i++) {
if (isp[i]) {
for (j = i * i; j < mx; j += i)
isp[j] = false;
}
}
}
ll powr(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1)
res = (res * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
// sv();
ll a, b, t, i;
cin >> a >> b >> t;
ll ans = (t / b) * a;
cout << ans;
return 0;
}
| #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 namespace std;
bool isp[mx];
void sv() {
ll i, j;
memset(isp, true, sizeof(isp));
isp[1] = false;
for (i = 2; i * i < mx; i++) {
if (isp[i]) {
for (j = i * i; j < mx; j += i)
isp[j] = false;
}
}
}
ll powr(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1)
res = (res * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
// sv();
ll a, b, t, i;
cin >> a >> b >> t;
ll ans = (t / a) * b;
cout << ans;
return 0;
}
| [
"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 std::setw;
using std::string;
using std::vector;
// using std::iota;
using std::greater;
using std::max;
using std::min;
using std::sort;
using lli = long long int;
using ulli = unsigned long long int;
#define INF 999999999;
#define MOD 1000000007;
#define EVEL 1
#ifndef EVEL
#define dbug(X) std::cout << #X << ":" << X << " ";
#define dbugf(s) std::cout << s << " ";
#define dbugln std::cout << "\n";
#else
#define dbug(X) \
{}
#define dbugf(s) \
{}
#define dbugln \
{}
#endif
int A, B, T;
int main(void) {
cin.tie(0);
std::ios::sync_with_stdio(false);
cin >> A >> B >> T;
cout << (T % A) * B;
return 0;
}
| #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 std::setw;
using std::string;
using std::vector;
// using std::iota;
using std::greater;
using std::max;
using std::min;
using std::sort;
using lli = long long int;
using ulli = unsigned long long int;
#define INF 999999999;
#define MOD 1000000007;
#define EVEL 1
#ifndef EVEL
#define dbug(X) std::cout << #X << ":" << X << " ";
#define dbugf(s) std::cout << s << " ";
#define dbugln std::cout << "\n";
#else
#define dbug(X) \
{}
#define dbugf(s) \
{}
#define dbugln \
{}
#endif
int A, B, T;
int main(void) {
cin.tie(0);
std::ios::sync_with_stdio(false);
cin >> A >> B >> T;
cout << (T / A) * B;
return 0;
}
| [
"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);
}
int max = 0;
int nmax = std::pow(2, N) - 1;
for (int i = 0; i < nmax; i++) {
std::stringstream i_ss;
i_ss << std::bitset<20>(i);
std::string i_s = i_ss.str();
if (i < 10) {
std::cerr << i_s << std::endl;
}
int Y = 0, X = 0;
for (int j = 0; j < N; j++) {
if (i_s.at(19 - j) == '1') {
Y = Y + C.at(j);
X = X + V.at(j);
max = std::max(max, X - Y);
}
}
}
std::cout << max << std::endl;
}
| #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);
}
int max = 0;
int nmax = std::pow(2, N);
for (int i = 0; i < nmax; i++) {
std::stringstream i_ss;
i_ss << std::bitset<20>(i);
std::string i_s = i_ss.str();
if (i < 10) {
std::cerr << i_s << std::endl;
}
int Y = 0, X = 0;
for (int j = 0; j < N; j++) {
if (i_s.at(19 - j) == '1') {
Y = Y + C.at(j);
X = X + V.at(j);
max = std::max(max, X - Y);
}
}
}
std::cout << max << std::endl;
}
| [
"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) {
if (v[i] > c[i])
ans += v[i] - c[i];
}
cout << ans << endl;
} | #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) {
if (v[i] > c[i])
ans += v[i] - c[i];
}
cout << ans << endl;
} | [
"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 >> tmp) {
c[i] = tmp;
i++;
if (i >= n) {
break;
}
}
for (int i = 0; i < n; i++) {
if (v[i] > c[i]) {
tmp_x += v[i];
tmp_y += c[i];
}
}
cout << tmp_x - tmp_y << endl;
} | #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;
while (cin >> tmp) {
c[i] = tmp;
i++;
if (i >= n) {
break;
}
}
for (int i = 0; i < n; i++) {
if (v[i] > c[i]) {
tmp_x += v[i];
tmp_y += c[i];
}
}
cout << tmp_x - tmp_y << endl;
} | [
"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 (a % b == 0) {
return b;
}
return gcd(b, a % b);
}
struct Jewel {
int value;
int cost;
};
int main() {
ll N;
cin >> N;
vector<Jewel> jewels(N);
for (ll i = 0; i < N; i++) {
cin >> jewels[i].value;
}
for (ll i = 0; i < N; i++) {
cin >> jewels[i].cost;
}
ll ans = 0;
for (size_t i = 0; i < 1 << N; i++) {
ll value = 0;
ll cost = 0;
for (ll j = 0; j < N; j++) {
if (bitset<20>(j)[j]) {
value += jewels[j].value;
cost += jewels[j].cost;
}
}
ans = max(ans, value - cost);
}
cout << ans << endl;
} | #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 (a % b == 0) {
return b;
}
return gcd(b, a % b);
}
struct Jewel {
int value;
int cost;
};
int main() {
ll N;
cin >> N;
vector<Jewel> jewels(N);
for (ll i = 0; i < N; i++) {
cin >> jewels[i].value;
}
for (ll i = 0; i < N; i++) {
cin >> jewels[i].cost;
}
ll ans = 0;
for (size_t i = 0; i < 1 << N; i++) {
ll value = 0;
ll cost = 0;
for (ll j = 0; j < N; j++) {
if (bitset<20>(i)[j]) {
value += jewels[j].value;
cost += jewels[j].cost;
}
}
ans = max(ans, value - cost);
}
cout << ans << endl;
} | [
"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 (a % b == 0) {
return b;
}
return gcd(b, a % b);
}
struct Jewel {
int value;
int cost;
};
int main() {
ll N;
cin >> N;
vector<Jewel> jewels(N);
for (ll i = 0; i < N; i++) {
cin >> jewels[i].value;
}
for (ll i = 0; i < N; i++) {
cin >> jewels[i].cost;
}
ll ans = 0;
for (size_t i = 0; i < 1 << N; i++) {
ll value = 0;
ll cost = 0;
for (ll i = 0; i < N; i++) {
if (bitset<20>(i)[i]) {
value += jewels[i].value;
cost += jewels[i].cost;
}
}
ans = max(ans, value - cost);
}
cout << ans << endl;
} | #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 (a % b == 0) {
return b;
}
return gcd(b, a % b);
}
struct Jewel {
int value;
int cost;
};
int main() {
ll N;
cin >> N;
vector<Jewel> jewels(N);
for (ll i = 0; i < N; i++) {
cin >> jewels[i].value;
}
for (ll i = 0; i < N; i++) {
cin >> jewels[i].cost;
}
ll ans = 0;
for (size_t i = 0; i < 1 << N; i++) {
ll value = 0;
ll cost = 0;
for (ll j = 0; j < N; j++) {
if (bitset<20>(i)[j]) {
value += jewels[j].value;
cost += jewels[j].cost;
}
}
ans = max(ans, value - cost);
}
cout << ans << endl;
} | [
"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) {
if (a < b)
a = b;
}
// 二分探索 前方のindexを返すもの（自分自身を含む） 前方: -INF側のこと
template <class T> int former(const vector<T> &v, T x) {
return upper_bound(v.begin(), v.end(), x) - v.begin() -
1; // upper_bound : keyより大きい要素の内の一番左側のイテレータを返す
}
// 二分探索 後方のindexを返すもの（自分自身を含む）後方: INF側のこと
template <class T> int latter(const vector<T> &v, T x) {
return lower_bound(v.begin(), v.end(), x) -
v.begin(); // lower_bound :
// key以上の要素の内の一番左側のイテレータを返す
}
/*
*
* */
int main() {
int N;
cin >> N;
int V[N], C[N];
rep(i, N) { cin >> V[i]; }
rep(i, N) { cin >> C[i]; }
int ans = 0;
// V－Cが正のものしか選ばなくてよいのでそれだけを選ぶようにする
rep(i, N) {
if (V[i] - C[i]) {
ans += V[i] - C[i];
}
}
cout << ans << endl;
} | #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) {
if (a < b)
a = b;
}
// 二分探索 前方のindexを返すもの（自分自身を含む） 前方: -INF側のこと
template <class T> int former(const vector<T> &v, T x) {
return upper_bound(v.begin(), v.end(), x) - v.begin() -
1; // upper_bound : keyより大きい要素の内の一番左側のイテレータを返す
}
// 二分探索 後方のindexを返すもの（自分自身を含む）後方: INF側のこと
template <class T> int latter(const vector<T> &v, T x) {
return lower_bound(v.begin(), v.end(), x) -
v.begin(); // lower_bound :
// key以上の要素の内の一番左側のイテレータを返す
}
/*
*
* */
int main() {
int N;
cin >> N;
int V[N], C[N];
rep(i, N) { cin >> V[i]; }
rep(i, N) { cin >> C[i]; }
int ans = 0;
// V－Cが正のものしか選ばなくてよいのでそれだけを選ぶようにする
rep(i, N) {
if (V[i] - C[i] > 0) {
ans += V[i] - C[i];
}
}
cout << ans << endl;
} | [
"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 = "abcdefghijklmnopqrstuvwxyz";
string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main() {
ll n;
vl v(n), c(n);
rep(i, n) { cin >> v[i]; }
rep(i, n) { cin >> c[i]; }
vl plus(n);
rep(i, n) { plus[i] = v[i] - c[i]; }
ll sum = 0;
rep(i, n) {
if (plus[i] > 0) {
sum += plus[i];
}
}
cout << sum << endl;
} | #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 = "abcdefghijklmnopqrstuvwxyz";
string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main() {
ll n;
cin >> n;
vl v(n), c(n);
rep(i, n) { cin >> v[i]; }
rep(i, n) { cin >> c[i]; }
vl plus(n);
rep(i, n) { plus[i] = v[i] - c[i]; }
ll sum = 0;
rep(i, n) {
if (plus[i] > 0) {
sum += plus[i];
}
}
cout << sum << endl;
} | [] | 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);
}
}
cout << Y - X << endl;
} | #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);
}
}
cout << X - Y << endl;
}
| [
"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) {
S = V[i] - C[i];
}
i++;
}
cout << S << endl;
} | #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) {
S += V[i] - C[i];
}
i++;
}
cout << S << endl;
} | [
"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;
return 0;
} | #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 << endl;
return 0;
} | [] | 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 cout << ' '
#define in(n) cin >> n
#define in2(n, m) cin >> n >> m
#define in3(n, m, l) cin >> n >> m >> l
#define out(n) cout << n
const ll mei = (ll)1e9 + 7;
int main() {
ll n, a;
a = 0;
vector<ll> v(n), c(n);
rep(i, n) in(v[i]);
rep(i, n) in(c[i]);
rep(i, n) {
if (v[i] - c[i] > 0)
a = a + v[i] - c[i];
}
out(a);
memi;
} | #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 cout << ' '
#define in(n) cin >> n
#define in2(n, m) cin >> n >> m
#define in3(n, m, l) cin >> n >> m >> l
#define out(n) cout << n
const ll mei = (ll)1e9 + 7;
int main() {
ll n, a;
a = 0;
in(n);
vector<ll> v(n), c(n);
rep(i, n) in(v[i]);
rep(i, n) in(c[i]);
rep(i, n) {
if (v[i] - c[i] > 0)
a = a + v[i] - c[i];
}
out(a);
memi;
} | [
"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 __ \
{ \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout); \
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
__;
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++) {
ans += max(0, a[i] - b[i]);
}
cout << ans;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define __ \
{ \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout); \
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// __;
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++) {
ans += max(0, a[i] - b[i]);
}
cout << ans;
} | [] | 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 << ans;
}
| [] | 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> v(n);
vector<int> c(n);
rep(i, n) cin >> v[i];
rep(i, n) cin >> c[i];
rep(i, n) {
if (v[i] - c[i] > 0)
ans += v[i] + c[i];
}
cout << ans << endl;
return 0;
} | #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> v(n);
vector<int> c(n);
rep(i, n) cin >> v[i];
rep(i, n) cin >> c[i];
rep(i, n) {
if (v[i] - c[i] > 0)
ans += v[i] - c[i];
}
cout << ans << endl;
return 0;
} | [
"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;
#define debug(x) cout << #x << ": " << x << endl
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (int i = 0; i < (int)v.size(); i++)
os << v[i] << (i + 1 != v.size() ? " " : "");
return os;
}
void solve() {
int n;
cin >> n;
vector<int> c(n), v(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 bit = 0; bit < (1 << n) - 1; bit++) {
int x = 0, y = 0;
for (int i = 0; i < n; i++) {
if (bit & (1 << i)) {
x += v[i];
y += c[i];
}
}
ans = max(ans, x - y);
}
cout << ans << endl;
}
signed main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
} | #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;
#define debug(x) cout << #x << ": " << x << endl
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (int i = 0; i < (int)v.size(); i++)
os << v[i] << (i + 1 != v.size() ? " " : "");
return os;
}
void solve() {
int n;
cin >> n;
vector<int> c(n), v(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 bit = 0; bit < (1 << n); bit++) {
int x = 0, y = 0;
for (int i = 0; i < n; i++) {
if (bit & (1 << i)) {
x += v[i];
y += c[i];
}
}
ans = max(ans, x - y);
}
cout << ans << endl;
}
signed main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
} | [
"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 (kachi.at(i) - cost.at(i))
ans += kachi.at(i) - cost.at(i);
}
cout << ans << endl;
} | #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 (kachi.at(i) - cost.at(i) > 0)
ans += kachi.at(i) - cost.at(i);
}
cout << ans << endl;
} | [
"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];
}
}
cout << ans << endl;
}
int main() {
func();
return 0;
}
| #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] - cost[i];
}
}
cout << ans << endl;
}
int main() {
func();
return 0;
}
| [] | 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 (v[i] > c[i])
sum += v[i] > c[i];
}
print(sum);
} | #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 (v[i] > c[i])
sum += v[i] - c[i];
}
print(sum);
} | [
"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() {
int n;
cin >> n;
vector<int> v(n), c(n);
rep(i, n) cin >> v[i];
rep(i, n) cin >> c[i];
int ans;
rep(i, n) {
if (v[i] > c[i])
ans += v[i] - c[i];
}
cout << ans << endl;
} | #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() {
int n;
cin >> n;
vector<int> v(n), c(n);
rep(i, n) cin >> v[i];
rep(i, n) cin >> c[i];
int ans = 0;
rep(i, n) {
if (v[i] >= c[i])
ans += v[i] - c[i];
}
cout << ans << endl;
} | [
"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 (int i = 0; i < n; i++) {
cin >> arr[i].ss;
}
sort(arr.begin(), arr.end(),
[](auto &a, auto &b) { return (a.ff - a.ss) > (b.ff - b.ss); });
x = y = 0;
ans = INT_MIN;
for (int i = 0; i < n; i++) {
x += arr[i].ff;
y += arr[i].ss;
ans = max(ans, x - y);
}
cout << ans << endl;
}
| #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 (int i = 0; i < n; i++) {
cin >> arr[i].ss;
}
sort(arr.begin(), arr.end(),
[](auto &a, auto &b) { return (a.ff - a.ss) > (b.ff - b.ss); });
x = y = 0;
ans = 0;
for (int i = 0; i < n; i++) {
x += arr[i].ff;
y += arr[i].ss;
ans = max(ans, x - y);
}
cout << ans << endl;
}
| [
"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); \
cout.tie(0);
#define int long long int
#define mod 1000000007
using namespace std;
signed main() {
fast;
int n;
vector<int> a(n);
vector<int> b(n);
for (int i = 0; i < a.size(); i++) {
cin >> a[i];
}
for (int i = 0; i < b.size(); i++) {
cin >> b[i];
}
int sum = 0;
for (int i = 0; i < a.size(); i++) {
if (a[i] - b[i] > 0) {
sum += (a[i] - b[i]);
}
}
cout << sum << endl;
return 0;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <string>
#include <vector>
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int long long int
#define mod 1000000007
using namespace std;
signed main() {
fast;
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n);
for (int i = 0; i < a.size(); i++) {
cin >> a[i];
}
for (int i = 0; i < b.size(); i++) {
cin >> b[i];
}
int sum = 0;
for (int i = 0; i < a.size(); i++) {
if (a[i] - b[i] > 0) {
sum += (a[i] - b[i]);
}
}
cout << sum << endl;
return 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); \
cout << fixed; \
cout << setprecision(12);
#define randomINT \
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout << "\n"
#define DISP(as) \
for (auto it : as) \
cout << it << " "; \
newl;
#define DISP1(as) \
for (auto it : as) \
cout << it.f << " " << it.s << ") "; \
newl;
#define all(x) (x).begin(), (x).end()
#define mset(x, val) memset(x, val, sizeof(x))
#define newl cout << "\n"
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define dline cerr << "///REACHED///\n";
#define deb1(x) cerr << #x << " = " << x << '\n';
#define deb2(x, y) \
cerr << '[' << #x << ',' << #y << "] = " << '[' << x << ',' << y << ']' \
<< '\n';
#define deb3(x, y, z) \
cerr << '[' << #x << ',' << #y << ',' << #z << "] = " << '[' << x << ',' \
<< y << ',' << z << ']' << '\n';
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pld;
typedef unordered_map<ll, ll> um;
typedef vector<pll> vpll;
const ll MAX5 = 2e+5 + 99;
const ll MAX7 = 1e+7 + 7;
const ll MAXN = MAX7;
const ll INF = 0x7f7f7f7f7f7f7f7f;
const int INFi = 0x7f7f7f7f;
const ll MOD = 1e+9 + 7;
// <------------- Declare Variables Here ------------> //
ll T = 1;
ll n, k, l, q, x;
string s;
// <---------------------- > //
// <------------- Start of main() -------------------> //
void MAIN() {
cin >> n;
vll a(n);
set<ll, greater<ll>> val;
for (ll i = 0; i < n; i++)
cin >> a[i];
for (ll i = 0; i < n; i++) {
cin >> x;
val.insert(a[i] - x);
}
ll sum = 0;
for (auto it : val) {
if (it <= 0)
break;
sum += it;
}
cout << sum;
}
int main() {
fastio;
randomINT;
// cin >> T;
while (T--) {
MAIN();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0); \
cout << fixed; \
cout << setprecision(12);
#define randomINT \
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout << "\n"
#define DISP(as) \
for (auto it : as) \
cout << it << " "; \
newl;
#define DISP1(as) \
for (auto it : as) \
cout << it.f << " " << it.s << ") "; \
newl;
#define all(x) (x).begin(), (x).end()
#define mset(x, val) memset(x, val, sizeof(x))
#define newl cout << "\n"
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define dline cerr << "///REACHED///\n";
#define deb1(x) cerr << #x << " = " << x << '\n';
#define deb2(x, y) \
cerr << '[' << #x << ',' << #y << "] = " << '[' << x << ',' << y << ']' \
<< '\n';
#define deb3(x, y, z) \
cerr << '[' << #x << ',' << #y << ',' << #z << "] = " << '[' << x << ',' \
<< y << ',' << z << ']' << '\n';
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pld;
typedef unordered_map<ll, ll> um;
typedef vector<pll> vpll;
const ll MAX5 = 2e+5 + 99;
const ll MAX7 = 1e+7 + 7;
const ll MAXN = MAX7;
const ll INF = 0x7f7f7f7f7f7f7f7f;
const int INFi = 0x7f7f7f7f;
const ll MOD = 1e+9 + 7;
// <------------- Declare Variables Here ------------> //
ll T = 1;
ll n, k, l, q, x;
string s;
// <---------------------- > //
// <------------- Start of main() -------------------> //
void MAIN() {
cin >> n;
vll a(n);
multiset<ll, greater<ll>> val;
for (ll i = 0; i < n; i++)
cin >> a[i];
for (ll i = 0; i < n; i++) {
cin >> x;
val.insert(a[i] - x);
}
ll sum = 0;
for (auto it : val) {
if (it <= 0)
break;
sum += it;
}
cout << sum;
}
int main() {
fastio;
randomINT;
// cin >> T;
while (T--) {
MAIN();
}
return 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); \
cout << fixed; \
cout << setprecision(12);
#define randomINT \
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout << "\n"
#define DISP(as) \
for (auto it : as) \
cout << it << " "; \
newl;
#define DISP1(as) \
for (auto it : as) \
cout << it.f << " " << it.s << ") "; \
newl;
#define all(x) (x).begin(), (x).end()
#define mset(x, val) memset(x, val, sizeof(x))
#define newl cout << "\n"
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define dline cerr << "///REACHED///\n";
#define deb1(x) cerr << #x << " = " << x << '\n';
#define deb2(x, y) \
cerr << '[' << #x << ',' << #y << "] = " << '[' << x << ',' << y << ']' \
<< '\n';
#define deb3(x, y, z) \
cerr << '[' << #x << ',' << #y << ',' << #z << "] = " << '[' << x << ',' \
<< y << ',' << z << ']' << '\n';
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pld;
typedef unordered_map<ll, ll> um;
typedef vector<pll> vpll;
const ll MAX5 = 2e+5 + 99;
const ll MAX7 = 1e+7 + 7;
const ll MAXN = MAX7;
const ll INF = 0x7f7f7f7f7f7f7f7f;
const int INFi = 0x7f7f7f7f;
const ll MOD = 1e+9 + 7;
// <------------- Declare Variables Here ------------> //
ll T = 1;
ll n, k, l, q, x;
string s;
// <---------------------- > //
// <------------- Start of main() -------------------> //
void MAIN() {
cin >> n;
vll a(n);
set<ll, greater<ll>> val;
for (ll i = 0; i < n; i++)
cin >> a[i];
for (ll i = 0; i < n; i++) {
cin >> x;
val.insert(a[i] - x);
}
ll sum = 0;
for (auto it : val) {
if (it < 0)
break;
sum += it;
}
cout << sum;
}
int main() {
fastio;
randomINT;
// cin >> T;
while (T--) {
MAIN();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0); \
cout << fixed; \
cout << setprecision(12);
#define randomINT \
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout << "\n"
#define DISP(as) \
for (auto it : as) \
cout << it << " "; \
newl;
#define DISP1(as) \
for (auto it : as) \
cout << it.f << " " << it.s << ") "; \
newl;
#define all(x) (x).begin(), (x).end()
#define mset(x, val) memset(x, val, sizeof(x))
#define newl cout << "\n"
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define dline cerr << "///REACHED///\n";
#define deb1(x) cerr << #x << " = " << x << '\n';
#define deb2(x, y) \
cerr << '[' << #x << ',' << #y << "] = " << '[' << x << ',' << y << ']' \
<< '\n';
#define deb3(x, y, z) \
cerr << '[' << #x << ',' << #y << ',' << #z << "] = " << '[' << x << ',' \
<< y << ',' << z << ']' << '\n';
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pld;
typedef unordered_map<ll, ll> um;
typedef vector<pll> vpll;
const ll MAX5 = 2e+5 + 99;
const ll MAX7 = 1e+7 + 7;
const ll MAXN = MAX7;
const ll INF = 0x7f7f7f7f7f7f7f7f;
const int INFi = 0x7f7f7f7f;
const ll MOD = 1e+9 + 7;
// <------------- Declare Variables Here ------------> //
ll T = 1;
ll n, k, l, q, x;
string s;
// <---------------------- > //
// <------------- Start of main() -------------------> //
void MAIN() {
cin >> n;
vll a(n);
multiset<ll, greater<ll>> val;
for (ll i = 0; i < n; i++)
cin >> a[i];
for (ll i = 0; i < n; i++) {
cin >> x;
val.insert(a[i] - x);
}
ll sum = 0;
for (auto it : val) {
if (it <= 0)
break;
sum += it;
}
cout << sum;
}
int main() {
fastio;
randomINT;
// cin >> T;
while (T--) {
MAIN();
}
return 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++) {
sa[i] = V[i] - C[i];
}
sort(sa.begin(), sa.end());
for (int i = 0; i < N; i++) {
if (sa[i] >= 0)
ans++;
}
cout << ans << endl;
}
| #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++) {
sa[i] = V[i] - C[i];
}
sort(sa.begin(), sa.end());
for (int i = 0; i < N; i++) {
if (sa[i] >= 0)
ans += sa[i];
}
cout << ans << endl;
}
| [] | 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_back(ref);
}
int Ans = 0;
std::vector<int> diff;
for (int i = 0; i < N; i++) {
ref = V[i] - C[i];
// cout<<ref<<endl;
diff.push_back(ref);
}
std::sort(diff.begin(), diff.end());
// cout << diff[0] << ":"<<diff[1] << ":"<<diff[2] << ":"<<endl;
int tmp = 0;
for (int i = N; i > 0; --i) {
// cout<<diff[i]<<endl;
tmp += diff[i];
if (Ans <= tmp)
Ans = tmp;
}
std::cout << Ans << std::endl;
return 0;
} | #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_back(ref);
}
int Ans = 0;
std::vector<int> diff;
for (int i = 0; i < N; i++) {
ref = V[i] - C[i];
diff.push_back(ref);
}
std::sort(diff.begin(), diff.end());
int tmp = 0;
for (int i = N; i >= 0; --i) {
tmp += diff[i];
if (Ans <= tmp)
Ans = tmp;
// cout << "i="<<i << endl;
}
std::cout << Ans << std::endl;
return 0;
} | [
"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++) {
if (vec[0][i] - vec[1][i] > 0) {
ans += vec[0][i] - vec[1][i];
}
}
cout << ans << endl;
}
| #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++) {
if (vec[0][i] - vec[1][i] > 0) {
ans += vec[0][i] - vec[1][i];
}
}
cout << ans << endl;
}
| [
"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)) {
ans += V.at(i) > C.at(i);
}
}
cout << ans << endl;
}
| #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)) {
ans += V.at(i) - C.at(i);
}
}
cout << ans << endl;
}
| [
"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 = V.at(i) - C.at(i);
}
}
cout << ans << endl;
} | #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 += V.at(i) - C.at(i);
}
}
cout << ans << endl;
}
| [
"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 long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n), c(n);
rep(i, n) cin >> v[i];
rep(i, n) cin >> c[i];
int ans = 0;
rep(i, n) {
int a = v[i] - c[i];
ans = max(a, 0);
}
cout << ans << endl;
}
| #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 long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n), c(n);
rep(i, n) cin >> v[i];
rep(i, n) cin >> c[i];
int ans = 0;
rep(i, n) {
int a = v[i] - c[i];
ans += max(a, 0);
}
cout << ans << endl;
}
| [
"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(N), c(N), res(N);
REP(i, N) { cin >> v[i]; }
REP(i, N) { cin >> c[i]; }
REP(i, N) { res[i] = max(0, v[i] - c[i]); }
cout << accumulate(ALL(res), 0);
return 0;
}
| #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;
vector<int> v(N), c(N), res(N);
REP(i, N) { cin >> v[i]; }
REP(i, N) { cin >> c[i]; }
REP(i, N) { res[i] = max(0, v[i] - c[i]); }
cout << accumulate(ALL(res), 0);
return 0;
}
| [] | 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_back(a);
}
vector<int> va;
for (int i = 0; i < n; ++i) {
va.push_back(vn[i] - vc[i]);
}
sort(va.begin(), va.end(), greater<int>());
int a = 0, i = 0;
while (va[i] >= 0) {
a += va[i];
i++;
}
cout << a << endl;
}
| #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_back(a);
}
vector<int> va;
for (int i = 0; i < n; ++i) {
va.push_back(vn[i] - vc[i]);
}
sort(va.begin(), va.end(), greater<int>());
int a = 0, i = 0;
while (i < n && va[i] >= 0) {
a += va[i];
i++;
}
cout << a << endl;
}
| [
"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++) {
if (v[i] > c[i]) {
gain += v[i];
}
}
cout << gain << endl;
return 0;
}
| #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++) {
if (v[i] > c[i]) {
gain += v[i] - c[i];
}
}
cout << gain << endl;
return 0;
}
| [
"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) {
if (d[i] > 0)
ans += d[i];
}
cout << ans << endl;
}
| #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) {
if (d[i] > 0)
ans += d[i];
}
cout << ans << endl;
}
| [
"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 << endl;
} | #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 << endl;
} | [
"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.at(i);
}
}
cout << ans << endl;
}
| #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.at(i);
}
}
cout << ans << endl;
}
| [
"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 < n; i++) {
if (a.at(i) < b.at(i))
sum += a.at(i) + b.at(i);
}
cout << sum << endl;
} | #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 < n; i++) {
if (a.at(i) > b.at(i))
sum += a.at(i) - b.at(i);
}
cout << sum << endl;
} | [
"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.at(i);
}
}
cout << X << endl;
} | #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 + A.at(i) - B.at(i);
}
}
cout << X << endl;
} | [
"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]; }
rep(i, n) { cin >> c[i]; }
int ans = 0;
rep(i, n) {
if (v[i] - c[i] >= 0) {
ans += v[i] - c[i];
}
}
cout << ans << endl;
return 0;
} | #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 >> v[i]; }
rep(i, n) { cin >> c[i]; }
int ans = 0;
rep(i, n) {
if (v[i] - c[i] >= 0) {
ans += v[i] - c[i];
}
}
cout << ans << endl;
return 0;
} | [] | 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) {
if (v[i] > c[i]) {
x += v[i];
y += c[i];
}
}
cout << x - y << endl;
}
| #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]; }
rep(i, n) {
if (v[i] > c[i]) {
x += v[i];
y += c[i];
}
}
cout << x - y << endl;
}
| [
"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;
return 0;
}
| #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;
return 0;
}
| [
"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;
}
}
cout << ret << endl;
return 0;
} | #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;
}
}
cout << ret << endl;
return 0;
} | [] | 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 += (kati.at(k) - cost.at(k));
}
}
cout << kotae;
return 0;
}
| #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 += (kati.at(k) - cost.at(k));
}
}
cout << kotae;
return 0;
}
| [
"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[i] - C[i];
}
i++;
}
cout << answer << endl;
} | #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[i] - C[i];
}
i++;
}
cout << answer << endl;
} | [
"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++)
cin >> C[i];
int ans = 0;
for (int i = 0; i < N; i++) {
if (C[i] - V[i] > 0)
ans += C[i] - V[i];
}
cout << ans << endl;
} | #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++)
cin >> C[i];
int ans = 0;
for (int i = 0; i < N; i++) {
if (V[i] - C[i] > 0)
ans += V[i] - C[i];
}
cout << ans << endl;
} | [
"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) {
x = 0;
y = 0;
for (int j = 0; j < n; ++j) {
if ((i >> j) & 1) {
x += v[j];
y += c[j];
}
}
ans = max(ans, x - y);
}
cout << ans << endl;
return 0;
}
| #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 = 0;
y = 0;
for (int j = 0; j < n; ++j) {
if ((i >> j) & 1) {
x += v[j];
y += c[j];
}
}
ans = max(ans, x - y);
}
cout << ans << endl;
return 0;
}
| [
"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];
}
}
cout << a - b << endl;
}
| #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];
}
}
cout << a - b << endl;
}
| [
"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];
}
}
cout << GO << endl;
}
| #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];
}
}
cout << GO << endl;
}
| [
"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 < N; i++) {
cin >> C[i];
}
for (int i = 0; i < N; i++) {
if (V[i] > C[i])
max += V[i] - C[i];
}
cout << max << endl;
return 0;
}
| #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 = 0; i < N; i++) {
cin >> C[i];
}
for (int i = 0; i < N; i++) {
if (V[i] > C[i])
max += V[i] - C[i];
}
cout << max << endl;
return 0;
}
| [] | 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] - cost[i];
if (diff > 0) {
sum += diff;
}
}
cout << sum << endl;
return 0;
}
| #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] - cost[i];
if (diff > 0) {
sum += diff;
}
}
cout << sum << endl;
return 0;
}
| [
"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 += value[i] - cost[i];
}
}
cout << ans << endl;
return 0;
}
| #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 += value[i] - cost[i];
}
}
cout << ans << endl;
return 0;
}
| [
"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;
return 0;
} | #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;
return 0;
} | [
"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;
return 0;
} | #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;
return 0;
} | [
"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];
sum1 = sum1 + x;
}
cout << sum1;
return 0;
}
| #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];
sum1 = sum1 + x;
}
}
cout << sum1;
return 0;
}
| [] | 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/stdc++.h>
#include <cstdio>
#include <cstdlib>
#include <tuple>
#include <utility>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define vll vector<ll>
#define vi vector<int>
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define mod 1000000007
using ll = long long;
using namespace std;
int main() {
int n;
vi v(n), c(n);
rep(i, n) { cin >> v[i]; }
rep(i, n) { cin >> c[i]; }
int ans = 0;
rep(i, n) {
if (v[i] - c[i] > 0) {
ans += v[i] - c[i];
}
}
cout << ans;
return 0;
}
| #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/stdc++.h>
#include <cstdio>
#include <cstdlib>
#include <tuple>
#include <utility>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define vll vector<ll>
#define vi vector<int>
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define mod 1000000007
using ll = long long;
using namespace std;
int main() {
int n;
cin >> n;
vi v(n), c(n);
rep(i, n) { cin >> v[i]; }
rep(i, n) { cin >> c[i]; }
int ans = 0;
rep(i, n) {
if (v[i] - c[i] > 0) {
ans += v[i] - c[i];
}
}
cout << ans;
return 0;
}
| [] | 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.begin(), X.end(), std::greater<int>());
auto bound = std::lower_bound(X.begin(), X.end(), 0, std::greater<int>());
int value;
for (auto iter = X.begin(); iter < bound; ++iter) {
value += *iter;
}
std::cout << value << std::endl;
return 0;
}
| #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.begin(), X.end(), std::greater<int>());
auto bound = std::lower_bound(X.begin(), X.end(), 0, std::greater<int>());
int value = 0;
for (auto iter = X.begin(); iter < bound; ++iter) {
value += *iter;
}
std::cout << value << std::endl;
return 0;
}
| [
"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++) {
if (arr[i])
sum += arr[i];
else
break;
}
cout << sum;
return 0;
} | #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++) {
if (arr[i] > 0)
sum += arr[i];
else
break;
}
cout << sum;
return 0;
} | [
"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 << ans << endl;
} | #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 << ans << endl;
} | [
"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 (int i = 0; i < n; i++) {
if (a.at(i) > 0) {
sum += a.at(i);
}
}
cout << sum << endl;
}
| #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 (int i = 0; i < n; i++) {
if (a.at(i) > 0) {
sum += a.at(i);
}
}
cout << sum << endl;
}
| [
"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] = d[i] - b[i];
}
for (int i = 0; i < a; i++) {
if (e[i] > 0)
c += e[i];
}
cout << c;
} |
#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] = b[i] - d[i];
}
for (int i = 0; i < a; i++) {
if (e[i] > 0)
c += e[i];
}
cout << c;
} | [
"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) {
Ans += V[i] - C[i];
}
}
// output
cout << Ans;
return 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) {
Ans += V[i] - C[i];
}
}
// output
cout << Ans;
return 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 <utility>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define LFOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define LRFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define INF 1000000000 // 2000000000
#define LINF 1000000000000000000 // 9000000000000000000
#define PI 3.14159265358979
#define MAXI 7500000
using namespace std;
typedef long long int ll;
typedef pair<long long int, long long int> P;
int dy[5] = {0, 0, 1, -1, 0};
int dx[5] = {1, -1, 0, 0, 0};
int main(void) {
int n;
cin >> n;
vector<int> c(n), v(n);
vector<int> value(n);
int total = 0;
FOR(i, 0, n - 1) { cin >> v[i]; }
FOR(i, 0, n - 1) { cin >> c[i]; }
FOR(i, 0, n - 1) { value[i] = v[i] - c[i]; }
sort(value.begin(), value.end());
FOR(i, 0, n - 1) {
if (value[i] > 0) {
total += value[i];
} else {
break;
}
}
cout << total << endl;
return 0;
} | //#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 <utility>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define LFOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define LRFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define INF 1000000000 // 2000000000
#define LINF 1000000000000000000 // 9000000000000000000
#define PI 3.14159265358979
#define MAXI 7500000
using namespace std;
typedef long long int ll;
typedef pair<long long int, long long int> P;
int dy[5] = {0, 0, 1, -1, 0};
int dx[5] = {1, -1, 0, 0, 0};
int main(void) {
int n;
cin >> n;
vector<int> c(n), v(n);
vector<int> value(n);
int total = 0;
FOR(i, 0, n - 1) { cin >> v[i]; }
FOR(i, 0, n - 1) { cin >> c[i]; }
FOR(i, 0, n - 1) { value[i] = v[i] - c[i]; }
sort(value.begin(), value.end());
RFOR(i, n - 1, 0) {
if (value[i] > 0) {
total += value[i];
} else {
break;
}
}
cout << total << endl;
return 0;
} | [
"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);
std::ios::sync_with_stdio(false);
}
} fast;
ll gcd(ll a, ll b) {
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
bool vector_find(std::vector<ll> vec, ll number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance(vec.begin(), itr);
if (index != vec.size()) {
return true;
} else {
return false;
}
}
int main(int argc, char *argv[]) {
ll result = 0;
ll N;
vector<ll> V;
vector<ll> C;
for (int i = 0; i < N; i++) {
ll x;
cin >> x;
V.push_back(x);
}
for (int i = 0; i < N; i++) {
ll x;
cin >> x;
C.push_back(x);
}
for (int i = 0; i < N; i++) {
if (V[i] - C[i] > 0) {
result += V[i] - C[i];
}
}
cout << result << endl;
return 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);
std::ios::sync_with_stdio(false);
}
} fast;
ll gcd(ll a, ll b) {
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
bool vector_find(std::vector<ll> vec, ll number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance(vec.begin(), itr);
if (index != vec.size()) {
return true;
} else {
return false;
}
}
int main(int argc, char *argv[]) {
ll result = 0;
ll N;
cin >> N;
vector<ll> V;
vector<ll> C;
for (int i = 0; i < N; i++) {
ll x;
cin >> x;
V.push_back(x);
}
for (int i = 0; i < N; i++) {
ll x;
cin >> x;
C.push_back(x);
}
for (int i = 0; i < N; i++) {
if (V[i] - C[i] > 0) {
result += V[i] - C[i];
}
}
cout << result << endl;
return 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);
else
continue;
}
cout << ans << endl;
} | #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);
else
continue;
}
cout << ans << endl;
} | [
"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;
}
cout << add << endl;
}
| #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;
}
cout << ans << endl;
return 0;
}
| [
"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;
}
cout << add << endl;
return 0;
}
| #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;
}
cout << ans << endl;
return 0;
}
| [
"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<ull>
#define vvi vector<vector<int>>
#define vvb vector<vector<bool>>
#define all(v) (v).begin(), (v).end()
#define allrev(v) (v).rbegin(), (v).rend()
#define pii pair<int, int>
#define vii vector<pii>
#define F first
#define S second
#define mp make_pair
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define mod 1000000007
#define pp(n) printf("%.10f", n);
#define line cout << "\n";
const D pie = acos(-1);
const D hpie = asin(1);
const D qpie = atan2(-1, 1);
const D tpie = 2 * pie;
void solve(int test_case) {
int n;
cin >> n;
vi a;
vi b;
int ans = 0;
int temp;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
cin >> temp;
ans += max(0, a[i] - temp);
}
cout << ans << "\n";
}
int main() {
fast int t = 1;
// cin>>t;
for (int i = 0; i < t; i++)
solve(i);
return 0;
}
| #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<ull>
#define vvi vector<vector<int>>
#define vvb vector<vector<bool>>
#define all(v) (v).begin(), (v).end()
#define allrev(v) (v).rbegin(), (v).rend()
#define pii pair<int, int>
#define vii vector<pii>
#define F first
#define S second
#define mp make_pair
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define mod 1000000007
#define pp(n) printf("%.10f", n);
#define line cout << "\n";
const D pie = acos(-1);
const D hpie = asin(1);
const D qpie = atan2(-1, 1);
const D tpie = 2 * pie;
void solve(int test_case) {
int n;
cin >> n;
vi a(n);
int ans = 0;
int temp;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
cin >> temp;
ans += max(0, a[i] - temp);
}
cout << ans << "\n";
}
int main() {
fast int t = 1;
// cin>>t;
for (int i = 0; i < t; i++)
solve(i);
return 0;
}
| [] | 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 << endl;
} | [
"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] << endl;
if (a[i] > b[i]) {
x += a[i] - b[i];
// cout << "hello" << x << endl;
}
}
cout << x << endl;
return 0;
} | #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];
}
}
cout << x << endl;
return 0;
} | [
"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];
}
}
cout << x << endl;
return 0;
} | #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];
}
}
cout << x << endl;
return 0;
} | [
"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];
}
}
cout << sum << endl;
}
| #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];
}
}
cout << sum << endl;
}
| [] | 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] - C[i];
}
/*
int max = 0;
for(int i=0; i<pow(2,N); i++){
int a = i;
int X = 0;
int Y = 0;
for(int j=0; j<N; j++, a/=2){
if(a%2 == 0){
X += V[j];
Y += C[j];
}
}
if(max < X-Y) max = X-Y;
}
*/
cout << max;
return 0;
}
| #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] - C[i];
}
cout << max;
return 0;
}
| [
"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())
#define vmax_p(v) max_element(v.begin(), v.end())
#define vmin_p(v) min_element(v.begin(), v.end())
#define vmax_idx(v) distance(v.begin(), vmax_p(v))
#define vmin_idx(v) distance(v.begin(), vmin_p(v))
#define vcopy(src, dst) copy(src.begin(), src.end(), back_inserter(dst))
#define P pair
// stoi(s): string to int
// stod(s): string to double
// INT_MAX
// INT_MIN
// LLONG_MAX
// LLONG_MIN
// DBL_MIN
// DBL_MAX
// LDBL_MIN
// LDBL_MAX
// A-Z: 65~90
// a-z: 97~122
// |a-z| = 26
// floor(x): truncate
// 2進数変換
// string s = bitset<20>(x).to_string();
using namespace std;
using ll = long long;
int main(int argc, const char *argv[]) {
int 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 sum = 0;
for (int i = 0; i < n; i++) {
if (v[i] - c[i] > 0) {
sum += v[i] - c[i];
}
}
cout << sum << endl;
}
| #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())
#define vmax_p(v) max_element(v.begin(), v.end())
#define vmin_p(v) min_element(v.begin(), v.end())
#define vmax_idx(v) distance(v.begin(), vmax_p(v))
#define vmin_idx(v) distance(v.begin(), vmin_p(v))
#define vcopy(src, dst) copy(src.begin(), src.end(), back_inserter(dst))
#define P pair
// stoi(s): string to int
// stod(s): string to double
// INT_MAX
// INT_MIN
// LLONG_MAX
// LLONG_MIN
// DBL_MIN
// DBL_MAX
// LDBL_MIN
// LDBL_MAX
// A-Z: 65~90
// a-z: 97~122
// |a-z| = 26
// floor(x): truncate
// 2進数変換
// string s = bitset<20>(x).to_string();
using namespace std;
using ll = long long;
int main(int argc, const char *argv[]) {
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 sum = 0;
for (int i = 0; i < n; i++) {
if (v[i] - c[i] > 0) {
sum += v[i] - c[i];
}
}
cout << sum << endl;
}
| [] | 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[i];
}
int ans = 0;
for (int i = 0; i <= N; i++) {
if (cp[i] >= 0) {
ans = ans + cp[i];
}
}
cout << ans << endl;
return 0;
}
| #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[i];
}
int ans = 0;
for (int i = 0; i <= N; i++) {
if (cp[i] >= 0) {
ans = ans + cp[i];
}
}
cout << ans << endl;
return 0;
}
| [
"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 << v[0];
return 0;
} | #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[i];
cout << v[0];
return 0;
}
| [] | 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 > 0)
max += diff;
}
printf("%d\n", max);
return 0;
}
| #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 > 0)
max += diff;
}
printf("%d\n", max);
return 0;
}
| [
"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 > 0)
max += diff;
}
printf("%d\n", max);
return 0;
}
| #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 > 0)
max += diff;
}
printf("%d\n", max);
return 0;
}
| [
"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) {
reward += V[i] - C[i];
}
}
cout << reward;
}
| #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) {
reward += V[i] - C[i];
}
}
cout << reward << endl;
}
| [
"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) {
reward += V[i] - C[i];
}
}
cout << reward;
}
| #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) {
reward += V[i] - C[i];
}
}
cout << reward << endl;
}
| [
"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.