problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03700 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <deque>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
const long long mod = 1000000007;
const long l... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <deque>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
const long long mod = 1000000007;
const long l... | [
"assignment.value.change"
] | 1,372,361 | 1,372,362 | u648138491 | cpp |
p03700 | #include <algorithm>
#include <iostream>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll hp[100005], a, b, n;
bool nibu(int k) {
ll x, c = 0;
for (ll i = 0; i < n; i++) {
x = b * k;
if (hp[i] > x) {
c += (hp[i] - x) / (a - b);
... | #include <algorithm>
#include <iostream>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll hp[100005], a, b, n;
bool nibu(int k) {
ll x, c = 0;
for (ll i = 0; i < n; i++) {
x = b * k;
if (hp[i] > x) {
c += (hp[i] - x) / (a - b);
... | [
"literal.number.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,372,374 | 1,372,375 | u945017646 | cpp |
p03700 | #include <bits/stdc++.h>
using namespace std;
bool check(long long a, long long b, vector<long long> &h, long long k) {
long long sum = 0;
for (long long i = 0; i < h.size() && h[i] - b * k > 0; i++) {
sum += (long long)ceil((1.0 * h[i] - b * k) / (a - b));
}
if (sum > k)
return false;
return tru... | #include <bits/stdc++.h>
using namespace std;
bool check(long long a, long long b, vector<long long> &h, long long k) {
long long sum = 0;
for (long long i = 0; i < h.size() && h[i] - b * k > 0; i++) {
sum += (long long)ceil((1.0 * h[i] - b * k) / (a - b));
}
if (sum > k)
return false;
return tru... | [
"expression.operation.binary.remove",
"identifier.change",
"io.output.change"
] | 1,372,395 | 1,372,396 | u498141549 | cpp |
p03700 | #include <bits/stdc++.h>
using namespace std;
bool check(long long a, long long b, vector<long long> &h, long long k) {
long long sum = 0;
for (long long i = 0; i < h.size() && h[i] - b * k > 0; i++) {
sum += (long long)ceil((1.0 * h[i] - b * k) / (a - b));
}
if (sum > k)
return false;
return tru... | #include <bits/stdc++.h>
using namespace std;
bool check(long long a, long long b, vector<long long> &h, long long k) {
long long sum = 0;
for (long long i = 0; i < h.size() && h[i] - b * k > 0; i++) {
sum += (long long)ceil((1.0 * h[i] - b * k) / (a - b));
}
if (sum > k)
return false;
return tru... | [
"expression.operation.binary.remove",
"misc.opposites",
"identifier.change",
"io.output.change"
] | 1,372,397 | 1,372,396 | u498141549 | cpp |
p03700 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
us... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
us... | [
"variable_declaration.type.change"
] | 1,372,422 | 1,372,423 | u660402389 | cpp |
p03700 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
us... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
us... | [
"variable_declaration.type.change"
] | 1,372,424 | 1,372,423 | u660402389 | cpp |
p03700 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
ll N, A, B;
ll h[100005], m[100005];
bool check(ll n) {
for (int i = 0; i < N; i++)
m[i] = h[i] - n * B;
ll cnt = 0LL;
for (int i = 0; i < N; i++) {
if (m[i]) {
if (m[i] % (A - B) == 0) {
cnt += m[i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
ll N, A, B;
ll h[100005], m[100005];
bool check(ll n) {
for (int i = 0; i < N; i++)
m[i] = h[i] - n * B;
ll cnt = 0LL;
for (int i = 0; i < N; i++) {
if (m[i] > 0) {
if (m[i] % (A - B) == 0) {
cnt +=... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,372,425 | 1,372,426 | u654191866 | cpp |
p03700 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
ll N, A, B;
ll h[100005], m[100005];
bool check(ll n) {
for (int i = 0; i < N; i++)
m[i] = h[i] - n * B;
ll cnt = 0LL;
for (int i = 0; i < N; i++) {
if (m[i]) {
if (m[i] % (A - B) == 0) {
cnt += m[i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
ll N, A, B;
ll h[100005], m[100005];
bool check(ll n) {
for (int i = 0; i < N; i++)
m[i] = h[i] - n * B;
ll cnt = 0LL;
for (int i = 0; i < N; i++) {
if (m[i] > 0) {
if (m[i] % (A - B) == 0) {
cnt +=... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"literal.string.change",
"call.arguments.change",
"literal.number.change",
"variable_declaration.value.change"
] | 1,372,427 | 1,372,426 | u654191866 | cpp |
p03700 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> Pr;
int N, A, B;
ll high, low, mid;... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> Pr;
int N, A, B;
ll high, low, mid;... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.return.add"
] | 1,372,434 | 1,372,433 | u026757201 | cpp |
p03700 | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long... | [
"literal.number.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"function.return_value.change",
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change"
] | 1,372,452 | 1,372,453 | u040948438 | cpp |
p03700 | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long... | [
"literal.number.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"function.return_value.change",
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"variable_declaration.value.change"
] | 1,372,454 | 1,372,453 | u040948438 | cpp |
p03700 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <istream>
#include <map>
#include <numeric>
#include <ostream>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
class Solution {
public:
long long n, a, b;
vector<long long> h;
bool eno... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <istream>
#include <map>
#include <numeric>
#include <ostream>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
class Solution {
public:
long long n, a, b;
vector<long long> h;
bool eno... | [
"control_flow.branch.if.condition.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,372,467 | 1,372,468 | u598016178 | cpp |
p03700 | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define RREP(i, n) for (ll i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < n; ++i)
#define RFOR(i, m, n) for (ll i = n - 1; i >= m; --i)
#define ALL(v) (v).begin(), (v).end()
#define PB(a) push_back(a)
#define UNIQUE(v) v.erase(uniqu... | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define RREP(i, n) for (ll i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < n; ++i)
#define RFOR(i, m, n) for (ll i = n - 1; i >= m; --i)
#define ALL(v) (v).begin(), (v).end()
#define PB(a) push_back(a)
#define UNIQUE(v) v.erase(uniqu... | [
"assignment.change"
] | 1,372,469 | 1,372,470 | u329438207 | cpp |
p03700 | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define RREP(i, n) for (ll i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < n; ++i)
#define RFOR(i, m, n) for (ll i = n - 1; i >= m; --i)
#define ALL(v) (v).begin(), (v).end()
#define PB(a) push_back(a)
#define UNIQUE(v) v.erase(uniqu... | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define RREP(i, n) for (ll i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < n; ++i)
#define RFOR(i, m, n) for (ll i = n - 1; i >= m; --i)
#define ALL(v) (v).begin(), (v).end()
#define PB(a) push_back(a)
#define UNIQUE(v) v.erase(uniqu... | [
"assignment.change"
] | 1,372,471 | 1,372,472 | u918357423 | cpp |
p03700 | #include <algorithm>
#include <stdio.h>
using namespace std;
typedef long long ll;
#define maxn 100010
int n;
ll a, b, h[maxn];
bool test(int mid) {
int ans = 0;
for (int i = 0; i < n; i++) {
int c = h[i] - mid * b;
if (c > 0) {
if (c % (a - b) == 0)
ans += c / (a - b);
else
ans ... | #include <algorithm>
#include <stdio.h>
using namespace std;
typedef long long ll;
#define maxn 100010
int n;
ll a, b, h[maxn];
bool test(ll mid) {
ll ans = 0;
for (int i = 0; i < n; i++) {
int c = h[i] - mid * b;
if (c > 0) {
if (c % (a - b) == 0)
ans += c / (a - b);
else
ans +=... | [
"variable_declaration.type.change"
] | 1,372,502 | 1,372,503 | u623736960 | cpp |
p03700 | #include <algorithm>
#include <stdio.h>
using namespace std;
typedef long long ll;
#define maxn 100010
int n;
ll a, b, h[maxn];
bool test(int mid) {
int ans = 0;
for (int i = 0; i < n; i++) {
int c = h[i] - mid * b;
if (c > 0) {
if (c % (a - b) == 0)
ans += c / (a - b);
else
ans ... | #include <algorithm>
#include <stdio.h>
using namespace std;
typedef long long ll;
#define maxn 100010
int n;
ll a, b, h[maxn];
bool test(ll mid) {
ll ans = 0;
for (int i = 0; i < n; i++) {
int c = h[i] - mid * b;
if (c > 0) {
if (c % (a - b) == 0)
ans += c / (a - b);
else
ans +=... | [
"variable_declaration.type.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,372,504 | 1,372,503 | u623736960 | cpp |
p03700 | #include <algorithm>
#include <stdio.h>
using namespace std;
typedef long long ll;
#define maxn 100010
int n;
ll a, b, h[maxn];
bool test(int mid) {
int ans = 0;
for (int i = 0; i < n; i++) {
int c = h[i] - mid * b;
if (c > 0) {
if (c % (a - b) == 0)
ans += c / (a - b);
else
ans ... | #include <algorithm>
#include <stdio.h>
using namespace std;
typedef long long ll;
#define maxn 100010
int n;
ll a, b, h[maxn];
bool test(ll mid) {
ll ans = 0;
for (int i = 0; i < n; i++) {
int c = h[i] - mid * b;
if (c > 0) {
if (c % (a - b) == 0)
ans += c / (a - b);
else
ans +=... | [
"variable_declaration.type.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,372,505 | 1,372,503 | u623736960 | cpp |
p03700 | #include <cstring>
#include <fstream>
#include <iostream>
#include <queue>
using namespace std;
long long n, i, j, a, b, fr[30], l, ok, v[100001], s, nrtotal;
bool check(long long ans) {
long long i, ans2 = 0, mustadd;
for (i = 1; i <= n; i++) {
mustadd = (v[i] - ans * b + (a - b) - 1) / (a - b);
ans2 += ... | #include <cstring>
#include <fstream>
#include <iostream>
#include <queue>
using namespace std;
long long n, i, j, a, b, fr[30], l, ok, v[100001], s, nrtotal;
bool check(long long ans) {
long long i, ans2 = 0, mustadd;
for (i = 1; i <= n; i++) {
mustadd = (v[i] - ans * b + (a - b) - 1) / (a - b);
ans2 += ... | [
"call.add",
"call.arguments.change"
] | 1,372,523 | 1,372,524 | u479429581 | cpp |
p03701 | //---------------------------------------------------------------
#include <bits/stdc++.h>
using namespace std;
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <math.h>
#include <numeric>
#include <sstream>
//---------------------------------------------------------------
#define rep(i, n) for (int i = ... | //---------------------------------------------------------------
#include <bits/stdc++.h>
using namespace std;
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <math.h>
#include <numeric>
#include <sstream>
//---------------------------------------------------------------
#define rep(i, n) for (int i = ... | [
"control_flow.branch.if.condition.change",
"identifier.change"
] | 1,372,529 | 1,372,530 | u825601908 | cpp |
p03701 | #include <bits/stdc++.h>
#define ll long long int
#define pragi(a, b) for (ll i = a; i < b; i++)
#define pragj(a, b) for (ll j = a; j < b; j++)
#define pragk(a, b) for (ll k = a; k >= b; k--)
#define all(v) (v.begin(), v.end())
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define MP make_pair
#... | #include <bits/stdc++.h>
#define ll long long int
#define pragi(a, b) for (ll i = a; i < b; i++)
#define pragj(a, b) for (ll j = a; j < b; j++)
#define pragk(a, b) for (ll k = a; k >= b; k--)
#define all(v) (v.begin(), v.end())
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define MP make_pair
#... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,372,531 | 1,372,532 | u636478865 | cpp |
p03701 | #include <bits/stdc++.h>
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) \
{ \
if (a < b) \
a = b; ... | #include <bits/stdc++.h>
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) \
{ \
if (a < b) \
a = b; ... | [
"call.add"
] | 1,372,552 | 1,372,553 | u768152935 | cpp |
p03701 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> S(N);
for (int i = 0; i < N; ++i) {
cin >> S[i];
}
ll result = accumulate(S.begin(), S.end(), 0);
bool flg = true;
if (result % 10 == 0) {
sort(S.begin(), S.end());
for (int i = 0; ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> S(N);
for (int i = 0; i < N; ++i) {
cin >> S[i];
}
ll result = accumulate(S.begin(), S.end(), 0);
bool flg = false;
if (result % 10 == 0) {
sort(S.begin(), S.end());
for (int i = 0;... | [
"misc.opposites",
"variable_declaration.value.change"
] | 1,372,578 | 1,372,579 | u401382183 | cpp |
p03701 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> s(N + 1);
for (int i = 0; i < N; ++i)
cin >> s[i];
vector<bool> dp(10050);
dp[0] = true;
for (int i = 0; i < N; ++i) {
for (int j = 10000; j >= s[i]; --j) {
dp[j] = dp[j] || dp[j - ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> s(N + 1);
for (int i = 0; i < N; ++i)
cin >> s[i];
vector<bool> dp(10050);
dp[0] = true;
for (int i = 0; i < N; ++i) {
for (int j = 10050; j >= s[i]; --j) {
dp[j] = dp[j] || dp[j - ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,372,580 | 1,372,581 | u699193595 | cpp |
p03701 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int N;
ll ans = 0;
cin >> N;
vector<int> s(N);
for (int i = 0; i < N; i++) {
cin >> s[i];
ans += s[i];
}
sort(s.begin(), s.end());
if (ans % 10 == 0) {
for (int i = 0; i < N; i++) {
if (s[i] % 10 != 0) {
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int N;
ll ans = 0;
cin >> N;
vector<int> s(N);
for (int i = 0; i < N; i++) {
cin >> s[i];
ans += s[i];
}
sort(s.begin(), s.end());
if (ans % 10 == 0) {
for (int i = 0; i < N; i++) {
if (s[i] % 10 != 0) {
... | [
"assignment.variable.change"
] | 1,372,586 | 1,372,587 | u946090308 | cpp |
p03701 | #include <iostream>
#include <vector>
int main(void) {
short i, j, n, sum = 0, ans = 0;
scanf("%hd", &n);
std::vector<short> A(n);
for (i = 0; i < n; i++) {
scanf("\n%hd", &A[i]);
sum += A[i];
}
std::vector<bool> KingCrimson(sum + 1, false);
KingCrimson[0] = true;
sum = 0;
for (i = 0; i < n; i... | #include <iostream>
#include <vector>
int main(void) {
short i, j, n, sum = 0, ans = 0;
scanf("%hd", &n);
std::vector<short> A(n);
for (i = 0; i < n; i++) {
scanf("\n%hd", &A[i]);
sum += A[i];
}
std::vector<bool> KingCrimson(sum + 1, false);
KingCrimson[0] = true;
sum = 0;
for (i = 0; i < n; i... | [] | 1,372,590 | 1,372,591 | u394853232 | cpp |
p03701 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define MAX 300000
typedef long long ll;
int main() {
ll sum = 0;
int N, data[100];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> data[i];
sum += data... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define MAX 300000
typedef long long ll;
int main() {
ll sum = 0;
int N, data[100];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> data[i];
sum += data... | [
"expression.operation.binary.remove"
] | 1,372,592 | 1,372,593 | u591914971 | cpp |
p03701 | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> s(n);
for (int i = 0; i < n; ++i) {
cin >> s[i];
}
sort(s.begin(), s.end());
int out = 0;
for (int i = n - 1; i >= 0; --i) {
out... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> s(n);
for (int i = 0; i < n; ++i) {
cin >> s[i];
}
sort(s.begin(), s.end());
int out = 0;
for (int i = n - 1; i >= 0; --i) {
out... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"expression.unary.arithmetic.add"
] | 1,372,598 | 1,372,599 | u540724932 | cpp |
p03701 | #include <cstdio>
#define min(a, b) (a < b ? a : b)
int main() {
int no_of_elements;
scanf("%d", &no_of_elements);
const int oo = 1e9 + 9;
int sum = 0, max_non_multiple_10 = oo;
while (no_of_elements--) {
int element;
scanf("%d", &element);
sum += element;
if (element % 10 != 0)
max... | #include <cstdio>
#define min(a, b) (a < b ? a : b)
int main() {
int no_of_elements;
scanf("%d", &no_of_elements);
const int oo = 1e9 + 9;
int sum = 0, min_non_multiple_10 = oo;
while (no_of_elements--) {
int element;
scanf("%d", &element);
sum += element;
if (element % 10 != 0)
mi... | [
"variable_declaration.name.change",
"identifier.change",
"assignment.variable.change",
"assignment.value.change",
"call.arguments.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.change",
"io.output.change"
] | 1,372,629 | 1,372,630 | u927253988 | cpp |
p03701 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
vector<int> v;
int n;
cin >> n;
int s[n + 10];
int sum = 0;
for (int i = 0;... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
vector<int> v;
int n;
cin >> n;
int s[n + 10];
int sum = 0;
for (int i = 0;... | [
"assignment.value.change",
"expression.operation.unary.arithmetic.remove"
] | 1,372,641 | 1,372,642 | u701745824 | cpp |
p03701 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
vector<int> v;
int n;
cin >> n;
int s[n + 10];
int sum = 0;
for (int i = 0;... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
vector<int> v;
int n;
cin >> n;
int s[n + 10];
int sum = 0;
for (int i = 0;... | [
"assignment.value.change",
"expression.operation.unary.arithmetic.remove",
"literal.string.change",
"io.output.change"
] | 1,372,643 | 1,372,642 | u701745824 | cpp |
p03701 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define MAX_V 100001
#define INF (1e9 + 1)
#define REP(i, n) for (long long int(i) = 0; (i) < (n); (i)++)
#define REV(i, n) for (... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define MAX_V 100001
#define INF (1e9 + 1)
#define REP(i, n) for (long long int(i) = 0; (i) < (n); (i)++)
#define REV(i, n) for (... | [
"control_flow.break.add"
] | 1,372,647 | 1,372,648 | u855200003 | cpp |
p03701 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define db long double
#define ii pair<int, int>
#define vi vector<int>
#define fi first
#define se second
#define sz(a) (int)(a).size()
#define a... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define db long double
#define ii pair<int, int>
#define vi vector<int>
#define fi first
#define se second
#define sz(a) (int)(a).size()
#define a... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 1,372,653 | 1,372,654 | u164644833 | cpp |
p03701 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
/*
<url:https://arc075.contest.atcoder.jp/tasks/arc075_a>
問題文============================================================
あなたはコンピュータで試験を受けています。試験は N 問の問題... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
/*
<url:https://arc075.contest.atcoder.jp/tasks/arc075_a>
問題文============================================================
あなたはコンピュータで試験を受けています。試験は N 問の問題... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"assignment.change"
] | 1,372,657 | 1,372,658 | u728732647 | cpp |
p03701 | #include <bits/stdc++.h>
// Shrotening
#define fst first
#define snd second
#define pb push_back
// Loop
#define FOR(i, a, b) for (long i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (long i = (a); i >= (b); --i)
#define REP(i, a) for (long i = 0; i < (a); ++i)
#define RREP(i, a) for (long i = (a); i >= 0; --i)
#... | #include <bits/stdc++.h>
// Shrotening
#define fst first
#define snd second
#define pb push_back
// Loop
#define FOR(i, a, b) for (long i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (long i = (a); i >= (b); --i)
#define REP(i, a) for (long i = 0; i < (a); ++i)
#define RREP(i, a) for (long i = (a); i >= 0; --i)
#... | [
"expression.operation.binary.add"
] | 1,372,661 | 1,372,662 | u514809528 | cpp |
p03701 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PrintLn(X) cout << X << endl
typedef long long ll;
int a[100];
int sum[10001] = {0};
int N;
int main(void) {
cin >> N;
Rep(i, N) cin >> a[i];
sum[0] = 1;... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PrintLn(X) cout << X << endl
typedef long long ll;
int a[100];
int sum[10001] = {0};
int N;
int main(void) {
cin >> N;
Rep(i, N) cin >> a[i];
sum[0] = 1;... | [
"call.add"
] | 1,372,663 | 1,372,664 | u899220667 | cpp |
p03701 | /*
coder:xxjAc
time:2017/10/28
*/
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#in... | /*
coder:xxjAc
time:2017/10/28
*/
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#in... | [
"expression.operation.unary.reference.add"
] | 1,372,667 | 1,372,668 | u776618439 | cpp |
p03701 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
#define pb push_back
#define mod 1000000007
using namespace std;
typedef long long int ll;
int main(void) {
int n, s;
vector<int> v;
int sum = 0;
cin >> n;
for (int i = 0; i < n;... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
#define pb push_back
#define mod 1000000007
using namespace std;
typedef long long int ll;
int main(void) {
int n, s;
vector<int> v;
int sum = 0;
cin >> n;
for (int i = 0; i < n;... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,372,669 | 1,372,670 | u733823138 | cpp |
p03701 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> s(n);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
sum += s[i];
}
if (sum % 10 == 0) {
sort(s.begin(), s.end());
for (int i = 0; i < n; i++) {
if (s[i] % 10 == 0)
contin... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> s(n);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
sum += s[i];
}
if (sum % 10 == 0) {
sort(s.begin(), s.end());
for (int i = 0; i < n; i++) {
if (s[i] % 10 == 0)
contin... | [
"control_flow.break.remove",
"control_flow.return.add",
"function.return_value.change"
] | 1,372,673 | 1,372,674 | u141642872 | cpp |
p03701 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int a[N];
for (int i = 0; i < N; i++)
cin >> a[i];
int sum = 0;
for (int i = 0; i < N; i++)
sum += a[i];
int ans;
if (sum % 10 != 0) {
ans = sum;
} else {
sort(a, a + N);
for (int i = 0; ... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int a[N];
for (int i = 0; i < N; i++)
cin >> a[i];
int sum = 0;
for (int i = 0; i < N; i++)
sum += a[i];
int ans = 0;
if (sum % 10 != 0) {
ans = sum;
} else {
sort(a, a + N);
for (int i =... | [
"variable_declaration.value.change"
] | 1,372,675 | 1,372,676 | u063020782 | cpp |
p03701 | #include <algorithm>
#include <functional>
#include <iostream>
#include <queue>
#include <vector>
std::priority_queue<int, std::vector<int>, std::greater<int>> a;
int N, sum;
int main() {
std::cin >> N;
for (int i = 0; i < N; i++) {
int tmp;
std::cin >> tmp;
sum += tmp;
a.push(tmp);
}
if (sum % ... | #include <algorithm>
#include <functional>
#include <iostream>
#include <queue>
#include <vector>
std::priority_queue<int, std::vector<int>, std::greater<int>> a;
int N, sum;
int main() {
std::cin >> N;
for (int i = 0; i < N; i++) {
int tmp;
std::cin >> tmp;
sum += tmp;
a.push(tmp);
}
if (sum % ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,372,677 | 1,372,678 | u554116180 | cpp |
p03701 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
#define REP(i, n) for (int i = 0; (i) < (n); (i)++)
int main() {
int N, s[102], ans = 0;
cin >> N;
REP(i, N) { cin >> s[i]; }
sort(s, s + N);
REP(i, N) { ans +... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
#define REP(i, n) for (int i = 0; (i) < (n); (i)++)
int main() {
int N, s[102], ans = 0;
cin >> N;
REP(i, N) { cin >> s[i]; }
sort(s, s + N);
REP(i, N) { ans +... | [] | 1,372,683 | 1,372,684 | u354773735 | cpp |
p03699 | #include <iostream>
using namespace std;
int main() {
int N, a;
int min, sum;
min = -1;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a;
sum += a;
if (a % 10 == 0) {
continue;
}
if (min > a || min == -1) {
min = a;
}
}
if (sum % 10 == 0 && min != -1) {
sum -= min;
... | #include <iostream>
using namespace std;
int main() {
int N, a;
int min, sum;
min = -1;
cin >> N;
sum = 0;
for (int i = 0; i < N; i++) {
cin >> a;
sum += a;
if (a % 10 == 0) {
continue;
}
if (min > a || min == -1) {
min = a;
}
}
if (sum % 10 == 0 && min != -1) {
s... | [
"assignment.add"
] | 1,372,696 | 1,372,697 | u780033556 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
int main() {
int here = 0, n, sum = 0;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
sum += p[i];
if ((p[i] % 10 != 0 && here == 0) || (here > p[i])) {
here = p[i];
}
}
if (here == 0) {
cout << 0 << endl;
} e... | #include <bits/stdc++.h>
using namespace std;
int main() {
int here = 0, n, sum = 0;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
sum += p[i];
if ((p[i] % 10 != 0) && (here == 0 || here > p[i])) {
here = p[i];
}
}
if (here == 0) {
cout << 0 << endl;
} e... | [
"control_flow.branch.if.condition.change"
] | 1,372,700 | 1,372,701 | u988542029 | cpp |
p03699 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string str;
int n = 0;
int flg = 0;
int sum = 0;
int tmp = 0;
vector<int> v;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> tmp;
sum = sum + tmp;
v.push_back(tmp);
}
sort(v.... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string str;
int n = 0;
int flg = 0;
int sum = 0;
int tmp = 0;
vector<int> v;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> tmp;
sum = sum + tmp;
v.push_back(tmp);
}
sort(v.... | [] | 1,372,718 | 1,372,719 | u770338847 | cpp |
p03699 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> Pr;
int main() {
int N, sum = 0, ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> Pr;
int main() {
int N, sum = 0, ... | [
"control_flow.branch.if.condition.change"
] | 1,372,722 | 1,372,723 | u026757201 | cpp |
p03699 | #include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
int n, i, k, sum, mn = 0x3f3f3f3f;
int main() {
cin >> n;
for (i = 1; i <= n; i++) {
cin >> k;
sum += k;
if (k < mn && k % 10 != 0)
mn = k;
}
if (sum % 10 != 0)
printf("%d", sum);
else if (mn != 0x3f3f3f3f)
... | #include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
int n, i, k, sum, mn = 0x3f3f3f3f;
int main() {
cin >> n;
for (i = 1; i <= n; i++) {
cin >> k;
sum += k;
if (k < mn && k % 10 != 0)
mn = k;
}
if (sum % 10 != 0)
printf("%d", sum);
else if (mn != 0x3f3f3f3f)
... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 1,372,724 | 1,372,725 | u623736960 | cpp |
p03699 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <memory>
#include <numeric>
#include <sstream>
#include <string>
#include <typeinfo>
#include <vector>
#in... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <memory>
#include <numeric>
#include <sstream>
#include <string>
#include <typeinfo>
#include <vector>
#in... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,372,726 | 1,372,727 | u335104842 | cpp |
p03699 | /* template.cpp(shinobu_menkoi) {{{ */
#include <bits/stdc++.h>
using namespace std;
// clang-format off
#define GET_MACRO(_1, _2, _3, _4, NAME, ...) NAME
#define rep(...) GET_MACRO(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rep1(n) rep2(_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, a, n) rep4(... | /* template.cpp(shinobu_menkoi) {{{ */
#include <bits/stdc++.h>
using namespace std;
// clang-format off
#define GET_MACRO(_1, _2, _3, _4, NAME, ...) NAME
#define rep(...) GET_MACRO(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rep1(n) rep2(_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, a, n) rep4(... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 1,372,732 | 1,372,733 | u458995077 | cpp |
p03699 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int N, i, A = 0, b = 0, j, c = 0;
cin >> N;
int s[100];
for (i = 1; i <= N; i++) {
cin >> s[i - 1];
}
for (i = 1; i <= N; i++) {
A += s[i - 1];
}
for (j = 1; j <= N; j++) {
for (i = 1; i <= N; ... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int N, i, A = 0, b = 0, j, c = 0;
cin >> N;
int s[100];
for (i = 1; i <= N; i++) {
cin >> s[i - 1];
}
for (i = 1; i <= N; i++) {
A += s[i - 1];
}
for (j = 1; j <= N; j++) {
for (i = 1; i <= N; ... | [
"control_flow.return.add",
"control_flow.return.0.add",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,372,736 | 1,372,737 | u699354332 | cpp |
p03699 | #include <algorithm>
#include <iostream>
using namespace std;
int N;
const int MAX_N = 100;
int s[MAX_N];
void solve() {
int A = 0;
sort(s, s + N);
for (int i = 0; i < N; i++) {
A += s[i];
}
if (A % 10 != 0) {
} else {
for (int i = 0; i < N; i++) {
if (s[i] % 10 != 0) {
A -= s[i];
... | #include <algorithm>
#include <iostream>
using namespace std;
int N;
const int MAX_N = 100;
int s[MAX_N];
void solve() {
int A = 0;
sort(s, s + N);
for (int i = 0; i < N; i++) {
A += s[i];
}
if (A % 10 != 0) {
} else {
for (int i = 0; i < N; i++) {
if (s[i] % 10 != 0) {
A -= s[i];
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,372,745 | 1,372,746 | u489773738 | cpp |
p03699 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define reps(i, s, n) for (int(i) = (s); (i) < (n); ++(i))
#define rep(i, n) reps(i, 0, n)
using ll = long long;
int main() {
int N;
ll score = 0;
cin >> N;
vector<int> a(N, 0);
for (int i = 0; i < N; i++)
cin >> a[i];
for... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define reps(i, s, n) for (int(i) = (s); (i) < (n); ++(i))
#define rep(i, n) reps(i, 0, n)
using ll = long long;
int main() {
int N;
ll score = 0;
cin >> N;
vector<int> a(N, 0);
for (int i = 0; i < N; i++)
cin >> a[i];
for... | [
"control_flow.branch.if.condition.change"
] | 1,372,762 | 1,372,763 | u704411633 | cpp |
p03699 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int n = 0;
int s[100] = {0};
int score = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
}
fo... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int n = 0;
int s[100] = {0};
int score = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
}
fo... | [
"assignment.add"
] | 1,372,766 | 1,372,767 | u743847596 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int s;
int ans;
cin >> n;
vector<int> v;
for (int i = 0; i < n; i++) {
int a;
scanf("%d", &a);
v.push_back(a);
}
sort(v.begin(), v.end());
s = accumulate(v.begin(), v.end(), 0);
int i = 0;
ans = s;
if (ans % 10 == 0) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int s;
int ans;
cin >> n;
vector<int> v;
for (int i = 0; i < n; i++) {
int a;
scanf("%d", &a);
v.push_back(a);
}
sort(v.begin(), v.end());
s = accumulate(v.begin(), v.end(), 0);
int i = 0;
ans = s;
if (ans % 10 == 0) ... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.condition.change",
"call.add"
] | 1,372,768 | 1,372,769 | u289381123 | cpp |
p03699 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
int read() {
int i;
scanf("%lld", &i);
return i;
}
signed main() {
int N = read();
int s[N];
bool dec[N] = {false};
int ans = 0;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
int read() {
int i;
scanf("%lld", &i);
return i;
}
signed main() {
int N = read();
int s[N];
bool dec[N] = {false};
int ans = 0;
... | [] | 1,372,783 | 1,372,784 | u703434921 | cpp |
p03699 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using lli = long long int;
using ulli = unsigned long long int;
//#define EVEL 1
#ifndef EVEL
#define dbug(X) std::cout << #X << ":" << X << " ";
#define dbugf(s) std::cout << s << " ";
#define dbugln std::cout << "\n";
#else
#define db... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using lli = long long int;
using ulli = unsigned long long int;
//#define EVEL 1
#ifndef EVEL
#define dbug(X) std::cout << #X << ":" << X << " ";
#define dbugf(s) std::cout << s << " ";
#define dbugln std::cout << "\n";
#else
#define db... | [
"control_flow.break.add"
] | 1,372,787 | 1,372,788 | u032455837 | cpp |
p03699 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define PII pair<int, int>
#define LL long long
int main() {
LL n, inp;
LL sum = 0;
LL min = 100;
cin >> n;
REP(i, n) {
cin >> inp;
sum += inp;
if (inp ... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define PII pair<int, int>
#define LL long long
int main() {
LL n, inp;
LL sum = 0;
LL min = 100;
cin >> n;
REP(i, n) {
cin >> inp;
sum += inp;
if (inp ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,372,789 | 1,372,790 | u827316038 | cpp |
p03701 | #include <iostream>
using namespace std;
const int MaxN = 100005;
int n;
int v[MaxN];
int main() {
cin >> n;
int sum = 0;
int minDif = 0x3f3f3f3f;
for (int i = 1; i <= n; ++i) {
cin >> v[i];
sum += v[i];
if (v[i] % 10) {
minDif = min(minDif, v[i]);
}
}
if (sum % 10 == 0) {
if ... | #include <iostream>
using namespace std;
const int MaxN = 100005;
int n;
int v[MaxN];
int main() {
cin >> n;
int sum = 0;
int minDif = 0x3f3f3f3f;
for (int i = 1; i <= n; ++i) {
cin >> v[i];
sum += v[i];
if (v[i] % 10) {
minDif = min(minDif, v[i]);
}
}
if (sum % 10 == 0) {
if ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,372,795 | 1,372,796 | u328358960 | cpp |
p03701 | #include <algorithm>
#include <iostream>
using namespace std;
bool dp[100010];
int main() {
int n, s;
cin >> n;
for (int i = 0; i < 10010; i++)
dp[i] = false;
dp[0] = true;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> s;
for (int j = 10010; j > 0; j--) {
if (dp[j] == true) {
i... | #include <algorithm>
#include <iostream>
using namespace std;
bool dp[100010];
int main() {
int n, s;
cin >> n;
for (int i = 0; i < 10010; i++)
dp[i] = false;
dp[0] = true;
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> s;
for (int j = 10010; j >= 0; j--) {
if (dp[j] == true) {
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,372,799 | 1,372,800 | u924885571 | cpp |
p03702 | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
using namespace std;
int n, a, b, m[200000];
int erfen(long long int mid) {
long long int sum = 0;
for (int i = 0; i < n; i++) {
long long int t = (long long int)m[i] - mid * b;
if (t > 0) {
sum += (int)(t * 1.0 / (a - b));
... | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
using namespace std;
long long int n, a, b, m[200000];
int erfen(long long int mid) {
long long int sum = 0;
for (int i = 0; i < n; i++) {
long long int t = (long long int)m[i] - mid * b;
if (t > 0) {
sum += (int)ceil(t * 1.0... | [
"variable_declaration.type.widen.change",
"call.add"
] | 1,372,812 | 1,372,813 | u089230684 | cpp |
p03702 | #pragma GCC optimize("Ofast,fast-math,unroll-loops,inline,no-stack-protector")
#pragma GCC target( \
"sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,avx,avx2,abm,mmx,popcnt")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cma... | #pragma GCC optimize("Ofast,fast-math,unroll-loops,inline,no-stack-protector")
#pragma GCC target( \
"sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,avx,avx2,abm,mmx,popcnt")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cma... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,372,835 | 1,372,836 | u224762261 | cpp |
p03702 | // doaremon,squirtle is love
#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;
#define fast \
ios::sync_with_stdio(0); ... | // doaremon,squirtle is love
#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;
#define fast \
ios::sync_with_stdio(0); ... | [
"call.remove"
] | 1,372,837 | 1,372,838 | u463698225 | cpp |
p03702 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF = 1e+18 + 1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
const ll M... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF = 1e+18 + 1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
const ll M... | [
"variable_declaration.name.change",
"identifier.change"
] | 1,372,865 | 1,372,866 | u614128939 | cpp |
p03702 | #include <bits/stdc++.h>
#define int long long
#define sz size()
#define all(s) s.begin(), s.end()
#define mkp make_pair
#define pb push_back
using namespace std;
const int mod = 1e9 + 7;
const int maxn = 2e5 + 12;
int h[maxn];
int a, b, n;
void Speed() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);... | #include <bits/stdc++.h>
#define int long long
#define sz size()
#define all(s) s.begin(), s.end()
#define mkp make_pair
#define pb push_back
using namespace std;
const int mod = 1e9 + 7;
const int maxn = 2e5 + 12;
int h[maxn];
int a, b, n;
void Speed() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);... | [
"variable_declaration.value.change",
"identifier.change"
] | 1,372,886 | 1,372,887 | u323114955 | cpp |
p03702 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define RFOR(i, a, n) for (ll i = (ll)n - 1; i >= (ll)a; i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define bra(first, second) '(' << fi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define RFOR(i, a, n) for (ll i = (ll)n - 1; i >= (ll)a; i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define bra(first, second) '(' << fi... | [
"assignment.change"
] | 1,372,910 | 1,372,911 | u393754572 | cpp |
p03701 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
using namespace std;
int dp[114514], tensu[114], sum = 0;
int main(void) {
int i, j, k, n, youso = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> tensu[i];
}
for (i = 0; i < n; i++)
dp[i] = 0;
dp[0] = ... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
using namespace std;
int dp[114514], tensu[114], sum = 0;
int main(void) {
int i, j, k, n, youso = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> tensu[i];
}
for (i = 0; i < n; i++)
dp[i] = 0;
dp[0] = ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,372,942 | 1,372,943 | u397775564 | cpp |
p03701 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
using namespace std;
int dp[114514], tensu[100], sum = 0;
int main(void) {
int i, j, k, n, youso = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> tensu[i];
}
for (i = 0; i < n; i++)
dp[i] = 0;
dp[0] = ... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
using namespace std;
int dp[114514], tensu[114], sum = 0;
int main(void) {
int i, j, k, n, youso = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> tensu[i];
}
for (i = 0; i < n; i++)
dp[i] = 0;
dp[0] = ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change"
] | 1,372,944 | 1,372,943 | u397775564 | cpp |
p03701 |
#include <cmath>
#include <iostream>
#include <vector>
#ifdef LOCAL
#define debug_echo(expr) cout << expr << "\n";
#else
#define debug_echo(expr)
#endif
using namespace std;
#define at , <=,
#define to , <,
#define in ,
#define forrange(...) forrange1(forrange2, (__VA_ARGS__))
#define forrange1(X, A) X A
#define fo... |
#include <cmath>
#include <iostream>
#include <vector>
#ifdef LOCAL
#define debug_echo(expr) cout << expr << "\n";
#else
#define debug_echo(expr)
#endif
using namespace std;
#define at , <=,
#define to , <,
#define in ,
#define forrange(...) forrange1(forrange2, (__VA_ARGS__))
#define forrange1(X, A) X A
#define fo... | [
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,372,945 | 1,372,946 | u180737192 | cpp |
p03701 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
#define pb push_back
#define rep(i, a, n) for (int i = (a); i < (n); i++)
#define dep(i, a, n) for (int i = (a); i >= (n); i--)
#define out(n) cout << (n) << endl;
__attribute__((constructor)) void ini... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
#define pb push_back
#define rep(i, a, n) for (int i = (a); i < (n); i++)
#define dep(i, a, n) for (int i = (a); i >= (n); i--)
#define out(n) cout << (n) << endl;
__attribute__((constructor)) void ini... | [
"variable_declaration.value.change"
] | 1,372,947 | 1,372,948 | u546128193 | cpp |
p03701 | #include <bits/stdc++.h>
using namespace std;
const int maxN = 111;
int n, sum;
int a[maxN];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d", &a[i]);
sum += a[i];
}
if (sum % 10)
printf("%d\n", sum);
else {
sort(a + 1, a + n + 1);
for (int i = 1; i <= n; ++i)
... | #include <bits/stdc++.h>
using namespace std;
const int maxN = 111;
int n, sum;
int a[maxN];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d", &a[i]);
sum += a[i];
}
if (sum % 10)
printf("%d\n", sum);
else {
sort(a + 1, a + n + 1);
for (int i = 1; i <= n; ++i)
... | [] | 1,372,953 | 1,372,954 | u931166518 | cpp |
p03701 | #include <bits/stdc++.h>
using namespace std;
int n, dp[10010] = {1};
int main() {
scanf("%d", &n);
for (int i = 0, x; i < n; i++) {
scanf("%d", &x);
for (int j = 9999; j >= x; j--)
dp[j] |= dp[j - x];
}
for (int i = 9999; i >= 0; i--)
if (i % 10 && dp[i]) {
printf("%d\n", i);
br... | #include <bits/stdc++.h>
using namespace std;
int n, dp[10010] = {1};
int main() {
scanf("%d", &n);
for (int i = 0, x; i < n; i++) {
scanf("%d", &x);
for (int j = 9999; j >= x; j--)
dp[j] |= dp[j - x];
}
for (int i = 9999; i >= 0; i--)
if ((i + !i) % 10 && dp[i]) {
printf("%d\n", i);
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,372,982 | 1,372,983 | u089329978 | cpp |
p03701 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <stri... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <stri... | [
"literal.number.change",
"call.arguments.change",
"control_flow.break.remove",
"control_flow.return.add",
"function.return_value.change"
] | 1,372,994 | 1,372,995 | u457283867 | cpp |
p03701 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <stri... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <stri... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.remove",
"control_flow.break.remove",
"control_flow.return.add",
"function.return_value.change"
] | 1,372,996 | 1,372,995 | u457283867 | cpp |
p03701 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <string>
#define debug(x) cerr << #x << "=" << x << endl
#define fgx cerr << "-------------" << endl
#define rint register int
typedef long long ll;
using namespace std;
int a[101];
in... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <string>
#define debug(x) cerr << #x << "=" << x << endl
#define fgx cerr << "-------------" << endl
#define rint register int
typedef long long ll;
using namespace std;
int a[101];
in... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 1,373,002 | 1,373,003 | u374028781 | cpp |
p03701 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long lon... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long lon... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,373,006 | 1,373,007 | u420071596 | cpp |
p03701 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> s(n);
for (int i = 0; i < n; i++)
cin >> s[i];
sort(s.... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> s(n);
for (int i = 0; i < n; i++)
cin >> s[i];
sort(s.... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 1,373,014 | 1,373,015 | u543657872 | cpp |
p03701 | #include <algorithm>
#include <iostream>
using namespace std;
#define INF (int)2e9
int main() {
int N, s, r = 0, m = INF, i;
cin >> N;
for (i = 0; i < N; i++) {
cin >> s;
if (s % 10)
m = min(s, m);
r += s;
}
if (m == INF) {
cout << "0\n";
} else {
if (r % 10) {
cout << r <... | #include <algorithm>
#include <iostream>
using namespace std;
#define INF (int)2e9
int main() {
int N, s, r = 0, m = INF, i;
cin >> N;
for (i = 0; i < N; i++) {
cin >> s;
if (s % 10)
m = min(s, m);
r += s;
}
if (m == INF) {
cout << "0\n";
} else {
if (r % 10) {
cout << r <... | [
"identifier.change",
"io.output.change"
] | 1,373,026 | 1,373,027 | u829564204 | cpp |
p03702 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define EPS 1e-9
#define PI acos(-1.0)
#define INF 0... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define EPS 1e-9
#define PI acos(-1.0)
#define INF 0... | [
"assignment.change",
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change"
] | 1,373,086 | 1,373,087 | u344305918 | cpp |
p03702 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
typedef long long ll;
ll INF = (1LL << 30) - 1;
int MOD = 1e9 + 7;
ll N, A, B;
vector<ll> V;
bool judge(ll x) {
ll cnt = 0;
rep(i, 0, N) {
if (V[i] <= B * x)
continue;
cnt += (V[i] - B * x + A - B ... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
typedef long long ll;
ll INF = (1LL << 30) - 1;
int MOD = 1e9 + 7;
ll N, A, B;
vector<ll> V;
bool judge(ll x) {
ll cnt = 0;
rep(i, 0, N) {
if (V[i] <= B * x)
continue;
cnt += (V[i] - B * x + A - B ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,373,131 | 1,373,132 | u157322125 | cpp |
p03702 | #include <bits/stdc++.h>
using namespace std;
#define llong long long int
#define ldouble long double
#define ternary(condition, x, y) ((condition) ? x : y)
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) x.begin(), x.end()
#define stl_rep(itr, x) for (auto itr = x.begin(); itr != x.end(); ++itr)
const ... | #include <bits/stdc++.h>
using namespace std;
#define llong long long int
#define ldouble long double
#define ternary(condition, x, y) ((condition) ? x : y)
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) x.begin(), x.end()
#define stl_rep(itr, x) for (auto itr = x.begin(); itr != x.end(); ++itr)
const ... | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"identifier.change",
"io.output.change"
] | 1,373,147 | 1,373,148 | u943004959 | cpp |
p03702 |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... | [
"identifier.change",
"io.output.change"
] | 1,373,164 | 1,373,163 | u874996917 | cpp |
p03702 | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false), cin.tie(0)
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define ALL(x) (x).begin(), (x).end()
#define dump(x) cout << (x) << endl
#define LMAX 9223372036854775807LL
#define LMIN -9223... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false), cin.tie(0)
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define ALL(x) (x).begin(), (x).end()
#define dump(x) cout << (x) << endl
#define LMAX 9223372036854775807LL
#define LMIN -9223... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"assignment.change",
"variable_declaration.value.change"
] | 1,373,188 | 1,373,187 | u872959410 | cpp |
p03702 | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false), cin.tie(0)
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define ALL(x) (x).begin(), (x).end()
#define dump(x) cout << (x) << endl
#define LMAX 9223372036854775807LL
#define LMIN -9223... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false), cin.tie(0)
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define ALL(x) (x).begin(), (x).end()
#define dump(x) cout << (x) << endl
#define LMAX 9223372036854775807LL
#define LMIN -9223... | [
"assignment.change",
"variable_declaration.value.change",
"identifier.change"
] | 1,373,189 | 1,373,187 | u872959410 | cpp |
p03702 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define INT_MAX_VALUE 21... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define INT_MAX_VALUE 21... | [
"expression.operation.binary.remove"
] | 1,373,190 | 1,373,191 | u649310245 | cpp |
p03702 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define INT_MAX_VALUE 21... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define INT_MAX_VALUE 21... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,373,192 | 1,373,193 | u649310245 | cpp |
p03702 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, a, b;
cin >> n >> a >> b;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
sort(v.begin(), v.end());
ll r = v[n - 1];
ll l = 0;
while (r - l > 1) {
ll m = (l + r) ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, a, b;
cin >> n >> a >> b;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
sort(v.begin(), v.end());
ll r = v[n - 1];
ll l = 0;
while (r - l > 1) {
ll m = (l + r) ... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,373,196 | 1,373,197 | u623661414 | cpp |
p03702 | #include <cstdio>
#define ll long long
int h[100000], n, a, b;
bool check(int t) {
int c = 0;
for (int i = 1; i <= n; i++)
c += h[i] <= (ll)t * b ? 0 : (h[i] - t * b + a - 1) / a;
return c <= t;
}
int main() {
scanf("%d%d%d", &n, &a, &b), a -= b;
for (int i = 1; i <= n; i++)
scanf("%d", &h[i]);
int ... | #include <cstdio>
#define ll long long
int h[100000], n, a, b;
bool check(int t) {
int c = 0;
for (int i = 1; i <= n && c <= t; i++)
c += h[i] <= (ll)t * b ? 0 : (h[i] - t * b + a - 1) / a;
return c <= t;
}
int main() {
scanf("%d%d%d", &n, &a, &b), a -= b;
for (int i = 1; i <= n; i++)
scanf("%d", &h[i... | [
"control_flow.loop.for.condition.change"
] | 1,373,220 | 1,373,221 | u529933380 | cpp |
p03702 | #include <cstdio>
#define ll long long
int h[100000], n, a, b;
bool check(int t) {
int c = 0;
for (int i = 1; i <= n; i++)
c += h[i] <= (ll)t * b ? 0 : (h[i] - t * b + a - 1) / a;
return c <= t;
}
int main() {
scanf("%d%d%d", &n, &a, &b), a -= b;
for (int i = 1; i <= n; i++)
scanf("%d", &h[i]);
int ... | #include <cstdio>
#define ll long long
int h[100000], n, a, b;
bool check(int t) {
int c = 0;
for (int i = 1; i <= n && c <= t; i++)
c += h[i] <= (ll)t * b ? 0 : (h[i] - t * b + a - 1) / a;
return c <= t;
}
int main() {
scanf("%d%d%d", &n, &a, &b), a -= b;
for (int i = 1; i <= n; i++)
scanf("%d", &h[i... | [
"control_flow.loop.for.condition.change",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 1,373,222 | 1,373,221 | u529933380 | cpp |
p03702 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
typedef long long ll... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
typedef long long ll... | [
"literal.number.change",
"control_flow.loop.condition.change",
"assignment.change"
] | 1,373,223 | 1,373,224 | u423143252 | cpp |
p03702 |
#include "bits/stdc++.h"
using namespace std;
#define DEBUG(x) cout << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cout << #v << ":"; \
for (int i = 0; i < v.size(); i++) ... |
#include "bits/stdc++.h"
using namespace std;
#define DEBUG(x) cout << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cout << #v << ":"; \
for (int i = 0; i < v.size(); i++) ... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"variable_declaration.type.change"
] | 1,373,238 | 1,373,239 | u579152247 | cpp |
p03702 | //#include <bits/stdc++.h>
#include <algorithm>
//#include <cstdio>
//#include <functional>
#include <iostream>
//#include <cfloat>
//#include <climits>
//#include <cstdlib>
//#include <cstring>
#include <cmath>
//#include <map>
//#include <queue>
//#include <set>
//#include <sstream>
//#include <stack>
//#include <str... | //#include <bits/stdc++.h>
#include <algorithm>
//#include <cstdio>
//#include <functional>
#include <iostream>
//#include <cfloat>
//#include <climits>
//#include <cstdlib>
//#include <cstring>
#include <cmath>
//#include <map>
//#include <queue>
//#include <set>
//#include <sstream>
//#include <stack>
//#include <str... | [
"variable_declaration.type.change"
] | 1,373,261 | 1,373,262 | u840087215 | cpp |
p03702 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (int(i) = (0); (i) < (n); ++(i))
#define repp(i, m, n) for (int(i) = (m); (i) < (n); ++(i))
#define debug(x) cerr <... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (int(i) = (0); (i) < (n); ++(i))
#define repp(i, m, n) for (int(i) = (m); (i) < (n); ++(i))
#define debug(x) cerr <... | [
"expression.operation.binary.remove",
"assignment.change"
] | 1,373,324 | 1,373,325 | u219873012 | cpp |
p03702 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define MOD 1000000007
int n;
ll a, b;
ll h[100005];
bool enough(ll x) {
ll count = 0;
for (int i = 0; i < n; i++) {
if (h[i] <= x * b)
continue;
ll y = h[i] - b * x;
if (y % (a - b)) {
coun... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define MOD 1000000007
int n;
ll a, b;
ll h[100005];
bool enough(ll x) {
ll count = 0;
for (int i = 0; i < n; i++) {
if (h[i] <= x * b)
continue;
ll y = h[i] - b * x;
if (y % (a - b)) {
coun... | [
"expression.operation.binary.remove"
] | 1,373,328 | 1,373,329 | u046768272 | cpp |
p03702 | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define int unsigned long long
us... | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define int long long
using names... | [
"literal.number.change",
"call.arguments.change"
] | 1,373,414 | 1,373,415 | u016612263 | cpp |
p03702 | #include <bits/stdc++.h>
using namespace std;
const int DIM = 1e5 + 5;
int arr[DIM], aux[DIM];
int main(void) {
ios::sync_with_stdio(false);
cin.tie();
cout.tie();
int n, a, b;
cin >> n >> a >> b;
for (int i = 1; i <= n; i++)
cin >> arr[i];
int pos = 1;
for (int le = 1, ri = 1e9 / b + 1; le <=... | #include <bits/stdc++.h>
using namespace std;
const int DIM = 1e5 + 5;
int arr[DIM], aux[DIM];
int main(void) {
ios::sync_with_stdio(false);
cin.tie();
cout.tie();
int n, a, b;
cin >> n >> a >> b;
for (int i = 1; i <= n; i++)
cin >> arr[i];
int pos = 1;
for (int le = 1, ri = 1e9 / b + 1; le <=... | [
"assignment.change"
] | 1,373,424 | 1,373,425 | u741323508 | cpp |
p03703 | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#... | [
"control_flow.loop.condition.change"
] | 1,373,434 | 1,373,435 | u714724786 | cpp |
p03703 | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#... | [
"control_flow.loop.condition.change",
"variable_declaration.type.change"
] | 1,373,437 | 1,373,435 | u714724786 | cpp |
p03703 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> iint;
typedef pair<ll, ll> llll;
const ll zero = 0;
const ll INF = 3000000000000000000; // 10^18
const int inINF = 1000000000; // 10^9
const ll MOD = 1000000007; // 10^9+7
const ll MOD2 = 998244353;
// 1-indexedのB... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> iint;
typedef pair<ll, ll> llll;
const ll zero = 0;
const ll INF = 3000000000000000000; // 10^18
const int inINF = 1000000000; // 10^9
const ll MOD = 1000000007; // 10^9+7
const ll MOD2 = 998244353;
// 1-indexedのB... | [
"assignment.change"
] | 1,373,440 | 1,373,441 | u478462004 | cpp |
p03703 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
using namespace std;
using ll = long long;
const int INF = (1 << 30) - 1;
const long long LINF = (1LL << 62) - 1;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
using namespace std;
using ll = long long;
const int INF = (1 << 30) - 1;
const long long LINF = (1LL << 62) - 1;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
... | [
"assignment.change"
] | 1,373,457 | 1,373,458 | u608258653 | cpp |
p03703 | #include <bits/stdc++.h>
#define PII pair<int, int>
#define LL long long
using namespace std;
const int MAXN = 200005;
const LL MOD = 998244353;
const LL INF = (LL)1e9 + 5;
struct BIT {
int c[MAXN];
void add(int p) {
while (p < MAXN) {
c[p]++;
p += p & -p;
}
}
int get(int p) {
int res =... | #include <bits/stdc++.h>
#define PII pair<int, int>
#define LL long long
using namespace std;
const int MAXN = 200005;
const LL MOD = 998244353;
const LL INF = (LL)1e9 + 5;
struct BIT {
LL c[MAXN];
void add(int p) {
while (p < MAXN) {
c[p]++;
p += p & -p;
}
}
LL get(int p) {
LL res = 0;... | [
"variable_declaration.type.change",
"control_flow.loop.condition.change"
] | 1,373,461 | 1,373,462 | u863370423 | cpp |
p03703 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define N 202500
int n, m, k;
ll c[N];
int a[N];
ll sum[N];
int lowbit(int x) { return x & -x; }
ll bitsum(int x) {
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define N 202500
int n, m, k, cnt;
ll c[N];
int a[N];
ll sum[N];
int lowbit(int x) { return x & -x; }
ll bitsum(int ... | [
"variable_declaration.add",
"identifier.change",
"control_flow.loop.condition.change"
] | 1,373,467 | 1,373,468 | u089230684 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.