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 |
|---|---|---|---|---|---|---|---|
p03050 | #include <bits/stdc++.h>
using namespace std;
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
long long x, y, z, n, p, ans;
x = y = z = p = ans = 0;
cin >> n;
for (long long i = 2; i * i < n; i++) {
if (n % i == 0) {
x = n / i;
if (n / (i - 1) == n % (i - 1))
ans += i ... | #include <bits/stdc++.h>
using namespace std;
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
long long x, y, z, n, p, ans;
x = y = z = p = ans = 0;
cin >> n;
for (long long i = 2; i * i < n; i++) {
if (n % i == 0) {
x = n / i;
if (n / (i - 1) == n % (i - 1))
ans += i ... | [
"control_flow.branch.if.add"
] | 867,643 | 867,644 | u532894762 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll N;
cin >> N;
ll ans = 0;
for (ll i = 1; i * i <= N; i++) {
if (N % i == 0) {
ll q = i;
ll m1 = N / q;
if (q < m1) {
// cout << q << " " << m1 <<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll N;
cin >> N;
ll ans = 0;
for (ll i = 1; i * i <= N; i++) {
if (N % i == 0) {
ll q = i;
ll m1 = N / q;
if (q < m1 - 1) {
// cout << q << " " << m... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 867,645 | 867,646 | u833150479 | cpp |
p03050 | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll N, ans = 0;
cin >> N;
for (ll i = 0; i * i < N; i++) {
if (N % i == 0) {
continue;
}
ll t = N / i;
t--;
if (i < N) {
ans += t;
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll N, ans = 0;
cin >> N;
for (ll i = 1; i * i <= N; i++) {
if (N % i != 0) {
continue;
}
ll t = N / i;
t--;
if (i < t) {
ans += t;
}
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"misc.opposites",
"control_flow.branch.if.condition... | 867,668 | 867,669 | u946378574 | cpp |
p03050 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef pair<long long int, long long int> P;
long long int INF = 1e18;
long long int MOD = 1e9 + 7;
int... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef pair<long long int, long long int> P;
long long int INF = 1e18;
long long int MOD = 1e9 + 7;
int... | [
"control_flow.loop.for.condition.change"
] | 867,672 | 867,673 | u997521090 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N;
cin >> N;
long long int answer = 0;
for (long long int i = 1;; i++) {
if (N / i <= i) {
break;
}
if ((N - i) % i == 0) {
answer += (N - i) / i;
}
}
cout << answer << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N;
cin >> N;
long long int answer = 0;
for (long long int i = 1;; i++) {
// これや
if ((N - i) / i <= i) {
break;
}
if ((N - i) % i == 0) {
answer += (N - i) / i;
}
}
cout << answer << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 867,681 | 867,682 | u412989489 | cpp |
p03050 | #include "bits/stdc++.h"
using namespace std;
void solve(void) {
long n;
cin >> n;
long ans = 0;
for (long i = 1; i * i + i <= n; i++) {
long m = (n - i) / i;
if (i * m + i == n) {
ans += m;
}
}
cout << ans << endl;
}
int main() {
solve();
// cout << "yui(*-v・)yui" << endl;
return... | #include "bits/stdc++.h"
using namespace std;
void solve(void) {
long n;
cin >> n;
long ans = 0;
for (long i = 1; i * i + i <= n; i++) {
long m = (n - i) / i;
if (i < m && i * m + i == n) {
ans += m;
}
}
cout << ans << endl;
}
int main() {
solve();
// cout << "yui(*-v・)yui" << endl;... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 867,683 | 867,684 | u344412812 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
typedef long long int ll;
#define EPS (1e-7)
#define INF ... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
typedef long long int ll;
#define EPS (1e-7)
#define INF ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 867,687 | 867,688 | u551351897 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int main() {
long long N;
cin >> N;
long long ans =... | #include <bits/stdc++.h>
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int main() {
long long N;
cin >> N;
long long ans =... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 867,689 | 867,690 | u883982500 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int main() {
long long N;
cin >> N;
long long ans =... | #include <bits/stdc++.h>
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int main() {
long long N;
cin >> N;
long long ans =... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"misc.off_by_one"
] | 867,691 | 867,690 | u883982500 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
int main() {
LL N;
cin >> N;
LL ans = 0;
for (LL i = 1; i * i < N; i++) {
if (N % i == 0) {
LL m = N / i - 1;
LL p = i;
ans += m;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
int main() {
LL N;
cin >> N;
LL ans = 0;
for (LL i = 1; i * i < N; i++) {
if (N % i == 0) {
LL m = N / i - 1;
LL p = i;
if (m > p)
ans += m;
}
}
cout << ans << endl;
} | [
"control_flow.branch.if.add"
] | 867,692 | 867,693 | u510175787 | cpp |
p03050 | #include <iostream>
int main() {
long long N;
std::cin >> N;
long long ans = 0;
for (long long i = 1; i * i < N; ++i) {
if (N % i == 0) {
ans += N / i - 1;
}
}
std::cout << ans << "\n";
return 0;
}
| #include <iostream>
int main() {
long long N;
std::cin >> N;
long long ans = 0;
for (long long i = 1; i * (i + 1) < N; ++i) {
if (N % i == 0) {
ans += N / i - 1;
}
}
std::cout << ans << "\n";
return 0;
}
| [
"control_flow.loop.for.condition.change"
] | 867,699 | 867,700 | u982753571 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll N;
scanf("%lld", &N);
ll res = 0;
for (ll p = 1; p * p < N; p++) {
ll m = N / p - 1;
ll r = N % p;
if (r == 0) {
res += m;
}
}
printf("%lld\n", res);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll N;
scanf("%lld", &N);
ll res = 0;
for (ll p = 1; p * p < N; p++) {
ll m = N / p - 1;
ll r = N % p;
if (p < m && r == 0) {
res += m;
}
}
printf("%lld\n", res);
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 867,707 | 867,708 | u697421413 | cpp |
p03050 | #include <algorithm>
#include <climits>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define MAX 1000000007
using namespace std;
#define ll long long
#define dbg if (0)
#define ISRANGE(val, lo, hi) ((lo <= val) && (val < hi))
// nanndeya
int main() {
ll ans, n;
cin >> n;
// for(int ... | #include <algorithm>
#include <climits>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define MAX 1000000007
using namespace std;
#define ll long long
#define dbg if (0)
#define ISRANGE(val, lo, hi) ((lo <= val) && (val < hi))
/*
変数宣言
作詞 Ry0um4
唄 任意のユーザー
歌詞：
お前がコードを貼り付ける前に 言っておきたい事がある
かなり厳しい話も... | [
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 867,716 | 867,717 | u828752458 | cpp |
p03050 | #include <algorithm>
#include <climits>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define MAX 1000000007
using namespace std;
#define ll long long
#define dbg if (0)
#define ISRANGE(val, lo, hi) ((lo <= val) && (val < hi))
int main() {
ll ans, n;
cin >> n;
// for(int debug=1;debug<1... | #include <algorithm>
#include <climits>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define MAX 1000000007
using namespace std;
#define ll long long
#define dbg if (0)
#define ISRANGE(val, lo, hi) ((lo <= val) && (val < hi))
/*
変数宣言
作詞 Ry0um4
唄 任意のユーザー
歌詞：
お前がコードを貼り付ける前に 言っておきたい事がある
かなり厳しい話も... | [
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 867,718 | 867,717 | u828752458 | cpp |
p03050 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, p, n) for (int i = p; i < n; ++i)
#define rep(... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, p, n) for (int i = p; i < n; ++i)
#define rep(... | [
"control_flow.loop.for.condition.change"
] | 867,719 | 867,720 | u039041830 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
int main() {
uint64_t n;
cin >> n;
uint64_t ret = 0;
for (uint64_t i = 1; i <= sqrt(n) + 1; ++i) {
if (n % i == 0) {
if (i <= (n / i - 1)) {
ret += (n / i - 1);
}
}
}
cout << ret << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
uint64_t n;
cin >> n;
uint64_t ret = 0;
for (uint64_t i = 1; i <= sqrt(n) + 1; ++i) {
if (n % i == 0) {
if (i < (n / i - 1)) {
ret += (n / i - 1);
}
}
}
cout << ret << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 867,721 | 867,722 | u627431737 | cpp |
p03050 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
vector<ll> vec;
int main() {
ll n;
cin >> n;
ll cnt = 0;
for (ll i = 1; i * i < n; i++) {
if (n % i == 0)
cnt += n / i - 1;
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
vector<ll> vec;
int main() {
ll n;
cin >> n;
ll cnt = 0;
for (ll i = 1; i < n / i - 1; i++) {
if (n % i == 0)
cnt += n / i - 1;
}
cout << cnt << endl;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 867,725 | 867,726 | u620866522 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long ans = 0;
long long mx = sqrt(N);
for (long long x = 1; x < mx; x++) {
if (N % x == 0 && N / x - 1 > x)
ans += N / x - 1;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long ans = 0;
long long mx = sqrt(N);
for (long long x = 1; x < mx + 1; x++) {
if (N % x == 0 && N / x - 1 > x)
ans += N / x - 1;
}
cout << ans << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 867,732 | 867,733 | u475503988 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
int main() {
#ifdef DEBUG
std::ifstream in("/home/share/inputf.in");
std::cin.rdbuf(in.rdbuf());
#endif
int64_t N, ans = 0;
cin >> N;
for (int64_t k = 1; k * k < N; k++) {
if (N % k == 0) {
ans += N / k - 1;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
#ifdef DEBUG
std::ifstream in("/home/share/inputf.in");
std::cin.rdbuf(in.rdbuf());
#endif
int64_t N, ans = 0;
cin >> N;
for (int64_t k = 1; k * (k + 1) < N; k++) {
if (N % k == 0) {
ans += N / k - 1;
}
}
cout << ans << endl;
retur... | [
"control_flow.loop.for.condition.change"
] | 867,734 | 867,735 | u936555566 | cpp |
p03050 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll tot = 0;
for (ll i = 2; n >= i * i; i++) {
if (n % i == 0) {
ll m = n / i;
if (m - 1 > i) {
tot += m - 1;
}
if (i - 1 > m) {
tot += i... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll tot = 0;
for (ll i = 1; n >= i * i; i++) {
if (n % i == 0) {
ll m = n / i;
if (m - 1 > i) {
tot += m - 1;
}
if (i - 1 > m) {
tot += i... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 867,748 | 867,749 | u337054478 | cpp |
p03050 | /*
ll used[10];
ll maxi;
ll dfs(Graph& graph, ll v, ll deep) {
used[v] = 1;
vector<ll> maxd;
maxd.push_back(deep);
for (int i = 0; i < graph[v].size(); i++) {
if (used[graph[v][i].to] == 0) {
maxd.push_back(dfs(graph, graph[v][i].to, deep + 1));
... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#defin... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 867,752 | 867,753 | u051493691 | cpp |
p03050 | /*
ll used[10];
ll maxi;
ll dfs(Graph& graph, ll v, ll deep) {
used[v] = 1;
vector<ll> maxd;
maxd.push_back(deep);
for (int i = 0; i < graph[v].size(); i++) {
if (used[graph[v][i].to] == 0) {
maxd.push_back(dfs(graph, graph[v][i].to, deep + 1));
... | /*
ll used[10];
ll maxi;
ll dfs(Graph& graph, ll v, ll deep) {
used[v] = 1;
vector<ll> maxd;
maxd.push_back(deep);
for (int i = 0; i < graph[v].size(); i++) {
if (used[graph[v][i].to] == 0) {
maxd.push_back(dfs(graph, graph[v][i].to, deep + 1));
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 867,752 | 867,754 | u051493691 | cpp |
p03050 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#inc... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#inc... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 867,759 | 867,760 | u049420296 | cpp |
p03050 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(j, n) for (int j = 0; j < (n); ++j)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define drep2(j, n) for (int j = (n)-1; j >= 0; --j)
#define ... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(j, n) for (int j = 0; j < (n); ++j)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define drep2(j, n) for (int j = (n)-1; j >= 0; --j)
#define ... | [
"call.remove"
] | 867,769 | 867,770 | u340293807 | cpp |
p03050 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
long long N;
cin >> N;
long long ans = 0;
for (long long i = 1; i * i < N; ++i) {
if ((N - i) % i == 0) {
ans += (N - i) / i;
}
}
cout ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
long long N;
cin >> N;
long long ans = 0;
for (long long i = 1; i * i + i < N; ++i) {
if ((N - i) % i == 0) {
ans += (N - i) / i;
}
}
c... | [
"control_flow.loop.for.condition.change"
] | 867,786 | 867,787 | u493610446 | cpp |
p03050 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define FOR(k, m, n) for (ll(k) = (m); (k) < (n); (k)++)
#define REP(i, n) FOR((i), 0, (n))
#define WAITING(str) \... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define FOR(k, m, n) for (ll(k) = (m); (k) < (n); (k)++)
#define REP(i, n) FOR((i), 0, (n))
#define WAITING(str) \... | [
"control_flow.branch.if.condition.change"
] | 867,793 | 867,794 | u692632484 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<LL, LL> P;
const LL mod = 1000000007;
const LL LINF = 1LL << 60;
co... | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<LL, LL> P;
const LL mod = 1000000007;
const LL LINF = 1LL << 60;
co... | [
"expression.operation.binary.remove"
] | 867,801 | 867,802 | u640323045 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll N;
vector<ll> dvs;
void divisor(ll n) {
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
dvs.push_back(i);
if (i != n / i) {
dvs.push_back(n / i);
}
}
}
}
void solve() {
divisor(N);
sort(dvs.begin(), d... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll N;
vector<ll> dvs;
void divisor(ll n) {
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
dvs.push_back(i);
if (i != n / i) {
dvs.push_back(n / i);
}
}
}
}
void solve() {
divisor(N);
sort(dvs.begin(), d... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 867,803 | 867,804 | u319242216 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll N;
vector<ll> dvs;
void divisor(ll n) {
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
dvs.push_back(i);
if (i != n / i) {
dvs.push_back(n / i);
}
}
}
}
void solve() {
divisor(N);
sort(dvs.begin(), d... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll N;
vector<ll> dvs;
void divisor(ll n) {
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
dvs.push_back(i);
if (i != n / i) {
dvs.push_back(n / i);
}
}
}
}
void solve() {
divisor(N);
sort(dvs.begin(), d... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 867,805 | 867,804 | u319242216 | cpp |
p03050 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | [
"control_flow.branch.if.condition.change"
] | 867,808 | 867,809 | u900727536 | cpp |
p03050 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 867,810 | 867,809 | u900727536 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {... | [
"control_flow.branch.if.condition.change"
] | 867,811 | 867,812 | u666394517 | cpp |
p03050 | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long int ll;
#define repi(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, a) repi(i, 0, a)
#define rrep(i, a) for (ll i = a - 1; i >= 0; i--)
int main() {
ll N;
c... | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long int ll;
#define repi(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, a) repi(i, 0, a)
#define rrep(i, a) for (ll i = a - 1; i >= 0; i--)
int main() {
ll N;
c... | [
"control_flow.loop.for.condition.change"
] | 867,817 | 867,818 | u336721073 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define MIN(a) *min_element(all(a))
#define MAX(a) *max_element(all(a))
#define SUM(a, b) accumulate(all(a), b)
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define RREP(i, n) for (int(i... | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define MIN(a) *min_element(all(a))
#define MAX(a) *max_element(all(a))
#define SUM(a, b) accumulate(all(a), b)
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define RREP(i, n) for (int(i... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 867,819 | 867,820 | u994831328 | cpp |
p03050 | #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
// iteration helper
#define FOR(i, l, r) for (int i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define RREP(i, n) RFOR(i, 0, n)
#define EACH(i, c) ... | #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
// iteration helper
#define FOR(i, l, r) for (int i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define RREP(i, n) RFOR(i, 0, n)
#define EACH(i, c) ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 867,821 | 867,822 | u820612421 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
vector<i64> divisor(i64 n) {
vector<i64> res;
for (i64 i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i)
res.push_back(n / i);
}
}
return res;
}
int main() {
i64 n;
cin >> n;
auto ... | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
vector<i64> divisor(i64 n) {
vector<i64> res;
for (i64 i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i)
res.push_back(n / i);
}
}
return res;
}
int main() {
i64 n;
cin >> n;
auto ... | [
"control_flow.branch.if.condition.change"
] | 867,823 | 867,824 | u823112986 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long n, ans = 0;
cin >> n;
for (long long i = 1; i < n; ++i) {
if (n / i < i + 1) {
break;
}
if ((n - i) % i == 0)
ans += (n - i) / i;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long n, ans = 0;
cin >> n;
for (long long i = 1; i < n; ++i) {
if ((n - i) / i < i + 1) {
break;
}
if ((n - i) % i == 0)
ans += (n - i) / i;
}
cout << ans << endl;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 867,825 | 867,826 | u314988220 | cpp |
p03050 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iterator>
#include <map>
#include <queue>
#include <vector>
using namespace std;
long long n;
long long sum;
int main() {
sum = 0;
scanf("%I64d", &n);
long long d = 1;
long long dx;
while (d * d < n) //平方... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iterator>
#include <map>
#include <queue>
#include <vector>
using namespace std;
long long n;
long long sum;
int main() {
sum = 0;
scanf("%lld", &n);
long long d = 1;
long long dx;
while (d * d < n) //平方数... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 867,827 | 867,828 | u127473726 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
void solve() {
ll n, ret = 0;
cin >> n;
set<ll> s;
for (ll i = 1; i * i <= n; ++i) {
if (n % i == n / i) {
// ret += i;
s.insert(i);
}
}
ll g = 0, u = 0;
ll v = 0;
for (ll i = 1; i * i <= n; ++i) {
ll y = n / i;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
void solve() {
ll n, ret = 0;
cin >> n;
set<ll> s;
for (ll i = 1; i * i <= n * 2; ++i) {
if (n % i == n / i) {
// ret += i;
s.insert(i);
}
}
ll g = 0, u = 0;
ll v = 0;
for (ll i = 1; i * i <= n; ++i) {
ll y = n /... | [
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 867,831 | 867,832 | u651636556 | cpp |
p03050 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#includ... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 867,837 | 867,838 | u630941334 | cpp |
p03050 | #pragma GCC optimize("O3")
#include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
#include "ext/rope"
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
typedef long long ll;
typedef pair<int, int> pii;
#define FOR(i, a, b) for (int i = (a); i ... | #pragma GCC optimize("O3")
#include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
#include "ext/rope"
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
typedef long long ll;
typedef pair<int, int> pii;
#define FOR(i, a, b) for (int i = (a); i ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 867,845 | 867,846 | u712630284 | cpp |
p03050 | #pragma GCC optimize("O3")
#include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
#include "ext/rope"
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
typedef long long ll;
typedef pair<int, int> pii;
#define FOR(i, a, b) for (int i = (a); i ... | #pragma GCC optimize("O3")
#include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
#include "ext/rope"
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
typedef long long ll;
typedef pair<int, int> pii;
#define FOR(i, a, b) for (int i = (a); i ... | [
"control_flow.branch.if.condition.change"
] | 867,847 | 867,846 | u712630284 | cpp |
p03050 | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2,fma")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#define f first
#define s second
#define inf 999999999999
#define N 500009
#define M... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2,fma")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#define f first
#define s second
#define inf 999999999999
#define N 500009
#define M... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 867,852 | 867,853 | u866987395 | cpp |
p03050 | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2,fma")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#define f first
#define s second
#define inf 999999999999
#define N 500009
#define M... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2,fma")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#define f first
#define s second
#define inf 999999999999
#define N 500009
#define M... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 867,854 | 867,853 | u866987395 | cpp |
p03049 | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using na... | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using na... | [
"control_flow.branch.if.condition.change"
] | 867,855 | 867,856 | u925940521 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1e9;
const int MOD = 1e9 + 7;
// 4近傍、8近傍
int dx[] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
int main() {
int N;
cin >> N;
string s;
ll ans = 0;
ll same = 0;
ll aonly... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1e9;
const int MOD = 1e9 + 7;
// 4近傍、8近傍
int dx[] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
int main() {
int N;
cin >> N;
string s;
ll ans = 0;
ll same = 0;
ll aonly... | [
"control_flow.branch.if.add"
] | 867,857 | 867,858 | u063020782 | cpp |
p03049 | #include <bits/stdc++.h>
#define Rint register int
using namespace std;
char s[10004][11];
int n, ans, tmp, c1, c2, c3, len[10004];
int main() {
scanf("%d", &n);
for (Rint i = 1; i <= n; i++)
scanf("%s", s + i), len[i] = strlen(s[i]);
for (Rint i = 1; i <= n; i++)
for (Rint j = 0; j < len[i] - 1; j++)
... | #include <bits/stdc++.h>
#define Rint register int
using namespace std;
char s[10004][11];
int n, ans, tmp, c1, c2, c3, len[10004];
int main() {
scanf("%d", &n);
for (Rint i = 1; i <= n; i++)
scanf("%s", s + i), len[i] = strlen(s[i]);
for (Rint i = 1; i <= n; i++)
for (Rint j = 0; j < len[i] - 1; j++)
... | [
"assignment.change"
] | 867,861 | 867,862 | u680164084 | cpp |
p03049 | #include <bits/stdc++.h>
#define foreach(i, v) \
for (__typeof((v).begin()) i = (v).begin(); i != (v).end(); ++i)
#define BETWEEN(a, x, b) (a <= x && x < b)
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
ios::sync_with_stdio(... | #include <bits/stdc++.h>
#define foreach(i, v) \
for (__typeof((v).begin()) i = (v).begin(); i != (v).end(); ++i)
#define BETWEEN(a, x, b) (a <= x && x < b)
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
ios::sync_with_stdio(... | [
"variable_declaration.type.change",
"control_flow.branch.if.condition.change"
] | 867,863 | 867,864 | u440032761 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
string tmp;
int midab = 0, aend = 0, bstart = 0, baside = 0;
for (int i = 0; i < N; i++) {
cin >> tmp;
if (tmp[0] == 'B' && tmp[tmp.size() - 1] == 'A')
baside++;
else {
if (tmp[0] == 'B'... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
string tmp;
int midab = 0, aend = 0, bstart = 0, baside = 0;
for (int i = 0; i < N; i++) {
cin >> tmp;
if (tmp[0] == 'B' && tmp[tmp.size() - 1] == 'A')
baside++;
else {
if (tmp[0] == 'B'... | [
"control_flow.branch.if.condition.change"
] | 867,865 | 867,866 | u854831509 | cpp |
p03049 | #define _CRT_SECURE_NO_WARNINGS
/* include ***********************/
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/* define *************************/
// for
#define REP(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define REPS(i, n) for (int i = 1, i##_len = (int)(n); i ... | #define _CRT_SECURE_NO_WARNINGS
/* include ***********************/
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/* define *************************/
// for
#define REP(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define REPS(i, n) for (int i = 1, i##_len = (int)(n); i ... | [
"control_flow.branch.if.condition.change"
] | 867,869 | 867,870 | u539339654 | cpp |
p03049 | #include <algorithm>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
int ae = 0, bs = 0, ct = 0, both = 0;
for (int i = 0; i < n; i++) {
string tmp;
cin >> tmp;
if (tmp[0] == '... | #include <algorithm>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
int ae = 0, bs = 0, ct = 0, both = 0;
for (int i = 0; i < n; i++) {
string tmp;
cin >> tmp;
if (tmp[0] == '... | [
"control_flow.branch.if.condition.change"
] | 867,871 | 867,872 | u553807330 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, sum = 0, a = 1;
int an = 0, bn = 0;
cin >> N;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
for (int j = 0; j < s.size() - 1; j++) {
if (s.at(j) == 'A' && s.at(j + 1) == 'B') {
sum++;
}
}
if (s.at(0) =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, sum = 0, a = 1;
int an = 0, bn = 0;
cin >> N;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
for (int j = 0; j < s.size() - 1; j++) {
if (s.at(j) == 'A' && s.at(j + 1) == 'B') {
sum++;
}
}
if (s.at(0) =... | [
"expression.operation.binary.remove",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 867,873 | 867,874 | u501008235 | cpp |
p03049 | #include <bits/stdc++.h>
const int INF = 1e9, MOD = 1e9 + 7;
const long long LINF = 1e18;
using namespace std;
#define int long long
// template
// main
signed main() {
int N;
cin >> N;
std::vector<string> s(N);
for (int i = 0; i < N; i++)
cin >> s[i];
int ans = 0;
for (int i = 0; i < N; i++) {
for... | #include <bits/stdc++.h>
const int INF = 1e9, MOD = 1e9 + 7;
const long long LINF = 1e18;
using namespace std;
#define int long long
// template
// main
signed main() {
int N;
cin >> N;
std::vector<string> s(N);
for (int i = 0; i < N; i++)
cin >> s[i];
int ans = 0;
for (int i = 0; i < N; i++) {
for... | [
"call.add",
"call.arguments.change"
] | 867,892 | 867,893 | u942774736 | cpp |
p03049 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
int a = 0, b = 0, count = 0, t = 0;
for (int i = 0; i < n; i++) {
int k = s[i].size();
if (s[i].at(0) == 'B')
b++;
if (s[i].at(k - 1)... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
int a = 0, b = 0, count = 0, t = 0;
for (int i = 0; i < n; i++) {
int k = s[i].size();
if (s[i].at(0) == 'B')
b++;
if (s[i].at(k - 1)... | [
"control_flow.branch.if.condition.change"
] | 867,894 | 867,895 | u179970156 | cpp |
p03049 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s[i];
}
int ans = 0, cnta = 0, cntb = 0, cntab = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < s[i].siz... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s[i];
}
int ans = 0, cnta = 0, cntb = 0, cntab = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < s[i].siz... | [] | 867,898 | 867,899 | u167161639 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j, c = 0, a = 0, b = 0, d = 0;
string s;
cin >> n;
for (i = 0; i < n; i++) {
cin >> s;
for (j = 0; j < s.length() - 1; j++) {
if (s[j] == 'A' && s[j + 1] == 'B') {
c++;
}
}
if (s[0] == 'B')
b++;
i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j, c = 0, a = 0, b = 0, d = 0;
string s;
cin >> n;
for (i = 0; i < n; i++) {
cin >> s;
for (j = 0; j < s.length() - 1; j++) {
if (s[j] == 'A' && s[j + 1] == 'B') {
c++;
}
}
if (s[0] == 'B')
b++;
i... | [
"control_flow.branch.if.condition.change"
] | 867,903 | 867,904 | u058348416 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
long long n, ans = 0, a = 0, b = 0, c = 0, A, B;
string s[200000];
cin >> n;
rep(i, n) cin >> s[i];
rep(i, n) rep(j, s[i].size() - 1) if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ans++;
rep(i, n) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
long long n, ans = 0, a = 0, b = 0, c = 0, A, B;
string s[200000];
cin >> n;
rep(i, n) cin >> s[i];
rep(i, n) rep(j, s[i].size() - 1) if (s[i][j] == 'A' && s[i][j + 1] == 'B')
ans++;
rep(i, n) {
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 867,905 | 867,906 | u441296840 | cpp |
p03049 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#inc... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#inc... | [] | 867,911 | 867,912 | u391331433 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n;
int A = 0, B = 0, AB = 0, ans = 0;
for (int i = 0; i < n; i++) {
cin >> s;
for (int j = 1; j < s.size(); j++) {
if (s[j - 1] == 'A' && s[j] == 'B') {
ans++;
}
}
if (s[0] == 'B' && s[s.s... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n;
int A = 0, B = 0, AB = 0, ans = 0;
for (int i = 0; i < n; i++) {
cin >> s;
for (int j = 1; j < s.size(); j++) {
if (s[j - 1] == 'A' && s[j] == 'B') {
ans++;
}
}
if (s[0] == 'B' && s[s.s... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 867,913 | 867,914 | u905270643 | cpp |
p03049 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#ifdef _DEBUG
#define DMP(x) cerr << #x << ": " << x << "\n"
#else
#define DMP(x) ((void)0)
#endif
const int MOD = 1000000007, INF = 1111111111;
using name... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#ifdef _DEBUG
#define DMP(x) cerr << #x << ": " << x << "\n"
#else
#define DMP(x) ((void)0)
#endif
const int MOD = 1000000007, INF = 1111111111;
using name... | [
"call.add",
"call.arguments.add"
] | 867,915 | 867,916 | u532573979 | cpp |
p03049 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
string S[N];
for (int i = 0; i < N; i++) {
cin >> S[i];
}
int ans = 0, A = 0, B = 0, AB = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j + 1 < (int)S[i... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
string S[N];
for (int i = 0; i < N; i++) {
cin >> S[i];
}
int ans = 0, A = 0, B = 0, AB = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j + 1 < (int)S[i... | [
"control_flow.branch.if.condition.change"
] | 867,919 | 867,920 | u650243369 | cpp |
p03049 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s[i];
}
int ans = 0;
int cntA = 0;
int cntB = 0;
int same = 0;
for (... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) {
cin >> s[i];
}
int ans = 0;
int cntA = 0;
int cntB = 0;
int same = 0;
for (... | [
"control_flow.branch.if.condition.change"
] | 867,921 | 867,922 | u048945791 | cpp |
p03049 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define FOR(x, to) for (x = 0; x < (to); x++)
int main() {
int N, i, k;
vector<string> s;
cin >> N;
s.resize(N);
FOR(i, N)
cin >> s[i];
int count = 0, acount = 0, bcount = 0, abcount = 0;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define FOR(x, to) for (x = 0; x < (to); x++)
int main() {
int N, i, k;
vector<string> s;
cin >> N;
s.resize(N);
FOR(i, N)
cin >> s[i];
int count = 0, acount = 0, bcount = 0, abcount = 0;
... | [
"control_flow.branch.if.condition.change"
] | 867,923 | 867,924 | u225891650 | cpp |
p03049 | #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 <list>
#include <map>
#include <queue>
#include <random>
#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 <list>
#include <map>
#include <queue>
#include <random>
#include ... | [
"control_flow.branch.if.condition.change"
] | 867,925 | 867,926 | u111434987 | cpp |
p03049 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
ll a = 0, b = 0... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
ll a = 0, b = 0... | [
"control_flow.branch.if.condition.change"
] | 867,937 | 867,938 | u012298376 | cpp |
p03049 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
string str;
int count = 0;
int count_b_a = 0;
int count_start_b = 0;
int count_end_a = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> str;
if (str[0] == 'B' && str[str.len... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
string str;
int count = 0;
int count_b_a = 0;
int count_start_b = 0;
int count_end_a = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> str;
if (str[0] == 'B' && str[str.len... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.change"
] | 867,941 | 867,940 | u137523493 | cpp |
p03049 | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast", "unroll-loops")
#define ll long long
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n - 1); i ... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast", "unroll-loops")
#define ll long long
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n - 1); i ... | [
"control_flow.branch.if.add"
] | 867,944 | 867,945 | u796538370 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string buf;
int num;
cin >> num;
int ans = 0, leftNum = 0, rightNum = 0, tatNum = 0;
for (int i = 0; i < num; i++) {
cin >> buf;
for (int i = 0; i < (int)buf.size() - 1; i++)
i... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string buf;
int num;
cin >> num;
int ans = 0, leftNum = 0, rightNum = 0, tatNum = 0;
for (int i = 0; i < num; i++) {
cin >> buf;
for (int i = 0; i < (int)buf.size() - 1; i++)
i... | [
"call.add",
"call.arguments.change"
] | 867,946 | 867,947 | u567383713 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, a = 0, b = 0, c = 0, t = 0, n, m;
string temp;
cin >> n;
for (i = 0; i < n; i++) {
cin >> temp;
m = temp.size();
for (j = 0; j < m; j++) {
if (temp[j] == 'A' && temp[j + 1] == 'B')
t++;
}
if (temp[0] == 'B') ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, a = 0, b = 0, c = 0, t = 0, n, m;
string temp;
cin >> n;
for (i = 0; i < n; i++) {
cin >> temp;
m = temp.size();
for (j = 0; j < m; j++) {
if (temp[j] == 'A' && temp[j + 1] == 'B')
t++;
}
if (temp[0] == 'B') ... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 867,950 | 867,951 | u565087015 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> v(n);
int cnt = 0;
int cnta = 0;
int cntb = 0;
int cntab = 0;
int cntaa = 0;
int cntbb = 0;
for (int i = 0; i < n; i++)
cin >> v[i];
for (int i = 0; i < n; i++) {
int m = v[i].size() - 1;
for (in... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> v(n);
int cnt = 0;
int cnta = 0;
int cntb = 0;
int cntab = 0;
int cntaa = 0;
int cntbb = 0;
for (int i = 0; i < n; i++)
cin >> v[i];
for (int i = 0; i < n; i++) {
int m = v[i].size() - 1;
for (in... | [
"control_flow.branch.if.add"
] | 867,954 | 867,955 | u521364030 | cpp |
p03049 | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int main() {
int n, ans = 0, ca = 0, cb = 0, score[10000], l, a = 0, b = 0, c = 0;
char s[10000][11];
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%s", s[i]);
l = strlen(s[i]);
if (s[i][0] == 'B') {
b++;
... | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int main() {
int n, ans = 0, ca = 0, cb = 0, score[10000], l, a = 0, b = 0, c = 0;
char s[10000][11];
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%s", s[i]);
l = strlen(s[i]);
if (s[i][0] == 'B') {
b++;
... | [
"control_flow.branch.else.add"
] | 867,956 | 867,957 | u855429581 | cpp |
p03049 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
int main() {
int N;
cin >> N;
int a = 0, b = 0, ab = 0, b_a = 0;
for (int... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
int main() {
int N;
cin >> N;
int a = 0, b = 0, ab = 0, b_a = 0;
for (int... | [
"control_flow.branch.if.condition.change"
] | 867,958 | 867,959 | u297367372 | cpp |
p03049 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define MOD 1000000007
#define f(i, n) for (int i = 0; i < int(n); i++)
#define N 200000
int main() ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define MOD 1000000007
#define f(i, n) for (int i = 0; i < int(n); i++)
#define N 200000
int main() ... | [
"control_flow.branch.if.condition.change"
] | 867,960 | 867,961 | u527748649 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
//#define int long long
using ll = long long;
const int INF = 1 << 29;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#ifdef LOCAL_ENV
#define debug(var) std::cout << #var " = " << var << std::endl
#... | #include <bits/stdc++.h>
using namespace std;
//#define int long long
using ll = long long;
const int INF = 1 << 29;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#ifdef LOCAL_ENV
#define debug(var) std::cout << #var " = " << var << std::endl
#... | [
"control_flow.branch.if.condition.change"
] | 867,964 | 867,965 | u061071198 | cpp |
p03049 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define sqr(x) ((x) * (x))
#define fz1(i, n) for ((i) = 1; (i) <= (n); (i)++)
#define fd... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define sqr(x) ((x) * (x))
#define fz1(i, n) for ((i) = 1; (i) <= (n); (i)++)
#define fd... | [
"expression.operation.binary.remove"
] | 867,975 | 867,976 | u083440680 | cpp |
p03049 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define sqr(x) ((x) * (x))
#define fz1(i, n) for ((i) = 1; (i) <= (n); (i)++)
#define fd... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define sqr(x) ((x) * (x))
#define fz1(i, n) for ((i) = 1; (i) <= (n); (i)++)
#define fd... | [
"call.add",
"call.arguments.change"
] | 867,977 | 867,976 | u083440680 | cpp |
p03049 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define sqr(x) ((x) * (x))
#define fz1(i, n) for ((i) = 1; (i) <= (n); (i)++)
#define fd... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define sqr(x) ((x) * (x))
#define fz1(i, n) for ((i) = 1; (i) <= (n); (i)++)
#define fd... | [
"call.add",
"call.arguments.change",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 867,978 | 867,976 | u083440680 | cpp |
p03049 | // Author:- Yatin Patel
// Mail:- yatinpatel.gt@gmail.com
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define FILEIN \
ifstream fin; \
fin.open("input.txt");
#define ... | // Author:- Yatin Patel
// Mail:- yatinpatel.gt@gmail.com
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define FILEIN \
ifstream fin; \
fin.open("input.txt");
#define ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 867,979 | 867,980 | u646513066 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
#define min(a, b) ((a) < (b) ? (a) : (b))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, n1, n2) for (int i = n1; i < n2; i++)
#define speed_up \
ios_base... | #include <bits/stdc++.h>
using namespace std;
#define min(a, b) ((a) < (b) ? (a) : (b))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, n1, n2) for (int i = n1; i < n2; i++)
#define speed_up \
ios_base... | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 867,987 | 867,988 | u055303078 | cpp |
p03049 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
string s;
int ab = 0, a = 0, b = 0, c = 0;
for (int o = 0; o < n; o++) {
cin >> s;
if (s[0] == 'B' && s[s.size() - 1] == 'A')
c++;
else if (s[0] == 'B')
b++;
else if (s[s.size() - 1] == 'A')
a++;
for... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
string s;
int ab = 0, a = 0, b = 0, c = 0;
for (int o = 0; o < n; o++) {
cin >> s;
if (s[0] == 'B' && s[s.size() - 1] == 'A')
c++;
else if (s[0] == 'B')
b++;
else if (s[s.size() - 1] == 'A')
a++;
for... | [
"call.add",
"call.arguments.change"
] | 867,989 | 867,990 | u535008646 | cpp |
p03049 | // written by NewbieChd
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
const int N = 10003;
char s[N];
int main() {
int n, len, i, a = 0, b = 0, c = 0, ans = 0;
scanf("%d", &n);
while (n--) {
scanf("%s", s + 1), len = strlen(s + 1);
for (i = 1; i <= len; ++i)
if (s[... | // written by NewbieChd
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
const int N = 10003;
char s[N];
int main() {
int n, len, i, a = 0, b = 0, c = 0, ans = 0;
scanf("%d", &n);
while (n--) {
scanf("%s", s + 1), len = strlen(s + 1);
for (i = 1; i <= len; ++i)
if (s[... | [] | 867,997 | 867,998 | u305668100 | cpp |
p03049 | #include <bits/stdc++.h>
#define ARC(i, a, b) for (int i = (a); i < (b); ++i)
#define RC(i, n) ARC(i, 0, n)
#define ARCH(i, a, b) for (int i = (a)-1; i >= (b); --i)
#define RCH(i, n) ARCH(i, n, 0)
template <class T> T ant(const T &a, const T &b) { return a > b ? a : b; }
template <class T> T ont(const T &a, const T &... | #include <bits/stdc++.h>
#define ARC(i, a, b) for (int i = (a); i < (b); ++i)
#define RC(i, n) ARC(i, 0, n)
#define ARCH(i, a, b) for (int i = (a)-1; i >= (b); --i)
#define RCH(i, n) ARCH(i, n, 0)
template <class T> T ant(const T &a, const T &b) { return a > b ? a : b; }
template <class T> T ont(const T &a, const T &... | [
"control_flow.branch.if.add"
] | 868,009 | 868,010 | u826438738 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll inf = numeric_limits<ll>::max() / 3;
const ll mod = 998244353;
int main(void) {
int n;
cin >> n;
int res = 0;
int cnta = 0, cntb = 0, cntba = 0;
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
for (int j = 0; j + 1 < (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll inf = numeric_limits<ll>::max() / 3;
const ll mod = 998244353;
int main(void) {
int n;
cin >> n;
int res = 0;
int cnta = 0, cntb = 0, cntba = 0;
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
for (int j = 0; j + 1 < (... | [
"call.add",
"call.arguments.add"
] | 868,011 | 868,012 | u488078009 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template ... | [
"call.add",
"call.arguments.change"
] | 868,013 | 868,014 | u333917945 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int ans = 0;
int cnt[4] = {0};
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
for (int i = 0; i < s.size() - 1; ++i) {
ans += s[i] == 'A' and s[i + 1] == 'B';
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int ans = 0;
int cnt[4] = {0};
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
for (int i = 0; i < s.size() - 1; ++i) {
ans += s[i] == 'A' and s[i + 1] == 'B';
... | [
"call.add",
"call.arguments.change"
] | 868,015 | 868,016 | u459737327 | cpp |
p03049 | #pragma GCC optimize("Ofast")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <un... | #pragma GCC optimize("Ofast")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <un... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 868,017 | 868,018 | u629015299 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int r = 0, xa = 0, bx = 0, ba = 0;
for (; n > 0; n--) {
string s;
cin >> s;
for (int i = 0; i + 1 < s.size(); i++) {
r += s[i] == 'A' && s[i + 1] == 'B';
}
xa += s.back() == 'A';
bx += s.front() == 'B';
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int r = 0, xa = 0, bx = 0, ba = 0;
for (; n > 0; n--) {
string s;
cin >> s;
for (int i = 0; i + 1 < s.size(); i++) {
r += s[i] == 'A' && s[i + 1] == 'B';
}
xa += s.back() == 'A';
bx += s.front() == 'B';
... | [
"expression.operation.binary.add"
] | 868,019 | 868,020 | u848737670 | cpp |
p03049 | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
int N;
char s[10101][30];
int bs, ae, aa;
int i, j, k, ans;
int main() {
... | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
int N;
char s[10101][30];
int bs, ae, aa;
int i, j, k, ans;
int main() {
... | [
"control_flow.branch.if.condition.change"
] | 868,027 | 868,028 | u259396003 | cpp |
p03049 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
... | [
"call.add",
"call.arguments.change"
] | 868,029 | 868,030 | u930898631 | cpp |
p03049 | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define MOD 1000000007 // 10^9 + 7
#defi... | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define MOD 1000000007 // 10^9 + 7
#defi... | [
"control_flow.branch.if.condition.change"
] | 868,033 | 868,034 | u774652316 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint mod = 1e9 + 7;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
template <class T> inline void YES(T condit... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint mod = 1e9 + 7;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
template <class T> inline void YES(T condit... | [
"expression.operation.binary.remove"
] | 868,035 | 868,036 | u115888500 | cpp |
p03049 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n;
int answer = 0;
int a = 0, b = 0, c = 0;
for (int i = 0; i < n; ++i) {
cin >> s;
for (int j = 0, length = s.length(); j < length - 1; ++j) {
if (s[j] == 'A' && s[j + 1] == 'B')
++answer;
}
i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n;
int answer = 0;
int a = 0, b = 0, c = 0;
for (int i = 0; i < n; ++i) {
cin >> s;
for (int j = 0, length = s.length(); j < length - 1; ++j) {
if (s[j] == 'A' && s[j + 1] == 'B')
++answer;
}
i... | [
"control_flow.branch.if.condition.change"
] | 868,040 | 868,041 | u532096498 | cpp |
p03050 | #include <algorithm>
#include <cmath>
#include <cstdio>
#define ll long long
using namespace std;
int main() {
ll n;
scanf("%lld", &n);
ll dap = 0;
for (ll i = 1; i <= n; i++) {
if ((n - i) / i < i)
break;
if ((n - i) % i == 0) {
dap += (n - i) / i;
}
}
printf("%lld\n", dap);
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#define ll long long
using namespace std;
int main() {
ll n;
scanf("%lld", &n);
ll dap = 0;
for (ll i = 1; i <= n; i++) {
if ((n - i) / i <= i)
break;
if ((n - i) % i == 0) {
dap += (n - i) / i;
}
}
printf("%lld\n", dap);
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 868,044 | 868,045 | u266602249 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, n, m) for (int i = (n); i < (m); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REPR(i, n) for (int i = (n); i >= 0; i--)
#define all(vec) vec.begin(), vec.end()
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vec... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, n, m) for (int i = (n); i < (m); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REPR(i, n) for (int i = (n); i >= 0; i--)
#define all(vec) vec.begin(), vec.end()
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vec... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 868,048 | 868,049 | u437391064 | cpp |
p03050 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
unsigned long long n;
cin >> n;
unsigned long long sum = 0;
for (unsigned long long i = 1; i < sqrt(n); i++) {
if (n % i == 0) {
unsigned long long m = n / i - 1;
sum += m;
}
}
cout << sum << endl;
return 0;
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
unsigned long long n;
cin >> n;
unsigned long long sum = 0;
for (unsigned long long i = 1; i < sqrt(n); i++) {
if (n % i == 0) {
unsigned long long m = n / i - 1;
if (i < m)
sum += m;
}
}
cout << sum << endl... | [
"control_flow.branch.if.add"
] | 868,052 | 868,053 | u754144235 | cpp |
p03050 | /////////////////////////////////////////Info/////////////////////////////////////////////////
// Problem:
// Date:
// Skill:
// Bug:
/////////////////////////////////////////Definations/////////////////////////////////////////////////
//循环控制
#define CLR(a) memset((a), 0, sizeof(a))
#define F(i, a, b) for (int i = a; i... | /////////////////////////////////////////Info/////////////////////////////////////////////////
// Problem:
// Date:
// Skill:
// Bug:
/////////////////////////////////////////Definations/////////////////////////////////////////////////
//循环控制
#define CLR(a) memset((a), 0, sizeof(a))
#define F(i, a, b) for (int i = a; i... | [
"control_flow.branch.if.condition.change"
] | 868,054 | 868,055 | u738285256 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
#define ALL(obj) obj.begin(), obj.end()
#define pb(obj) push_back(obj)
#define REP(i, N) for (int i = 0; i < N; i++)
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll count = 0;
ll N;
cin >> N;
ll n = floor((-1 + sqrt(1 + 4 * N)) / 2... | #include <bits/stdc++.h>
using namespace std;
#define ALL(obj) obj.begin(), obj.end()
#define pb(obj) push_back(obj)
#define REP(i, N) for (int i = 0; i < N; i++)
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll count = 0;
ll N;
cin >> N;
ll n = ceil((-1 + sqrt(1 + 4 * N)) / 2)... | [
"misc.opposites",
"identifier.change",
"call.function.change"
] | 868,060 | 868,061 | u892438699 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 868,074 | 868,075 | u901862155 | cpp |
p03050 | #include <bits/stdc++.h>
#define rep(a, b, c) for (int a = (b); a <= (c); ++a)
#define per(a, b, c) for (int a = (b); a >= (c); --a)
using namespace std;
template <class T> void rd(T &x) {
x = 0;
int f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
... | #include <bits/stdc++.h>
#define rep(a, b, c) for (int a = (b); a <= (c); ++a)
#define per(a, b, c) for (int a = (b); a >= (c); --a)
using namespace std;
template <class T> void rd(T &x) {
x = 0;
int f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
... | [] | 868,076 | 868,077 | u383898108 | cpp |
p03050 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define inf 1000000007
typedef pair<int, int> P;
bool prime(int n) {
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
int gcd(int x, int y) {
if (y ==... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define inf 1000000007
typedef pair<int, int> P;
bool prime(int n) {
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
int gcd(int x, int y) {
if (y ==... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 868,078 | 868,079 | u452009494 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.