problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03069 | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define codefor \
int test; \
scanf("... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define codefor \
int test; \
scanf("... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.add"
] | 879,835 | 879,834 | u225660136 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define brep(n) for (int bit = 0; bit < (1 << n); bit++)
#define erep(i, container) for (auto i : container)
#define irep(i, n) for (int i = n - 1; i >= (int)0; i--)
#define rrep(i, m, n... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define brep(n) for (int bit = 0; bit < (1 << n); bit++)
#define erep(i, container) for (auto i : container)
#define irep(i, n) for (int i = n - 1; i >= (int)0; i--)
#define rrep(i, m, n... | [
"assignment.change"
] | 879,841 | 879,842 | u539011156 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define brep(n) for (int bit = 0; bit < (1 << n); bit++)
#define erep(i, container) for (auto i : container)
#define irep(i, n) for (int i = n - 1; i >= (int)0; i--)
#define rrep(i, m, n... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define brep(n) for (int bit = 0; bit < (1 << n); bit++)
#define erep(i, container) for (auto i : container)
#define irep(i, n) for (int i = n - 1; i >= (int)0; i--)
#define rrep(i, m, n... | [
"assignment.change",
"expression.operation.binary.remove"
] | 879,843 | 879,842 | u539011156 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
string s;
cin >> n >> s;
int cnt_w = 0;
int cnt_b = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '.')
cnt_w++;
if (s[i] == '#')
cnt_b++;
}
if (cnt_w == n || cnt_b == n) {
cout << 0 << endl;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
string s;
cin >> n >> s;
int cnt_w = 0;
int cnt_b = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '.')
cnt_w++;
if (s[i] == '#')
cnt_b++;
}
if (cnt_w == n || cnt_b == n) {
cout << 0 << endl;
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 879,848 | 879,849 | u221391729 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
//#define int long long
// signed main(){
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
string s;
cin >> n >> s;
int w = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '.')
w++;
}... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
//#define int long long
// signed main(){
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
string s;
cin >> n >> s;
int w = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '.')
w++;
... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 879,854 | 879,855 | u568501780 | cpp |
p03069 | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include "bits/stdc++.h"
// Begin Header {{{
using namespace std;
#ifndef DEBUG
#define dump(...)
#endif
#define all(x) x.begin(), x.end()
#define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i)
#defin... | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include "bits/stdc++.h"
// Begin Header {{{
using namespace std;
#ifndef DEBUG
#define dump(...)
#endif
#define all(x) x.begin(), x.end()
#define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i)
#defin... | [
"expression.operation.binary.remove"
] | 879,856 | 879,857 | u671257784 | cpp |
p03069 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespac... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespac... | [
"variable_declaration.remove",
"variable_declaration.value.change",
"identifier.change"
] | 879,858 | 879,859 | u401139594 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
const ll M = 1e9 + 7;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int r = 0;
int l = 0;
bool flag = true;
rep(i, n - 1) if (s[i] != s[i + 1]) flag = false;
if (flag) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
const ll M = 1e9 + 7;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int r = 0;
int l = 0;
bool flag = true;
rep(i, n - 1) if (s[i] != s[i + 1]) flag = false;
if (flag) {
... | [
"control_flow.branch.else.add"
] | 879,860 | 879,861 | u106342872 | cpp |
p03069 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const ll LINF = 1001001001001001;
const int MOD = 1000000007;
template <typename T> void print(const T &v);
int main() {
int n;
string s;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const ll LINF = 1001001001001001;
const int MOD = 1000000007;
template <typename T> void print(const T &v);
int main() {
int n;
string s;
... | [
"assignment.change"
] | 879,868 | 879,869 | u286623856 | cpp |
p03069 | using namespace std;
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
int N;
string s;
int w[200005], b[200005];
int main() {
cin >> N;
cin >> s;
int white = 0;
rep(i, N) {
if (s[i] == '.')
white++;
}
int cnt = min(white, N -... | using namespace std;
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
int N;
string s;
int w[200005], b[200005];
int main() {
cin >> N;
cin >> s;
int white = 0;
rep(i, N) {
if (s[i] == '.')
white++;
}
int cnt = min(white, N -... | [
"literal.string.change",
"assignment.value.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove",
"assignment.change"
] | 879,872 | 879,873 | u288087195 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const long long INF = 1e15;
int main() {
int n;
string s;
cin >> n >> s;
vector<int> w(n, 0), b(n, 0);
int now = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '#')
now++;
b[i] = now;
}
now = 0;
fo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const long long INF = 1e15;
int main() {
int n;
string s;
cin >> n >> s;
vector<int> w(n, 0), b(n, 0);
int now = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '#')
now++;
b[i] = now;
}
now = 0;
fo... | [
"expression.operation.binary.add"
] | 879,874 | 879,875 | u191484928 | cpp |
p03069 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }
using P = pair<int, int>;
template <class T> bool chmax... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }
using P = pair<int, int>;
template <class T> bool chmax... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.add"
] | 879,878 | 879,879 | u937618939 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
int main() {
int N;
string S;
cin >> N >> S;
ll ans = 1e10;
vector<ll> wa(N + 1);
wa[0] = 0;
for (int i = 1; i <= N; i++) {
wa[i] = wa[i - 1];
if (S[i ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
int main() {
int N;
string S;
cin >> N >> S;
ll ans = 1e10;
vector<ll> wa(N + 1);
wa[0] = 0;
for (int i = 1; i <= N; i++) {
wa[i] = wa[i - 1];
if (S[i ... | [
"call.add",
"call.arguments.add"
] | 879,887 | 879,888 | u893239355 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
int main() {
int N;
string S;
cin >> N >> S;
ll ans = 1e10;
vector<ll> wa(N + 1);
wa[0] = 0;
for (int i = 1; i <= N; i++) {
wa[i] = wa[i - 1];
if (S[i ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
int main() {
int N;
string S;
cin >> N >> S;
ll ans = 1e10;
vector<ll> wa(N + 1);
wa[0] = 0;
for (int i = 1; i <= N; i++) {
wa[i] = wa[i - 1];
if (S[i ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"call.add",
"call.arguments.add"
] | 879,889 | 879,888 | u893239355 | cpp |
p03069 | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (ll)n; ++i)
#define repr(i, n) for (int i = n - 1; i >= 0; --i)
#define INF 10e7
#define MOD 1000000000 + 7
#define MAX 51000
#define all(x) (x).begin(), (x).end()
#define MX(x) *max_element(all(x))
#define MN(x) *min_element(all(x))... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (ll)n; ++i)
#define repr(i, n) for (int i = n - 1; i >= 0; --i)
#define INF 10e7
#define MOD 1000000000 + 7
#define MAX 51000
#define all(x) (x).begin(), (x).end()
#define MX(x) *max_element(all(x))
#define MN(x) *min_element(all(x))... | [
"identifier.change",
"call.function.change"
] | 879,890 | 879,891 | u110044127 | cpp |
p03069 |
// Problem : C - Stones
// Contest : AtCoder - Tenka1 Programmer Beginner Contest 2019
// URL : https://atcoder.jp/contests/tenka1-2019-beginner/tasks/tenka1_2019_c
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
/*⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⣠⣶⡾⠏⠉⠙⠳⢦⡀... |
// Problem : C - Stones
// Contest : AtCoder - Tenka1 Programmer Beginner Contest 2019
// URL : https://atcoder.jp/contests/tenka1-2019-beginner/tasks/tenka1_2019_c
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
/*⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⣠⣶⡾⠏⠉⠙⠳⢦⡀... | [
"assignment.change",
"expression.operation.binary.remove"
] | 879,897 | 879,898 | u197541395 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define mp make_pair
#define endl "\n"
#define vi vector<int>
#define vc vector<char>
#define vll vector<ll>
#define pi pair<int, int>
const int MOD = 1e9 + 7;
const ll inf = 1e18;
int main() {
int n;
cin >> n;
vc a(n);
vi ... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define mp make_pair
#define endl "\n"
#define vi vector<int>
#define vc vector<char>
#define vll vector<ll>
#define pi pair<int, int>
const int MOD = 1e9 + 7;
const ll inf = 1e18;
int main() {
int n;
cin >> n;
vc a(n);
vi ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 879,899 | 879,900 | u507638984 | cpp |
p03069 | #pragma region header
#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++)
#define rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for (int i = (int)(n); i > 0; i--)
#define pb push_back
#define all... | #pragma region header
#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++)
#define rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for (int i = (int)(n); i > 0; i--)
#define pb push_back
#define all... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 879,903 | 879,904 | u608773191 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int minC = 1000000;
vector<int> wsum(n + 1, 0);
vector<int> bsum(n + 1, 0);
for (int i = 1; i <= n; i++) {
if (s[i - 1] == '.') {
wsum[i] = wsum[i - 1] + 1;
bsum[i] = bsum[i - 1];
} else {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int minC = 1000000;
vector<int> wsum(n + 1, 0);
vector<int> bsum(n + 1, 0);
for (int i = 1; i <= n; i++) {
if (s[i - 1] == '.') {
wsum[i] = wsum[i - 1] + 1;
bsum[i] = bsum[i - 1];
} else {
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 879,905 | 879,906 | u540491484 | cpp |
p03069 | #include <algorithm>
#include <cfenv>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#i... | #include <algorithm>
#include <cfenv>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#i... | [] | 879,913 | 879,914 | u553461888 | cpp |
p03069 | // includes
#include "bits/stdc++.h"
using namespace std;
// macros
#define ll long long
#define MOD 1000000007 // 998244353 //100000000 //
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for (ll i = 0; i < n; ... | // includes
#include "bits/stdc++.h"
using namespace std;
// macros
#define ll long long
#define MOD 1000000007 // 998244353 //100000000 //
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for (ll i = 0; i < n; ... | [
"expression.operation.binary.remove"
] | 879,924 | 879,925 | u448570453 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int ans = 1 << 30;
string S;
cin >> N >> S;
vector<int> white(N + 1, 0);
vector<int> black(N + 1, 0);
for (int i = 0; i < N; ++i) {
white[i + 1] = white[i] + (S[i] == '.' ? 1 : 0);
black[i + 1] = black[i] + (S[i] == '#' ? 1 : 0);... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int ans = 1 << 30;
string S;
cin >> N >> S;
vector<int> white(N + 1, 0);
vector<int> black(N + 1, 0);
for (int i = 0; i < N; ++i) {
white[i + 1] = white[i] + (S[i] == '.' ? 1 : 0);
black[i + 1] = black[i] + (S[i] == '#' ? 1 : 0);... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 879,928 | 879,929 | u843292252 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = (0); i < (n); ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define DEBUG(val) cout << #val << " : " << val << endl
#define MOD 1000000007
int main() {
int n;
st... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = (0); i < (n); ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define DEBUG(val) cout << #val << " : " << val << endl
#define MOD 1000000007
int main() {
int n;
st... | [
"assignment.change"
] | 879,932 | 879,933 | u947517859 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repo(i, n) for (int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repo(i, n) for (int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define... | [
"expression.operation.binary.add"
] | 879,936 | 879,937 | u604329931 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
const int N = 2e5 + 23;
int a[N], b[N];
void solve() {
int n;
scanf("%d", &n);
f... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
const int N = 2e5 + 23;
int a[N], b[N];
void solve() {
int n;
scanf("%d", &n);
f... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.change"
] | 879,953 | 879,954 | u953463534 | cpp |
p03069 | #include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 200000;
ll N, ans = 10000000000, tmp = 0;
vector<ll> A, B;
string S;
signed main() {
cin >> N >> S;
A.resize(N + 1);
B.resize(N + 1);
A[0] = 0;
B[N] = 0;
for (int i = 1; i <= N; i++) {
if (S[i] ==... | #include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 200000;
ll N, ans = 10000000000, tmp = 0;
vector<ll> A, B;
string S;
signed main() {
cin >> N >> S;
A.resize(N + 1);
B.resize(N + 1);
A[0] = 0;
B[N] = 0;
for (int i = 1; i <= N; i++) {
if (S[i - 1... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 879,967 | 879,968 | u132452589 | cpp |
p03069 | #include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 200000;
ll N, ans = 10000000000, tmp = 0;
vector<ll> A, B;
string S;
signed main() {
cin >> N >> S;
A.resize(N + 1);
B.resize(N + 1);
A[0] = 0;
B[N] = 0;
for (int i = 1; i <= N; i++) {
if (S[i] ==... | #include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 200000;
ll N, ans = 10000000000, tmp = 0;
vector<ll> A, B;
string S;
signed main() {
cin >> N >> S;
A.resize(N + 1);
B.resize(N + 1);
A[0] = 0;
B[N] = 0;
for (int i = 1; i <= N; i++) {
if (S[i - 1... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"control_flow.loop.for.initializer.change"
] | 879,969 | 879,968 | u132452589 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MOD = 1000000007;
const long double PI = 3.14159265358979;
const ll MAX = 200020;
int main() {
string s;
ll N;
cin >> N >> s;
ll ans = MAX, cnt = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '.') {
cnt++;
}
}
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MOD = 1000000007;
const long double PI = 3.14159265358979;
const ll MAX = 200020;
int main() {
string s;
ll N;
cin >> N >> s;
ll ans = MAX, cnt = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '.') {
cnt++;
}
}
... | [
"assignment.add"
] | 879,987 | 879,988 | u102070373 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define mod 1000000007
typedef long long ll;
int main() {
int n;
cin >> n;
string str;
cin >> str;
deque<char> que;
rep(i, n) { que.push_back(str[i]); }
while (!que.empty()... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define mod 1000000007
typedef long long ll;
int main() {
int n;
cin >> n;
string str;
cin >> str;
deque<char> que;
rep(i, n) { que.push_back(str[i]); }
while (!que.empty()... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 879,994 | 879,995 | u509420256 | cpp |
p03069 | /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
#include <bits/stdc++.h>
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#define f(i, n) for (int i = 0; i < (n); i++)
#define inf (int)(3e18)
// here!!!
// def... | /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
#include <bits/stdc++.h>
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#define f(i, n) for (int i = 0; i < (n); i++)
#define inf (int)(3e18)
// here!!!
// def... | [
"expression.operation.binary.add"
] | 879,996 | 879,997 | u943070796 | cpp |
p03069 | #include "bits/stdc++.h"
using namespace std;
struct Solver {
void solve() {
int N;
string S;
cin >> N >> S;
vector<int> b(N + 1), w(N + 1);
for (int i = 0; i < N; ++i) {
b[i + 1] = b[i] + (S[i] == '#');
w[i + 1] = w[i] + (S[i] == '.');
}
int ans = INT_MAX;
for (int i = ... | #include "bits/stdc++.h"
using namespace std;
struct Solver {
void solve() {
int N;
string S;
cin >> N >> S;
vector<int> b(N + 1), w(N + 1);
for (int i = 0; i < N; ++i) {
b[i + 1] = b[i] + (S[i] == '#');
w[i + 1] = w[i] + (S[i] == '.');
}
int ans = INT_MAX;
for (int i = ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 879,998 | 879,999 | u842596864 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = a; i < (int)b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = a; i < (int)b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) ... | [] | 880,002 | 880,003 | u809665051 | cpp |
p03069 | #include <algorithm>
#include <cstdint>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, s, t) for (int i ... | #include <algorithm>
#include <cstdint>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, s, t) for (int i ... | [
"expression.operation.binary.add"
] | 880,004 | 880,005 | u951479148 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int num_b, num_w, w_all;
num_b = 0;
num_w = 0;
w_all = 0;
for (int i = 0; i < n; ++i) {
if (s[i] == '.') {
w_all++;
}
}
int ans = 1000000000;
for (int i = 0; i < n; ++i) {
int cal =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int num_b, num_w, w_all;
num_b = 0;
num_w = 0;
w_all = 0;
for (int i = 0; i < n; ++i) {
if (s[i] == '.') {
w_all++;
}
}
int ans = w_all;
for (int i = 0; i < n; ++i) {
int cal = 0;
... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 880,006 | 880,007 | u144029820 | cpp |
p03069 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
typedef unsign... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
typedef unsign... | [
"expression.operation.binary.remove"
] | 880,010 | 880,011 | u721082205 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1ll << 60;
int main(int argc, char **argv) {
int n;
cin >> n;
string str;
cin >> str;
vector<ll> white_sum(n + 1, 0), black_sum(n + 1, 0);
for (int i = 0; i < n; ++i) {
white_sum[i + 1] = white_sum[i] + (str[i] == '#' ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1ll << 60;
int main(int argc, char **argv) {
int n;
cin >> n;
string str;
cin >> str;
vector<ll> white_sum(n + 1, 0), black_sum(n + 1, 0);
for (int i = 0; i < n; ++i) {
black_sum[i + 1] = black_sum[i] + (str[i] == '#' ... | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one"
] | 880,014 | 880,015 | u350072791 | cpp |
p03069 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define yes c... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define yes c... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 880,018 | 880,019 | u424602097 | cpp |
p03069 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
template <cl... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
template <cl... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 880,039 | 880,040 | u440312135 | cpp |
p03069 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int sum[n];
sum[0] = 0;
for (int i = 1; i <= n; i++) {
sum[i] = sum[i - 1] + (s[i - 1] == '.');
}
int ans = n;
for (int i... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int sum[n + 1];
sum[0] = 0;
for (int i = 1; i <= n; i++) {
sum[i] = sum[i - 1] + (s[i - 1] == '.');
}
int ans = n;
for (i... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 880,043 | 880,044 | u724012411 | cpp |
p03069 | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
int N;
string S;
cin >> N >> S;
int sumw = count(ALL(S), '.');
int ans = 1 << 30, b = 0, w = 0;
REP(i, 0, N) {
if (... | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
int N;
string S;
cin >> N >> S;
int sumw = count(ALL(S), '.');
int ans = sumw, b = 0, w = 0;
REP(i, 0, N) {
if (S[i... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 880,045 | 880,046 | u483992368 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
string S;
cin >> N >> S;
int w = 0, b = 0;
for (int i = 0; i < N; i++) {
if (S[i] == '.')
w++;
}
int res = 1 << 28;
for (int i = 0; i < N; i++) {
if (S[i] == '.')
w--;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
string S;
cin >> N >> S;
int w = 0, b = 0;
for (int i = 0; i < N; i++) {
if (S[i] == '.')
w++;
}
int res = w + b;
for (int i = 0; i < N; i++) {
if (S[i] == '.')
w--;
i... | [] | 880,049 | 880,050 | u782098901 | cpp |
p03069 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
using ll = unsigned long long;
int main() {
int n;
string s;
cin >> n >> s;
// 左にある黒
vector<int> black(s.size() + 2, 0);
// 右にある白
vector<int> white(s.size(... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
using ll = unsigned long long;
int main() {
int n;
string s;
cin >> n >> s;
// 左にある黒
vector<int> black(s.size() + 2, 0);
// 右にある白
vector<int> white(s.size(... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 880,053 | 880,054 | u231458241 | cpp |
p03069 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int l = 0, r = 0;
rep(i, n) {
if (s[i] == '.') {
r++;
}
}
int ans = 1e8;
rep(i, n) {
if (s[i] == '.') {
r--;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int l = 0, r = 0;
rep(i, n) {
if (s[i] == '.') {
r++;
}
}
int ans = l + r;
rep(i, n) {
if (s[i] == '.') {
r--;... | [
"identifier.replace.add",
"literal.replace.remove"
] | 880,082 | 880,083 | u142082997 | cpp |
p03069 | // confilm 0LL and 1LL
// confilm cornercases such as 0
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecVec = vector<Vec>;
#define REP(i, m, n) for (ll(i) = (m); (i)... | // confilm 0LL and 1LL
// confilm cornercases such as 0
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecVec = vector<Vec>;
#define REP(i, m, n) for (ll(i) = (m); (i)... | [
"expression.operation.binary.remove"
] | 880,088 | 880,089 | u997368585 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
#define INF 1000007
#define MOD 1000000007
#define maxn 100
#define int long long int
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b)... | #include <bits/stdc++.h>
using namespace std;
#define INF 1000007
#define MOD 1000000007
#define maxn 100
#define int long long int
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b)... | [
"expression.operation.binary.remove"
] | 880,090 | 880,091 | u568545273 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int out = 0;
int count = 0;
for (int i = 0; i < s.size(); i++) {
if (i == 0) {
for (int j = 0; j < s.size(); j++) {
if (s.at(j) == '.')
count++;
out = count;
}
} e... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int out = 0;
int count = 0;
for (int i = 0; i < s.size(); i++) {
if (i == 0) {
for (int j = 0; j < s.size(); j++) {
if (s.at(j) == '.')
count++;
out = count;
}
} e... | [] | 880,096 | 880,097 | u431602218 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, num = 0, ans;
string s;
cin >> n >> s;
int siro[n + 1], kuro[n + 1];
siro[0] = 0;
kuro[n] = 0;
ans = n;
for (int i = 0; i < n; ++i) {
if (s[i + 1] == '#')
num++;
siro[i + 1] = num;
}
num = 0;
for (int i = n - 1; i >= ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, num = 0, ans;
string s;
cin >> n >> s;
int siro[n + 1], kuro[n + 1];
siro[0] = 0;
kuro[n] = 0;
ans = n;
for (int i = 1; i <= n; ++i) {
if (s[i - 1] == '#')
num++;
siro[i] = num;
}
num = 0;
for (int i = n - 1; i >= 0; ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.arithmetic.c... | 880,127 | 880,128 | u021083776 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, num = 0, ans;
string s;
cin >> n >> s;
int siro[n + 1], kuro[n + 1];
siro[0] = 0;
kuro[n] = 0;
ans = n;
for (int i = 1; i <= n; ++i) {
if (s[i] == '#')
num++;
siro[i] = num;
}
num = 0;
for (int i = n - 1; i >= 0; --i)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, num = 0, ans;
string s;
cin >> n >> s;
int siro[n + 1], kuro[n + 1];
siro[0] = 0;
kuro[n] = 0;
ans = n;
for (int i = 1; i <= n; ++i) {
if (s[i - 1] == '#')
num++;
siro[i] = num;
}
num = 0;
for (int i = n - 1; i >= 0; ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 880,129 | 880,128 | u021083776 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define countof(array) (sizeof(array) / sizeof(array[0]))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, n, s) for (int i = s; i < (n); ++i)
#define rsrep(i, n, s) for (i... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define countof(array) (sizeof(array) / sizeof(array[0]))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, n, s) for (int i = s; i < (n); ++i)
#define rsrep(i, n, s) for (i... | [] | 880,135 | 880,136 | u365512540 | cpp |
p03069 | #include <algorithm>
#include <cassert>
#include <cfenv>
#include <cmath>
#include <functional>
#include <iostream>
#include <vector>
using ll = unsigned long long;
using namespace std;
int gcd(int x, int y) {
if (y == 0) {
return x;
} else {
return gcd(y, x % y);
}
}
int lcm(int x, int y) { return x / gc... | #include <algorithm>
#include <cassert>
#include <cfenv>
#include <cmath>
#include <functional>
#include <iostream>
#include <vector>
using ll = unsigned long long;
using namespace std;
int gcd(int x, int y) {
if (y == 0) {
return x;
} else {
return gcd(y, x % y);
}
}
int lcm(int x, int y) { return x / gc... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 880,139 | 880,140 | u759162415 | cpp |
p03069 | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
// hamko utils
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define repi(i, a, b) \
for (long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define... | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
// hamko utils
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define repi(i, a, b) \
for (long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define... | [
"assignment.add"
] | 880,141 | 880,142 | u142878260 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define MOD 1000000007
#define INF (1 << 30)
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define rep(i, n) REP(i, 0, n)
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
string s;
cin ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define MOD 1000000007
#define INF (1 << 30)
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define rep(i, n) REP(i, 0, n)
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
string s;
cin ... | [
"variable_declaration.name.change",
"identifier.change",
"assignment.change"
] | 880,149 | 880,150 | u539199630 | cpp |
p03069 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using TP = tuple<ll, ll, ll>... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using TP = tuple<ll, ll, ll>... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 880,159 | 880,160 | u432194969 | cpp |
p03069 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define print(s) cout << s << endl
#define acc(v) accumulate(v.begin(), v.end(), 0)
#define cinv(n, v) rep(i, n) cin >> v[i]
using namespace std;
const int INF = 1e9;
typedef l... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define print(s) cout << s << endl
#define acc(v) accumulate(v.begin(), v.end(), 0)
#define cinv(n, v) rep(i, n) cin >> v[i]
using namespace std;
const int INF = 1e9;
typedef l... | [
"variable_declaration.value.change",
"identifier.change"
] | 880,165 | 880,166 | u130834452 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define each(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define all(v)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define each(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define all(v)... | [
"variable_declaration.value.change",
"identifier.change"
] | 880,167 | 880,168 | u569778242 | cpp |
p03069 | #include <algorithm>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long N;
cin >> N;
string S;
cin >> S;
long long ans = N + 1;
long long *white = new long long[N];
long long *black = new long long[N];
white[0] = 0;
black[0] = 0;
... | #include <algorithm>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long N;
cin >> N;
string S;
cin >> S;
long long ans = N + 1;
long long *white = new long long[N];
long long *black = new long long[N];
white[0] = 0;
black[0] = 0;
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 880,227 | 880,228 | u375879613 | cpp |
p03069 | #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.operation.binary.add"
] | 880,237 | 880,238 | u102602414 | cpp |
p03069 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
vector<int> whitinng(n + 1);
vector<int> blacking(n + 1);
whitinng[0] = 0;
for (int i = 1; i < s.size() + 1; i++) {
whitinng[i] = whitinng[i - 1];
if (s[i] == '#')
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
vector<int> whitinng(n + 1);
vector<int> blacking(n + 1);
whitinng[0] = 0;
for (int i = 1; i < s.size() + 1; i++) {
whitinng[i] = whitinng[i - 1];
if (s[i - 1] == '#')
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 880,245 | 880,246 | u735008991 | cpp |
p03069 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <tupl... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <tupl... | [
"assignment.value.change",
"identifier.change"
] | 880,257 | 880,258 | u574045761 | cpp |
p03069 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
#define fore(i, a) for (auto &i : a)
#define REP(i, n) for (int i = 0; i... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
#define fore(i, a) for (auto &i : a)
#define REP(i, n) for (int i = 0; i... | [
"assignment.change"
] | 880,263 | 880,264 | u266643907 | cpp |
p03069 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 1000000000
#define LLINF 2000000000000000
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define LOOP(i, N) for (int i = 0; i < N; i++)
#define LOOP1(i, N) for (... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 1000000000
#define LLINF 2000000000000000
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define LOOP(i, N) for (int i = 0; i < N; i++)
#define LOOP1(i, N) for (... | [
"assignment.add",
"expression.operation.binary.remove"
] | 880,269 | 880,270 | u118951811 | cpp |
p03069 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 1000000000
#define LLINF 2000000000000000
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define LOOP(i, N) for (int i = 0; i < N; i++)
#define LOOP1(i, N) for (... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 1000000000
#define LLINF 2000000000000000
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define LOOP(i, N) for (int i = 0; i < N; i++)
#define LOOP1(i, N) for (... | [
"assignment.add"
] | 880,271 | 880,270 | u118951811 | cpp |
p03069 | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int n, i, ans = 200010;
int black_left[200010];
int white_right[200010];
char stone[200010];
int main() {
cin >> n;
scanf("%s", stone);
if (stone[0] == '#')
black_left[0] = 1;
else
black_left[0] = 0;
if (stone[n - 1] == '... | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int n, i, ans = 200010;
int black_left[200010];
int white_right[200010];
char stone[200010];
int main() {
cin >> n;
scanf("%s", stone);
if (stone[0] == '#')
black_left[0] = 1;
else
black_left[0] = 0;
if (stone[n - 1] == '... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"assignment.change"
] | 880,276 | 880,277 | u575178129 | cpp |
p03069 | #include <bits/stdc++.h>
#define ipair pair<int, int>
#define rep(i, n) for (i = 0; i < n; i++)
#define repj(i, j, n) for (i = j; i < n; i++)
#define PB(a, i) (a).push_back(i)
#define ALL(a) (a).begin(), (a).end()
#define SIZE(a, n) (a).resize(n)
#define OK(i) cout << "OK " << i << endl
#define Yes cout << "Yes" << ... | #include <bits/stdc++.h>
#define ipair pair<int, int>
#define rep(i, n) for (i = 0; i < n; i++)
#define repj(i, j, n) for (i = j; i < n; i++)
#define PB(a, i) (a).push_back(i)
#define ALL(a) (a).begin(), (a).end()
#define SIZE(a, n) (a).resize(n)
#define OK(i) cout << "OK " << i << endl
#define Yes cout << "Yes" << ... | [
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 880,283 | 880,284 | u274055316 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, white, ans;
cin >> N;
vector<long long> V(N);
char c;
cin >> c;
if (c == '.')
V[0] = 1;
for (long long i = 1; i < N; i++) {
cin >> c;
if (c == '.')
V[i] = V[i - 1] + 1;
else
V[i] = V[i - 1];
}
white = V... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, white, ans;
cin >> N;
vector<long long> V(N);
char c;
cin >> c;
if (c == '.')
V[0] = 1;
for (long long i = 1; i < N; i++) {
cin >> c;
if (c == '.')
V[i] = V[i - 1] + 1;
else
V[i] = V[i - 1];
}
white = V... | [
"call.remove",
"call.arguments.change"
] | 880,297 | 880,298 | u501643136 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
int n, cnt1[220000], cnt2[220000], ans = 1e9;
string s;
int main() {
cin >> n >> s;
for (int i = 0; i < s.size(); i++) {
if (i == 0) {
cnt1[i] = (s[i] == '.');
cnt2[i] = (s[i] == '#');
} else {
cnt1[i] = cnt1[i - 1] + (s[i] == '.');
cnt2[... | #include <bits/stdc++.h>
using namespace std;
int n, cnt1[220000], cnt2[220000], ans = 1e9;
string s;
int main() {
cin >> n >> s;
for (int i = 0; i < s.size(); i++) {
if (i == 0) {
cnt1[i] = (s[i] == '.');
cnt2[i] = (s[i] == '#');
} else {
cnt1[i] = cnt1[i - 1] + (s[i] == '.');
cnt2[... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 880,305 | 880,306 | u386107860 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
int n, cnt1[220000], cnt2[220000], ans = 1e9;
string s;
int main() {
cin >> n >> s;
for (int i = 0; i < s.size(); i++) {
if (i == 0) {
cnt1[i] = (s[i] == '.');
cnt2[i] = (s[i] == '#');
} else {
cnt1[i] = cnt1[i - 1] + (s[i] == '.');
cnt2[... | #include <bits/stdc++.h>
using namespace std;
int n, cnt1[220000], cnt2[220000], ans = 1e9;
string s;
int main() {
cin >> n >> s;
for (int i = 0; i < s.size(); i++) {
if (i == 0) {
cnt1[i] = (s[i] == '.');
cnt2[i] = (s[i] == '#');
} else {
cnt1[i] = cnt1[i - 1] + (s[i] == '.');
cnt2[... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"assignment.change"
] | 880,307 | 880,306 | u386107860 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
int n, cnt1[220000], cnt2[220000], ans = 1e9;
string s;
int main() {
cin >> n >> s;
for (int i = 0; i < s.size(); i++) {
if (i == 0) {
cnt1[i] = (s[i] == '.');
cnt2[i] = (s[i] == '#');
} else {
cnt1[i] = cnt1[i - 1] + (s[i] == '.');
cnt2[... | #include <bits/stdc++.h>
using namespace std;
int n, cnt1[220000], cnt2[220000], ans = 1e9;
string s;
int main() {
cin >> n >> s;
for (int i = 0; i < s.size(); i++) {
if (i == 0) {
cnt1[i] = (s[i] == '.');
cnt2[i] = (s[i] == '#');
} else {
cnt1[i] = cnt1[i - 1] + (s[i] == '.');
cnt2[... | [
"assignment.change"
] | 880,308 | 880,306 | u386107860 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
#define MP make_pair
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORR(x, arr) for (auto &x : arr)
#define VI vector<int>
#define PII pair<int, int>
#define FI first
#define SE se... | #include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
#define MP make_pair
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORR(x, arr) for (auto &x : arr)
#define VI vector<int>
#define PII pair<int, int>
#define FI first
#define SE se... | [
"identifier.change",
"expression.operation.binary.change"
] | 880,311 | 880,312 | u297590902 | cpp |
p03069 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
long long n;
string s;
cin >> n;
cin >> s;
long long ans[n + 1];
for (long long i = 0; i < n + 1; i++)
ans[i] = 0;
for (long long i = 0; i < n; i++) {
if (s[i] == '.')
ans[0]+... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
long long n;
string s;
cin >> n;
cin >> s;
long long ans[n + 1];
for (long long i = 0; i < n + 1; i++)
ans[i] = 0;
for (long long i = 0; i < n; i++) {
if (s[i] == '.')
ans[0]+... | [
"expression.operation.binary.add"
] | 880,317 | 880,318 | u461415203 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> mp;
#define inf 1e9
int main() {
int n;
cin >> n;
string s;
cin >> s;
vector<mp> a;
int p;
int cnt = 1;
if (s[0] == '#')
p = 0;
else
p = 1;
int res = inf;
int b = 0;
int w = 0;
for (int i = 1... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> mp;
#define inf 1e9
int main() {
int n;
cin >> n;
string s;
cin >> s;
vector<mp> a;
int p;
int cnt = 1;
if (s[0] == '#')
p = 0;
else
p = 1;
int res = inf;
int b = 0;
int w = 0;
for (int i = 0... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 880,319 | 880,320 | u410943667 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> mp;
#define inf 1e9
int main() {
int n;
cin >> n;
string s;
cin >> s;
vector<mp> a;
int p;
int cnt = 1;
if (s[0] == '#')
p = 0;
else
p = 1;
int res = inf;
int b = 0;
int w = 0;
for (int i = 1... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> mp;
#define inf 1e9
int main() {
int n;
cin >> n;
string s;
cin >> s;
vector<mp> a;
int p;
int cnt = 1;
if (s[0] == '#')
p = 0;
else
p = 1;
int res = inf;
int b = 0;
int w = 0;
for (int i = 0... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 880,321 | 880,320 | u410943667 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define MOD 1000000007
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define MOD 1000000007
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) ... | [
"assignment.change"
] | 880,338 | 880,339 | u888717396 | cpp |
p03069 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define min(a, b) ((a) < (b) ? (a) : (b))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define RE... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define min(a, b) ((a) < (b) ? (a) : (b))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define RE... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 880,350 | 880,351 | u055303078 | cpp |
p03069 | #include <array>
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define RFOR(i, a, b) for (int i = (a); i >= (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = (n); i > 0; --i)
#define CI cin >>
#define CO cout <<
#define EN << endl
#define all(x) (... | #include <array>
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define RFOR(i, a, b) for (int i = (a); i >= (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = (n); i > 0; --i)
#define CI cin >>
#define CO cout <<
#define EN << endl
#define all(x) (... | [
"identifier.change"
] | 880,354 | 880,355 | u165567408 | cpp |
p03069 | #include <array>
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define RFOR(i, a, b) for (int i = (a); i >= (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = (n); i > 0; --i)
#define CI cin >>
#define CO cout <<
#define EN << endl
#define all(x) (... | #include <array>
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define RFOR(i, a, b) for (int i = (a); i >= (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = (n); i > 0; --i)
#define CI cin >>
#define CO cout <<
#define EN << endl
#define all(x) (... | [
"variable_declaration.remove"
] | 880,356 | 880,357 | u165567408 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll amari = 1e9 + 7;
#define ben(a) a.begin(), a.end()
#define pb(a, b) a.push_back(b)
int main() {
int n;
string s;
cin >> n >> s;
int w[n];
int b[n];
b[0] = 0;
for (int i = 1; i < n; i++) {
if (s[i] == '#')
b[i] = b[i -... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll amari = 1e9 + 7;
#define ben(a) a.begin(), a.end()
#define pb(a, b) a.push_back(b)
int main() {
int n;
string s;
cin >> n >> s;
int w[n];
int b[n];
b[0] = 0;
for (int i = 1; i < n; i++) {
if (s[i - 1] == '#')
b[i] = b... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 880,358 | 880,359 | u452544900 | cpp |
p03069 | #include <cstring>
#include <iostream>
using namespace std;
int cntw[500000], cntb[500000];
int main() {
int n;
cin >> n;
char s[500000];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
memset(cntw, 0, sizeof(cntw));
memset(cntb, 0, sizeof(cntb));
for (int i = 0; i < n; i++) {
if (s[i] == '.') {
... | #include <cstring>
#include <iostream>
using namespace std;
int cntw[500000], cntb[500000];
int main() {
int n;
cin >> n;
char s[500000];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
memset(cntw, 0, sizeof(cntw));
memset(cntb, 0, sizeof(cntb));
for (int i = 0; i < n; i++) {
if (s[i] == '.') {
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 880,377 | 880,378 | u261868146 | cpp |
p03069 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int b = 0, w = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '.')
w++;
}
int ans = 1e9;
for (int i = 0; i < n; i++) {
if (s[i] == '#')
b++;
if (s[i] == '.')
w--;
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int b = 0, w = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '.')
w++;
}
int ans = w;
for (int i = 0; i < n; i++) {
if (s[i] == '#')
b++;
if (s[i] == '.')
w--;
... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 880,383 | 880,384 | u127194462 | cpp |
p03069 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define P pair<int, int>
#define MOD 1000000007
#define INF 214748364... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define P pair<int, int>
#define MOD 1000000007
#define INF 214748364... | [
"expression.operation.binary.remove"
] | 880,394 | 880,395 | u165374901 | cpp |
p03069 | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <type_traits>
#include <vector>
using namespace std;
#define INF (1ll << 60)
#define INFint (1 << 30)
#define MOD 10... | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <type_traits>
#include <vector>
using namespace std;
#define INF (1ll << 60)
#define INFint (1 << 30)
#define MOD 10... | [
"control_flow.loop.for.initializer.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"variable_declaration.value.change"
] | 880,408 | 880,409 | u991664217 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define reps(i, s, n) for (int(i) = (s); (i) < (n); (i)++)
#define repr(i, n) for (int(i) = (n)-1; (i) >= 0; (i)--)
#define all(v) (v).begin(), (v).end()
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
#define chmin(a,... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define reps(i, s, n) for (int(i) = (s); (i) < (n); (i)++)
#define repr(i, n) for (int(i) = (n)-1; (i) >= 0; (i)--)
#define all(v) (v).begin(), (v).end()
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
#define chmin(a,... | [] | 880,435 | 880,436 | u943094398 | cpp |
p03069 |
#include <algorithm>
#include <iostream>
#include <vector>
int main(void) {
int N;
std::cin >> N;
std::string S;
std::cin >> S;
std::vector<int> siro(N + 2);
siro[0] = 0;
if (S[0] == '#')
siro[1] = 1;
else
siro[1] = 0;
for (int i = 1; i < N + 1; i++) {
if (i == N)
siro[N + 1] = ... | #include <algorithm>
#include <iostream>
#include <vector>
int main(void) {
int N;
std::cin >> N;
std::string S;
std::cin >> S;
std::vector<int> siro(N + 2);
siro[0] = 0;
if (S[0] == '#')
siro[1] = 1;
else
siro[1] = 0;
for (int i = 1; i < N + 1; i++) {
if (i == N)
siro[N + 1] = s... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.change"
] | 880,442 | 880,443 | u967843578 | cpp |
p03069 | #include <climits>
#include <iostream>
#include <string>
using namespace std;
int N;
string S;
int preW[200005];
int preB[200005];
int ans = INT_MAX;
int main() {
cin >> N >> S;
for (int i = 1; i <= N; i++) {
preW[i] = preW[i - 1] + (S[i - 1] == '.' ? 1 : 0);
preB[i] = preB[i - 1] + (S[i - 1] == '#' ? 1 ... | #include <climits>
#include <iostream>
#include <string>
using namespace std;
int N;
string S;
int preW[200005];
int preB[200005];
int ans = INT_MAX;
int main() {
cin >> N >> S;
for (int i = 1; i <= N; i++) {
preW[i] = preW[i - 1] + (S[i - 1] == '.' ? 1 : 0);
preB[i] = preB[i - 1] + (S[i - 1] == '#' ? 1 ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 880,448 | 880,449 | u548317837 | cpp |
p03069 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
long long int mod = 1e9 + 7;
int main() {
int n;
string s;
cin >> n >> s;
int cnt = 1e9;... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
long long int mod = 1e9 + 7;
int main() {
int n;
string s;
cin >> n >> s;
int cnt = 1e9;... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 880,450 | 880,451 | u543657872 | cpp |
p03070 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Gosu_Hiroo
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<long long>;
using PII = pair<int, int>;
using PLL = pair<long long, long long>;
#pragma GCC o... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Gosu_Hiroo
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<long long>;
using PII = pair<int, int>;
using PLL = pair<long long, long long>;
#pragma GCC o... | [
"literal.number.change",
"variable_declaration.value.change"
] | 880,463 | 880,464 | u093219895 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a - 1 >= b) {
cout << 2 * a + 1 << endl;
}
else if (b - 1 >= a) {
cout << 2 * b + 1 << endl;
}
else {
cout << a + b << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a - 1 >= b) {
cout << 2 * a - 1 << endl;
}
else if (b - 1 >= a) {
cout << 2 * b - 1 << endl;
}
else {
cout << a + b << endl;
}
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 880,479 | 880,480 | u751515087 | cpp |
p03071 | #pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define all(a) (a).begin(), (a).end()
int main() {
int A, B;
cin >> A >> B;
if (A == B)
cout << 2 * A << endl;
else
cout << 2 * A - 1 << endl;
}
| #pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define all(a) (a).begin(), (a).end()
int main() {
int A, B;
cin >> A >> B;
if (A == B)
cout << 2 * A << endl;
else
cout << 2 * max(A, B) - 1 << endl;
}
| [
"call.add",
"call.arguments.add"
] | 880,481 | 880,482 | u229582356 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
ll a, b;
cin >> a >> b;
ll cnt = 0;
rep(i, 2) {
if (a >= b) {
cnt += a;
a--;
} else {
cnt += b;
b--;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
ll a, b;
cin >> a >> b;
ll cnt = 0;
rep(i, 2) {
if (a >= b) {
cnt += a;
a--;
} else {
cnt += b;
b--;
}
}
cout << cnt;
}
| [] | 880,495 | 880,496 | u945761460 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
ll a, b;
cin >> a >> b;
ll cnt = 0;
rep(i, 2) {
if (a >= b) {
cnt += a;
a--;
} else {
cnt += b;
b--;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
ll a, b;
cin >> a >> b;
ll cnt = 0;
rep(i, 2) {
if (a >= b) {
cnt += a;
a--;
} else {
cnt += b;
b--;
}
}
cout << cnt;
}
| [] | 880,497 | 880,496 | u945761460 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
int ans = 0;
if (a > b)
ans = a + a - 1;
else if (b < a)
ans = b + b - 1;
else
ans = a + b;
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
int ans = 0;
if (a > b)
ans = a + a - 1;
else if (b > a)
ans = b + b - 1;
else
ans = a + b;
cout << ans;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 880,500 | 880,501 | u636577997 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == b) {
cout << a + b << endl;
return 0;
}
else {
if (a > b) {
cout << a * (a - 1) << endl;
return 0;
} else {
cout << b * (b - 1) << endl;
return 0;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == b) {
cout << a + b << endl;
return 0;
}
else {
if (a > b) {
cout << a + (a - 1) << endl;
return 0;
} else {
cout << b + (b - 1) << endl;
return 0;
}
}
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 880,504 | 880,505 | u332946309 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int A, B;
cin >> A >> B;
if (A == B)
cout << A * 2 - 1 << endl;
else
cout << max(A, B) * 2 - 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int A, B;
cin >> A >> B;
if (A == B)
cout << A * 2 << endl;
else
cout << max(A, B) * 2 - 1 << endl;
} | [
"expression.operation.binary.remove"
] | 880,506 | 880,507 | u889173297 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a, b;
int c = 0;
for (int i = 0; i < 2; i++) {
if (a <= b) {
c = c + b;
b = b - 1;
}
else {
c = c + a;
a = a - 1;
}
}
cout << c << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int c = 0;
for (int i = 0; i < 2; i++) {
if (a <= b) {
c = c + b;
b = b - 1;
} else {
c = c + a;
a = a - 1;
}
}
cout << c << endl;
} | [] | 880,508 | 880,509 | u667099095 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a, b;
int c = 0;
for (int i = 0; i < 1; i++) {
if (a <= b) {
c = c + b;
b = b - 1;
}
else {
c = c + a;
a = a - 1;
}
}
cout << c << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int c = 0;
for (int i = 0; i < 2; i++) {
if (a <= b) {
c = c + b;
b = b - 1;
} else {
c = c + a;
a = a - 1;
}
}
cout << c << endl;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 880,510 | 880,509 | u667099095 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(), (x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(), (x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var ... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 880,511 | 880,512 | u488493347 | cpp |
p03071 | #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... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 880,513 | 880,514 | u341447450 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << max(2 * a + 1, max(a + b, 2 * b + 1)) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << max(2 * a - 1, max(a + b, 2 * b - 1)) << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 880,521 | 880,522 | u336145516 | cpp |
p03071 | #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <limits>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int A, B;
cin >... | #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <limits>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int A, B;
cin >... | [
"call.arguments.change"
] | 880,527 | 880,528 | u557207741 | cpp |
p03071 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int m = max(a, b);
if (a == b) {
cout << 2 * a << endl;
} else {
cout << 2 * a - 1 << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int m = max(a, b);
if (a == b) {
cout << 2 * a << endl;
} else {
cout << 2 * m - 1 << endl;
}
}
| [
"identifier.change",
"io.output.change"
] | 880,529 | 880,530 | u927463074 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.