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 ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... | [] | 878,534 | 878,535 | u179778090 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> k >> s;
for (int i = 0; i < n; i++) {
if (s[i] != s[k + 1])
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;
} | [
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 878,541 | 878,542 | u528258842 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
char s[21];
cin >> n >> s >> k;
k--;
for (int i = 0; i <= n; i++) {
if (s[i] == s[k]) {
cout << s[i];
} else {
cout << "*";
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
char s[20];
cin >> n >> s >> k;
k--;
for (int i = 0; i < n; i++) {
if (s[i] == s[k]) {
cout << s[i];
} else {
cout << "*";
}
}
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 878,543 | 878,544 | u948917469 | cpp |
p03068 | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
string s;
cin >> s;
int k;
cin >> k;
for (int i = 0; i < n; i++) {
if (s[i] != s[k]) {
cout << "*";
} else {
cout << s[i];
}
}
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
string s;
cin >> s;
int k;
cin >> k;
k--;
for (int i = 0; i < n; i++) {
if (s[i] != s[k]) {
cout << "*";
} else {
cout << s[i];
}
}
}
| [
"expression.unary.arithmetic.add"
] | 878,545 | 878,546 | u520276780 | cpp |
p03068 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define pi 3.141592653589... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define pi 3.141592653589... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 878,551 | 878,552 | u158677249 | cpp |
p03068 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pll pair<ll, ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#d... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pll pair<ll, ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#d... | [
"identifier.change",
"expression.operation.binary.change"
] | 878,556 | 878,557 | u882039496 | cpp |
p03068 | // ABC_128_B// pair型の中にpair型
/*int main() {
int n;
cin >> n;
vector<pair<pair<string,int>,int>> a(n);
for(int i=0;i<n;i++){
string s;
cin >> s;
int num;
cin >> num;
num = num * -1;
a.at(i).first.first = s;
a.at(i).first.second = num;
a.at(i).second = i;
}
sort(a.begin(),... | // ABC_128_B// pair型の中にpair型
/*int main() {
int n;
cin >> n;
vector<pair<pair<string,int>,int>> a(n);
for(int i=0;i<n;i++){
string s;
cin >> s;
int num;
cin >> num;
num = num * -1;
a.at(i).first.first = s;
a.at(i).first.second = num;
a.at(i).second = i;
}
sort(a.begin(),... | [
"assignment.change"
] | 878,560 | 878,561 | u037563046 | cpp |
p03068 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
constexpr long long LINF = 1000000000100000000;
... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
constexpr long long LINF = 1000000000100000000;
... | [
"expression.unary.arithmetic.add"
] | 878,562 | 878,563 | u062736195 | cpp |
p03068 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <queue>
#include <string>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int N, K;
char S[10];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> S[i];
}
cin >> K;
for... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <queue>
#include <string>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int N, K;
char S[10];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> S[i];
}
cin >> K;
for... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 878,578 | 878,579 | u554988565 | 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.at(K - 1) != S.at(i))
S.at(K - 1) == '*';
cout << S.at(i);
}
cout << 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.at(K - 1) != S.at(i))
S.at(i) = '*';
cout << S.at(i);
}
cout << endl;
} | [
"assignment.variable.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 878,580 | 878,581 | u991713078 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
/* ------------------------------------------------ */
ll fact(int i) { //階乗
if (i == 0)
return 1;
return (fact(i - 1)) * i;
}
ll gcm(ll... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
/* ------------------------------------------------ */
ll fact(int i) { //階乗
if (i == 0)
return 1;
return (fact(i - 1)) * i;
}
ll gcm(ll... | [
"expression.unary.arithmetic.add"
] | 878,582 | 878,583 | u608773191 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
int n, k;
string s;
int main() {
cin >> n >> k >> s;
for (auto &c : s)
if (c != s[k - 1])
c = '*';
cout << s << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int n, k;
string s;
int main() {
cin >> n >> s >> k;
for (auto &c : s)
if (c != s[k - 1])
c = '*';
cout << s << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 878,595 | 878,596 | u269963329 | cpp |
p03068 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, k, i;
cin >> n;
char ar[n];
cin >> ar;
cin >> k;
char ch = ar[k - 1];
for (i = 0; i < n; i++) {
if (ar[i] == ch)
cout << "*";
else
cout << ar[i];
}
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, k, i;
cin >> n;
char ar[n];
cin >> ar;
cin >> k;
char ch = ar[k - 1];
for (i = 0; i < n; i++) {
if (ar[i] != ch)
cout << "*";
else
cout << ar[i];
}
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 878,600 | 878,601 | u861915705 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define sort(s) sort(s.begin(), s.end())
#define reverse(s) reverse(s.begin(), s.end())
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
const ll mod = 1e9 + 7;
//最大公約数
ll gcd(ll a, ll b) { return b ?... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define sort(s) sort(s.begin(), s.end())
#define reverse(s) reverse(s.begin(), s.end())
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
const ll mod = 1e9 + 7;
//最大公約数
ll gcd(ll a, ll b) { return b ?... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 878,618 | 878,619 | u584787460 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> s >> k;
int str = s[k - 1];
for (int i = 0; i < n; i++) {
if (str != s[i])
cout << '*';
else
cout << str;
}
cout << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> s >> k;
char str = s[k - 1];
for (int i = 0; i < n; i++) {
if (str != s[i])
cout << '*';
else
cout << str;
}
cout << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 878,629 | 878,630 | u459105164 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
// region template
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> ... | #include <bits/stdc++.h>
using namespace std;
// region template
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> ... | [
"control_flow.branch.if.condition.change"
] | 878,637 | 878,638 | u729337236 | cpp |
p03068 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
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;
return 0;
} | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
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;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 878,641 | 878,642 | u654240084 | cpp |
p03068 | #include <bits/stdc++.h>
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.at(i) != S.at(K)) {
S.at(i) = '*';
}
}
cout << S << endl;
}
| #include <bits/stdc++.h>
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.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"
] | 878,643 | 878,644 | u629548179 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
#define LL long int
const LL MOD = pow(10, 9) + 7;
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]) {
cout << s[i];
} else {
cout << '*';
}
}
cout << endl;
ret... | #include <bits/stdc++.h>
using namespace std;
#define LL long int
const LL MOD = pow(10, 9) + 7;
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]) {
cout << s[i];
} else {
cout << '*';
}
}
cout << endl;
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 878,647 | 878,648 | u798665594 | cpp |
p03068 | #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, k;
string s;
cin >> n >> s >> k;
string temp = s.substr(k, 1);
char c = *temp.c_str();
rep(i, n) {
if (c != s[i]) {
s[i] = '*';
}
}
cout << s << endl;
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, k;
string s;
cin >> n >> s >> k;
string temp = s.substr(k - 1, 1);
char c = *temp.c_str();
rep(i, n) {
if (c != s[i]) {
s[i] = '*';
}
}
cout << s << endl;... | [
"assignment.change"
] | 878,660 | 878,661 | u951073166 | 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.at(i) != s.at(k)) {
s.at(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.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"
] | 878,669 | 878,670 | u584169254 | cpp |
p03068 | //無断転用の一切を禁ずるよ//////////////////////////
#include <algorithm> //辞書順はnext_permutationだよ
#include <cmath>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stdio.h> //printするよ
#include <string.h>
#include <string>
#include <time.h>
#include <utility> //sw... | //無断転用の一切を禁ずるよ//////////////////////////
#include <algorithm> //辞書順はnext_permutationだよ
#include <cmath>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stdio.h> //printするよ
#include <string.h>
#include <string>
#include <time.h>
#include <utility> //sw... | [
"control_flow.branch.if.condition.change"
] | 878,675 | 878,676 | u742306624 | cpp |
p03068 | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#define pan(i, n) for (int i = 0; i < n; i++)
#define ll long long int
using namespace std;
int main() {
int n, k;
string s;
cin >> n;
cin >> s;
cin >> k;
char c[n];
strcpy(c, s.c_str());
char a = c[k];
pan(i, n) {
... | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#define pan(i, n) for (int i = 0; i < n; i++)
#define ll long long int
using namespace std;
int main() {
int n, k;
string s;
cin >> n;
cin >> s;
cin >> k;
char c[n];
strcpy(c, s.c_str());
char a = c[k - 1];
pan(i, n) {
... | [
"assignment.change"
] | 878,684 | 878,685 | u116744073 | cpp |
p03068 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define int long long
using namespace std;
typedef pair<int, int> P;
const int mod = 1000000007;
const int INF = 1e18;
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n, k;
string s;
cin >> n >> s >> k;
rep(i, 0, n... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define int long long
using namespace std;
typedef pair<int, int> P;
const int mod = 1000000007;
const int INF = 1e18;
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n, k;
string s;
cin >> n >> s >> k;
k--;
rep(... | [
"expression.unary.arithmetic.add"
] | 878,708 | 878,709 | u984730891 | cpp |
p03068 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, l;
string str, str2;
cin >> n;
cin >> str;
cin >> l;
str2 = str[l - 1];
rep(i, n) {
if (str[i] == str2[0]) {
str[i] = '*';
}
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, l;
string str, str2;
cin >> n;
cin >> str;
cin >> l;
str2 = str[l - 1];
rep(i, n) {
if (str[i] != str2[0]) {
str[i] = '*';
}
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 878,714 | 878,715 | u702051956 | cpp |
p03068 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> S >> K;
char c[N];
for (int i = 0; i < N; i++) {
if (S[K] != S[i])
c[i] = '*';
else
c[i] = S[K];
cout << c[i];
}
cout << endl;
}
| #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> S >> K;
char c[N];
for (int i = 0; i < N; i++) {
if (S[K - 1] != S[i])
c[i] = '*';
else
c[i] = S[K - 1];
cout << c[i];
}
cout << endl;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 878,720 | 878,721 | u937275419 | cpp |
p03068 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using... | [
"expression.unary.arithmetic.add"
] | 878,722 | 878,723 | u608258653 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
string s;
cin >> n >> s >> k;
for (int i = 0; i < n; i++) {
if (s[i] - s[k] != 0)
s[i] = '*';
}
cout << s << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
string s;
cin >> n >> s >> k;
for (int i = 0; i < n; i++) {
if (s[i] - s[k - 1] != 0)
s[i] = '*';
}
cout << s << "\n";
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 878,726 | 878,727 | u211227348 | cpp |
p03068 | #include <stdio.h>
int main() {
int N, K;
scanf("%d", &N);
char mozi[N], m[1];
scanf("%s", mozi);
scanf("%d", &K);
m[0] = mozi[K];
for (int i = 0; i < N; i++) {
if (mozi[i] != m[0])
mozi[i] = '*';
}
printf("%s\n", mozi);
return 0;
} | #include <stdio.h>
int main() {
int N, K;
scanf("%d", &N);
char mozi[N], m[1];
scanf("%s", mozi);
scanf("%d", &K);
m[0] = mozi[K - 1];
for (int i = 0; i < N; i++) {
if (mozi[i] != m[0])
mozi[i] = '*';
}
printf("%s\n", mozi);
return 0;
} | [
"assignment.change"
] | 878,730 | 878,731 | u456658814 | cpp |
p03068 | #include <stdio.h>
int main() {
int N, K;
scanf("%d", &N);
char mozi[N], m[1];
scanf("%s", mozi);
scanf("%d", &K);
m[0] = mozi[K];
for (int i = 0; i < N; i++) {
if (mozi[i] == m[0])
mozi[i] = '*';
}
printf("%s\n", mozi);
return 0;
} | #include <stdio.h>
int main() {
int N, K;
scanf("%d", &N);
char mozi[N], m[1];
scanf("%s", mozi);
scanf("%d", &K);
m[0] = mozi[K - 1];
for (int i = 0; i < N; i++) {
if (mozi[i] != m[0])
mozi[i] = '*';
}
printf("%s\n", mozi);
return 0;
} | [
"assignment.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 878,732 | 878,731 | u456658814 | cpp |
p03068 | #include <stdio.h>
int main() {
int N, K;
scanf("%d", N);
char mozi[N], m[1];
scanf("%s", mozi);
scanf("%d", &K);
m[0] = mozi[K];
for (int i = 0; i < N; i++) {
if (mozi[i] == m[0])
mozi[i] = '*';
}
printf("%s", mozi);
return 0;
} | #include <stdio.h>
int main() {
int N, K;
scanf("%d", &N);
char mozi[N], m[1];
scanf("%s", mozi);
scanf("%d", &K);
m[0] = mozi[K - 1];
for (int i = 0; i < N; i++) {
if (mozi[i] != m[0])
mozi[i] = '*';
}
printf("%s\n", mozi);
return 0;
} | [
"expression.operation.unary.reference.add",
"assignment.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 878,733 | 878,731 | u456658814 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int int_len(int n) {
int s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
int int_sum(int n) {
int m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (int i = s - 1; i >= 0; i--)
m += n / ((int)pow(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int int_len(int n) {
int s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
int int_sum(int n) {
int m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (int i = s - 1; i >= 0; i--)
m += n / ((int)pow(... | [] | 878,734 | 878,735 | u264265458 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n;
string s;
cin >> s;
cin >> k;
for (int i = 0; i < n; i++) {
if (s[i] == s[k])
cout << s[i];
else
cout << "*";
}
cout << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n;
string s;
cin >> s;
cin >> k;
for (int i = 0; i < n; i++) {
if (s[i] == s[k - 1])
cout << s[i];
else
cout << "*";
}
cout << "\n";
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 878,743 | 878,744 | u031686335 | cpp |
p03068 | #include <iostream>
using namespace std;
int main() {
int n, k;
char s[10000];
cin >> n;
for (int i = 0; i < n; i++)
cin >> s[i];
cin >> k;
for (int i = 0; i < n; i++) {
if (s[k] == s[i])
cout << s[i];
else
cout << "*";
}
cout << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, k;
char s[10000];
cin >> n;
for (int i = 0; i < n; i++)
cin >> s[i];
cin >> k;
for (int i = 0; i < n; i++) {
if (s[k - 1] == s[i])
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"
] | 878,755 | 878,756 | u490965711 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
char s[15];
cin >> n;
for (int i = 0; i < n; i++)
cin >> s[i];
cin >> k;
for (int i = 0; i < n; i++)
if (s[k] != s[i])
s[i] = '*';
for (int i = 0; i < n; i++)
cout << s[i];
cout << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
char s[15];
cin >> n;
for (int i = 1; i <= n; i++)
cin >> s[i];
cin >> k;
for (int i = 1; i <= n; i++)
if (s[k] != s[i])
s[i] = '*';
for (int i = 1; i <= n; i++)
cout << s[i];
cout << '\n';
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 878,757 | 878,758 | u623468376 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
int main() {
char S[1000];
int N, K;
cin >> N;
cin >> S;
cin >> K;
for (int i = 0; i < N; i++) {
if (S[i] == S[K])
cout << S[i];
else
cout << "*";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char S[1000];
int N, K;
cin >> N;
cin >> S;
cin >> K;
K--;
for (int i = 0; i < N; i++) {
if (S[i] == S[K])
cout << S[i];
else
cout << "*";
}
return 0;
} | [
"expression.unary.arithmetic.add"
] | 878,773 | 878,774 | u757389058 | cpp |
p03068 | #include <bits/stdc++.h>
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.at(i) != S.at(K)) {
S.at(i) = '*';
}
}
cout << S << endl;
} | #include <bits/stdc++.h>
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.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"
] | 878,775 | 878,776 | u410041382 | cpp |
p03068 | #include <iostream>
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;
} | #include <iostream>
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;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 878,787 | 878,788 | u849073847 | cpp |
p03068 | #include <stdio.h>
int main(void) {
char str[100] = {0};
int n, k;
scanf("%d", &n);
getchar();
fgets(str, 100, stdin);
scanf("%d", &k);
getchar();
for (int i = 0; i < n; i++) {
if (str[i] == str[k - 1]) {
str[i] = '*';
}
}
printf("%s", str);
return 0;
} | #include <stdio.h>
int main(void) {
char str[100] = {0};
int n, k;
scanf("%d", &n);
getchar();
fgets(str, 100, stdin);
scanf("%d", &k);
getchar();
for (int i = 0; i < n; i++) {
if (str[i] != str[k - 1]) {
str[i] = '*';
}
}
printf("%s", str);
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 878,789 | 878,790 | u337266378 | cpp |
p03068 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int n, k;
string s;
char x;
int main() {
cin >> n >> s >> k;
x = s[k];
for (int i = 0; i < n; i++) {
if (x != s[i])
s[i] = '*';
}
cout << s << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int n, k;
string s;
char x;
int main() {
cin >> n >> s >> k;
x = s[k - 1];
for (int i = 0; i < n; i++) {
if (x != s[i])
s[i] = '*';
}
cout << s << endl;
return 0;
} | [
"assignment.change"
] | 878,796 | 878,797 | u519950235 | cpp |
p03068 | #include <algorithm>
#include <cmath>
#include <complex> // complex<double> a(1.2 , 2.3);// real(): 1.2, imag()2.3
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define MOD 1000000007
#define ll long long
#define ld long double
#define ... | #include <algorithm>
#include <cmath>
#include <complex> // complex<double> a(1.2 , 2.3);// real(): 1.2, imag()2.3
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define MOD 1000000007
#define ll long long
#define ld long double
#define ... | [
"expression.operation.binary.remove"
] | 878,800 | 878,801 | u866107333 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), ... | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), ... | [
"control_flow.branch.if.condition.change"
] | 878,802 | 878,803 | u452725238 | cpp |
p03068 | #include <iostream>
using namespace std;
int main(void) {
int N, K;
string s;
cin >> N >> s >> K;
for (int i = 0; i < s.size(); i++) {
if (s[i] != s[K])
s[i] = '*';
}
cout << s << endl;
}
| #include <iostream>
using namespace std;
int main(void) {
int N, K;
string s;
cin >> N >> s >> K;
for (int i = 0; i < s.size(); 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"
] | 878,804 | 878,805 | u843558164 | cpp |
p03068 | #include <bits/stdc++.h>
#define mins(a, b) a = min(a, b)
#define maxs(a, b) a = max(a, b)
template <typename T> std::string to_string(const T &n) {
std::ostringstream stm;
stm << n;
return stm.str();
}
using namespace std;
const long long INF = 9000000000000000;
int main() {
int n, k;
string s;
cin >> n >... | #include <bits/stdc++.h>
#define mins(a, b) a = min(a, b)
#define maxs(a, b) a = max(a, b)
template <typename T> std::string to_string(const T &n) {
std::ostringstream stm;
stm << n;
return stm.str();
}
using namespace std;
const long long INF = 9000000000000000;
int main() {
int n, k;
string s;
cin >> n >... | [
"literal.string.change",
"io.output.change"
] | 878,808 | 878,809 | u127856129 | cpp |
p03068 | #include <bits/stdc++.h>
#define mins(a, b) a = min(a, b)
#define maxs(a, b) a = max(a, b)
template <typename T> std::string to_string(const T &n) {
std::ostringstream stm;
stm << n;
return stm.str();
}
using namespace std;
const long long INF = 9000000000000000;
int main() {
int n, k;
string s;
cin >> n >... | #include <bits/stdc++.h>
#define mins(a, b) a = min(a, b)
#define maxs(a, b) a = max(a, b)
template <typename T> std::string to_string(const T &n) {
std::ostringstream stm;
stm << n;
return stm.str();
}
using namespace std;
const long long INF = 9000000000000000;
int main() {
int n, k;
string s;
cin >> n >... | [] | 878,810 | 878,809 | u127856129 | 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.at(i) != s.at(k)) {
s.at(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.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"
] | 878,815 | 878,816 | u646051775 | cpp |
p03068 | #include "bits/stdc++.h"
using namespace std;
void solve(void) {
int n, k;
string s;
cin >> n >> s >> k;
for (int i = 0; i < n; i++) {
cout << (s[i] == s[k] ? s[k] : '*');
}
cout << endl;
}
int main() {
solve();
// cout << "yui(*-v・)yui" << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
void solve(void) {
int n, k;
string s;
cin >> n >> s >> k;
for (int i = 0; i < n; i++) {
cout << (s[i] == s[k - 1] ? s[k - 1] : '*');
}
cout << endl;
}
int main() {
solve();
// cout << "yui(*-v・)yui" << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 878,823 | 878,824 | u344412812 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> S >> K;
char a = S.at(K - 1);
for (int i = 0; i < N; i++) {
if (S.at(i) != a)
S.at(i) = '+';
}
cout << S << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
string S;
cin >> N >> S >> K;
char a = S.at(K - 1);
for (int i = 0; i < N; i++) {
if (S.at(i) != a)
S.at(i) = '*';
}
cout << S << endl;
}
| [
"literal.string.change",
"expression.operator.arithmetic.change",
"assignment.value.change"
] | 878,844 | 878,845 | u222866518 | cpp |
p03068 | #include <iostream>
int main() {
int N;
std::string S;
int K;
std::cin >> N >> S >> K;
char P;
P = S[K - 1];
for (int i = 0; i < N; i++) {
if (S[i] != P) {
std::cout << "＊";
} else {
std::cout << S[i];
}
}
std::cout << std::endl;
return 0;
} | #include <iostream>
int main() {
int N;
std::string S;
int K;
std::cin >> N >> S >> K;
char P;
P = S[K - 1];
for (int i = 0; i < N; i++) {
if (S[i] != P) {
std::cout << "*";
} else {
std::cout << S[i];
}
}
std::cout << std::endl;
return 0;
} | [
"literal.string.change",
"expression.operation.binary.change"
] | 878,856 | 878,857 | u329731898 | cpp |
p03068 | #include <iostream>
#include <string>
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]) {
cout << S[i];
} else {
cout << "*";
}
}
cout << endl;
return 0;
} | #include <iostream>
#include <string>
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]) {
cout << S[i];
} else {
cout << "*";
}
}
cout << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 878,858 | 878,859 | u005317312 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> s >> k;
char target = s[k];
for (int i = 0; i < n; i++) {
if (s[i] != target)
s[i] = '*';
}
cout << s << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> s >> k;
char target = s[k - 1];
for (int i = 0; i < n; i++) {
if (s[i] != target)
s[i] = '*';
}
cout << s << endl;
}
| [
"assignment.change"
] | 878,868 | 878,869 | u351482714 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
#define Rep(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
int main() {
int n, k;
string s;
cin >> n;
cin >> s;
cin >> k;
rep(i, s.length()) {
if (s[i] !... | #include <bits/stdc++.h>
using namespace std;
#define Rep(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
int main() {
int n, k;
string s;
cin >> n;
cin >> s;
cin >> k;
rep(i, s.length()) {
if (s[i] !... | [
"control_flow.branch.if.condition.change"
] | 878,870 | 878,871 | u934105772 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1e18, MOD = 1e9 + 7;
int main() {
ll n, k;
string s;
cin >> n >> s >> k;
for (int i = 0; i < s.length(); i++) {
if (s[i] == s[k])
cout << s[i];
else
cout << "*";
}
cout << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1e18, MOD = 1e9 + 7;
int main() {
ll n, k;
string s;
cin >> n >> s >> k;
k--;
for (int i = 0; i < s.length(); i++) {
if (s[i] == s[k])
cout << s[i];
else
cout << "*";
}
cout << endl;
}
| [
"expression.unary.arithmetic.add"
] | 878,874 | 878,875 | u952437626 | cpp |
p03068 | #include <iostream>
#include <string>
int main() {
std::string s;
int n, k;
std::cin >> n >> s >> k;
const char &c = s[k];
for (int i = 0; i < n; ++i) {
std::cout << ((s[i] != c) ? '*' : s[i]);
}
return 0;
} | #include <iostream>
#include <string>
int main() {
std::string s;
int n, k;
std::cin >> n >> s >> k;
const char &c = s[k - 1];
for (int i = 0; i < n; ++i) {
std::cout << ((s[i] != c) ? '*' : s[i]);
}
return 0;
} | [
"assignment.change"
] | 878,884 | 878,885 | u186898529 | cpp |
p03068 | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define endl '\n'
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, a, b) for (int i = int(a); i < int(b); i++)
#define pb emplace_back
#define all(x) (x).begin(), (x).end()
int mod = 1e9 + 7;
int mod2 = 998244353;
const int INF = 1e... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define endl '\n'
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, a, b) for (int i = int(a); i < int(b); i++)
#define pb emplace_back
#define all(x) (x).begin(), (x).end()
int mod = 1e9 + 7;
int mod2 = 998244353;
const int INF = 1e... | [] | 878,890 | 878,891 | u890465662 | cpp |
p03068 | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define endl '\n'
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, a, b) for (int i = int(a); i < int(b); i++)
#define pb emplace_back
#define all(x) (x).begin(), (x).end()
int mod = 1e9 + 7;
int mod2 = 998244353;
const int INF = 1e... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define endl '\n'
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, a, b) for (int i = int(a); i < int(b); i++)
#define pb emplace_back
#define all(x) (x).begin(), (x).end()
int mod = 1e9 + 7;
int mod2 = 998244353;
const int INF = 1e... | [
"expression.unary.arithmetic.add"
] | 878,892 | 878,891 | u890465662 | cpp |
p03068 | #include <bits/stdc++.h>
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;
}
| #include <bits/stdc++.h>
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;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 878,893 | 878,894 | u618697411 | cpp |
p03068 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <uno... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <uno... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 878,895 | 878,896 | u492373312 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int k;
cin >> k;
k--;
char ofc = s[k];
for (int i = 0; i < n; i++) {
if (i == k)
continue;
else {
if (s[i] == ofc) {
s[i] = '*';
}
}
}
cout << s << endl;
return... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int k;
cin >> k;
k--;
char ofc = s[k];
for (int i = 0; i < n; i++) {
if (i == k)
continue;
else {
if (s[i] != ofc) {
s[i] = '*';
}
}
}
cout << s << endl;
retur... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 878,899 | 878,900 | u430341757 | cpp |
p03068 | #include <iomanip>
#include <iostream>
// std::cout << std::setprecision(2) << 3.141; // "3.1"
#include <algorithm>
#include <cmath>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plglg;
typedef pair<double, ll> pdlg;
type... | #include <iomanip>
#include <iostream>
// std::cout << std::setprecision(2) << 3.141; // "3.1"
#include <algorithm>
#include <cmath>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plglg;
typedef pair<double, ll> pdlg;
type... | [
"assignment.change"
] | 878,905 | 878,906 | u746560455 | cpp |
p03068 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define ENDL "\n"
typedef long long int llint;
int main() {
int N;
string S;
int K;
cin >> N >> S >> K;
for (int i = 0; i < N; i++) {
if (S[i] == S[K]) {
cout << S[i];
} else {
cout << "*";
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define ENDL "\n"
typedef long long int llint;
int main() {
int N;
string S;
int K;
cin >> N >> S >> K;
K--;
for (int i = 0; i < N; i++) {
if (S[i] == S[K]) {
cout << S[i];
} else {
cout <... | [
"expression.unary.arithmetic.add"
] | 878,907 | 878,908 | u402629484 | cpp |
p03068 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
const int mod = 1e9 + 7;
const int INF = 1e9;
using namespace std;
typedef long long ll;
int main() {
int n;
string s;
int k;
cin >> n >> s >> k;
char x = s[k];... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
const int mod = 1e9 + 7;
const int INF = 1e9;
using namespace std;
typedef long long ll;
int main() {
int n;
string s;
int k;
cin >> n >> s >> k;
char x = s[k -... | [
"assignment.change"
] | 878,909 | 878,910 | u883323885 | cpp |
p03068 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
char s[11];
for (int i = 0; i < N; i++)
cin >> s[i];
int K;
cin >> K;
for (int i = 0; i < N; i++) {
if (s[i] == s[K])
cout << s[i];
else
cout << '*';
}
cout << endl;
} | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
char s[11];
for (int i = 0; i < N; i++)
cin >> s[i];
int K;
cin >> K;
K--;
for (int i = 0; i < N; i++) {
if (s[i] == s[K])
cout << s[i];
else
cout << '*';
}
cout << endl;
}
| [
"expression.unary.arithmetic.add"
] | 878,913 | 878,914 | u058186113 | cpp |
p03068 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int k;
cin >> k;
for (int i = 0; i < s.length(); i++) {
if (s[i] != s[k]) {
s[i] = '*';
}
}
cout << s << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int k;
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"
] | 878,917 | 878,918 | u891531063 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const double EPS = 1e-15;
using ll = long long;
using ull = unsigned long long;
const int inf = 2e9;
const ll INF = 2e18;
const ll MOD = 1e9 + 7;
const ll MOD1 = 998244353;
typedef pair<int, int> P;
#define REP(i, n) for (int i = 0; i < (n); i+... | #include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const double EPS = 1e-15;
using ll = long long;
using ull = unsigned long long;
const int inf = 2e9;
const ll INF = 2e18;
const ll MOD = 1e9 + 7;
const ll MOD1 = 998244353;
typedef pair<int, int> P;
#define REP(i, n) for (int i = 0; i < (n); i+... | [
"expression.unary.arithmetic.add"
] | 878,919 | 878,920 | u891178744 | cpp |
p03068 | #include <bits/stdc++.h>
#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++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long... | #include <bits/stdc++.h>
#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++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 878,921 | 878,922 | u511379665 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
void solve();
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
solve();
};
typedef long long ll;
template <typename Type> void print_collection(Type coll) {
cout << "{ ";
for (auto e : coll)
cout << e << ' ';
cout << "}\n";
}
void solve() {
int n, k;
st... | #include <bits/stdc++.h>
using namespace std;
void solve();
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
solve();
};
typedef long long ll;
template <typename Type> void print_collection(Type coll) {
cout << "{ ";
for (auto e : coll)
cout << e << ' ';
cout << "}\n";
}
void solve() {
int n, k;
st... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 878,923 | 878,924 | u246108530 | 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] = '*';
}
}
std::cout << s << std::endl;
}
| #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] = '*';
}
}
std::cout << s << std::endl;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 878,925 | 878,926 | u687765150 | cpp |
p03068 | #include <iostream>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> s >> k;
for (int i = 0; i < s.size(); i++) {
if (s[i] != s[k]) {
s[i] = '*';
}
}
cout << s << endl;
}
| #include <iostream>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> s >> k;
for (int i = 0; i < s.size(); 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"
] | 878,931 | 878,932 | u203045601 | cpp |
p03068 | #include <iostream>
#include <string>
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;
}
| #include <iostream>
#include <string>
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;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 878,933 | 878,934 | u122571613 | 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(i) != S.at(K)) {
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;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 878,935 | 878,936 | u346059918 | cpp |
p03068 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int k;
cin >> k;
char c = s[k];
string ans = s;
for (int i = 0; i < s.length(); i++) {
ans[i] = ans[i] == c ? c : '*';
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int k;
cin >> k;
char c = s[k - 1];
string ans = s;
for (int i = 0; i < s.length(); i++) {
ans[i] = ans[i] == c ? c : '*';
}
cout << ans << endl;
return 0;
}
| [
"assignment.change"
] | 878,940 | 878,941 | u880126159 | cpp |
p03068 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define FOR(idx, begin, end) \
for (int idx = (int)(begin); idx < (int)(end); ++idx)
#if... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define FOR(idx, begin, end) \
for (int idx = (int)(begin); idx < (int)(end); ++idx)
#if... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 878,942 | 878,943 | u532573979 | cpp |
p03068 | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ... | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ... | [
"control_flow.branch.if.condition.change"
] | 878,946 | 878,947 | u239493918 | cpp |
p03068 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> s >> k;
char a = s[k - 1];
for (int i = 0; i < n; i++) {
if (s[i] != a) {
s[i] == '*';
}
}
cout << s << endl;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> s >> k;
char a = s[k - 1];
for (int i = 0; i < n; i++) {
if (s[i] != a) {
s[i] = '*';
}
}
cout << s << endl;
}
| [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 878,948 | 878,949 | u401900157 | cpp |
p03068 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> s >> k;
char a = s[k - 1];
for (int i = 0; i < n; i++) {
if (s[i] != a) {
s[i] == '*';
}
}
cout << s << endl;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> s >> k;
char a = s[k - 1];
for (int i = 0; i < n; i++) {
if (s[i] != a) {
s[i] = '*';
}
}
cout << s << endl;
}
| [
"import.add",
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 878,950 | 878,949 | u401900157 | cpp |
p03068 | #include <iostream>
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 << endl;
}
| #include <iostream>
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 << endl;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 878,951 | 878,952 | u234531758 | cpp |
p03068 | #include <iostream>
#include <string>
int main() {
int N;
std::string S;
int K;
std::cin >> N;
std::cin >> S;
std::cin >> K;
for (int i = 0; i < N; ++i) {
if (S[i] == S[K - 1]) {
std::cout << S[K];
} else {
std::cout << "*";
}
}
return 0;
} | #include <iostream>
#include <string>
int main() {
int N;
std::string S;
int K;
std::cin >> N;
std::cin >> S;
std::cin >> K;
for (int i = 0; i < N; ++i) {
if (S[i] == S[K - 1]) {
std::cout << S[K - 1];
} else {
std::cout << "*";
}
}
return 0;
} | [
"expression.operation.binary.add"
] | 878,956 | 878,957 | u531942163 | cpp |
p03068 | #include <iostream>
#include <string>
int main() {
int N;
std::string S;
int K;
std::cin >> N;
std::cin >> S;
std::cin >> K;
for (int i = 0; i < N; ++i) {
if (S[i] == S[K]) {
std::cout << S[K];
} else {
std::cout << "*";
}
}
return 0;
} | #include <iostream>
#include <string>
int main() {
int N;
std::string S;
int K;
std::cin >> N;
std::cin >> S;
std::cin >> K;
for (int i = 0; i < N; ++i) {
if (S[i] == S[K - 1]) {
std::cout << S[K - 1];
} else {
std::cout << "*";
}
}
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 878,958 | 878,957 | u531942163 | cpp |
p03068 | #include <iostream>
#include <string>
int main() {
int N;
std::string S;
int K;
std::cin >> N;
std::cin >> S;
std::cin >> K;
for (int i; i < N; ++i) {
if (S[i] == S[K]) {
std::cout << S[K];
} else {
std::cout << "*";
}
}
return 0;
} | #include <iostream>
#include <string>
int main() {
int N;
std::string S;
int K;
std::cin >> N;
std::cin >> S;
std::cin >> K;
for (int i = 0; i < N; ++i) {
if (S[i] == S[K - 1]) {
std::cout << S[K - 1];
} else {
std::cout << "*";
}
}
return 0;
} | [
"control_flow.loop.for.initializer.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 878,959 | 878,957 | u531942163 | cpp |
p03068 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
typede... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
typede... | [
"control_flow.branch.if.condition.change"
] | 878,962 | 878,963 | u254521846 | cpp |
p03068 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
#pragma comment(linker, "/STACK:66777216")
using namespace std;
#define ll long long
#define ld long double
int main() {
ios_base::sync_with_... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
#pragma comment(linker, "/STACK:66777216")
using namespace std;
#define ll long long
#define ld long double
int main() {
ios_base::sync_with_... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"misc.off_by_one"
] | 878,964 | 878,965 | u751113156 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
int main() {
int b, n;
cin >> n;
char a[20];
cin >> a;
cin >> b;
for (int i = 0; i < n; i++) {
if (a[i] != a[b]) {
cout << "*";
} else
cout << a[i];
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int b, n;
cin >> n;
char a[20];
cin >> a;
cin >> b;
for (int i = 0; i < n; i++) {
if (a[i] != a[b - 1]) {
cout << "*";
} else
cout << a[i];
}
cout << endl;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 878,969 | 878,970 | u501363790 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, i;
char c[11];
scanf("%d", &a);
getchar();
scanf("%s", c);
scanf("%d", &b);
for (i = 0; i < a; i++) {
if (c[i] == c[b])
printf("%c", c[i]);
else
printf("*");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, i;
char c[11];
scanf("%d", &a);
getchar();
scanf("%s", c);
scanf("%d", &b);
for (i = 0; i < a; i++) {
if (c[i] == c[b - 1])
printf("%c", c[i]);
else
printf("*");
}
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 878,971 | 878,972 | u356929542 | cpp |
p03068 | #include <iostream>
#include <string>
using namespace std;
int main(int argc, char *argv[]) {
int N, K;
string S;
cin >> N;
cin >> S;
cin >> K;
// string a = S[K];
char a = S[K];
string ans;
for (int i = 0; i < N; i++) {
if (S[i] != a)
ans.push_back('*');
else
ans.push_back(S[i... | #include <iostream>
#include <string>
using namespace std;
int main(int argc, char *argv[]) {
int N, K;
string S;
cin >> N;
cin >> S;
cin >> K;
char a = S[K - 1];
string ans;
for (int i = 0; i < N; i++) {
if (S[i] != a)
ans.push_back('*');
else
ans.push_back(S[i]);
}
cout << ... | [
"assignment.change"
] | 878,975 | 878,976 | u698571659 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> s >> k;
char 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;
int main() {
int n, k;
string s;
cin >> n >> s >> k;
char 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"
] | 878,983 | 878,984 | u974931918 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N;
string s;
cin >> s >> K;
char x;
x = s.at(K);
for (int i = 0; i < N; i++) {
if (x != s.at(i)) {
cout << "*";
} else {
cout << x;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N;
string s;
cin >> s >> K;
char x;
x = s.at(K - 1);
for (int i = 0; i < N; i++) {
if (x != s.at(i)) {
cout << "*";
} else {
cout << x;
}
}
} | [
"assignment.change"
] | 878,985 | 878,986 | u041855176 | cpp |
p03068 | #include <bits/stdc++.h>
#define INF 100100100
#define MOD 1000000007
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main() {
int N, K;
string S;
cin >> N >> S >> K;
for (int i = 0; i < N; i++) {
if (S[K] != S[i]) {
S[i] = '*';
}
}
cout << S << endl;
ret... | #include <bits/stdc++.h>
#define INF 100100100
#define MOD 1000000007
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main() {
int N, K;
string S;
cin >> N >> S >> 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"
] | 878,992 | 878,993 | u453634104 | cpp |
p03068 | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N;
string S;
cin >> S >> K;
for (int i = 0; i < N - 1; i++) {
if (S[i] != S[K - 1]) {
S[i] = '*';
}
}
cout << S;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N;
string S;
cin >> S >> K;
for (int i = 0; i < N; i++) {
if (S[i] != S[K - 1]) {
S[i] = '*';
}
}
cout << S;
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 879,025 | 879,026 | u490963780 | cpp |
p03068 | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N;
string S;
cin >> S >> K;
for (int i = 0; i < N - 1; i++) {
if (S[i] != S[K + 1]) {
S[i] = '*';
}
}
cout << S;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N;
string S;
cin >> S >> K;
for (int i = 0; i < N; i++) {
if (S[i] != S[K - 1]) {
S[i] = '*';
}
}
cout << S;
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 879,027 | 879,026 | u490963780 | cpp |
p03068 | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N;
string S;
cin >> S >> K;
for (int i = 0; i < N; i++) {
if (S[i] != S[K]) {
S[i] = '*';
}
}
cout << S;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N;
string S;
cin >> S >> K;
for (int i = 0; i < N; i++) {
if (S[i] != S[K - 1]) {
S[i] = '*';
}
}
cout << S;
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 879,028 | 879,026 | u490963780 | 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 - 1])
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;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 879,038 | 879,039 | u339937125 | cpp |
p03068 | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, k;
char str[10];
scanf("%d", &n);
scanf("%s", str);
scanf("%d", &k);
for (int i = 0; i < n; i++) {
if (str[i + 1] != str[k]) {
str[i] = '*';
}
}
printf("%s", str);
return 0;
} | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, k;
char str[10];
scanf("%d", &n);
scanf("%s", str);
scanf("%d", &k);
k--;
for (int i = 0; i < n; i++) {
if (str[i] != str[k]) {
str[i] = '*';
}
}
printf("%s", str);
return 0;
} | [
"expression.unary.arithmetic.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 879,047 | 879,048 | u152050779 | cpp |
p03068 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string a;
cin >> a;
int k;
cin >> k;
k--;
char x = a[k];
for (int i = 0; i < n; i++) {
if (a[i] == x)
cout << "x";
else
cout << "*";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string a;
cin >> a;
int k;
cin >> k;
k--;
char x = a[k];
for (int i = 0; i < n; i++) {
if (a[i] == x)
cout << x;
else
cout << "*";
}
return 0;
} | [] | 879,051 | 879,052 | u432702669 | cpp |
p03068 | #include <iostream>
#include <string>
using namespace std;
int main() {
int k, n;
string s;
cin >> n >> s >> k;
char hoge = s.at(k);
for (auto &&i = s.begin(); i < s.end(); i++) {
if (*i != hoge) {
*i = '*';
}
}
cout << s << endl;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int k, n;
string s;
cin >> n >> s >> k;
char hoge = s.at(k - 1);
for (auto &&i = s.begin(); i < s.end(); i++) {
if (*i != hoge) {
*i = '*';
}
}
cout << s << endl;
}
| [
"assignment.change"
] | 879,057 | 879,058 | u324072562 | cpp |
p03068 | #include <stdio.h>
int main() {
int a, b;
char c[10];
int i;
char tmp;
scanf("%d\n", &a);
for (i = 0; i < a; i++) {
scanf("%c\n", &c[i]);
}
scanf("%d", &b);
tmp = c[b];
for (i = 0; i < a; i++) {
if (c[i] != c[b]) {
c[i] = '*';
}
printf("%c", c[i]);
}
printf("\n");
return... | #include <stdio.h>
int main() {
int a, b;
char c[10];
int i;
char tmp;
scanf("%d\n", &a);
for (i = 0; i < a; i++) {
scanf("%c\n", &c[i]);
}
scanf("%d", &b);
b = b - 1;
tmp = c[b];
for (i = 0; i < a; i++) {
if (c[i] != c[b]) {
c[i] = '*';
}
printf("%c", c[i]);
}
printf("\... | [
"assignment.add"
] | 879,061 | 879,062 | u251610528 | cpp |
p03068 | #include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
string s;
cin >> n;
cin >> s;
cin >> k;
for (int i = 1; i <= n; i++) {
if (s[i] != s[k])
s[i] = '*';
}
cout << s << endl;
} | #include <bits/stdc++.h>
#include <string>
#include <vector>
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;
} | [
"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",
"control_flow.branch.if.condition.change",
"misc.of... | 879,067 | 879,068 | u672995180 | cpp |
p03068 | #include <bits/stdc++.h>
#include <string>
#include <vector>
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;
} | #include <bits/stdc++.h>
#include <string>
#include <vector>
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;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 879,069 | 879,068 | u672995180 | cpp |
p03068 | #include <iostream>
using namespace std;
int main() {
int n, k;
string s, result;
cin >> n;
cin >> s;
cin >> k;
char repl = s[k - 1];
result = "";
for (int i = 0; i < n; i++) {
char k = s[i];
if (repl == k) {
result += "*";
} else {
result += k;
}
}
cout << result <... | #include <iostream>
using namespace std;
int main() {
int n, k;
string s, result;
cin >> n;
cin >> s;
cin >> k;
char repl = s[k - 1];
result = "";
for (int i = 0; i < n; i++) {
char k = s[i];
if (repl != k) {
result += "*";
} else {
result += k;
}
}
cout << result <... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 879,093 | 879,094 | u019035087 | cpp |
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"
] | 879,095 | 879,096 | u299377613 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.