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 |
|---|---|---|---|---|---|---|---|
p02939 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2 * 1e5 + 20;
int dp[maxn];
string s;
int main() {
cin >> s;
dp[1] = 1;
int l = s.size();
s = '#' + s;
if (s[1] == s[2]) {
dp[2] = 1;
} else
dp[2] = 2;
for (int i = 3; i <= l; i++) {
if (s[i] != s[i - 1]) {
dp[i] = dp[i -... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2 * 1e5 + 20;
int dp[maxn];
string s;
int main() {
cin >> s;
dp[1] = 1;
int l = s.size();
s = '#' + s;
if (s[1] == s[2]) {
dp[2] = 1;
} else
dp[2] = 2;
for (int i = 3; i <= l; i++) {
if (s[i] != s[i - 1]) {
dp[i] = dp[i -... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 741,415 | 741,416 | u198880917 | cpp |
p02939 | #include <bits/stdc++.h>
#define ll long long
#define int long long
#define MOD 1000000007
#define MAX 500005
#include <iomanip>
#define fast \
ios_base ::sync_with_stdio(0); \
cin.tie(NULL); ... | #include <bits/stdc++.h>
#define ll long long
#define int long long
#define MOD 1000000007
#define MAX 500005
#include <iomanip>
#define fast \
ios_base ::sync_with_stdio(0); \
cin.tie(NULL); ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 741,422 | 741,423 | u677600881 | cpp |
p02939 | #include <iostream>
#include <string.h>
using namespace std;
int main() {
string word;
int length, poz = 0, numberOfStrings = 0, weHaveAStringWith3 = 0, jumpOver;
cin >> word;
length = word.length() - 1;
while (poz <= length - 1) {
poz++;
numberOfStrings++;
if (word[poz] != word[poz + 1]) {
... | #include <iostream>
#include <string.h>
using namespace std;
int main() {
string word;
int length, poz = -1, numberOfStrings = 0, weHaveAStringWith3 = 0, jumpOver;
cin >> word;
length = word.length() - 1;
while (poz <= length - 1) {
poz++;
numberOfStrings++;
jumpOver = 1;
if (word[poz] != ... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.add"
] | 741,424 | 741,425 | u189233751 | cpp |
p02939 | #include <cstring>
#include <fstream>
#define nmax 200005
using namespace std;
char s[nmax];
int dp[nmax][2];
int main() {
int i, j;
scanf("%s", &s);
int n = strlen(s);
if (n == 1) {
printf("1\n");
return 0;
}
dp[0][0] = 1;
dp[1][1] = 1;
if (s[0] != s[1])
dp[1][0] = 1;
for (i = 2; i <... | #include <cstring>
#include <fstream>
#define nmax 200005
using namespace std;
char s[nmax];
int dp[nmax][2];
int main() {
int i, j;
scanf("%s", &s);
int n = strlen(s);
if (n == 1) {
printf("1\n");
return 0;
}
dp[0][0] = 1;
dp[1][1] = 1;
if (s[0] != s[1])
dp[1][0] = 2;
for (i = 2; i <... | [
"literal.number.change",
"assignment.value.change"
] | 741,426 | 741,427 | u090950285 | cpp |
p02939 | #include <cstring>
#include <fstream>
#define nmax 200005
using namespace std;
char s[nmax];
int dp[nmax][2];
int main() {
int i, j;
scanf("%s", &s);
int n = strlen(s);
if (n == 1) {
printf("1\n");
return 0;
}
dp[0][0] = 1;
dp[1][1] = 1;
if (s[0] != s[1])
dp[1][0] = 1;
for (i = 2; i <... | #include <cstring>
#include <fstream>
#define nmax 200005
using namespace std;
char s[nmax];
int dp[nmax][2];
int main() {
int i, j;
scanf("%s", &s);
int n = strlen(s);
if (n == 1) {
printf("1\n");
return 0;
}
dp[0][0] = 1;
dp[1][1] = 1;
if (s[0] != s[1])
dp[1][0] = 2;
for (i = 2; i <... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 741,428 | 741,427 | u090950285 | cpp |
p02939 | #include <algorithm>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long... | #include <algorithm>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long... | [] | 741,435 | 741,436 | u304318875 | cpp |
p02939 | // editorialใ่ชญใใ
#include <iostream>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.length();
if (n == 1) {
cout << 1 << endl;
return 0;
}
vector<vector<int>> dp(2, vector<int>(n, 0));
dp[0][0] = 1;
dp[1][1] = 1;
dp[1][0] = s[1] != s[0] ? 2 : 0;
for (int i... | // editorialใ่ชญใใ
#include <iostream>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.length();
if (n == 1) {
cout << 1 << endl;
return 0;
}
vector<vector<int>> dp(2, vector<int>(n, 0));
dp[0][0] = 1;
dp[1][1] = 1;
dp[0][1] = s[1] != s[0] ? 2 : 0;
for (int i... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one"
] | 741,439 | 741,440 | u734519000 | cpp |
p02939 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <ve... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <ve... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 741,443 | 741,444 | u241367243 | cpp |
p02939 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <ve... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <ve... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 741,445 | 741,444 | u241367243 | cpp |
p02939 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <ve... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <ve... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 741,446 | 741,444 | u241367243 | cpp |
p02939 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
string c, p = "";
int ans = 0;
cin >> s;
for (int i = 1; i < s.size(); i++) {
c += s[i];
if (c == p) {
continue;
} else {
p = c;
c = "";
ans++;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
string c, p = "";
int ans = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) {
c += s[i];
if (c == p) {
continue;
} else {
p = c;
c = "";
ans++;
}
}
cout << ans << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 741,447 | 741,448 | u663775885 | cpp |
p02939 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0, k = 0, l = 0, m;
rep(i, s.size() - 1) {
if (s[i] == s[i + 1]) {
k++;
} else {
ans += 1 + 2 * (k / 3);
if (k % 3 == 2)
ans++;
m = k % ... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0, k = 0, l = 0, m;
rep(i, s.size() - 1) {
if (s[i] == s[i + 1]) {
k++;
} else {
ans += 1 + 2 * (k / 3);
if (k % 3 == 2)
ans++;
m = k % ... | [] | 741,449 | 741,450 | u445015174 | cpp |
p02939 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0, k = 0, l = 0, m;
rep(i, s.size() - 1) {
if (s[i] == s[i + 1]) {
k++;
} else {
ans += 1 + 2 * (k / 3);
if (k % 3 == 2)
ans++;
m = k % ... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0, k = 0, l = 0, m;
rep(i, s.size() - 1) {
if (s[i] == s[i + 1]) {
k++;
} else {
ans += 1 + 2 * (k / 3);
if (k % 3 == 2)
ans++;
m = k % ... | [] | 741,451 | 741,450 | u445015174 | cpp |
p02939 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0, k = 0, l = 0, m;
rep(i, s.size() - 1) {
if (s[i] == s[i + 1]) {
k++;
} else {
ans += 1 + 2 * (k / 3);
if (k % 3 == 2)
ans++;
m = k % ... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
string s;
cin >> s;
int ans = 0, k = 0, l = 0, m;
rep(i, s.size() - 1) {
if (s[i] == s[i + 1]) {
k++;
} else {
ans += 1 + 2 * (k / 3);
if (k % 3 == 2)
ans++;
m = k % ... | [] | 741,452 | 741,450 | u445015174 | cpp |
p02939 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 1;
string sub = s.substr(0, 1);
for (int i = 1; i < s.size(); ++i) {
if (sub == s.substr(i, 1)) {
if (i + 1 <= s.size()) {
sub = s.substr(i, 2);
++ans;
++i;
}
} else {
s... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 1;
string sub = s.substr(0, 1);
for (int i = 1; i < s.size(); ++i) {
if (sub == s.substr(i, 1)) {
if (i + 1 < s.size()) {
sub = s.substr(i, 2);
++ans;
++i;
}
} else {
s... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 741,455 | 741,456 | u640800420 | cpp |
p02939 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define N (1000000000 + 7)
#define INF 1e9
typedef long long ll;
typedef pair<ll, ll> P;
unsigned long long popCount64bitB(unsigned long l... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define N (1000000000 + 7)
#define INF 1e9
typedef long long ll;
typedef pair<ll, ll> P;
unsigned long long popCount64bitB(unsigned long l... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 741,467 | 741,468 | u744305661 | cpp |
p02939 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string S;
cin >> S;
set<string> s;
int n = S.length();
if (n == 1) {
cout << "1\n";
return 0;
}
if (n == 2) {
if (S[0] == S[1]) {
cout << "1\n";
} else {
cout << "2\n";
}
return 0;
}
i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string S;
cin >> S;
set<string> s;
int n = S.length();
if (n == 1) {
cout << "1\n";
return 0;
}
if (n == 2) {
if (S[0] == S[1]) {
cout << "1\n";
} else {
cout << "2\n";
}
return 0;
}
i... | [
"literal.number.change",
"assignment.value.change"
] | 741,473 | 741,474 | u634209474 | cpp |
p02939 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string S;
cin >> S;
set<string> s;
int n = S.length();
if (n == 1) {
cout << "1\n";
return 0;
}
if (n == 2) {
if (S[0] == S[1]) {
cout << "1\n";
} else {
cout << "2\n";
}
return 0;
}
i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string S;
cin >> S;
set<string> s;
int n = S.length();
if (n == 1) {
cout << "1\n";
return 0;
}
if (n == 2) {
if (S[0] == S[1]) {
cout << "1\n";
} else {
cout << "2\n";
}
return 0;
}
i... | [
"literal.number.change",
"assignment.value.change"
] | 741,475 | 741,476 | u634209474 | cpp |
p02939 | #include <bits/stdc++.h>
#include <cmath>
#include <vector>
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP2(i, m, n) for (int i = (m); i < (int)(n); ++i)
#define REPR(i, n) for (int i = (n)-1; i >= 0; --i)
#define REPR2(i, m, n) for (int i = (n)-1; i >= (m); --i)
#define REPx(x, a) for (auto x : a)
#d... | #include <bits/stdc++.h>
#include <cmath>
#include <vector>
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP2(i, m, n) for (int i = (m); i < (int)(n); ++i)
#define REPR(i, n) for (int i = (n)-1; i >= 0; --i)
#define REPR2(i, m, n) for (int i = (n)-1; i >= (m); --i)
#define REPx(x, a) for (auto x : a)
#d... | [
"expression.operation.unary.logical.remove",
"control_flow.branch.if.condition.change"
] | 741,479 | 741,480 | u442030035 | cpp |
p02939 | #include <bits/stdc++.h>
#define REP(i, n) for (decltype(n) i = 0; i < n; i++)
#define ALL(c) c.begin(), c.end()
#define SORT(c) std::sort(ALL(c))
#define RSORT(c) std::sort(ALL(c), std::greater<decltype(c)::value_type>())
using namespace std;
using ll = long long;
const int MOD = (int)1e9 + 7;
const int INF = (int... | #include <bits/stdc++.h>
#define REP(i, n) for (decltype(n) i = 0; i < n; i++)
#define ALL(c) c.begin(), c.end()
#define SORT(c) std::sort(ALL(c))
#define RSORT(c) std::sort(ALL(c), std::greater<decltype(c)::value_type>())
using namespace std;
using ll = long long;
const int MOD = (int)1e9 + 7;
const int INF = (int... | [
"literal.number.change",
"call.arguments.change"
] | 741,500 | 741,501 | u403800404 | cpp |
p02939 | #include <bits/stdc++.h>
#define REP(i, n) for (decltype(n) i = 0; i < n; i++)
#define ALL(c) c.begin(), c.end()
#define SORT(c) std::sort(ALL(c))
#define RSORT(c) std::sort(ALL(c), std::greater<decltype(c)::value_type>())
using namespace std;
using ll = long long;
const int MOD = (int)1e9 + 7;
const int INF = (int... | #include <bits/stdc++.h>
#define REP(i, n) for (decltype(n) i = 0; i < n; i++)
#define ALL(c) c.begin(), c.end()
#define SORT(c) std::sort(ALL(c))
#define RSORT(c) std::sort(ALL(c), std::greater<decltype(c)::value_type>())
using namespace std;
using ll = long long;
const int MOD = (int)1e9 + 7;
const int INF = (int... | [
"literal.number.change",
"variable_declaration.value.change",
"call.arguments.change",
"call.arguments.add"
] | 741,502 | 741,501 | u403800404 | cpp |
p02939 | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#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 pb push_back
#define mp make_pair
#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... | [
"assignment.change"
] | 741,503 | 741,504 | u471212175 | cpp |
p02939 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
#define rep(i, n) for (ll i = 0; i < n; ++i)
const ll MOD = 1000000007;
int main() {
string S;
cin >> S;
int s = S.size();
int ans = 0;
rep(i, s - 1) {
if (S[i] != S[i + 1] && i != s ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
#define rep(i, n) for (ll i = 0; i < n; ++i)
const ll MOD = 1000000007;
int main() {
string S;
cin >> S;
int s = S.size();
int ans = 0;
rep(i, s - 1) {
if (S[i] != S[i + 1] && i != s ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 741,505 | 741,506 | u275786410 | cpp |
p02939 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
#define rep(i, n) for (ll i = 0; i < n; ++i)
const ll MOD = 1000000007;
int main() {
string S;
cin >> S;
int s = S.size();
int ans = 0;
rep(i, s - 1) {
if (S[i] != S[i + 1] && i != s ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
#define rep(i, n) for (ll i = 0; i < n; ++i)
const ll MOD = 1000000007;
int main() {
string S;
cin >> S;
int s = S.size();
int ans = 0;
rep(i, s - 1) {
if (S[i] != S[i + 1] && i != s ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 741,507 | 741,506 | u275786410 | cpp |
p02939 | #include <algorithm>
#include <cstdio>
#include <cstring>
#define maxn 200005
using namespace std;
char s[maxn];
int n, g[maxn];
int main() {
scanf("%s", s + 1);
n = strlen(s + 1);
for (int i = 1; i <= n; i++) {
g[i] = 1;
if (i > 1 && s[i] != s[i - 1])
g[i] = g[i - 1] + 1;
if (i > 3)
g[i] ... | #include <algorithm>
#include <cstdio>
#include <cstring>
#define maxn 200005
using namespace std;
char s[maxn];
int n, g[maxn];
int main() {
scanf("%s", s + 1);
n = strlen(s + 1);
for (int i = 1; i <= n; i++) {
g[i] = 1;
if (i > 1 && s[i] != s[i - 1])
g[i] = g[i - 1] + 1;
if (i >= 3)
g[i]... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 741,521 | 741,522 | u921232185 | cpp |
p02939 | #include <cstdio>
#include <cstring>
#define RI register int
#define CI const int &
using namespace std;
const int N = 200005;
char s[N];
int n, ans, pos;
int main() {
scanf("%s", s + 1);
n = strlen(s + 1);
ans = n;
pos = 1;
for (RI i = 2; i <= n; ++i)
if (s[i] == s[pos])
--ans, pos = i + 1, i += 2;... | #include <cstdio>
#include <cstring>
#define RI register int
#define CI const int &
using namespace std;
const int N = 200005;
char s[N];
int n, ans, pos;
int main() {
scanf("%s", s + 1);
n = strlen(s + 1);
ans = n;
pos = 1;
for (RI i = 2; i <= n; ++i)
if (s[i] == s[pos])
--ans, pos = i + 2, i += 2;... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 741,528 | 741,529 | u803115645 | cpp |
p02939 | #include <bits/stdc++.h>
using namespace std;
int dp[2][200000];
int main() {
string s;
cin >> s;
int n = s.length();
for (int i = 0; i < n; i++) {
dp[0][i] = 0;
dp[1][i] = 0;
}
dp[0][0] = 1;
dp[1][1] = 1;
dp[0][1] = s[0] != s[1];
for (int i = 2; i < n; i++) {
if (s[i] != s[i - 1])
... | #include <bits/stdc++.h>
using namespace std;
int dp[2][200000];
int main() {
string s;
cin >> s;
int n = s.length();
for (int i = 0; i < n; i++) {
dp[0][i] = 0;
dp[1][i] = 0;
}
dp[0][0] = 1;
dp[1][1] = 1;
dp[0][1] = (s[0] != s[1]) + 1;
for (int i = 2; i < n; i++) {
if (s[i] != s[i - 1]... | [
"assignment.change"
] | 741,530 | 741,531 | u313766957 | cpp |
p02939 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include ... | [] | 741,532 | 741,533 | u508571192 | cpp |
p02939 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include ... | [
"control_flow.loop.for.condition.change",
"call.arguments.change"
] | 741,534 | 741,535 | u632353278 | cpp |
p02939 | //#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>
#define mem(a, v) memset((a), (v), sizeof(a))
#define enl printf("\n")
#define case (t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%... | //#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>
#define mem(a, v) memset((a), (v), sizeof(a))
#define enl printf("\n")
#define case (t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 741,536 | 741,537 | u270920804 | cpp |
p02939 | #include <bits/stdc++.h>
#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)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define M... | #include <bits/stdc++.h>
#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)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define M... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 741,538 | 741,539 | u236433947 | cpp |
p02939 | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define sync \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define input(arr, n) ... | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define sync \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define input(arr, n) ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 741,540 | 741,541 | u181228520 | cpp |
p02939 | #include <bits/stdc++.h>
#define lli long long int
#define pb push_back
#define mod 1000000007
#pragma GCC optimize("-O2")
#define mod2 998244353
#define MAXN 1000000000
#define v32 vector<int>
#define v64 vector<lli>
#define v1024 vector<vector<int>>
#define v4096 vector<vector<lli>>
#define vt vector
#define f(x, y, ... | #include <bits/stdc++.h>
#define lli long long int
#define pb push_back
#define mod 1000000007
#pragma GCC optimize("-O2")
#define mod2 998244353
#define MAXN 1000000000
#define v32 vector<int>
#define v64 vector<lli>
#define v1024 vector<vector<int>>
#define v4096 vector<vector<lli>>
#define vt vector
#define f(x, y, ... | [
"assignment.change"
] | 741,542 | 741,543 | u624171666 | cpp |
p02939 | // AtCoder Grand Contest 037
// A - Dividing String
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int s_size = s.size() - 1;
int k = 1;
int cur = 1;
string si;
string si1;
si = s.at(0);
si1 = s.at(1);
while (cur <= s_size) {
while (cur <= s_size) {
if (si... | // AtCoder Grand Contest 037
// A - Dividing String
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int s_size = s.size() - 1;
int k = 1;
int cur = 1;
string si;
string si1;
si = s.at(0);
si1 = s.at(1);
while (cur <= s_size) {
while (cur <= s_size) {
if (si... | [
"expression.unary.arithmetic.remove"
] | 741,544 | 741,545 | u370865069 | cpp |
p02939 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
long int N;
N = S.length();
vector<int> a(N);
for (int i = 0; i < N; i++) {
if (i == 0) {
a.at(i) = 1;
}
if (i == 1) {
if (S.at(i - 1) == S.at(i)) {
a.at(i) = 1;
} else {
a.at(i) = 2... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
long int N;
N = S.length();
vector<int> a(N);
for (int i = 0; i < N; i++) {
if (i == 0) {
a.at(i) = 1;
} else if (i == 1) {
if (S.at(i - 1) == S.at(i)) {
a.at(i) = 1;
} else {
a.at(i) = ... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 741,552 | 741,553 | u072774815 | cpp |
p02939 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N;
N = S.length();
vector<int> a(N, 0);
for (int i = 0; i < N; i++) {
if (i == 0) {
a.at(i) = 1;
}
if (i == 1) {
if (S.at(i - 1) == S.at(i)) {
a.at(i) = 1;
} else {
a.at(i) = 2;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
long int N;
N = S.length();
vector<int> a(N);
for (int i = 0; i < N; i++) {
if (i == 0) {
a.at(i) = 1;
} else if (i == 1) {
if (S.at(i - 1) == S.at(i)) {
a.at(i) = 1;
} else {
a.at(i) = ... | [
"variable_declaration.type.widen.change",
"call.arguments.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 741,554 | 741,553 | u072774815 | cpp |
p02939 | // ----------------------------------------------------------
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#incl... | // ----------------------------------------------------------
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#incl... | [
"misc.typo",
"control_flow.branch.if.condition.change"
] | 741,583 | 741,584 | u335104842 | cpp |
p02939 | #include <bits/stdc++.h>
#include <iostream>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long l... | #include <bits/stdc++.h>
#include <iostream>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long l... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 741,585 | 741,586 | u752814744 | cpp |
p02939 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define rep1(i, n) for (int i = 1; i <= int(n); ++i)
int dp[200010][3];
int main(void) {
string s;
cin >> s;
int n = s.size();
s += "_";
rep(i, n) {
rep1(d, 2) {
if (i >= d) {
if (s.substr(i - ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define rep1(i, n) for (int i = 1; i <= int(n); ++i)
int dp[200010][3];
int main(void) {
string s;
cin >> s;
int n = s.size();
s += "_";
rep(i, n) {
rep1(d, 2) {
if (i >= d) {
if (s.substr(i - ... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.change"
] | 741,591 | 741,592 | u241615199 | cpp |
p02939 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <thread>
#include <tuple>
#include <... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <thread>
#include <tuple>
#include <... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove",
"expression.operation.unary.arithmetic.remove"
] | 741,595 | 741,596 | u801094318 | cpp |
p02939 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
ll dp[202020][3] = {0};
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
string s;
cin >> s;
int n = s.size();
s... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
ll dp[202020][3] = {0};
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
string s;
cin >> s;
int n = s.size();
s... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 741,615 | 741,616 | u656572785 | cpp |
p02939 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
long long ans = 1LL;
auto tmp1 = string() + s[0];
auto tmp2 = string() + s[1];
bool flag = false;
int i = 1;
for (i; i < s.size() - 1; ++i) {
tmp2 = string() + s[i];
if (tmp1 == tmp2) {
++i;
tmp2 += s[i];... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
long long ans = 1LL;
auto tmp1 = string() + s[0];
auto tmp2 = string() + s[1];
bool flag = false;
int i = 1;
for (i; i < s.size() - 1; i++) {
tmp2 = string() + s[i];
if (tmp1 == tmp2) {
++i;
tmp2 += s[i];... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 741,629 | 741,630 | u449758089 | cpp |
p02939 | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define vv(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define vvi std::vector<std::vector<int>>
#define vvl std::vector<std::vector<ll>>
#define MODs 1000000007;
typedef lo... | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define vv(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define vvi std::vector<std::vector<int>>
#define vvl std::vector<std::vector<ll>>
#define MODs 1000000007;
typedef lo... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 741,631 | 741,632 | u816587940 | cpp |
p02939 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(a) (a).begin(), (a).end()
#define ll long long
int main() {
string S, T;
cin >> S;
T = S[S.size() - 1];
rep(i, S.size() - 2) T += S[S.size() - 2 - i];
string SS;
SS = S[0];
int ans = 0, c = 0;
strin... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(a) (a).begin(), (a).end()
#define ll long long
int main() {
string S, T;
cin >> S;
T = S[S.size() - 1];
rep(i, S.size() - 1) T += S[S.size() - 2 - i];
string SS;
SS = S[0];
int ans = 0, c = 0;
strin... | [
"literal.number.change",
"assignment.variable.change",
"call.arguments.change",
"expression.operation.binary.change",
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 741,640 | 741,641 | u154756110 | cpp |
p02939 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
using namespace std;
... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
typedef long long ll;
using namespace std;
... | [
"call.arguments.change"
] | 741,665 | 741,666 | u647592933 | cpp |
p02939 | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
string str;
cin >> str;
int sum = 0, len = str.size();
bool judge = false; //ๆ ่ฎฐๅไธไธชๅญไธฒๆฏๅฆไธบไธคไธชๅญ็ฌฆ๏ผtrueไธบๆฏ
int i;
sum++;
for (i = 1; i < len - 1; i++) {
if (str[i] == str[i - 1] && judge == false) {
judge = true;
... | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
string str;
cin >> str;
int sum = 0, len = str.size();
bool judge = false; //ๆ ่ฎฐๅไธไธชๅญไธฒๆฏๅฆไธบไธคไธชๅญ็ฌฆ๏ผtrueไธบๆฏ
int i;
sum++;
for (i = 1; i < len - 1; i++) {
if (str[i] == str[i - 1] && judge == false) {
judge = true;
... | [
"control_flow.branch.if.condition.change"
] | 741,673 | 741,674 | u286704543 | cpp |
p02939 | /**
* Name: Ajay
* Institute: IIITH
*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#include <vector>
#define ll long long
#define inf 0x7ffff... | /**
* Name: Ajay
* Institute: IIITH
*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#include <vector>
#define ll long long
#define inf 0x7ffff... | [
"call.remove"
] | 741,675 | 741,676 | u139573956 | cpp |
p02939 | #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (long long i = 0; i < n; i++)
#define RREP(i, n) for (long long i = n - 1; 0 <= i; i--)
#define FOR(i, start, end) for (long long i = start; i < end; i++)
#define RFOR(i, start, end) for (... | #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (long long i = 0; i < n; i++)
#define RREP(i, n) for (long long i = n - 1; 0 <= i; i--)
#define FOR(i, start, end) for (long long i = start; i < end; i++)
#define RFOR(i, start, end) for (... | [
"control_flow.branch.if.condition.change"
] | 741,679 | 741,680 | u324303263 | cpp |
p02939 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("in.inp", "r", stdin);
// freopen("ou.out", "w", stdout);
string s;
cin >> s;
int nho = 1;
int kq = 1;
int i = 1;
while (i < s.size()) {
if (nho == 1) {
if (s[i] ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("in.inp", "r", stdin);
// freopen("ou.out", "w", stdout);
string s;
cin >> s;
int nho = 1;
int kq = 1;
int i = 1;
while (i < s.size()) {
if (nho == 1) {
if (s[i] ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 741,681 | 741,682 | u504660719 | cpp |
p02939 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
using namespace std;
#define rg register
#define LL long long
#define __endl putchar('\n')
#define __space putchar(' ')
templ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
using namespace std;
#define rg register
#define LL long long
#define __endl putchar('\n')
#define __space putchar(' ')
templ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 741,687 | 741,688 | u764660839 | cpp |
p02939 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
int c = 0, p = 0, pc = 1, ppc = 0, n = s.size();
for (; p + pc <= n;) {
if (pc == 2) {
p += 2;
c++;
ppc = pc;
pc = 1;
} else {
c++;
ppc = ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
int c = 0, p = 0, pc = 1, ppc = 0, n = s.size();
for (; p + pc <= n;) {
if (pc == 2) {
p += 2;
c++;
ppc = pc;
pc = 1;
} else {
c++;
ppc = ... | [
"control_flow.branch.if.condition.change"
] | 741,692 | 741,693 | u601082779 | cpp |
p02939 | #include <cstdio>
#include <cstring>
using namespace std;
char s[200005];
int main(void) {
int i, n, ans = 1, cnt;
scanf("%s", s);
n = strlen(s);
for (i = 1; i < n;) {
if (s[i] == s[i - 1]) {
if (i + 1 < n) {
i++;
ans++;
if (i + 1 < n) {
i += 2;
ans++;
... | #include <cstdio>
#include <cstring>
using namespace std;
char s[200005];
int main(void) {
int i, n, ans = 1, cnt;
scanf("%s", s);
n = strlen(s);
for (i = 1; i < n;) {
if (s[i] == s[i - 1]) {
if (i + 1 < n) {
i++;
ans++;
if (i + 1 < n) {
i += 2;
ans++;
... | [
"control_flow.branch.else.add"
] | 741,696 | 741,697 | u997390882 | cpp |
p02939 | #include <bits/stdc++.h>
using namespace std;
#define sz(x) ((int)((x).size()))
typedef long long ll;
typedef long double ld;
const int inf = 1 << 25;
string s;
int dp[300000][2];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(10);
cin >> s;
int n = sz(s);
if (... | #include <bits/stdc++.h>
using namespace std;
#define sz(x) ((int)((x).size()))
typedef long long ll;
typedef long double ld;
const int inf = 1 << 25;
string s;
int dp[300000][2];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(10);
cin >> s;
int n = sz(s);
if (... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"misc.opposites",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 741,712 | 741,713 | u395070007 | cpp |
p02939 | #include <bits/stdc++.h>
using namespace std;
string s;
int main() {
cin >> s;
int l = 0;
int bj = 0;
int ans = 0;
while (l < s.size()) {
if (bj == 0) {
l++;
ans++;
bj = 1;
} else {
if (s[l] == s[l - 1]) {
l = l + 2;
if (l >= s.size())
break;
... | #include <bits/stdc++.h>
using namespace std;
string s;
int main() {
cin >> s;
int l = 0;
int bj = 0;
int ans = 0;
while (l < s.size()) {
if (bj == 0) {
l++;
ans++;
bj = 1;
} else {
if (s[l] == s[l - 1]) {
l = l + 2;
if (l > s.size())
break;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 741,714 | 741,715 | u642435852 | cpp |
p02939 | #include <bits/stdc++.h>
using namespace std;
#define MN 200005
char ch[MN];
int f[MN][2];
int main() {
scanf("%s", ch + 1);
int ln = strlen(ch + 1);
f[1][0] = 1;
for (int i = 2; i <= ln; ++i) {
f[i][0] = f[i - 1][1] + 1;
f[i][1] = f[i - 2][0] + 1;
if (ch[i] != ch[i - 1])
f[i][0] = max(f[i][0]... | #include <bits/stdc++.h>
using namespace std;
#define MN 200005
char ch[MN];
int f[MN][2];
int main() {
scanf("%s", ch + 1);
int ln = strlen(ch + 1);
f[1][0] = 1;
for (int i = 2; i <= ln; ++i) {
f[i][0] = f[i - 1][1] + 1;
f[i][1] = f[i - 2][0] + 1;
if (ch[i] != ch[i - 1])
f[i][0] = max(f[i][0]... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 741,723 | 741,724 | u215375907 | cpp |
p02939 | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <time.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define pb push_back
#define rep(i, a... | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <time.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define pb push_back
#define rep(i, a... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 741,725 | 741,726 | u986898382 | cpp |
p02939 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool x = 0;
int sum = s.size();
for (int i = 1; i < s.size(); i++) {
if (x)
x = !x;
if (s[i] == s[i - 1]) {
i++;
sum--;
x = 1;
}
}
cout << sum << '\n';
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool x = 0;
int sum = s.size();
for (int i = 1; i < s.size(); i++) {
if (x) {
x = !x;
continue;
}
if (s[i] == s[i - 1]) {
i++;
sum--;
x = 1;
}
}
cout << sum << '\n';
}
| [] | 741,729 | 741,730 | u166147681 | cpp |
p02939 | /**
๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ Author : Avi J Patel ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ
๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ University : DA-IICT ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ
**/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define mp make_pair
#define mt make_tuple
#define N 100000
#define f... | /**
๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ Author : Avi J Patel ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ
๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ University : DA-IICT ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ๏ฟฝ
**/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define mp make_pair
#define mt make_tuple
#define N 100000
#define f... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change"
] | 741,731 | 741,732 | u589330060 | cpp |
p02939 | #include <cstring>
#include <iostream>
using namespace std;
char c[200003];
int f[200003][3], ans;
int main() {
memset(f, 0xaf, sizeof(f));
cin >> c;
f[1][1] = f[2][2] = 1;
for (int i = 1; c[i]; i++) {
if (c[i - 1] != c[i])
if (f[i][1] < f[i - 1][1] + 1) {
f[i][1] = f[i - 1][1] + 1;
}
... | #include <cstring>
#include <iostream>
using namespace std;
char c[200003];
int f[200003][3], ans = 1;
int main() {
memset(f, 0xaf, sizeof(f));
cin >> c;
f[0][1] = f[1][2] = 1;
for (int i = 1; c[i]; i++) {
if (c[i - 1] != c[i])
if (f[i][1] < f[i - 1][1] + 1) {
f[i][1] = f[i - 1][1] + 1;
... | [
"variable_declaration.value.change",
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 741,736 | 741,737 | u300590099 | cpp |
p02939 | #include <bits/stdc++.h>
#define rep(i, n) REP(i, 0, n)
#define REP(i, l, r) for (int i = l; i < r; ++i)
#define int long long
#ifdef DEBUG
#define dout cout
#else
std::stringstream dout;
#endif
using namespace std;
typedef pair<int, int> P;
// other libs
signed main(int argc, char *argv[]) {
string s;
bool b = fa... | #include <bits/stdc++.h>
#define rep(i, n) REP(i, 0, n)
#define REP(i, l, r) for (int i = l; i < r; ++i)
#define int long long
#ifdef DEBUG
#define dout cout
#else
std::stringstream dout;
#endif
using namespace std;
typedef pair<int, int> P;
// other libs
signed main(int argc, char *argv[]) {
string s;
bool b = fa... | [
"control_flow.branch.if.condition.change"
] | 741,738 | 741,739 | u073057072 | cpp |
p02939 | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define f(i, x, n) for (int i = x; i < n; i++)
#define all(c) c.begin(), c.end()
#define int ll
#define print(x) cerr << (#x) << "is " << x << "\n"
using ll = long long;
using pii = pair<int, int>;
c... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define f(i, x, n) for (int i = x; i < n; i++)
#define all(c) c.begin(), c.end()
#define int ll
#define print(x) cerr << (#x) << "is " << x << "\n"
using ll = long long;
using pii = pair<int, int>;
c... | [
"expression.operation.binary.change",
"assignment.change",
"literal.number.change",
"variable_declaration.value.change"
] | 741,740 | 741,741 | u676247559 | cpp |
p02939 | #include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
string s;
int main(void) {
cin >> s;
int n = s.size();
int cnt = 1;
int len = 1;
for (int i = 2; i < n; i++) {
if (len == 1) {
if (s[i - 1] == s[i]) {
if ((i + 1) != n) {
... | #include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
string s;
int main(void) {
cin >> s;
int n = s.size();
int cnt = 1;
int len = 1;
for (int i = 1; i < n; i++) {
if (len == 1) {
if (s[i - 1] == s[i]) {
if ((i + 1) != n) {
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 741,742 | 741,743 | u854869949 | cpp |
p02939 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
const int maxN = 2 * (int)1e5 + 100;
string s;
const int BUBEN = 5;
int dp[maxN][BUBEN + 2];
int n;
const int INF = 5000000;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
// fr... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
const int maxN = 2 * (int)1e5 + 100;
string s;
const int BUBEN = 5;
int dp[maxN][BUBEN + 2];
int n;
const int INF = 5000000;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
// fr... | [
"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"
] | 741,744 | 741,745 | u720150053 | cpp |
p02939 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep2(i, start, end) for (ll i = start; i < end; i++)
#define dwn(i, n) for (int i = n; i >= 0; i--)
#define dwn2(i, start, end) for (ll i = start; i >= end; i--)
#define pll pair<ll, ll>
#define mk(x,... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep2(i, start, end) for (ll i = start; i < end; i++)
#define dwn(i, n) for (int i = n; i >= 0; i--)
#define dwn2(i, start, end) for (ll i = start; i >= end; i--)
#define pll pair<ll, ll>
#define mk(x,... | [
"literal.number.change",
"call.arguments.change"
] | 741,746 | 741,747 | u624688258 | cpp |
p02939 | #include <bits/stdc++.h>
#include <string.h>
using namespace std;
#define rep(i, s, n) for (int i = s; i < n; i++)
int main() {
int c = 0;
string s, tmp;
cin >> s;
tmp = s.substr(1, 1);
for (int i = 2; i <= s.length(); i++) {
if (i == s.length()) {
c++;
} else if (s.substr(i, 1) != tmp) {
... | #include <bits/stdc++.h>
#include <string.h>
using namespace std;
#define rep(i, s, n) for (int i = s; i < n; i++)
int main() {
int c = 0;
string s, tmp;
cin >> s;
tmp = s.substr(0, 1);
// cout << tmp << " 0"<< endl;
for (int i = 1; i <= s.length(); i++) {
if (i >= s.length()) {
c++;
// ... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 741,754 | 741,755 | u311660576 | cpp |
p02939 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#inc... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#inc... | [] | 741,764 | 741,765 | u158253287 | cpp |
p02939 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MOD 1000000007
#define PI 3.141592653589793
int dx[] = {0, 1, -1, 0, 1, -1, 1, -1};
int dy[] = {1, 0, 0, -1, 1, -1, -1, 1};
int main() {
string s;
cin >> s;
int ans = 0;
int len = 1;
string tmp = "";
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MOD 1000000007
#define PI 3.141592653589793
int dx[] = {0, 1, -1, 0, 1, -1, 1, -1};
int dy[] = {1, 0, 0, -1, 1, -1, -1, 1};
int main() {
string s;
cin >> s;
int ans = 0;
int len = 1;
string tmp = "";
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 741,766 | 741,767 | u874723578 | cpp |
p02939 | //#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define int long long
#define ll long long
#d... | //#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define int long long
#define ll long long
#d... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 741,768 | 741,769 | u072528456 | cpp |
p02939 | //#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define int long long
#define ll long long
#d... | //#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define int long long
#define ll long long
#d... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 741,770 | 741,769 | u072528456 | cpp |
p02939 | #include <bits/stdc++.h>
using namespace std;
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
const ll MOD = 1e9 + 7;
const ll mod = 998244353;
const ll inf = 1 << 30;
const ll LINF = LONG_MAX;
const ll INF = 1LL <<... | #include <bits/stdc++.h>
using namespace std;
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
const ll MOD = 1e9 + 7;
const ll mod = 998244353;
const ll inf = 1 << 30;
const ll LINF = LONG_MAX;
const ll INF = 1LL <<... | [
"control_flow.branch.if.condition.change"
] | 741,773 | 741,774 | u398942100 | cpp |
p02939 | // 1_agc037_a
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#inclu... | // 1_agc037_a
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#inclu... | [
"literal.number.change",
"assignment.value.change"
] | 741,775 | 741,776 | u811561461 | cpp |
p02939 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
template <typename T> using pq = priority_queue<T>;
template <typename T> using minpq = priority_queue<T, vector<T>, greater<T>>;
template <typename T, typename K> using ump = uno... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
template <typename T> using pq = priority_queue<T>;
template <typename T> using minpq = priority_queue<T, vector<T>, greater<T>>;
template <typename T, typename K> using ump = uno... | [] | 741,790 | 741,791 | u136378781 | cpp |
p02939 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 741,792 | 741,793 | u085110627 | cpp |
p02939 | #include <algorithm>
#include <complex>
#include <fstream>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int NMAX = 2 * 1e5 + 2;
string s;
int n, dp[2][NMAX]; // 1 si i est dans une pair et 0 sinon osef du reste
int main() {
... | #include <algorithm>
#include <complex>
#include <fstream>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int NMAX = 2 * 1e5 + 2;
string s;
int n, dp[2][NMAX]; // 1 si i est dans une pair et 0 sinon osef du reste
int main() {
... | [
"literal.number.change",
"assignment.value.change"
] | 741,796 | 741,797 | u558431380 | cpp |
p02939 | #include <bits/stdc++.h>
#define int long long
#define REP(i, l, r) REPEAT(i, l, r, true) // [l, r)
#define rep(i, n) REP(i, 0, n) // [0, n)
#define REPEAT(i, l, r, condition) \
for (int i = (condition) ? l : r - 1; (condition) ? i < r : i >= l; \
... | #include <bits/stdc++.h>
#define int long long
#define REP(i, l, r) REPEAT(i, l, r, true) // [l, r)
#define rep(i, n) REP(i, 0, n) // [0, n)
#define REPEAT(i, l, r, condition) \
for (int i = (condition) ? l : r - 1; (condition) ? i < r : i >= l; \
... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 741,798 | 741,799 | u810724221 | cpp |
p02939 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
char bef;
int ans = 1;
bef = s[0];
for (int i = 1; i < s.size(); i++) {
if (bef == '0') {
ans++;
bef = '... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
char bef;
int ans = 1;
bef = s[0];
for (int i = 1; i < s.size(); i++) {
if (bef == '0') {
ans++;
bef = '... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 741,808 | 741,809 | u990764614 | cpp |
p02940 | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int mod = 998244353;
#define N 300030
inline int read() {
int x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = (x << 1) ... | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int mod = 998244353;
#define N 300030
inline int read() {
int x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = (x << 1) ... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 741,957 | 741,958 | u979500307 | cpp |
p02940 | #include <bits/stdc++.h>
using namespace std;
#pragma region macros_and_aliases
#define rep(i, n) for (long long i = 0; i < (n); i++)
#define rrep(i, n) for (long long i = (n)-1; i > -1; i--)
#define Rep(i, m, n) for (long long i = (m); i < (n); i++)
#define rRep(i, m, n) for (long long i = (n)-1; i >= (m); i--)
#def... | #include <bits/stdc++.h>
using namespace std;
#pragma region macros_and_aliases
#define rep(i, n) for (long long i = 0; i < (n); i++)
#define rrep(i, n) for (long long i = (n)-1; i > -1; i--)
#define Rep(i, m, n) for (long long i = (m); i < (n); i++)
#define rRep(i, m, n) for (long long i = (n)-1; i >= (m); i--)
#def... | [
"call.remove"
] | 741,965 | 741,966 | u513211419 | cpp |
p02940 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 741,980 | 741,981 | u096883693 | cpp |
p02940 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
template <ll mod> struct modular {
ll value;
modular(ll x = 0) {
value = x % mod;
if (value < 0)
value += mod;
}
modular &operator+=(modular other) {
if... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
template <ll mod> struct modular {
ll value;
modular(ll x = 0) {
value = x % mod;
if (value < 0)
value += mod;
}
modular &operator+=(modular other) {
if... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 742,001 | 742,002 | u604231488 | cpp |
p02940 | //#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC
//target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native") #pragme
//GCC target("avx2"); #pragma GCC target("avx,avx2,fma") #pragma GCC
//optimization ("O3") #pragma GCC optimization ("unroll-loops")
//#include <e... | //#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC
//target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native") #pragme
//GCC target("avx2"); #pragma GCC target("avx,avx2,fma") #pragma GCC
//optimization ("O3") #pragma GCC optimization ("unroll-loops")
//#include <e... | [
"identifier.change"
] | 742,005 | 742,006 | u892889246 | cpp |
p02940 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 742,007 | 742,008 | u841131859 | cpp |
p02940 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 998244353;
int main() {
int n;
cin >> n;
string s;
cin >> s;
ll res = 1;
int rcnt = 0;
int bcnt = 0;
int gcnt = 0;
for (int i = 0; i < s.size(); i++) {
char ch = s[i];
// check the different possible orders
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 998244353;
int main() {
int n;
cin >> n;
string s;
cin >> s;
ll res = 1;
int rcnt = 0;
int bcnt = 0;
int gcnt = 0;
for (int i = 0; i < s.size(); i++) {
char ch = s[i];
// check the different possible orders
... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 742,021 | 742,022 | u118325325 | cpp |
p02940 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i, n) for (long long i = 0; i < (n); i++)
#define FOR(i, m, n) for (long long i = (m); i < (n); ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define SPEED ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i, n) for (long long i = 0; i < (n); i++)
#define FOR(i, m, n) for (long long i = (m); i < (n); ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define SPEED ... | [
"identifier.change"
] | 742,023 | 742,024 | u898651494 | cpp |
p02940 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define gsort(x) sort(x, x + n, greater<ll>());
#define sync \
ios_base::sync_w... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define gsort(x) sort(x, x + n, greater<ll>());
#define sync \
ios_base::sync_w... | [
"control_flow.break.add"
] | 742,031 | 742,032 | u808256772 | cpp |
p02940 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define gsort(x) sort(x, x + n, greater<ll>());
#define sync \
ios_base::sync_w... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define gsort(x) sort(x, x + n, greater<ll>());
#define sync \
ios_base::sync_w... | [
"variable_declaration.type.change"
] | 742,033 | 742,032 | u808256772 | cpp |
p02940 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(), (x).end()
const int mod = 998244353, MAX = 100003, INF = 1 << 30;
int main() {
int N;
cin >> N;
string S;
cin >> S;
ll mu = N, B = 0, R = 0, G = 0, BR = 0, RG = 0, GB = 0;
ll ans = 1;
for (int i = 0; i < 3 *... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(), (x).end()
const int mod = 998244353, MAX = 100003, INF = 1 << 30;
int main() {
int N;
cin >> N;
string S;
cin >> S;
ll mu = N, B = 0, R = 0, G = 0, BR = 0, RG = 0, GB = 0;
ll ans = 1;
for (int i = 0; i < 3 *... | [
"assignment.value.change",
"identifier.change"
] | 741,812 | 741,813 | u133391510 | cpp |
p02940 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(), (x).end()
const int mod = 998244353, MAX = 100003, INF = 1 << 30;
int main() {
int N;
cin >> N;
string S;
cin >> S;
int mu = N, B = 0, R = 0, G = 0, BR = 0, RG = 0, GB = 0;
ll ans = 1;
for (int i = 0; i < 3 ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(), (x).end()
const int mod = 998244353, MAX = 100003, INF = 1 << 30;
int main() {
int N;
cin >> N;
string S;
cin >> S;
ll mu = N, B = 0, R = 0, G = 0, BR = 0, RG = 0, GB = 0;
ll ans = 1;
for (int i = 0; i < 3 *... | [
"variable_declaration.type.change",
"assignment.value.change",
"identifier.change"
] | 741,814 | 741,813 | u133391510 | cpp |
p02940 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
using namespace std;
const int N = 100005, mod = 998244353;
int n, ans = 1, RG, GB, RB, R, G, B;
char s[N * 3];
int main() {
scanf("%d%s", &n, s + 1);
for (int i = 1; i <= n * 3; i++) {
if (s[i] == 'R') {
if (GB) {
ans = 1L... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
using namespace std;
const int N = 100005, mod = 998244353;
int n, ans = 1, RG, GB, RB, R, G, B;
char s[N * 3];
int main() {
scanf("%d%s", &n, s + 1);
for (int i = 1; i <= n * 3; i++) {
if (s[i] == 'R') {
if (GB) {
ans = 1L... | [
"expression.unary.arithmetic.add"
] | 741,819 | 741,820 | u159112689 | cpp |
p02940 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
using namespace std;
const int N = 100005, mod = 998244353;
int n, ans = 1, RG, GB, RB, R, G, B;
char s[N];
int main() {
scanf("%d%s", &n, s + 1);
for (int i = 1; i <= n * 3; i++) {
if (s[i] == 'R') {
if (GB) {
ans = 1LL * ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
using namespace std;
const int N = 100005, mod = 998244353;
int n, ans = 1, RG, GB, RB, R, G, B;
char s[N * 3];
int main() {
scanf("%d%s", &n, s + 1);
for (int i = 1; i <= n * 3; i++) {
if (s[i] == 'R') {
if (GB) {
ans = 1L... | [
"expression.unary.arithmetic.add"
] | 741,821 | 741,820 | u159112689 | cpp |
p02940 | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 300005, M = 998244353;
char s[N];
int r, b, g, rb, rg, bg, n, ans = 1;
signed main() {
scanf("%lld", &n);
scanf("%s", s + 1);
for (int i = 1; i <= 3 * n; i++) {
if (s[i] == 'R') {
if (bg) {
(ans *= bg) %= M;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 300005, M = 998244353;
char s[N];
int r, b, g, rb, rg, bg, n, ans = 1;
signed main() {
scanf("%lld", &n);
scanf("%s", s + 1);
for (int i = 1; i <= 3 * n; i++) {
if (s[i] == 'R') {
if (bg) {
(ans *= bg) %= M;
... | [
"identifier.change"
] | 741,839 | 741,840 | u768967683 | cpp |
p02940 | #include <algorithm>
#include <bitset>
#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 998244353
#define REP(i, n) for (ll(i) = 0; (i) < ... | #include <algorithm>
#include <bitset>
#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 998244353
#define REP(i, n) for (ll(i) = 0; (i) < ... | [
"identifier.change"
] | 741,845 | 741,846 | u712993629 | cpp |
p02940 | #include "bits/stdc++.h"
using namespace std;
int main() {
long long N, ANS = 1, RG = 0, GB = 0, BR = 0, R = 0, G = 0, B = 0,
MOD = 998244353;
string S;
cin >> N >> S;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'R') {
if (GB != 0) {
ANS *= GB;
ANS %= MOD;
... | #include "bits/stdc++.h"
using namespace std;
int main() {
long long N, ANS = 1, RG = 0, GB = 0, BR = 0, R = 0, G = 0, B = 0,
MOD = 998244353;
string S;
cin >> N >> S;
for (int i = 0; i < S.size(); i++) {
if (S[i] == 'R') {
if (GB != 0) {
ANS *= GB;
ANS %= MOD;
... | [
"identifier.change"
] | 741,863 | 741,864 | u454087021 | cpp |
p02940 | #include <cstdio>
int n, i, j, b[3], a = 1, P = 998244353;
char c;
int main() {
scanf("%d\n", &n);
for (i = 1; i <= n; ++i)
a = 1ll * a * i % P;
for (i = 1; i <= 3 * n; ++i) {
scanf("%c", &c);
int &t = b[(c > 'B') + (c > 'G')], m = 1e9;
for (j = 0; j < 2; ++j)
if (b[j] > t && b[j] - t < m)
... | #include <cstdio>
int n, i, j, b[3], a = 1, P = 998244353;
char c;
int main() {
scanf("%d\n", &n);
for (i = 1; i <= n; ++i)
a = 1ll * a * i % P;
for (i = 1; i <= 3 * n; ++i) {
scanf("%c", &c);
int &t = b[(c > 'B') + (c > 'G')], m = 1e7;
for (j = 0; j < 3; ++j)
if (b[j] > t && b[j] - t < m)
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 741,884 | 741,885 | u847307867 | cpp |
p02940 | #include <iostream>
#include <vector>
#define llint long long
#define mod 998244353
using namespace std;
llint n;
string s;
int main(void) {
cin >> n >> s;
llint ans = 1;
llint r = 0, g = 0, b = 0, R = 0, G = 0, B = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'R') {
if (R > 0)
ans ... | #include <iostream>
#include <vector>
#define llint long long
#define mod 998244353
using namespace std;
llint n;
string s;
int main(void) {
cin >> n >> s;
llint ans = 1;
llint r = 0, g = 0, b = 0, R = 0, G = 0, B = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'R') {
if (R > 0)
ans ... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 741,886 | 741,887 | u319282133 | cpp |
p02940 | #include "bits/stdc++.h"
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define ll long l... | #include "bits/stdc++.h"
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define ll long l... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 741,896 | 741,897 | u564412651 | cpp |
p02940 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
ll P = 998244353;
template <typename T> class tRMQ {
vector<T> data;
T unit;
public:
static const long long INF = 100000000000;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
ll P = 998244353;
template <typename T> class tRMQ {
vector<T> data;
T unit;
public:
static const long long INF = 100000000000;
... | [
"assignment.value.change",
"identifier.change"
] | 741,900 | 741,901 | u656572785 | cpp |
p02940 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int Mod = 998244353;
int n;
#define Maxn 300010
char str[Maxn];
int fact = 1, Ans = 1;
int a[7]; // empty R G B RG BG RB
int main() {
scanf("%d", &n);
for (register int i = 1; i <= n; ++i)
fact = 1ll * fact ... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int Mod = 998244353;
int n;
#define Maxn 300010
char str[Maxn];
int fact = 1, Ans = 1;
int a[7]; // empty R G B RG BG RB
int main() {
scanf("%d", &n);
for (register int i = 1; i <= n; ++i)
fact = 1ll * fact ... | [
"assignment.change"
] | 741,904 | 741,905 | u299340570 | cpp |
p02940 | /*
ะะะะฃะกะะะะ
โะะฃะกะฏโโโโโโโะ ะะะะขะฏะะฃโโ
โโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโ
*/
#include <algorithm>
#i... | /*
ะะะะฃะกะะะะ
โะะฃะกะฏโโโโโโโะ ะะะะขะฏะะฃโโ
โโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโ
*/
#include <algorithm>
#i... | [
"assignment.change"
] | 741,917 | 741,918 | u139147798 | cpp |
p02940 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#ifdef iq
mt19937 rnd(228);
#else
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
#endif
int main() {
#ifdef iq
freopen("a.in", "r", stdin);
#endif
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
stri... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#ifdef iq
mt19937 rnd(228);
#else
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
#endif
int main() {
#ifdef iq
freopen("a.in", "r", stdin);
#endif
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
stri... | [
"identifier.change"
] | 741,939 | 741,940 | u814534994 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.