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 |
|---|---|---|---|---|---|---|---|
p03196 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, P;
cin >> N >> P;
if (N == 1 || P == 1) {
cout << P << endl;
return 0;
}
int counter;
long long ans = 1;
for (long long i = 2; i * i < P; i++) {
counter = 0;
while (P % i == 0) {
counter++;
P /= i;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, P;
cin >> N >> P;
if (N == 1 || P == 1) {
cout << P << endl;
return 0;
}
long counter;
long ans = 1;
for (long i = 2; i * i <= P; i++) {
counter = 0;
while (P % i == 0) {
counter++;
P /= i;
}
if (coun... | [
"variable_declaration.type.narrow.change",
"variable_declaration.type.primitive.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change"
] | 993,251 | 993,249 | u618697411 | cpp |
p03200 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
int main() {
string S;
cin >> S;
ll w... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
int main() {
string S;
cin >> S;
ll w... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 993,309 | 993,310 | u340980616 | cpp |
p03200 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(v) (v).begin(), (v).end()
#define INF 2e9
typedef long long ll;
int main() {
string s;
cin >> s;
int b = 0;
ll ans = 0;
REP(i, s.size() - 1) {
i... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(v) (v).begin(), (v).end()
#define INF 2e9
typedef long long ll;
int main() {
string s;
cin >> s;
int b = 0;
ll ans = 0;
REP(i, s.size()) {
if (s... | [
"expression.operation.binary.remove"
] | 993,452 | 993,453 | u291873788 | cpp |
p03200 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999
#define rep(i, m, n) for (lli i = m; i < n; i++)
#define rrep(i, m, n) for (lli i = n - 1; i > m; i--)
#define pb(n) push_back(n)
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) rever... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999
#define rep(i, m, n) for (lli i = m; i < n; i++)
#define rrep(i, m, n) for (lli i = n - 1; i > m; i--)
#define pb(n) push_back(n)
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) rever... | [
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 993,546 | 993,547 | u618604643 | cpp |
p03200 | #include <bits/stdc++.h>
#define rep(i, n, m) for (int i = (n); i < (m); i++)
#define rrep(i, n, m) for (int i = (n)-1; i >= (m); i--)
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
vector<int> cum_cnt(s.size(), 0);
rep(i, 0, s.size() + 1) cum_cnt[i + 1] = cum_cnt[i] + int(s[i] ==... | #include <bits/stdc++.h>
#define rep(i, n, m) for (int i = (n); i < (m); i++)
#define rrep(i, n, m) for (int i = (n)-1; i >= (m); i--)
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
vector<int> cum_cnt(s.size() + 1, 0);
rep(i, 0, s.size()) cum_cnt[i + 1] = cum_cnt[i] + int(s[i] ==... | [
"expression.operation.binary.remove",
"variable_declaration.type.change"
] | 993,559 | 993,558 | u052247353 | cpp |
p03200 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
string s = "";
cin >> s;
int ans = 0;
int to = 0;
for (int i = 0; i < s.size(); i++... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
string s = "";
cin >> s;
ll ans = 0;
int to = 0;
for (int i = 0; i < s.size(); i++)... | [
"variable_declaration.type.change",
"literal.string.change",
"literal.string.case.change",
"control_flow.branch.if.condition.change"
] | 993,578 | 993,577 | u324549724 | cpp |
p03200 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int i, j = 0;
long long ans = 0;
string s;
cin >> s;
for (i = 1; i < s.size(); i++) {
if (s[i] == 'W') {
ans += i - j;
j++;
}
}
cout << ans << "\n";
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int i, j = 0, w = 0;
long long ans = 0;
string s;
cin >> s;
for (i = 0; i < s.size(); i++) {
if (s[i] == 'W') {
ans += i - j;
j++;
}
}
cout << ans << "\n";
return 0;
} | [
"variable_declaration.add",
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 993,593 | 993,594 | u583354994 | cpp |
p03200 | #include "bits/stdc++.h"
using namespace std;
int main() {
long long count = 0, ans = 0;
string S;
cin >> S;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'W') {
ans += i - count;
}
}
cout << ans;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
long long count = 0, ans = 0;
string S;
cin >> S;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'W') {
ans += i - count;
count++;
}
}
cout << ans;
} | [
"expression.unary.arithmetic.add"
] | 993,687 | 993,688 | u454087021 | cpp |
p03200 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
uint_fast64_t i, ans;
for (auto c : s) {
if (c == 'W')
ans += i;
else
++i;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
uint_fast64_t i(0), ans(0);
for (auto c : s) {
if (c == 'W')
ans += i;
else
++i;
}
cout << ans << endl;
return 0;
}
| [
"call.arguments.add"
] | 993,744 | 993,745 | u462437857 | cpp |
p03200 |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <iostream>
#include <set>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
/* string s;
cin>>s;
int long long n=s.size();
int os[n+1];
os[0]=0;
int long long j=1;
int ans=0;
for(int long long i=0;i<n;i++){
... |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <iostream>
#include <set>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
/* string s;
cin>>s;
int long long n=s.size();
int os[n+1];
os[0]=0;
int long long j=1;
int ans=0;
for(int long long i=0;i<n;i++){
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 993,906 | 993,905 | u031448582 | cpp |
p03200 | #include "bits/stdc++.h"
using namespace std;
#define int long long
string s;
signed main() {
cin >> s;
int cnt = 0;
int b = 0;
int start = 0;
for (size_t i = 0; i < s.size(); i++) {
if (s[i] == 'B') {
start = i;
break;
}
}
for (size_t i = start; i < s.size(); i++) {
if (s[i] ==... | #include "bits/stdc++.h"
using namespace std;
#define int long long
string s;
signed main() {
cin >> s;
int cnt = 0;
int w = 0;
int start = 0;
for (size_t i = 0; i < s.size(); i++) {
if (s[i] == 'B') {
start = i;
break;
}
}
for (size_t i = start; i < s.size(); i++) {
if (s[i] ==... | [
"variable_declaration.name.change",
"identifier.change",
"assignment.value.change",
"expression.operation.binary.change",
"assignment.change"
] | 993,983 | 993,984 | u062556481 | cpp |
p03200 | #include <bits/stdc++.h>
using namespace std;
string a;
int x, y, z;
int main() {
cin >> a;
for (int i = 0; i < a.size(); ++i) {
if (i == 'W') {
x += i;
y++;
}
}
x -= (y * (y + 1)) / 2;
cout << x;
} | #include <bits/stdc++.h>
using namespace std;
string a;
long long x, y, z;
int main() {
cin >> a;
for (int i = 0; i < a.size(); ++i) {
if (a[i] == 'W') {
x += i;
y++;
}
}
x -= (y * (y - 1)) / 2;
cout << x;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 993,997 | 993,995 | u938024002 | cpp |
p03200 | // By Don4ick
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
typedef unsigned int ui;
#define forn(i, n) for (int i = 1; i <= n; i++)
#define pb push_back
#define all(x) x.begin(), x.end()
#define y1 qewr1234
const double PI = acos(-1.0);
const int DIR = 4;
const int... | // By Don4ick
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
typedef unsigned int ui;
#define forn(i, n) for (int i = 1; i <= n; i++)
#define pb push_back
#define all(x) x.begin(), x.end()
#define y1 qewr1234
const double PI = acos(-1.0);
const int DIR = 4;
const int... | [
"literal.string.change",
"literal.string.case.change",
"control_flow.branch.if.condition.change"
] | 994,005 | 994,006 | u399550746 | cpp |
p03200 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fio ios_base::sync_with_stdio(false)
#define pdl cout << "*" << endl
#define MOD 1000000007
#define INF 1000000000
#define INFLL 1000000000000000000ll
#define mp make_pair
#define pb push_back
#define ff first... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fio ios_base::sync_with_stdio(false)
#define pdl cout << "*" << endl
#define MOD 1000000007
#define INF 1000000000
#define INFLL 1000000000000000000ll
#define mp make_pair
#define pb push_back
#define ff first... | [
"control_flow.branch.if.add"
] | 994,018 | 994,019 | u799550647 | cpp |
p03200 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int count = -1, ans = 0;
for (int i = 1; i < s.size(); i++) {
if (s[i] == 'W') {
count++;
ans = ans + (i - count);
}
}
cout ... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
long long count = -1, ans = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'W') {
count++;
ans = ans + (i - count);
}
}
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 994,179 | 994,178 | u840810569 | cpp |
p03200 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<ULL> VULL;
class MYCP {
public:
static const LL TEISUU = 1000 * 1000 * 1000 + 7;
sta... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<ULL> VULL;
class MYCP {
public:
static const LL TEISUU = 1000 * 1000 * 1000 + 7;
sta... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 994,180 | 994,181 | u304318875 | cpp |
p03200 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <unordered_map>
#... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <unordered_map>
#... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.type.change",
"literal.string.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.arguments.change",
"io.output.change"
] | 994,297 | 994,296 | u711985352 | cpp |
p03200 | #include <bits/stdc++.h>
using namespace std;
char n[200001];
int main() {
long long sumb = 0, ans = 0;
scanf("%s", n);
for (int i = 0; i < strlen(n); i++) {
if (n[i] == 'B')
sumb++;
else if (n[i] == 'W')
ans += sumb;
}
printf("ll%d", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
char n[200001];
int main() {
long long sumb = 0, ans = 0;
scanf("%s", n);
for (int i = 0; i < strlen(n); i++) {
if (n[i] == 'B')
sumb++;
else if (n[i] == 'W')
ans += sumb;
}
printf("%lld", ans);
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 994,361 | 994,362 | u521747257 | cpp |
p03200 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string str;
long long wn = 0;
long long ans = 0;
cin >> str;
for (int i = st... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string str;
long long wn = 0;
long long ans = 0;
cin >> str;
for (int i = st... | [] | 994,405 | 994,406 | u105959367 | cpp |
p03200 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
#pragma GCC optimize("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
#pragma GCC optimize("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);... | [] | 994,408 | 994,409 | u141378465 | cpp |
p03200 | // by xxj
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define ll long long
#define pii pair<int, int>
#define lowbit(x) x & -x
using namespace std;
const int inf = 1e9 + 7;
const double eps = 1e-10;
const ll linf = 1e18 + 7;
const ll hh = 523;
// const int mod=;
string s;
int main() {
// freope... | // by xxj
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define ll long long
#define pii pair<int, int>
#define lowbit(x) x & -x
using namespace std;
const int inf = 1e9 + 7;
const double eps = 1e-10;
const ll linf = 1e18 + 7;
const ll hh = 523;
// const int mod=;
string s;
int main() {
// freope... | [
"variable_declaration.value.change"
] | 994,484 | 994,485 | u776618439 | cpp |
p03200 | // by xxj
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define ll long long
#define pii pair<int, int>
#define lowbit(x) x & -x
using namespace std;
const int inf = 1e9 + 7;
const double eps = 1e-10;
const ll linf = 1e18 + 7;
const ll hh = 523;
// const int mod=;
string s;
int main() {
// freope... | // by xxj
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define ll long long
#define pii pair<int, int>
#define lowbit(x) x & -x
using namespace std;
const int inf = 1e9 + 7;
const double eps = 1e-10;
const ll linf = 1e18 + 7;
const ll hh = 523;
// const int mod=;
string s;
int main() {
// freope... | [
"variable_declaration.value.change",
"assignment.change"
] | 994,486 | 994,485 | u776618439 | cpp |
p03200 | // by xxj
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define ll long long
#define pii pair<int, int>
#define lowbit(x) x & -x
using namespace std;
const int inf = 1e9 + 7;
const double eps = 1e-10;
const ll linf = 1e18 + 7;
const ll hh = 523;
// const int mod=;
string s;
int main() {
// freope... | // by xxj
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define ll long long
#define pii pair<int, int>
#define lowbit(x) x & -x
using namespace std;
const int inf = 1e9 + 7;
const double eps = 1e-10;
const ll linf = 1e18 + 7;
const ll hh = 523;
// const int mod=;
string s;
int main() {
// freope... | [
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change"
] | 994,487 | 994,485 | u776618439 | cpp |
p03200 | // by xxj
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define ll long long
#define pii pair<int, int>
#define lowbit(x) x & -x
using namespace std;
const int inf = 1e9 + 7;
const double eps = 1e-10;
const ll linf = 1e18 + 7;
const ll hh = 523;
// const int mod=;
string s;
int main() {
// freope... | // by xxj
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define ll long long
#define pii pair<int, int>
#define lowbit(x) x & -x
using namespace std;
const int inf = 1e9 + 7;
const double eps = 1e-10;
const ll linf = 1e18 + 7;
const ll hh = 523;
// const int mod=;
string s;
int main() {
// freope... | [
"variable_declaration.type.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 994,488 | 994,485 | u776618439 | cpp |
p03200 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long int li;
int main(void) {
ll i = 0;
ll j = 0;
ll ans = 0;
char s[200001];
for (ll p = 1; p <= 200000; p++) {
s[p]... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long int li;
int main(void) {
ll i = 0;
ll j = 0;
ll ans = 0;
char s[200001];
for (ll p = 1; p <= 200000; p++) {
s[p]... | [] | 994,565 | 994,566 | u795009336 | cpp |
p03200 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
int result = 0;
int count = 0;
cin >> S;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'w') {
result += i - count;
count++;
}
}
cout << result << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
long result = 0;
long count = 0;
cin >> S;
for (long i = 0; i < S.size(); i++) {
if (S[i] == 'W') {
result += i - count;
count++;
}
}
cout << result << endl;
} | [
"variable_declaration.type.primitive.change",
"control_flow.loop.for.initializer.change",
"literal.string.change",
"literal.string.case.change",
"control_flow.branch.if.condition.change"
] | 994,835 | 994,834 | u113589326 | cpp |
p03200 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main(int, char **) {
string s;
unsigned long long ans = 0;
std::cin >> s;
unsigned int tail = 0;
for (uint i = 0; i < s.length(); i++) {
if (s[i] == 'W') {
int m = i - tail;
ans += m;
if (m > 0)
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main(int, char **) {
string s;
unsigned long long ans = 0;
std::cin >> s;
unsigned int tail = 0;
for (uint i = 0; i < s.length(); i++) {
if (s[i] == 'W') {
int m = i - tail;
ans += m;
tail++;
}
... | [] | 994,868 | 994,869 | u869644355 | cpp |
p03200 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main(int, char **) {
string s;
unsigned long long ans = 0;
std::cin >> s;
unsigned int tail = 0;
for (uint i = 0; i < s.length(); i++) {
if (s[i] == 'W') {
int m = i - tail;
ans += m;
if (m > 0)
... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main(int, char **) {
string s;
unsigned long long ans = 0;
std::cin >> s;
unsigned int tail = 0;
for (uint i = 0; i < s.length(); i++) {
if (s[i] == 'W') {
int m = i - tail;
ans += m;
tail++;
}
... | [] | 994,870 | 994,869 | u869644355 | cpp |
p03200 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
long long int ans = 0;
int B_start = -1;
int B_serch = -1;
for (int i = 0; i < s.size() - 1; i++) {
if (s[i] == 'B') {
B_start = i;
B_serch = i;
break;
}
}
if (B_start == -1) {
cout... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
long long int ans = 0;
int B_start = -1;
int B_serch = -1;
for (int i = 0; i < s.size() - 1; i++) {
if (s[i] == 'B') {
B_start = i;
B_serch = i;
break;
}
}
if (B_start == -1) {
cout... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 994,878 | 994,879 | u048128931 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.sync_with_stdio(0);
int n;
cin >> n;
vector<int> a(n);
map<long, int> m;
for (int i = 0; i < n; ++i) {
cin >> a[i];
m[a[i]]++;
}
vector<int> c(n);
for (int i = 0; i < n; ++i) {
for (long j = 1; j < 1L << 31; j *= 2) {
i... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.sync_with_stdio(0);
int n;
cin >> n;
vector<int> a(n);
map<long, int> m;
for (int i = 0; i < n; ++i) {
cin >> a[i];
m[a[i]]++;
}
vector<int> c(n);
for (int i = 0; i < n; ++i) {
for (long j = 1; j < 1L << 31; j *= 2) {
i... | [
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 995,021 | 995,022 | u503549962 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
A.push_back(x);
}
sort(A.begin(), A.end());
if (N == 1) {
cout << 0 << endl;
return 0;
}
int maxcand = A[N - 1] + A[N - 2];
int maxt = log2(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
A.push_back(x);
}
sort(A.begin(), A.end());
if (N == 1) {
cout << 0 << endl;
return 0;
}
int maxcand = A[N - 1] + A[N - 2];
int maxt = log2(... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.remove"
] | 995,029 | 995,030 | u482092601 | cpp |
p03201 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <map>
using namespace std;
map<int, int> ap;
int a[2 * 100 * 1000 + 5], del[2 * 100 * 1000 + 5];
int n, x, i, j, pp, ok, p;
int main() {
ios_base::sync_with_stdio(false);
// freopen("data.in","r",stdin);
cin >> n;
for (i = 1; i <= n; i++)
... | #include <algorithm>
#include <fstream>
#include <iostream>
#include <map>
using namespace std;
map<int, int> ap;
int a[2 * 100 * 1000 + 5], del[2 * 100 * 1000 + 5];
int n, x, i, j, pp, ok, p;
int main() {
ios_base::sync_with_stdio(false);
// freopen("data.in","r",stdin);
cin >> n;
for (i = 1; i <= n; i++)
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 995,039 | 995,040 | u178681512 | cpp |
p03201 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long unsigned int ... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long unsigned int ... | [
"control_flow.branch.if.condition.change",
"control_flow.branch.if.add"
] | 995,045 | 995,046 | u032337012 | cpp |
p03201 | #include <algorithm>
#include <stdio.h>
int main() {
int n;
scanf("%d", &n);
long long a[200000];
long long b[200000];
int c[200000];
int m;
for (int i = 0; i < n; i++) {
scanf("%lld", a + i);
}
std::sort(a, a + n);
long long r[31];
int l, u, k = 0;
r[0] = 1;
for (int i = 1; i < 31; i++)
... | #include <algorithm>
#include <stdio.h>
int main() {
int n;
scanf("%d", &n);
long long a[200000];
long long b[200000];
int c[200000];
int m;
for (int i = 0; i < n; i++) {
scanf("%lld", a + i);
}
std::sort(a, a + n);
long long r[31];
int l, u, k = 0;
r[0] = 1;
for (int i = 1; i < 31; i++)
... | [
"expression.unary.arithmetic.add",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 995,051 | 995,052 | u546925116 | cpp |
p03201 | // Phoenix
#include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
#define sz(s) int((s).size())
#define bit(n, k) (((n) >> (k)) & 1)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int maxn = 1e5 + 10, mod = 1e9 + 7;
const ll inf = 1e18... | // Phoenix
#include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
#define sz(s) int((s).size())
#define bit(n, k) (((n) >> (k)) & 1)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int maxn = 1e5 + 10, mod = 1e9 + 7;
const ll inf = 1e18... | [
"call.function.change"
] | 995,053 | 995,054 | u831735646 | cpp |
p03201 | #include <algorithm>
#include <deque>
#include <set>
#include <stdio.h>
using namespace std;
using ll = long long;
ll next(ll x) {
ll i = 1;
for (; i <= x; i *= 2)
;
return i;
}
int main() {
ll n, t, p;
scanf("%lld", &n);
set<ll> a;
for (int i = 0; i < n; i++)
scanf("%lld", &t), a.emplace(t);
... | #include <algorithm>
#include <deque>
#include <set>
#include <stdio.h>
using namespace std;
using ll = long long;
ll next(ll x) {
ll i = 1;
for (; i <= x; i *= 2)
;
return i;
}
int main() {
ll n, t, p;
scanf("%lld", &n);
multiset<ll> a;
for (int i = 0; i < n; i++)
scanf("%lld", &t), a.emplace(t);... | [
"variable_declaration.type.change"
] | 995,055 | 995,056 | u196520288 | cpp |
p03201 | #include <algorithm>
#include <deque>
#include <set>
#include <stdio.h>
using namespace std;
using ll = long long;
ll next(ll x) {
ll i = 1;
for (; i <= x; i *= 2)
;
return i;
}
int main() {
ll n, t, p;
scanf("%lld", &n);
set<ll> a;
for (int i = 0; i < n; i++)
scanf("%lld", &t), a.emplace(t);
... | #include <algorithm>
#include <deque>
#include <set>
#include <stdio.h>
using namespace std;
using ll = long long;
ll next(ll x) {
ll i = 1;
for (; i <= x; i *= 2)
;
return i;
}
int main() {
ll n, t, p;
scanf("%lld", &n);
multiset<ll> a;
for (int i = 0; i < n; i++)
scanf("%lld", &t), a.emplace(t);... | [
"variable_declaration.type.change",
"call.function.change",
"control_flow.loop.condition.change"
] | 995,057 | 995,056 | u196520288 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
const int MAX = 2e5 + 5;
int n, ans;
int a[MAX];
map<int, int> ma;
bool use[MAX];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]), ++ma[a[i]];
sort(a + 1, a + 1 + n);
for (int i = 31; i >= 1; --i) {
for (int j = 1; j <= n; ++j)
... | #include <bits/stdc++.h>
using namespace std;
const int MAX = 2e5 + 5;
int n, ans;
int a[MAX];
map<int, int> ma;
bool use[MAX];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]), ++ma[a[i]];
sort(a + 1, a + 1 + n);
for (int i = 31; i >= 1; --i) {
for (int j = 1; j <= n; ++j)
... | [] | 995,064 | 995,065 | u281082833 | cpp |
p03201 | // Author: πα
#include <bits/stdc++.h>
using namespace std;
#define FastIO \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
... | // Author: πα
#include <bits/stdc++.h>
using namespace std;
#define FastIO \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
... | [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change"
] | 995,066 | 995,067 | u518468154 | cpp |
p03201 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#inc... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#inc... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 995,074 | 995,075 | u202928696 | cpp |
p03201 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define ll long long
#define pb push_back
#define sz(x) (int)(x).size()
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(), x.end()
using namespace std;
using namespac... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define ll long long
#define pb push_back
#define sz(x) (int)(x).size()
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(), x.end()
using namespace std;
using namespac... | [] | 995,076 | 995,077 | u013064880 | cpp |
p03201 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define ll long long
#define pb push_back
#define sz(x) (int)(x).size()
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(), x.end()
using namespace std;
using namespac... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define ll long long
#define pb push_back
#define sz(x) (int)(x).size()
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(), x.end()
using namespace std;
using namespac... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 995,078 | 995,077 | u013064880 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
long long a[200010];
long long i, j, k, n, s, t, ans;
map<long long, int> mp;
int main() {
scanf("%lld", &n);
for (i = 1; i <= n; i++)
scanf("%lld", &a[i]);
sort(a + 1, a + 1 + n);
t = 1;
ans = 0;
while (t <= a[n])
t *= 2;
mp.clea... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
long long a[200010];
long long i, j, k, n, s, t, ans;
map<long long, int> mp;
int main() {
scanf("%lld", &n);
for (i = 1; i <= n; i++)
scanf("%lld", &a[i]);
sort(a + 1, a + 1 + n);
t = 1;
ans = 0;
while (t <= a[n])
t *= 2;
mp.clea... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 995,081 | 995,082 | u110541090 | cpp |
p03201 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector... | [
"control_flow.break.remove",
"control_flow.continue.add"
] | 995,083 | 995,084 | u754862537 | cpp |
p03201 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.break.remove",
"control_flow.continue.add"
] | 995,085 | 995,084 | u754862537 | cpp |
p03201 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
map<ll, ll> mmp;
int main() {
int n;
while (~scanf("%d", &n)) {
for (int i = 0; i < n; i++) {
ll x;
scanf("%lld... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
map<ll, ll> mmp;
int main() {
int n;
while (~scanf("%d", &n)) {
for (int i = 0; i < n; i++) {
ll x;
scanf("%lld... | [
"literal.number.change",
"control_flow.loop.condition.change"
] | 995,086 | 995,087 | u795680032 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define FOR(i, x, y) \
for (decay<decltype(y)>::type i = (x), _##i = (y); i < _##i; ++i)
#define FORD(i, x, y) \
for (decay<decltype(... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define FOR(i, x, y) \
for (decay<decltype(y)>::type i = (x), _##i = (y); i < _##i; ++i)
#define FORD(i, x, y) \
for (decay<decltype(... | [
"call.function.change",
"call.arguments.change"
] | 995,088 | 995,089 | u384394986 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define FOR(i, x, y) \
for (decay<decltype(y)>::type i = (x), _##i = (y); i < _##i; ++i)
#define FORD(i, x, y) \
for (decay<decltype(... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define FOR(i, x, y) \
for (decay<decltype(y)>::type i = (x), _##i = (y); i < _##i; ++i)
#define FORD(i, x, y) \
for (decay<decltype(... | [
"call.function.change",
"call.arguments.change"
] | 995,090 | 995,089 | u384394986 | cpp |
p03201 | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
long find(long n) {
long tmp = 1;
int len = 0;
while (tmp <= n) {
tmp *= 2;
len++;
// cout << tmp;
}
return tmp - n;
}
int main() {
int N;
long A[200000];
cin >> N;
map<long, int> m;
for (int i = 0; i < N; i+... | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
long find(long n) {
long tmp = 1;
int len = 0;
while (tmp <= n) {
tmp *= 2;
len++;
// cout << tmp;
}
return tmp - n;
}
int main() {
int N;
long A[200000];
cin >> N;
map<long, int> m;
for (int i = 0; i < N; i+... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 995,091 | 995,092 | u693133807 | cpp |
p03201 | #include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int n;
ll a[200005];
bool used[200005];
int main(void) {
scanf("%d", &n);
vector<ll> vec;
for (int i = 0; i < n; i++) {
scanf("%lld", &a[i]);
vec.push_back(a[i]);
}
sort(vec.begin()... | #include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int n;
ll a[200005];
bool used[200005];
int main(void) {
scanf("%d", &n);
vector<ll> vec;
for (int i = 0; i < n; i++) {
scanf("%lld", &a[i]);
vec.push_back(a[i]);
}
sort(vec.begin()... | [
"identifier.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 995,093 | 995,094 | u854869949 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
int M, N, a[200009], b[200009], c[200009], dp[200009][2];
bool isRoot[200009], can[200009];
vector<int> v[200009];
map<int, int> mp;
int main() {
// freopen ("input", "r", stdin);
// freopen ("output", "w", stdout);
scanf("%d", &M);
for (int i = 1; i <= M; i++)
... | #include <bits/stdc++.h>
using namespace std;
int M, N, a[200009], b[200009], c[200009], dp[200009][2];
bool isRoot[200009], can[200009];
vector<int> v[200009];
map<int, int> mp;
int main() {
// freopen ("input", "r", stdin);
// freopen ("output", "w", stdout);
scanf("%d", &M);
for (int i = 1; i <= M; i++)
... | [
"call.arguments.change",
"call.arguments.add"
] | 995,095 | 995,096 | u098930106 | cpp |
p03201 | #include <bits/stdc++.h>
#define LL long long
using namespace std;
const int maxn = 2e5 + 7;
int b[maxn], a[maxn], bits[50], cnt[maxn], tot = 0;
map<int, int> exist;
int vis[maxn];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
exist[a[i]]++;
}
sort(a, a + n);
... | #include <bits/stdc++.h>
#define LL long long
using namespace std;
const int maxn = 2e5 + 7;
int b[maxn], a[maxn], bits[50], cnt[maxn], tot = 0;
map<int, int> exist;
int vis[maxn];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
exist[a[i]]++;
}
sort(a, a + n);
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 995,105 | 995,106 | u366089652 | cpp |
p03201 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define FOR(i, b, e) for (ll i = (ll)(b)... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define FOR(i, b, e) for (ll i = (ll)(b)... | [
"variable_declaration.type.change"
] | 995,115 | 995,116 | u715750943 | cpp |
p03201 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define FOR(i, b, e) for (ll i = (ll)(b)... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define FOR(i, b, e) for (ll i = (ll)(b)... | [
"variable_declaration.type.change"
] | 995,117 | 995,116 | u715750943 | cpp |
p03201 |
#include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp> namespace mp =
//boost::multiprecision; //mp::cpp_intで宣言
using namespace std;
typedef long long ll;
#define i_7 (ll)(1E9 + 7)
#define i_5 (ll)(1E9 + 5)
ll mod(ll a) {
ll c = a % i_7;
if (c >= 0)
return c;
else
return c + i_7;
}
typede... |
#include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp> namespace mp =
//boost::multiprecision; //mp::cpp_intで宣言
using namespace std;
typedef long long ll;
#define i_7 (ll)(1E9 + 7)
#define i_5 (ll)(1E9 + 5)
ll mod(ll a) {
ll c = a % i_7;
if (c >= 0)
return c;
else
return c + i_7;
}
typede... | [
"misc.opposites",
"identifier.change",
"call.function.change"
] | 995,118 | 995,119 | u763881112 | cpp |
p03201 | #include <algorithm>
#include <cstdio>
#include <map>
std::map<int, int> mp;
int a[201000];
int main() {
int n, ans = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
mp[a[i]]++;
}
std::sort(a + 1, a + n + 1);
for (int i = n; i >= 1; i--) {
if (mp[a[i]])
mp[a[i]]--;... | #include <algorithm>
#include <cstdio>
#include <map>
std::map<int, int> mp;
int a[201000];
int main() {
int n, ans = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
mp[a[i]]++;
}
std::sort(a + 1, a + n + 1);
for (int i = n; i >= 1; i--) {
if (!mp[a[i]])
continue;
... | [
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 995,128 | 995,129 | u220632857 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i, a) ROF(i, 0, a)
using ll = long long;
using ld = long double;
ll INF = LLONG_MAX;
using vi = vector<int>;
using vll ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i, a) ROF(i, 0, a)
using ll = long long;
using ld = long double;
ll INF = LLONG_MAX;
using vi = vector<int>;
using vll ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 995,130 | 995,131 | u148425972 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repp(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define repm(i, n) for (int(i) = (n - 1); (i) >= 0; (i)--)
#define INF (1ll << 60)
#define all(x) (x).begin(), (x).end()
typedef long long lint;
const lint MOD = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repp(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define repm(i, n) for (int(i) = (n - 1); (i) >= 0; (i)--)
#define INF (1ll << 60)
#define all(x) (x).begin(), (x).end()
typedef long long lint;
const lint MOD = ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"control_flow.branch.if.condition.change"
] | 995,132 | 995,133 | u768204022 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
map<int, int> vis;
int n, ans, k, a[200005];
int tmp[50] = {1, 2, 4, 8, 16, 32,
64, 128, 256, 512, 1024, 2048,
4096, 8192, 16384, 32768, 65536, 131072,
... | #include <bits/stdc++.h>
using namespace std;
map<int, int> vis;
int n, ans, k, a[200005];
int tmp[] = {1, 2, 4, 8, 16, 32,
64, 128, 256, 512, 1024, 2048,
4096, 8192, 16384, 32768, 65536, 131072,
... | [
"control_flow.branch.if.condition.change"
] | 995,134 | 995,135 | u816631826 | cpp |
p03201 | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i, a, b) ((a) <= (i) && (i) < (b))
#defin... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i, a, b) ((a) <= (i) && (i) < (b))
#defin... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 995,136 | 995,137 | u521723672 | cpp |
p03201 | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
int N;
cin >> N;
vector<ll> A(N);
map<ll, ll> cnt;
for (int i = 0; i < N; i++) {
cin >> A[i];
cnt[A[i]]++;
}
sort(A.begin(), A.end());
int ans = 0;
for (int i = N - 1; i >= 0; i--) {
... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
int N;
cin >> N;
vector<ll> A(N);
map<ll, ll> cnt;
for (int i = 0; i < N; i++) {
cin >> A[i];
cnt[A[i]]++;
}
sort(A.begin(), A.end());
int ans = 0;
for (int i = N - 1; i >= 0; i--) {
... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 995,138 | 995,139 | u119098168 | cpp |
p03201 | #include <bits/stdc++.h>
#define endl enjoy_codeforces
using lint = long long;
int main() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
int n;
std::cin >> n;
std::multiset<int, std::greater<>> a;
while (n--) {
int x;
std::cin >> x;
a.insert(x);
}
int ans = 0;
while (!a.em... | #include <bits/stdc++.h>
#define endl enjoy_codeforces
using lint = long long;
int main() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
int n;
std::cin >> n;
std::multiset<int, std::greater<>> a;
while (n--) {
int x;
std::cin >> x;
a.insert(x);
}
int ans = 0;
while (!a.em... | [
"control_flow.branch.if.condition.change"
] | 995,149 | 995,150 | u846041485 | cpp |
p03201 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define repr(i, a, b) for (in... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define repr(i, a, b) for (in... | [
"identifier.change",
"call.arguments.change"
] | 995,152 | 995,153 | u314008046 | cpp |
p03201 | #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; ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 995,157 | 995,158 | u768152935 | cpp |
p03201 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mkp make_pair
#define pr(num) cout << num << "\n"
#define max(a, b) ((a) > (b) ? (... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mkp make_pair
#define pr(num) cout << num << "\n"
#define max(a, b) ((a) > (b) ? (... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 995,159 | 995,160 | u768152935 | cpp |
p03201 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mkp make_pair
#define pr(num) cout << num << "\n"
#define max(a, b) ((a) > (b) ? (... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mkp make_pair
#define pr(num) cout << num << "\n"
#define max(a, b) ((a) > (b) ? (... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 995,159 | 995,161 | u768152935 | cpp |
p03201 | #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#define SIZE 300005
#define MOD 1000000007LL
#define EPS 1e-10
#define INF 2147483647
#define LLINF 9223372036854775807LL
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a... | #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#define SIZE 300005
#define MOD 1000000007LL
#define EPS 1e-10
#define INF 2147483647
#define LLINF 9223372036854775807LL
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 995,164 | 995,165 | u425287928 | cpp |
p03201 | #include <array>
#include <bits/stdc++.h>
using namespace std;
using ULL = unsigned long long;
using UL = unsigned;
using LL = long long;
#define rep(i, n) for (UL i = 0; i < (n); i++)
struct Problem {
void Solve() {
UL N;
cin >> N;
multiset<UL> A;
rep(i, N) {
UL a;
cin >> a;
A.ins... | #include <array>
#include <bits/stdc++.h>
using namespace std;
using ULL = unsigned long long;
using UL = unsigned;
using LL = long long;
#define rep(i, n) for (UL i = 0; i < (n); i++)
struct Problem {
void Solve() {
UL N;
cin >> N;
multiset<UL> A;
rep(i, N) {
UL a;
cin >> a;
A.ins... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 995,166 | 995,167 | u331948661 | cpp |
p03201 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
constexpr long long mod = 1000000007;
constexpr double eps = 0.00001;
int main() {
int n;
cin >> n;
long long *a = new long long[n... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
constexpr long long mod = 1000000007;
constexpr double eps = 0.00001;
int main() {
int n;
cin >> n;
long long *a = new long long[n... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 995,168 | 995,169 | u751537640 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
;
#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 INF 1 << 30
#define LINF 1LL << 62
#define all(x) (x).begin(), (x).end... | #include <bits/stdc++.h>
using namespace std;
;
#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 INF 1 << 30
#define LINF 1LL << 62
#define all(x) (x).begin(), (x).end... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 995,170 | 995,171 | u013628553 | cpp |
p03201 | #include <bits/stdc++.h>
int main(void) {
using namespace std;
long n;
cin >> n;
vector<long> a(n);
for (auto &x : a)
cin >> x;
map<long, long> m;
for (auto &x : a) {
m[x] = m[x] + 1;
}
long r = 0;
for (long i = 1l << 40; i; i >>= 1) {
for (auto &t : m) {
if (t.second == 0)
... | #include <bits/stdc++.h>
int main(void) {
using namespace std;
long n;
cin >> n;
vector<long> a(n);
for (auto &x : a)
cin >> x;
map<long, long> m;
for (auto &x : a) {
m[x] = m[x] + 1;
}
long r = 0;
for (long i = 1l << 40; i; i >>= 1) {
for (auto &t : m) {
if (t.second == 0)
... | [
"assignment.add"
] | 995,172 | 995,173 | u056944756 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool c... | [] | 995,177 | 995,178 | u187878098 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool c... | [
"literal.number.change",
"variable_declaration.value.change"
] | 995,180 | 995,178 | u187878098 | cpp |
p03201 | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define MOD 1000000007
#define INF 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define req(i, j, n) for (int i = j; i <= (int)(n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int pw2(int n) {
int t = 1;
whi... | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define MOD 1000000007
#define INF 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define req(i, j, n) for (int i = j; i <= (int)(n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int pw2(int n) {
int t = 1;
whi... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 995,181 | 995,182 | u233626335 | cpp |
p03201 | // https://atcoder.jp/contests/agc029/tasks/agc029_b
#include "algorithm"
#include "bitset"
#include "cmath"
#include "functional"
#include "iomanip"
#include "iostream"
#include "map"
#include "numeric"
#include "queue"
#include "set"
#include "string"
#include "vector"
#define rep(i, to) for (ll i = 0; i < (to); ++i... | // https://atcoder.jp/contests/agc029/tasks/agc029_b
#include "algorithm"
#include "bitset"
#include "cmath"
#include "functional"
#include "iomanip"
#include "iostream"
#include "map"
#include "numeric"
#include "queue"
#include "set"
#include "string"
#include "vector"
#define rep(i, to) for (ll i = 0; i < (to); ++i... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 995,185 | 995,186 | u751468134 | cpp |
p03201 | #include <bits/stdc++.h>
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define rep(i, n) FOR(i, 0, n)
using namespace std;
typedef long long ll;
ll n, a;
multiset<ll, greater<ll>> st;
map<ll, ll> mp;
int main() {
cin >> n;
rep(i, n) {
cin >> a;
st.insert(a);
}
ll ans = 0;
while (!st.empty(... | #include <bits/stdc++.h>
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define rep(i, n) FOR(i, 0, n)
using namespace std;
typedef long long ll;
ll n, a;
multiset<ll, greater<ll>> st;
map<ll, ll> mp;
int main() {
cin >> n;
rep(i, n) {
cin >> a;
st.insert(a);
}
ll ans = 0;
while (!st.empty(... | [
"expression.operator.change"
] | 995,191 | 995,192 | u047554023 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
multiset<int> arr;
int N, cnt;
int main() {
cin >> N;
for (int i = 1, x; i <= N; ++i) {
cin >> x;
arr.insert(x);
}
while (!arr.empty()) {
int t = *--arr.end();
arr.erase(t);
int x = 1 << (int)(log2(t + 0.1) + 1);
if (arr.find(x - t) != arr.... | #include <bits/stdc++.h>
using namespace std;
multiset<int> arr;
int N, cnt;
int main() {
cin >> N;
for (int i = 1, x; i <= N; ++i) {
cin >> x;
arr.insert(x);
}
while (!arr.empty()) {
int t = *--arr.end();
arr.erase(arr.find(t));
int x = 1 << (int)(log2(t + 0.1) + 1);
if (arr.find(x - ... | [
"call.add",
"call.arguments.change"
] | 995,197 | 995,198 | u563201135 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
//#define MOD 998244353
#define INF 1145141919810893364
//#define INF 810114514
#define PI 3.141592653589
typedef pair<int, int> PP;
typedef long long ll;
#define int ll
#define setdouble setprecision
#define REP(i, n) for (int i = 0; i < (n); ++i)
#d... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
//#define MOD 998244353
#define INF 1145141919810893364
//#define INF 810114514
#define PI 3.141592653589
typedef pair<int, int> PP;
typedef long long ll;
#define int ll
#define setdouble setprecision
#define REP(i, n) for (int i = 0; i < (n); ++i)
#d... | [
"identifier.change",
"call.arguments.change"
] | 995,199 | 995,200 | u554953477 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n;
cin >> n;
multimap<int, int> mp;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
mp.insert({a, 1});
}
// mp.eraseの方でもやりたみ
int ans = 0;
for (; !mp.empty();) {
auto p = mp.end();
p--;
int t... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n;
cin >> n;
multimap<int, int> mp;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
mp.insert({a, 1});
}
int ans = 0;
for (; !mp.empty();) {
auto p = mp.end();
p--;
int t = 1;
while (p->fi... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 995,201 | 995,202 | u344122377 | cpp |
p03201 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define mod (1000000000 + 7)
#define N (10007)
#define INF 1e16
typedef long long ll;
typedef pair<int, int> P;
int main(void) {
ll n;
... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define mod (1000000000 + 7)
#define N (10007)
#define INF 1e16
typedef long long ll;
typedef pair<int, int> P;
int main(void) {
ll n;
... | [
"identifier.change",
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 995,205 | 995,204 | u744305661 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
multiset<uint32_t> st;
for (int _ = 0; _ < n; _++) {
uint32_t x;
cin >> x;
st.insert(x);
}
int cnt = 0;
while (st.size() > 2) {
auto x = *st.rbegin();
st.erase(--st.end());
uint32_t pw = 1 << (32 - __bu... | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
multiset<uint32_t> st;
for (int _ = 0; _ < n; _++) {
uint32_t x;
cin >> x;
st.insert(x);
}
int cnt = 0;
while (st.size() >= 2) {
auto x = *st.rbegin();
st.erase(--st.end());
uint32_t pw = 1 << (32 - __b... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 995,208 | 995,209 | u031986221 | cpp |
p03201 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
#define mkp make_pair
#define mkt make_tuple
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const l... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
#define mkp make_pair
#define mkt make_tuple
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const l... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 995,215 | 995,216 | u646339490 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
// const ll MOD = ;
ll mod(ll A, ll M) { return (A % M + M) % M; }
const ll INF = 1LL << 60;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return fals... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
// const ll MOD = ;
ll mod(ll A, ll M) { return (A % M + M) % M; }
const ll INF = 1LL << 60;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return fals... | [
"expression.operation.binary.remove"
] | 995,219 | 995,220 | u811472478 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define len(v) ll(v.size())
#define fi first
#define se second
template <class T> void cout_vec(const vector<T> &vec) {
for (auto it... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define len(v) ll(v.size())
#define fi first
#define se second
template <class T> void cout_vec(const vector<T> &vec) {
for (auto it... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 995,221 | 995,222 | u340010271 | cpp |
p03201 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
#define ll long long
#define REP(a, b, c) for (int a = b; a <= c; a++)
#define re register
#define int ll
#define file(a) ... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
#define ll long long
#define REP(a, b, c) for (int a = b; a <= c; a++)
#define re register
#define int ll
#define file(a) ... | [
"call.function.change",
"call.arguments.change"
] | 995,225 | 995,226 | u159004243 | cpp |
p03201 | #include <bits/stdc++.h>
#define fo(i, a, b) for (int i = a; i <= b; i++)
#define fd(i, a, b) for (int i = a; i >= b; i--)
using namespace std;
typedef long long LL;
const int maxn = 2e5 + 5, maxw = 35;
int n;
multiset<int> v[maxw];
map<int, int> er;
int lowbit(int x) { return x & (-x); }
int find(int x) { fd(i, 3... | #include <bits/stdc++.h>
#define fo(i, a, b) for (int i = a; i <= b; i++)
#define fd(i, a, b) for (int i = a; i >= b; i--)
using namespace std;
typedef long long LL;
const int maxn = 2e5 + 5, maxw = 35;
int n;
multiset<int> v[maxw];
map<int, int> er;
int lowbit(int x) { return x & (-x); }
int find(int x) { fd(i, 3... | [
"control_flow.branch.if.condition.change"
] | 995,227 | 995,228 | u527820217 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int n, ans = 0;
cin >> n;
vector<int> A(n);
map<int, int> num;
rep(i, n) cin >> A[i], num[A[i]]++;
sort(A.begin(), A.end(), greater<int>());
rep(i, A.size()) {
num[A[i]]--;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int n, ans = 0;
cin >> n;
vector<int> A(n);
map<int, int> num;
rep(i, n) cin >> A[i], num[A[i]]++;
sort(A.begin(), A.end(), greater<int>());
rep(i, A.size()) {
num[A[i]]--;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 995,231 | 995,232 | u441296840 | cpp |
p03201 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#if !ONLINE_JUDGE
#define debug
#endif
using namespace std;
/******* All Required define Pre-Processors and typedef Constants *******/... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#if !ONLINE_JUDGE
#define debug
#endif
using namespace std;
/******* All Required define Pre-Processors and typedef Constants *******/... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.change"
] | 995,233 | 995,234 | u307717225 | cpp |
p03201 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#include <unordered_map>
#include <vector>
using namespace std;
#define COUT(x) cout << #x << " = " << (x) << " (L"... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#include <unordered_map>
#include <vector>
using namespace std;
#define COUT(x) cout << #x << " = " << (x) << " (L"... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 995,235 | 995,236 | u328294851 | cpp |
p03201 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#include <unordered_map>
#include <vector>
using namespace std;
#define COUT(x) cout << #x << " = " << (x) << " (L"... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#include <unordered_map>
#include <vector>
using namespace std;
#define COUT(x) cout << #x << " = " << (x) << " (L"... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 995,237 | 995,236 | u328294851 | cpp |
p03201 | #include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) for (int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
#define int long long
using namespace std;
template <typename X, typename T> auto vectors(X x, T a) {... | #include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) for (int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
#define int long long
using namespace std;
template <typename X, typename T> auto vectors(X x, T a) {... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 995,238 | 995,239 | u526532903 | cpp |
p03201 | // AGC029 B
#include <iostream>
#include <set>
using namespace std;
int main() {
int N;
cin >> N;
multiset<int> A;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
A.insert(a);
}
int ret = 0;
while (!A.empty()) {
auto it = A.end();
it--;
int val = *it;
A.erase(it);
int tm... | // AGC029 B
#include <iostream>
#include <set>
using namespace std;
signed main() {
int N;
cin >> N;
multiset<int> A;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
A.insert(a);
}
int ret = 0;
while (!A.empty()) {
auto it = A.end();
it--;
int val = *it;
A.erase(it);
int... | [
"variable_declaration.type.primitive.change",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 995,240 | 995,241 | u853132965 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define REP(i, a, n) for (int i = a; i < n; ++i)
#define REPR(i, a, n) for (int i = a; i > n; --i)
#define RUP(a, b) ((a + b - 1) / (b))
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
#define mp make_pair
#define mt make_... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define REP(i, a, n) for (int i = a; i < n; ++i)
#define REPR(i, a, n) for (int i = a; i > n; --i)
#define RUP(a, b) ((a + b - 1) / (b))
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
#define mp make_pair
#define mt make_... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 995,251 | 995,252 | u635484372 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) REP(i, 0, n)
const ll ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) REP(i, 0, n)
const ll ... | [] | 995,255 | 995,256 | u592686932 | cpp |
p03201 | #include <algorithm>
#include <iostream>
#include <unordered_set>
#include <vector>
using namespace std;
uint32_t ceil2(uint32_t a) {
uint32_t b = 1;
while (a > b) {
b <<= 1;
}
return b;
}
int main() {
int N;
cin >> N;
unordered_multiset<int> S;
vector<int> A(N);
for (auto &&a : A) {
cin >... | #include <algorithm>
#include <iostream>
#include <unordered_set>
#include <vector>
using namespace std;
uint32_t ceil2(uint32_t a) {
uint32_t b = 1;
while (a >= b) {
b <<= 1;
}
return b;
}
int main() {
int N;
cin >> N;
unordered_multiset<int> S;
vector<int> A(N);
for (auto &&a : A) {
cin ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 995,257 | 995,258 | u606045429 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
int n;
cin >> n;
multiset<int> m;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
m.insert(a);
}
int ans = 0;
while (m.size() > 0) {
int cand = *m.rbegin();
m.erase(m.find(cand));
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
int n;
cin >> n;
multiset<int> m;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
m.insert(a);
}
int ans = 0;
while (m.size() > 0) {
int cand = *m.rbegin();
m.erase(m.find(cand));
... | [
"call.function.change"
] | 995,261 | 995,262 | u410878763 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
multiset<ll> s;
for (int i = 0; i < n; i++) {
ll a;
cin >> a;
s.insert(a);
}
int ans = 0;
while (!s.empty()) {
ll cand = *(s.rbegin());
ll x = 1;
while (x < cand) {
x *= 2;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
multiset<ll> s;
for (int i = 0; i < n; i++) {
ll a;
cin >> a;
s.insert(a);
}
int ans = 0;
while (!s.empty()) {
ll cand = *(s.rbegin());
ll x = 1;
while (x <= cand) {
x *= 2;
... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"call.function.change"
] | 995,263 | 995,264 | u410878763 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void del(map<ll, ll> &mp, ll val) {
mp[val]--;
if (mp[val] == 0) {
mp.erase(val);
}
}
int main() {
ll N;
cin >> N;
map<ll, ll> mp;
ll ans = 0;
vector<ll> A(N);
for (ll i = 0; i < N; i++) {
cin >> A[i];
mp[-A[i]]++;
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void del(map<ll, ll> &mp, ll val) {
mp[val]--;
if (mp[val] == 0) {
mp.erase(val);
}
}
int main() {
ll N;
cin >> N;
map<ll, ll> mp;
ll ans = 0;
vector<ll> A(N);
for (ll i = 0; i < N; i++) {
cin >> A[i];
mp[-A[i]]++;
}
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add",
"expression.operation.binary.remove"
] | 995,265 | 995,266 | u904123392 | cpp |
p03201 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const ll mo = 1000000007;
const ll INF = 1LL << 59; // MAX 9223372036854775807
ll ans = 0;
int main() {
ll n;
cin >> n;
multiset<ll> s;
ll ma = 0;
rep(i, n) {
ll a;
// cin >> a;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const ll mo = 1000000007;
const ll INF = 1LL << 59; // MAX 9223372036854775807
ll ans = 0;
int main() {
ll n;
cin >> n;
multiset<ll> s;
ll ma = 0;
rep(i, n) {
ll a;
cin >> a;
ma ... | [
"assignment.change"
] | 995,275 | 995,276 | u419307948 | cpp |
p03201 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
using namespace std;
int main(void) {
multiset<long, greater<long>> ball;
size_t n;
cin >> n;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
ball.insert(x);
}
int ans = 0;
while (!ball.empty()) {
int x = *ball.begin(... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
using namespace std;
int main(void) {
multiset<long, greater<long>> ball;
size_t n;
cin >> n;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
ball.insert(x);
}
int ans = 0;
while (!ball.empty()) {
int x = *ball.begin(... | [
"call.arguments.change",
"call.add"
] | 995,277 | 995,278 | u720483676 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.