problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p03018 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define dump(x) cout << #x << " = " << (x) << endl;
... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define dump(x) cout << #x << " = " << (x) << endl;
... | [] | 833,785 | 833,786 | u520129469 | cpp |
p03018 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
long res = 0;
long a = ... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
long res = 0;
long a = ... | [
"assignment.change"
] | 833,789 | 833,790 | u382513779 | cpp |
p03018 | /**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*/
#include <bits/stdc++.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
#define fori(n) for (ll i = 0; i < (n); i++)
#define forn(i, n) for (ll i = 0; i < (n); i++)
#define forn3(i, x, n) for (ll i = (x); i < (n); i++)
... | /**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*/
#include <bits/stdc++.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
#define fori(n) for (ll i = 0; i < (n); i++)
#define forn(i, n) for (ll i = 0; i < (n); i++)
#define forn3(i, x, n) for (ll i = (x); i < (n); i++)
... | [
"variable_declaration.type.change"
] | 833,811 | 833,810 | u014617387 | cpp |
p03018 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size() - 1; i++) {
if (s[i] == 'B' && s[i + 1] == 'C') {
s.replace(i, 2, 1, 'S');
}
}
int count = 0;
int a_count = 0;
f... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size() - 1; i++) {
if (s[i] == 'B' && s[i + 1] == 'C') {
s.replace(i, 2, 1, 'S');
}
}
long int count = 0;
long int a_coun... | [
"variable_declaration.type.widen.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 833,814 | 833,813 | u225891650 | cpp |
p03018 | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) REP(i, 0, n)
#define REP(i, l, r) for (long long i = l; i < r; i++)
using namespace std;
typedef pair<int, int> P;
struct edge {
int to, cost;
};
class dijkstra {
int V;
int d[100002];
priority_queue<P, vector<P>, greater<P>> que;
void update(i... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) REP(i, 0, n)
#define REP(i, l, r) for (long long i = l; i < r; i++)
using namespace std;
typedef pair<int, int> P;
struct edge {
int to, cost;
};
class dijkstra {
int V;
int d[100002];
priority_queue<P, vector<P>, greater<P>> que;
void update(i... | [] | 833,819 | 833,820 | u073057072 | cpp |
p03018 | #include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define M 9... | #include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define M 9... | [
"expression.unary.arithmetic.add"
] | 833,827 | 833,828 | u760200622 | cpp |
p03018 | #include <bits/stdc++.h>
#define EM 100000000
using namespace std;
using LL = long long;
using P = pair<LL, LL>;
LL LINF = 1e18;
int INF = 1e9;
using vint = vector<int>;
using vLL = vector<LL>;
using vvint = vector<vector<int>>;
using vvLL = vector<vector<LL>>;
int main() {
string s;
cin >> s;
int n = s.size();
... | #include <bits/stdc++.h>
#define EM 100000000
using namespace std;
using LL = long long;
using P = pair<LL, LL>;
LL LINF = 1e18;
int INF = 1e9;
using vint = vector<int>;
using vLL = vector<LL>;
using vvint = vector<vector<int>>;
using vvLL = vector<vector<LL>>;
int main() {
string s;
cin >> s;
int n = s.size();
... | [
"expression.unary.arithmetic.add"
] | 833,829 | 833,830 | u510175787 | cpp |
p03018 |
/*vvv>
zzzzzI
.---. zzuzuI .vgggg&,.
+++++= dunkoI .WbbWo JMM9^```?TMB` ..&gNNg,. gggggggJ, qgggggggg]
(&&&&&&&&[ c+OA&J, (&&&&&&+J, .cJeAA&-. (&&&&&&&&x .&AA&=-.
+++++= dunkoI Xpbpbp JM#` (M#^ ?MMp MM| +TMN. JMF '
|yk ` dVY 7Vk, Vy ... |
/*vvv>
zzzzzI
.---. zzuzuI .vgggg&,.
+++++= dunkoI .WbbWo JMM9^```?TMB` ..&gNNg,. gggggggJ, qgggggggg]
(&&&&&&&&[ c+OA&J, (&&&&&&+J, .cJeAA&-. (&&&&&&&&x .&AA&=-.
+++++= dunkoI Xpbpbp JM#` (M#^ ?MMp MM| +TMN. JMF '
|yk ` dVY 7Vk, Vy ... | [] | 833,834 | 833,835 | u675296835 | cpp |
p03018 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int AAA = 0, BC = 0, ans = 0;
for (int i = 0; i < S.size() - 1; ++i) {
if (S.at(i) == 'A')
AAA++;
if (S.a... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
long int AAA = 0, BC = 0, ans = 0;
for (int i = 0; i < S.size() - 1; ++i) {
if (S.at(i) == 'A')
AAA++;
el... | [
"variable_declaration.type.widen.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 833,865 | 833,864 | u041282550 | cpp |
p03018 | #include <iostream>
#include <string>
using namespace std;
typedef long long ll;
string S;
ll BC[200010] = {};
int main() {
cin >> S;
int N = S.size();
if (N <= 2) {
cout << 0 << endl;
return 0;
}
ll bc = 0;
ll ans = 0;
int i = N - 2;
while (i >= 0) {
if (S[i] == 'A') {
if (S[i] != 'C... | #include <iostream>
#include <string>
using namespace std;
typedef long long ll;
string S;
ll BC[200010] = {};
int main() {
cin >> S;
int N = S.size();
if (N <= 2) {
cout << 0 << endl;
return 0;
}
ll bc = 0;
ll ans = 0;
int i = N - 2;
while (i >= 0) {
if (S[i] == 'A') {
if (S[i + 1] !... | [
"control_flow.branch.if.condition.change"
] | 833,896 | 833,897 | u623954643 | cpp |
p03018 | // Optimise
#include <bits/stdc++.h>
using namespace std;
#define Online 1
// #define multitest 1
#define Debug 1
void ControlIO();
void TimerStart();
void TimerStop();
#ifdef Debug
#define db(...) ZZ(#__VA_ARGS__, __VA_ARGS__);
template <typename Arg1> void ZZ(const char *name, Arg1 &&arg1) {
std::cerr << name << "... | // Optimise
#include <bits/stdc++.h>
using namespace std;
#define Online 1
// #define multitest 1
#define Debug 1
void ControlIO();
void TimerStart();
void TimerStop();
#ifdef Debug
#define db(...) ZZ(#__VA_ARGS__, __VA_ARGS__);
template <typename Arg1> void ZZ(const char *name, Arg1 &&arg1) {
std::cerr << name << "... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.unary.arithmetic.add"
] | 833,959 | 833,960 | u467423063 | cpp |
p03018 | #include <bits/stdc++.h>
using namespace std;
string S;
int main() {
cin >> S;
int64_t ans = 0;
int64_t Acnt = 0;
for (int i = 0; i < S.size(); i++) {
if (i + 1 < S.size() && S[i] == 'B' && S[i + 1] == 'C') {
ans += Acnt;
Acnt = 1;
i++;
} else if (S[i] == 'A') {
Acnt++;
} ... | #include <bits/stdc++.h>
using namespace std;
string S;
int main() {
cin >> S;
int64_t ans = 0;
int64_t Acnt = 0;
for (int i = 0; i < S.size(); i++) {
if (i + 1 < S.size() && S[i] == 'B' && S[i + 1] == 'C') {
ans += Acnt;
i++;
} else if (S[i] == 'A') {
Acnt++;
} else {
Acn... | [] | 833,963 | 833,964 | u992875223 | cpp |
p03018 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) repd(i, ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) repd(i, ... | [
"assignment.change"
] | 833,998 | 833,999 | u030992242 | cpp |
p03018 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int n = s.size();
long long ans = 0;
long long cnt = 0;
for (int i = 0; i < n - 1;) {
if (s[i] == 'A')
cnt++;
if (s[i] == 'C')
cnt = 0;
if (s[i] == 'B' && s[i... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int n = s.size();
long long ans = 0;
long long cnt = 0;
for (int i = 0; i < n - 1;) {
if (s[i] == 'A')
cnt++;
if (s[i] == 'C')
cnt = 0;
if (s[i] == 'B' && s[i... | [] | 834,044 | 834,045 | u676029460 | cpp |
p03018 | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
string s;
cin >> s;
ll a = 0;
ll ans = 0;
for (int z = 0; z < s.size()... | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
string s;
cin >> s;
ll a = 0;
ll ans = 0;
for (int z = 0; z < s.size()... | [
"assignment.value.change"
] | 834,046 | 834,047 | u553927381 | cpp |
p03018 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
int main() {
string s;
cin >> s;
ll n = s.size() - 1;
ll ans = 0, a = 0;
for (ll i = 0; i < n; i++) {
if (s[i] == 'A')
a++;
else if (s[i] == 'B') {
if (s[i + 1] == 'C')
ans += a, i++;
} e... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
int main() {
string s;
cin >> s;
ll n = s.size() - 1;
ll ans = 0, a = 0;
for (ll i = 0; i < n; i++) {
if (s[i] == 'A')
a++;
else if (s[i] == 'B') {
if (s[i + 1] == 'C')
ans += a, i++;
e... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add"
] | 834,063 | 834,064 | u026867297 | cpp |
p03018 | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int Anum = 0;
int state = 0;
int ans = 0;
for (char c : s) {
if (state == 0 && c == 'A') {
Anum = 1;
state = 1;
} else if (state == 1) {
switch (c) {
case 'A':
Anum++;
break;
case... | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int Anum = 0;
int state = 0;
long long ans = 0;
for (char c : s) {
if (state == 0 && c == 'A') {
Anum = 1;
state = 1;
} else if (state == 1) {
switch (c) {
case 'A':
Anum++;
break;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 834,093 | 834,092 | u868132236 | cpp |
p03018 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define erep(i, n) for (int i = 0; i <= n; i++)
#define rep1(i, n) for (int i = 1; i < n; i++)
#define erep1(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
#define vint vector<int>
#define vvint vector<vector<int>>
#de... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define erep(i, n) for (int i = 0; i <= n; i++)
#define rep1(i, n) for (int i = 1; i < n; i++)
#define erep1(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
#define vint vector<int>
#define vvint vector<vector<int>>
#de... | [] | 834,142 | 834,143 | u613960672 | cpp |
p03018 | #define _USE_MATH_DEFINES
#ifdef __GNUC__
#include <bits/stdc++.h>
#else
#define _CRT_SECURE_NO_WARNINGS
#include <__msvc_all_public_headers.hpp>
#undef min
#undef max
#endif
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= ... | #define _USE_MATH_DEFINES
#ifdef __GNUC__
#include <bits/stdc++.h>
#else
#define _CRT_SECURE_NO_WARNINGS
#include <__msvc_all_public_headers.hpp>
#undef min
#undef max
#endif
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= ... | [
"literal.number.change",
"call.arguments.change"
] | 834,150 | 834,151 | u172873334 | cpp |
p03018 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | [
"expression.unary.arithmetic.add"
] | 834,163 | 834,164 | u347057617 | cpp |
p03018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add"
] | 834,203 | 834,204 | u917049698 | cpp |
p03018 | #include <bits/stdc++.h>
using namespace std;
long long arr[1000000];
int main() {
string s;
long long n, i, j, k, m, x, y, z;
cin >> s;
x = 0;
y = 0;
i = 0;
while (i < s.length() - 1) {
if (s[i] == 'A') {
x++;
i++;
} else if (s[i] == 'B' && s[i + 1] == 'C') {
if (x > 0) {
... | #include <bits/stdc++.h>
using namespace std;
long long arr[1000000];
int main() {
string s;
long long n, i, j, k, m, x, y, z;
cin >> s;
x = 0;
y = 0;
i = 0;
while (i < s.length() - 1) {
if (s[i] == 'A') {
x++;
i++;
} else if (s[i] == 'B' && s[i + 1] == 'C') {
if (x > 0) {
... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 834,207 | 834,208 | u349470793 | cpp |
p03018 | //解説AC
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;
cin >> s;
int ans = 0, count_a = 0;
int len = s.length();
rep(i, len) {
if (s.at(i) == 'A')
count_a++;
if (s.at(i) == 'B' && i != len - 1) {
if (s.at(i + 1) ==... | //解説AC
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;
cin >> s;
long long ans = 0, count_a = 0;
int len = s.length();
rep(i, len) {
if (s.at(i) == 'A')
count_a++;
if (s.at(i) == 'B' && i != len - 1) {
if (s.at(i +... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 834,260 | 834,259 | u690475097 | cpp |
p03018 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> using V = vector<T>;
template <class T, class U> using P = pair<T, U>;
using vll = V<ll>;
using vvll = V<vll>;
#define rep(i, k, n) for (ll i = k; i < (ll)n; ++i)
#define REP(i, n) rep(i, 0, n)
const ll MOD = (ll)1e9 + 7;
const ll H... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> using V = vector<T>;
template <class T, class U> using P = pair<T, U>;
using vll = V<ll>;
using vvll = V<vll>;
#define rep(i, k, n) for (ll i = k; i < (ll)n; ++i)
#define REP(i, n) rep(i, 0, n)
const ll MOD = (ll)1e9 + 7;
const ll H... | [] | 834,276 | 834,277 | u077337864 | cpp |
p03018 | #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() {
string S;
cin >> S;
reverse(S.begin(), S.end());
ULL ans = 0;
ULL buf = 0;
... | #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() {
string S;
cin >> S;
reverse(S.begin(), S.end());
ULL ans = 0;
ULL buf = 0;
... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 834,286 | 834,287 | u331948661 | cpp |
p03018 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const int INF = 1 << 28;
const ll MOD = 1000000007;
template <class T> bool chmax(T &a, const T &b) {
... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const int INF = 1 << 28;
const ll MOD = 1000000007;
template <class T> bool chmax(T &a, const T &b) {
... | [] | 834,301 | 834,302 | u756088996 | cpp |
p03018 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const int INF = 1 << 28;
const ll MOD = 1000000007;
template <class T> bool chmax(T &a, const T &b) {
... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const int INF = 1 << 28;
const ll MOD = 1000000007;
template <class T> bool chmax(T &a, const T &b) {
... | [
"expression.operation.binary.remove"
] | 834,303 | 834,302 | u756088996 | cpp |
p03018 | // A
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod = 1e9 + 7;
#define pa(x, n) \
for (ll i = 0; i < n; i++) { \
cout << (x[i]) << " \n"[i == n - 1]; ... | // A
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod = 1e9 + 7;
#define pa(x, n) \
for (ll i = 0; i < n; i++) { \
cout << (x[i]) << " \n"[i == n - 1]; ... | [] | 834,306 | 834,307 | u991846372 | cpp |
p03018 | #include <bits/stdc++.h>
using namespace std;
#define vd vector<double>
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define vc vector<char>
#define vcc vector<vector<char>>
#define pii pair<int, int>
#defi... | #include <bits/stdc++.h>
using namespace std;
#define vd vector<double>
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define vc vector<char>
#define vcc vector<vector<char>>
#define pii pair<int, int>
#defi... | [
"variable_declaration.type.change",
"variable_declaration.value.change"
] | 834,314 | 834,313 | u948618130 | cpp |
p03018 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define P pair<int, int>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1000000000
#define MOD 1000000007
#define all(v) v.begin(), v.end()
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
struct edge {
in... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define P pair<int, int>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1000000000
#define MOD 1000000007
#define all(v) v.begin(), v.end()
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
struct edge {
in... | [] | 834,334 | 834,335 | u006686215 | cpp |
p03018 | #include <bits/stdc++.h>
#define ll long long
#define ra return a;
#define pb push_back
#define sti stack<ll>
#define spi stack<pair<ll, ll>>
#define S second
#define msi map<string, ll>
#define msi map<string, ll>
#define mii map<ll, ll>
#define dbg(x) \
... | #include <bits/stdc++.h>
#define ll long long
#define ra return a;
#define pb push_back
#define sti stack<ll>
#define spi stack<pair<ll, ll>>
#define S second
#define msi map<string, ll>
#define msi map<string, ll>
#define mii map<ll, ll>
#define dbg(x) \
... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add"
] | 834,338 | 834,339 | u231573377 | cpp |
p03018 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
string S;
cin >> S;
int ss = S.size();
int aj = 0, ans = 0;
for (int i = 0; i < ss - 2; i++) {
if (S[i] == 'A')
aj++;
else
aj = 0;
if (S[i] == 'A' && S[i + 1] == 'B' && S[i + 2] == 'C') {
ans += aj;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
string S;
cin >> S;
int ss = S.size();
ll aj = 0, ans = 0;
for (int i = 0; i < ss - 2; i++) {
if (S[i] == 'A')
aj++;
else
aj = 0;
if (S[i] == 'A' && S[i + 1] == 'B' && S[i + 2] == 'C') {
ans += aj;
... | [
"variable_declaration.type.change"
] | 834,342 | 834,343 | u045811375 | cpp |
p03018 | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
int N = S.length();
bool f = false;
int t = 0;
for (int i = N - 1; i >= 0; --i) {
if (S[i] == 'C') {
if (i < 1 or S[i - 1] != 'B')
f = false, t = 0;
else
f = true, ++t;
--i;
} ... | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
long long ans = 0;
int N = S.length();
bool f = false;
long long t = 0;
for (int i = N - 1; i >= 0; --i) {
if (S[i] == 'C') {
if (i < 1 or S[i - 1] != 'B')
f = false, t = 0;
else
f = true, ++t, --i;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 834,352 | 834,353 | u107077660 | cpp |
p03018 | #include <bits/stdc++.h>
using namespace std;
long long calbubble(string s) {
long long ret = 0, ycnt = 0;
for (int i = s.size() - 1; i >= 0; --i) {
if (s[i] == 'y')
++ycnt;
else
ret += ycnt;
}
return ret;
}
int main() {
string s;
cin >> s;
string t = "";
long long ans = 0;
bool... | #include <bits/stdc++.h>
using namespace std;
long long calbubble(string s) {
long long ret = 0, ycnt = 0;
for (int i = s.size() - 1; i >= 0; --i) {
if (s[i] == 'y')
++ycnt;
else
ret += ycnt;
}
return ret;
}
int main() {
string s;
cin >> s;
string t = "";
long long ans = 0;
bool... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add"
] | 834,360 | 834,361 | u604693716 | cpp |
p03018 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int ans = 0;
string s;
int N;
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
cout << fixed << setprecision(12);
cin >> s;
N = s.size();
int cntA = 0;
for (int i = 0; i < N; i++) {
if (i + 2 < N) {
if (s[i] == 'A'... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int ans = 0;
string s;
int N;
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
cout << fixed << setprecision(12);
cin >> s;
N = s.size();
int cntA = 0;
for (int i = 0; i < N; i++) {
if (i + 2 < N) {
if (s[i] == 'A'... | [] | 834,368 | 834,369 | u424103788 | cpp |
p03018 | #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... | [] | 834,370 | 834,371 | u202928696 | cpp |
p03018 | #include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
int main() {
string s;
cin >> s;
ll ans = 0, A_num = 0;
for (ll i = 0; i < (ll)s.size() - 1; i++) {
if (s[i] == 'A') {
A_num++;
} else if (A_num > 0 && s[i] == 'B' && s[i + 1] == 'C') {
ans += A_num;
A_num = 1;
i... | #include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
int main() {
string s;
cin >> s;
ll ans = 0, A_num = 0;
for (ll i = 0; i < (ll)s.size() - 1; i++) {
if (s[i] == 'A') {
A_num++;
} else if (A_num > 0 && s[i] == 'B' && s[i + 1] == 'C') {
ans += A_num;
i += 1;
} else... | [] | 834,382 | 834,383 | u456065785 | cpp |
p03018 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = int(m); i < int... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = int(m); i < int... | [] | 834,415 | 834,416 | u608965386 | cpp |
p03018 | #include "bits/stdc++.h"
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define LL long long
string s;
int main() {
cin >> s;
int n = s.size();
LL cnt = 0;
LL ret = 0;
int idx = 0;
while (idx < n - 1) {
if (... | #include "bits/stdc++.h"
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define LL long long
string s;
int main() {
cin >> s;
int n = s.size();
LL cnt = 0;
LL ret = 0;
int idx = 0;
while (idx < n - 1) {
if (... | [
"assignment.add"
] | 834,419 | 834,420 | u190952243 | cpp |
p03018 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define forr(i, a, b, c) for (int i = a; i < b; i += c)
#define forrb(i, a, b, c) for... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define forr(i, a, b, c) for (int i = a; i < b; i += c)
#define forrb(i, a, b, c) for... | [] | 834,443 | 834,444 | u681005504 | cpp |
p03019 | ///////////////////////////////////////////////////////////////////////////////
#include <bits/stdc++.h>
#include <sys/time.h>
#include <time.h>
#include <unistd.h>
using namespace std;
///////////////////////////////////////////////////////////////////////////////
#define DEBUG 0
#define pb push_back
#define V ve... | ///////////////////////////////////////////////////////////////////////////////
#include <bits/stdc++.h>
#include <sys/time.h>
#include <time.h>
#include <unistd.h>
using namespace std;
///////////////////////////////////////////////////////////////////////////////
#define DEBUG 0
#define pb push_back
#define V ve... | [
"expression.operator.compare.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 834,461 | 834,462 | u167931717 | cpp |
p03019 | #include <bits/stdc++.h>
#define owo(i, a, b) for (int i = (a); i < (b); ++i)
#define uwu(i, a, b) for (int i = (a)-1; i >= (b); --i)
#define senpai push_back
#define ttgl pair<int, int>
#define ayaya cout << "ayaya~" << endl
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
g... | #include <bits/stdc++.h>
#define owo(i, a, b) for (int i = (a); i < (b); ++i)
#define uwu(i, a, b) for (int i = (a)-1; i >= (b); --i)
#define senpai push_back
#define ttgl pair<int, int>
#define ayaya cout << "ayaya~" << endl
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
g... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 834,463 | 834,464 | u532199771 | cpp |
p03019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define N 300010
ll n, x;
struct ver {
ll b, l, r;
ll allsum() { return b * l + (x - b) * r; }
ll opp() { return b * l; }
ver(ll b, ll l, ll r) { this->b = b, this->l = l, this->r = r; }
};
bool operator<(const ver &a, const ver &b) {
ll vl ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define N 300010
ll n, x;
struct ver {
ll b, l, r;
ll allsum() { return b * l + (x - b) * r; }
ll opp() { return b * l; }
ver(ll b, ll l, ll r) { this->b = b, this->l = l, this->r = r; }
};
bool operator<(const ver &a, const ver &b) {
ll vl ... | [
"assignment.change"
] | 834,495 | 834,496 | u924885571 | cpp |
p03019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, s, t) for (int i = s; i < t; i++)
const int MAXNUM = 150005;
int n;
ll x;
struct node {
ll b, l, r;
bool operator<(const node &nn) const {
return x * r - b * (r - l) > x * nn.r - nn.b * (nn.r - nn.l);
}
};
node alln[MAXNUM];
in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, s, t) for (int i = s; i < t; i++)
const int MAXNUM = 150005;
int n;
ll x;
struct node {
ll b, l, r;
bool operator<(const node &nn) const {
return x * r - b * (r - l) > x * nn.r - nn.b * (nn.r - nn.l);
}
};
node alln[MAXNUM];
in... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 834,510 | 834,511 | u930038564 | cpp |
p03019 | #include <bits/stdc++.h>
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"
#define NDEBUG
#define SHOW(...) static_cast<void>(0)
//!===========================================================!//
//! dP dP dP !//
//! 88 ... | #include <bits/stdc++.h>
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"
#define NDEBUG
#define SHOW(...) static_cast<void>(0)
//!===========================================================!//
//! dP dP dP !//
//! 88 ... | [
"identifier.change"
] | 834,516 | 834,517 | u603303736 | cpp |
p03019 | #include <bits/stdc++.h>
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"
#define NDEBUG
#define SHOW(...) static_cast<void>(0)
//!===========================================================!//
//! dP dP dP !//
//! 88 ... | #include <bits/stdc++.h>
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"
#define NDEBUG
#define SHOW(...) static_cast<void>(0)
//!===========================================================!//
//! dP dP dP !//
//! 88 ... | [] | 834,518 | 834,517 | u603303736 | cpp |
p03019 | #include <bits/stdc++.h>
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"
#define NDEBUG
#define SHOW(...) static_cast<void>(0)
//!===========================================================!//
//! dP dP dP !//
//! 88 ... | #include <bits/stdc++.h>
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"
#define NDEBUG
#define SHOW(...) static_cast<void>(0)
//!===========================================================!//
//! dP dP dP !//
//! 88 ... | [
"literal.number.type.widen.change"
] | 834,519 | 834,517 | u603303736 | cpp |
p03019 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII... | [
"expression.operation.binary.remove"
] | 834,520 | 834,521 | u007610006 | cpp |
p03019 | #include <bits/stdc++.h>
using std::abs;
using std::bitset;
using std::cerr;
using std::cin;
using std::cout;
using std::map;
using std::max;
using std::min;
using std::pair;
using std::set;
using std::sort;
using std::string;
using std::swap;
using std::unordered_map;
using std::unordered_set;
using std::vector;
using... | #include <bits/stdc++.h>
using std::abs;
using std::bitset;
using std::cerr;
using std::cin;
using std::cout;
using std::map;
using std::max;
using std::min;
using std::pair;
using std::set;
using std::sort;
using std::string;
using std::swap;
using std::unordered_map;
using std::unordered_set;
using std::vector;
using... | [
"call.arguments.change"
] | 834,524 | 834,525 | u247904511 | cpp |
p03019 | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <unordered_map>
#in... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <unordered_map>
#in... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change",
"expression.operation.binary.change"
] | 834,537 | 834,538 | u079603018 | cpp |
p03019 | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <unordered_map>
#in... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <unordered_map>
#in... | [
"expression.operation.binary.change"
] | 834,540 | 834,538 | u079603018 | cpp |
p03019 | #include <bits/stdc++.h>
#define rt "\n"
#define sp " "
#define test(n) cout << "test" << n << endl;
#define fixsp(n) fixed << setprecision(n)
#define defsp(n) defaultfloat << setprecision(n)
#define kyopro \
ios::sync_with_stdio(false); ... | #include <bits/stdc++.h>
#define rt "\n"
#define sp " "
#define test(n) cout << "test" << n << endl;
#define fixsp(n) fixed << setprecision(n)
#define defsp(n) defaultfloat << setprecision(n)
#define kyopro \
ios::sync_with_stdio(false); ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 834,554 | 834,555 | u936790121 | cpp |
p03018 | #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 0;
string s;
cin >> s;
vector<char> v;
for (int i = 0; i < (int)s.size(); i++) {
if (s[i] == 'B' && s[i + 1] == 'C' && i + 1 < s.size()) {
v.push_back('D');
i++;
continue;
}
if (s[i] != 'A') {
s[i] = 'Z';... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long ans = 0;
string s;
cin >> s;
vector<char> v;
for (int i = 0; i < (int)s.size(); i++) {
if (s[i] == 'B' && s[i + 1] == 'C' && i + 1 < s.size()) {
v.push_back('D');
i++;
continue;
}
if (s[i] != 'A') {
s[i] ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 834,620 | 834,619 | u422827820 | cpp |
p03018 | #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 0;
string s;
cin >> s;
vector<char> v;
for (int i = 0; i < (int)s.size(); i++) {
if (s[i] == 'B' && s[i + 1] == 'C' && i + 1 < s.size()) {
v.push_back('D');
i++;
continue;
}
if (s[i] != 'A') {
s[i] = 'Z';... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long ans = 0;
string s;
cin >> s;
vector<char> v;
for (int i = 0; i < (int)s.size(); i++) {
if (s[i] == 'B' && s[i + 1] == 'C' && i + 1 < s.size()) {
v.push_back('D');
i++;
continue;
}
if (s[i] != 'A') {
s[i] ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 834,621 | 834,619 | u422827820 | cpp |
p03018 | #include <algorithm>
#include <iostream>
#include <string.h>
#include <vector>
using namespace std;
typedef pair<string, int> P;
bool pairCompare(const P &firstElof, const P &secondElof) {
return firstElof.second > secondElof.second;
}
bool pairCompare2(const P &firstElof, const P &secondElof) {
if (firstElof.fi... | #include <algorithm>
#include <iostream>
#include <string.h>
#include <vector>
using namespace std;
typedef pair<string, int> P;
bool pairCompare(const P &firstElof, const P &secondElof) {
return firstElof.second > secondElof.second;
}
bool pairCompare2(const P &firstElof, const P &secondElof) {
if (firstElof.fi... | [] | 834,716 | 834,717 | u074445770 | cpp |
p03018 | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
long ans = 0;
char s[200001] = {};
cin >> s;
long j = 0, old = 0;
for (long i = 0; s[i] != 0; i++) {
for (j = 0; s[i + j] == 'A'; j++)
;
if (j > 0 || old > 0) {
if (s[i + j] == 'B' && s[i + j + 1] == 'C') {
an... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
long ans = 0;
char s[200001] = {};
cin >> s;
long j = 0, old = 0;
for (long i = 0; s[i] != 0; i++) {
for (j = 0; s[i + j] == 'A'; j++)
;
if (j > 0 || old > 0) {
if (s[i + j] == 'B' && s[i + j + 1] == 'C') {
an... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 834,727 | 834,728 | u145483532 | cpp |
p03018 | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, ... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, ... | [
"expression.unary.arithmetic.add"
] | 834,730 | 834,731 | u102602414 | cpp |
p03018 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(c) (c).begin(), (c).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <clas... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(c) (c).begin(), (c).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <clas... | [
"variable_declaration.type.change"
] | 834,793 | 834,792 | u540491484 | cpp |
p03018 |
#include <cinttypes>
#include <iostream>
#include <regex>
#include <string>
using ui = std::uint32_t;
using ul = std::uint64_t;
int main() {
std::string raw;
std::cin >> raw;
auto s = std::regex_replace(raw, std::regex{"BC"}, "X");
ui ac;
ul ans{};
for (const auto &c : s)
if (c == 'A')
++ac... |
#include <cinttypes>
#include <iostream>
#include <regex>
#include <string>
using ui = std::uint32_t;
using ul = std::uint64_t;
int main() {
std::string raw;
std::cin >> raw;
auto s = std::regex_replace(raw, std::regex{"BC"}, "X");
ui ac{};
ul ans{};
for (const auto &c : s)
if (c == 'A')
++... | [] | 834,796 | 834,797 | u837286475 | cpp |
p03018 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
string s;
void solve() {
reverse(s.begin(), s.end());
char prev = '#';
int ans = 0;
int count = 0;
for (int i = 0; i < s.length(); i++) {
if (prev == '#') {
if (s[i] == 'C')
prev = 'C';
} else if (prev == ... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
string s;
void solve() {
reverse(s.begin(), s.end());
char prev = '#';
long long ans = 0;
int count = 0;
for (int i = 0; i < s.length(); i++) {
if (prev == '#') {
if (s[i] == 'C')
prev = 'C';
} else if (pr... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 834,836 | 834,835 | u540433787 | cpp |
p03018 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repf(i, j, n) for (int i = (j); i < (n); i++)
#define repr(i, n) for (int i = (n)-1; i >= 0; i--)
int m;
vector<int> a, bc, abc;
bool connected(int i) {
if (abc[i] + 2 * bc[i] + 3 == abc[i + 1] ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repf(i, j, n) for (int i = (j); i < (n); i++)
#define repr(i, n) for (int i = (n)-1; i >= 0; i--)
int m;
vector<int> a, bc, abc;
bool connected(int i) {
if (abc[i] + 2 * bc[i] + 3 == abc[i + 1] ... | [
"literal.number.change",
"control_flow.loop.condition.change"
] | 834,840 | 834,838 | u731175398 | cpp |
p03019 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
long long b[n], l[n], u[n];
for (int i = 0; i < n; i++)
cin >> b[i] >> l[i] >> u[i];
vector<int> v(n);
iota(v.begin(), v.end(), 0);
sort(v.begin(), v.end(), [&](int ... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
long long b[n], l[n], u[n];
for (int i = 0; i < n; i++)
cin >> b[i] >> l[i] >> u[i];
vector<int> v(n);
iota(v.begin(), v.end(), 0);
sort(v.begin(), v.end(), [&](int ... | [
"expression.operation.binary.remove"
] | 834,875 | 834,876 | u374416262 | cpp |
p03019 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const int maxn = 1e5 + 10;
int b[maxn] = {0}, l[maxn] = {0}, u[maxn] = {0};
long long pre[maxn] = {0}, sum[maxn] = {0};
int mult(in... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const int maxn = 1e5 + 10;
int b[maxn] = {0}, l[maxn] = {0}, u[maxn] = {0};
long long pre[maxn] = {0}, sum[maxn] = {0};
int mult(in... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.value.change",
"variable_declaration.type.widen.change"
] | 834,885 | 834,884 | u125824817 | cpp |
p03019 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const int maxn = 1e5 + 10;
int b[maxn] = {0}, l[maxn] = {0}, u[maxn] = {0};
long long pre[maxn] = {0}, sum[maxn] = {0};
int mult(in... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const int maxn = 1e5 + 10;
int b[maxn] = {0}, l[maxn] = {0}, u[maxn] = {0};
long long pre[maxn] = {0}, sum[maxn] = {0};
int mult(in... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 834,885 | 834,886 | u125824817 | cpp |
p03019 | #include <algorithm>
#include <cstdio>
#include <cstring>
#define ll long long
using namespace std;
int rdn() {
int ret = 0;
bool fx = 1;
char ch = getchar();
while (ch > '9' || ch < '0') {
if (ch == '-')
fx = 0;
ch = getchar();
}
while (ch >= '0' && ch <= '9')
ret = ret * 10 + ch - '0', c... | #include <algorithm>
#include <cstdio>
#include <cstring>
#define ll long long
using namespace std;
int rdn() {
int ret = 0;
bool fx = 1;
char ch = getchar();
while (ch > '9' || ch < '0') {
if (ch == '-')
fx = 0;
ch = getchar();
}
while (ch >= '0' && ch <= '9')
ret = ret * 10 + ch - '0', c... | [
"expression.operation.binary.add"
] | 834,889 | 834,890 | u756994119 | cpp |
p03019 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#define ll long long
#define rg register
#define go(i, x, a) for (rg int i = a; i < x; i++)
#define inf 0x3f3f3f3f
#define INF 0x7fffffff
using namespace std;
const int maxn = 1... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#define ll long long
#define rg register
#define go(i, x, a) for (rg int i = a; i < x; i++)
#define inf 0x3f3f3f3f
#define INF 0x7fffffff
using namespace std;
const int maxn = 1... | [
"variable_declaration.value.change"
] | 834,908 | 834,909 | u732254919 | cpp |
p03019 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#define ll long long
#define rg register
#define go(i, x, a) for (rg int i = a; i < x; i++)
#define inf 0x3f3f3f3f
#define INF 0x7fffffff
using namespace std;
const int maxn = 1... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#define ll long long
#define rg register
#define go(i, x, a) for (rg int i = a; i < x; i++)
#define inf 0x3f3f3f3f
#define INF 0x7fffffff
using namespace std;
const int maxn = 1... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_declaration.value.change"
] | 834,910 | 834,909 | u732254919 | cpp |
p03019 | // C - Tests
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
long long x, pre = 0;
cin >> n >> x;
vector<long long> b(n), l(n), u(n);
for (int i = 0; i < n; i++) {
cin >> b[i] >> l[i] >> u[i];
pre +=... | // C - Tests
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
long long x, pre = 0;
cin >> n >> x;
vector<long long> b(n), l(n), u(n);
for (int i = 0; i < n; i++) {
cin >> b[i] >> l[i] >> u[i];
pre +=... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 834,911 | 834,912 | u839953699 | cpp |
p03019 | #include <bits/stdc++.h>
#define fo(i, l, r) for (int i = l; i <= r; i++)
#define of(i, l, r) for (int i = l; i >= r; i--)
#define fe(i, u) for (int i = head[u]; i; i = e[i].next)
#define el putchar('\n')
#define ta putchar(' ')
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
inline void open(con... | #include <bits/stdc++.h>
#define fo(i, l, r) for (int i = l; i <= r; i++)
#define of(i, l, r) for (int i = l; i >= r; i--)
#define fe(i, u) for (int i = head[u]; i; i = e[i].next)
#define el putchar('\n')
#define ta putchar(' ')
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
inline void open(con... | [
"assignment.change"
] | 834,937 | 834,936 | u162067352 | cpp |
p03019 | #include <bits/stdc++.h>
#define FOR0(i, n) for (i = 0; i < n; i++)
#define FOR(i, j, n) for (i = j; i < n; i++)
#define FORD(i, j, k) for (i = j; i >= k; i--)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define inf 1000000000
#define ninf -1000000000
#define endl '\n'
#define she_told_... | #include <bits/stdc++.h>
#define FOR0(i, n) for (i = 0; i < n; i++)
#define FOR(i, j, n) for (i = j; i < n; i++)
#define FORD(i, j, k) for (i = j; i >= k; i--)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define inf 1000000000
#define ninf -1000000000
#define endl '\n'
#define she_told_... | [
"identifier.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 834,940 | 834,941 | u453412459 | cpp |
p03019 | // includes
#include <bits/stdc++.h>
// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define irep(itr, st) for (auto i... | // includes
#include <bits/stdc++.h>
// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define irep(itr, st) for (auto i... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 834,942 | 834,943 | u424110125 | cpp |
p03019 | #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... | [
"expression.operator.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 834,947 | 834,948 | u630941334 | cpp |
p03019 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (i... | [
"assignment.change"
] | 834,949 | 834,950 | u908318580 | cpp |
p03019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i,... | [
"call.arguments.change",
"expression.operation.binary.change"
] | 834,958 | 834,959 | u833393891 | cpp |
p03019 | #include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rer(i, a, b) for (int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), ... | #include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rer(i, a, b) for (int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 834,969 | 834,970 | u491153752 | cpp |
p03019 | #include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rer(i, a, b) for (int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), ... | #include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rer(i, a, b) for (int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), ... | [
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 834,971 | 834,970 | u491153752 | cpp |
p03019 | #include <bits/stdc++.h>
using namespace std;
#ifdef ENABLE_DEBUG
#define dump(a) cerr << #a << "=" << a << endl
#define dumparr(a, n) cerr << #a << "[" << n << "]=" << a[n] << endl
#else
#define dump(a)
#define dumparr(a, n)
#endif
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define For(i, a) FOR(i, 0, a)
#define... | #include <bits/stdc++.h>
using namespace std;
#ifdef ENABLE_DEBUG
#define dump(a) cerr << #a << "=" << a << endl
#define dumparr(a, n) cerr << #a << "[" << n << "]=" << a[n] << endl
#else
#define dump(a)
#define dumparr(a, n)
#endif
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define For(i, a) FOR(i, 0, a)
#define... | [
"literal.number.type.widen.change",
"expression.operation.binary.remove"
] | 834,972 | 834,973 | u634743753 | cpp |
p03019 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
#define rep(i, n) for (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
#define rep(i, n) for (... | [
"assignment.change"
] | 834,988 | 834,989 | u116670634 | cpp |
p03019 | // IO
#include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm
#include <algorithm>
#include <cmath>
#include <numeric>
// container
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector... | // IO
#include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm
#include <algorithm>
#include <cmath>
#include <numeric>
// container
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector... | [
"expression.operator.change"
] | 834,992 | 834,993 | u059727354 | cpp |
p03019 | #include <bits/stdc++.h>
using namespace std;
#define int int_fast64_t
struct exam {
int l, u, b;
int cost(int score) const {
int c = score >= b ? u : l;
return c * (score - b);
}
int gain(int score) const { return cost(score) - cost(0); }
int score_for_mingain(int mingain, int x) const {
assert... | #include <bits/stdc++.h>
using namespace std;
#define int int_fast64_t
struct exam {
int l, u, b;
int cost(int score) const {
int c = score >= b ? u : l;
return c * (score - b);
}
int gain(int score) const { return cost(score) - cost(0); }
int score_for_mingain(int mingain, int x) const {
assert... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 834,998 | 834,999 | u246488512 | cpp |
p03019 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define REP(NAME, NUM) for (int NAME = 0; NAME < (NUM); ++NAME)
#define BREP(NAME, NUM) for (int NAME = (NUM)-1; NAME >= 0; --NAME)
#define ALL(NAME) (NAME).begin(), (NAME).end()
#define cMOD 10... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define REP(NAME, NUM) for (int NAME = 0; NAME < (NUM); ++NAME)
#define BREP(NAME, NUM) for (int NAME = (NUM)-1; NAME >= 0; --NAME)
#define ALL(NAME) (NAME).begin(), (NAME).end()
#define cMOD 10... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.remove"
] | 835,000 | 835,001 | u627427672 | cpp |
p03019 | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for... | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for... | [
"call.function.change",
"call.arguments.change",
"literal.number.change",
"variable_declaration.value.change"
] | 835,010 | 835,009 | u838742270 | cpp |
p03019 | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "un... | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "un... | [
"variable_declaration.type.widen.change"
] | 835,016 | 835,017 | u468700753 | cpp |
p03019 | #include <bits/stdc++.h>
using namespace std;
long long int n, x;
struct test {
long long int b, l, u;
bool operator<(const test &rhs) const {
return l * b + u * (x - b) > rhs.l * rhs.b + rhs.u * (x - rhs.b);
}
} T[100000];
int now = 0;
bool check(long long int s, long long int t) {
long long int res = 0;... | #include <bits/stdc++.h>
using namespace std;
long long int n, x;
struct test {
long long int b, l, u;
bool operator<(const test &rhs) const {
return l * b + u * (x - b) > rhs.l * rhs.b + rhs.u * (x - rhs.b);
}
} T[100000];
int now = 0;
bool check(long long int s, long long int t) {
long long int res = 0;... | [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change"
] | 835,022 | 835,023 | u272015756 | cpp |
p03023 | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
struct point {
int x;
int y;
};
int i, j, k, count1 = 0, count2 = 0;
int main() {
int n;
cin >> n;
cout << n * 180 << endl;
}
| #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
struct point {
int x;
int y;
};
int i, j, k, count1 = 0, count2 = 0;
int main() {
int n;
cin >> n;
cout << (n - 2) * 180 << endl;
} | [] | 835,031 | 835,032 | u225660136 | cpp |
p03023 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cout << (N - 2) * 180 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << (N - 2) * 180 << endl;
} | [] | 835,035 | 835,036 | u306482197 | cpp |
p03023 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rep2(i, n) for (int i = 0; i <= n; i++)
#define repr(i, a, n) for (int i = a; i < n; i++)
#define all(a) a.begin(), a.end()
#de... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rep2(i, n) for (int i = 0; i <= n; i++)
#define repr(i, a, n) for (int i = a; i < n; i++)
#define all(a) a.begin(), a.end()
#de... | [
"expression.operation.binary.remove",
"literal.number.change",
"io.output.change"
] | 835,037 | 835,038 | u341447450 | cpp |
p03023 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
cout << 180 * (n - 2) / n << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
cout << 180 * (n - 2) << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 835,043 | 835,044 | u729703601 | cpp |
p03023 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, n) for (ll i = (s); i < (n); i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(18);
string s;
ll n;
cin >> n;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, n) for (ll i = (s); i < (n); i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(18);
string s;
ll n;
cin >> n;
... | [
"literal.number.change",
"io.output.change"
] | 835,045 | 835,046 | u672611103 | cpp |
p03023 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | [
"literal.number.change",
"io.output.change"
] | 835,049 | 835,050 | u504142483 | cpp |
p03023 | #include <bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
#define rep(i, N) for (int(i) = 0; (i) < (N); (i)++)
#define all(v) (v).begin(), (v).end()
#define eb emplace_back
int main() {
int N;
cin >> N;
cout << 60 * N << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
#define rep(i, N) for (int(i) = 0; (i) < (N); (i)++)
#define all(v) (v).begin(), (v).end()
#define eb emplace_back
int main() {
int N;
cin >> N;
cout << 180 * (N - 2) << endl;
}
| [
"literal.number.change",
"io.output.change"
] | 835,059 | 835,060 | u031178961 | cpp |
p03023 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cout << 180 * (n - 2) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << 180 * (n - 2) << endl;
return 0;
}
| [] | 835,063 | 835,064 | u323864528 | cpp |
p03023 | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>... | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>... | [
"call.arguments.change"
] | 835,067 | 835,068 | u917972976 | cpp |
p03023 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << (2 * n - 3) * 90 << '\n';
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n - 2) * 180 << '\n';
} | [
"expression.operation.binary.remove",
"literal.number.change",
"io.output.change"
] | 835,073 | 835,074 | u208440216 | cpp |
p03023 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << (2 * n - 3) * 180 << '\n';
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n - 2) * 180 << '\n';
} | [
"expression.operation.binary.remove",
"literal.number.change",
"io.output.change"
] | 835,075 | 835,074 | u208440216 | cpp |
p03023 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int num;
num = 180 * (N - 2);
cout << num << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int num;
num = 180 * (N - 2);
cout << num << endl;
}
| [] | 835,080 | 835,081 | u091026689 | cpp |
p03023 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repl(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define MAX_N 10000000 // 10^7
#define ll int64_t
#define all(v) (v).begin(), (v).end()
using namespace std;
int main() {
int n;
cin >> n;
cout << 180 + (n - 2) * 180 << end... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repl(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define MAX_N 10000000 // 10^7
#define ll int64_t
#define all(v) (v).begin(), (v).end()
using namespace std;
int main() {
int n;
cin >> n;
cout << 180 + (n - 3) * 180 << end... | [
"literal.number.change",
"io.output.change"
] | 835,082 | 835,083 | u532401120 | cpp |
p03023 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
using namespace std;
long long mod = 1000000007;
int main() {
int N;
cin >> N;
cout << 180 * (N - 3) << endl;
} | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
using namespace std;
long long mod = 1000000007;
int main() {
int N;
cin >> N;
cout << 180 * (N - 2) << endl;
} | [
"literal.number.change",
"io.output.change"
] | 835,091 | 835,092 | u475843109 | cpp |
p03023 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cout << (n - 2) * 180 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
cout << (n - 2) * 180 << endl;
return 0;
}
| [] | 835,098 | 835,099 | u831873811 | cpp |
p03023 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cout << (n - 1) * 180 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
cout << (n - 2) * 180 << endl;
return 0;
}
| [
"literal.number.change",
"io.output.change"
] | 835,100 | 835,099 | u831873811 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.