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 int INF = 1001001001;
const double PI = acos(-1);
int main() {
int n;
cin >> n;
vector<int> w(n);
rep(i, n) cin >> w[i];
int sum = 0;
rep(i, n) sum += w[i];
int sub = 0;
int ans = 10;
rep(i, n) {
sub += w[i];
ans = min(abs(2 * sub - sum), ans);
// pf(abs(2 * sub - sum));
}
pf(ans);
return 0;
} | #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 int INF = 1001001001;
const double PI = acos(-1);
int main() {
int n;
cin >> n;
vector<int> w(n);
rep(i, n) cin >> w[i];
int sum = 0;
rep(i, n) sum += w[i];
int sub = 0;
int ans = 10010001;
rep(i, n) {
sub += w[i];
ans = min(abs(2 * sub - sum), ans);
// pf(abs(2 * sub - sum));
}
pf(ans);
return 0;
} | [
"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 int INF = 1001001001;
const double PI = acos(-1);
int main() {
int n;
cin >> n;
vector<int> w(n);
rep(i, n) cin >> w[i];
int sum = 0;
rep(i, n) sum += w[i];
int sub = 0;
int ans = 10;
rep(i, n) {
sub += w[i];
ans = min(abs(2 * sub - sum), ans);
// pf(abs(2 * sub - sum));
}
pf(ans);
return 0;
} | #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 int INF = 1001001001;
const double PI = acos(-1);
int main() {
int n;
cin >> n;
vector<int> w(n);
rep(i, n) cin >> w[i];
int sum = 0;
rep(i, n) sum += w[i];
int sub = 0;
int ans = 10010001;
rep(i, n) {
sub += w[i];
ans = min(abs(2 * sub - sum), ans);
// pf(abs(2 * sub - sum));
}
pf(ans);
return 0;
} | [
"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(ans, abs((sum[N] - sum[i]) - sum[i]));
}
cout << ans << endl;
return 0;
} | #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, abs((sum[N] - sum[i]) - sum[i]));
}
cout << ans << endl;
return 0;
} | [
"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
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i;
ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c &) { ris; }
#endif
}
;
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
using ll = long long;
void test_case() {
int n;
cin >> n;
vector<int> hash(n);
for (auto &x : hash)
cin >> x;
int ans = INT_MAX;
for (int i = 1; i < n - 1; i++) {
int s1 = 0, s2 = 0;
for (int j = 0; j < i; j++) {
s1 += hash[j];
}
for (int j = i; j < n; j++) {
s2 += hash[j];
}
ans = min(ans, abs(s1 - s2));
}
cout << ans << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int T = 1;
//~ cin >> T;
while (T--) {
test_case();
}
return 0;
}
| #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
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i;
ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c &) { ris; }
#endif
}
;
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
using ll = long long;
void test_case() {
int n;
cin >> n;
vector<int> hash(n);
for (auto &x : hash)
cin >> x;
int ans = INT_MAX;
for (int i = 1; i < n; i++) {
int s1 = 0, s2 = 0;
for (int j = 0; j < i; j++) {
s1 += hash[j];
}
for (int j = i; j < n; j++) {
s2 += hash[j];
}
ans = min(ans, abs(s1 - s2));
}
cout << ans << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int T = 1;
//~ cin >> T;
while (T--) {
test_case();
}
return 0;
}
| [
"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_VER
#include <ppl.h>
#endif
using namespace std;
#define DUMPOUT std::cerr
#define dump(...) \
DUMPOUT << " "; \
DUMPOUT << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" \
<< std::endl; \
DUMPOUT << " "; \
dump_func(__VA_ARGS__)
typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef pair<string, string> pss;
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const pair<_KTy, _Ty> &m) {
o << "{" << m.first << ", " << m.second << "}";
return o;
}
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const map<_KTy, _Ty> &m) {
if (m.empty()) {
o << "{ }";
return o;
}
o << "{" << *m.begin();
for (auto itr = ++m.begin(); itr != m.end(); itr++) {
o << ", " << *itr;
}
o << "}";
return o;
}
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const unordered_map<_KTy, _Ty> &m) {
if (m.empty()) {
o << "{ }";
return o;
}
o << "{" << *m.begin();
for (auto itr = ++m.begin(); itr != m.end(); itr++) {
o << ", " << *itr;
}
o << "}";
return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const vector<_Ty> &v) {
if (v.empty()) {
o << "{ }";
return o;
}
o << "{" << v.front();
for (auto itr = ++v.begin(); itr != v.end(); itr++) {
o << ", " << *itr;
}
o << "}";
return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const set<_Ty> &s) {
if (s.empty()) {
o << "{ }";
return o;
}
o << "{" << *(s.begin());
for (auto itr = ++s.begin(); itr != s.end(); itr++) {
o << ", " << *itr;
}
o << "}";
return o;
}
template <typename _Ty>
ostream &operator<<(ostream &o, const unordered_set<_Ty> &s) {
if (s.empty()) {
o << "{ }";
return o;
}
o << "{" << *(s.begin());
for (auto itr = ++s.begin(); itr != s.end(); itr++) {
o << ", " << *itr;
}
o << "}";
return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const stack<_Ty> &s) {
if (s.empty()) {
o << "{ }";
return o;
}
stack<_Ty> t(s);
o << "{" << t.top();
t.pop();
while (!t.empty()) {
o << ", " << t.top();
t.pop();
}
o << "}";
return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const list<_Ty> &l) {
if (l.empty()) {
o << "{ }";
return o;
}
o << "{" << l.front();
for (auto itr = ++l.begin(); itr != l.end(); ++itr) {
o << ", " << *itr;
}
o << "}";
return o;
}
template <typename _KTy, typename _Ty>
istream &operator>>(istream &is, pair<_KTy, _Ty> &m) {
is >> m.first >> m.second;
return is;
}
template <typename _Ty> istream &operator>>(istream &is, vector<_Ty> &v) {
for (size_t i = 0; i < v.size(); i++)
is >> v[i];
return is;
}
namespace aux { // print tuple
template <typename Ty, unsigned N, unsigned L> struct tp {
static void print(ostream &os, const Ty &v) {
os << get<N>(v) << ", ";
tp<Ty, N + 1, L>::print(os, v);
}
};
template <typename Ty, unsigned N> struct tp<Ty, N, N> {
static void print(ostream &os, const Ty &v) { os << get<N>(v); }
};
} // namespace aux
template <typename... Tys>
ostream &operator<<(ostream &os, const tuple<Tys...> &t) {
os << "{";
aux::tp<tuple<Tys...>, 0, sizeof...(Tys) - 1>::print(os, t);
os << "}";
return os;
}
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
void dump_func() { DUMPOUT << std::endl; }
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&...tail) {
DUMPOUT << head;
if (sizeof...(Tail) == 0) {
DUMPOUT << " ";
} else {
DUMPOUT << ", ";
}
dump_func(std::move(tail)...);
}
template <typename Ty> Ty modpow(Ty n, Ty e, Ty m) {
Ty result = 1;
while (e > 0) {
if (e & 1)
result = (result * n) % m;
e >>= 1;
n = (n * n) % m;
}
return result;
}
#define PI 3.14159265358979323846
#define EPS 1e-10
#define FOR(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define all(j) (j).begin(), (j).end()
#define SZ(j) ((int)(j).size())
#define fake false
class timer {
public:
double t = 0;
timer() {}
void measure() { t = time() - t; }
static double time() {
#ifdef _MSC_VER
return __rdtsc() / 2.8e9;
#else
unsigned long long a, d;
__asm__ volatile("rdtsc" : "=a"(a), "=d"(d));
return (d << 32 | a) / 2.8e9;
#endif
}
} timer;
struct Xorshift {
uint64_t x = 88172645463325252LL;
unsigned nextUInt() {
x = x ^ (x << 7);
return x = x ^ (x >> 9);
}
unsigned nextUInt(unsigned mod) {
x = x ^ (x << 7);
x = x ^ (x >> 9);
return x % mod;
}
unsigned nextUInt(unsigned l, unsigned r) {
x = x ^ (x << 7);
x = x ^ (x >> 9);
return x % (r - l + 1) + l;
}
double nextDouble() { return double(nextUInt()) / UINT_MAX; }
} rnd;
int main() {
timer.measure();
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> W(N);
cin >> W;
int S = accumulate(all(W), 0);
int minDiff = INT_MAX;
int s = 0;
for (int i = 1; i <= N - 1; i++) {
s += W[i];
minDiff = min(minDiff, abs(S - s));
}
cout << minDiff << endl;
return 0;
}
| #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_VER
#include <ppl.h>
#endif
using namespace std;
#define DUMPOUT std::cerr
#define dump(...) \
DUMPOUT << " "; \
DUMPOUT << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" \
<< std::endl; \
DUMPOUT << " "; \
dump_func(__VA_ARGS__)
typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef pair<string, string> pss;
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const pair<_KTy, _Ty> &m) {
o << "{" << m.first << ", " << m.second << "}";
return o;
}
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const map<_KTy, _Ty> &m) {
if (m.empty()) {
o << "{ }";
return o;
}
o << "{" << *m.begin();
for (auto itr = ++m.begin(); itr != m.end(); itr++) {
o << ", " << *itr;
}
o << "}";
return o;
}
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const unordered_map<_KTy, _Ty> &m) {
if (m.empty()) {
o << "{ }";
return o;
}
o << "{" << *m.begin();
for (auto itr = ++m.begin(); itr != m.end(); itr++) {
o << ", " << *itr;
}
o << "}";
return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const vector<_Ty> &v) {
if (v.empty()) {
o << "{ }";
return o;
}
o << "{" << v.front();
for (auto itr = ++v.begin(); itr != v.end(); itr++) {
o << ", " << *itr;
}
o << "}";
return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const set<_Ty> &s) {
if (s.empty()) {
o << "{ }";
return o;
}
o << "{" << *(s.begin());
for (auto itr = ++s.begin(); itr != s.end(); itr++) {
o << ", " << *itr;
}
o << "}";
return o;
}
template <typename _Ty>
ostream &operator<<(ostream &o, const unordered_set<_Ty> &s) {
if (s.empty()) {
o << "{ }";
return o;
}
o << "{" << *(s.begin());
for (auto itr = ++s.begin(); itr != s.end(); itr++) {
o << ", " << *itr;
}
o << "}";
return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const stack<_Ty> &s) {
if (s.empty()) {
o << "{ }";
return o;
}
stack<_Ty> t(s);
o << "{" << t.top();
t.pop();
while (!t.empty()) {
o << ", " << t.top();
t.pop();
}
o << "}";
return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const list<_Ty> &l) {
if (l.empty()) {
o << "{ }";
return o;
}
o << "{" << l.front();
for (auto itr = ++l.begin(); itr != l.end(); ++itr) {
o << ", " << *itr;
}
o << "}";
return o;
}
template <typename _KTy, typename _Ty>
istream &operator>>(istream &is, pair<_KTy, _Ty> &m) {
is >> m.first >> m.second;
return is;
}
template <typename _Ty> istream &operator>>(istream &is, vector<_Ty> &v) {
for (size_t i = 0; i < v.size(); i++)
is >> v[i];
return is;
}
namespace aux { // print tuple
template <typename Ty, unsigned N, unsigned L> struct tp {
static void print(ostream &os, const Ty &v) {
os << get<N>(v) << ", ";
tp<Ty, N + 1, L>::print(os, v);
}
};
template <typename Ty, unsigned N> struct tp<Ty, N, N> {
static void print(ostream &os, const Ty &v) { os << get<N>(v); }
};
} // namespace aux
template <typename... Tys>
ostream &operator<<(ostream &os, const tuple<Tys...> &t) {
os << "{";
aux::tp<tuple<Tys...>, 0, sizeof...(Tys) - 1>::print(os, t);
os << "}";
return os;
}
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
void dump_func() { DUMPOUT << std::endl; }
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&...tail) {
DUMPOUT << head;
if (sizeof...(Tail) == 0) {
DUMPOUT << " ";
} else {
DUMPOUT << ", ";
}
dump_func(std::move(tail)...);
}
template <typename Ty> Ty modpow(Ty n, Ty e, Ty m) {
Ty result = 1;
while (e > 0) {
if (e & 1)
result = (result * n) % m;
e >>= 1;
n = (n * n) % m;
}
return result;
}
#define PI 3.14159265358979323846
#define EPS 1e-10
#define FOR(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define all(j) (j).begin(), (j).end()
#define SZ(j) ((int)(j).size())
#define fake false
class timer {
public:
double t = 0;
timer() {}
void measure() { t = time() - t; }
static double time() {
#ifdef _MSC_VER
return __rdtsc() / 2.8e9;
#else
unsigned long long a, d;
__asm__ volatile("rdtsc" : "=a"(a), "=d"(d));
return (d << 32 | a) / 2.8e9;
#endif
}
} timer;
struct Xorshift {
uint64_t x = 88172645463325252LL;
unsigned nextUInt() {
x = x ^ (x << 7);
return x = x ^ (x >> 9);
}
unsigned nextUInt(unsigned mod) {
x = x ^ (x << 7);
x = x ^ (x >> 9);
return x % mod;
}
unsigned nextUInt(unsigned l, unsigned r) {
x = x ^ (x << 7);
x = x ^ (x >> 9);
return x % (r - l + 1) + l;
}
double nextDouble() { return double(nextUInt()) / UINT_MAX; }
} rnd;
int main() {
timer.measure();
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> W(N);
cin >> W;
int S = accumulate(all(W), 0);
int minDiff = INT_MAX;
int s = 0;
for (int i = 0; i <= N - 1; i++) {
s += W[i];
minDiff = min(minDiff, abs(S - 2 * s));
}
cout << minDiff << endl;
return 0;
}
| [
"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 << endl;
} | [
"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];
}
for (int j = i + 1; j <= n - 1; j++) {
now_up += w[j];
}
int now = abs(now_up - now_down);
if (now < weigh)
weigh = now;
}
cout << weigh;
} | #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];
}
for (int j = i + 1; j <= n - 1; j++) {
now_up += w[j];
}
int now = abs(now_up - now_down);
if (now < weigh)
weigh = now;
}
cout << weigh;
} | [
"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;
for (int j = 0; j < i; j++) {
left += w[j];
}
for (int k = i; k < n; k++) {
right += w[k];
}
ans = min(ans, abs(left - right));
}
cout << ans << endl;
return 0;
}
| #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 (int j = 0; j < i; j++) {
left += w[j];
}
for (int k = i; k < n; k++) {
right += w[k];
}
ans = min(ans, abs(left - right));
}
cout << ans << endl;
return 0;
}
| [
"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;
for (int j = 0; j < i; j++) {
left += w[j];
}
for (int k = i; k < n; k++) {
right += w[k];
}
ans = min(ans, abs(left - right));
}
cout << ans << endl;
return 0;
}
| #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 (int j = 0; j < i; j++) {
left += w[j];
}
for (int k = i; k < n; k++) {
right += w[k];
}
ans = min(ans, abs(left - right));
}
cout << ans << endl;
return 0;
}
| [
"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 (int j = 0; j < i; j++) {
left += w[j];
}
for (int k = i; k < n; k++) {
right += w[k];
}
ans = min(ans, abs(left - right));
}
cout << ans << endl;
return 0;
}
| #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 (int j = 0; j < i; j++) {
left += w[j];
}
for (int k = i; k < n; k++) {
right += w[k];
}
ans = min(ans, abs(left - right));
}
cout << ans << endl;
return 0;
}
| [
"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();
cout << "------------------------------------\n";
rep(i, n) cout << i << " " << vec.at(i) << "\n";
cout << "------------------------------------\n";
}
void pr2d(vector<vector<ll>> vec) { // for debug
ll h = vec.size();
ll w = vec.at(0).size();
cout << "------------------------------------\n";
rep(i, h) {
rep(j, w) { cout << vec.at(i).at(j) << " "; }
cout << "\n";
}
cout << "------------------------------------\n";
}
int main() {
ll n;
vector<ll> w(n);
rep(i, n) cin >> w.at(i);
ll ans = INF;
for (int i = 0; i < n - 1; i++) {
ll s1 = 0, s2 = 0;
for (int j = 0; j < n; j++) {
if (j <= i)
s1 += w.at(j);
else
s2 += w.at(j);
}
ans = min(ans, abs(s1 - s2));
}
cout << ans << endl;
} | #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();
cout << "------------------------------------\n";
rep(i, n) cout << i << " " << vec.at(i) << "\n";
cout << "------------------------------------\n";
}
void pr2d(vector<vector<ll>> vec) { // for debug
ll h = vec.size();
ll w = vec.at(0).size();
cout << "------------------------------------\n";
rep(i, h) {
rep(j, w) { cout << vec.at(i).at(j) << " "; }
cout << "\n";
}
cout << "------------------------------------\n";
}
int main() {
ll n;
cin >> n;
vector<ll> w(n);
rep(i, n) cin >> w.at(i);
ll ans = INF;
for (int i = 0; i < n - 1; i++) {
ll s1 = 0, s2 = 0;
for (int j = 0; j < n; j++) {
if (j <= i)
s1 += w.at(j);
else
s2 += w.at(j);
}
ans = min(ans, abs(s1 - s2));
}
cout << ans << endl;
} | [] | 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>
#include <math.h>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdlib.h>
#include <time.h>
#include <utility>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(max(a + b, b + c), a + c);
} | #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>
#include <math.h>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdlib.h>
#include <time.h>
#include <utility>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(min(a + b, b + c), a + c);
} | [
"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;
return (0);
} | #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 << endl;
return (0);
} | [
"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++)
ans = min(ans, XW[N] - 2 * XW[i]);
cout << ans;
} | #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++)
ans = min(ans, abs(XW[N] - 2 * XW[i]));
cout << ans;
} | [
"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++)
ans = min(ans, XW[N] - XW[i]);
cout << ans;
}
| #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++)
ans = min(ans, abs(XW[N] - 2 * XW[i]));
cout << ans;
} | [
"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];
ans = min(ans, abs(s1 - s2));
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> 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 + 1];
ans = min(ans, abs(s1 - s2));
}
cout << ans << endl;
} | [
"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++) {
s2 += w[j];
}
d = s1 - s2;
d = sqrt(d * d);
if (d < ans)
ans = d;
}
cout << ans << endl;
}
| #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; j++) {
s2 += w[j];
}
d = s1 - s2;
d = sqrt(d * d);
if (d < ans)
ans = d;
}
cout << ans << endl;
} | [
"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++) {
s2 += w[j];
}
d = s1 - s2;
d = sqrt(d * d);
if (d < ans)
ans = d;
}
cout << ans << endl;
}
| #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; j++) {
s2 += w[j];
}
d = s1 - s2;
d = sqrt(d * d);
if (d < ans)
ans = d;
// out << s1 << " " << s2 << " " << d << " " << ans << endl;
}
cout << ans << endl;
} | [
"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 += W.at(i);
num = min(num, abs(mum - (sum - mum)));
}
cout << num << endl;
return 0;
}
| #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);
mum += W.at(i);
num = min(num, abs(mum - (sum - mum)));
}
cout << num << endl;
return 0;
}
| [] | 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++)
s2 = s2 + w[k];
s = abs(s1 - s2);
if (s < min)
min = s;
}
cout << s;
}
| #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++)
s2 = s2 + w[k];
s = abs(s1 - s2);
if (s < min)
min = s;
}
cout << min;
}
| [
"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 = 0; i < n; i++)
#define Rep(i, a, b) for (int i = a; i < b + 1; i++)
#define Per(i, b, a) for (int i = b; i >= a; i--)
int main() {
int N;
cin >> N;
int *W = new int[N];
rep(i, N) cin >> W[i];
int sum = 0;
rep(i, N) sum += W[i];
int ans = sum;
sum = 0;
rep(i, N) {
sum += W[i];
ans = min(ans, abs(N - 2 * sum));
}
cout << ans << endl;
return 0;
} | #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 = 0; i < n; i++)
#define Rep(i, a, b) for (int i = a; i < b + 1; i++)
#define Per(i, b, a) for (int i = b; i >= a; i--)
int main() {
int N;
cin >> N;
int *W = new int[N];
rep(i, N) cin >> W[i];
int sum = 0;
rep(i, N) sum += W[i];
int ans = sum;
int temp = 0;
rep(i, N) {
temp += W[i];
ans = min(ans, abs(sum - 2 * temp));
}
cout << ans << endl;
return 0;
} | [
"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) for (int i = (a); i < (n); i++)
#define ll long long
#define llint long long int
#define sort(s) sort(s.begin(), s.end())
#define reverse(v) reverse(v.begin(), v.end());
#define Yes(ans) \
if (ans) \
cout << "Yes" << endl; \
else \
cout << "No" << endl;
#define YES(ans) \
if (ans) \
cout << "YES" << endl; \
else \
cout << "NO" << endl;
#define hei(a) vector<a>
#define whei(a) vector<vector<a>>
#define UF UnionFind
#define rt0 return 0
#define INF 100000000
constexpr auto mod = 1000000007;
//辞書順はnext_permutation( begin( v ), end( v ) );やで！
// 2のn乗を求めるよ！！！
int ni(int n) {
if (n == 0)
return 1;
int x = ni(n / 2);
x *= x;
if (n % 2 == 1)
x *= 2;
return x;
}
//フィボナッチ数列のx番目を求めるよ！
llint f(int x, vector<llint> &s) {
if (x == 0)
return 0;
if (x == 1)
return 1;
if (s[x] != 0)
return s[x];
return s[x] = f(x - 1, s) + f(x - 2, s);
}
// aとｂの最大公約数を求めるよ！
llint gcd(llint a, llint b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
return gcd(b, a % b);
}
// a^n mod を計算する
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// mod. m での a の逆元 a^{-1} を計算するよ！
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
// aCbをmod.mで割った余りを求める
ll int c(ll int a, ll int b, ll int m) {
ll int ans = 1;
for (ll int i = 0; i < b; i++) {
ans *= a - i;
ans %= m;
}
for (ll int i = 1; i <= b; i++) {
ans *= modinv(i, m);
ans %= m;
}
return ans;
}
// m進数のn桁を全列挙やで
int dfs(int m, int n, vector<int> a, vector<int> s) {
int MIN = 100000000;
stack<string> st;
st.push("");
while (!st.empty()) {
string now = st.top();
st.pop();
if (now.size() == n) {
int x[3] = {0};
int y[3] = {0};
for (int i = 0; i < n; i++) {
if (now[i] - '0' != 3) {
x[now[i] - '0'] += s[i];
y[now[i] - '0']++;
}
}
int sum = 0;
int ng = 0;
for (int i = 0; i < 3; i++) {
if (x[i] == 0)
ng = 1;
sum += abs(x[i] - a[i]);
if (y[i] > 1)
sum += 10 * (y[i] - 1);
}
if (ng == 0)
MIN = min(MIN, sum);
} else {
for (int i = m - 1; i >= 0; i--) {
string next = now + to_string(i);
st.push(next);
}
}
}
return MIN;
}
//迷路やで
void bfs() {
int sx, sy;
int gx, gy;
int h, w;
cin >> h >> w;
cin >> sx >> sy >> gx >> gy;
sx--;
sy--;
gx--;
gy--;
whei(char) a(h, vector<char>(w));
whei(int) d(h, vector<int>(w, INF));
rep(i, 0, h) rep(j, 0, w) { cin >> a[i][j]; }
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
d[sx][sy] = 0;
queue<pair<int, int>> que;
que.push(pair<int, int>(sx, sy));
while (que.size()) {
pair<int, int> p = que.front();
que.pop();
if (p.first == gx && p.second == gy)
break;
for (int i = 0; i < 4; i++) {
int nx = p.first + dx[i];
int ny = p.second + dy[i];
if (0 <= nx && 0 <= ny && nx < h && ny < w && a[nx][ny] != '#' &&
d[nx][ny] == INF) {
que.push(pair<int, int>(nx, ny));
d[nx][ny] = d[p.first][p.second] + 1;
}
}
}
cout << d[gx][gy] << endl;
}
void press(vector<int> &v) { v.erase(unique((v).begin(), (v).end()), v.end()); }
void press(vector<char> &v) {
v.erase(unique((v).begin(), (v).end()), v.end());
}
llint min(llint a, llint b) {
if (a < b)
return a;
return b;
}
llint max(llint a, llint b) {
if (a < b)
swap(a, b);
return a;
}
llint p(int n) {
if (n == 1)
return 1;
return n * p(n - 1);
}
struct UnionFind {
vector<int> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(int N) : par(N) { //最初は全てが根であるとして初期化
for (int i = 0; i < N; i++)
par[i] = i;
}
int size(int a) { return par[root(a)]; }
int root(int x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) { // xとyの木を併合
int rx = root(x); // xの根をrx
int ry = root(y); // yの根をry
if (rx == ry)
return; // xとyの根が同じ(=同じ木にある)時はそのまま
par[rx] =
ry; // xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
}
bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
int main() {
int n;
cin >> n;
hei(int) a(n);
int sum = 0;
rep(i, 0, n) {
cin >> a[i];
sum += a[i];
}
int x = 0;
int ans = 1000000;
rep(i, 0, n) {
x += a[i];
ans = min(ans, abs(sum - x));
}
cout << ans << endl;
return 0;
}
| #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) for (int i = (a); i < (n); i++)
#define ll long long
#define llint long long int
#define sort(s) sort(s.begin(), s.end())
#define reverse(v) reverse(v.begin(), v.end());
#define Yes(ans) \
if (ans) \
cout << "Yes" << endl; \
else \
cout << "No" << endl;
#define YES(ans) \
if (ans) \
cout << "YES" << endl; \
else \
cout << "NO" << endl;
#define hei(a) vector<a>
#define whei(a) vector<vector<a>>
#define UF UnionFind
#define rt0 return 0
#define INF 100000000
constexpr auto mod = 1000000007;
//辞書順はnext_permutation( begin( v ), end( v ) );やで！
// 2のn乗を求めるよ！！！
int ni(int n) {
if (n == 0)
return 1;
int x = ni(n / 2);
x *= x;
if (n % 2 == 1)
x *= 2;
return x;
}
//フィボナッチ数列のx番目を求めるよ！
llint f(int x, vector<llint> &s) {
if (x == 0)
return 0;
if (x == 1)
return 1;
if (s[x] != 0)
return s[x];
return s[x] = f(x - 1, s) + f(x - 2, s);
}
// aとｂの最大公約数を求めるよ！
llint gcd(llint a, llint b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
return gcd(b, a % b);
}
// a^n mod を計算する
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// mod. m での a の逆元 a^{-1} を計算するよ！
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
// aCbをmod.mで割った余りを求める
ll int c(ll int a, ll int b, ll int m) {
ll int ans = 1;
for (ll int i = 0; i < b; i++) {
ans *= a - i;
ans %= m;
}
for (ll int i = 1; i <= b; i++) {
ans *= modinv(i, m);
ans %= m;
}
return ans;
}
// m進数のn桁を全列挙やで
int dfs(int m, int n, vector<int> a, vector<int> s) {
int MIN = 100000000;
stack<string> st;
st.push("");
while (!st.empty()) {
string now = st.top();
st.pop();
if (now.size() == n) {
int x[3] = {0};
int y[3] = {0};
for (int i = 0; i < n; i++) {
if (now[i] - '0' != 3) {
x[now[i] - '0'] += s[i];
y[now[i] - '0']++;
}
}
int sum = 0;
int ng = 0;
for (int i = 0; i < 3; i++) {
if (x[i] == 0)
ng = 1;
sum += abs(x[i] - a[i]);
if (y[i] > 1)
sum += 10 * (y[i] - 1);
}
if (ng == 0)
MIN = min(MIN, sum);
} else {
for (int i = m - 1; i >= 0; i--) {
string next = now + to_string(i);
st.push(next);
}
}
}
return MIN;
}
//迷路やで
void bfs() {
int sx, sy;
int gx, gy;
int h, w;
cin >> h >> w;
cin >> sx >> sy >> gx >> gy;
sx--;
sy--;
gx--;
gy--;
whei(char) a(h, vector<char>(w));
whei(int) d(h, vector<int>(w, INF));
rep(i, 0, h) rep(j, 0, w) { cin >> a[i][j]; }
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
d[sx][sy] = 0;
queue<pair<int, int>> que;
que.push(pair<int, int>(sx, sy));
while (que.size()) {
pair<int, int> p = que.front();
que.pop();
if (p.first == gx && p.second == gy)
break;
for (int i = 0; i < 4; i++) {
int nx = p.first + dx[i];
int ny = p.second + dy[i];
if (0 <= nx && 0 <= ny && nx < h && ny < w && a[nx][ny] != '#' &&
d[nx][ny] == INF) {
que.push(pair<int, int>(nx, ny));
d[nx][ny] = d[p.first][p.second] + 1;
}
}
}
cout << d[gx][gy] << endl;
}
void press(vector<int> &v) { v.erase(unique((v).begin(), (v).end()), v.end()); }
void press(vector<char> &v) {
v.erase(unique((v).begin(), (v).end()), v.end());
}
llint min(llint a, llint b) {
if (a < b)
return a;
return b;
}
llint max(llint a, llint b) {
if (a < b)
swap(a, b);
return a;
}
llint p(int n) {
if (n == 1)
return 1;
return n * p(n - 1);
}
struct UnionFind {
vector<int> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(int N) : par(N) { //最初は全てが根であるとして初期化
for (int i = 0; i < N; i++)
par[i] = i;
}
int size(int a) { return par[root(a)]; }
int root(int x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) { // xとyの木を併合
int rx = root(x); // xの根をrx
int ry = root(y); // yの根をry
if (rx == ry)
return; // xとyの根が同じ(=同じ木にある)時はそのまま
par[rx] =
ry; // xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
}
bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
int main() {
int n;
cin >> n;
hei(int) a(n);
int sum = 0;
rep(i, 0, n) {
cin >> a[i];
sum += a[i];
}
int x = 0;
int ans = 1000000;
rep(i, 0, n) {
x += a[i];
ans = min(ans, abs((sum - x) - x));
}
cout << ans << endl;
return 0;
}
| [
"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;
int b = 0;
for (int i = 0; i < N; i++) {
sum2 += A.at(i);
kotae = min(kotae, 2 * sum2 - sum);
}
cout << kotae << endl;
return 0;
} | #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;
int b = 0;
for (int i = 0; i < N; i++) {
sum2 += A.at(i);
kotae = min(kotae, abs(2 * sum2 - sum));
}
cout << kotae << endl;
return 0;
} | [
"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> void chmin(t &a, u b) {
if (b < a)
a = b;
}
// const long long INF = 1LL << 60;
int INF = 500000;
int MAX = 1e5 + 10;
ll mod = 998244353;
int main() {
int n, total_w = 0;
cin >> n;
vector<int> w(n, 0);
rep(i, n) {
cin >> w[i];
total_w += w[i];
}
int res = INF;
for (int i = 1; i < n - 1; i++) {
int s1 = 0, s2 = 0;
for (int j = 0; j < n; j++) {
if (j < i)
s1 += w[j];
else
s2 += w[j];
}
int tmp = abs(s1 - s2);
chmin(res, tmp);
}
cout << res << endl;
} | #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> void chmin(t &a, u b) {
if (b < a)
a = b;
}
// const long long INF = 1LL << 60;
int INF = 500000;
int MAX = 1e5 + 10;
ll mod = 998244353;
int main() {
int n, total_w = 0;
cin >> n;
vector<int> w(n, 0);
rep(i, n) {
cin >> w[i];
total_w += w[i];
}
int res = INF;
for (int i = 1; i < n; i++) {
int s1 = 0, s2 = 0;
for (int j = 0; j < n; j++) {
if (j < i)
s1 += w[j];
else
s2 += w[j];
}
int tmp = abs(s1 - s2);
chmin(res, tmp);
}
cout << res << endl;
} | [
"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);
} else {
sm1 += w.at(j);
}
}
mn = min(mn, abs(sm1 - sm2));
}
cout << mn << endl;
return 0;
}
| #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);
} else {
sm1 += w.at(j);
}
}
mn = min(mn, abs(sm1 - sm2));
}
cout << mn << endl;
return 0;
}
| [
"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") << endl
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const vector<int> di = {-1, 0, 1, 0};
const vector<int> dj = {0, -1, 0, 1};
void chmin(int &a, int b) {
if (a > b)
a = b;
}
ll GCD(ll a, ll b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
ll LCM(ll a, ll b) {
ll g = GCD(a, b);
return a / g * b;
}
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 sum = s[n];
int ans = INF;
rep(i, n) { ans = min(ans, (sum - 2 * s[i])); }
cout << ans << endl;
} | #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") << endl
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const vector<int> di = {-1, 0, 1, 0};
const vector<int> dj = {0, -1, 0, 1};
void chmin(int &a, int b) {
if (a > b)
a = b;
}
ll GCD(ll a, ll b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
ll LCM(ll a, ll b) {
ll g = GCD(a, b);
return a / g * b;
}
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 sum = s[n];
int ans = INF;
rep(i, n) { ans = min(ans, abs(sum - 2 * s[i])); }
cout << ans << endl;
} | [
"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];
else
s_b += w[j];
ans = min(abs(s_a - s_b), ans);
}
}
cout << ans << endl;
} | #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];
else
s_b += w[j];
}
ans = min(abs(s_a - s_b), ans);
}
cout << ans << endl;
} | [] | 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++)
l += w[j];
for (int j = i; j < n; j++)
r += w[j];
ans = min(ans, abs(i - r));
}
std::cout << ans << "\n";
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int 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++)
l += w[j];
for (int j = i; j < n; j++)
r += w[j];
ans = min(ans, abs(l - r));
}
std::cout << ans << "\n";
return 0;
}
| [
"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);
}
for (int k = i; k < n; k++) {
su += l.at(k);
}
if (max(su, sum) - min(su, sum) < ans) {
ans = max(su, sum) - min(su, sum);
}
}
cout << ans << endl;
} | #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);
}
for (int k = i; k < n; k++) {
su += l.at(k);
}
if (max(su, sum) - min(su, sum) < ans) {
ans = max(su, sum) - min(su, sum);
}
}
cout << ans << endl;
} | [
"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++) {
sum2 += w[j];
}
mi = min(mi, (int)abs(sum1 - sum2));
}
cout << mi;
}
| #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++) {
sum2 += w[j];
}
mi = min(mi, (int)abs(sum1 - sum2));
}
cout << mi;
}
| [
"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++) {
sum2 += w[j];
}
mi = min(mi, (int)abs(sum1 - sum2));
}
cout << mi;
}
| #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++) {
sum2 += w[j];
}
mi = min(mi, (int)abs(sum1 - sum2));
}
cout << mi;
}
| [
"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); \
cin.tie(0); \
cout.tie(0);
#define read \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
const int maxn = 1e5 + 5;
const int mod = 1e9 + 7;
const int inf = 1e9;
const int del = 728729;
int arr[maxn];
int ps[maxn];
int main() {
migmig;
int n;
cin >> n;
int an = inf;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
ps[0] = arr[0];
for (int i = 1; i < n; i++) {
ps[i] = ps[i - 1] + arr[i];
}
for (int i = 0; i < n - 1; i++) {
int l = ps[i];
int r = ps[n] - ps[i];
int x = abs(l - r);
an = min(an, x);
}
cout << an;
}
| // 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); \
cin.tie(0); \
cout.tie(0);
#define read \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
const int maxn = 1e5 + 5;
const int mod = 1e9 + 7;
const int inf = 1e9;
const int del = 728729;
int arr[maxn];
int ps[maxn];
int main() {
migmig;
int n;
cin >> n;
int an = inf;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
ps[0] = arr[0];
for (int i = 1; i < n; i++) {
ps[i] = ps[i - 1] + arr[i];
}
for (int i = 0; i < n - 1; i++) {
int l = ps[i];
int r = ps[n - 1] - ps[i];
int x = abs(l - r);
an = min(an, x);
}
cout << an;
}
| [
"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;
vector<int> w(n);
rep(i, 0, n) cin >> w[i];
int min = INF;
rep(i, 1, n) {
int sumb = 0;
int suma = 0;
rep(j, 0, i) sumb += w[i];
rep(j, i, n) suma += w[i];
int ans = abs(sumb - suma);
if (ans <= min)
min = ans;
}
cout << min << endl;
} | #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;
vector<int> w(n);
rep(i, 0, n) cin >> w[i];
int min = 1000000;
rep(i, 1, n) {
int sumb = 0;
int suma = 0;
rep(j, 0, i) sumb += w[j];
rep(j, i, n) suma += w[j];
int ans = abs(sumb - suma);
if (ans <= min)
min = ans;
}
cout << min << endl;
} | [
"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[i];
}
for (int i = 0; i < N - 1; i++) {
sum1 += W[i];
sum2 = sum - sum1;
SA = abs(sum1 - sum2);
minn = min(minn, SA);
}
cout << minn << endl;
}
| #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];
sum += W[i];
}
for (int i = 0; i < N - 1; i++) {
sum1 += W[i];
sum2 = sum - sum1;
SA = abs(sum1 - sum2);
minn = min(minn, SA);
}
cout << minn << endl;
}
| [
"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) printf("%s\n", a);
int asc(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main(void) {
int N, sum(0), min(0), ans(100000);
scin(N) int W[N];
rep(i, 0, N) { scin(W[i]) sum += W[i]; }
rep(i, 0, N - 1) {
min += W[i];
if (abs(sum - 2 * min) < ans)
ans = sum - 2 * min;
}
anin(ans) return 0;
} | #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) printf("%s\n", a);
int asc(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main(void) {
int N, sum(0), min(0), ans(100000);
scin(N) int W[N];
rep(i, 0, N) { scin(W[i]) sum += W[i]; }
rep(i, 0, N - 1) {
min += W[i];
if (abs(sum - 2 * min) < ans)
ans = abs(sum - 2 * min);
}
anin(ans) return 0;
} | [
"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()
#define debug(x) cout << #x << " = " << (x) << endl;
#define SORT(x) sort(all(x));
#define RSORT(x) sort(rall(x));
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<double>;
using vb = vector<bool>;
using pii = pair<int, int>;
using vc = vector<char>;
using vvc = vector<vc>;
using vs = vector<string>;
using tiii = tuple<int, int, int>;
const ll inf = 1ll << 29;
const ll mod = 1000000007;
const double eps = 1e-9;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
int N;
cin >> N;
vi W(N);
rep(i, N) cin >> W.at(i);
int S = accumulate(all(W), 0);
int ans = 10000;
rep(T, N - 1) {
int S1 = accumulate(W.begin(), W.begin() + T + 1, 0);
debug(S1);
int S2 = S - S1;
ans = min(ans, abs(S1 - S2));
}
cout << ans << endl;
} | #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()
#define debug(x) cout << #x << " = " << (x) << endl;
#define SORT(x) sort(all(x));
#define RSORT(x) sort(rall(x));
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<double>;
using vb = vector<bool>;
using pii = pair<int, int>;
using vc = vector<char>;
using vvc = vector<vc>;
using vs = vector<string>;
using tiii = tuple<int, int, int>;
const ll inf = 1ll << 29;
const ll mod = 1000000007;
const double eps = 1e-9;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
int N;
cin >> N;
vi W(N);
rep(i, N) cin >> W.at(i);
int S = accumulate(all(W), 0);
int ans = 10000;
rep(T, N - 1) {
int S1 = accumulate(W.begin(), W.begin() + T + 1, 0);
int S2 = S - S1;
ans = min(ans, abs(S1 - S2));
}
cout << ans << endl;
} | [
"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.at(j);
if (abs(l - r) < ans) {
ans = abs(l - r);
}
}
}
cout << ans << endl;
} | #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(j);
}
if (abs(l - r) < ans)
ans = abs(l - r);
}
cout << ans << endl;
} | [
"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 << ans;
return 0;
}
| #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 << ans;
return 0;
}
| [
"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, abs(s2 - s1));
}
cout << temp << endl;
} | #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);
// cout << abs(s2-s1);
temp = min(temp, abs(s2 - s1));
}
cout << temp << endl;
}
| [] | 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(), vvv.end())
int inf = 1000000007;
i64 giant = 4000000000000000000;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> data(n);
int sum = 0;
ff(i, 0, n) {
cin >> data[i];
sum += data[i];
}
int ans = inf;
int pre = 0;
ff(i, 0, n) {
pre += data[i];
ans = min(abs(sum - pre), ans);
}
cout << ans << endl;
return 0;
} | #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(), vvv.end())
int inf = 1000000007;
i64 giant = 4000000000000000000;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> data(n);
int sum = 0;
ff(i, 0, n) {
cin >> data[i];
sum += data[i];
}
int ans = inf;
int pre = 0;
ff(i, 0, n) {
pre += data[i];
ans = min(abs(sum - pre * 2), ans);
}
cout << ans << endl;
return 0;
} | [
"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];
for (int i = 0; i < N; i++) {
scanf("%d", W + i);
}
int ret = INF;
for (int i = 1; i < N - 1; i++) {
ret = min(ret, abs(std::accumulate(W, W + i, 0) -
accumulate(W + i + 1, W + N, 0)));
}
printf("%d", ret);
return;
}
int main() {
FILE *fin = NULL, *fout = NULL;
// fin = freopen("input.txt", "r", stdin);
// fout = freopen("output.txt", "w", stdout);
solv();
// finalize
if (NULL != fin)
fclose(fin);
if (NULL != fout)
fclose(fout);
return 0;
} | #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];
for (int i = 0; i < N; i++) {
scanf("%d", W + i);
}
int ret = INF;
for (int i = 1; i < N; i++) {
ret = min(ret,
abs(std::accumulate(W, W + i, 0) - accumulate(W + i, W + N, 0)));
}
printf("%d", ret);
return;
}
int main() {
FILE *fin = NULL, *fout = NULL;
// fin = freopen("input.txt", "r", stdin);
// fout = freopen("output.txt", "w", stdout);
solv();
// finalize
if (NULL != fin)
fclose(fin);
if (NULL != fout)
fclose(fout);
return 0;
} | [
"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 += W[j];
ans = min(ans, abs(r - l));
}
cout << ans << endl;
}
| #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 += W[j];
ans = min(ans, abs(r - l));
}
cout << ans << endl;
}
| [
"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 += W[j];
ans = min(ans, abs(r - l));
}
cout << ans << endl;
}
| #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 += W[j];
ans = min(ans, abs(r - l));
}
cout << ans << endl;
}
| [
"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++) {
S2 += A[k];
}
ans = min(ans, abs(S1 - S2));
}
cout << ans << endl;
return 0;
} | #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++) {
S2 += A[k];
}
ans = min(ans, abs(S1 - S2));
}
cout << ans << endl;
return 0;
} | [
"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;
}
for (int t = 0; t < n; t++) {
left = sw[t];
right = sum - left;
ab[t] = abs(right - left);
}
ansmin = ab[0];
for (int k = 1; k < n; k++) {
if (ansmin > ab[k])
ansmin = ab[k];
}
cout << ansmin;
return 0;
} | #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] = sum;
}
for (int t = 0; t < n; t++) {
left = sw[t];
right = sum - left;
ab[t] = abs(right - left);
}
ansmin = ab[0];
for (int k = 1; k < n; k++) {
if (ansmin > ab[k])
ansmin = ab[k];
}
cout << ansmin;
return 0;
} | [
"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;
}
for (int t = 0; t < n; t++) {
left = sw[t];
right = sum - left;
ab[t] = abs(right - left);
}
ansmin = ab[0];
for (int k = 1; k < n; k++) {
if (ansmin > ab[k])
ansmin = ab[k];
}
cout << ansmin;
return 0;
} | #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] = sum;
}
for (int t = 0; t < n; t++) {
left = sw[t];
right = sum - left;
ab[t] = abs(right - left);
}
ansmin = ab[0];
for (int k = 1; k < n; k++) {
if (ansmin > ab[k])
ansmin = ab[k];
}
cout << ansmin;
return 0;
} | [
"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;
sa = min(sa, abs(waf - wab));
}
cout << sa << endl;
} | #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 = min(sa, abs(waf - wab));
}
cout << sa << endl;
} | [
"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 = 0; matsuri < n; matsuri++) {
// left += w[now];
// right -= w[now];
left += w[matsuri];
right -= w[matsuri];
tmp = abs(left - right);
// cout << "tmp:" << tmp << endl;
ans = min(ans, tmp);
// now++;
}
cout << ans << endl;
return 0;
} | // 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 = 0; matsuri < n; matsuri++) {
// left += w[now];
// right -= w[now];
left += w[matsuri];
right -= w[matsuri];
tmp = abs(left - right);
// cout << "tmp:" << tmp << endl;
ans = min(ans, tmp);
// now++;
}
cout << ans << endl;
return 0;
} | [
"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; matsuri < n; matsuri++) {
// left += w[now];
// right -= w[now];
left += w[matsuri];
right -= w[matsuri];
tmp = abs(left - right);
// cout << "tmp:" << tmp << endl;
ans = min(ans, tmp);
// now++;
}
cout << ans << endl;
return 0;
} | // 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 = 0; matsuri < n; matsuri++) {
// left += w[now];
// right -= w[now];
left += w[matsuri];
right -= w[matsuri];
tmp = abs(left - right);
// cout << "tmp:" << tmp << endl;
ans = min(ans, tmp);
// now++;
}
cout << ans << endl;
return 0;
} | [
"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++)
b += vec.at(j);
int sub;
sub = abs(a - b);
if (sub < sub_min)
sub_min = sub;
}
cout << sub_min << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> 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++)
b += vec.at(j);
int sub;
sub = abs(a - b);
if (sub < sub_min)
sub_min = sub;
}
cout << sub_min << endl;
}
| [
"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 long ll;
using namespace std;
// main
int main() {
int N;
cin >> N;
vector<int> W(N);
vector<int> ans(N - 1);
rep(i, N) cin >> W[i];
int sum = accumulate(ALL(W), 0);
int psum;
rep(i, N - 1) {
psum = accumulate(W.begin(), W.begin() + i, 0);
ans[i] = abs(sum - 2 * psum);
}
cout << *min_element(ALL(ans)) << endl;
}
| // 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 long ll;
using namespace std;
// main
int main() {
int N;
cin >> N;
vector<int> W(N);
vector<int> ans(N - 1);
rep(i, N) cin >> W[i];
int sum = accumulate(ALL(W), 0);
int psum;
rep(i, N - 1) {
psum = accumulate(W.begin(), W.begin() + i + 1, 0);
ans[i] = abs(sum - 2 * psum);
}
cout << *min_element(ALL(ans)) << endl;
}
| [
"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;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
#define rep(i, n) for (int i = 0; i < n; i++)
#define fin(ans) cout << (ans) << endl
#define P 1000000007
#define STI(s) atoi(s.c_str()) // string to int
#define mp(p, q) make_pair(p, q)
#define Sort(a) sort(a.begin(), a.end())
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = INT_MAX;
const long long LLINF = 1LL << 60;
// g++ -std=c++1z temp.cpp
//./a.exe
ll gcd(ll c, ll d) { return d ? gcd(d, c % d) : c; }
ll lcm(ll c, ll d) { return c / gcd(c, d) * d; }
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
//////////////////////////////////////////////////////
int n, w[1000] = {}, s = 0, s1 = 0, s2 = 0, s3 = 0;
cin >> n;
rep(i, n) { cin >> w[i]; }
rep(i, n) { s += w[i]; }
rep(i, n) {
s1 += w[i];
s2 = s - s1;
s3 = min(abs(s1 - s2), s3);
}
cout << s3 << endl;
//////////////////////////////////////////////////////
return 0;
} | #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;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
#define rep(i, n) for (int i = 0; i < n; i++)
#define fin(ans) cout << (ans) << endl
#define P 1000000007
#define STI(s) atoi(s.c_str()) // string to int
#define mp(p, q) make_pair(p, q)
#define Sort(a) sort(a.begin(), a.end())
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = INT_MAX;
const long long LLINF = 1LL << 60;
// g++ -std=c++1z temp.cpp
//./a.exe
ll gcd(ll c, ll d) { return d ? gcd(d, c % d) : c; }
ll lcm(ll c, ll d) { return c / gcd(c, d) * d; }
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
//////////////////////////////////////////////////////
int n, w[1000] = {}, s = 0, s1 = 0, s2 = 0, s3 = INF;
cin >> n;
rep(i, n) { cin >> w[i]; }
rep(i, n) { s += w[i]; }
rep(i, n) {
s1 += w[i];
s2 = s - s1;
s3 = min(abs(s1 - s2), s3);
}
cout << s3 << endl;
//////////////////////////////////////////////////////
return 0;
} | [
"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[n] - sum[i] * 2);
ans = min(t, ans);
}
cout << ans;
} | #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[n - 1] - sum[i] * 2);
ans = min(t, ans);
}
cout << ans;
}
| [
"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 = min(abs(sum[N - 1] - sum[i]), m);
}
cout << m << endl;
return 0;
} | #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 = min(abs(sum[N - 1] - 2 * sum[i]), m);
}
cout << m << endl;
return 0;
} | [
"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 = 0;
int S_2 = 0;
for (int j = 0; j < N; j++) {
if (j <= T) {
S_1 = +wei.at(j);
} else {
S_2 = +wei.at(j);
}
}
if (abs(S_1, S_2) <= res) {
res = abs(S_1, S_2);
}
}
cout << res << endl;
} | #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 = 0;
int S_2 = 0;
for (int j = 0; j < N; j++) {
if (j <= T) {
S_1 += wei.at(j);
} else {
S_2 += wei.at(j);
}
}
if (abs(S_1, S_2) <= res) {
res = abs(S_1, S_2);
}
}
cout << res << endl;
} | [
"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++) {
if (arr[i] <= t)
sum += arr[i];
else if (arr[i] > t)
sum1 += arr[i];
}
y = abs(sum - sum1);
s = min(s, y);
}
cout << s;
}
| #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++) {
if (i <= t)
sum += arr[i];
else if (i > t)
sum1 += arr[i];
}
y = abs(sum - sum1);
s = min(s, y);
}
cout << s;
}
| [
"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<int> w(n);
vector<int> ans(n);
vector<int> ans1(n);
rep(i, n) {
cin >> w[i];
i == 0 ? ans[i] = w[i] : ans[i] = ans[i - 1] + w[i];
}
irep(i, n) { i == n - 1 ? ans1[i] = w[i] : ans1[i] = ans1[i + 1] + w[i]; }
int min_a = 114514;
for (int i = 1; i != n - 1; i++) {
min_a = min(min_a, abs(ans[i - 1] - ans1[i + 1]));
}
cout << min_a << endl;
}
| #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<int> w(n);
vector<int> ans(n);
vector<int> ans1(n);
rep(i, n) {
cin >> w[i];
i == 0 ? ans[i] = w[i] : ans[i] = ans[i - 1] + w[i];
}
irep(i, n) { i == n - 1 ? ans1[i] = w[i] : ans1[i] = ans1[i + 1] + w[i]; }
int min_a = 114514;
for (int i = 0; i != n - 1; i++) {
min_a = min(min_a, abs(ans[i] - ans1[i + 1]));
}
cout << min_a << endl;
}
| [
"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 int maxn = 1e5 + 5;
int n, a[maxn], tot;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
tot += a[i];
}
int ans = 1e9;
int cur = a[0];
for (int i = 1; i < n - 1; i++) {
int rt = abs(tot - cur);
ans = min(ans, abs(rt - cur));
cur += a[i];
}
cout << ans << endl;
return 0;
}
| #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 int maxn = 1e5 + 5;
int n, a[maxn], tot;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
tot += a[i];
}
int ans = 1e9;
int cur = a[0];
for (int i = 1; i < n; i++) {
int rt = abs(tot - cur);
ans = min(ans, abs(rt - cur));
cur += a[i];
}
cout << ans << endl;
return 0;
}
| [
"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);
}
cout << m << endl;
return 0;
} | #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);
}
cout << m << endl;
return 0;
} | [
"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;
rep(i, n) {
cin >> w[i];
sum += w[i];
}
int min_v = INF;
int a_sum = 0;
rep(i, n) {
a_sum += w[i];
min_v = min(min_v, abs(sum - a_sum));
}
cout << min_v << endl;
return 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;
rep(i, n) {
cin >> w[i];
sum += w[i];
}
int min_v = INF;
int a_sum = 0;
rep(i, n) {
a_sum += w[i];
min_v = min(min_v, abs(sum - 2 * a_sum));
}
cout << min_v << endl;
return 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)
cin >> a[i], s += a[i];
int z = 0, sol = 1e9;
for (int t = 1; t < n; ++t) {
z += a[t - 1];
sol = min(sol, abs(z - s));
}
cout << sol;
}
| #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)
cin >> a[i], s += a[i];
int z = 0, sol = 1e9;
for (int t = 1; t < n; ++t) {
z += a[t - 1];
sol = min(sol, abs(z - (s - z)));
}
cout << sol;
}
| [
"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++)
sum += W[j];
for (int j = i + 1; j < N; j++)
sum -= W[i];
ans = min(ans, abs(sum));
}
cout << ans << endl;
} | #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++)
sum += W[j];
for (int j = i + 1; j < N; j++)
sum -= W[j];
ans = min(ans, abs(sum));
}
cout << ans << endl;
} | [
"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; j++) {
r += arr[i];
}
diff = min(diff, abs(l - r));
}
cout << diff;
}
| #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; j++) {
r += arr[j];
}
diff = min(diff, abs(l - r));
}
cout << diff;
}
| [
"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 = sum;
int pre_sum = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
pre_sum += a[i];
mini = min(mini, abs(pre_sum - (sum - pre_sum)));
}
cout << ans << endl;
return 0;
} | #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 = sum;
int pre_sum = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
pre_sum += a[i];
mini = min(mini, abs(pre_sum - (sum - pre_sum)));
}
cout << mini << endl;
return 0;
}
| [
"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]);
rep(i, N - 1) {
if (ans > abs(sum[N - 1] - 2 * sum[i + 1]))
ans = abs(sum[N - 1] - 2 * sum[i + 1]);
}
cout << ans << endl;
} | #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]);
rep(i, N - 1) {
if (ans > abs(sum[N - 1] - 2 * sum[i + 1]))
ans = abs(sum[N - 1] - 2 * sum[i + 1]);
}
cout << ans << endl;
return 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++) {
S1 += W[j];
}
if (std::abs(2 * S1 - sum) < min) {
min = std::abs(2 * S1 - sum);
// std::cout << "min " << min << std::endl;
}
}
std::cout << min << std::endl;
return 0;
}
| #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; j < T; j++) {
S1 += W[j];
}
// std::cout << "S1:" << S1 <<std::endl;
// std::cout << "abs" << std::abs(2*S1 - sum) << std::endl;
if (std::abs(2 * S1 - sum) < min) {
min = std::abs(2 * S1 - sum);
}
}
std::cout << min << std::endl;
return 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 * 1000 * 1000;
for (int i = 0; i < n - 1; i++) {
l += v[i];
r -= v[i];
res = min(res, abs(l - r));
}
cout << res << endl;
return 0;
}
| #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 = 1000 * 1000 * 1000;
for (int i = 0; i < n - 1; i++) {
l += v[i];
r -= v[i];
res = min(res, abs(l - r));
}
cout << res << endl;
return 0;
}
| [
"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 * 1000 * 1000;
for (int i = 0; i < n; i++) {
l += v[i];
r -= v[i];
res = min(res, abs(l - r));
}
cout << res << endl;
return 0;
}
| #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 = 1000 * 1000 * 1000;
for (int i = 0; i < n - 1; i++) {
l += v[i];
r -= v[i];
res = min(res, abs(l - r));
}
cout << res << endl;
return 0;
}
| [
"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 < n; j++)
r += w[j];
ans = min(ans, abs(l - r));
}
cout << ans << endl;
return 0;
}
| #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];
for (int j = i; j < n; j++)
r += w[j];
ans = min(ans, abs(l - r));
}
cout << ans << endl;
return 0;
}
| [
"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++) {
ans = min(ans, abs(a[n] - 2 * a[i]));
}
cout << ans << endl;
}
| #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++) {
ans = min(ans, abs(a[n] - 2 * a[i]));
}
cout << ans << endl;
}
| [
"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)
min = abs(sum - tsum - tsum);
}
cout << min << endl;
return 0;
} | #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) < min)
min = abs(sum - tsum - tsum);
}
cout << min << endl;
return 0;
} | [] | 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 = n; j >= i; j--)
sum2 += w[j];
if (i == 1)
diff = abs(sum1 - sum2);
if (diff > abs(sum1 - sum2))
diff = abs(sum1 - sum2);
sum1 = 0;
sum2 = 0;
}
cout << diff;
return 0;
} | #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 >= i; j--)
sum2 += w[j];
if (i == 1)
diff = abs(sum1 - sum2);
if (diff > abs(sum1 - sum2))
diff = abs(sum1 - sum2);
sum1 = 0;
sum2 = 0;
}
cout << diff;
return 0;
} | [
"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) {
pre += weight[j];
}
auto post = 0;
for (auto j = i; j < size; ++j) {
post += weight[j];
}
result[i - 1] = std::abs(post - pre);
}
std::cout << (*std::min_element(result.begin(), result.end()));
return 0;
} | #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 += weight[j];
}
auto post = 0;
for (auto j = i; j < size; ++j) {
post += weight[j];
}
result[i - 1] = std::abs(post - pre);
}
std::cout << (*std::min_element(result.begin(), result.end()));
return 0;
} | [
"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 >= 0; i--)
s[i] = a[i] + s[i + 1];
int sum = 0;
for (int i = 0; i < n - 1; i++)
sum = min(sum, abs(p[i] - s[i + 1]));
cout << sum;
} | #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 >= 0; i--)
s[i] = a[i] + s[i + 1];
int sum = 1000000;
for (int i = 0; i < n - 1; i++)
sum = min(sum, abs(p[i] - s[i + 1]));
cout << sum;
} | [
"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++) {
s1 += w[i];
}
s2 = 0;
for (int i = t + 1; t < n; i++) {
s2 += w[i];
}
m = min(m, abs(s1 - s2));
}
printf("%d\n", m);
return 0;
} | #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++) {
s1 += w[i];
}
s2 = 0;
for (int i = t + 1; i <= n; i++) {
s2 += w[i];
}
m = min(m, abs(s1 - s2));
}
printf("%d\n", m);
return 0;
} | [
"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++) {
s1 += w[i];
}
s2 = 0;
for (int i = t + 1; t < n; i++) {
s2 += w[i];
}
m = min(m, abs(s1 - s2));
}
printf("%d\n", m);
return 0;
} | #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++) {
s1 += w[i];
}
s2 = 0;
for (int i = t + 1; i <= n; i++) {
s2 += w[i];
}
m = min(m, abs(s1 - s2));
}
printf("%d\n", m);
return 0;
} | [
"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 << res;
return 0;
} | #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]));
}
cout << res;
return 0;
} | [
"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 = 0; i < n; ++i) {
int w;
scanf("%d", &w);
A.push_back(w);
}
int min = INF;
for (int i = 1; i < n; ++i) {
int S0 = 0;
int S1 = 0;
for (int j = 0; j < n; ++j) {
if (j < i) {
S0 += A[j];
} else {
S1 + -A[j];
}
}
int diff = abs(S0 - S1);
if (diff < min) {
min = diff;
}
}
printf("%d", min);
return 0;
} | #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 = 0; i < n; ++i) {
int w;
scanf("%d", &w);
A.push_back(w);
}
int min = INF;
for (int i = 1; i < n; ++i) {
int S0 = 0;
int S1 = 0;
for (int j = 0; j < n; ++j) {
if (j < i) {
S0 += A[j];
} else {
S1 += A[j];
}
}
int diff = abs(S0 - S1);
if (diff < min) {
min = diff;
}
}
printf("%d", min);
return 0;
} | [
"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 = 0; i < n; ++i) {
int w;
scanf("%d", &w);
A.push_back(w);
}
int min = INF;
for (int i = 1; i < n; ++i) {
int S0 = 0;
int S1 = 0;
for (int j = 0; j < n; ++j) {
if (j < i) {
S0 += A[i];
} else {
S1 + -A[i];
}
}
int diff = abs(S0 - S1);
if (diff < min) {
min = diff;
}
}
printf("%d", min);
return 0;
} | #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 = 0; i < n; ++i) {
int w;
scanf("%d", &w);
A.push_back(w);
}
int min = INF;
for (int i = 1; i < n; ++i) {
int S0 = 0;
int S1 = 0;
for (int j = 0; j < n; ++j) {
if (j < i) {
S0 += A[j];
} else {
S1 += A[j];
}
}
int diff = abs(S0 - S1);
if (diff < min) {
min = diff;
}
}
printf("%d", min);
return 0;
} | [
"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(), w.end());
for (int i = 0; i < n - 1; ++i) {
b[i + 1] = b[i] + w[i];
}
int min = 100000;
for (int i = 0; i < n - 1; ++i) {
if (min > abs(a[i] - b[n - i])) {
min = abs(a[i] - b[n - i]);
}
}
cout << min << endl;
}
| #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(), w.end());
for (int i = 0; i < n - 1; ++i) {
b[i + 1] = b[i] + w[i];
}
int min = 100000;
for (int i = 1; i < n; ++i) {
if (min > abs(a[i] - b[n - i])) {
min = abs(a[i] - b[n - i]);
}
}
cout << min << endl;
}
| [
"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++)
ans2 += w.at(l);
ans = min(ans, abs(ans1 - ans2));
}
cout << ans << endl;
}
| #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; l++) {
ans2 += w.at(l);
}
ans = min(ans, abs(ans1 - ans2));
}
cout << ans << endl;
}
| [
"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;
int p;
// 最後のconstを忘れると"instantiated from
// here"というエラーが出てコンパイルできないので注意
bool operator<(const data_t &right) const {
return s != right.s ? s < right.s : p > right.p;
}
};
int main() {
int N;
cin >> N;
int W[N];
int total;
REP(i, N) {
int w;
cin >> w;
W[i] = w;
total += w;
}
int ret = 100 * 100;
int s1 = 0;
for (int i = 0; i < N; i++) {
s1 += W[i];
int s2 = total - s1;
if (ret > abs(s1 - s2)) {
ret = abs(s1 - s2);
}
}
cout << ret << endl;
}
void cheatsheet() {
// loop
// vector<int> vec(10);
vector<int> vecloop;
REP(i, 10) { vecloop.push_back(i); }
// swap
int a = 1;
int b = 5;
swap(a, b); // -> a = 5, b = 1
// sort
int arr[] = {1, 2, 3, 4, 5, 6, 7, 8, 9};
sort(arr, arr + 9, greater<int>()); // 9 8 7 6 5 4 3 2 1
// lower
vector<int> vec(arr, end(arr));
sort(vec.begin(), vec.end());
cout << lower_bound(vec.begin(), vec.end(), 2)[0]; // 2
// map
map<Pll, ll> m;
m[Pll(10, 100)] = 100;
} | #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;
int p;
// 最後のconstを忘れると"instantiated from
// here"というエラーが出てコンパイルできないので注意
bool operator<(const data_t &right) const {
return s != right.s ? s < right.s : p > right.p;
}
};
int main() {
int N;
cin >> N;
int W[N];
int total = 0;
REP(i, N) {
int w;
cin >> w;
W[i] = w;
total += w;
}
int ret = 100 * 100;
int s1 = 0;
for (int i = 0; i < N; i++) {
s1 += W[i];
int s2 = total - s1;
if (ret > abs(s1 - s2)) {
ret = abs(s1 - s2);
}
}
cout << ret << endl;
}
void cheatsheet() {
// loop
// vector<int> vec(10);
vector<int> vecloop;
REP(i, 10) { vecloop.push_back(i); }
// swap
int a = 1;
int b = 5;
swap(a, b); // -> a = 5, b = 1
// sort
int arr[] = {1, 2, 3, 4, 5, 6, 7, 8, 9};
sort(arr, arr + 9, greater<int>()); // 9 8 7 6 5 4 3 2 1
// lower
vector<int> vec(arr, end(arr));
sort(vec.begin(), vec.end());
cout << lower_bound(vec.begin(), vec.end(), 2)[0]; // 2
// map
map<Pll, ll> m;
m[Pll(10, 100)] = 100;
} | [
"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 < N - 1; i++) {
int diff = std::abs(WS[N - 1] - 2 * WS[i]);
if (diff < min_val)
min_val = diff;
}
std::cout << min_val << std::endl;
return 0;
}
| #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; i < N - 1; i++) {
int diff = std::abs(WS[N - 1] - 2 * WS[i]);
if (diff < min_val)
min_val = diff;
}
std::cout << min_val << std::endl;
return 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 sum;
};
int diff_min = 99999999;
int best_t = 0;
for (int T = 0; T < N - 2; ++T) {
int s_1 = get_sum(0, T);
int s_2 = get_sum(T + 1, N - 1);
int diff = s_1 - s_2;
if (diff < 0) {
diff = -diff;
}
if (diff < diff_min) {
diff_min = diff;
best_t = T + 1;
}
}
cout << diff_min;
return 0;
}
| #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 sum;
};
int diff_min = 99999999;
int best_t = 0;
for (int T = 0; T < N - 1; ++T) {
int s_1 = get_sum(0, T);
int s_2 = get_sum(T + 1, N - 1);
int diff = s_1 - s_2;
if (diff < 0) {
diff = -diff;
}
if (diff < diff_min) {
diff_min = diff;
best_t = T + 1;
}
}
cout << diff_min;
return 0;
}
| [
"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)
table[i] = table[i - 1] + vec[i];
for (int i = 0; i < n; ++i) {
int s = table[i];
int r = sum - table[i];
res = min(res, abs(s - r));
}
cout << res << endl;
return 0;
}
| #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)
table[i] = table[i - 1] + vec[i];
for (int i = 0; i < n; ++i) {
int s = table[i];
int r = sum - table[i];
res = min(res, abs(s - r));
}
cout << res << endl;
return 0;
}
| [
"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 <vector>
using namespace std;
const int inf = 2147483647, dx[] = {-1, 0, 1, 0},
dy[] = {0, -1, 0, 1}; // 上 左 下 右
const int N = 100005, M = 1000005, mod = 1000000007;
const long long llinf = 9223372036854775807ll;
int n, a[105], mn, ans;
int main() {
cin >> n;
mn = 99999;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
int s1, s2;
s1 = s2 = 0;
for (int j = 1; j <= i; j++)
s1 += a[j];
for (int j = i + 1; j <= n; j++)
s2 += a[j];
if (abs(s1 - s2) < mn)
mn = abs(s1 - s2), ans = i;
}
cout << ans;
return 0;
} | #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 <vector>
using namespace std;
const int inf = 2147483647, dx[] = {-1, 0, 1, 0},
dy[] = {0, -1, 0, 1}; // 上 左 下 右
const int N = 100005, M = 1000005, mod = 1000000007;
const long long llinf = 9223372036854775807ll;
int n, a[105], mn, ans;
int main() {
cin >> n;
mn = 99999;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
int s1, s2;
s1 = s2 = 0;
for (int j = 1; j <= i; j++)
s1 += a[j];
for (int j = i + 1; j <= n; j++)
s2 += a[j];
if (abs(s1 - s2) < mn)
mn = abs(s1 - s2), ans = i;
}
cout << mn;
return 0;
}
| [
"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) for (int i = n - 1; i >= 0; i--) /// n-1番目からn回
#define REP(i, a, b) for (int i = a; i < b; i++) /// a番目からb回
#define RREP(i, a, b) for (int i = a; i < b; i--)
typedef long long int ll;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<string> vs;
#define MOD 1000003
// int arr[N]
////sort(arr,arr +N)
// vector <int> hoge
////sort(hoge.begin(),hoge.end());
///*min_element(hoge.begin(),hoge.end(); 最小値 最大値はmax_element();
///(10-(n%10))%10 1桁目取得
#define Ru(n) (((n) + 9) / 10 * 10) //切りあげ
#define Rd(n) (((n)-10) / 10 * 10 + 10) 切り捨て
int gcd(int a, int b);
size_t length(const std::string &str) { return str.length(); }
int main() {
int n, sum = 0, sum1 = 0;
int m = 0;
vi w(1000);
cin >> n;
rep(i, n) {
cin >> w[i];
sum += w[i];
}
m = sum - sum1 - sum1;
rep(i, n) {
sum1 += w[i];
// cout<<sum-sum1<<endl;
if ((m > abs(sum - sum1 - sum1)))
m = abs(sum - sum1);
}
cout << m;
return 0;
}
__int64_t product(ll m, ll d, ll n) {
if (n == 0)
return 1;
else
return ((m % MOD) * product(m + d, d, n - 1) % MOD) % MOD;
}
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
| #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) for (int i = n - 1; i >= 0; i--) /// n-1番目からn回
#define REP(i, a, b) for (int i = a; i < b; i++) /// a番目からb回
#define RREP(i, a, b) for (int i = a; i < b; i--)
typedef long long int ll;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<string> vs;
#define MOD 1000003
// int arr[N]
////sort(arr,arr +N)
// vector <int> hoge
////sort(hoge.begin(),hoge.end());
///*min_element(hoge.begin(),hoge.end(); 最小値 最大値はmax_element();
///(10-(n%10))%10 1桁目取得
#define Ru(n) (((n) + 9) / 10 * 10) //切りあげ
#define Rd(n) (((n)-10) / 10 * 10 + 10) 切り捨て
int gcd(int a, int b);
size_t length(const std::string &str) { return str.length(); }
int main() {
int n, sum = 0, sum1 = 0;
int m = 0;
vi w(1000);
cin >> n;
rep(i, n) {
cin >> w[i];
sum += w[i];
}
m = sum - sum1 - sum1;
rep(i, n) {
sum1 += w[i];
// cout<<sum-sum1<<endl;
if ((m > abs(sum - sum1 - sum1)))
m = abs(sum - sum1 - sum1);
}
cout << m;
return 0;
}
__int64_t product(ll m, ll d, ll n) {
if (n == 0)
return 1;
else
return ((m % MOD) * product(m + d, d, n - 1) % MOD) % MOD;
}
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
| [
"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; j++) {
sum2 += w[j];
}
int abs = sum1 < sum2 ? sum2 - sum1 : sum1 - sum2;
if (abs < min) {
min = abs;
}
sum1 = 0;
sum2 = 0;
}
cout << min << endl;
}
| #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++) {
sum2 += w[j];
}
int abs = sum1 < sum2 ? sum2 - sum1 : sum1 - sum2;
if (abs < min) {
min = abs;
}
sum1 = 0;
sum2 = 0;
}
cout << min << endl;
}
| [
"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 += W[N];
}
int ans;
for (int i = 0; i < N - 1; i++) {
ans = min(abs(S[N - 1] - S[i] - S[i]), ans);
}
// cout << S[N-1] << " " << ans << endl;
cout << ans << endl;
}
| #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 += W[N];
}
int ans = 1000000;
for (int i = 0; i < N - 1; i++) {
ans = min(abs(S[N - 1] - S[i] - S[i]), ans);
}
// cout << S[N-1] << " " << ans << endl;
cout << ans << endl;
}
| [
"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; i++) {
cin >> t1;
t2 = t2 + t1;
A.push_back(t2);
}
for (int i = 0; i < N - 2; i++) {
t1 = A[i] - (A[N - 1] - A[i]);
if (t1 > 0) {
B.push_back(t1);
}
if (t1 < 0) {
B.push_back(-1 * (t1));
}
}
sort(B.begin(), B.end());
cout << B.front() << endl;
} | #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; i++) {
cin >> t1;
t2 = t2 + t1;
A.push_back(t2);
}
for (int i = 0; i < N - 1; i++) {
t1 = A[i] - (A[N - 1] - A[i]);
if (t1 >= 0) {
B.push_back(t1);
}
if (t1 < 0) {
B.push_back(-1 * (t1));
}
}
sort(B.begin(), B.end());
cout << B.front() << endl;
} | [
"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);
}
for (j = i; j < weights.size(); j++) {
weightSumB += weights.at(j);
}
diff = weightSumA - weightSumB;
if (diff < 0)
diff *= -1;
if (diff < minDiff)
minDiff = diff;
}
return minDiff;
}
int main() {
int N;
cin >> N;
vector<int> weights(N);
for (int i = 0; i < N; i++)
cin >> weights.at(i);
cout << analyze(weights) << endl;
}
| #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);
}
for (j = i; j < weights.size(); j++) {
weightSumB += weights.at(j);
}
diff = weightSumA - weightSumB;
if (diff < 0)
diff *= -1;
if (diff < minDiff)
minDiff = diff;
}
return minDiff;
}
int main() {
int N;
cin >> N;
vector<int> weights(N);
for (int i = 0; i < N; i++)
cin >> weights.at(i);
cout << analyze(weights) << endl;
}
| [
"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;
const int INF = 1 << 30;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int main() {
int n;
cin >> n;
vector<int> w(n);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> w[i];
sum += w[i];
}
int ans = INF;
for (int i = 0; i < n; i++) {
int tmp = 0;
for (int j = i; j < n; j++) {
tmp += w[i];
}
ans = min(ans, abs(2 * tmp - sum));
}
cout << ans << endl;
return 0;
}
| #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;
const int INF = 1 << 30;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int main() {
int n;
cin >> n;
vector<int> w(n);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> w[i];
sum += w[i];
}
int ans = INF;
for (int i = 0; i < n; i++) {
int tmp = 0;
for (int j = i; j < n; j++) {
tmp += w[j];
}
ans = min(ans, abs(2 * tmp - sum));
}
cout << ans << endl;
return 0;
}
| [
"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(), x.end());
cout << x.at(0) << endl;
}
| #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.end());
cout << x.at(0) << endl;
}
| [
"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];
}
for (int i = 0; i < n; ++i) {
tmp += a[i];
ans = min(ans, abs(sm - tmp - tmp));
}
cout << ans << endl;
}
return 0;
}
| #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];
}
ans = sm;
for (int i = 0; i < n; ++i) {
tmp += a[i];
ans = min(ans, abs(sm - tmp - tmp));
}
cout << ans << endl;
}
return 0;
}
| [
"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++) {
if (i < t) {
s1 += W[i];
} else {
s2 += W[i];
}
}
if (abs(s1 - s2) < res) {
res = abs(s1 - s2);
}
}
printf("%d", res);
}
|
#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++) {
if (i < t) {
s1 += W[i];
} else {
s2 += W[i];
}
}
if (abs(s1 - s2) < res) {
res = abs(s1 - s2);
}
}
printf("%d", res);
}
| [
"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 = min(Ss, Smin);
// cout << "Smin" << Smin <<endl;;
// cout << "Ss" << Ss <<endl;
}
cout << Smin << endl;
} | #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 = min(Ss, Smin);
// cout << "Smin" << Smin <<endl;;
// cout << "Ss" << Ss <<endl;
}
cout << Smin << endl;
} | [
"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.