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 |
|---|---|---|---|---|---|---|---|
p03012 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pf(n) printf("%d\n", n)
typedef long long ll;
typedef pair<ll, ll> p;
const in... | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pf(n) printf("%d\n", n)
typedef long long ll;
typedef pair<ll, ll> p;
const in... | [
"literal.number.change",
"variable_declaration.value.change"
] | 823,962 | 823,963 | u770486670 | cpp |
p03012 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pf(n) printf("%lld\n", n)
typedef long long ll;
typedef pair<ll, ll> p;
const ... | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pf(n) printf("%d\n", n)
typedef long long ll;
typedef pair<ll, ll> p;
const in... | [
"preprocessor.define.value.change",
"literal.number.change",
"variable_declaration.value.change"
] | 823,964 | 823,963 | u770486670 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> W(N);
for (int i = 0; i < N; i++)
cin >> W[i];
vector<int> sum(N + 1, 0);
for (int i = 0; i < N; i++)
sum[i + 1] = sum[i] + W[i];
int ans = 100000000;
for (int i = 1; i < (N - 1); i++) {
ans = min(a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> W(N);
for (int i = 0; i < N; i++)
cin >> W[i];
vector<int> sum(N + 1, 0);
for (int i = 0; i < N; i++)
sum[i + 1] = sum[i] + W[i];
int ans = 100000000;
for (int i = 1; i < N; i++) {
ans = min(ans, ab... | [
"control_flow.loop.for.condition.change"
] | 823,969 | 823,970 | u084069244 | cpp |
p03012 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
tree_order_statistics_node_update>
oset;
#define sim template <class c
#defi... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
tree_order_statistics_node_update>
oset;
#define sim template <class c
#defi... | [
"expression.operation.binary.remove"
] | 823,977 | 823,978 | u306697932 | cpp |
p03012 | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#include <climits>
#include <cstring>
#include <fstream>
#include <immintrin.h>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#ifdef _MSC_VE... | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#include <climits>
#include <cstring>
#include <fstream>
#include <immintrin.h>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#ifdef _MSC_VE... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"assignment.change"
] | 823,990 | 823,991 | u034865202 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 10000, sum_w = 0, x = 0;
vector<int> w(100);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> w[i];
sum_w += w[i];
}
for (int i = 0; i < n - 1; i++) {
x += w[i];
ans = min(ans, abs(x - sum_w));
}
cout << ans << endl;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 10000, sum_w = 0, x = 0;
vector<int> w(100);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> w[i];
sum_w += w[i];
}
for (int i = 0; i < n - 1; i++) {
x += w[i];
ans = min(ans, abs(2 * x - sum_w));
}
cout << ans << e... | [
"assignment.change"
] | 823,992 | 823,993 | u652660628 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> w(n);
for (int i = 0; i < n; i++)
cin >> w[i];
int weigh = 100000000;
for (int i = 0; i < n - 2; i++) {
int now_up = 0;
int now_down = 0;
for (int j = 0; j <= i; j++) {
now_down += w[j];
}
f... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> w(n);
for (int i = 0; i < n; i++)
cin >> w[i];
int weigh = 100000000;
for (int i = 0; i < n - 1; i++) {
int now_up = 0;
int now_down = 0;
for (int j = 0; j <= i; j++) {
now_down += w[j];
}
f... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 823,997 | 823,998 | u297195722 | cpp |
p03012 | #include <bits/stdc++.h>
#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;
cin >> n;
vector<int> w(n);
rep(i, n) cin >> w[i];
int ans = 100000;
for (int i = 1; i < n - 1; i++) {
int left = 0;
int right = 0;
f... | #include <bits/stdc++.h>
#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;
cin >> n;
vector<int> w(n);
rep(i, n) cin >> w[i];
int ans = 100000;
for (int i = 1; i < n; i++) {
int left = 0;
int right = 0;
for (... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 824,013 | 824,014 | u448922807 | cpp |
p03012 | #include <bits/stdc++.h>
#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;
cin >> n;
vector<int> w(n);
rep(i, n) cin >> w[i];
int ans = 10000;
for (int i = 1; i < n - 1; i++) {
int left = 0;
int right = 0;
fo... | #include <bits/stdc++.h>
#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;
cin >> n;
vector<int> w(n);
rep(i, n) cin >> w[i];
int ans = 100000;
for (int i = 1; i < n; i++) {
int left = 0;
int right = 0;
for (... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 824,015 | 824,014 | u448922807 | cpp |
p03012 | #include <bits/stdc++.h>
#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;
cin >> n;
vector<int> w(n);
rep(i, n) cin >> w[i];
int ans = 1000;
for (int i = 1; i < n - 1; i++) {
int left = 0;
int right = 0;
for... | #include <bits/stdc++.h>
#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;
cin >> n;
vector<int> w(n);
rep(i, n) cin >> w[i];
int ans = 100000;
for (int i = 1; i < n; i++) {
int left = 0;
int right = 0;
for (... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 824,016 | 824,014 | u448922807 | cpp |
p03012 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const ll mod = 1000000007;
const ll INF = 1001001001;
const ll LINF = 1001001001001001001;
void prvec(vector<ll> vec) { // for debug
ll n = vec.size();
co... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const ll mod = 1000000007;
const ll INF = 1001001001;
const ll LINF = 1001001001001001001;
void prvec(vector<ll> vec) { // for debug
ll n = vec.size();
co... | [] | 824,021 | 824,022 | u628597699 | cpp |
p03011 | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
#include <list>
#include <map>
#in... | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
#include <list>
#include <map>
#in... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 824,029 | 824,030 | u937608388 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n, w[101], ans;
cin >> n;
w[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> w[i];
w[i] += w[i - 1];
ans += w[i];
}
for (int i = 0; i < n; i++) {
ans = min(ans, abs((w[n] - w[i + 1]) - w[i + 1]));
}
cout << ans << endl;
... | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n, w[101], ans;
cin >> n;
w[0] = 0;
ans = 0;
for (int i = 1; i <= n; i++) {
cin >> w[i];
w[i] += w[i - 1];
ans += w[i];
}
for (int i = 0; i < n; i++) {
ans = min(ans, abs((w[n] - w[i + 1]) - w[i + 1]));
}
cout << ans... | [
"assignment.add"
] | 824,043 | 824,044 | u899084195 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 12;
int main() {
int N;
cin >> N;
vector<int> W(N);
for (int i = 0; i < N; i++)
cin >> W[i];
vector<int> XW(N + 1, 0);
for (int i = 1; i <= N; i++)
XW[i] = XW[i - 1] + W[i - 1];
int ans = INF;
for (int i = 1; i < N; i++)
an... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 12;
int main() {
int N;
cin >> N;
vector<int> W(N);
for (int i = 0; i < N; i++)
cin >> W[i];
vector<int> XW(N + 1, 0);
for (int i = 1; i <= N; i++)
XW[i] = XW[i - 1] + W[i - 1];
int ans = INF;
for (int i = 1; i < N; i++)
an... | [
"call.add",
"call.arguments.change"
] | 824,051 | 824,052 | u805277811 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 12;
int main() {
int N;
cin >> N;
vector<int> W(N);
for (int i = 0; i < N; i++)
cin >> W[i];
vector<int> XW(N + 1, 0);
for (int i = 1; i <= N; i++)
XW[i] = XW[i - 1] + W[i - 1];
int ans = INF;
for (int i = 1; i < N; i++)
an... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 12;
int main() {
int N;
cin >> N;
vector<int> W(N);
for (int i = 0; i < N; i++)
cin >> W[i];
vector<int> XW(N + 1, 0);
for (int i = 1; i <= N; i++)
XW[i] = XW[i - 1] + W[i - 1];
int ans = INF;
for (int i = 1; i < N; i++)
an... | [
"call.add",
"assignment.change",
"call.arguments.change"
] | 824,053 | 824,052 | u805277811 | cpp |
p03012 | #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> w(n);
rep(i, n) cin >> w[i];
vector<int> s(n + 1);
rep(i, n) s[i + 1] = s[i] + w[i];
int ans;
rep(t, n - 1) {
int s1 = s[t + 1];
int s2 = s[n] - s[t + 1];
... | #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> w(n);
rep(i, n) cin >> w[i];
vector<int> s(n + 1);
rep(i, n) s[i + 1] = s[i] + w[i];
int ans = 100000;
rep(t, n - 1) {
int s1 = s[t + 1];
int s2 = s[n] - s[t +... | [
"variable_declaration.value.change"
] | 824,067 | 824,068 | u556120601 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
int s[105];
int main() {
int N;
cin >> N;
int w;
int ans = 1e9;
int i;
for (i = 0; i < N; i++) {
cin >> w;
s[i + 1] = s[i] + w;
}
for (i = 0; i < N; i++)
ans = min(ans, abs(s[N] - s[i]));
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int s[105];
int main() {
int N;
cin >> N;
int w;
int ans = 1e9;
int i;
for (i = 0; i < N; i++) {
cin >> w;
s[i + 1] = s[i] + w;
}
for (i = 0; i < N; i++)
ans = min(ans, abs(s[N] - 2 * s[i]));
cout << ans << endl;
} | [
"assignment.change"
] | 824,069 | 824,070 | u983681697 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int w[110];
for (int i = 0; i < n; i++)
cin >> w[i];
int ans = 100000;
for (int i = 0; i < n - 1; i++) {
int s1, s2, d;
for (int j = 0; j <= i; j++) {
s1 += w[j];
}
for (int j = i + 1; j < n; j++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int w[110];
for (int i = 0; i < n; i++)
cin >> w[i];
int ans = 100000;
for (int i = 0; i < n - 1; i++) {
int s1 = 0, s2 = 0, d = 0;
for (int j = 0; j <= i; j++) {
s1 += w[j];
}
for (int j = i + 1; j < n;... | [
"variable_declaration.value.change"
] | 824,071 | 824,072 | u739489568 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int w[110];
for (int i = 0; i < n; i++)
cin >> w[i];
int ans = 100000;
for (int i = 0; i < n - 1; i++) {
int s1, s2, d;
for (int j = 0; j <= i; j++) {
s1 += w[j];
}
for (int j = i + 1; j < n; j++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int w[110];
for (int i = 0; i < n; i++)
cin >> w[i];
int ans = 100000;
for (int i = 0; i < n - 1; i++) {
int s1 = 0, s2 = 0, d = 0;
for (int j = 0; j <= i; j++) {
s1 += w[j];
}
for (int j = i + 1; j < n;... | [
"variable_declaration.value.change"
] | 824,071 | 824,073 | u739489568 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
using ll = long long; // ll は long long と同じとする。
int main() {
int N;
vector<int> W(N);
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> W.at(i);
sum += W.at(i);
}
int num = sum;
int mum = 0;
for (int i = 0; i < N; i++) {
cin >> W.at(i);
mum +... | #include <bits/stdc++.h>
using namespace std;
using ll = long long; // ll は long long と同じとする。
int main() {
int N;
cin >> N;
vector<int> W(N);
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> W.at(i);
sum += W.at(i);
}
int num = sum;
int mum = 0;
for (int i = 0; i < N; i++) {
cin >> W.at(i... | [] | 824,089 | 824,090 | u629548179 | cpp |
p03012 | #include <cstdlib>
#include <iostream>
using namespace std;
int w[100];
int main() {
int n, i, j, t, k, s1 = 0, s2 = 0, s, min = 9999;
cin >> n;
for (i = 0; i < n; i++)
cin >> w[i];
for (t = 0; t < n; t++) {
s1 = s2 = 0;
for (j = 0; j <= t; j++)
s1 = s1 + w[j];
for (k = t + 1; k < n; k++... | #include <cstdlib>
#include <iostream>
using namespace std;
int w[100];
int main() {
int n, i, j, t, k, s1 = 0, s2 = 0, s, min = 9999;
cin >> n;
for (i = 0; i < n; i++)
cin >> w[i];
for (t = 0; t < n; t++) {
s1 = s2 = 0;
for (j = 0; j <= t; j++)
s1 = s1 + w[j];
for (k = t + 1; k < n; k++... | [
"identifier.change",
"io.output.change"
] | 824,095 | 824,096 | u746310630 | cpp |
p03012 | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
#define rep(i, n) for (int i =... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
#define rep(i, n) for (int i =... | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 824,101 | 824,102 | u563710899 | cpp |
p03012 | #include <algorithm>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define rep(i, a, n) fo... | #include <algorithm>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define rep(i, a, n) fo... | [
"call.arguments.change"
] | 824,103 | 824,104 | u407213771 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
int main() {
int N;
cin >> N;
vector<int> A(N);
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> A.at(i);
sum += A.at(i);
}
int sum2 = 0;
int kotae = INT_MAX;
i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
int main() {
int N;
cin >> N;
vector<int> A(N);
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> A.at(i);
sum += A.at(i);
}
int sum2 = 0;
int kotae = INT_MAX;
i... | [
"call.add",
"call.arguments.change"
] | 824,105 | 824,106 | u406647332 | cpp |
p03012 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
template <class t, class u> void chmax(t &a, u b) {
if (a < b)
a = b;
}
template <class t, class u>... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
template <class t, class u> void chmax(t &a, u b) {
if (a < b)
a = b;
}
template <class t, class u>... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 824,107 | 824,108 | u106635407 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> w(n, 0);
for (int i = 0; i < n; i++) {
cin >> w.at(i);
}
int mn = 10000;
for (int i = 1; i < n; i++) {
int sm1 = 0, sm2 = 0;
for (int j = 0; j < n; j++) {
if (w.at(j) > i) {
sm2 += w.at(j);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> w(n, 0);
for (int i = 0; i < n; i++) {
cin >> w.at(i);
}
int mn = 10000;
for (int i = 1; i < n; i++) {
int sm1 = 0, sm2 = 0;
for (int j = 0; j < n; j++) {
if (j + 1 > i) {
sm2 += w.at(j);
... | [
"control_flow.loop.for.condition.change",
"call.remove",
"control_flow.branch.if.condition.change"
] | 824,109 | 824,110 | u323864528 | cpp |
p03012 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define all(x) (x).begin(), (x).end()
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define yes(n) cout << ((n) ? "yes" : "no") << en... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define all(x) (x).begin(), (x).end()
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define yes(n) cout << ((n) ? "yes" : "no") << en... | [
"call.add",
"call.arguments.change"
] | 824,117 | 824,118 | u964763428 | cpp |
p03012 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> w(n);
rep(i, n) { cin >> w[i]; }
int ans = 10000;
rep(i, n - 1) {
int s_a = 0, s_b = 0;
rep(j, n) {
if (j <= i)
s_a += w[j... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> w(n);
rep(i, n) { cin >> w[i]; }
int ans = 10000;
rep(i, n - 1) {
int s_a = 0, s_b = 0;
rep(j, n) {
if (j <= i)
s_a += w[j... | [] | 824,119 | 824,120 | u009414205 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, x;
cin >> N;
int W[N];
cin >> W[0];
for (int i = 0; i < N; i++) {
cin >> W[i];
W[i] += W[i - 1];
}
x = W[N - 1];
for (int i = 0; i < N; i++)
x = min(x, abs(W[N - 1] - 2 * W[i]));
cout << x << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, x;
cin >> N;
int W[N];
cin >> W[0];
for (int i = 1; i < N; i++) {
cin >> W[i];
W[i] += W[i - 1];
}
x = W[N - 1];
for (int i = 0; i < N; i++)
x = min(x, abs(W[N - 1] - 2 * W[i]));
cout << x << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 824,123 | 824,124 | u820224016 | cpp |
p03012 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
std::cin >> n;
std::vector<int> w(n);
rep(i, n) std::cin >> w[i];
int ans = 1e9;
for (int i = 1; i < n; ++i) {
int l = 0, r = 0;
for (int j = 0; j < i; j++)
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
std::cin >> n;
std::vector<int> w(n);
rep(i, n) std::cin >> w[i];
int ans = 1e9;
for (int i = 1; i < n; ++i) {
int l = 0, r = 0;
for (int j = 0; j < i; j++)
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 824,136 | 824,137 | u589238650 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, sum = 0, ans = INT_MAX;
int su = 0;
cin >> n;
vector<int> l(n);
for (int i = 0; i < n; i++) {
cin >> l.at(i);
}
for (int i = 1; i < n - 1; i++) {
sum = 0;
su = 0;
for (int k = 0; k < i; k++) {
sum += l.at(k);
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, sum = 0, ans = INT_MAX;
int su = 0;
cin >> n;
vector<int> l(n);
for (int i = 0; i < n; i++) {
cin >> l.at(i);
}
for (int i = 1; i < n; i++) {
sum = 0;
su = 0;
for (int k = 0; k < i; k++) {
sum += l.at(k);
}
fo... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 824,156 | 824,157 | u442754977 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j;
cin >> n;
int w[n];
for (i = 0; i < n; i++)
cin >> w[i];
int sum1, sum2, mi = 1000;
for (i = 1; i < n - 1; i++) {
sum1 = 0;
sum2 = 0;
for (j = 0; j < i; j++) {
sum1 += w[j];
}
for (j = i; j < n; j++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j;
cin >> n;
int w[n];
for (i = 0; i < n; i++)
cin >> w[i];
int sum1, sum2, mi = 1000;
for (i = 0; i < n; i++) {
sum1 = 0;
sum2 = 0;
for (j = 0; j < i; j++) {
sum1 += w[j];
}
for (j = i; j < n; j++) {
s... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 824,164 | 824,165 | u952130512 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j;
cin >> n;
int w[n];
for (i = 0; i < n; i++)
cin >> w[i];
int sum1, sum2, mi = 100;
for (i = 1; i < n - 1; i++) {
sum1 = 0;
sum2 = 0;
for (j = 0; j < i; j++) {
sum1 += w[j];
}
for (j = i; j < n; j++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j;
cin >> n;
int w[n];
for (i = 0; i < n; i++)
cin >> w[i];
int sum1, sum2, mi = 1000;
for (i = 0; i < n; i++) {
sum1 = 0;
sum2 = 0;
for (j = 0; j < i; j++) {
sum1 += w[j];
}
for (j = i; j < n; j++) {
s... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 824,166 | 824,165 | u952130512 | cpp |
p03012 | // in the name of god
// if you read this code please search about imam hussain
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define endl "\n";
#define migmig \
ios::sync_with_stdio(false); ... | // in the name of god
// if you read this code please search about imam hussain
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define endl "\n";
#define migmig \
ios::sync_with_stdio(false); ... | [
"assignment.change"
] | 824,174 | 824,175 | u433132072 | cpp |
p03012 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
typedef unsigned long long ll;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define F first
#define S second
using namespace std;
const ll INF = 1e12;
int main() {
int n;
cin >> n... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
typedef unsigned long long ll;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define F first
#define S second
using namespace std;
const ll INF = 1e12;
int main() {
int n;
cin >> n... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 824,180 | 824,181 | u726450206 | cpp |
p03012 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int W[N], minn = 100, SA, sum = 0, sum1, sum2;
for (int i = 0; i < N; i++) {
cin >> W[i];
sum += W... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int W[N], minn = 10000, SA, sum = 0, sum1 = 0, sum2 = 0;
for (int i = 0; i < N; i++) {
cin >> W[i];
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 824,192 | 824,193 | u433048345 | cpp |
p03012 | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define rep(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define scin(a) scanf("%d", &a);
#define scdo(a) scanf("%lf", &a);
#define scch(a) scanf("%s", a);
#define anin(a) printf("%d\n", a);
#define ando(a) printf("%lf\n", a);
#define anch(a... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define rep(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define scin(a) scanf("%d", &a);
#define scdo(a) scanf("%lf", &a);
#define scch(a) scanf("%s", a);
#define anin(a) printf("%d\n", a);
#define ando(a) printf("%lf\n", a);
#define anch(a... | [
"call.add",
"call.arguments.change"
] | 824,210 | 824,211 | u456658814 | cpp |
p03012 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repf(i, a, b) for (int i = (a); i < (b); i++)
#define repi(i, a, b) for (int i = (a); i <= (b); i++)
#define repr(i, a, b) for (int i = (a); i >= (b); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#def... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repf(i, a, b) for (int i = (a); i < (b); i++)
#define repi(i, a, b) for (int i = (a); i <= (b); i++)
#define repr(i, a, b) for (int i = (a); i >= (b); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#def... | [
"call.remove"
] | 824,227 | 824,228 | u850516963 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 1000;
cin >> n;
vector<int> w(n);
for (int i = 0; i < n; i++)
cin >> w.at(i);
for (int i = 0; i < n; i++) {
int l = 0, r = 0;
for (int j = 0; j < n; j++) {
if (j <= i)
l += w.at(j);
else
r += w.a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 1000;
cin >> n;
vector<int> w(n);
for (int i = 0; i < n; i++)
cin >> w.at(i);
for (int i = 1; i < n; i++) {
int l = 0, r = 0;
for (int j = 0; j < n; j++) {
if (j < i)
l += w.at(j);
else
r += w.at... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 824,231 | 824,232 | u113298224 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, a[110], l = 0, r = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
l += a[i];
}
ll ans = l - r;
for (int i = 1; i < n; i++) {
l -= a[i];
r += a[i];
ans = min(ans, abs(l - r));
}
cout << an... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, a[110], l = 0, r = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
l += a[i];
}
ll ans = l - r;
for (int i = 0; i < n; i++) {
l -= a[i];
r += a[i];
ans = min(ans, abs(l - r));
}
cout << an... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 824,241 | 824,242 | u774202056 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
vector<int> list(n);
int s1 = 0;
for (int i = 0; i < n; i++) {
cin >> list.at(i);
s1 += list.at(i);
}
int s2 = 0;
int temp = 1e9;
for (int i = 0; i < n - 1; i++) {
s2 += list.at(i);
s1 -= list.at(i);
temp = min(temp, ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> list(n);
int s1 = 0;
for (int i = 0; i < n; i++) {
cin >> list.at(i);
s1 += list.at(i);
}
int s2 = 0;
int temp = 1e9;
for (int i = 0; i < n - 1; i++) {
s2 += list.at(i);
s1 -= list.at(i);
// co... | [] | 824,245 | 824,246 | u718758485 | cpp |
p03012 | #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define i64 int64_t
#define ff(ii, nn, mm) for (int ii = nn; ii < mm; ii++)
#define st(vvv) sort(vvv.begin(), vvv.end())
#define rvs(vvv) reverse(vvv.begin(), ... | #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define i64 int64_t
#define ff(ii, nn, mm) for (int ii = nn; ii < mm; ii++)
#define st(vvv) sort(vvv.begin(), vvv.end())
#define rvs(vvv) reverse(vvv.begin(), ... | [
"assignment.change"
] | 824,247 | 824,248 | u771541325 | cpp |
p03012 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define N_MAX 100000
#define INF 1000000000
void solv() {
int N;
scanf("%d", &N);
int W[N_MAX];
... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define N_MAX 100000
#define INF 1000000000
void solv() {
int N;
scanf("%d", &N);
int W[N_MAX];
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 824,249 | 824,250 | u103357948 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> W(N);
for (int i = 0; i < N; i++)
cin >> W[i];
int ans = 1e9;
for (int i = 1; i < N - 1; i++) {
int r = 0;
int l = 0;
for (int j = 0; j < i; j++)
l += W[j];
for (int j = i; j < N; j++)
r... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> W(N);
for (int i = 0; i < N; i++)
cin >> W[i];
int ans = 1e9;
for (int i = 1; i < N; i++) {
int r = 0;
int l = 0;
for (int j = 0; j < i; j++)
l += W[j];
for (int j = i; j < N; j++)
r += ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 824,278 | 824,279 | u147556624 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> W(N);
for (int i = 0; i < N; i++)
cin >> W[i];
int ans = 1e9;
for (int i = 1; i < N - 1; i++) {
int r = 0;
int l = 0;
for (int j = 0; j < i; j++)
l += W[j];
for (int j = i; i < N; i++)
r... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> W(N);
for (int i = 0; i < N; i++)
cin >> W[i];
int ans = 1e9;
for (int i = 1; i < N; i++) {
int r = 0;
int l = 0;
for (int j = 0; j < i; j++)
l += W[j];
for (int j = i; j < N; j++)
r += ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"identifier.change",
"expression.operation.binary.change"
] | 824,280 | 824,279 | u147556624 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[200];
int ans = 100000;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 1; i < N - 1; i++) {
int S1 = 0, S2 = 0;
for (int j = 0; j < i; j++) {
S1 += A[j];
}
for (int k = i; k < N; k++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[200];
int ans = 100000;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 1; i < N; i++) {
int S1 = 0, S2 = 0;
for (int j = 0; j < i; j++) {
S1 += A[j];
}
for (int k = i; k < N; k++) {
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 824,285 | 824,286 | u526894223 | cpp |
p03012 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, left, right, ansmin, sum;
cin >> n;
vector<int> w(n);
vector<int> sw(n);
vector<int> ab(n);
for (int i = 0; i < n; i++)
cin >> w[i];
for (int j = 0; j < n; j++) {
sum += w[j];
sw[j] = sum;... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, left, right, ansmin, sum = 0;
cin >> n;
vector<int> w(n);
vector<int> sw(n);
vector<int> ab(n);
for (int i = 0; i < n; i++)
cin >> w[i];
for (int j = 0; j < n; j++) {
sum += w[j];
sw[j] = ... | [
"variable_declaration.value.change"
] | 824,290 | 824,291 | u117606227 | cpp |
p03012 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, left, right, ansmin, sum;
cin >> n;
vector<int> w(n);
vector<int> sw(n);
vector<int> ab(n);
for (int i = 0; i < n; i++)
cin >> w[i];
for (int j; j < n; j++) {
sum += w[j];
sw[j] = sum;
}... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, left, right, ansmin, sum = 0;
cin >> n;
vector<int> w(n);
vector<int> sw(n);
vector<int> ab(n);
for (int i = 0; i < n; i++)
cin >> w[i];
for (int j = 0; j < n; j++) {
sum += w[j];
sw[j] = ... | [
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 824,292 | 824,291 | u117606227 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int wa = 0;
for (int i = 0; i < n; i++)
wa += a[i];
int waf = 0;
int sa = 100000000;
for (int i = 0; i < (n + 1) / 2; i++) {
waf += a[i];
int wab = wa - waf;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int wa = 0;
for (int i = 0; i < n; i++)
wa += a[i];
int waf = 0;
int sa = 100000000;
for (int i = 0; i < n; i++) {
waf += a[i];
int wab = wa - waf;
sa = m... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 824,299 | 824,300 | u319967566 | cpp |
p03012 | // Balance
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> w(n);
for (int tsumugi = 0; tsumugi < n; tsumugi++) {
cin >> w[tsumugi];
}
int left = 0;
int right = accumulate(w.begin(), w.end(), 0);
int ans = 0;
int tmp;
// int now = 0;
for (int matsuri = ... | // Balance
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> w(n);
for (int tsumugi = 0; tsumugi < n; tsumugi++) {
cin >> w[tsumugi];
}
int left = 0;
int right = accumulate(w.begin(), w.end(), 0);
int ans = 1e5;
int tmp;
// int now = 0;
for (int matsuri ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 824,305 | 824,306 | u229213815 | cpp |
p03012 | // Balance
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> w(n);
for (int tsumugi = 0; tsumugi < n; tsumugi++) {
cin >> w[tsumugi];
}
int left = 0;
int right = accumulate(w.begin(), w.end(), 0);
int ans;
int tmp;
// int now = 0;
for (int matsuri = 0; m... | // Balance
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> w(n);
for (int tsumugi = 0; tsumugi < n; tsumugi++) {
cin >> w[tsumugi];
}
int left = 0;
int right = accumulate(w.begin(), w.end(), 0);
int ans = 1e5;
int tmp;
// int now = 0;
for (int matsuri ... | [
"variable_declaration.value.change"
] | 824,307 | 824,306 | u229213815 | cpp |
p03012 | #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> vec(n);
rep(i, n) cin >> vec.at(i);
int sub_min = 0;
rep(i, n) {
int a = 0;
int b = 0;
rep(j, i + 1) a += vec.at(j);
for (int j = i + 1; j < n; j++)
... | #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> vec(n);
rep(i, n) cin >> vec.at(i);
int sub_min = 1000000;
rep(i, n) {
int a = 0;
int b = 0;
rep(j, i + 1) a += vec.at(j);
for (int j = i + 1; j < n; j++)
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 824,320 | 824,321 | u741134767 | cpp |
p03012 | // templates
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define pb push_back
#define SZ(x) ((int)(x).size())
typedef long lo... | // templates
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define pb push_back
#define SZ(x) ((int)(x).size())
typedef long lo... | [
"assignment.change"
] | 824,342 | 824,343 | u970738863 | cpp |
p03012 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long int ll;
ty... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long int ll;
ty... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 824,351 | 824,352 | u961198482 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> w(n), sum(n);
for (int i = 0; i < n; i++) {
cin >> w[i];
}
sum[0] = w[0];
for (int i = 1; i < n; i++) {
sum[i] = sum[i - 1] + w[i];
}
int ans = 100000000;
for (int i = 0; i < n; i++) {
int t = abs(sum... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> w(n), sum(n);
for (int i = 0; i < n; i++) {
cin >> w[i];
}
sum[0] = w[0];
for (int i = 1; i < n; i++) {
sum[i] = sum[i - 1] + w[i];
}
int ans = 100000000;
for (int i = 0; i < n; i++) {
int t = abs(sum... | [
"assignment.change"
] | 824,353 | 824,354 | u544165468 | cpp |
p03012 | #include <cmath>
#include <iostream>
using namespace std;
int W[100];
int sum[100];
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> W[i];
}
sum[0] = W[0];
for (int i = 1; i < N; i++) {
sum[i] = sum[i - 1] + W[i];
}
int m = 10001;
for (int i = 0; i < N - 1; i++) {
m ... | #include <cmath>
#include <iostream>
using namespace std;
int W[100];
int sum[100];
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> W[i];
}
sum[0] = W[0];
for (int i = 1; i < N; i++) {
sum[i] = sum[i - 1] + W[i];
}
int m = 10001;
for (int i = 0; i < N - 1; i++) {
m ... | [
"assignment.change"
] | 824,387 | 824,388 | u836117651 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
int abs(int x, int y) {
if (x < y) {
return y - x;
} else {
return x - y;
}
}
int main() {
int N;
cin >> N;
vector<int> wei(N);
for (int i = 0; i < N; i++) {
cin >> wei.at(i);
}
int res = 100000;
for (int T = 0; T < N - 1; T++) {
int S_1... | #include <bits/stdc++.h>
using namespace std;
int abs(int x, int y) {
if (x < y) {
return y - x;
} else {
return x - y;
}
}
int main() {
int N;
cin >> N;
vector<int> wei(N);
for (int i = 0; i < N; i++) {
cin >> wei.at(i);
}
int res = 100000;
for (int T = 0; T < N - 1; T++) {
int S_1... | [
"assignment.value.change",
"expression.operation.unary.arithmetic.remove"
] | 824,395 | 824,396 | u776056110 | cpp |
p03012 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long long n, s = INT_MAX, y;
cin >> n;
long long arr[n + 1];
for (long long i = 1; i <= (n); i++)
cin >> arr[i];
for (long long t = 1; t < n; t++) {
long long sum = 0, sum1 = 0;
for (long long i = 1; i <= (n); i++) {
... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long long n, s = INT_MAX, y;
cin >> n;
long long arr[n + 1];
for (long long i = 1; i <= (n); i++)
cin >> arr[i];
for (long long t = 1; t < n; t++) {
long long sum = 0, sum1 = 0;
for (long long i = 1; i <= (n); i++) {
... | [
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 824,398 | 824,399 | u188903786 | cpp |
p03012 | #include <bits/stdc++.h>
#define itn int
#define rep(i, n) for (int i = 0; i < n; i++)
#define irep(i, n) for (int i = n - 1; i >= 0; i--)
#define repeach(itr, k) for (auto itr : k)
#define MOD 1000000007
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
int main() {
int n;
cin >> n;
vector<i... | #include <bits/stdc++.h>
#define itn int
#define rep(i, n) for (int i = 0; i < n; i++)
#define irep(i, n) for (int i = n - 1; i >= 0; i--)
#define repeach(itr, k) for (auto itr : k)
#define MOD 1000000007
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
int main() {
int n;
cin >> n;
vector<i... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.remove"
] | 824,404 | 824,405 | u118875091 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
cin >> n;
int w[n], a = 0, sum = 0, an = 1e9;
for (i = 0; i < n; i++) {
cin >> w[i];
sum += w[i];
}
for (i = 0; i < n; i++) {
a += w[i];
an = min(abs(sum * 2 - a), an);
}
cout << an << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
cin >> n;
int w[n], a = 0, sum = 0, an = 1e9;
for (i = 0; i < n; i++) {
cin >> w[i];
sum += w[i];
}
for (i = 0; i < n; i++) {
a += w[i];
an = min(abs(sum - a * 2), an);
}
cout << an << endl;
return 0;
}
| [
"expression.operation.binary.remove",
"assignment.change"
] | 824,406 | 824,407 | u075368225 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; i < (n); i++)
int main() {
int n, w[100], s = 0, r = 0, m = 1000;
cin >> n;
rep(i, n) {
cin >> w[i];
s += w[i];
}
rep(i, n) {
r += w[i];
m = min(m, abs(s - r));
}
cout << m << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; i < (n); i++)
int main() {
int n, w[100], s = 0, r = 0, m = 1000;
cin >> n;
rep(i, n) {
cin >> w[i];
s += w[i];
}
rep(i, n) {
r += w[i];
m = min(m, abs(s - 2 * r));
}
cout << m << endl;
} | [
"assignment.change"
] | 824,421 | 824,422 | u855016901 | cpp |
p03012 | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
template <typename T> void out(T x) {
cout << x << endl;
exit(0);
}
#define watch(x) cout << (#x) << " is " << (x) << endl
const in... | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
template <typename T> void out(T x) {
cout << x << endl;
exit(0);
}
#define watch(x) cout << (#x) << " is " << (x) << endl
const in... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 824,457 | 824,458 | u774417629 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, s1 = 0, s2 = 0, m, m0;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
s2 += v[i];
}
m = s2;
for (int i = 0; i < n - 1; i++) {
s1 += v[i];
s2 -= v[n - i - 1];
m0 = fabs(s1 - s2);
m = min(m, m0... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, s1 = 0, s2 = 0, m, m0;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
s2 += v[i];
}
m = s2;
for (int i = 0; i < n - 1; i++) {
s1 += v[i];
s2 -= v[i];
m0 = fabs(s1 - s2);
m = min(m, m0);
}
... | [
"expression.operation.binary.remove"
] | 824,479 | 824,480 | u930561195 | cpp |
p03012 | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
int dy[4] = {1, 0, -1, 0}, dx[4] = {0, 1, 0, -1};
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> w(n);
int sum = 0;... | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
int dy[4] = {1, 0, -1, 0}, dx[4] = {0, 1, 0, -1};
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> w(n);
int sum = 0;... | [
"assignment.change"
] | 824,501 | 824,502 | u946090308 | cpp |
p03012 | #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
int a[100];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, s = 0;
cin >> n;
for (int i = 0; i < n; ++i... | #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
int a[100];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, s = 0;
cin >> n;
for (int i = 0; i < n; ++i... | [
"call.arguments.change"
] | 824,505 | 824,506 | u562319622 | cpp |
p03012 | #include "bits/stdc++.h"
using namespace std;
#define LL long long
#define PB push_back
#define MP make_pair
int main() {
int N;
cin >> N;
int W[100];
for (int i = 0; i < N; i++)
cin >> W[i];
int ans = INT_MAX;
for (int i = 0; i < N - 1; i++) {
int sum = 0;
for (int j = 0; j <= i; j++)
su... | #include "bits/stdc++.h"
using namespace std;
#define LL long long
#define PB push_back
#define MP make_pair
int main() {
int N;
cin >> N;
int W[100];
for (int i = 0; i < N; i++)
cin >> W[i];
int ans = INT_MAX;
for (int i = 0; i < N - 1; i++) {
int sum = 0;
for (int j = 0; j <= i; j++)
su... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 824,514 | 824,515 | u422592877 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int diff = INT_MAX;
for (int i = 0; i < n + 1; i++) {
int l = 0;
for (int j = 0; j < i; j++) {
l += arr[i];
}
int r = 0;
for (int j = i; j < n... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int diff = INT_MAX;
for (int i = 0; i < n + 1; i++) {
int l = 0;
for (int j = 0; j < i; j++) {
l += arr[j];
}
int r = 0;
for (int j = i; j < n... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 824,520 | 824,521 | u839270538 | cpp |
p03012 | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int N;
string ans;
cin >> N;
vector<int> a(N);
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
sum += a[i];
}
int mini = s... | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int N;
string ans;
cin >> N;
vector<int> a(N);
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
sum += a[i];
}
int mini = s... | [
"identifier.change",
"io.output.change"
] | 824,522 | 824,523 | u221769213 | cpp |
p03012 | #include <iostream>
#include <stdlib.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main(void) {
int N;
cin >> N;
int W[N], sum[N];
cin >> W[0];
sum[0] = W[0];
rep(i, N - 1) {
cin >> W[i + 1];
sum[i + 1] = sum[i] + W[i + 1];
}
int ans = abs(W[N - 1] - 2 * sum[0]);
... | #include <iostream>
#include <stdlib.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main(void) {
int N;
cin >> N;
int W[N], sum[N];
cin >> W[0];
sum[0] = W[0];
rep(i, N - 1) {
cin >> W[i + 1];
sum[i + 1] = sum[i] + W[i + 1];
}
int ans = abs(sum[N - 1] - 2 * sum[0]);
... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 824,532 | 824,533 | u582848517 | cpp |
p03012 | #include <cmath>
#include <iostream>
int main(int argc, char **argv) {
int N;
int W[110];
int S1 = 0;
int S2 = 0;
int sum = 0;
int min;
std::cin >> N;
for (int i = 0; i < N; i++) {
std::cin >> W[i];
sum += W[i];
}
min = sum;
for (int T = 1; T < N; T++) {
for (int j = 0; j < T; j++)... | #include <cmath>
#include <iostream>
int main(int argc, char **argv) {
int N;
int W[110];
int S1 = 0;
int S2 = 0;
int sum = 0;
int min;
std::cin >> N;
for (int i = 0; i < N; i++) {
std::cin >> W[i];
sum += W[i];
}
min = sum;
for (int T = 1; T <= N; T++) {
S1 = 0;
for (int j = 0;... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.add"
] | 824,551 | 824,552 | u777474133 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
cin >> n;
int l, r = 0;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
r += v[i];
}
int res = 1000 *... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
cin >> n;
int l = 0, r = 0;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
r += v[i];
}
int res = 10... | [
"variable_declaration.value.change"
] | 824,553 | 824,554 | u440032761 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
cin >> n;
int l, r = 0;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
r += v[i];
}
int res = 1000 *... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
cin >> n;
int l = 0, r = 0;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
r += v[i];
}
int res = 10... | [
"variable_declaration.value.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 824,556 | 824,554 | u440032761 | cpp |
p03012 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
// Your code here!
int n, ans;
cin >> n;
vector<int> w(n);
for (int i = 0; i < n; i++) {
cin >> w[i];
}
for (int i = 0; i < n; i++) {
int l = 0, r = 0;
for (int j = 0; j < i; j++)
l += w[j];
for (int j = i; j... | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
// Your code here!
int n, ans;
cin >> n;
vector<int> w(n);
for (int i = 0; i < n; i++) {
cin >> w[i];
}
ans = 10000000000;
for (int i = 0; i < n; i++) {
int l = 0, r = 0;
for (int j = 0; j < i; j++)
l += w[j];
... | [
"assignment.add"
] | 824,579 | 824,580 | u365928729 | cpp |
p03012 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int w[n];
for (int i = 0; i < n; i++)
cin >> w[i];
int a[n + 1];
a[0] = 0;
for (int i = 1; i <= n; i++)
a[i] = a[i - 1] + w[i - 1];
int ans = 10 ^ 6;
for (int i = 1; i <= n; i++) {
... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int w[n];
for (int i = 0; i < n; i++)
cin >> w[i];
int a[n + 1];
a[0] = 0;
for (int i = 1; i <= n; i++)
a[i] = a[i - 1] + w[i - 1];
int ans = 1000000;
for (int i = 1; i <= n; i++) {
... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 824,587 | 824,588 | u365364616 | cpp |
p03012 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n, sum = 0, min = 10000;
int tsum = 0;
int a[110];
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
for (int i = 0; i < n; i++) {
tsum += a[i];
if (abs(sum - tsum - tsum) < min)
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n, sum = 0, min = 10000;
int tsum = 0;
int a[110];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
for (int i = 0; i < n; i++) {
tsum += a[i];
if (abs(sum - tsum - tsum)... | [] | 824,597 | 824,598 | u467561544 | cpp |
p03012 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> w(100);
for (int i = 0; i < n; i++)
cin >> w[i];
int sum1 = 0, sum2 = 0, diff = 0;
for (int i = 1; i < n - 1; i++) {
for (int j = 0; j < i; j++)
sum1 += w[j];
for (int j = ... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> w(100);
for (int i = 0; i < n; i++)
cin >> w[i];
int sum1 = 0, sum2 = 0, diff = 0;
for (int i = 1; i < n; i++) {
for (int j = 0; j < i; j++)
sum1 += w[j];
for (int j = n; j... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 824,618 | 824,619 | u408650734 | cpp |
p03012 | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int size;
std::cin >> size;
std::vector<int> weight(size);
for (auto &e : weight)
std::cin >> e;
std::vector<int> result(size - 2);
for (auto i = 1; i < (size - 1); ++i) {
auto pre = 0;
for (auto j = 0; j < i; ++j) {
... | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int size;
std::cin >> size;
std::vector<int> weight(size);
for (auto &e : weight)
std::cin >> e;
std::vector<int> result(size - 1);
for (auto i = 1; i < size; ++i) {
auto pre = 0;
for (auto j = 0; j < i; ++j) {
pre ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change"
] | 824,627 | 824,628 | u259946904 | cpp |
p03012 | #include <algorithm>
#include <iostream>
using namespace std;
#define ll long long
int main() {
int a[101];
int n;
cin >> n;
int s[101], p[101];
for (int i = 0; i < n; i++)
cin >> a[i];
p[0] = a[0];
for (int i = 1; i < n; i++)
p[i] = a[i] + p[i - 1];
s[n - 1] = a[n - 1];
for (int i = n - 2; i... | #include <algorithm>
#include <iostream>
using namespace std;
#define ll long long
int main() {
int a[101];
int n;
cin >> n;
int s[101], p[101];
for (int i = 0; i < n; i++)
cin >> a[i];
p[0] = a[0];
for (int i = 1; i < n; i++)
p[i] = a[i] + p[i - 1];
s[n - 1] = a[n - 1];
for (int i = n - 2; i... | [
"literal.number.change",
"variable_declaration.value.change"
] | 824,642 | 824,643 | u371762349 | cpp |
p03012 | #include <algorithm>
#include <climits>
#include <cstdio>
using namespace std;
int n;
int w[101];
int main(void) {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &w[i]);
}
int m = INT_MAX;
int s1, s2;
for (int t = 1; t < n; t++) {
s1 = 0;
for (int i = 1; i <= t; i++) {
s... | #include <algorithm>
#include <climits>
#include <cstdio>
using namespace std;
int n;
int w[101];
int main(void) {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &w[i]);
}
int m = INT_MAX;
int s1, s2;
for (int t = 1; t < n; t++) {
s1 = 0;
for (int i = 1; i <= t; i++) {
s... | [
"control_flow.loop.for.condition.change"
] | 824,644 | 824,645 | u684901760 | cpp |
p03012 | #include <algorithm>
#include <climits>
#include <cstdio>
using namespace std;
int n;
int w[101];
int main(void) {
scanf("%d", &n);
for (int i = 1; i < n; i++) {
scanf("%d", &w[i]);
}
int m = INT_MAX;
int s1, s2;
for (int t = 1; t < n; t++) {
s1 = 0;
for (int i = 1; i <= t; i++) {
s... | #include <algorithm>
#include <climits>
#include <cstdio>
using namespace std;
int n;
int w[101];
int main(void) {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &w[i]);
}
int m = INT_MAX;
int s1, s2;
for (int t = 1; t < n; t++) {
s1 = 0;
for (int i = 1; i <= t; i++) {
s... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 824,646 | 824,645 | u684901760 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, t, res = 100000;
cin >> n;
int w[n];
for (i = 0; i < n; i++) {
cin >> t;
if (i == 0) {
w[i] = t;
} else {
w[i] = w[i - 1] + t;
}
}
for (i = 0; i < n - 1; i++) {
res = min(res, w[n - 1] - w[i]);
}
cout <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, t, res = 100000;
cin >> n;
int w[n];
for (i = 0; i < n; i++) {
cin >> t;
if (i == 0) {
w[i] = t;
} else {
w[i] = w[i - 1] + t;
}
}
for (i = 0; i < n - 1; i++) {
res = min(res, abs(w[n - 1] - 2 * w[i]));
}... | [
"call.add",
"assignment.change",
"call.arguments.change"
] | 824,647 | 824,648 | u058348416 | cpp |
p03012 | #include <algorithm>
#include <deque>
#include <map>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
int abs(int a) {
if (a < 0)
a *= -1;
return a;
}
#define INF 100000
int main(void) {
std::vector<int> A;
int n;
scanf("%d", &n);
for (int i ... | #include <algorithm>
#include <deque>
#include <map>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
int abs(int a) {
if (a < 0)
a *= -1;
return a;
}
#define INF 100000
int main(void) {
std::vector<int> A;
int n;
scanf("%d", &n);
for (int i ... | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change",
"expression.operation.unary.arithmetic.remove"
] | 824,649 | 824,650 | u217348908 | cpp |
p03012 | #include <algorithm>
#include <deque>
#include <map>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
int abs(int a) {
if (a < 0)
a *= -1;
return a;
}
#define INF 100000
int main(void) {
std::vector<int> A;
int n;
scanf("%d", &n);
for (int i ... | #include <algorithm>
#include <deque>
#include <map>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
int abs(int a) {
if (a < 0)
a *= -1;
return a;
}
#define INF 100000
int main(void) {
std::vector<int> A;
int n;
scanf("%d", &n);
for (int i ... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change",
"expression.operation.unary.arithmetic.remove"
] | 824,651 | 824,650 | u217348908 | cpp |
p03012 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> w(n);
vector<int> a(n, 0);
vector<int> b(n, 0);
for (int i = 0; i < n; ++i) {
cin >> w[i];
}
for (int i = 0; i < n - 1; ++i) {
a[i + 1] = a[i] + w[i];
}
reverse(w.begin... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> w(n);
vector<int> a(n, 0);
vector<int> b(n, 0);
for (int i = 0; i < n; ++i) {
cin >> w[i];
}
for (int i = 0; i < n - 1; ++i) {
a[i + 1] = a[i] + w[i];
}
reverse(w.begin... | [
"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"
] | 824,654 | 824,655 | u256027816 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 10000000;
vector<int> w(n);
for (int i = 0; i < n; i++)
cin >> w.at(i);
for (int i = 1; i < n - 1; i++) {
int ans1 = 0, ans2 = 0;
for (int j = 0; j < i; j++)
ans1 += w.at(j);
for (int l = i; l < n; l+... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 10000000;
vector<int> w(n);
for (int i = 0; i < n; i++)
cin >> w.at(i);
for (int i = 1; i < n; i++) {
int ans1 = 0, ans2 = 0;
for (int j = 0; j < i; j++) {
ans1 += w.at(j);
}
for (int l = i; l < n... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 824,660 | 824,661 | u389766217 | cpp |
p03012 | #include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pll;
struct data_t {
int i;
string s;
... | #include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pll;
struct data_t {
int i;
string s;
... | [
"variable_declaration.value.change"
] | 824,662 | 824,663 | u176686904 | cpp |
p03012 | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int N;
std::cin >> N;
std::vector<int> W(N);
std::vector<int> WS(N);
for (auto &w : W) {
std::cin >> w;
}
WS[0] = W[0];
for (int i = 1; i < N; i++) {
WS[i] = W[i] + WS[i - 1];
}
int min_val = WS[N];
for (int i = 0; i ... | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int N;
std::cin >> N;
std::vector<int> W(N);
std::vector<int> WS(N);
for (auto &w : W) {
std::cin >> w;
}
WS[0] = W[0];
for (int i = 1; i < N; i++) {
WS[i] = W[i] + WS[i - 1];
}
int min_val = WS[N - 1];
for (int i = 0... | [
"assignment.change"
] | 824,664 | 824,665 | u896932701 | cpp |
p03012 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int N;
cin >> N;
int *W = new int[N];
for (int idx = 0; idx < N; ++idx) {
cin >> W[idx];
}
auto get_sum = [&](int start, int end) {
int sum = 0;
for (int i = start; i <= end; ++i) {
sum += W[i];
}
return s... | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int N;
cin >> N;
int *W = new int[N];
for (int idx = 0; idx < N; ++idx) {
cin >> W[idx];
}
auto get_sum = [&](int start, int end) {
int sum = 0;
for (int i = start; i <= end; ++i) {
sum += W[i];
}
return s... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 824,669 | 824,670 | u474161185 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
const int inf = 19;
int main() {
int n;
cin >> n;
int res = inf;
long long sum = 0;
vector<int> vec(n, 0);
for (int i = 0; i < n; ++i) {
cin >> vec[i];
sum += vec[i];
}
vector<int> table(n, 0);
table[0] = vec[0];
for (int i = 1; i < n; ++i)
t... | #include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
int main() {
int n;
cin >> n;
int res = inf;
long long sum = 0;
vector<int> vec(n, 0);
for (int i = 0; i < n; ++i) {
cin >> vec[i];
sum += vec[i];
}
vector<int> table(n, 0);
table[0] = vec[0];
for (int i = 1; i < n; ++i)
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 824,671 | 824,672 | u088000503 | cpp |
p03012 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <ve... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <ve... | [
"identifier.change",
"io.output.change"
] | 824,684 | 824,685 | u965118468 | cpp |
p03012 | #include <algorithm>
#include <cassert>
#include <cstring>
#include <iostream>
#include <math.h>
#include <stdexcept>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) f... | #include <algorithm>
#include <cassert>
#include <cstring>
#include <iostream>
#include <math.h>
#include <stdexcept>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) f... | [
"assignment.change"
] | 824,686 | 824,687 | u696415377 | cpp |
p03012 | #include <iostream>
#define N 101
using namespace std;
int main() {
int n, w[N] = {};
cin >> n;
for (int i = 0; i < n; i++) {
cin >> w[i];
}
int sum1 = 0, sum2 = 0;
int min = 10000;
for (int i = 0; i < n; i++) {
for (int j = 0; j < i; j++) {
sum1 += w[j];
}
for (int j = i + 1; j < n;... | #include <iostream>
#define N 101
using namespace std;
int main() {
int n, w[N] = {};
cin >> n;
for (int i = 0; i < n; i++) {
cin >> w[i];
}
int sum1 = 0, sum2 = 0;
int min = 10000;
for (int i = 0; i < n; i++) {
for (int j = 0; j < i; j++) {
sum1 += w[j];
}
for (int j = i; j < n; j++... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 824,694 | 824,695 | u632679464 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int W[N], total;
int S[N] = {};
int tmp = 0;
// for(int i = 0; i < N; i++) cin >> W[i];
// sort(W, W + N);
for (int i = 0; i < N; i++) {
cin >> W[i];
tmp += W[i];
S[i] = tmp;
// cout << S[i] << " ";
// total... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int W[N], total;
int S[N] = {};
int tmp = 0;
// for(int i = 0; i < N; i++) cin >> W[i];
// sort(W, W + N);
for (int i = 0; i < N; i++) {
cin >> W[i];
tmp += W[i];
S[i] = tmp;
// cout << S[i] << " ";
// total... | [
"variable_declaration.value.change"
] | 824,712 | 824,713 | u031598803 | cpp |
p03012 | #include <algorithm>
#include <cctype>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <istream>
#include <math.h>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, t1 = 0, t2 = 0;
vector<int> A;
vector<int> B;
cin >> N;
for (int i = 0; i < N;... | #include <algorithm>
#include <cctype>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <istream>
#include <math.h>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, t1 = 0, t2 = 0;
vector<int> A;
vector<int> B;
cin >> N;
for (int i = 0; i < N;... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 824,716 | 824,717 | u230139835 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
int analyze(vector<int> weights) {
int minDiff = 99 * 100 - 1; // 重さの最小値の最大値
int diff = 0;
for (int i = 1; i < weights.size() - 1; i++) {
int weightSumA = 0;
int weightSumB = 0;
int j;
for (j = 0; j < i; j++) {
weightSumA += weights.at(j);
... | #include <bits/stdc++.h>
using namespace std;
int analyze(vector<int> weights) {
int minDiff = 99 * 100 - 1; // 重さの最小値の最大値
int diff = 0;
for (int i = 0; i < weights.size(); i++) {
int weightSumA = 0;
int weightSumB = 0;
int j;
for (j = 0; j < i; j++) {
weightSumA += weights.at(j);
}
... | [
"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"
] | 824,720 | 824,721 | u236540805 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<LL, LL> P;
const LL mod = 1000000007;
const LL LINF = 1LL << 60;
co... | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<LL, LL> P;
const LL mod = 1000000007;
const LL LINF = 1LL << 60;
co... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 824,724 | 824,725 | u640323045 | cpp |
p03012 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, sum = 0, keep = 0, a, b;
cin >> n;
vector<int> w(n), x(n - 1);
for (i = 0; i < n; i++) {
cin >> w.at(i);
sum += w.at(i);
}
for (i = 0; i < n; i++) {
keep += w.at(i);
x.at(i) = abs(sum - 2 * keep);
}
sort(x.begin(), ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, sum = 0, keep = 0, a, b;
cin >> n;
vector<int> w(n), x(n);
for (i = 0; i < n; i++) {
cin >> w.at(i);
sum += w.at(i);
}
for (i = 0; i < n; i++) {
keep += w.at(i);
x.at(i) = abs(sum - 2 * keep);
}
sort(x.begin(), x.en... | [
"expression.operation.binary.remove"
] | 824,726 | 824,727 | u979163294 | cpp |
p03012 | #include <bits/stdc++.h>
#define mk make_pair
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
int a[100010];
int main() {
int n;
while (cin >> n) {
ll ans = 0, tmp = 0, sm = 0;
for (int i = 0; i < n; ++i) {
scanf("%d", a + i);
sm += a[i];
... | #include <bits/stdc++.h>
#define mk make_pair
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
int a[100010];
int main() {
int n;
while (cin >> n) {
ll ans = 0, tmp = 0, sm = 0;
for (int i = 0; i < n; ++i) {
scanf("%d", a + i);
sm += a[i];
... | [
"assignment.add"
] | 824,728 | 824,729 | u535523790 | cpp |
p03012 |
#include <algorithm>
#include <stdio.h>
#include <string>
#include <vector>
int main() {
int N;
scanf("%d", &N);
int *W = new int[N];
for (int i = 0; i < N; i++) {
scanf("%d", &W[i]);
}
int res = 0x7fffffff;
for (int t = 1; t < N - 1; t++) {
int s1 = 0, s2 = 0;
for (int i = 0; i < N; i++) {
... |
#include <algorithm>
#include <stdio.h>
#include <string>
#include <vector>
int main() {
int N;
scanf("%d", &N);
int *W = new int[N];
for (int i = 0; i < N; i++) {
scanf("%d", &W[i]);
}
int res = 0x7fffffff;
for (int t = 0; t < N; t++) {
int s1 = 0, s2 = 0;
for (int i = 0; i < N; i++) {
... | [
"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"
] | 824,744 | 824,745 | u617987447 | cpp |
p03012 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> M(N);
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> M[i];
sum += M[i];
}
int S = 0, Ss = 0, Smin = sum;
for (int i = 0; i < N - 1; i++) {
S += M[i];
Ss = sum - 2 * S;
Smin = mi... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> M(N);
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> M[i];
sum += M[i];
}
int S = 0, Ss = 0, Smin = sum;
for (int i = 0; i < N - 1; i++) {
S += M[i];
Ss = abs(sum - 2 * S);
Smin... | [
"call.add",
"call.arguments.change"
] | 824,746 | 824,747 | u070471279 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.