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 |
|---|---|---|---|---|---|---|---|
p03068 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <class T> bool INRANGE(T x, T a, T b) { return a <= x && x <= b; }
//#define REP(i,n) for(int i=0;i<(n);++i)
#define ALL(v) (v).begin(), (v).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define debug(x) ... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <class T> bool INRANGE(T x, T a, T b) { return a <= x && x <= b; }
//#define REP(i,n) for(int i=0;i<(n);++i)
#define ALL(v) (v).begin(), (v).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define debug(x) ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 879,097 | 879,096 | u299377613 | cpp |
p03068 | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
int main() {
int N, K;
char S[20];
cin >> N;
cin >> S;
cin >> K;
char sk = S[K];
for (int i = 0; i < N; i++) {
if (S[i] != sk) {
S[i] = '*';
}
}
cout << S << "\n";
} | #include <bits/stdc++.h>
#include <cstdio>
using namespace std;
int main() {
int N, K;
char S[20];
cin >> N;
cin >> S;
cin >> K;
char sk = S[K - 1];
for (int i = 0; i < N; i++) {
if (S[i] != sk) {
S[i] = '*';
}
}
cout << S << "\n";
}
| [
"assignment.change"
] | 879,098 | 879,099 | u108648546 | cpp |
p03068 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, c;
string b;
cin >> a >> b >> c;
for (int i = 0; i < a; i++) {
if (b.at(i) != b.at(c))
b.at(i) = '*';
}
cout << b << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, c;
string b;
cin >> a >> b >> c;
for (int i = 0; i < a; i++) {
if (b.at(i) != b.at(c - 1))
b.at(i) = '*';
}
cout << b << endl;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 879,106 | 879,107 | u805131136 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> s >> k;
for (int i = 0; i < s.size(); i++) {
if (s[k] != s[i])
s[i] = '*';
}
cout << s << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> s >> k;
for (int i = 0; i < s.size(); i++) {
if (s[k - 1] != s[i])
s[i] = '*';
}
cout << s << endl;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 879,114 | 879,115 | u216525464 | cpp |
p03068 | #include <algorithm>
#include <cctype>
#include <cstdio>
#include <iostream>
#include <locale>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
int n, k;
string s;
cin >> n;
cin >> s;
cin >> k;
for (int i = 0; i < n; i++) {
if (s[i] == s[k])
... | #include <algorithm>
#include <cctype>
#include <cstdio>
#include <iostream>
#include <locale>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
int n, k;
string s;
cin >> n;
cin >> s;
cin >> k;
for (int i = 0; i < n; i++) {
if (s[i] == s[k - 1])... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 879,117 | 879,118 | u117345342 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int MOD = 1000000007;
int main() {
int n, k = 0;
string s = "";
cin >> n >> s >> k;
char c = s[k];
for (int i = 0; i < s.length(); i++) {
if (c != s[i]) {
s[i] = '*';
}
}
cout << s << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int MOD = 1000000007;
int main() {
int n, k = 0;
string s = "";
cin >> n >> s >> k;
char c = s[k - 1];
for (int i = 0; i < s.length(); i++) {
if (c != s[i]) {
s[i] = '*';
}
}
cout << s << "\n";
return 0;
} | [
"assignment.change"
] | 879,119 | 879,120 | u416964274 | cpp |
p03068 | #include <iostream>
using namespace std;
int main() {
int n;
string s;
int k;
cin >> n >> s >> k;
char x = s[k];
for (int i = 0; i < n; i++) {
if (s[i] != x) {
s[i] = '*';
}
}
for (int i = 0; i < n; i++) {
cout << s[i];
}
cout << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n;
string s;
int k;
cin >> n >> s >> k;
char x = s[k - 1];
for (int i = 0; i < n; i++) {
if (s[i] != x) {
s[i] = '*';
}
}
for (int i = 0; i < n; i++) {
cout << s[i];
}
cout << endl;
return 0;
}
| [
"assignment.change"
] | 879,121 | 879,122 | u408335633 | cpp |
p03068 | #include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
int main() {
int n, k;
string s, targ;
cin >> n;
... | #include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
int main() {
int n, k;
string s, targ;
cin >> n;
... | [
"assignment.change"
] | 879,123 | 879,124 | u064626595 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
string s;
int n, k;
char c;
int main() {
cin >> n >> s >> k;
c = s.at(k);
for (int i = 0; i < n; ++i) {
if (s.at(i) != c) {
s.at(i) = '*';
}
}
cout << s << endl;
} | #include <bits/stdc++.h>
using namespace std;
string s;
int n, k;
char c;
int main() {
cin >> n >> s >> k;
c = s.at(k - 1);
for (int i = 0; i < n; ++i) {
if (s.at(i) != c) {
s.at(i) = '*';
}
}
cout << s << endl;
} | [
"assignment.change"
] | 879,151 | 879,152 | u135954097 | cpp |
p03068 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int n, k;
string s;
cin >> n;
cin >> s;
cin >> k;
char tmp = s[k];
for (int i = 0; i < n; i++) {
if (s[i] != tmp) {
s[i] = '*';
}
}
cout << s << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int n, k;
string s;
cin >> n;
cin >> s;
cin >> k;
char tmp = s[k - 1];
for (int i = 0; i < n; i++) {
if (s[i] != tmp) {
s[i] = '*';
}
}
cout << s << endl;
return 0;
} | [
"assignment.change"
] | 879,156 | 879,157 | u493122449 | cpp |
p03068 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define repbit(n) for (ll bit = 0, bit < (1 << n), bit++)
i... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define repbit(n) for (ll bit = 0, bit < (1 << n), bit++)
i... | [
"control_flow.branch.if.condition.change",
"assignment.change"
] | 879,161 | 879,162 | u356489231 | cpp |
p03068 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define repbit(n) for (ll bit = 0, bit < (1 << n), bit++)
i... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define repbit(n) for (ll bit = 0, bit < (1 << n), bit++)
i... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 879,163 | 879,162 | u356489231 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> s >> k;
for (int i = 0; i < n; i++) {
if (s[i] != s[k])
s[i] = '*';
}
cout << s << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> s >> k;
for (int i = 0; i < n; i++) {
if (s[i] != s[k - 1])
s[i] = '*';
}
cout << s << endl;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 879,164 | 879,165 | u959539771 | cpp |
p03068 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int n;
cin >> n;
string word;
cin >> word;
int k;
cin >> k;
char p = word[k - 1];
for (int i = 0; i < n; i++) {
if (word[i] != p) {
word[i] = '*';
}
cout << word << endl;
return 0;
}
} | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int n;
cin >> n;
string word;
cin >> word;
int k;
cin >> k;
char p = word[k - 1];
for (int i = 0; i < n; i++) {
if (word[i] != p) {
word[i] = '*';
}
}
cout << word << endl;
return 0;
} | [] | 879,168 | 879,169 | u407416173 | cpp |
p03068 | #include <iostream>
using namespace std;
int main() {
string s;
int a, b;
cin >> a >> s >> b;
for (int i = 0; i < a; i++) {
if (s[i] == s[b])
cout << s[i];
else
cout << "*";
}
cout << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
string s;
int a, b;
cin >> a >> s >> b;
for (int i = 0; i < a; i++) {
if (s[i] == s[b - 1])
cout << s[i];
else
cout << "*";
}
cout << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 879,174 | 879,175 | u942714396 | cpp |
p03068 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, k;
string s;
cin >> n;
cin >> s;
cin >> k;
for (int i = 0; i < n; i++) {
if (s[i] != s[k]) {
s[i] = '*';
}
}
cout << s << endl;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int n, k;
string s;
cin >> n;
cin >> s;
cin >> k;
for (int i = 0; i < n; i++) {
if (s[i] != s[k - 1]) {
s[i] = '*';
}
}
cout << s << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 879,176 | 879,177 | u483349999 | cpp |
p03068 | #include <bits/stdc++.h>
#define cinf(n, x) \
for (int i = 0; i < (n); i++) \
cin >> x[i];
typedef long long int ll;
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int k;
... | #include <bits/stdc++.h>
#define cinf(n, x) \
for (int i = 0; i < (n); i++) \
cin >> x[i];
typedef long long int ll;
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int k;
... | [
"literal.string.change",
"assignment.value.change"
] | 879,178 | 879,179 | u928536113 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
/* #pragma */
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
/*alias*/
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
#define itn int... | #include <bits/stdc++.h>
using namespace std;
/* #pragma */
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
/*alias*/
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
#define itn int... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 879,180 | 879,181 | u509680664 | cpp |
p03068 | #include "bits/stdc++.h"
using namespace std;
#define sp(x) cout << setprecision(x);
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define inf 10000000
#define linf INT64_MAX * 0.99
#define print(s) cout << (s) << endl
#define lint long long
... | #include "bits/stdc++.h"
using namespace std;
#define sp(x) cout << setprecision(x);
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define inf 10000000
#define linf INT64_MAX * 0.99
#define print(s) cout << (s) << endl
#define lint long long
... | [
"control_flow.branch.if.condition.change"
] | 879,182 | 879,183 | u601825761 | cpp |
p03068 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
char S[10];
cin >> N;
cin >> S;
cin >> K;
for (int i = 0; i < N; i++) {
if (S[i] != S[K]) {
S[i] = '*';
}
}
cout << S << endl;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
char S[10];
cin >> N;
cin >> S;
cin >> K;
for (int i = 0; i < N; i++) {
if (S[i] != S[K - 1]) {
S[i] = '*';
}
}
cout << S << endl;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 879,184 | 879,185 | u718541390 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n, k;
cin >> n >> s >> k;
for (int i = 0; i < (int)s.size(); ++i) {
if (s[i] != s[k + 1])
s[i] = '*';
}
cout << s;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n, k;
cin >> n >> s >> k;
for (int i = 0; i < (int)s.size(); ++i) {
if (s[i] != s[k - 1])
s[i] = '*';
}
cout << s;
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 879,190 | 879,191 | u593546783 | cpp |
p03068 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> S >> K;
for (int i = 0; i < N; i++) {
if (S.at(i) != S.at(K)) {
S.at(i) = '*';
}
}
cout << S << endl;
} | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> S >> K;
for (int i = 0; i < N; i++) {
if (S.at(i) != S.at(K - 1)) {
S.at(i) = '*';
}
}
cout << S << endl;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 879,195 | 879,196 | u796853866 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
string s1;
cin >> n >> s1 >> k;
for (int i = 0; i < s1.size(); i++)
if (s1[i] != s1[k + 1])
cout << "*";
else
cout << s1[i];
cout << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
string s1;
cin >> n >> s1 >> k;
for (int i = 0; i < s1.size(); i++)
if (s1[i] != s1[k - 1])
cout << "*";
else
cout << s1[i];
cout << "\n";
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 879,197 | 879,198 | u132878214 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
int K;
cin >> K;
char c = S.at(K - 1);
for (int i = 0; i < S.size(); i++) {
if (S.at(i) == c)
S.at(i) = '*';
}
for (int i = 0; i < S.size(); i++) {
cout << S.at(i);
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
int K;
cin >> K;
char c = S.at(K - 1);
for (int i = 0; i < S.size(); i++) {
if (S.at(i) != c)
S.at(i) = '*';
}
for (int i = 0; i < S.size(); i++) {
cout << S.at(i);
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 879,207 | 879,208 | u665871498 | cpp |
p03068 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define str string
#define rep(x, y) for (int i = x; i < y; i++)
#define REP(x, y) for (int j = x; j < y; j++)
#define all(x) x.begin(), x.end()
signed main() {
int A, B, C, N, K;
str S, W, T;
cin >> N >> S;
cin >> K;
rep... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define str string
#define rep(x, y) for (int i = x; i < y; i++)
#define REP(x, y) for (int j = x; j < y; j++)
#define all(x) x.begin(), x.end()
signed main() {
int A, B, C, N, K;
str S, W, T;
cin >> N >> S;
cin >> K;
rep... | [
"control_flow.branch.if.condition.change",
"identifier.change"
] | 879,209 | 879,210 | u347579224 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int K;
cin >> K;
char moji;
moji = S.at(K - 1);
for (int i = 0; i < N; i++) {
if (S.at(i) == moji)
cout << moji;
else
cout << "*" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int K;
cin >> K;
char moji;
moji = S.at(K - 1);
for (int i = 0; i < N; i++) {
if (S.at(i) == moji)
cout << moji;
else
cout << "*";
}
return 0;
} | [
"expression.operation.binary.remove"
] | 879,219 | 879,220 | u785409986 | cpp |
p03068 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define llong long long
#define INF (__INT32_MAX__ / 2)
using namespace std;
typedef pair<int, int> ipair;
int main(int ar... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define llong long long
#define INF (__INT32_MAX__ / 2)
using namespace std;
typedef pair<int, int> ipair;
int main(int ar... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 879,221 | 879,222 | u777137418 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> S >> K;
char c = S[K];
for (int i = 0; i < N; i++) {
if (S[i] != c)
S[i] = '*';
}
cout << S;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> S >> K;
char c = S[K - 1];
for (int i = 0; i < N; i++) {
if (S[i] != c)
S[i] = '*';
}
cout << S;
return 0;
} | [
"assignment.change"
] | 879,223 | 879,224 | u778347695 | cpp |
p03068 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF 1e9 + 7
#define rep(i, n) for (int i = 0; i < n; i++)
#define NO cout << "NO" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define Yes cout << "Yes"... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF 1e9 + 7
#define rep(i, n) for (int i = 0; i < n; i++)
#define NO cout << "NO" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define Yes cout << "Yes"... | [
"assignment.change"
] | 879,229 | 879,230 | u297203024 | cpp |
p03068 | #include <iostream>
using namespace std;
int main(void) {
int n, k;
string s;
cin >> n >> s >> k;
for (int i = 0; i < n; i++) {
if (s[i] != s[k])
s[i] = '*';
}
cout << s << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
int n, k;
string s;
cin >> n >> s >> k;
for (int i = 0; i < n; i++) {
if (s[i] != s[k - 1])
s[i] = '*';
}
cout << s << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 879,231 | 879,232 | u071445084 | cpp |
p03068 | #define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define repn(i, n) for (int i = 1; i <= (int)(n); i++)
#define reprn(i, n) for (int i = ((int)(n)); i > 0; i--)
#define all(x) (x).begin(), (x).end()
using llint = long long int;
using lint = long int;
#incl... | #define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define repn(i, n) for (int i = 1; i <= (int)(n); i++)
#define reprn(i, n) for (int i = ((int)(n)); i > 0; i--)
#define all(x) (x).begin(), (x).end()
using llint = long long int;
using lint = long int;
#incl... | [
"assignment.change"
] | 879,239 | 879,240 | u659075382 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a;
string n;
cin >> n;
cin >> b;
for (int i = 0; i < a; i++) {
if (n[i] == n[b]) {
cout << n[i];
} else {
cout << "*";
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a;
string n;
cin >> n;
cin >> b;
for (int i = 0; i < a; i++) {
if (n[i] == n[b - 1]) {
cout << n[i];
} else {
cout << "*";
}
}
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 879,247 | 879,248 | u614970814 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
int main() {
int len;
string str;
int k;
cin >> len >> str >> k;
char c = str[k];
for (int i = 0; i < len; ++i) {
cout << (str[i] == c ? c : '*');
}
cout << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int len;
string str;
int k;
cin >> len >> str >> k;
char c = str[k - 1];
for (int i = 0; i < len; ++i) {
cout << (str[i] == c ? c : '*');
}
cout << endl;
}
| [
"assignment.change"
] | 879,249 | 879,250 | u492047031 | cpp |
p03068 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
ll mod = 1e9 + 7;
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> s >> k;
char c = s.at(k);
for (in... | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
ll mod = 1e9 + 7;
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> s >> k;
char c = s.at(k - 1);
for... | [
"assignment.change"
] | 879,255 | 879,256 | u625725849 | cpp |
p03068 | #include <iostream>
using namespace std;
int main() {
string S;
int N, K;
string result;
cin >> N >> S >> K;
char replace = S[K - 1];
for (int i = 0; i < N; i++) {
if (S[i] != replace)
result += "*";
else
result += S[i];
}
cout << S;
return 0;
} | #include <iostream>
using namespace std;
int main() {
string S;
int N, K;
string result;
cin >> N >> S >> K;
char replace = S[K - 1];
for (int i = 0; i < N; i++) {
if ((char)S[i] != replace)
result += "*";
else
result += S[i];
}
cout << result;
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"identifier.change",
"io.output.change"
] | 879,263 | 879,264 | u412038365 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
int K;
cin >> N;
cin >> S;
cin >> K;
for (int i = 0; i < N - 1; i++) {
if (S.at(i) != S.at(K - 1)) {
S.at(i) = '*';
}
}
cout << S << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
int K;
cin >> N;
cin >> S;
cin >> K;
for (int i = 0; i < N; i++) {
if (S.at(i) != S.at(K - 1)) {
S.at(i) = '*';
}
}
cout << S << endl;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 879,272 | 879,273 | u960490836 | cpp |
p03068 | #include <iostream>
using namespace std;
int main() {
int n, k, i;
cin >> n;
char s[n];
cin >> s >> k;
for (i = 0; i < n; i++) {
if (s[i] != s[k + 1])
s[i] = '*';
}
cout << s << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n, k, i;
cin >> n;
char s[n];
cin >> s >> k;
for (i = 0; i < n; i++) {
if (s[i] != s[k - 1])
s[i] = '*';
}
cout << s << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 879,274 | 879,275 | u364490560 | cpp |
p03068 | #include <iostream>
using namespace std;
char put_str(const char s[], int k) {
char same;
for (int i = 0; s[i] != 0; i++) {
if (i + 1 == k) {
same = s[i + 1];
}
}
return same;
}
int main() {
int n, k;
char s[10];
char same;
cin >> n;
cin >> s;
cin >> k;
same = put_str(s, k);
for... | #include <iostream>
using namespace std;
char put_str(const char s[], int k) {
char same;
for (int i = 0; s[i] != 0; i++) {
if (i + 1 == k) {
same = s[i];
}
}
return same;
}
int main() {
int n, k;
char s[10];
char same;
cin >> n;
cin >> s;
cin >> k;
same = put_str(s, k);
for (in... | [
"expression.operation.binary.remove"
] | 879,278 | 879,279 | u955422652 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, n, k;
string s;
cin >> n >> s >> k;
for (i = 0; i < n; i++) {
if (s[i] != s[k])
s[i] = '*';
}
cout << s << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, n, k;
string s;
cin >> n >> s >> k;
for (i = 0; i < n; i++) {
if (s[i] != s[k - 1])
s[i] = '*';
}
cout << s << endl;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 879,282 | 879,283 | u409569205 | cpp |
p03068 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, K;
cin >> N;
string S(N, '-');
cin >> S >> K;
K = S[K];
for (int i = 0; i < N; i++) {
if (S[i] != K) {
S[i] = '*';
}
}
cout << S;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int N, K;
cin >> N;
string S(N, '-');
cin >> S >> K;
K = S[K - 1];
for (int i = 0; i < N; i++) {
if (S[i] != K) {
S[i] = '*';
}
}
cout << S;
return 0;
}
| [
"assignment.change"
] | 879,288 | 879,289 | u267666635 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
int main() {
//ながさN 文字列小文字 S Kばんめ
string S;
int N, K;
cin >> N >> S >> K;
int X = K - 1;
// B Kばんめの文字
string B = S.substr(X, X);
// 置換対象の文字列 // 検索文字列
for (int i = 0; i < N; i++) {
string Y = S.substr(i, 1);
;
if (Y == B) {
} else {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
//ながさN 文字列小文字 S Kばんめ
string S;
int N, K;
cin >> N >> S >> K;
int X = K - 1;
// B Kばんめの文字
string B = S.substr(X, 1);
// 置換対象の文字列 // 検索文字列
for (int i = 0; i < N; i++) {
string Y = S.substr(i, 1);
;
if (Y == B) {
} else {
... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 879,290 | 879,291 | u363743459 | cpp |
p03068 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N, K;
string S;
cin >> N, cin >> S, cin >> K;
char k = S[K];
for (int i = 0; i < N; ++i)
cout << (S[i] == k ? S[i] : '*');
cout << endl;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int N, K;
string S;
cin >> N, cin >> S, cin >> K;
char k = S[K - 1];
for (int i = 0; i < N; ++i)
cout << (S[i] == k ? S[i] : '*');
cout << endl;
return 0;
} | [
"assignment.change"
] | 879,292 | 879,293 | u889423178 | cpp |
p03068 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, k;
string s;
cin >> n;
cin >> s;
cin >> k;
char replace = s[k];
for (int i = 0; i < n; i++) {
if (replace != s[i]) {
s[i] = '*';
}
}
cout << s << endl;
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, k;
string s;
cin >> n;
cin >> s;
cin >> k;
char replace = s[k - 1];
for (int i = 0; i < n; i++) {
if (replace != s[i]) {
s[i] = '*';
}
}
cout << s << endl;
}
| [
"assignment.change"
] | 879,296 | 879,297 | u682661211 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n, k;
cin >> n >> s >> k;
for (int i = 0; i < n; i++) {
if (s.at(k) != s.at(i)) {
s.at(i) = '*';
}
}
cout << s << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n, k;
cin >> n >> s >> k;
for (int i = 0; i < n; i++) {
if (s.at(i) != s.at(k - 1)) {
s.at(i) = '*';
}
}
cout << s << endl;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 879,306 | 879,307 | u959815036 | cpp |
p03068 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
int K;
cin >> K;
for (int i = 0; i < N; i++) {
if (S[K] != S[i]) {
S[i] = '*';
}
}
cout << S << endl;
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
int K;
cin >> K;
for (int i = 0; i < N; i++) {
if (S[K - 1] != S[i]) {
S[i] = '*';
}
}
cout << S << endl;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 879,308 | 879,309 | u640827947 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string S;
char C;
cin >> N;
cin >> S;
cin >> K;
C = S.at(K);
for (int i = 0; i < N; i++) {
if (S.at(i) != C) {
cout << "*";
} else {
cout << S.at(i);
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string S;
char C;
cin >> N;
cin >> S;
cin >> K;
C = S.at(K - 1);
for (int i = 0; i < N; i++) {
if (S.at(i) != C) {
cout << "*";
} else {
cout << S.at(i);
}
}
}
| [
"assignment.change"
] | 879,312 | 879,313 | u581018765 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N;
char S[N];
for (int i = 0; i < N; i++) {
cin >> S[i];
}
cin >> K;
char a;
a = S[K];
for (int i = 0; i < N; i++) {
if (S[i] != a) {
S[i] = '*';
}
}
for (int i = 0; i < N; i++) {
cout << S[i];
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N;
char S[N];
for (int i = 0; i < N; i++) {
cin >> S[i];
}
cin >> K;
char a;
a = S[K - 1];
for (int i = 0; i < N; i++) {
if (S[i] != a) {
S[i] = '*';
}
}
for (int i = 0; i < N; i++) {
cout << S[i];
... | [
"assignment.change"
] | 879,314 | 879,315 | u709810602 | cpp |
p03068 | #include <cmath>
#include <iostream>
#include <math.h>
#include <stack>
#include <string>
#include <vector>
//#include<stdlib.h>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> s >> k;
for (int a = 0; a < n; a++) {
if (s[a] != s[k]) {
s[a] = '*';
}
}
cout << s;
return 0;
} | #include <cmath>
#include <iostream>
#include <math.h>
#include <stack>
#include <string>
#include <vector>
//#include<stdlib.h>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> s >> k;
k--;
for (int a = 0; a < n; a++) {
if (s[a] != s[k]) {
s[a] = '*';
}
}
cout << s;
retur... | [
"expression.unary.arithmetic.add"
] | 879,320 | 879,321 | u468506413 | cpp |
p03068 | #include <cmath>
#include <iostream>
#include <math.h>
#include <stack>
#include <string>
#include <vector>
//#include<stdlib.h>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> s >> k;
for (int a; a < n; a++) {
if (s[a] != s[k]) {
s[a] = '*';
}
}
cout << s;
return 0;
} | #include <cmath>
#include <iostream>
#include <math.h>
#include <stack>
#include <string>
#include <vector>
//#include<stdlib.h>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> s >> k;
k--;
for (int a = 0; a < n; a++) {
if (s[a] != s[k]) {
s[a] = '*';
}
}
cout << s;
retur... | [
"expression.unary.arithmetic.add",
"control_flow.loop.for.initializer.change",
"variable_declaration.value.change"
] | 879,322 | 879,321 | u468506413 | cpp |
p03068 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int N, K, i;
string S, c, tmp;
cin >> N;
cin >> S;
cin >> K;
c = S.substr(K, 1);
for (i = 0; i < N; i++) {
tmp = {S[i]};
if (tmp != c) {
S[i] = '*';
}
}
cout << S << endl;
}
| #include <iostream>
#include <string>
using namespace std;
int main(void) {
int N, K, i;
string S, c, tmp;
cin >> N;
cin >> S;
cin >> K;
c = S.substr(K - 1, 1);
for (i = 0; i < N; i++) {
tmp = {S[i]};
if (tmp != c) {
S[i] = '*';
}
}
cout << S << endl;
}
| [
"assignment.change"
] | 879,323 | 879,324 | u989110852 | cpp |
p03068 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
string s;
cin >> n;
cin >> s;
cin >> k;
char moji = s.at(k);
for (int i = 0; i < n; i++) {
if (s.at(i) != moji) {
s.at(i) = '*';
}
}
cout << s << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
string s;
cin >> n;
cin >> s;
cin >> k;
char moji = s.at(k - 1);
for (int i = 0; i < n; i++) {
if (s.at(i) != moji) {
s.at(i) = '*';
}
}
cout << s << endl;
} | [
"assignment.change"
] | 879,334 | 879,335 | u069627403 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string S;
cin >> N;
cin >> S;
cin >> K;
char t = S[K];
for (int i = 0; i < N; i++) {
if (S[i] != t) {
S[i] = '*';
}
}
cout << S << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string S;
cin >> N;
cin >> S;
cin >> K;
char t = S[K - 1];
for (int i = 0; i < N; i++) {
if (S[i] != t) {
S[i] = '*';
}
}
cout << S << endl;
}
| [
"assignment.change"
] | 879,345 | 879,346 | u311517735 | cpp |
p03068 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const int inf = 2147483647, dx[] = {-1, 0, 1, 0},
dy[] = {0, -1, 0, 1}; // 上... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const int inf = 2147483647, dx[] = {-1, 0, 1, 0},
dy[] = {0, -1, 0, 1}; // 上... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 879,351 | 879,352 | u965118468 | cpp |
p03068 | //#pragma warning(disable:4996)
#include <stdio.h>
int main() {
int n, k;
char s[11];
scanf("%d %s %d", &n, s, &k);
char a = s[k];
for (int i = 0; i < n; i++) {
if (s[i] != a) {
s[i] = '*';
}
}
printf("%s", s);
// while (1);
} | //#pragma warning(disable:4996)
#include <stdio.h>
int main() {
int n, k;
char s[11];
scanf("%d %s %d", &n, s, &k);
char a = s[k - 1];
for (int i = 0; i < n; i++) {
if (s[i] != a) {
s[i] = '*';
}
}
printf("%s", s);
} | [
"assignment.change"
] | 879,355 | 879,356 | u691912637 | cpp |
p03068 | #include <stdio.h>
int main() {
int n, k;
char s[11];
scanf("%d %s %d", &n, s, &k);
char a = s[k];
for (int i = 0; i < n; i++) {
if (s[i] != a) {
s[i] == '*';
}
}
printf("%s", s);
} | //#pragma warning(disable:4996)
#include <stdio.h>
int main() {
int n, k;
char s[11];
scanf("%d %s %d", &n, s, &k);
char a = s[k - 1];
for (int i = 0; i < n; i++) {
if (s[i] != a) {
s[i] = '*';
}
}
printf("%s", s);
} | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 879,357 | 879,356 | u691912637 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N;
char S[N];
cin >> S >> K;
for (int i = 0; i < N; i++) {
if (S[i] != S[K]) {
S[i] = '*';
}
}
cout << S << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N;
char S[N];
cin >> S >> K;
for (int i = 0; i < N; i++) {
if (S[i] != S[K - 1]) {
S[i] = '*';
}
}
cout << S << endl;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 879,360 | 879,361 | u559126797 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 100000000;
int in() {
int a;
cin >> a;
return a;
} // int型関数の受け取り
void forin(int *x, int y) {
for (int i = 0; i < y; i++) {
cin >> x[i];
}
} //(x,y) int型配列x[y]の受け取り
int intpow(int x, int y) {
double a = x, b = y;
r... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 100000000;
int in() {
int a;
cin >> a;
return a;
} // int型関数の受け取り
void forin(int *x, int y) {
for (int i = 0; i < y; i++) {
cin >> x[i];
}
} //(x,y) int型配列x[y]の受け取り
int intpow(int x, int y) {
double a = x, b = y;
r... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 879,373 | 879,374 | u160321725 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> S >> K;
char sk = S[K];
for (int i = 0; i < N; i++) {
if (S[i] != sk)
S[i] = '*';
}
cout << S << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> S >> K;
char sk = S[K - 1];
for (int i = 0; i < N; i++) {
if (S[i] != sk)
S[i] = '*';
}
cout << S << endl;
} | [
"assignment.change"
] | 879,384 | 879,385 | u607746177 | cpp |
p03068 | #include <iostream>
using namespace std;
int main() {
int N, K;
string S;
cin >> N;
// for (int i = 0; i < N; i++) {
// cin >> S[i];
// }
cin >> S;
cin >> K;
for (int k = 0; k < N; k++) {
if (S[k] != S[K])
S[k] = '*'; // SのK番目と違うなら*にしちゃう
}
// for (int j = 0; j < N; j++) {
// ... | #include <iostream>
using namespace std;
int main() {
int N, K;
string S;
cin >> N;
// for (int i = 0; i < N; i++) {
// cin >> S[i];
// }
cin >> S;
cin >> K;
for (int k = 0; k < N; k++) {
if (S[k] != S[K - 1])
S[k] = '*'; // SのK番目と違うなら*にしちゃう
}
// for (int j = 0; j < N; j++) {
//... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 879,391 | 879,392 | u479032944 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string S;
char X = '*', t;
cin >> N >> S >> K;
char Y = S.at(K);
for (int i = 0; i < N; i++) {
t = S.at(i);
if (t != Y) {
S.at(i) = X;
}
}
cout << S << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string S;
char X = '*', t;
cin >> N >> S >> K;
K--;
char Y = S.at(K);
for (int i = 0; i < N; i++) {
t = S.at(i);
if (t != Y) {
S.at(i) = X;
}
}
cout << S << endl;
} | [
"expression.unary.arithmetic.add"
] | 879,404 | 879,405 | u503022110 | cpp |
p03068 | #include <iostream>
#include <string>
//#include <cstdio>
int main() {
int N, K;
char s[N + 1];
// std::string s;
std::cin >> N >> s >> K;
// scanf("%d\n%s\n%d", N, s, K);
for (int i = 0; i < N; i++) {
if (s[i] != s[K])
s[i] = '*';
}
std::cout << s;
// printf("%s", s);
return 0;
}
| #include <iostream>
#include <string>
//#include <cstdio>
int main() {
int N, K;
char s[N + 1];
// std::string s;
std::cin >> N >> s >> K;
// scanf("%d\n%s\n%d", N, s, K);
for (int i = 0; i < N; i++) {
if (s[i] != s[K - 1])
s[i] = '*';
}
std::cout << s;
// printf("%s", s);
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 879,413 | 879,414 | u455534744 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
int N, K;
string S;
int main() {
cin >> N;
cin >> S;
cin >> K;
for (int i = 0; i < S.length(); i++)
if (S[i] != S[K])
S[i] = '*';
cout << S << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int N, K;
string S;
int main() {
cin >> N;
cin >> S;
cin >> K;
for (int i = 0; i < S.length(); i++)
if (S[i] != S[K - 1])
S[i] = '*';
cout << S << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 879,415 | 879,416 | u813181671 | cpp |
p03068 | #include <iostream>
using namespace std;
int main() {
int N, K;
char S[N];
cin >> N >> S >> K;
char a = S[K - 1];
for (int i = 0; i < N; i++) {
if (S[i] != a) {
S[i] = '*';
}
}
std::cout << N << std::endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N, K;
char S[N];
cin >> N >> S >> K;
char a = S[K - 1];
for (int i = 0; i < N; i++) {
if (S[i] != a) {
S[i] = '*';
}
}
std::cout << S << std::endl;
return 0;
}
| [
"identifier.change",
"expression.operation.binary.change"
] | 879,422 | 879,423 | u220522704 | cpp |
p03068 | #include <iostream>
using namespace std;
int main() {
int N, K;
char S[N];
cin >> N >> S >> K;
char a = S[K + 1];
for (int i = 0; i < N; i++) {
if (S[i] != a) {
S[i] = '*';
}
}
std::cout << N << std::endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N, K;
char S[N];
cin >> N >> S >> K;
char a = S[K - 1];
for (int i = 0; i < N; i++) {
if (S[i] != a) {
S[i] = '*';
}
}
std::cout << S << std::endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"identifier.change"
] | 879,424 | 879,423 | u220522704 | cpp |
p03068 | #include <iostream>
using namespace std;
int main() {
int N, K;
char S[N];
cin >> N >> S >> K;
char a = S[K - 1];
for (int i = 0; i < N; i++) {
if (S[i] == a) {
S[i] = '*';
}
}
std::cout << S << std::endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N, K;
char S[N];
cin >> N >> S >> K;
char a = S[K - 1];
for (int i = 0; i < N; i++) {
if (S[i] != a) {
S[i] = '*';
}
}
std::cout << S << std::endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 879,425 | 879,423 | u220522704 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
int main() {
int k, i, j, n;
string s;
cin >> n >> s >> k;
for (i = 0; i < n; i++) {
if (s.at(i) != s.at(k)) {
s.at(i) = '*';
}
}
cout << s << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int k, i, j, n;
string s;
cin >> n >> s >> k;
for (i = 0; i < n; i++) {
if (s.at(i) != s.at(k - 1)) {
s.at(i) = '*';
}
}
cout << s << endl;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 879,426 | 879,427 | u485920935 | cpp |
p03068 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
char s[N];
for (int i = 0; i < N; i++) {
cin >> s[i];
}
int K;
cin >> K;
char r = s[K - 1];
for (int i = 0; i < N; i++) {
if (s[i] == r)
s[i] = '*';
}
for (int i = 0; i < N; ... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
char s[N];
for (int i = 0; i < N; i++) {
cin >> s[i];
}
int K;
cin >> K;
char r = s[K - 1];
for (int i = 0; i < N; i++) {
if (s[i] != r)
s[i] = '*';
}
for (int i = 0; i < N; ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 879,428 | 879,429 | u120564432 | cpp |
p03068 | #include <iostream>
using namespace std;
int main() {
int N, K, i;
char S[11];
cin >> N >> S >> K;
for (i = 0; i < N; i++) {
if (S[i] != S[K])
S[i] = '*';
}
cout << S << endl;
} | #include <iostream>
using namespace std;
int main() {
int N, K, i;
char S[11];
cin >> N >> S >> K;
for (i = 0; i < N; i++) {
if (S[i] != S[K - 1])
S[i] = '*';
}
cout << S << endl;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 879,430 | 879,431 | u956908227 | cpp |
p03068 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
int K;
cin >> K;
for (int i = 0; i < N; i++) {
if (S[i] != S[K]) {
S[i] = '*';
}
}
cout << S << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
int K;
cin >> K;
for (int i = 0; i < N; i++) {
if (S[i] != S[K - 1]) {
S[i] = '*';
}
}
cout << S << endl;
return ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 879,438 | 879,439 | u899108527 | cpp |
p03068 | #include <iostream>
using namespace std;
int main() {
int n, k;
char s[10];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
}
cin >> k;
for (int i = 0; i < n; i++) {
if (s[i] != s[k])
s[i] == '*';
}
for (int i = 0; i < n; i++) {
cout << s[i];
}
cout << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, k;
char s[10];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
}
cin >> k;
for (int i = 0; i < n; i++) {
if (s[i] != s[k - 1])
s[i] = '*';
}
for (int i = 0; i < n; i++) {
cout << s[i];
}
cout << endl;
return 0;
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 879,446 | 879,447 | u072831727 | cpp |
p03068 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
string S;
cin >> N;
cin >> S;
cin >> K;
char c = S[K - 1];
for (int i = 0; i < N; i++) {
cout << c;
if (S[i] != c) {
S[i] = '*';
}
}
cout << S;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
string S;
cin >> N;
cin >> S;
cin >> K;
char c = S[K - 1];
for (int i = 0; i < N; i++) {
if (S[i] != c) {
S[i] = '*';
}
}
cout << S;
} | [] | 879,455 | 879,456 | u923676814 | cpp |
p03068 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
string S;
cin >> N;
cin >> S;
cin >> K;
char c = S[K];
for (int i = 0; i < N; i++) {
if (S[i] != c) {
S[i] = '*';
}
}
cout << S;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
string S;
cin >> N;
cin >> S;
cin >> K;
char c = S[K - 1];
for (int i = 0; i < N; i++) {
if (S[i] != c) {
S[i] = '*';
}
}
cout << S;
} | [
"assignment.change"
] | 879,457 | 879,456 | u923676814 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n, k;
string s;
cin >> n >> s >> k;
for (int i = 0; i < n; i++) {
if (s.at(i) != s.at(k)) {
s.at(i) = '*';
}
}
cout << s << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n, k;
string s;
cin >> n >> s >> k;
for (int i = 0; i < n; i++) {
if (s.at(i) != s.at(k - 1)) {
s.at(i) = '*';
}
}
cout << s << endl;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 879,469 | 879,470 | u794565416 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string s;
int n, k;
cin >> n >> s >> k;
for (int i = 0; i < n; i++) {
if (s[i] != s[k])
s[i] = '*';
}
cout << s << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string s;
int n, k;
cin >> n >> s >> k;
for (int i = 0; i < n; i++) {
if (s[i] != s[k - 1])
s[i] = '*';
}
cout << s << endl;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 879,486 | 879,487 | u330689597 | cpp |
p03068 | #include <iostream>
using namespace std;
int main() {
int N, K;
string S;
char SelectedChar;
cin >> N >> S >> K;
SelectedChar = S.at(K);
for (int i = 0; i < N; i++) {
if (S.at(i) != SelectedChar) {
S.at(i) = '*';
}
}
cout << S << endl;
} | #include <iostream>
using namespace std;
int main() {
int N, K;
string S;
char SelectedChar;
cin >> N >> S >> K;
SelectedChar = S.at(K - 1);
for (int i = 0; i < N; i++) {
if (S.at(i) != SelectedChar) {
S.at(i) = '*';
}
}
cout << S << endl;
} | [
"assignment.change"
] | 879,498 | 879,499 | u259124874 | cpp |
p03065 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
int N;
ll a[10001];
set<int> ans;
ll gcd(ll a, ll b) {
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
void bunkai(ll a) {
ll cnt = 2;
while (cnt * cnt <= a) {... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
int N;
ll a[10001];
set<ll> ans;
ll gcd(ll a, ll b) {
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
void bunkai(ll a) {
ll cnt = 2;
while (cnt * cnt <= a) {
... | [
"assignment.value.change",
"variable_declaration.type.change"
] | 879,513 | 879,514 | u107077805 | cpp |
p03065 | // #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#inc... | // #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#inc... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 879,543 | 879,544 | u119460590 | cpp |
p03065 | #define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/STACK:256000000")
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#... | #define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/STACK:256000000")
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#... | [
"variable_declaration.type.change",
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 879,547 | 879,548 | u644276233 | cpp |
p03065 | #include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
long long gc = 0;
vector<long long> A(N + 1);
for (int i = N; ~i; --i)
cin >> A[i], gc = __gcd(abs(A[i]), gc);
auto test = [&](int p) {
if (A[0] % p)
return false;
... | #include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
long long gc = 0;
vector<long long> A(N + 1);
for (int i = N; ~i; --i)
cin >> A[i], gc = __gcd(abs(A[i]), gc);
auto test = [&](int p) {
if (A[0] % p)
return false;
... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.remove",
"identifier.change",
"control_flow.loop.condition.change",
"assignment.variable.change"
] | 879,549 | 879,550 | u459737327 | cpp |
p03065 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#inclu... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#inclu... | [
"call.add",
"call.arguments.change"
] | 879,554 | 879,555 | u495699318 | cpp |
p03065 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define N 12000
LL n, a[N], b[N];
map<LL, bool> vis;
LL gcd(LL x, LL y) { return y == 0 ? x : gcd(y, x % y); }
bool isp(LL x) {
if (x == 1)
return 0;
for (LL i = 2; i * i <= x; ++i)
if (x % i == 0)
return 0;
return 1;
}
bool c... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define N 12000
LL n, a[N], b[N];
map<LL, bool> vis;
LL gcd(LL x, LL y) { return y == 0 ? x : gcd(y, x % y); }
bool isp(LL x) {
if (x == 1)
return 0;
for (LL i = 2; i * i <= x; ++i)
if (x % i == 0)
return 0;
return 1;
}
bool c... | [
"expression.operation.binary.add"
] | 879,558 | 879,559 | u225045588 | cpp |
p03065 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define N 12000
LL n, a[N], b[N];
map<LL, bool> vis;
LL gcd(LL x, LL y) { return y == 0 ? x : gcd(y, x % y); }
bool isp(LL x) {
if (x == 1)
return 0;
for (LL i = 2; i * i <= x; ++i)
if (x % i == 0)
return 0;
return 1;
}
bool c... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define N 12000
LL n, a[N], b[N];
map<LL, bool> vis;
LL gcd(LL x, LL y) { return y == 0 ? x : gcd(y, x % y); }
bool isp(LL x) {
if (x == 1)
return 0;
for (LL i = 2; i * i <= x; ++i)
if (x % i == 0)
return 0;
return 1;
}
bool c... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 879,560 | 879,559 | u225045588 | cpp |
p03065 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
#define vel vector<long long>
#define vvel vector<vel>
#define int long long
#define ll long long
#define D double
#define veb vector<bool>
#define vveb vector<veb>
#define V vector
#defin... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
#define vel vector<long long>
#define vvel vector<vel>
#define int long long
#define ll long long
#define D double
#define veb vector<bool>
#define vveb vector<veb>
#define V vector
#defin... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 879,588 | 879,589 | u021034020 | cpp |
p03065 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
#define vel vector<long long>
#define vvel vector<vel>
#define int long long
#define ll long long
#define D double
#define veb vector<bool>
#define vveb vector<veb>
#define V vector
#defin... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
#define vel vector<long long>
#define vvel vector<vel>
#define int long long
#define ll long long
#define D double
#define veb vector<bool>
#define vveb vector<veb>
#define V vector
#defin... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.co... | 879,590 | 879,589 | u021034020 | cpp |
p03066 | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)
#define each(a, b) for (auto &(a) : ... | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 998244353
#define EPS 1e-10
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)
#define each(a, b) for (auto &(a) : (... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 879,602 | 879,603 | u509674552 | cpp |
p03066 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
using lint = long long;
using ld = lo... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
using lint = long long;
using ld = lo... | [
"preprocessor.define.value.change",
"literal.integer.change",
"literal.number.change"
] | 879,604 | 879,605 | u607034173 | cpp |
p03064 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++)
#define reg(i, a, b) for (int i = ((int)(a)); i <= ((int)(b)); i++)
#define irep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define ireg(i, a, b) for (int i = ((int)(b)); i >= ((int)(a)); i--)
typedef long long ll;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++)
#define reg(i, a, b) for (int i = ((int)(a)); i <= ((int)(b)); i++)
#define irep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define ireg(i, a, b) for (int i = ((int)(b)); i >= ((int)(a)); i--)
typedef long long ll;
... | [
"assignment.change"
] | 879,631 | 879,632 | u372786981 | cpp |
p03064 | #include <bits/stdc++.h>
using namespace std;
#define ref(i, x, y) for (int i = x; i <= y; ++i)
#define def(i, x, y) for (int i = x; i >= y; --i)
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define SZ(x) ((int)x.size())
typedef long long LL;
typedef pair<int, int> PII;
int read() {
ch... | #include <bits/stdc++.h>
using namespace std;
#define ref(i, x, y) for (int i = x; i <= y; ++i)
#define def(i, x, y) for (int i = x; i >= y; --i)
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define SZ(x) ((int)x.size())
typedef long long LL;
typedef pair<int, int> PII;
int read() {
ch... | [
"call.arguments.change"
] | 879,645 | 879,646 | u813615206 | cpp |
p03064 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define N 305
const LL mod = 998044353;
LL n, sum, ans, a[N], f[N][N * N];
void upd(LL &x, LL y) { x = (x + y % mod + mod) % mod; }
int main() {
scanf("%lld", &n);
for (LL i = 1; i <= n; ++i) {
scanf("%lld", a + i);
sum += a[i];
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define N 305
const LL mod = 998244353;
LL n, sum, ans, a[N], f[N][N * N];
void upd(LL &x, LL y) { x = (x + y % mod + mod) % mod; }
int main() {
scanf("%lld", &n);
for (LL i = 1; i <= n; ++i) {
scanf("%lld", a + i);
sum += a[i];
}
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 879,660 | 879,661 | u225045588 | cpp |
p03065 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define ALL(c... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define ALL(c... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 879,709 | 879,710 | u742529680 | cpp |
p03065 | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = n; i >= 0; i--) {
cin >> a[i];
}
const int N = 45000;
vector<int> prime;
prime.reserve(N);
auto sieve = [&]() {
vector<bool> is(N + 1, true);
for (int p = 2; p * p <= N; p++) ... | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = n; i >= 0; i--) {
cin >> a[i];
}
const int N = 45000;
vector<int> prime;
prime.reserve(N);
auto sieve = [&]() {
vector<bool> is(N + 1, true);
for (int p = 2; p * p <= N; p++) ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 879,725 | 879,726 | u031986221 | cpp |
p03065 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#define fo(i, j, l) for (int i = j; i <= l; ++i)
#define fd(i, j, l) for (int i = j; i >= l; --i)
using namespace std;
typedef long long ll;
const ll N = 10010;
int n, oo;
ll a[N], b[N];
int ss[N];
bool bz[N];
inline ll ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#define fo(i, j, l) for (int i = j; i <= l; ++i)
#define fd(i, j, l) for (int i = j; i >= l; --i)
using namespace std;
typedef long long ll;
const ll N = 10010;
int n, oo;
ll a[N], b[N];
int ss[N];
bool bz[N];
inline ll ... | [
"control_flow.branch.if.condition.change"
] | 879,747 | 879,748 | u039629707 | cpp |
p03065 | #include <bits/stdc++.h>
int main() {
using namespace std;
unsigned long N;
cin >> N;
vector<long> prime, sieve(31622, 1);
for (long i = 2; i < 31622; ++i)
if (sieve[i]) {
prime.push_back(i);
for (auto j = i * i; j < 31622; j += i)
sieve[j] = 0;
}
vector<long> a(N + 1);
for (... | #include <bits/stdc++.h>
int main() {
using namespace std;
unsigned long N;
cin >> N;
vector<long> prime, sieve(31622, 1);
for (long i = 2; i < 31622; ++i)
if (sieve[i]) {
prime.push_back(i);
for (auto j = i * i; j < 31622; j += i)
sieve[j] = 0;
}
vector<long> a(N + 1);
for (... | [
"control_flow.branch.if.condition.change"
] | 879,757 | 879,758 | u462437857 | cpp |
p03065 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define REV(i, n) for (ll(i) = (n)-1; (i) >= 0; --i)
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v, n) ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define REV(i, n) for (ll(i) = (n)-1; (i) >= 0; --i)
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v, n) ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 879,776 | 879,777 | u382880969 | cpp |
p03068 | #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() {
string s;
int n, k;
cin >> n >> s >> k;
char c ... | #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() {
string s;
int n, k;
cin >> n >> s >> k;
char c ... | [
"assignment.change"
] | 879,802 | 879,803 | u543657872 | cpp |
p03069 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
const int lim = 1000000007;
const int INF = 100000000;
int main() {
int N;
cin >> N;
string S;
cin >> S;
// 1個の時はコーナーケースとして処理
if (N == 1) {
cout << 0 << endl;
return 0;
}
int wh... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
const int lim = 1000000007;
const int INF = 100000000;
int main() {
int N;
cin >> N;
string S;
cin >> S;
// 1個の時はコーナーケースとして処理
if (N == 1) {
cout << 0 << endl;
return 0;
}
int wh... | [
"variable_declaration.value.change",
"identifier.change"
] | 879,820 | 879,821 | u224794697 | cpp |
p03069 | #include <algorithm>
#include <iostream>
#include <map>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; (i) < (n); (i)++)
using namespace std;
using ll = long long;
int main(void) {
int N;
string S;
cin >> N >> S;
int numW = 0;
int numB = 0;
for (auto c : S) {
if (c == '.') {
... | #include <algorithm>
#include <iostream>
#include <map>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; (i) < (n); (i)++)
using namespace std;
using ll = long long;
int main(void) {
int N;
string S;
cin >> N >> S;
// BWBBW -> WWBBB
int numW = 0;
int numB = 0;
for (auto c : S) {
... | [
"identifier.change",
"expression.operation.binary.change",
"identifier.replace.add",
"literal.replace.remove"
] | 879,828 | 879,829 | u970109776 | cpp |
p03069 | #include <algorithm>
#include <iostream>
#include <map>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; (i) < (n); (i)++)
using namespace std;
using ll = long long;
int main(void) {
int N;
string S;
cin >> N >> S;
// BWBBW -> WWBBB
int numW = 0;
int numB = 0;
for (auto c : S) {
... | #include <algorithm>
#include <iostream>
#include <map>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; (i) < (n); (i)++)
using namespace std;
using ll = long long;
int main(void) {
int N;
string S;
cin >> N >> S;
// BWBBW -> WWBBB
int numW = 0;
int numB = 0;
for (auto c : S) {
... | [
"assignment.change"
] | 879,830 | 879,829 | u970109776 | cpp |
p03069 | // lcmとか__builtin_popcountとかはg++ -std=c++17 default.cppみたいなかんじで
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
#define No cout << "No" << endl
#define ... | // lcmとか__builtin_popcountとかはg++ -std=c++17 default.cppみたいなかんじで
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
#define No cout << "No" << endl
#define ... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"expression.unary.arithmetic.add",
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 879,831 | 879,832 | u683769494 | cpp |
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,833 | 879,834 | u225660136 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.