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 |
|---|---|---|---|---|---|---|---|
p02955 | #include "bits/stdc++.h"
typedef long long ll;
#define int ll
#define fi first
#define se second
#define SORT(a) sort(a.begin(), a.end())
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define MP(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define INF LLONG_MAX / 2... | #include "bits/stdc++.h"
typedef long long ll;
#define int ll
#define fi first
#define se second
#define SORT(a) sort(a.begin(), a.end())
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define MP(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define INF LLONG_MAX / 2... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 759,218 | 759,219 | u548768105 | cpp |
p02955 | #include <bits/stdc++.h>
#define M 505
using namespace std;
int A[M], n, sum, m, W[M], tail;
int main() {
int ans = 1;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
scanf("%d", &A[i]), sum += A[i];
for (int i = 1; i <= sqrt(sum); i++) {
if (sum % i != 0)
continue;
for (int j = 1; j <= n;... | #include <bits/stdc++.h>
#define M 505
using namespace std;
int A[M], n, sum, m, W[M], tail;
int main() {
int ans = 1;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
scanf("%d", &A[i]), sum += A[i];
for (int i = 1; i <= sqrt(sum); i++) {
if (sum % i != 0)
continue;
for (int j = 1; j <= n;... | [
"expression.operator.change"
] | 759,225 | 759,226 | u765391939 | cpp |
p02955 | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int n, k, a[500], sum = 0;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
vector<int> div;
for (int i = 1; i * i <= sum; i++) {
if (sum % i == 0) {
div.push_back(i);
if (i * ... | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int n, k, a[500], sum = 0;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
vector<int> div;
for (int i = 1; i * i <= sum; i++) {
if (sum % i == 0) {
div.push_back(i);
if (i * ... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 759,233 | 759,234 | u598050616 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
int a[N], b[N], n, k, c[N];
int check(int anv) {
for (int i = 1; i <= n; i++)
c[i] = a[i] % anv;
sort(c + 1, c + n + 1);
int ans = 0, sum = 0, l = 0, r = n + 1;
while (l < r - 1) {
if (sum <= 0)
l++, ans += c[l], sum += c[l];
... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
int a[N], b[N], n, k, c[N];
int check(int anv) {
for (int i = 1; i <= n; i++)
c[i] = a[i] % anv;
sort(c + 1, c + n + 1);
int ans = 0, sum = 0, l = 0, r = n + 1;
while (l < r - 1) {
if (sum <= 0)
l++, ans += c[l], sum += c[l];
... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 759,235 | 759,236 | u374819456 | cpp |
p02955 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
const int maxn = 1e5 + 10;
int read() {
int x = 0, f = 1;
char c = getchar();
while (!isdigit(c)) {
if (c == '-')
f = -1... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
const int maxn = 500 + 10;
int read() {
int x = 0, f = 1;
char c = getchar();
while (!isdigit(c)) {
if (c == '-')
f = -1... | [
"literal.number.change",
"expression.operation.binary.change",
"variable_declaration.value.change"
] | 759,237 | 759,238 | u998694062 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int MAX = 1000000007;
vector<int> divisor(int n) {
vector<int> ret;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
retur... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int MAX = 1000000007;
vector<int> divisor(int n) {
vector<int> ret;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
retur... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 759,241 | 759,242 | u651317892 | cpp |
p02955 | /*#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")*/
//#pragma GCC optimize("fast-math")
//#pragma GCC
//target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native") #pragma
//GCC optimize("unroll-loops") #define _CRT_SECURE_NO_WARNINGS #pragma GCC
//optimize("unroll-loops") #pragma GCC
//ta... | /*#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")*/
//#pragma GCC optimize("fast-math")
//#pragma GCC
//target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native") #pragma
//GCC optimize("unroll-loops") #define _CRT_SECURE_NO_WARNINGS #pragma GCC
//optimize("unroll-loops") #pragma GCC
//ta... | [
"expression.operation.binary.add"
] | 759,249 | 759,250 | u841694668 | cpp |
p02955 | #include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N);
for (ll i = 0; i < N; i++) {
cin >> A[i];
}
sort(A.rbegin(), A.rend());
auto minOp = [&](ll x) {
// Aを全てxで割り切れるようにするときにかかる最小回数
vector<ll> mod(N);
for (ll i = 0; i < N; ... | #include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N);
for (ll i = 0; i < N; i++) {
cin >> A[i];
}
sort(A.rbegin(), A.rend());
auto minOp = [&](ll x) {
// Aを全てxで割り切れるようにするときにかかる最小回数
vector<ll> mod(N);
for (ll i = 0; i < N; ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 759,251 | 759,252 | u456065785 | cpp |
p02955 | #include <bits/stdc++.h>
#define f first
#define s second
#define MOD 1000000007
#define PMOD 998244353
#define pb(x) push_back(x)
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plii;
typedef pair<int, pii> piii;
const int INF = 1e9 + 10;
const ll LINF = 1LL * INF * INF... | #include <bits/stdc++.h>
#define f first
#define s second
#define MOD 1000000007
#define PMOD 998244353
#define pb(x) push_back(x)
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plii;
typedef pair<int, pii> piii;
const int INF = 1e9 + 10;
const ll LINF = 1LL * INF * INF... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 759,255 | 759,256 | u114415753 | cpp |
p02955 | #define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/stack:256000000")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#i... | #define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/stack:256000000")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#i... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 759,257 | 759,258 | u258032299 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
long INF = 1000000000000000;
int main() {
long N, K;
cin >> N >> K;
vector<long> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
long sum = 0;
for (int i = 0; i < N; i++)
sum += A.at(i);
vector<long> divi(0);
long n = 1;
while (n * n <= sum) ... | #include <bits/stdc++.h>
using namespace std;
long INF = 1000000000000000;
int main() {
long N, K;
cin >> N >> K;
vector<long> A(N);
for (int i = 0; i < N; i++)
cin >> A.at(i);
long sum = 0;
for (int i = 0; i < N; i++)
sum += A.at(i);
vector<long> divi(0);
long n = 1;
while (n * n <= sum) ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 759,263 | 759,264 | u968365254 | cpp |
p02955 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#inc... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#inc... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 759,265 | 759,266 | u112723190 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> as(n);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> as[i];
sum += as[i];
}
vector<int> ds;
for (int i = 1; i * i <= sum; i++) {
if (sum % i == 0... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> as(n);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> as[i];
sum += as[i];
}
vector<int> ds;
for (int i = 1; i * i <= sum; i++) {
if (sum % i == 0... | [
"literal.number.change",
"io.output.change"
] | 759,277 | 759,278 | u210718367 | cpp |
p02955 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
template <class T> std::vector<T> getDivisors(T N) {
std::queue<T> D_lower;
std::stack<T> D_upper;
for (T i = static_cast<T>(1); i * i <= N; ++i) {
if (N % i ... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
template <class T> std::vector<T> getDivisors(T N) {
std::queue<T> D_lower;
std::stack<T> D_upper;
for (T i = static_cast<T>(1); i * i <= N; ++i) {
if (N % i ... | [
"assignment.add"
] | 759,282 | 759,283 | u436832975 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll sum = 0LL;
ll N, K;
cin >> N >> K;
vector<ll> A(N);
for (ll i = 0LL; i < N; i++) {
cin >> A[i];
sum += A[i];
}
set<ll> s;
for (ll i = 1LL; i * i <= sum; i++) {
if (sum % i == 0LL) {
s.insert(i);
s... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll sum = 0LL;
ll N, K;
cin >> N >> K;
vector<ll> A(N);
for (ll i = 0LL; i < N; i++) {
cin >> A[i];
sum += A[i];
}
set<ll> s;
for (ll i = 1LL; i * i <= sum; i++) {
if (sum % i == 0LL) {
s.insert(i);
s... | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 759,299 | 759,300 | u904123392 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, K;
cin >> N >> K;
ll sum = 0;
vector<ll> A(N);
for (ll i = 0; i < N; i++) {
cin >> A[i];
sum += A[i];
}
//考えられるのは、sumの約数しかありえない
set<ll> s;
ll ans = 1LL; // ans は 答えとなりうるsの要素に過ぎない
for (ll i = 1; i * i <= ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, K;
cin >> N >> K;
ll sum = 0;
vector<ll> A(N);
for (ll i = 0; i < N; i++) {
cin >> A[i];
sum += A[i];
}
//考えられるのは、sumの約数しかありえない
set<ll> s;
ll ans = 1LL; // ans は 答えとなりうるsの要素に過ぎない
for (ll i = 1; i * i <= ... | [
"call.add",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 759,301 | 759,302 | u904123392 | cpp |
p02955 | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
ll sum = 0;
rep(i, n) sum += a[i];
set<ll> candidates;
for ... | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
ll sum = 0;
rep(i, n) sum += a[i];
set<ll> candidates;
for ... | [
"expression.operation.binary.remove"
] | 759,312 | 759,313 | u235231201 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}... | [
"control_flow.branch.if.condition.change"
] | 759,316 | 759,315 | u071692456 | cpp |
p02955 | // Charan Sriramula
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long int ll;
const ll lg = 22;
const ll N = 1e6 + 5;
const ll M = 5e8;
const ll INF = 1e18;
const ll mod = 1e9 + 7;
const double PI = 3.14159265358979323846;
#define is(n) scanf("%d", &n)
#define io(n) printf("%d\n... | // Charan Sriramula
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long int ll;
const ll lg = 22;
const ll N = 1e6 + 5;
const ll M = 5e8;
const ll INF = 1e18;
const ll mod = 1e9 + 7;
const double PI = 3.14159265358979323846;
#define is(n) scanf("%d", &n)
#define io(n) printf("%d\n... | [
"variable_declaration.value.change"
] | 759,319 | 759,320 | u416273217 | cpp |
p02955 | /// usr/bin/g++ -O2 $0 -o ${0%.cpp} && echo "----------" && ./${0%.cpp}; exit;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int N = 510;
int n, a[N], k, sum;
int main(int argc, char const *argv[]) {
#ifdef LOCAL
freopen("in", "r", stdin);
#endif
scanf("%d %... | /// usr/bin/g++ -O2 $0 -o ${0%.cpp} && echo "----------" && ./${0%.cpp}; exit;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int N = 510;
int n, a[N], k, sum;
int main(int argc, char const *argv[]) {
#ifdef LOCAL
freopen("in", "r", stdin);
#endif
scanf("%d %... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 759,323 | 759,324 | u548415105 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
const int N = 510;
int n, k;
int a[N], sum;
int ans;
int b[N];
bool check(int x) {
for (int i = 1; i <= n; ++i) {
b[i] = a[i] % x;
}
sort(b + 1, b + n + 1);
int cnt = 0, sum = 0, r = n;
for (int i = 1; i <= r; ++i) {
if (!b[i])
continue;
cnt += b... | #include <bits/stdc++.h>
using namespace std;
const int N = 510;
int n, k;
int a[N], sum;
int ans;
int b[N];
bool check(int x) {
for (int i = 1; i <= n; ++i) {
b[i] = a[i] % x;
}
sort(b + 1, b + n + 1);
int cnt = 0, sum = 0, r = n;
for (int i = 1; i <= r; ++i) {
if (!b[i])
continue;
cnt += b... | [
"identifier.change",
"control_flow.loop.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 759,339 | 759,340 | u821187988 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
// freopen("in.txt", "r", stdin);
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
int A[n];
vector<int> factors;
int sum = 0;
for (int i = 0; i < n; ++i) {
cin >> A[i];
sum += A[i];
}
fo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
// freopen("in.txt", "r", stdin);
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
int A[n];
vector<int> factors;
int sum = 0;
for (int i = 0; i < n; ++i) {
cin >> A[i];
sum += A[i];
}
fo... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 759,343 | 759,344 | u781659997 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a, i##_len = (b); i < i##_len; ++i)
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define irepr(i, a, b) for (int i = a, i##_len = (b); i >= i##_len; --i)
#define irep(i, n) for (int i = n; i >= 0; --i)
#define print... | #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a, i##_len = (b); i < i##_len; ++i)
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define irepr(i, a, b) for (int i = a, i##_len = (b); i >= i##_len; --i)
#define irep(i, n) for (int i = n; i >= 0; --i)
#define print... | [
"call.add"
] | 759,349 | 759,350 | u258457185 | cpp |
p02955 | #include <algorithm>
#include <iostream>
#include <iterator>
#include <map>
#include <sstream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N, 0);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
int total = 0;
for (int i = 0; i < N; ++i) {
total += A[i... | #include <algorithm>
#include <iostream>
#include <iterator>
#include <map>
#include <sstream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N, 0);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
int total = 0;
for (int i = 0; i < N; ++i) {
total += A[i... | [
"control_flow.loop.for.condition.change",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 759,355 | 759,356 | u086244479 | cpp |
p02955 | #include <algorithm>
#include <iostream>
#include <iterator>
#include <map>
#include <sstream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N, 0);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
int total = 0;
for (int i = 0; i < N; ++i) {
total += A[i... | #include <algorithm>
#include <iostream>
#include <iterator>
#include <map>
#include <sstream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N, 0);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
int total = 0;
for (int i = 0; i < N; ++i) {
total += A[i... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 759,357 | 759,356 | u086244479 | cpp |
p02955 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
const int MAXN = 1001000;
int n;
int K;
int a[MAXN];
bool go(int p) {
vector<int> v;
int cost = 0;
for (int i = 0; i < n; ++i) {
int k = a[i] % p;
if (k < 0)
k += p;
if (k == 0)
continue;
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
const int MAXN = 1001000;
int n;
int K;
int a[MAXN];
bool go(int p) {
vector<int> v;
long long cost = 0;
for (int i = 0; i < n; ++i) {
int k = a[i] % p;
if (k < 0)
k += p;
if (k == 0)
contin... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 759,365 | 759,364 | u382759311 | cpp |
p02955 | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = ll(a); i < ll(b); i++)
using ll = long long;
using namespace std;
ll n, k, s = 0, a[550], b[550], ans = 0;
ll f(ll p) {
ll s2 = 0, s3 = 0;
rep(i, 0, n) {
b[i] = a[i] % p;
s2 += b[i];
}
sort(b, b + n);
rep(i, 0, n - s2 / p) s3 += b[i];
return ... | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = ll(a); i < ll(b); i++)
using ll = long long;
using namespace std;
ll n, k, s = 0, a[550], b[550], ans = 0;
ll f(ll p) {
ll s2 = 0, s3 = 0;
rep(i, 0, n) {
b[i] = a[i] % p;
s2 += b[i];
}
sort(b, b + n);
rep(i, 0, n - s2 / p) s3 += b[i];
return ... | [] | 759,366 | 759,367 | u499009346 | cpp |
p02955 | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = ll(a); i < ll(b); i++)
using ll = long long;
using namespace std;
ll n, k, s = 0, a[550], b[550], ans = 0;
ll f(ll p) {
ll s2 = 0, s3 = 0;
rep(i, 0, n) {
b[i] = a[i] % p;
s2 += b[i];
} // s2...16行目で探索する約数pでa[i]を割ったものの和
sort(b, b + n);
rep(i, 0,... | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = ll(a); i < ll(b); i++)
using ll = long long;
using namespace std;
ll n, k, s = 0, a[550], b[550], ans = 0;
ll f(ll p) {
ll s2 = 0, s3 = 0;
rep(i, 0, n) {
b[i] = a[i] % p;
s2 += b[i];
} // s2...16行目で探索する約数pでa[i]を割ったものの和
sort(b, b + n);
rep(i, 0,... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"control_flow.return.add",
"control_flow.return.0.add"
] | 759,368 | 759,369 | u499009346 | cpp |
p02955 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
int A[500];
cin >> N >> K;
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
sum += A[i];
}
vector<int> factor(0);
for (int p = 1; p * p <= sum; p++) {
if (sum % p == 0) {
fact... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
int A[500];
cin >> N >> K;
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
sum += A[i];
}
vector<int> factor(0);
for (int p = 1; p * p <= sum; p++) {
if (sum % p == 0) {
fact... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 759,373 | 759,374 | u798909123 | cpp |
p02955 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
int A[500];
cin >> N >> K;
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
sum += A[i];
}
vector<int> factor(0);
for (int p = 1; p * p < sum; p++) {
if (sum % p == 0) {
facto... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
int A[500];
cin >> N >> K;
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
sum += A[i];
}
vector<int> factor(0);
for (int p = 1; p * p <= sum; p++) {
if (sum % p == 0) {
fact... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 759,375 | 759,374 | u798909123 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
#define maxn 100005
int a[maxn], n, k, b[maxn];
bool check(int x) {
for (int i = 0; i < n; i++) {
b[i] = a[i] % x;
}
sort(b, b + n);
int w = 0, i;
for (i = 0; i < n; i++) {
w += x - b[i];
if (w > k)
break;
}
for (w = 0; i < n; i++) {
w +=... | #include <bits/stdc++.h>
using namespace std;
#define maxn 100005
int a[maxn], n, k, b[maxn];
bool check(int x) {
for (int i = 0; i < n; i++) {
b[i] = a[i] % x;
}
sort(b, b + n);
int w = 0, i;
for (i = 0; i < n; i++) {
w += b[i];
if (w > k)
break;
}
for (w = 0; i < n; i++) {
w += x -... | [
"expression.operation.binary.remove",
"assignment.change"
] | 759,378 | 759,379 | u518028964 | cpp |
p02955 | #include <bits/stdc++.h>
#define REP(i, x, n) for (int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x.size())
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define un... | #include <bits/stdc++.h>
#define REP(i, x, n) for (int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x.size())
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define un... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 759,380 | 759,381 | u267022560 | cpp |
p02955 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#inclu... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#inclu... | [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove"
] | 759,384 | 759,385 | u558671021 | cpp |
p02941 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void DC() { cout << -1 << endl; }
int main() {
int N;
cin >> N;
ll cnt = 0;
vector<ll> A(N);
vector<ll> B(N);
priority_queue<pair<ll, int>> Q;
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int j = 0; j < N; j++) {
cin >... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void DC() { cout << -1 << endl; }
int main() {
int N;
cin >> N;
ll cnt = 0;
vector<ll> A(N);
vector<ll> B(N);
priority_queue<pair<ll, int>> Q;
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int j = 0; j < N; j++) {
cin >... | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 759,477 | 759,478 | u904123392 | cpp |
p02941 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void DC() { cout << -1 << endl; }
int main() {
int N;
cin >> N;
ll cnt = 0;
vector<ll> A(N);
vector<ll> B(N);
priority_queue<pair<ll, int>> Q;
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int j = 0; j < N; j++) {
cin >... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void DC() { cout << -1 << endl; }
int main() {
int N;
cin >> N;
ll cnt = 0;
vector<ll> A(N);
vector<ll> B(N);
priority_queue<pair<ll, int>> Q;
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int j = 0; j < N; j++) {
cin >... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 759,479 | 759,478 | u904123392 | cpp |
p02941 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fs first
#define fst first
#define sc second
#define snd second
#define sz(X) (int)(X).size()
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define fornr(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define forab(i, a... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fs first
#define fst first
#define sc second
#define snd second
#define sz(X) (int)(X).size()
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define fornr(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define forab(i, a... | [
"literal.string.change",
"io.output.change"
] | 759,480 | 759,481 | u711540245 | cpp |
p02941 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 10;
int a[maxn], b[maxn], n;
priority_queue<pair<int, int>> s;
long long ans = 0;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (int i = 0; i < n; i++) {
scanf("%d", &b[i]);
s.push({b[i], i}... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 10;
int a[maxn], b[maxn], n;
priority_queue<pair<int, int>> s;
long long ans;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (int i = 0; i < n; i++) {
scanf("%d", &b[i]);
s.push({b[i], i});
... | [
"assignment.variable.change",
"identifier.change"
] | 759,551 | 759,552 | u047398677 | cpp |
p02941 | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
#define int long long
#define inf 1000000007
#define pa pair<int, int>
#define ll long long
#define pal pair<double, double>
#define ppap pair<pa, int>
#define PI 3.14159265358979323846
#define paa pair<int, char>
#define mp make_pair
#define p... | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
#define int long long
#define inf 1000000007
#define pa pair<int, int>
#define ll long long
#define pal pair<double, double>
#define ppap pair<pa, int>
#define PI 3.14159265358979323846
#define paa pair<int, char>
#define mp make_pair
#define p... | [] | 759,585 | 759,586 | u834777932 | cpp |
p02955 | #include <bits/stdc++.h>
#define ls(x) (x) << 1
#define rs(x) (x) << 1 | 1
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1 | 1
#define ll rt << 1
#define rr rt << 1 | 1
#define PI acos(-1)
//#define MM int m=(l+r)>>1;
#define fu(i, r, t) for (int i = r; i <= t; i++)
#define fd(i, r, t) for (int i = r; i >= t;... | #include <bits/stdc++.h>
#define ls(x) (x) << 1
#define rs(x) (x) << 1 | 1
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1 | 1
#define ll rt << 1
#define rr rt << 1 | 1
#define PI acos(-1)
//#define MM int m=(l+r)>>1;
#define fu(i, r, t) for (int i = r; i <= t; i++)
#define fd(i, r, t) for (int i = r; i >= t;... | [
"expression.operation.binary.remove"
] | 759,595 | 759,596 | u020160935 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
int n, k, a[510], tmp[510], r[510], l[510], sum, av, ans = 0;
bool check(int num) {
for (int i = 1; i <= n; ++i)
tmp[i] = a[i] % num;
sort(tmp + 1, tmp + n + 1);
for (int i = 1; i <= n; ++i)
l[i] = l[i - 1] + tmp[i];
for (int i = n; i >= 1; --i)
r[i] = r... | #include <bits/stdc++.h>
using namespace std;
int n, k, a[510], tmp[510], r[510], l[510], sum, ans = 1;
bool check(int num) {
for (int i = 1; i <= n; ++i)
tmp[i] = a[i] % num;
sort(tmp + 1, tmp + n + 1);
for (int i = 1; i <= n; ++i)
l[i] = l[i - 1] + tmp[i];
for (int i = n; i >= 1; --i)
r[i] = r[i +... | [
"variable_declaration.remove",
"literal.number.change",
"variable_declaration.value.change"
] | 759,599 | 759,600 | u573810484 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
int n, k, s, a[1000], t[1000];
int ok(int x) {
int tmp = 0;
for (int i = 0; i < n; i++) {
t[i] = a[i] % x;
tmp += t[i];
}
sort(t, t + n);
int xxx = 0;
for (int i = 0; i < n - 1 - tmp / x; i++) {
xxx += t[i];
}
return xxx <= k ? x : 0;
}
int main(... | #include <bits/stdc++.h>
using namespace std;
int n, k, s, a[1000], t[1000];
int ok(int x) {
int tmp = 0;
for (int i = 0; i < n; i++) {
t[i] = a[i] % x;
tmp += t[i];
}
sort(t, t + n);
int xxx = 0;
for (int i = 0; i < n - tmp / x; i++) {
xxx += t[i];
}
return xxx <= k ? x : 0;
}
int main() {
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 759,603 | 759,604 | u832527250 | cpp |
p02955 | #include <algorithm>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll MOD = 1e9 + 7;
const double EPS = 1e-9;
in... | #include <algorithm>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll MOD = 1e9 + 7;
const double EPS = 1e-9;
in... | [
"assignment.add"
] | 759,610 | 759,611 | u320491590 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
//#define TEST
/* kの約数を求める. 時間計算量O(√k) */
vector<ll> divisor(ll k) {
vector<ll> d;
for (ll i = 1; i * i <= k; ++i) {
if (k % i == 0) {
d.push_back(i);
if (i * i != k)
d.push_back(k / i);
}
}
sort(d.begin(), d.end(... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
//#define TEST
/* kの約数を求める. 時間計算量O(√k) */
vector<ll> divisor(ll k) {
vector<ll> d;
for (ll i = 1; i * i <= k; ++i) {
if (k % i == 0) {
d.push_back(i);
if (i * i != k)
d.push_back(k / i);
}
}
sort(d.begin(), d.end(... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 759,612 | 759,613 | u177907787 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
long long n, k, sum = 0;
vector<long long> a, v;
long long solve();
bool ch(long long x);
int main() {
cin >> n >> k;
a.resize(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
cout << solve() << endl;
return 0;
}
long long solve() {
long long ans = 1;
for ... | #include <bits/stdc++.h>
using namespace std;
long long n, k, sum = 0;
vector<long long> a, v;
long long solve();
bool ch(long long x);
int main() {
cin >> n >> k;
a.resize(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
cout << solve() << endl;
return 0;
}
long long solve() {
long long ans = 1;
for ... | [
"expression.operation.binary.remove",
"assignment.change"
] | 759,616 | 759,617 | u269963329 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
long long n, k, sum = 0;
vector<long long> a, v;
long long solve();
bool ch(long long x);
int main() {
cin >> n >> k;
a.resize(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
cout << solve() << endl;
return 0;
}
long long solve() {
long long ans = 1;
for ... | #include <bits/stdc++.h>
using namespace std;
long long n, k, sum = 0;
vector<long long> a, v;
long long solve();
bool ch(long long x);
int main() {
cin >> n >> k;
a.resize(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
cout << solve() << endl;
return 0;
}
long long solve() {
long long ans = 1;
for ... | [
"expression.operation.binary.remove",
"assignment.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 759,618 | 759,617 | u269963329 | cpp |
p02955 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9')
x = x * 10 + ch... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9')
x = x * 10 + ch... | [
"variable_declaration.value.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 759,625 | 759,624 | u741207575 | cpp |
p02955 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#inc... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#inc... | [
"expression.unary.arithmetic.add",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 759,626 | 759,627 | u391331433 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
template <typename T> void prime_factorization(T &result, int x) {
for (int i = 1; i * i <= x; i++) {
if (x % i == 0) {
result.insert(i);
result.insert(x / i);
}
}
}
bool verify(const vector<int> &a, int k, int block_size, int block_num) {
priori... | #include <bits/stdc++.h>
using namespace std;
template <typename T> void prime_factorization(T &result, int x) {
for (int i = 1; i * i <= x; i++) {
if (x % i == 0) {
result.insert(i);
result.insert(x / i);
}
}
}
bool verify(const vector<int> &a, int k, int block_size, int block_num) {
priori... | [] | 759,628 | 759,629 | u901295506 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define F first
#define S second
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
#define pb push_back
#define M6 1000009
#define M5 500009
#define pi 3.14159265
#define epsilon 1e-6
ll power(ll x, ... | #include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define F first
#define S second
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
#define pb push_back
#define M6 1000009
#define M5 500009
#define pi 3.14159265
#define epsilon 1e-6
ll power(ll x, ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 759,640 | 759,641 | u374517378 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i,... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 759,642 | 759,643 | u833393891 | cpp |
p02955 | #include <bits/stdc++.h>
#include <chrono>
#include <random>
#define lowbit(i) (i & (-i))
using namespace std;
namespace _ {
bool rEOF = 1; //为0表示文件结尾
inline char nc() {
static char buf[100000], *p1 = buf, *p2 = buf;
return p1 == p2 && rEOF &&
(p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 ==... | #include <bits/stdc++.h>
#include <chrono>
#include <random>
#define lowbit(i) (i & (-i))
using namespace std;
namespace _ {
bool rEOF = 1; //为0表示文件结尾
inline char nc() {
static char buf[100000], *p1 = buf, *p2 = buf;
return p1 == p2 && rEOF &&
(p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 ==... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 759,648 | 759,649 | u066917439 | cpp |
p02955 | #include <algorithm> // sort
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map> // pair
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ABS(x) ((x) > 0 ? (x) : -(x))
#define MIN(x, y) ((x) > (y) ? (y) : (x))
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0])... | #include <algorithm> // sort
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map> // pair
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ABS(x) ((x) > 0 ? (x) : -(x))
#define MIN(x, y) ((x) > (y) ? (y) : (x))
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0])... | [
"variable_declaration.value.change"
] | 759,654 | 759,655 | u869595612 | cpp |
p02955 | #include <algorithm> // sort
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map> // pair
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ABS(x) ((x) > 0 ? (x) : -(x))
#define MIN(x, y) ((x) > (y) ? (y) : (x))
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0])... | #include <algorithm> // sort
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map> // pair
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ABS(x) ((x) > 0 ? (x) : -(x))
#define MIN(x, y) ((x) > (y) ? (y) : (x))
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0])... | [
"variable_declaration.value.change"
] | 759,656 | 759,655 | u869595612 | cpp |
p02955 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <time.h>
#include <vector>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define re... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <time.h>
#include <vector>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define re... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 759,659 | 759,660 | u171366497 | cpp |
p02955 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
... | [
"identifier.change",
"io.output.change"
] | 759,661 | 759,662 | u624800360 | cpp |
p02955 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
... | [
"identifier.change",
"io.output.change"
] | 759,663 | 759,662 | u624800360 | cpp |
p02955 | #include <bits/stdc++.h>
#define int long long
using namespace std;
int n, K, A[1010], sum, maxx, num[1010], suml[1010], sumr[1010], last;
void work(int i) {
for (int j = 1; j <= n; j++) {
int res = (A[j] / i) * i;
num[j] = A[j] - res;
}
sort(num + 1, num + 1 + n);
suml[0] = 0, sumr[n + 1] = 0;
int tm... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int n, K, A[1010], sum, maxx, num[1010], suml[1010], sumr[1010], last;
void work(int i) {
for (int j = 1; j <= n; j++) {
int res = (A[j] / i) * i;
num[j] = A[j] - res;
}
sort(num + 1, num + 1 + n);
suml[0] = 0, sumr[n + 1] = 0;
int tm... | [] | 759,664 | 759,665 | u047371023 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
#define sd(x) scanf("%d", &x)
#define slld(x) scanf("%lld", &x)
#define all(x) x.begin(), x.end()
#define For(i, st, en) for (ll i = st; i < en; i++)
#define tr(x) for (auto it = x.begin(); it != x.end(); it++)
#define fast ... | #include <bits/stdc++.h>
using namespace std;
#define sd(x) scanf("%d", &x)
#define slld(x) scanf("%lld", &x)
#define all(x) x.begin(), x.end()
#define For(i, st, en) for (ll i = st; i < en; i++)
#define tr(x) for (auto it = x.begin(); it != x.end(); it++)
#define fast ... | [
"call.add",
"call.arguments.add"
] | 759,666 | 759,667 | u623300886 | cpp |
p02955 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
long long int a[1000000];
int n;
long long int hoge(int che) {
long long int d[100000];
for (int i = 0; i < n; i++) {
d[i] = a[i] % che;
}
sort(d, d + n);
// for(long long int i=0;i<n;i++){cout<<d[i]<<endl;}... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
long long int a[1000000];
int n;
long long int hoge(int che) {
long long int d[100000];
for (int i = 0; i < n; i++) {
d[i] = a[i] % che;
}
sort(d, d + n);
// for(long long int i=0;i<n;i++){cout<<d[i]<<endl;}... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 759,670 | 759,671 | u023751250 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, a, b) for (int i = a; i <= (b); ++i)
#define repr(i, a, b) for (int i = a; i >= (b); --i)
typedef long long ll;
cons... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, a, b) for (int i = a; i <= (b); ++i)
#define repr(i, a, b) for (int i = a; i >= (b); --i)
typedef long long ll;
cons... | [
"function.return_type.change",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 759,672 | 759,673 | u995725911 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, a, b) for (int i = a; i <= (b); ++i)
#define repr(i, a, b) for (int i = a; i >= (b); --i)
typedef long long ll;
cons... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, a, b) for (int i = a; i <= (b); ++i)
#define repr(i, a, b) for (int i = a; i >= (b); --i)
typedef long long ll;
cons... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 759,674 | 759,673 | u995725911 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 10;
int n, a[maxn], k;
int sum, ans;
int cur;
vector<int> d;
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
sum += a[i];
}
for (int i = (int)sqrt(sum); i >= 2; i--) {
if (sum % i == 0) {
... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 10;
int n, a[maxn], k;
int sum, ans;
int cur;
vector<int> d;
int main() {
ans = 1;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
sum += a[i];
}
for (int i = (int)sqrt(sum); i >= 2; i--) {
if (sum % i ... | [
"assignment.add"
] | 759,677 | 759,678 | u047398677 | cpp |
p02955 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
vector<ll> divisor(ll n) {
vector<ll> ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
vector<ll> divisor(ll n) {
vector<ll> ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 759,686 | 759,687 | u949755084 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
/////////////////////////////////
int main() {
ll a, b;
cin >> a >> b;
if ((a - b) % 2 == 0)
cout << (a + b) / 2 << endl;
else {
cout << "IMPSSOBLE" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
/////////////////////////////////
int main() {
ll a, b;
cin >> a >> b;
if ((a - b) % 2 == 0)
cout << (a + b) / 2 << endl;
else {
cout << "IMPOSSIBLE" << endl;
}
} | [
"literal.string.change",
"io.output.change"
] | 759,701 | 759,702 | u019359540 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
/////////////////////////////////
int main() {
int a, b;
cin >> a >> b;
if ((a - b) % 2 == 0)
cout << (a + b) / 2 << endl;
else {
cout << "IMPSSOBLE" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
/////////////////////////////////
int main() {
ll a, b;
cin >> a >> b;
if ((a - b) % 2 == 0)
cout << (a + b) / 2 << endl;
else {
cout << "IMPOSSIBLE" << endl;
}
} | [
"variable_declaration.type.change",
"literal.string.change",
"io.output.change"
] | 759,703 | 759,702 | u019359540 | cpp |
p02957 | #include "iostream"
using namespace std;
int asb(int a) {
if (a < 0) {
return (-1 * a);
} else {
return (a);
}
}
int main() {
long long a;
long long b;
cin >> a >> b;
double d = (a + b) / 2;
if ((asb(a - d)) == (asb(b - d))) {
cout << d << endl;
} else {
cout << "IMPOSSIBLE" << endl;
... | #include "iostream"
using namespace std;
int asb(int a) {
if (a < 0) {
return (-1 * a);
} else {
return (a);
}
}
int main() {
long long a;
long long b;
cin >> a >> b;
long long d = (a + b) / 2;
if ((asb(a - d)) == (asb(b - d))) {
cout << d << endl;
} else {
cout << "IMPOSSIBLE" << endl... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 759,726 | 759,727 | u243674187 | cpp |
p02957 | // nani?
#include <bits/stdc++.h>
#define pi acos(-1);
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define f(i, a, b) for (int i = a; i < b; i++)
#define sor(a) sort(a.begin(), a.end())
#define rsor(a) sort(a.rbegin(), a.rend())
#define fastio ... | // nani?
#include <bits/stdc++.h>
#define pi acos(-1);
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define f(i, a, b) for (int i = a; i < b; i++)
#define sor(a) sort(a.begin(), a.end())
#define rsor(a) sort(a.rbegin(), a.rend())
#define fastio ... | [
"control_flow.branch.if.condition.change"
] | 759,743 | 759,744 | u083187983 | cpp |
p02957 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#pragma GCC... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#pragma GCC... | [
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change"
] | 759,783 | 759,784 | u038537254 | cpp |
p02957 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (n); i++)
usi... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (n); i++)
usi... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 759,790 | 759,791 | u272628953 | cpp |
p02957 | #include <bits/stdc++.h>
#define pi 3.14159
using namespace std;
int main() {
long long int a, b, c, d, e;
cin >> a >> b;
if ((a + b) % 2 == 0)
cout << (a + b) / 2 << endl;
else
cout << "IMPOSSSIBLE" << endl;
return 0;
}
| #include <bits/stdc++.h>
#define pi 3.14159
using namespace std;
int main() {
long long int a, b, c, d, e;
cin >> a >> b;
if ((a + b) % 2 == 0)
cout << (a + b) / 2 << endl;
else
cout << "IMPOSSIBLE" << endl;
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 759,820 | 759,821 | u246218976 | cpp |
p02957 | #include <bits/stdc++.h>
#define pi 3.14159
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b;
if ((a + b) % 2 == 0)
cout << (a + b) / 2 << endl;
else
cout << "IMPOSSSIBLE" << endl;
return 0;
}
| #include <bits/stdc++.h>
#define pi 3.14159
using namespace std;
int main() {
long long int a, b, c, d, e;
cin >> a >> b;
if ((a + b) % 2 == 0)
cout << (a + b) / 2 << endl;
else
cout << "IMPOSSIBLE" << endl;
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 759,822 | 759,821 | u246218976 | cpp |
p02957 | #include <bits/stdc++.h>
#define FAST \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define MAXX 100005
#define PI 3.1415... | #include <bits/stdc++.h>
#define FAST \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define MAXX 100005
#define PI 3.1415... | [
"control_flow.branch.if.condition.change"
] | 759,920 | 759,921 | u102842945 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll a, b;
cin >> a >> b;
if (a & 1 != b & 1) {
puts("IMPOSSIBLE");
} else {
cout << (a + b) / 2 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll a, b;
cin >> a >> b;
if ((a & 1) != (b & 1)) {
puts("IMPOSSIBLE");
} else {
cout << (a + b) / 2 << endl;
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 759,927 | 759,928 | u902387200 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
void solve() {
cout << fixed << setprecision(5);
long long a, b;
cin >> a >> b;
double answer = (a + b) / 2.0;
// 1.5 --> 15
// cout << "Test " << (long long)(10.0 * answer) << endl;
if ((long long)(10.0 * answer) % 10 == 0) {
cout << (long long)answer <... | #include <bits/stdc++.h>
using namespace std;
void solve() {
cout << fixed << setprecision(5);
long long a, b;
cin >> a >> b;
double answer = (a + b) / 2.0;
// 1.5 --> 15
// cout << "Test " << (long long)(10.0 * answer) << endl;
if ((long long)(10.0 * answer) % 10 == 0) {
cout << (long long)answer ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 759,937 | 759,938 | u069951940 | cpp |
p02957 | /*
╔═══╦═══╦═══╗
║╔═╗║╔══╩╗╔╗║
║║░║║╚══╗║║║║
║║░║║╔══╝║║║║
║╚═╝║╚══╦╝╚╝║
╚══╗╠═══╩═══╝
░░░╚╝░░░░░░░░
*/
#include <bits/stdc++.h>
#define ll long long
#define MOD 1000000007
#define MAX 1e9
#define MIN -1e9
#define PI acos(-1.0)
#define vi vector<int>
#define vii vector<vi>
#define vll vector<ll>
#define mid(s,... | /*
╔═══╦═══╦═══╗
║╔═╗║╔══╩╗╔╗║
║║░║║╚══╗║║║║
║║░║║╔══╝║║║║
║╚═╝║╚══╦╝╚╝║
╚══╗╠═══╩═══╝
░░░╚╝░░░░░░░░
*/
#include <bits/stdc++.h>
#define ll long long
#define MOD 1000000007
#define MAX 1e9
#define MIN -1e9
#define PI acos(-1.0)
#define vi vector<int>
#define vii vector<vi>
#define vll vector<ll>
#define mid(s,... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 759,939 | 759,940 | u424544969 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long A, B;
cin >> A >> B;
if ((A - B) % 2 != 0 || (B - A) % 2 != 0) {
cout << "IMPOSSIBLE" << endl;
return 0;
}
if (A > B) {
cout << (A - B) / 2 << endl;
} else {
cout << (B - A) / 2 << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long A, B;
cin >> A >> B;
if ((A + B) % 2 != 0 || (B + A) % 2 != 0) {
cout << "IMPOSSIBLE" << endl;
return 0;
}
if (A > B) {
cout << (A + B) / 2 << endl;
} else {
cout << (B + A) / 2 << endl;
}
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 759,953 | 759,954 | u319965179 | cpp |
p02957 | #include <bits/stdc++.h>
#define FOR(i, n) for (ll i = 0; i < n; i++)
#define FORR(i, n) for (ll i = n; i >= 0; i--)
#define FORS(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) accumulate(v.begin(), v.end(), 0)
#define SORT(v) sort(v.begin(), v.end())
#define OUT(n) (cout << n << endl)
#define IN1(a) (cin >> a)
#d... | #include <bits/stdc++.h>
#define FOR(i, n) for (ll i = 0; i < n; i++)
#define FORR(i, n) for (ll i = n; i >= 0; i--)
#define FORS(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) accumulate(v.begin(), v.end(), 0)
#define SORT(v) sort(v.begin(), v.end())
#define OUT(n) (cout << n << endl)
#define IN1(a) (cin >> a)
#d... | [
"call.add",
"control_flow.branch.if.condition.change"
] | 759,974 | 759,975 | u312666261 | cpp |
p02957 | #include <bits/stdc++.h>
#define int long long
const int INF = 1e18L + 5;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int a, b;
cin >> a >> b;
if (a + b % ... | #include <bits/stdc++.h>
#define int long long
const int INF = 1e18L + 5;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int a, b;
cin >> a >> b;
if ((a + b) ... | [
"control_flow.branch.if.condition.change"
] | 759,982 | 759,983 | u590057656 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn begin()
#define en end()
#... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn begin()
#define en end()
#... | [
"expression.operation.binary.add"
] | 760,058 | 760,059 | u790461875 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll a, b;
cin >> a >> b;
if ((a + b) & 1) {
cout << -1 << endl;
} else {
cout << (a + b) / 2 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll a, b;
cin >> a >> b;
if ((a + b) & 1) {
cout << "IMPOSSIBLE" << endl;
} else {
cout << (a + b) / 2 << endl;
}
} | [] | 760,062 | 760,063 | u184929210 | cpp |
p02957 | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long // 禁忌
using ll = long long;
using lld = long double;
#define P pair<ll, ll>
#define Vi vector<ll>
#define VVi vector<vector<ll>>
#define Vd vector<double>
#defi... | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long // 禁忌
using ll = long long;
using lld = long double;
#define P pair<ll, ll>
#define Vi vector<ll>
#define VVi vector<vector<ll>>
#define Vd vector<double>
#defi... | [
"literal.string.change",
"call.arguments.change"
] | 760,068 | 760,069 | u154645927 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(), (x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using ll = long long;
using P = pair<int, int>;
const int mod = 1000000007;
int main()... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(), (x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using ll = long long;
using P = pair<int, int>;
const int mod = 1000000007;
int main()... | [
"control_flow.branch.if.condition.change"
] | 760,122 | 760,123 | u488493347 | cpp |
p02957 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
#define pb push_back
#define read(type, ...) \
type __VA_ARGS__; ... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
#define pb push_back
#define read(type, ...) \
type __VA_ARGS__; ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 760,186 | 760,187 | u048764593 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(s, i, n) for (int i = (int)s; i < (int)(n); i++)
#define pb push_back
typedef long long ll;
int main() {
ll a, b;
cin >> a >> b;
if ((a + b) % 2 == 1) {
cout << "INPOSSIBLE" << endl;
return 0;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(s, i, n) for (int i = (int)s; i < (int)(n); i++)
#define pb push_back
typedef long long ll;
int main() {
ll a, b;
cin >> a >> b;
if ((a + b) % 2 == 1) {
cout << "IMPOSSIBLE" << endl;
return 0;
... | [
"literal.string.change",
"io.output.change"
] | 760,218 | 760,219 | u985524697 | cpp |
p02957 | #include <bits/stdc++.h>
#define REPI(i, n) for (int i = 0; i < n; i++)
#define REPJ(j, n) for (int j = 0; j < n; j++)
using ll = long long;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
(a + b) % 2 ? cout << "IMPOSIBLE" : cout << (a + b) / 2;
}
| #include <bits/stdc++.h>
#define REPI(i, n) for (int i = 0; i < n; i++)
#define REPJ(j, n) for (int j = 0; j < n; j++)
using ll = long long;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b;
cin >> a >> b;
(a + b) % 2 ? cout << "IMPOSSIBLE" : cout << (a + b) / 2;
}
| [
"variable_declaration.type.change",
"literal.string.change",
"expression.operation.binary.change"
] | 760,240 | 760,241 | u505466816 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long A, B;
cin >> A >> B;
if (((A + B) / 2) % 2 == 0)
cout << (A + B) / 2 << endl;
else
cout << "IMPOSSIBLE" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long A, B;
cin >> A >> B;
if ((A + B) % 2 == 0)
cout << (A + B) / 2 << endl;
else
cout << "IMPOSSIBLE" << endl;
} | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 760,242 | 760,243 | u611836784 | cpp |
p02956 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define ll long long
#define mod 998244353
#define maxn 200010
inline ll read() {
ll x = 0;
char c = getchar(), f = 1;
for (; c < '0' || '9' < c; c = getchar())
if (c == '-')
f = -1;
for (; '0' <= c && c <= '... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define ll long long
#define mod 998244353
#define maxn 200010
inline ll read() {
ll x = 0;
char c = getchar(), f = 1;
for (; c < '0' || '9' < c; c = getchar())
if (c == '-')
f = -1;
for (; '0' <= c && c <= '... | [] | 760,317 | 760,318 | u491404948 | cpp |
p02956 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define ll long long
#define mod 998244353
#define maxn 200010
inline ll read() {
ll x = 0;
char c = getchar(), f = 1;
for (; c < '0' || '9' < c; c = getchar())
if (c == '-')
f = -1;
for (; '0' <= c && c <= '... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define ll long long
#define mod 998244353
#define maxn 200010
inline ll read() {
ll x = 0;
char c = getchar(), f = 1;
for (; c < '0' || '9' < c; c = getchar())
if (c == '-')
f = -1;
for (; '0' <= c && c <= '... | [] | 760,319 | 760,318 | u491404948 | cpp |
p02956 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define ll long long
#define mod 998244353
#define maxn 200010
inline ll read() {
ll x = 0;
char c = getchar(), f = 1;
for (; c < '0' || '9' < c; c = getchar())
if (c == '-')
f = -1;
for (; '0' <= c && c <= '... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define ll long long
#define mod 998244353
#define maxn 200010
inline ll read() {
ll x = 0;
char c = getchar(), f = 1;
for (; c < '0' || '9' < c; c = getchar())
if (c == '-')
f = -1;
for (; '0' <= c && c <= '... | [] | 760,320 | 760,318 | u491404948 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t A, B;
cin >> A >> B;
int64_t x = A + B;
if (x % 2 == 0) {
cout << x / 2 << endl;
} else {
cout << "IMPOSSIBL" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t A, B;
cin >> A >> B;
int64_t x = A + B;
if (x % 2 == 0) {
cout << x / 2 << endl;
} else {
cout << "IMPOSSIBLE" << endl;
}
}
| [
"literal.string.change",
"io.output.change"
] | 760,379 | 760,380 | u030246664 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change"
] | 760,404 | 760,405 | u917049698 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9 + 7;
// constexpr ll MOD = 998244353;
// constexpr ll MOD = ;
ll mod(ll A, ll M) { return (A % M + M) % M; }
constexpr ll INF = 1LL << 60;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9 + 7;
// constexpr ll MOD = 998244353;
// constexpr ll MOD = ;
ll mod(ll A, ll M) { return (A % M + M) % M; }
constexpr ll INF = 1LL << 60;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 760,410 | 760,411 | u811472478 | cpp |
p02957 | #include "bits/stdc++.h"
#define rep(i, b) for (ll i = 0; i < b; i++)
#define ll long long
using namespace std;
/*--Input//////////////////////////////////////////////////*/
inline void IN(void) { return; }
template <typename First, typename... Rest>
void IN(First &first, Rest &...rest) {
cin >> first;
IN(rest...);... | #include "bits/stdc++.h"
#define rep(i, b) for (ll i = 0; i < b; i++)
#define ll long long
using namespace std;
/*--Input//////////////////////////////////////////////////*/
inline void IN(void) { return; }
template <typename First, typename... Rest>
void IN(First &first, Rest &...rest) {
cin >> first;
IN(rest...);... | [
"control_flow.branch.if.condition.change",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 760,442 | 760,443 | u782733831 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int a, b;
cin >> a >> b;
a = a + b;
(a % 2 != 0) ? cout << "impossible" : cout << (long long int)a / 2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int a, b;
cin >> a >> b;
a = a + b;
(a % 2 != 0) ? cout << "IMPOSSIBLE" << endl
: cout << (long long int)a / 2 << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change",
"io.output.newline.add"
] | 760,631 | 760,632 | u353919145 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int A, B;
cin >> A >> B;
if (B >= A) {
int C;
C = B;
B = A;
A = C;
}
if ((A - B) % 2 == 0) {
cout << (A - B) / 2 + B << endl;
} else {
cout << "IMPPOSSIBLE" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int A, B;
cin >> A >> B;
if (B >= A) {
int C;
C = B;
B = A;
A = C;
}
if ((A - B) % 2 == 0) {
cout << (A - B) / 2 + B << endl;
} else {
cout << "IMPOSSIBLE" << endl;
}
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 760,633 | 760,634 | u934329211 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num) { return log10(num) + 1; } // numの桁数を求める
int main() {
ll a, b;
cin >> a >> b;
ll ans = a + b;
if (ans % 2 == 1)
cout << "Impossible" << endl;
else
cout << ans /... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num) { return log10(num) + 1; } // numの桁数を求める
int main() {
ll a, b;
cin >> a >> b;
ll ans = a + b;
if (ans % 2 == 1)
cout << "IMPOSSIBLE" << endl;
else
cout << ans /... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 760,638 | 760,639 | u848148267 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num) { return log10(num) + 1; } // numの桁数を求める
int main() {
int a, b;
cin >> a >> b;
int ans = a + b;
if (ans % 2 == 1)
cout << "Impossible" << endl;
else
cout << ans... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num) { return log10(num) + 1; } // numの桁数を求める
int main() {
ll a, b;
cin >> a >> b;
ll ans = a + b;
if (ans % 2 == 1)
cout << "IMPOSSIBLE" << endl;
else
cout << ans /... | [
"variable_declaration.type.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 760,640 | 760,639 | u848148267 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long a, b;
cin >> a >> b;
if (a + b % 2 == 0)
cout << (a + b) / 2 << '\n';
else
cout << "IMPOSSIBLE" << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long a, b;
cin >> a >> b;
if ((a + b) % 2 == 0)
cout << (a + b) / 2 << '\n';
else
cout << "IMPOSSIBLE" << '\n';
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 760,658 | 760,659 | u712429027 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) \
; \
for (ll i = 0; i < (ll)n; i++)
int main() {
ll a, b;
cin >>... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) \
; \
for (ll i = 0; i < (ll)n; i++)
int main() {
ll a, b;
cin >>... | [
"control_flow.branch.if.condition.change"
] | 760,674 | 760,675 | u678961336 | cpp |
p02957 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(a) (a).begin(), (a).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(a) (a).begin(), (a).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = ... | [
"type_conversion.add"
] | 760,684 | 760,685 | u740054550 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.