problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03060 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
int v[60], c[60], ans = 0;
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++)
ans += max(0, v[i] - c[i]);
cout << ans << endl;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
int v[60], c[60], ans = 0;
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++)
ans += max(0, v[i] - c[i]);
cout << ans << endl;
}
| [] | 872,835 | 872,836 | u661461084 | cpp |
p03060 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
int v[60], c[60], ans = 0;
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++)
ans += min(0, v[i] - c[i]);
cout << ans << endl;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
int v[60], c[60], ans = 0;
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++)
ans += max(0, v[i] - c[i]);
cout << ans << endl;
}
| [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 872,837 | 872,836 | u661461084 | cpp |
p03060 | #include <iostream>
using namespace std;
int main() {
int n, ans;
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])
ans += (v[i] - c[i]);
cout << ans;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n, ans = 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])
ans += (v[i] - c[i]);
cout << ans;
return 0;
}
| [
"variable_declaration.value.change"
] | 872,840 | 872,841 | u340494803 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> V(N);
vector<int> C(N);
int S;
for (int i = 0; i < N; i++) {
cin >> V[i];
}
for (int i = 0; i < N; i++) {
cin >> C[i];
S += max(V[i] - C[i], 0);
}
cout << S << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> V(N);
vector<int> C(N);
int S = 0;
for (int i = 0; i < N; i++) {
cin >> V[i];
}
for (int i = 0; i < N; i++) {
cin >> C[i];
S += max(V[i] - C[i], 0);
}
cout << S << endl;
} | [
"variable_declaration.value.change"
] | 872,846 | 872,847 | u593555034 | cpp |
p03060 | #include <bits/stdc++.h>
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) {
if (V[i] > C[i])
ans += V[i] - C[i];
}
cout << ans;
} | #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[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])
ans += V[i] - C[i];
}
cout... | [] | 872,856 | 872,857 | u614576698 | cpp |
p03060 | #include <assert.h>
#include <bits/stdc++.h>
#include <time.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// s... | #include <assert.h>
#include <bits/stdc++.h>
#include <time.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// s... | [
"variable_declaration.value.change",
"expression.operation.unary.remove"
] | 872,864 | 872,865 | u375267383 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
struct a {
int value;
int cost;
};
bool cmp(struct a a1, struct a a2) {
float x = (a1.value / a1.cost), y = (a2.value / a2.cost);
return (x > y);
}
int main() {
int n;
cin >> n;
struct a v[n];
for (int i = 0; i < n; i++) {
cin >> v[i].value;
}
fo... | #include <bits/stdc++.h>
using namespace std;
struct a {
int value;
int cost;
};
bool cmp(struct a a1, struct a a2) {
float x = (a1.value - a1.cost), y = (a2.value - a2.cost);
return (x > y);
}
int main() {
int n;
cin >> n;
struct a v[n];
for (int i = 0; i < n; i++) {
cin >> v[i].value;
}
fo... | [
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 872,870 | 872,871 | u460465799 | cpp |
p03060 | #include <iostream>
using namespace std;
#define MAX(X, Y) ((X) > (Y) ? (X) : (Y))
int main(void) {
int ans, n, v[100], c[100];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> v[i];
}
for (int i = 0; i < n; i++) {
cin >> c[i];
ans += MAX(v[i] - c[i], 0);
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
#define MAX(X, Y) ((X) > (Y) ? (X) : (Y))
int main(void) {
int ans, n, v[100], c[100];
cin >> n;
ans = 0;
for (int i = 0; i < n; i++) {
cin >> v[i];
}
for (int i = 0; i < n; i++) {
cin >> c[i];
ans += MAX(v[i] - c[i], 0);
}
cout << ans << endl;
r... | [
"assignment.add"
] | 872,876 | 872,877 | u023463844 | cpp |
p03060 | #include <iostream>
using namespace std;
int main() {
int n, res = 0;
int 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++) {
if (V[i] > C[i]) {
res += (V[i] - C[i]);
}
}
cout << re... | #include <iostream>
using namespace std;
int main() {
int n, res = 0;
int C[20], V[20];
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]) {
res += (V[i] - C[i]);
}
}
cout << re... | [
"identifier.change",
"expression.operation.binary.change"
] | 872,882 | 872,883 | u653388379 | cpp |
p03060 | #include <iostream>
using namespace std;
int main() {
int n, res = 0;
int 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++) {
if (V[i] > C[i]) {
res += V[i] - C[i];
}
}
cout << res;... | #include <iostream>
using namespace std;
int main() {
int n, res = 0;
int C[20], V[20];
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]) {
res += (V[i] - C[i]);
}
}
cout << re... | [
"identifier.change",
"expression.operation.binary.change"
] | 872,884 | 872,883 | u653388379 | cpp |
p03060 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int i, j, n, p, q, temp;
int a, b, t;
int time = 0;
int flag = 0;
string s;
cin >> n;
int v[n];
int c[n];
for (i = 0; i < n; i++) {
cin >> v[i];
}
for (i = 0; i < n; i++) {
cin ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int i, j, n, p, q, temp;
int a, b, t;
int time = 0;
int flag = 0;
string s;
cin >> n;
int v[n];
int c[n];
for (i = 0; i < n; i++) {
cin >> v[i];
}
for (i = 0; i < n; i++) {
cin ... | [] | 872,887 | 872,888 | u942591696 | cpp |
p03060 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, s, a[20], b;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b, s += max(a[i] - b, 0);
cout << s << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, s = 0, a[20], b;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b, s += max(a[i] - b, 0);
cout << s << endl;
} | [
"variable_declaration.value.change"
] | 872,895 | 872,896 | u317177661 | cpp |
p03060 | #include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include ... | #include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include ... | [] | 872,899 | 872,900 | u221758210 | cpp |
p03060 | #include <algorithm>
#include <cmath>
#include <complex> // complex<double> a(1.2 , 2.3);// real(): 1.2, imag()2.3
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define MOD 1000000007
#define ll long long
#define ld long double
#define ... | #include <algorithm>
#include <cmath>
#include <complex> // complex<double> a(1.2 , 2.3);// real(): 1.2, imag()2.3
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define MOD 1000000007
#define ll long long
#define ld long double
#define ... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 872,901 | 872,902 | u866107333 | cpp |
p03060 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
#pragma GCC optimize("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
#pragma GCC optimize("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 872,909 | 872,910 | u687529684 | cpp |
p03060 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
#pragma GCC optimize("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
#pragma GCC optimize("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 872,911 | 872,910 | u687529684 | cpp |
p03060 | #include <iostream>
int main() {
int n;
int v[20];
int c[20];
int vc[20];
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> v[i];
}
for (int i = 0; i < n; i++) {
std::cin >> c[i];
vc[i] = v[i] - c[i];
}
int maxVc = 0;
for (int i = 1; i < n; i++) {
maxVc += (vc[i] > 0) ? (vc... | #include <iostream>
int main() {
int n;
int v[20];
int c[20];
int vc[20];
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> v[i];
}
for (int i = 0; i < n; i++) {
std::cin >> c[i];
vc[i] = v[i] - c[i];
}
int maxVc = 0;
for (int i = 0; i < n; i++) {
maxVc += (vc[i] > 0) ? (vc... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 872,914 | 872,915 | u619101331 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
vector<int> V(N);
vector<int> C(N);
int P = 0;
cin >> N;
// N個の宝石の価値を代入する
for (int i = 0; i < N; i++) {
cin >> V.at(i);
}
// N個の宝石のコストを代入する
for (int i = 0; i < N; i++) {
cin >> C.at(i);
}
//宝石の価値とコストを比較する
// 0以上であれば利... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
vector<int> V(21);
vector<int> C(21);
int P = 0;
cin >> N;
// N個の宝石の価値を代入する
for (int i = 0; i < N; i++) {
cin >> V.at(i);
}
// N個の宝石のコストを代入する
for (int i = 0; i < N; i++) {
cin >> C.at(i);
}
//宝石の価値とコストを比較する
// 0以上であれ... | [] | 872,916 | 872,917 | u116136539 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ans = 0;
cin >> N;
vector<int> vec1, vec2;
for (int i = 0; i < N; i++)
cin >> vec1[i];
for (int j = 0; j < N; j++)
cin >> vec2[j];
for (int k = 0; k < N; k++) {
if (vec1[k] > vec2[k]) {
ans += vec1[k];
ans -= vec2[k];... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ans = 0;
cin >> N;
vector<int> vec1(20), vec2(20);
for (int i = 0; i < N; i++)
cin >> vec1[i];
for (int j = 0; j < N; j++)
cin >> vec2[j];
for (int k = 0; k < N; k++) {
if (vec1[k] > vec2[k]) {
ans += vec1[k];
ans -= ... | [
"call.arguments.add"
] | 872,924 | 872,925 | u732571394 | cpp |
p03060 | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> V(N), C(N);
for (int i = 0; i < N; i++)
V[i];
for (int i = 0; i < N; i++)
C[i];
int ans = 0;
for (int i = 0; i < N; i++) {
... | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#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 ans = 0;
for (int i = 0; i ... | [
"expression.operation.binary.add"
] | 872,932 | 872,933 | u152315108 | cpp |
p03060 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++... | [
"assignment.value.change"
] | 872,936 | 872,937 | u277556971 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (ll i = a; i < b; i++)
int main() {
int n;
cin >> n;
int ans = 0;
vector<int> v, c;
rep(i, 0, n) { cin >> v[i]; }
rep(i, 0, n) {
cin >> c[i];
if (v[i] > c[i])
ans += v[i] - c[i];
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (ll i = a; i < b; i++)
int main() {
int n;
cin >> n;
int ans = 0;
vector<int> v(n), c(n);
rep(i, 0, n) { cin >> v[i]; }
rep(i, 0, n) {
cin >> c[i];
if (v[i] > c[i])
ans += v[i] - c[i];
}
cout << an... | [] | 872,953 | 872,954 | u356489231 | cpp |
p03060 | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int v[n], c[n];
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int v[n], c[n];
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 872,958 | 872,959 | u627431737 | cpp |
p03060 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int V[n];
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];
}
for (int i = 0; i < n; i++) {
if (V[i] - C[i] > 0) {
ans += V[i] - C[i];
}
... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int V[n];
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];
}
for (int i = 0; i < n; i++) {
if (V[i] - C[i] > 0) {
ans += V[i] - C[i];
}
... | [] | 872,960 | 872,961 | u875367173 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef long long ll;
#define MOD 1000000007
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef long long ll;
#define MOD 1000000007
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 872,962 | 872,963 | u962104148 | cpp |
p03060 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define int long long
using namespace std;
signed main() {
int n;
int v[20] = {0};
int c[20] = {0};
int ans;
c... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define int long long
using namespace std;
signed main() {
int n;
int v[20] = {0};
int c[20] = {0};
int ans = 0;... | [
"variable_declaration.value.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 872,968 | 872,969 | u783922005 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fw(p) for (int w = 0; w < (p); w++)
#define fx(p) for (int x = 0; x < (p); x++)
#define fy(p) for (int y = 0; y < (p); y++)
#define fz(p) for (int z = 0; z < (p); z++)
#define fyg(p, g) for (int y = (g); y < (p); y++)
#define fzg(p, g) for (int ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fw(p) for (int w = 0; w < (p); w++)
#define fx(p) for (int x = 0; x < (p); x++)
#define fy(p) for (int y = 0; y < (p); y++)
#define fz(p) for (int z = 0; z < (p); z++)
#define fyg(p, g) for (int y = (g); y < (p); y++)
#define fzg(p, g) for (int ... | [
"control_flow.loop.condition.change"
] | 872,984 | 872,985 | u824327013 | cpp |
p03060 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int V[N];
int C[N];
int sum = 0;
int i;
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]) {
sum += V[i] - C[i];
}
}
cout << su... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int V[N];
int C[N];
int sum = 0;
int i;
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] >= 0) {
sum += V[i] - C[i];
}
}
cout ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 872,990 | 872,991 | u288042356 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> worth(N);
for (int i = 0; i < N; i++) {
cin >> worth.at(i);
}
vector<int> cost(N);
for (int i = 0; i < N; i++) {
cin >> cost.at(i);
}
int m = 0;
for (int i = 0; i < N; i++) {
if ((worth.at(i) - cost... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> worth(N);
for (int i = 0; i < N; i++) {
cin >> worth.at(i);
}
vector<int> cost(N);
for (int i = 0; i < N; i++) {
cin >> cost.at(i);
}
int m = 0;
for (int i = 0; i < N; i++) {
if ((worth.at(i) - cost... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 872,992 | 872,993 | u425834921 | cpp |
p03060 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
int ans = 0;
vector<int> diff;
cin >> n;
diff.resize(n);
for (int i = 0; i < n; i++) {
cin >> diff[i];
}
for (int j = 0; j < n; j++) {
int tmp;
cin >> tmp;
diff[j] -= tmp;
}
sort(... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
int ans = 0;
vector<int> diff;
cin >> n;
diff.resize(n);
for (int i = 0; i < n; i++) {
cin >> diff[i];
}
for (int j = 0; j < n; j++) {
int tmp;
cin >> tmp;
diff[j] -= tmp;
}
sort(... | [
"expression.operation.binary.remove"
] | 872,994 | 872,995 | u791687581 | cpp |
p03060 | #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int 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) ans += max(v[i] - c[i], 0);
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> v(n), c(n);
rep(i, n) cin >> v[i];
rep(i, n) cin >> c[i];
int ans = 0;
rep(i, n) ans += max(v[i] - c[i], 0);
cout << ans << endl;
return 0;
} | [] | 873,002 | 873,003 | u457283867 | cpp |
p03060 | #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int 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) ans = max(v[i] - c[i], 0);
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> v(n), c(n);
rep(i, n) cin >> v[i];
rep(i, n) cin >> c[i];
int ans = 0;
rep(i, n) ans += max(v[i] - c[i], 0);
cout << ans << endl;
return 0;
} | [
"assignment.value.change"
] | 873,004 | 873,003 | u457283867 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
int main() {
#ifdef DEBUG
std::ifstream in("/home/share/inputf.in");
std::cin.rdbuf(in.rdbuf());
#endif
int N, ans;
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];
}
for (i... | #include <bits/stdc++.h>
using namespace std;
int main() {
#ifdef DEBUG
std::ifstream in("/home/share/inputf.in");
std::cin.rdbuf(in.rdbuf());
#endif
int N, ans = 0;
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];
}
fo... | [
"variable_declaration.value.change"
] | 873,005 | 873,006 | u936555566 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b = 0;
cin >> a;
vector<int> v(a), c(a);
for (int i = 0; i < a; i++) {
cin >> v[i];
}
for (int i = 0; i < a; i++) {
cin >> c[i];
}
for (int i = 0; i < a; i++) {
if (0 < (v[i] - c[i]))
;
b += (v[i] - c[i]);
}
cou... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b = 0;
cin >> a;
vector<int> v(a), c(a);
for (int i = 0; i < a; i++) {
cin >> v[i];
}
for (int i = 0; i < a; i++) {
cin >> c[i];
}
for (int i = 0; i < a; i++) {
if (0 < v[i] - c[i]) {
b = b + (v[i] - c[i]);
}
}
... | [
"control_flow.branch.if.condition.change",
"assignment.value.change",
"assignment.change"
] | 873,009 | 873,010 | u618604643 | cpp |
p03060 | #include <cstdio>
using namespace std;
int main() {
int n;
int c[32], v[32];
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &c[i]);
for (int i = 0; i < n; i++)
scanf("%d", &v[i]);
int ans = 0;
for (int i = 0; i < n; i++)
if (c[i] < v[i])
ans += v[i] - c[i];
printf("%d\n", an... | #include <cstdio>
using namespace std;
int main() {
int n;
int c[32], v[32];
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]);
int ans = 0;
for (int i = 0; i < n; i++)
if (c[i] < v[i])
ans += v[i] - c[i];
printf("%d\n", an... | [
"identifier.change",
"call.arguments.change"
] | 873,017 | 873,018 | u208929451 | cpp |
p03060 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rept(i, a, b)... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rept(i, a, b)... | [] | 873,023 | 873,024 | u569041543 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
std::vector<int> value(N);
for (int i = 0; i < N; i++) {
cin >> value.at(i);
}
int cost;
for (int i = 0; i < N; i++) {
cin >> cost;
value.at(i) -= cost;
}
int res;
for (int i = 0; i < N; i++) {
if (value.at... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
std::vector<int> value(N);
for (int i = 0; i < N; i++) {
cin >> value.at(i);
}
int cost;
for (int i = 0; i < N; i++) {
cin >> cost;
value.at(i) -= cost;
}
int res = 0;
for (int i = 0; i < N; i++) {
if (valu... | [
"variable_declaration.value.change"
] | 873,029 | 873,030 | u578276786 | cpp |
p03060 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
//#include "h.h"
using namespace std;
#define ll long long
#define pint pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
//#include "h.h"
using namespace std;
#define ll long long
#define pint pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 873,033 | 873,034 | u285598935 | cpp |
p03060 | #include <cfenv>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int V[20], C[20];
int main() {
int N;
cin >> 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; N; ++i) {
int a = V[i] - C[i];
if (a > ... | #include <cfenv>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int V[20], C[20];
int main() {
int N;
cin >> 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) {
int a = V[i] - C[i];
if (... | [
"control_flow.loop.for.condition.change"
] | 873,038 | 873,039 | u970307143 | cpp |
p03060 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int v[n];
int c[n];
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++) {
v_... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int v[n];
int c[n];
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++) {
v_... | [
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 873,040 | 873,041 | u115819033 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
long long T = 0;
vector<int> V(N);
vector<int> C(N);
for (int i = 0; i < N; ++i) {
cin >> V[i];
}
for (int x = 0; x < N; ++x) {
cin >> C[x];
}
for (int y = 0; y < N; ++y) {
if (V[y] - C[y] > 0) {
T = T + (V[y] -... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long T = 0;
vector<int> V(N);
vector<int> C(N);
for (int i = 0; i < N; ++i) {
cin >> V[i];
}
for (int x = 0; x < N; ++x) {
cin >> C[x];
}
for (int y = 0; y < N; ++y) {
if (V[y] - C[y] > 0) {
T =... | [] | 873,046 | 873,047 | u491044700 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n), c(n);
for (int i = 0; i < 2; i++) {
cin >> a.at(i);
}
for (int i = 0; i < 2; i++) {
cin >> b.at(i);
}
for (int i = 0; i < 2; i++) {
c.at(i) = a.at(i) - b.at(i);
}
int x = 0;
for (int ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n), c(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++) {
c.at(i) = a.at(i) - b.at(i);
}
int x = 0;
for (int ... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 873,054 | 873,055 | u646051775 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n), c(n);
for (int i = 0; i < 2; i++) {
cin >> a.at(i);
}
for (int i = 0; i < 2; i++) {
cin >> b.at(i);
}
for (int i = 0; i < 2; i++) {
c.at(i) = a.at(i) - b.at(i);
}
int x = 0;
for (int ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n), c(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++) {
c.at(i) = a.at(i) - b.at(i);
}
int x = 0;
for (int ... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 873,056 | 873,055 | u646051775 | cpp |
p03060 | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, i, sum = 0;
cin >> N;
int V[N], C[N], S[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++)
S[i] = V[i] - C[i];... | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, i, sum = 0;
cin >> N;
int V[N], C[N], S[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++)
S[i] = V[i] - C[i];... | [
"control_flow.loop.condition.change"
] | 873,064 | 873,065 | u313403396 | cpp |
p03060 | #include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
vector<int> v, c;
int n, x, ans = 0;
for (int i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
}
for (int i = 0; i < n; i++) {
cin >> x;
c.push_back(x);
}
for (int i = 0; i < n; i++) {
if (v[i] > c... | #include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
vector<int> v, c;
int n, x, ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
}
for (int i = 0; i < n; i++) {
cin >> x;
c.push_back(x);
}
for (int i = 0; i < n; i++) {
... | [] | 873,068 | 873,069 | u817141277 | cpp |
p03060 | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define NN 100010
int main(void) {
int i, k, id, N, K;
scanf("%d", &N);
int X[NN];
int c, benefit, sum = 0;
for (i = 0; i < N; i++)
scanf("%01d", &X[i]);
for (i = 0; i < N; i++) {
scanf("%01d", &c);
benefit = X[i] - c... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define NN 100010
int main(void) {
int i, k, id, N, K;
scanf("%d", &N);
int X[NN];
int c, benefit, sum = 0;
for (i = 0; i < N; i++)
scanf("%d", &X[i]);
for (i = 0; i < N; i++) {
scanf("%d", &c);
benefit = X[i] - c;
... | [
"literal.string.change",
"call.arguments.change"
] | 873,073 | 873,074 | u537752005 | cpp |
p03060 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep1(i, n) for (int i = 1; ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep1(i, n) for (int i = 1; ... | [
"identifier.change",
"call.function.change",
"io.output.newline.add"
] | 873,085 | 873,086 | u228214259 | cpp |
p03060 | #include <algorithm>
#include <climits>
#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 = INT_MIN;
for (int i = 0; ... | #include <algorithm>
#include <climits>
#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 = INT_MIN;
for (int i = 0; ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 873,087 | 873,088 | u150861392 | cpp |
p03060 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1 << 30)
#define INFLL (1ll << 60)
typedef pair<int, int> P;
typedef pair<int, P> E;
#define MOD (1000000007ll)
#define l_ength size
void mul_mod(ll &a, ll b) {
a *= b;
a %= MOD;
}
void add_mod(ll &a, ll b) {
a += b;
a %= MOD;
}
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1 << 30)
#define INFLL (1ll << 60)
typedef pair<int, int> P;
typedef pair<int, P> E;
#define MOD (1000000007ll)
#define l_ength size
void mul_mod(ll &a, ll b) {
a *= b;
a %= MOD;
}
void add_mod(ll &a, ll b) {
a += b;
a %= MOD;
}
... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 873,089 | 873,090 | u548624367 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
int x[50], y[50];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &x[i]);
}
for (int i = 0; i < n; i++) {
scanf("%d", &y[i]);
}
int xs = 0, ys = 0;
for (int i = 0; i < n; i++) {
if (x[i] < y[i]) {
xs += x[i];
... | #include <bits/stdc++.h>
using namespace std;
int x[50], y[50];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &x[i]);
for (int i = 0; i < n; i++)
scanf("%d", &y[i]);
int xs = 0, ys = 0;
for (int i = 0; i < n; i++) {
if (x[i] > y[i]) {
xs += x[i];
ys += ... | [
"control_flow.loop.for.remove",
"call.remove",
"call.add",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 873,097 | 873,098 | u521747257 | cpp |
p03060 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define INF 10e17 // 4倍しても(4回足しても)long longを溢れない
#define rep(i, n) ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define INF 10e17 // 4倍しても(4回足しても)long longを溢れない
#define rep(i, n) ... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 873,102 | 873,103 | u898749314 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, max1 = 0, A = 0;
cin >> N;
vector<int> V(N);
vector<int> C(N);
vector<int> D(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++) {
D.at(i) = V.at... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, max1 = 0, A = 0;
cin >> N;
vector<int> V(N);
vector<int> C(N);
vector<int> D(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++) {
D.at(i) = V.at... | [
"assignment.change"
] | 873,111 | 873,112 | u466393447 | cpp |
p03060 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, temp;
int V[51];
int C[51];
int S[51];
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++) {... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, temp;
int V[51];
int C[51];
int S[51];
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++) {... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 873,135 | 873,136 | u066926272 | cpp |
p03060 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, Vn, Cn, sumv = 0, sumc = 0, h, ans = 0;
vector<int> v;
vector<int> c;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> Vn;
v.push_back(Vn);
}
for (int i = 0; i < N; i++) {
cin >> Cn;
c.push_back(Cn);
}
for (in... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, Vn, Cn, sumv, sumc, h, ans = 0;
vector<int> v;
vector<int> c;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> Vn;
v.push_back(Vn);
}
for (int i = 0; i < N; i++) {
cin >> Cn;
c.push_back(Cn);
}
for (int i = 0;... | [
"assignment.value.change"
] | 873,141 | 873,142 | u715722875 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, total = 0;
cin >> n;
vector<ll> 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 = 1; i < n + 1; i++)
total += max(0ll, v[i] - c[i]);
cout << total <<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, total = 0;
cin >> n;
vector<ll> 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++)
total += max(0ll, v[i] - c[i]);
cout << total << end... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 873,143 | 873,144 | u339443002 | cpp |
p03060 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans;
cin >> n;
vector<int> c(n), v(n);
for (int i = 0; i < n; ++i) {
cin >> v.at(i);
}
for (int i = 0; i < n; ++i) {
cin >> c.at(i);
if (v.at(i) - c.at(i) > 0) {
ans += v.at(i) - c.at(i);
}
}
cout << ans << endl;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
vector<int> c(n), v(n);
for (int i = 0; i < n; ++i) {
cin >> v.at(i);
}
for (int i = 0; i < n; ++i) {
cin >> c.at(i);
if (v.at(i) - c.at(i) > 0) {
ans += v.at(i) - c.at(i);
}
}
cout << ans << end... | [
"variable_declaration.value.change"
] | 873,145 | 873,146 | u320241053 | cpp |
p03060 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int v[n];
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++) {
if (v[i] - c[i])
ans += v[i] - c[i];
}
cout << ans << ... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int v[n];
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++) {
if ((v[i] - c[i]) > 0)
ans += v[i] - c[i];
}
cout << ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 873,147 | 873,148 | u583474035 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unor... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-07-24 17:01:24
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <... | [] | 873,154 | 873,155 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unor... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-07-24 17:01:24
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <... | [] | 873,156 | 873,155 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unor... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-07-24 17:01:24
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <... | [] | 873,157 | 873,155 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-07-24 17:01:24
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <... | [] | 873,158 | 873,155 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-07-24 17:01:24
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <... | [] | 873,159 | 873,155 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-07-24 17:01:24
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <... | [] | 873,160 | 873,155 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-07-24 17:01:24
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <... | [] | 873,161 | 873,155 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-07-24 17:01:24
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <... | [] | 873,162 | 873,155 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-07-24 17:01:24
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <... | [] | 873,163 | 873,155 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-07-24 17:01:24
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <... | [] | 873,164 | 873,155 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-07-24 17:01:24
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <... | [] | 873,165 | 873,155 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-07-24 17:01:24
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <... | [] | 873,166 | 873,155 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-07-24 17:01:24
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <... | [] | 873,167 | 873,155 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-07-24 17:01:24
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <... | [] | 873,168 | 873,155 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unor... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-04-28 13:31:51
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include ... | [] | 873,154 | 873,169 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unor... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-04-28 13:31:51
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include ... | [] | 873,156 | 873,169 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unor... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-04-28 13:31:51
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include ... | [] | 873,157 | 873,169 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-04-28 13:31:51
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include ... | [] | 873,158 | 873,169 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-04-28 13:31:51
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include ... | [] | 873,159 | 873,169 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-04-28 13:31:51
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include ... | [] | 873,160 | 873,169 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-04-28 13:31:51
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include ... | [] | 873,161 | 873,169 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-04-28 13:31:51
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include ... | [] | 873,162 | 873,169 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-04-28 13:31:51
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include ... | [] | 873,163 | 873,169 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-04-28 13:31:51
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include ... | [] | 873,164 | 873,169 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-04-28 13:31:51
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include ... | [] | 873,165 | 873,169 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-04-28 13:31:51
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include ... | [] | 873,166 | 873,169 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-04-28 13:31:51
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include ... | [] | 873,167 | 873,169 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-04-28 13:31:51
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include ... | [] | 873,168 | 873,169 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unor... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-04-28 13:31:51
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include ... | [] | 873,154 | 873,170 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unor... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-04-28 13:31:51
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include ... | [] | 873,156 | 873,170 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unor... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-04-28 13:31:51
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include ... | [] | 873,157 | 873,170 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-04-28 13:31:51
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include ... | [] | 873,158 | 873,170 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-04-28 13:31:51
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include ... | [] | 873,159 | 873,170 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-04-28 13:31:51
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include ... | [] | 873,160 | 873,170 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-04-28 13:31:51
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include ... | [] | 873,161 | 873,170 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-04-28 13:31:51
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include ... | [] | 873,162 | 873,170 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-04-28 13:31:51
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include ... | [] | 873,163 | 873,170 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-04-28 13:31:51
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include ... | [] | 873,164 | 873,170 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-04-28 13:31:51
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include ... | [] | 873,165 | 873,170 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-04-28 13:31:51
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include ... | [] | 873,166 | 873,170 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-04-28 13:31:51
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include ... | [] | 873,167 | 873,170 | u095266283 | cpp |
p03061 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-04-28 13:31:51
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include ... | [] | 873,168 | 873,170 | u095266283 | cpp |
p03061 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
vector<long> L(N); // 対象の番号より小さい番号のGCD
vector<long> R(N); // 対象の番号より大きい番号のGCD
L.at(0) = 0;
L.at(1) = A.at(0);
R.at(N - 1) = 0;
R... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
vector<long> L(N); // 対象の番号より小さい番号のGCD
vector<long> R(N); // 対象の番号より大きい番号のGCD
L.at(0) = 0;
L.at(1) = A.at(0);
R.at(N - 1) = 0;
R... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change"
] | 873,177 | 873,178 | u538283043 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.