problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
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) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
#define PB push_back
#define INF 1e9
#define MOD 1e9 + 7
#define EPS 1e-9
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
string S;
cin >> N >> S >> K;
char ch = S[K + 1];
for (int i = 0; i < (int)S.length(); i++) {
if (S[i] == ch)
S[i] = '*';
}
cout << S << endl;
return 0;
} | #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) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
#define PB push_back
#define INF 1e9
#define MOD 1e9 + 7
#define EPS 1e-9
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
string S;
cin >> N >> S >> K;
char ch = S[K - 1];
for (int i = 0; i < (int)S.length(); i++) {
if (S[i] != ch)
S[i] = '*';
}
cout << S << endl;
return 0;
} | [
"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])
cout << s[i];
else
cout << "*";
}
cout << endl;
} | #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])
cout << s[i];
else
cout << "*";
}
cout << endl;
} | [
"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;
cin >> s;
cin >> k;
targ = s[k];
for (int i = 0; i < n; i++) {
if (s[i] != targ[0])
s[i] = '*';
}
cout << s << endl;
} | #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;
cin >> s;
cin >> k;
targ = s[k - 1];
for (int i = 0; i < n; i++) {
if (s[i] != targ[0])
s[i] = '*';
}
cout << s << endl;
} | [
"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++)
inline constexpr int intpow(ll a, ll b) {
if (b == 0)
return 1;
ll ans = intpow(a, b / 2);
return ans * ans * (b & 1 ? a : 1);
}
inline constexpr int modpow(ll a, ll b) {
if (b == 0)
return 1;
ll ans = intpow(a, b / 2);
return ans * ans % MOD * (b & 1 ? a : 1) % MOD;
}
int main() {
ll n, k;
cin >> n;
string s, t;
cin >> s;
cin >> k;
rep(i, 0, n) {
if (s[i] == s[k])
t[i] = s[k];
else
t[i] = '*';
}
rep(i, 0, n) cout << t[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++)
inline constexpr int intpow(ll a, ll b) {
if (b == 0)
return 1;
ll ans = intpow(a, b / 2);
return ans * ans * (b & 1 ? a : 1);
}
inline constexpr int modpow(ll a, ll b) {
if (b == 0)
return 1;
ll ans = intpow(a, b / 2);
return ans * ans % MOD * (b & 1 ? a : 1) % MOD;
}
int main() {
ll n, k;
cin >> n;
string s, t;
cin >> s;
cin >> k;
rep(i, 0, n) {
if (s[i] == s[k - 1])
t[i] = s[k - 1];
else
t[i] = '*';
}
rep(i, 0, n) cout << t[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++)
inline constexpr int intpow(ll a, ll b) {
if (b == 0)
return 1;
ll ans = intpow(a, b / 2);
return ans * ans * (b & 1 ? a : 1);
}
inline constexpr int modpow(ll a, ll b) {
if (b == 0)
return 1;
ll ans = intpow(a, b / 2);
return ans * ans % MOD * (b & 1 ? a : 1) % MOD;
}
int main() {
ll n, k;
cin >> n;
string s, t;
cin >> s;
cin >> k;
rep(i, 0, n) {
if (s[i] = s[k])
t[i] = s[k];
else
t[i] = '*';
}
rep(i, 0, n) cout << t[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++)
inline constexpr int intpow(ll a, ll b) {
if (b == 0)
return 1;
ll ans = intpow(a, b / 2);
return ans * ans * (b & 1 ? a : 1);
}
inline constexpr int modpow(ll a, ll b) {
if (b == 0)
return 1;
ll ans = intpow(a, b / 2);
return ans * ans % MOD * (b & 1 ? a : 1) % MOD;
}
int main() {
ll n, k;
cin >> n;
string s, t;
cin >> s;
cin >> k;
rep(i, 0, n) {
if (s[i] == s[k - 1])
t[i] = s[k - 1];
else
t[i] = '*';
}
rep(i, 0, n) cout << t[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;
cin >> k;
for (int j = 0; j < s.size(); j++) {
if (s[k - 1] != s[j])
s[j] = '#';
}
cout << s << endl;
}
| #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;
cin >> k;
for (int j = 0; j < s.size(); j++) {
if (s[k - 1] != s[j])
s[j] = '*';
}
cout << s << endl;
}
| [
"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
/*struct*/
struct aaa {
aaa() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} aaaaaaa;
/* const */
const int INF = 1001001001;
const long long LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7; // 10^9
const double EPS = 1e-9;
const int dx[] = {1, 1, 0, -1, -1, -1, 0, 1},
dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
// Counterclockwise from the 6o'clock direction
// Take the x-axis downward and the y-axis right
//#define int long long
// g++ -std=c++14 -Wall --pedantic-errors -fsanitize=signed-integer-overflow
// -fno-sanitize-recover=all -o template template.cpp
signed main() {
int n, k;
cin >> n;
string s;
cin >> s;
cin >> k;
for (int i = 0; i < n; ++i) {
if (s[k] != s[i]) {
s[i] = '*';
}
}
cout << s << endl;
return 0;
} | #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
/*struct*/
struct aaa {
aaa() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} aaaaaaa;
/* const */
const int INF = 1001001001;
const long long LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7; // 10^9
const double EPS = 1e-9;
const int dx[] = {1, 1, 0, -1, -1, -1, 0, 1},
dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
// Counterclockwise from the 6o'clock direction
// Take the x-axis downward and the y-axis right
//#define int long long
// g++ -std=c++14 -Wall --pedantic-errors -fsanitize=signed-integer-overflow
// -fno-sanitize-recover=all -o template template.cpp
signed main() {
int n, k;
cin >> n;
string s;
cin >> s;
cin >> k;
for (int i = 0; i < n; ++i) {
if (s[k - 1] != s[i]) {
s[i] = '*';
}
}
cout << s << endl;
return 0;
} | [
"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
#define yes "Yes"
#define no "No"
typedef pair<int, int> P;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
string s;
cin >> s;
int k;
cin >> k;
REP(i, n) {
if (s[i] != s[k])
s[i] = '*';
}
print(s);
return 0;
} | #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
#define yes "Yes"
#define no "No"
typedef pair<int, int> P;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
string s;
cin >> s;
int k;
cin >> k;
REP(i, n) {
if (s[i] != s[k - 1])
s[i] = '*';
}
print(s);
return 0;
} | [
"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(0, N) {
if (S.at(i) != S.at(K)) {
S.at(i) = '*';
}
}
cout << S << endl;
}
| #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(0, N) {
if (S.at(K - 1) != S.at(i)) {
S.at(i) = '*';
}
}
cout << S << endl;
}
| [
"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 argc, char **argv) {
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 <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 argc, char **argv) {
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,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" << endl;
#define all(a) a.begin(), a.end()
#define P pair<int, int>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
//(int)'a'は97 (int)'A'は65 (int)'1'は49
//おまじない
int main() {
string s;
char c;
int n, k;
cin >> n;
cin >> s;
cin >> k;
c = s[k];
rep(i, n) {
if (s[i] != c)
s[i] = '*';
}
cout << s << endl;
return 0;
}
| #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" << endl;
#define all(a) a.begin(), a.end()
#define P pair<int, int>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
//(int)'a'は97 (int)'A'は65 (int)'1'は49
//おまじない
int main() {
string s;
char c;
int n, k;
cin >> n;
cin >> s;
cin >> k;
c = s[k - 1];
rep(i, n) {
if (s[i] != c)
s[i] = '*';
}
cout << s << endl;
return 0;
}
| [
"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;
#include <algorithm>
#include <array>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> s >> k;
auto star = s[k];
rep(i, s.length()) {
if (s[i] != star) {
s[i] = '*';
}
}
cout << s << endl;
return 0;
} | #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;
#include <algorithm>
#include <array>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
string s;
cin >> n >> s >> k;
auto star = s[k - 1];
rep(i, s.length()) {
if (s[i] != star) {
s[i] = '*';
}
}
cout << s << endl;
return 0;
}
| [
"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 (int i = 0; i < s.size(); i++) {
if (s.at(i) == c)
cout << c;
else {
cout << '*';
}
}
cout << endl;
return 0;
} | #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 (int i = 0; i < s.size(); i++) {
if (s.at(i) == c)
cout << c;
else {
cout << '*';
}
}
cout << endl;
return 0;
} | [
"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 (int i = 0; s[i] != 0; i++) {
if (s[i] != same) {
cout << "*";
} else {
cout << s[i];
}
}
} | #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 (int i = 0; s[i] != 0; i++) {
if (s[i] != same) {
cout << "*";
} else {
cout << s[i];
}
}
} | [
"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 {
S.replace(i, 1, "*");
}
}
cout << S << endl;
} | #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 {
S.replace(i, 1, "*");
}
}
cout << S << endl;
} | [
"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;
return 0;
} | [
"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;
return 0;
} | [
"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}; // 上 左 下 右
const int N = 100005, M = 1000005, mod = 1000000007;
const long long llinf = 9223372036854775807ll;
int n, k;
string s;
int main() {
cin >> n >> s >> k;
for (int i = 0; i < s.size(); i++) {
if (s[i] != s[k])
cout << '*';
else
cout << s[i];
}
return 0;
} | #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}; // 上 左 下 右
const int N = 100005, M = 1000005, mod = 1000000007;
const long long llinf = 9223372036854775807ll;
int n, k;
string s;
int main() {
cin >> n >> s >> k;
for (int i = 0; i < s.size(); i++) {
if (s[i] != s[k - 1])
cout << '*';
else
cout << s[i];
}
return 0;
} | [
"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;
return pow(a, b);
} //(x,y) xをy乗
int intfabs(int x) {
double a = x;
return fabs(a);
} //(x) xの絶対値
int fact(int x) {
if (x == 1)
return 1;
return x * fact(x - 1);
} //(x) x!
int fib(int x) {
if (x <= 2)
return x;
int a[x];
a[0] = 1;
a[1] = 2;
for (int i = 2; i < x; i++) {
a[i] = a[i - 1] + a[i - 2];
}
return a[x - 1];
} //(x) フィボナッチ数列のx番目
int div1(ll x) { return x % 1000000007; }
main() {
int n = in();
string s;
cin >> s;
int k = in();
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;
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;
return pow(a, b);
} //(x,y) xをy乗
int intfabs(int x) {
double a = x;
return fabs(a);
} //(x) xの絶対値
int fact(int x) {
if (x == 1)
return 1;
return x * fact(x - 1);
} //(x) x!
int fib(int x) {
if (x <= 2)
return x;
int a[x];
a[0] = 1;
a[1] = 2;
for (int i = 2; i < x; i++) {
a[i] = a[i - 1] + a[i - 2];
}
return a[x - 1];
} //(x) フィボナッチ数列のx番目
int div1(ll x) { return x % 1000000007; }
main() {
int n = in();
string s;
cin >> s;
int k = in();
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,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++) {
// cout << S[j] << endl;
// }
cout << S << endl;
} | #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++) {
// cout << S[j] << endl;
// }
cout << S << endl;
} | [
"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; i++) {
cout << s[i];
}
return 0;
}
| #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; i++) {
cout << s[i];
}
return 0;
}
| [
"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 0;
} | [
"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) {
if (a % cnt == 0)
ans.insert(cnt), a = cnt;
else
cnt++;
}
if (a != 1)
ans.insert(a);
}
vector<int> era() {
vector<int> rtn;
bool notp[10001] = {};
notp[0] = true, notp[1] = true;
for (int i = 2; i <= N; i++) {
if (!notp[i]) {
rtn.push_back(i);
for (int j = i * 2; j <= N; j += i) {
notp[j] = true;
}
}
}
return rtn;
}
int main() {
cin >> N;
ll g = 0;
for (int i = 0; i < N + 1; i++) {
cin >> a[i];
if (g == 0)
g = abs(a[i]);
else
g = gcd(abs(a[i]), g);
}
bunkai(g);
reverse(a, a + N + 1);
auto prime = era();
for (int i = 0; i < prime.size(); i++) {
int P = prime[i];
// x^P-xでf(x)が割り切れるか？
vector<ll> b(P, 0);
for (int j = 0; j < P; j++)
b[j] = a[j] % P;
for (int j = P; j <= N; j++) {
int r = j % (P - 1);
if (r == 0)
r = P - 1;
b[r] = (b[r] + (a[j] % P)) % P;
}
for (int j = 0; j < P; j++) {
if (b[j] != 0)
goto next;
}
ans.insert(P);
next:;
}
for (auto p : ans) {
cout << p << endl;
}
return 0;
} | #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) {
if (a % cnt == 0)
ans.insert(cnt), a /= cnt;
else
cnt++;
}
if (a != 1)
ans.insert(a);
}
vector<ll> era() {
vector<ll> rtn;
bool notp[10001] = {};
notp[0] = true, notp[1] = true;
for (int i = 2; i <= N; i++) {
if (!notp[i]) {
rtn.push_back(i);
for (int j = i * 2; j <= N; j += i) {
notp[j] = true;
}
}
}
return rtn;
}
int main() {
cin >> N;
ll g = 0;
for (int i = 0; i < N + 1; i++) {
cin >> a[i];
if (g == 0)
g = abs(a[i]);
else
g = gcd(abs(a[i]), g);
}
bunkai(g);
reverse(a, a + N + 1);
auto prime = era();
for (int i = 0; i < prime.size(); i++) {
ll P = prime[i];
// x^P-xでf(x)が割り切れるか？
vector<ll> b(P, 0);
for (int j = 0; j < P; j++)
b[j] = a[j] % P;
for (int j = P; j <= N; j++) {
ll r = j % (P - 1);
if (r == 0)
r = P - 1;
b[r] = (b[r] + (a[j] % P)) % P;
}
for (int j = 0; j < P; j++) {
if (b[j] != 0)
goto next;
}
ans.insert(P);
next:;
}
for (auto p : ans) {
cout << p << endl;
}
return 0;
} | [
"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>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define int long long int
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chadd(T &a, T b) { a = a + b; }
typedef pair<int, int> pii;
typedef long long ll;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const ll INF = 1001001001001001LL;
const ll MOD = 1000000007LL;
vector<int> get_primes(int N) {
vector<int> res;
for (int i = 2; i * i <= N; i++) {
if (N % i == 0) {
res.push_back(i);
while (N % i == 0)
N /= i;
}
}
if (N > 1)
res.push_back(N);
return res;
}
bool expr_div(const vector<int> &A, const int &p) {
int N = A.size();
vector<int> vec(p);
for (int i = 0; i < N; i++) {
int mo = (A[i] >= 0 ? A[i] : p - (-A[i] % p));
(vec[i % (p - 1)] += mo) %= p;
}
bool all_zero = true;
for (int i = 0; i < p; i++) {
// fprintf(stderr, "p = %lld, vec[%lld] = %lld\n", p, i, vec[i]);
all_zero &= (vec[i] == 0);
}
return all_zero;
}
// エラトステネスの篩
// [0,n) の範囲の i について、primes[i] != 0 ⇔ i は素数
vector<int> erat(int n) {
vector<int> primes(n);
for (int i = 2; i < n; ++i)
primes[i] = i;
for (int i = 2; i * i < n; ++i)
if (primes[i])
for (int j = i * i; j < n; j += i)
primes[j] = 0;
// 素数のみをvectorに格納する場合は以下の行を追加 (0 である要素を全削除)
primes.erase(remove(primes.begin(), primes.end(), 0), primes.end());
return primes;
}
signed main() {
int N;
cin >> N;
vector<int> A(N + 1);
int g = 0;
set<int> ans;
vector<int> primes = erat(N + 2);
for (int i = N; i >= 0; i--) {
cin >> A[i];
g = __gcd(g, abs(A[i]));
}
vector<int> p0 = get_primes(g);
for (auto e : p0)
ans.insert(e);
for (auto e : primes) {
if (A[N] % e != 0)
continue;
if (expr_div(A, e))
ans.insert(e);
}
for (auto e : ans)
cout << e << endl;
return 0;
}
| // #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>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define int long long int
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chadd(T &a, T b) { a = a + b; }
typedef pair<int, int> pii;
typedef long long ll;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const ll INF = 1001001001001001LL;
const ll MOD = 1000000007LL;
vector<int> get_primes(int N) {
vector<int> res;
for (int i = 2; i * i <= N; i++) {
if (N % i == 0) {
res.push_back(i);
while (N % i == 0)
N /= i;
}
}
if (N > 1)
res.push_back(N);
return res;
}
bool expr_div(const vector<int> &A, const int &p) {
int N = A.size();
vector<int> vec(p);
for (int i = 1; i < N; i++) {
int mo = (A[i] >= 0 ? A[i] : p - (-A[i] % p));
(vec[i % (p - 1)] += mo) %= p;
}
bool all_zero = true;
for (int i = 0; i < p; i++) {
// fprintf(stderr, "p = %lld, vec[%lld] = %lld\n", p, i, vec[i]);
all_zero &= (vec[i] == 0);
}
return all_zero;
}
// エラトステネスの篩
// [0,n) の範囲の i について、primes[i] != 0 ⇔ i は素数
vector<int> erat(int n) {
vector<int> primes(n);
for (int i = 2; i < n; ++i)
primes[i] = i;
for (int i = 2; i * i < n; ++i)
if (primes[i])
for (int j = i * i; j < n; j += i)
primes[j] = 0;
// 素数のみをvectorに格納する場合は以下の行を追加 (0 である要素を全削除)
primes.erase(remove(primes.begin(), primes.end(), 0), primes.end());
return primes;
}
signed main() {
int N;
cin >> N;
vector<int> A(N + 1);
int g = 0;
set<int> ans;
vector<int> primes = erat(N + 2);
for (int i = N; i >= 0; i--) {
cin >> A[i];
g = __gcd(g, abs(A[i]));
}
vector<int> p0 = get_primes(g);
for (auto e : p0)
ans.insert(e);
for (auto e : primes) {
if (A[0] % e != 0)
continue;
if (expr_div(A, e))
ans.insert(e);
}
for (auto e : ans)
cout << e << endl;
return 0;
}
| [
"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>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef pair<char, char> pcc;
typedef pair<double, double> pdd;
#define show(x) cerr << x
#define debug(x) show(#x << ": " << (x) << endl)
const long double PI = 3.14159265358979323846;
const long double eps = 1e-5;
const int INF = numeric_limits<int>::max();
const ll LINF = numeric_limits<ll>::max();
const ll mod = 1000 * 1000 * 1000 + 7;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
void solve() {
int n;
cin >> n;
vector<ll> a(n + 1);
ll d = 0;
for (int i = n; i >= 0; --i) {
cin >> a[i];
d = gcd(d, abs(a[i]));
}
ll N = 10010;
vector<int> p(N, 1);
vector<ll> primes;
for (int i = 2; i < N; ++i) {
if (p[i]) {
primes.push_back(i);
for (int j = i + i; j < N; j += i) {
p[j] = 0;
}
}
}
for (int i = 0; i < primes.size(); ++i) {
ll pp = primes[i];
while (d % pp == 0) {
d /= pp;
}
}
for (int i = 0; i < primes.size(); ++i) {
ll pp = primes[i];
if (abs(a[0]) % pp != 0)
continue;
vector<ll> b(pp, 0);
for (int j = 0; j <= pp - 1; ++j) {
b[j] = ((a[j] % pp) + pp) % pp;
}
for (int j = pp; j <= n; ++j) {
int id = j % (pp - 1);
if (id == 0)
id = pp - 1;
b[id] = (b[id] + pp + a[j]) % pp;
}
int ok = 1;
for (int j = 0; j < pp; ++j) {
if (b[j] != 0) {
ok = 0;
break;
}
}
if (ok) {
cout << pp << "\n";
}
}
for (ll i = N; i * i <= d; ++i) {
if (d % i == 0) {
cout << i << "\n";
while (d % i == 0) {
d /= i;
}
}
}
if (d > 1)
cout << d << endl;
}
//#define LOCAL
int main() {
ios_base::sync_with_stdio(0);
cin.tie(nullptr);
cout.tie(nullptr);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#endif
solve();
#ifdef LOCAL
cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
} | #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>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef pair<char, char> pcc;
typedef pair<double, double> pdd;
#define show(x) cerr << x
#define debug(x) show(#x << ": " << (x) << endl)
const long double PI = 3.14159265358979323846;
const long double eps = 1e-5;
const int INF = numeric_limits<int>::max();
const ll LINF = numeric_limits<ll>::max();
const ll mod = 1000 * 1000 * 1000 + 7;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
void solve() {
ll n;
cin >> n;
vector<ll> a(n + 1);
ll d = 0;
for (int i = n; i >= 0; --i) {
cin >> a[i];
d = gcd(d, abs(a[i]));
}
ll N = 10010;
vector<int> p(N, 1);
vector<ll> primes;
for (int i = 2; i < N; ++i) {
if (p[i]) {
primes.push_back(i);
for (int j = i + i; j < N; j += i) {
p[j] = 0;
}
}
}
for (int i = 0; i < primes.size(); ++i) {
ll pp = primes[i];
while (d % pp == 0) {
d /= pp;
}
}
for (int i = 0; i < primes.size(); ++i) {
ll pp = primes[i];
if (abs(a[0]) % pp != 0)
continue;
vector<ll> b(pp, 0);
for (int j = 0; j <= min(n, pp - 1); ++j) {
b[j] = ((a[j] % pp) + pp) % pp;
}
for (int j = pp; j <= n; ++j) {
int id = j % (pp - 1);
if (id == 0)
id = pp - 1;
b[id] = (b[id] + pp + a[j]) % pp;
}
int ok = 1;
for (int j = 0; j < pp; ++j) {
if (b[j] != 0) {
ok = 0;
break;
}
}
if (ok) {
cout << pp << "\n";
}
}
for (ll i = N; i * i <= d; ++i) {
if (d % i == 0) {
cout << i << "\n";
while (d % i == 0) {
d /= i;
}
}
}
if (d > 1)
cout << d << endl;
}
//#define LOCAL
int main() {
ios_base::sync_with_stdio(0);
cin.tie(nullptr);
cout.tie(nullptr);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#endif
solve();
#ifdef LOCAL
cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
} | [
"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;
vector<long long> B(A.begin() + 1, A.end());
for (int i = N - 1; i >= p - 1; --i) {
assert(B.size() == i + 1);
(B[i - p + 1] += B[i]) %= p;
B.pop_back();
}
for (int i = 0; i < p - 1; ++i)
if (B[i] % p)
return false;
return true;
};
set<int> ans;
vector<int> sieve(N + 1, 1);
for (int p = 2; p <= N; ++p)
if (sieve[p]) {
if (test(p))
ans.insert(p);
for (int n = 2 * p; n <= N; n += p)
sieve[n] = 0;
}
for (int p = 2, b = gc; p * p <= gc; ++p)
while (b % p == 0)
ans.insert(p), b /= p;
if (gc != 1)
ans.insert(gc);
for (auto a : ans)
cout << a << '\n';
}
| #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;
vector<long long> B(A.begin() + 1, A.end());
for (int i = N - 1; i >= p - 1; --i) {
assert(B.size() == i + 1);
(B[i - p + 1] += B[i]) %= p;
B.pop_back();
}
for (int i = 0; i < p - 1; ++i)
if (B[i] % p)
return false;
return true;
};
set<int> ans;
vector<int> sieve(N + 1, 1);
for (int p = 2; p <= N; ++p)
if (sieve[p]) {
if (test(p))
ans.insert(p);
for (int n = 2 * p; n <= N; n += p)
sieve[n] = 0;
}
for (int p = 2; p * p <= gc; ++p)
while (gc % p == 0)
ans.insert(p), gc /= p;
if (gc != 1)
ans.insert(gc);
for (auto a : ans)
cout << a << '\n';
}
| [
"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>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define ll long long
#define rep2(i, a, b) for (ll i = a; i <= b; ++i)
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep3(i, a, b) for (ll i = a; i >= b; i--)
#define REP(e, v) for (auto e : v)
#define pii pair<int, int>
#define pll pair<ll, ll>
#define tii tuple<int, int, int>
#define pq priority_queue<int>
#define pqg priority_queue<int, vector<int>, greater<int>>
#define pb push_back
#define edge(v, a, b) \
v[a].pb(b); \
v[b].pb(a);
#define MAX_V 400010
#define vec vector<int>
#define vecll vector<ll>
#define vecpii vector<pii>
#define endl "\n"
#define ALL(c) (c).begin(), (c).end()
using namespace std;
int in() {
int x;
scanf("%d", &x);
return x;
}
ll lin() {
ll x;
scanf("%lld", &x);
return x;
}
#define INF 1e9 + 7
#define LLINF 1e18 + 7
ll MOD = 1e9 + 7;
#define N 110000
ll gcd(ll x, ll y) {
for (; y; swap(x, y))
x %= y;
return x;
}
ll a[11000];
main() {
ll n = in();
ll g = 0;
for (int i = n; i >= 0; i--) {
a[i] = in();
g = gcd(g, a[i]);
}
vector<ll> ans;
for (ll i = 2; i * i <= g; i++) {
if (g % i == 0) {
ans.pb(i);
while (g % i == 0) {
g /= i;
}
}
}
if (g > 1)
ans.pb(g);
int prime[33000] = {};
prime[0] = prime[1] = 1;
vector<ll> v;
rep2(i, 2, n) {
if (!prime[i]) {
v.pb(i);
for (int j = i * 2; j <= 23000; j += i) {
prime[j] = 1;
}
}
}
for (auto p : v) {
ll s[11000] = {};
if (a[0] % p != 0)
continue;
rep(i, n + 1) { s[i % (p - 1)] += a[i] % p; }
bool flag = true;
rep(i, p - 1) {
if (s[i] % p != 0)
flag = false;
}
if (flag && (a[0] % p == 0))
ans.pb(p);
}
sort(ALL(ans));
ans.erase(unique(ALL(ans)), ans.end());
for (auto e : ans)
cout << e << endl;
}
| #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>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define ll long long
#define rep2(i, a, b) for (ll i = a; i <= b; ++i)
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep3(i, a, b) for (ll i = a; i >= b; i--)
#define REP(e, v) for (auto e : v)
#define pii pair<int, int>
#define pll pair<ll, ll>
#define tii tuple<int, int, int>
#define pq priority_queue<int>
#define pqg priority_queue<int, vector<int>, greater<int>>
#define pb push_back
#define edge(v, a, b) \
v[a].pb(b); \
v[b].pb(a);
#define MAX_V 400010
#define vec vector<int>
#define vecll vector<ll>
#define vecpii vector<pii>
#define endl "\n"
#define ALL(c) (c).begin(), (c).end()
using namespace std;
int in() {
int x;
scanf("%d", &x);
return x;
}
ll lin() {
ll x;
scanf("%lld", &x);
return x;
}
#define INF 1e9 + 7
#define LLINF 1e18 + 7
ll MOD = 1e9 + 7;
#define N 110000
ll gcd(ll x, ll y) {
for (; y; swap(x, y))
x %= y;
return x;
}
ll a[11000];
main() {
ll n = in();
ll g = 0;
for (int i = n; i >= 0; i--) {
a[i] = in();
g = gcd(g, abs(a[i]));
}
vector<ll> ans;
for (ll i = 2; i * i <= g; i++) {
if (g % i == 0) {
ans.pb(i);
while (g % i == 0) {
g /= i;
}
}
}
if (g > 1)
ans.pb(g);
int prime[33000] = {};
prime[0] = prime[1] = 1;
vector<ll> v;
rep2(i, 2, n) {
if (!prime[i]) {
v.pb(i);
for (int j = i * 2; j <= 23000; j += i) {
prime[j] = 1;
}
}
}
for (auto p : v) {
ll s[11000] = {};
if (a[0] % p != 0)
continue;
rep(i, n + 1) { s[i % (p - 1)] += a[i] % p; }
bool flag = true;
rep(i, p - 1) {
if (s[i] % p != 0)
flag = false;
}
if (flag && (a[0] % p == 0))
ans.pb(p);
}
sort(ALL(ans));
ans.erase(unique(ALL(ans)), ans.end());
for (auto e : ans)
cout << e << endl;
}
| [
"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 chk(LL p) {
for (LL i = 0; i <= n; ++i)
b[i] = a[i] % p;
for (LL i = n; i >= p; --i) {
(b[i - (p - 1)] += b[i]) %= p;
b[i] = 0;
}
for (LL i = 0; i <= n; ++i)
if (b[i])
return 0;
return 1;
}
int main() {
scanf("%lld", &n);
LL d = 0;
for (LL i = 0; i <= n; ++i) {
scanf("%lld", a + i);
d = gcd(d, a[i]);
}
d = abs(d);
for (LL i = 2; i * i <= d; ++i) {
if (d % i == 0) {
vis[i] = 1;
while (d % i == 0)
d /= i;
}
}
if (d > 1)
vis[d] = 1;
for (LL i = 1; i <= n + 1; ++i)
if (isp(i) && chk(i))
vis[i] = 1;
for (auto i : vis)
printf("%lld\n", i.first);
return 0;
}
| #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 chk(LL p) {
for (LL i = 0; i <= n; ++i)
b[i] = a[i] % p;
for (LL i = n; i >= p; --i) {
(b[i - (p - 1)] += b[i]) %= p;
b[i] = 0;
}
for (LL i = 0; i <= n; ++i)
if (b[i])
return 0;
return 1;
}
int main() {
scanf("%lld", &n);
LL d = 0;
for (LL i = 0; i <= n; ++i) {
scanf("%lld", a + n - i);
d = gcd(d, a[i]);
}
d = abs(d);
for (LL i = 2; i * i <= d; ++i) {
if (d % i == 0) {
vis[i] = 1;
while (d % i == 0)
d /= i;
}
}
if (d > 1)
vis[d] = 1;
for (LL i = 1; i <= n + 1; ++i)
if (isp(i) && chk(i))
vis[i] = 1;
for (auto i : vis)
printf("%lld\n", i.first);
return 0;
}
| [
"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 chk(LL p) {
for (LL i = 0; i <= n; ++i)
b[i] = a[i] % p;
for (LL i = n; i >= p; --i) {
(b[i - (p - 1)] += b[i]) %= p;
b[i] = 0;
}
for (LL i = 0; i <= n; ++i)
if (b[i])
return 0;
return 1;
}
int main() {
scanf("%lld", &n);
LL d = 0;
for (LL i = 0; i <= n; ++i) {
scanf("%lld", a + i);
d = gcd(d, a[i]);
}
d = abs(d);
for (LL i = 2; i * i <= d; ++i) {
if (d % i == 0) {
vis[i] = 1;
while (d % i == 0)
d /= i;
}
}
if (d > 1)
vis[d] = 1;
for (LL i = 1; i <= n; ++i)
if (isp(i) && chk(i))
vis[i] = 1;
for (auto i : vis)
printf("%lld\n", i.first);
return 0;
}
| #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 chk(LL p) {
for (LL i = 0; i <= n; ++i)
b[i] = a[i] % p;
for (LL i = n; i >= p; --i) {
(b[i - (p - 1)] += b[i]) %= p;
b[i] = 0;
}
for (LL i = 0; i <= n; ++i)
if (b[i])
return 0;
return 1;
}
int main() {
scanf("%lld", &n);
LL d = 0;
for (LL i = 0; i <= n; ++i) {
scanf("%lld", a + n - i);
d = gcd(d, a[i]);
}
d = abs(d);
for (LL i = 2; i * i <= d; ++i) {
if (d % i == 0) {
vis[i] = 1;
while (d % i == 0)
d /= i;
}
}
if (d > 1)
vis[d] = 1;
for (LL i = 1; i <= n + 1; ++i)
if (isp(i) && chk(i))
vis[i] = 1;
for (auto i : vis)
printf("%lld\n", i.first);
return 0;
}
| [
"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
#define pin pair<int, int>
#define sor(a) sort(a.begin(), a.end())
#define mp make_pair
#define rep(i, n) for (int i = 0; i < n; i++)
#define mmin(x, y) x = min(x, y)
#define mmax(x, y) x = max(x, y)
#define upperbound(v, val) upper_bound(v.begin(), v.end(), val)
#define lowerbound(v, val) lower_bound(v.begin(), v.end(), val)
int gcd(int a, int b) {
a = abs(a);
b = abs(b);
if (a < b) {
swap(a, b);
}
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
bool ret(int p, vel &a) {
vel ans(p, 0);
if (a[0] % p != 0) {
return false;
}
for (int i = 1; i < a.size(); i++) {
int pl = i % (p - 1);
if (pl == 0) {
pl += p - 1;
}
ans[pl] += a[i];
}
bool xx = true;
rep(i, p) { xx = xx & (ans[i] % p == 0); }
return xx;
}
bool is_prime(int x) {
for (int i = 2; i * i <= x; i++) {
if (x % i == 0 and x != i) {
return false;
}
}
return true;
}
int ord(int n, int p) {
if (n % p != 0) {
return 0;
}
return ord(n / p, p) + 1;
}
int rui(int n, int ru) {
if (ru == 0) {
return 1;
}
return rui(n, ru - 1) * n;
}
signed main() {
int n;
cin >> n;
vel a(n + 1);
rep(i, n + 1) { cin >> a[n - i]; }
int gd = abs(a[0]);
rep(i, n) { gd = gcd(gd, a[i + 1]); }
vel all_list(0);
veb can_div(n + 1, false);
for (int i = 2; i <= n; i++) {
if (is_prime(i)) {
can_div[i] = ret(i, a);
if (can_div[i]) {
all_list.push_back(i);
}
}
}
int qgd = gd;
for (int i = 2; i * i <= qgd; i++) {
int ord1 = ord(gd, i);
if (ord1 > 0) {
gd = gd / rui(i, ord1);
if (i > n) {
all_list.push_back(i);
}
}
}
if (gd > n) {
all_list.push_back(gd);
}
sor(all_list);
rep(i, all_list.size()) { cout << all_list[i] << endl; }
return 0;
} | #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
#define pin pair<int, int>
#define sor(a) sort(a.begin(), a.end())
#define mp make_pair
#define rep(i, n) for (int i = 0; i < n; i++)
#define mmin(x, y) x = min(x, y)
#define mmax(x, y) x = max(x, y)
#define upperbound(v, val) upper_bound(v.begin(), v.end(), val)
#define lowerbound(v, val) lower_bound(v.begin(), v.end(), val)
int gcd(int a, int b) {
a = abs(a);
b = abs(b);
if (a < b) {
swap(a, b);
}
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
bool ret(int p, vel &a) {
vel ans(p, 0);
if (a[0] % p != 0) {
return false;
}
for (int i = 1; i < a.size(); i++) {
int pl = i % (p - 1);
if (pl == 0) {
pl += p - 1;
}
ans[pl] += a[i];
}
bool xx = true;
rep(i, p) { xx = xx & (ans[i] % p == 0); }
return xx;
}
bool is_prime(int x) {
for (int i = 2; i * i <= x; i++) {
if (x % i == 0 and x != i) {
return false;
}
}
return true;
}
int ord(int n, int p) {
if (n % p != 0) {
return 0;
}
return ord(n / p, p) + 1;
}
int rui(int n, int ru) {
if (ru == 0) {
return 1;
}
return rui(n, ru - 1) * n;
}
signed main() {
int n;
cin >> n;
vel a(n + 1);
rep(i, n + 1) { cin >> a[n - i]; }
int gd = abs(a[n]);
rep(i, n) { gd = gcd(gd, a[i + 1]); }
vel all_list(0);
veb can_div(n + 1, false);
for (int i = 2; i <= n; i++) {
if (is_prime(i)) {
can_div[i] = ret(i, a);
if (can_div[i]) {
all_list.push_back(i);
}
}
}
int qgd = gd;
for (int i = 2; i * i <= qgd; i++) {
int ord1 = ord(gd, i);
if (ord1 > 0) {
gd = gd / rui(i, ord1);
if (i > n) {
all_list.push_back(i);
}
}
}
if (gd > n and gd > 1) {
all_list.push_back(gd);
}
sor(all_list);
rep(i, all_list.size()) { cout << all_list[i] << endl; }
return 0;
} | [
"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
#define pin pair<int, int>
#define sor(a) sort(a.begin(), a.end())
#define mp make_pair
#define rep(i, n) for (int i = 0; i < n; i++)
#define mmin(x, y) x = min(x, y)
#define mmax(x, y) x = max(x, y)
#define upperbound(v, val) upper_bound(v.begin(), v.end(), val)
#define lowerbound(v, val) lower_bound(v.begin(), v.end(), val)
int gcd(int a, int b) {
a = abs(a);
b = abs(b);
if (a < b) {
swap(a, b);
}
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
bool ret(int p, vel &a) {
vel ans(p, 0);
if (a[0] % p != 0) {
return false;
}
for (int i = 1; i < a.size(); i++) {
int pl = i % (p - 1);
if (pl == 0) {
pl += p - 1;
}
ans[pl] += a[i];
}
bool xx = true;
rep(i, p) { xx = xx & (ans[i] % p == 0); }
return xx;
}
bool is_prime(int x) {
for (int i = 2; i * i <= x; i++) {
if (x % i == 0 and x != i) {
return false;
}
}
return true;
}
int ord(int n, int p) {
if (n % p != 0) {
return 0;
}
return ord(n / p, p) + 1;
}
int rui(int n, int ru) {
if (ru == 0) {
return 1;
}
return rui(n, ru - 1) * n;
}
signed main() {
int n;
cin >> n;
vel a(n + 1);
rep(i, n + 1) { cin >> a[n - i]; }
int gd = abs(a[0]);
rep(i, n) { gd = gcd(gd, a[i + 1]); }
vel all_list(0);
veb can_div(n + 1, false);
for (int i = 2; i <= n; i++) {
if (is_prime(i)) {
can_div[i] = ret(i, a);
if (can_div[i]) {
all_list.push_back(i);
}
}
}
int qgd = gd;
for (int i = 2; i * i <= gd; i++) {
int ord1 = ord(gd, i);
if (ord1 > 0) {
gd = gd / rui(i, ord1);
if (i > n) {
all_list.push_back(i);
}
}
}
if (gd == qgd and gd > n) {
all_list.push_back(gd);
}
sor(all_list);
rep(i, all_list.size()) { cout << all_list[i] << endl; }
return 0;
} | #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
#define pin pair<int, int>
#define sor(a) sort(a.begin(), a.end())
#define mp make_pair
#define rep(i, n) for (int i = 0; i < n; i++)
#define mmin(x, y) x = min(x, y)
#define mmax(x, y) x = max(x, y)
#define upperbound(v, val) upper_bound(v.begin(), v.end(), val)
#define lowerbound(v, val) lower_bound(v.begin(), v.end(), val)
int gcd(int a, int b) {
a = abs(a);
b = abs(b);
if (a < b) {
swap(a, b);
}
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
bool ret(int p, vel &a) {
vel ans(p, 0);
if (a[0] % p != 0) {
return false;
}
for (int i = 1; i < a.size(); i++) {
int pl = i % (p - 1);
if (pl == 0) {
pl += p - 1;
}
ans[pl] += a[i];
}
bool xx = true;
rep(i, p) { xx = xx & (ans[i] % p == 0); }
return xx;
}
bool is_prime(int x) {
for (int i = 2; i * i <= x; i++) {
if (x % i == 0 and x != i) {
return false;
}
}
return true;
}
int ord(int n, int p) {
if (n % p != 0) {
return 0;
}
return ord(n / p, p) + 1;
}
int rui(int n, int ru) {
if (ru == 0) {
return 1;
}
return rui(n, ru - 1) * n;
}
signed main() {
int n;
cin >> n;
vel a(n + 1);
rep(i, n + 1) { cin >> a[n - i]; }
int gd = abs(a[n]);
rep(i, n) { gd = gcd(gd, a[i + 1]); }
vel all_list(0);
veb can_div(n + 1, false);
for (int i = 2; i <= n; i++) {
if (is_prime(i)) {
can_div[i] = ret(i, a);
if (can_div[i]) {
all_list.push_back(i);
}
}
}
int qgd = gd;
for (int i = 2; i * i <= qgd; i++) {
int ord1 = ord(gd, i);
if (ord1 > 0) {
gd = gd / rui(i, ord1);
if (i > n) {
all_list.push_back(i);
}
}
}
if (gd > n and gd > 1) {
all_list.push_back(gd);
}
sor(all_list);
rep(i, all_list.size()) { cout << all_list[i] << endl; }
return 0;
} | [
"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) : (b))
#define all(v) (v).begin(), (v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)), v.erase(unique(all(v)), v.end())
#define cmx(x, y) x = max(x, y)
#define cmn(x, y) x = min(x, y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout << #x << " = " << (x) << endl
#define sar(a, n) \
cout << #a << ":"; \
rep(pachico, n) cout << " " << a[pachico]; \
cout << endl
using namespace std;
template <typename S, typename T> auto &operator<<(auto &o, pair<S, T> p) {
return o << "{" << p.fi << "," << p.se << "}";
}
template <typename T> auto &operator<<(auto &o, set<T> s) {
for (auto &e : s)
o << e << " ";
return o;
}
template <typename S, typename T, typename U>
auto &operator<<(auto &o, priority_queue<S, T, U> q) {
while (!q.empty())
o << q.top() << " ", q.pop();
return o;
}
template <typename K, typename T> auto &operator<<(auto &o, map<K, T> &m) {
for (auto &e : m)
o << e << " ";
return o;
}
template <typename T> auto &operator<<(auto &o, vector<T> v) {
for (auto &e : v)
o << e << " ";
return o;
}
void ashow() { cout << endl; }
template <typename T, typename... A> void ashow(T t, A... a) {
cout << t << " ";
ashow(a...);
}
template <typename S, typename T, typename U> struct TRI {
S fi;
T se;
U th;
TRI() {}
TRI(S f, T s, U t) : fi(f), se(s), th(t) {}
};
template <typename S, typename T, typename U>
auto &operator<<(auto &o, TRI<S, T, U> &t) {
return o << "{" << t.fi << "," << t.se << "," << t.th << "}";
}
typedef pair<int, int> P;
typedef pair<ll, ll> pll;
typedef TRI<int, int, int> tri;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<P> vp;
typedef vector<double> vd;
typedef vector<string> vs;
const int MAX_N = 3005;
template <uint mod> class ModInt {
private:
uint v;
static uint norm(const uint &x) { return x < mod ? x : x - mod; }
static ModInt make(const uint &x) {
ModInt m;
return m.v = x, m;
}
static ModInt inv(const ModInt &x) { return make(inverse(x.v, mod)); }
static uint inverse(int a, int m) {
int u[] = {a, 1, 0}, v[] = {m, 0, 1}, t;
while (*v) {
t = *u / *v;
swap(u[0] -= t * v[0], v[0]), swap(u[1] -= t * v[1], v[1]),
swap(u[2] -= t * v[2], v[2]);
}
return (u[1] % m + m) % m;
}
public:
ModInt() : v{0} {}
ModInt(const long long val) : v{norm(val % mod + mod)} {}
ModInt(const ModInt<mod> &n) : v{n()} {}
explicit operator bool() const noexcept { return v != 0; }
bool operator!() const noexcept { return !static_cast<bool>(*this); }
ModInt &operator=(const ModInt &n) { return v = n(), (*this); }
ModInt &operator=(const long long val) {
return v = norm(val % mod + mod), (*this);
}
ModInt operator+() const { return *this; }
ModInt operator-() const { return v == 0 ? make(0) : make(mod - v); }
ModInt operator+(const ModInt &val) const { return make(norm(v + val())); }
ModInt operator-(const ModInt &val) const {
return make(norm(v + mod - val()));
}
ModInt operator*(const ModInt &val) const {
return make((long long)v * val() % mod);
}
ModInt operator/(const ModInt &val) const { return *this * inv(val); }
ModInt &operator+=(const ModInt &val) { return *this = *this + val; }
ModInt &operator-=(const ModInt &val) { return *this = *this - val; }
ModInt &operator*=(const ModInt &val) { return *this = *this * val; }
ModInt &operator/=(const ModInt &val) { return *this = *this / val; }
ModInt operator+(const long long val) const { return ModInt{v + val}; }
ModInt operator-(const long long val) const { return ModInt{v - val}; }
ModInt operator*(const long long val) const {
return ModInt{(long long)v * (val % mod)};
}
ModInt operator/(const long long val) const {
return ModInt{(long long)v * inv(val)};
}
ModInt &operator+=(const long long val) { return *this = *this + val; }
ModInt &operator-=(const long long val) { return *this = *this - val; }
ModInt &operator*=(const long long val) { return *this = *this * val; }
ModInt &operator/=(const long long val) { return *this = *this / val; }
bool operator==(const ModInt &val) const { return v == val.v; }
bool operator!=(const ModInt &val) const { return !(*this == val); }
bool operator==(const long long val) const {
return v == norm(val % mod + mod);
}
bool operator!=(const long long val) const { return !(*this == val); }
uint operator()() const { return v; }
friend ModInt operator+(const long long val, const ModInt &n) {
return n + val;
}
friend ModInt operator-(const long long val, const ModInt &n) {
return ModInt{val - n()};
}
friend ModInt operator*(const long long val, const ModInt &n) {
return n * val;
}
friend ModInt operator/(const long long val, const ModInt &n) {
return ModInt{val} / n;
}
friend bool operator==(const long long val, const ModInt &n) {
return n == val;
}
friend bool operator!=(const long long val, const ModInt &n) {
return !(val == n);
}
friend istream &operator>>(istream &is, ModInt &n) {
uint v;
return is >> v, n = v, is;
}
friend ostream &operator<<(ostream &os, const ModInt &n) {
return (os << n());
}
friend ModInt pow(ModInt x, long long n) {
ModInt ans = 1;
while (n) {
if (n & 1)
ans *= x;
x *= x, n >>= 1;
}
return ans;
}
};
using mod = ModInt<MOD>;
mod inv[MAX_N], fac[MAX_N], finv[MAX_N];
void make() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX_N; i++) {
inv[i] = MOD - inv[MOD % i] * (MOD / i);
fac[i] = fac[i - 1] * i;
finv[i] = finv[i - 1] * inv[i];
}
}
mod comb(int a, int b) {
if (a < b)
return 0;
return fac[a] * finv[b] * finv[a - b];
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, X;
cin >> n >> X;
make();
mod ans = 0;
rep(i, n + 1) {
rep(j, n - i + 1) {
int sm = i + 2 * j;
if (i == 0) {
if (sm < X || (sm + X) % 2) {
ans += comb(n, j);
}
} else {
if (sm < X) {
ans += comb(n, i + j) * comb(i + j, i);
} else if ((i + X) % 2) {
int t = (sm - (X - 1)) / 2;
if (j >= 2 * t) {
ans += comb(i + j - 2 * t, i) * comb(n, i + j);
}
}
}
}
}
cout << ans << "\n";
return 0;
}
| #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) : (b))
#define all(v) (v).begin(), (v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)), v.erase(unique(all(v)), v.end())
#define cmx(x, y) x = max(x, y)
#define cmn(x, y) x = min(x, y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout << #x << " = " << (x) << endl
#define sar(a, n) \
cout << #a << ":"; \
rep(pachico, n) cout << " " << a[pachico]; \
cout << endl
using namespace std;
template <typename S, typename T> auto &operator<<(auto &o, pair<S, T> p) {
return o << "{" << p.fi << "," << p.se << "}";
}
template <typename T> auto &operator<<(auto &o, set<T> s) {
for (auto &e : s)
o << e << " ";
return o;
}
template <typename S, typename T, typename U>
auto &operator<<(auto &o, priority_queue<S, T, U> q) {
while (!q.empty())
o << q.top() << " ", q.pop();
return o;
}
template <typename K, typename T> auto &operator<<(auto &o, map<K, T> &m) {
for (auto &e : m)
o << e << " ";
return o;
}
template <typename T> auto &operator<<(auto &o, vector<T> v) {
for (auto &e : v)
o << e << " ";
return o;
}
void ashow() { cout << endl; }
template <typename T, typename... A> void ashow(T t, A... a) {
cout << t << " ";
ashow(a...);
}
template <typename S, typename T, typename U> struct TRI {
S fi;
T se;
U th;
TRI() {}
TRI(S f, T s, U t) : fi(f), se(s), th(t) {}
};
template <typename S, typename T, typename U>
auto &operator<<(auto &o, TRI<S, T, U> &t) {
return o << "{" << t.fi << "," << t.se << "," << t.th << "}";
}
typedef pair<int, int> P;
typedef pair<ll, ll> pll;
typedef TRI<int, int, int> tri;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<P> vp;
typedef vector<double> vd;
typedef vector<string> vs;
const int MAX_N = 3005;
template <uint mod> class ModInt {
private:
uint v;
static uint norm(const uint &x) { return x < mod ? x : x - mod; }
static ModInt make(const uint &x) {
ModInt m;
return m.v = x, m;
}
static ModInt inv(const ModInt &x) { return make(inverse(x.v, mod)); }
static uint inverse(int a, int m) {
int u[] = {a, 1, 0}, v[] = {m, 0, 1}, t;
while (*v) {
t = *u / *v;
swap(u[0] -= t * v[0], v[0]), swap(u[1] -= t * v[1], v[1]),
swap(u[2] -= t * v[2], v[2]);
}
return (u[1] % m + m) % m;
}
public:
ModInt() : v{0} {}
ModInt(const long long val) : v{norm(val % mod + mod)} {}
ModInt(const ModInt<mod> &n) : v{n()} {}
explicit operator bool() const noexcept { return v != 0; }
bool operator!() const noexcept { return !static_cast<bool>(*this); }
ModInt &operator=(const ModInt &n) { return v = n(), (*this); }
ModInt &operator=(const long long val) {
return v = norm(val % mod + mod), (*this);
}
ModInt operator+() const { return *this; }
ModInt operator-() const { return v == 0 ? make(0) : make(mod - v); }
ModInt operator+(const ModInt &val) const { return make(norm(v + val())); }
ModInt operator-(const ModInt &val) const {
return make(norm(v + mod - val()));
}
ModInt operator*(const ModInt &val) const {
return make((long long)v * val() % mod);
}
ModInt operator/(const ModInt &val) const { return *this * inv(val); }
ModInt &operator+=(const ModInt &val) { return *this = *this + val; }
ModInt &operator-=(const ModInt &val) { return *this = *this - val; }
ModInt &operator*=(const ModInt &val) { return *this = *this * val; }
ModInt &operator/=(const ModInt &val) { return *this = *this / val; }
ModInt operator+(const long long val) const { return ModInt{v + val}; }
ModInt operator-(const long long val) const { return ModInt{v - val}; }
ModInt operator*(const long long val) const {
return ModInt{(long long)v * (val % mod)};
}
ModInt operator/(const long long val) const {
return ModInt{(long long)v * inv(val)};
}
ModInt &operator+=(const long long val) { return *this = *this + val; }
ModInt &operator-=(const long long val) { return *this = *this - val; }
ModInt &operator*=(const long long val) { return *this = *this * val; }
ModInt &operator/=(const long long val) { return *this = *this / val; }
bool operator==(const ModInt &val) const { return v == val.v; }
bool operator!=(const ModInt &val) const { return !(*this == val); }
bool operator==(const long long val) const {
return v == norm(val % mod + mod);
}
bool operator!=(const long long val) const { return !(*this == val); }
uint operator()() const { return v; }
friend ModInt operator+(const long long val, const ModInt &n) {
return n + val;
}
friend ModInt operator-(const long long val, const ModInt &n) {
return ModInt{val - n()};
}
friend ModInt operator*(const long long val, const ModInt &n) {
return n * val;
}
friend ModInt operator/(const long long val, const ModInt &n) {
return ModInt{val} / n;
}
friend bool operator==(const long long val, const ModInt &n) {
return n == val;
}
friend bool operator!=(const long long val, const ModInt &n) {
return !(val == n);
}
friend istream &operator>>(istream &is, ModInt &n) {
uint v;
return is >> v, n = v, is;
}
friend ostream &operator<<(ostream &os, const ModInt &n) {
return (os << n());
}
friend ModInt pow(ModInt x, long long n) {
ModInt ans = 1;
while (n) {
if (n & 1)
ans *= x;
x *= x, n >>= 1;
}
return ans;
}
};
using mod = ModInt<MOD>;
mod inv[MAX_N], fac[MAX_N], finv[MAX_N];
void make() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX_N; i++) {
inv[i] = MOD - inv[MOD % i] * (MOD / i);
fac[i] = fac[i - 1] * i;
finv[i] = finv[i - 1] * inv[i];
}
}
mod comb(int a, int b) {
if (a < b)
return 0;
return fac[a] * finv[b] * finv[a - b];
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, X;
cin >> n >> X;
make();
mod ans = 0;
rep(i, n + 1) {
rep(j, n - i + 1) {
int sm = i + 2 * j;
if (i == 0) {
if (sm < X || (sm + X) % 2) {
ans += comb(n, j);
}
} else {
if (sm < X) {
ans += comb(n, i + j) * comb(i + j, i);
} else if ((i + X) % 2) {
int t = (sm - (X - 1)) / 2;
if (j >= 2 * t) {
ans += comb(i + j - 2 * t, i) * comb(n, i + j);
}
}
}
}
}
cout << ans << "\n";
return 0;
}
| [
"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 = long double;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define MOD 1000000007LL
#define INF 1000000000LL
#define EPS 1e-10
#define FOR(i, n, m) for (lint i = n; i < (int)m; i++)
#define REP(i, n) FOR(i, 0, n)
#define DUMP(a) \
REP(d, a.size()) { \
cout << a[d]; \
if (d != a.size() - 1) \
cout << " "; \
else \
cout << endl; \
}
#define ALL(v) v.begin(), v.end()
#define UNIQUE(v) \
sort(ALL(v)); \
v.erase(unique(ALL(v)), v.end());
#define pb push_back
#include <cstdint>
struct mint {
using i64 = std::int_fast64_t;
const static i64 mod = 1000000007;
i64 n;
public:
mint(const i64 n = 0) : n((n % mod + mod) % mod) {}
mint pow(int m) const {
i64 a = n, r = 1;
while (m > 0) {
if (m & 1) {
r *= a;
r %= mod;
}
a = (a * a) % mod;
m /= 2;
}
return mint(r);
}
mint &operator++() {
*this += 1;
return *this;
}
mint &operator--() {
*this -= 1;
return *this;
}
mint operator++(int) {
mint ret = *this;
*this += 1;
return ret;
}
mint operator--(int) {
mint ret = *this;
*this -= 1;
return ret;
}
mint operator~() const { return (this->pow(mod - 2)); } // inverse
friend bool operator==(const mint &lhs, const mint &rhs) {
return lhs.n == rhs.n;
}
friend mint &operator+=(mint &lhs, const mint &rhs) {
lhs.n += rhs.n;
if (lhs.n >= mod)
lhs.n -= mod;
return lhs;
}
friend mint &operator-=(mint &lhs, const mint &rhs) {
lhs.n -= rhs.n;
if (lhs.n < 0)
lhs.n += mod;
return lhs;
}
friend mint &operator*=(mint &lhs, const mint &rhs) {
lhs.n = (lhs.n * rhs.n) % mod;
return lhs;
}
friend mint &operator/=(mint &lhs, const mint &rhs) {
lhs.n = (lhs.n * (~rhs).n) % mod;
return lhs;
}
friend mint operator+(const mint &lhs, const mint &rhs) {
return mint(lhs.n + rhs.n);
}
friend mint operator-(const mint &lhs, const mint &rhs) {
return mint(lhs.n - rhs.n);
}
friend mint operator*(const mint &lhs, const mint &rhs) {
return mint(lhs.n * rhs.n);
}
friend mint operator/(const mint &lhs, const mint &rhs) {
return mint(lhs.n * (~rhs).n);
}
};
istream &operator>>(istream &is, mint &m) {
is >> m.n;
return is;
}
ostream &operator<<(ostream &os, mint &m) {
os << m.n;
return os;
}
#define MAX_N 1000000
long long extgcd(long long a, long long b, long long &x, long long &y) {
long long d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
long long mod_inverse(long long a, long long m) {
long long x, y;
if (extgcd(a, m, x, y) == 1)
return (m + x % m) % m;
else
return -1;
}
vector<long long> fact(MAX_N + 1, INF);
long long mod_fact(long long n, long long &e) {
if (fact[0] == INF) {
fact[0] = 1;
if (MAX_N != 0)
fact[1] = 1;
for (lint i = 2; i <= MAX_N; ++i) {
fact[i] = (fact[i - 1] * i) % MOD;
}
}
e = 0;
if (n == 0)
return 1;
long long res = mod_fact(n / MOD, e);
e += n / MOD;
if ((n / MOD) % 2 != 0)
return (res * (MOD - fact[n % MOD])) % MOD;
return (res * fact[n % MOD]) % MOD;
}
// return nCk
long long mod_comb(long long n, long long k) {
if (n < 0 || k < 0 || n < k)
return 0;
long long e1, e2, e3;
long long a1 = mod_fact(n, e1), a2 = mod_fact(k, e2),
a3 = mod_fact(n - k, e3);
if (e1 > e2 + e3)
return 0;
return (a1 * mod_inverse((a2 * a3) % MOD, MOD)) % MOD;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, x;
cin >> n >> x;
if (x == 2) {
cout << 1 + n << endl;
return 0;
}
mint ans = 1;
FOR(m, 1, n + 1) {
if (x == 1) {
ans += mod_comb(n, m);
continue;
}
mint tmp = 0;
REP(i, m + 1) {
if (i * 2 + (m - i) * 1 >= x)
break;
tmp += mod_comb(m, i);
}
FOR(i, 1, m) {
if (i < m - i) {
if (2 * i == x - 1)
tmp++;
} else {
tmp += mod_comb(m - 2 * (m - i), x - 1 - 2 * (m - i) - (i - (m - i)));
}
}
ans += tmp * mod_comb(n, m);
}
cout << ans << endl;
return 0;
}
/* --------------------------------------- */
| #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 = long double;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define MOD 998244353LL
#define INF 1000000000LL
#define EPS 1e-10
#define FOR(i, n, m) for (lint i = n; i < (int)m; i++)
#define REP(i, n) FOR(i, 0, n)
#define DUMP(a) \
REP(d, a.size()) { \
cout << a[d]; \
if (d != a.size() - 1) \
cout << " "; \
else \
cout << endl; \
}
#define ALL(v) v.begin(), v.end()
#define UNIQUE(v) \
sort(ALL(v)); \
v.erase(unique(ALL(v)), v.end());
#define pb push_back
#include <cstdint>
struct mint {
using i64 = std::int_fast64_t;
const static i64 mod = 998244353;
i64 n;
public:
mint(const i64 n = 0) : n((n % mod + mod) % mod) {}
mint pow(int m) const {
i64 a = n, r = 1;
while (m > 0) {
if (m & 1) {
r *= a;
r %= mod;
}
a = (a * a) % mod;
m /= 2;
}
return mint(r);
}
mint &operator++() {
*this += 1;
return *this;
}
mint &operator--() {
*this -= 1;
return *this;
}
mint operator++(int) {
mint ret = *this;
*this += 1;
return ret;
}
mint operator--(int) {
mint ret = *this;
*this -= 1;
return ret;
}
mint operator~() const { return (this->pow(mod - 2)); } // inverse
friend bool operator==(const mint &lhs, const mint &rhs) {
return lhs.n == rhs.n;
}
friend mint &operator+=(mint &lhs, const mint &rhs) {
lhs.n += rhs.n;
if (lhs.n >= mod)
lhs.n -= mod;
return lhs;
}
friend mint &operator-=(mint &lhs, const mint &rhs) {
lhs.n -= rhs.n;
if (lhs.n < 0)
lhs.n += mod;
return lhs;
}
friend mint &operator*=(mint &lhs, const mint &rhs) {
lhs.n = (lhs.n * rhs.n) % mod;
return lhs;
}
friend mint &operator/=(mint &lhs, const mint &rhs) {
lhs.n = (lhs.n * (~rhs).n) % mod;
return lhs;
}
friend mint operator+(const mint &lhs, const mint &rhs) {
return mint(lhs.n + rhs.n);
}
friend mint operator-(const mint &lhs, const mint &rhs) {
return mint(lhs.n - rhs.n);
}
friend mint operator*(const mint &lhs, const mint &rhs) {
return mint(lhs.n * rhs.n);
}
friend mint operator/(const mint &lhs, const mint &rhs) {
return mint(lhs.n * (~rhs).n);
}
};
istream &operator>>(istream &is, mint &m) {
is >> m.n;
return is;
}
ostream &operator<<(ostream &os, mint &m) {
os << m.n;
return os;
}
#define MAX_N 1000000
long long extgcd(long long a, long long b, long long &x, long long &y) {
long long d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
long long mod_inverse(long long a, long long m) {
long long x, y;
if (extgcd(a, m, x, y) == 1)
return (m + x % m) % m;
else
return -1;
}
vector<long long> fact(MAX_N + 1, INF);
long long mod_fact(long long n, long long &e) {
if (fact[0] == INF) {
fact[0] = 1;
if (MAX_N != 0)
fact[1] = 1;
for (lint i = 2; i <= MAX_N; ++i) {
fact[i] = (fact[i - 1] * i) % MOD;
}
}
e = 0;
if (n == 0)
return 1;
long long res = mod_fact(n / MOD, e);
e += n / MOD;
if ((n / MOD) % 2 != 0)
return (res * (MOD - fact[n % MOD])) % MOD;
return (res * fact[n % MOD]) % MOD;
}
// return nCk
long long mod_comb(long long n, long long k) {
if (n < 0 || k < 0 || n < k)
return 0;
long long e1, e2, e3;
long long a1 = mod_fact(n, e1), a2 = mod_fact(k, e2),
a3 = mod_fact(n - k, e3);
if (e1 > e2 + e3)
return 0;
return (a1 * mod_inverse((a2 * a3) % MOD, MOD)) % MOD;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, x;
cin >> n >> x;
if (x == 2) {
cout << 1 + n << endl;
return 0;
}
mint ans = 1;
FOR(m, 1, n + 1) {
if (x == 1) {
ans += mod_comb(n, m);
continue;
}
mint tmp = 0;
REP(i, m + 1) {
if (i * 2 + (m - i) * 1 >= x)
break;
tmp += mod_comb(m, i);
}
FOR(i, 1, m) {
if (i < m - i) {
if (2 * i == x - 1)
tmp++;
} else {
tmp += mod_comb(m - 2 * (m - i), x - 1 - 2 * (m - i) - (i - (m - i)));
}
}
ans += tmp * mod_comb(n, m);
}
cout << ans << endl;
return 0;
}
/* --------------------------------------- */
| [
"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;
/*
包除原理
*/
ll n, a[310], dp[90010] = {}, dp2[90010] = {}, mod = 998244353, zenbu = 1,
sum = 0, ans = 0, inv2, ue = 0, mannaka = 0;
void init() {
cin >> n;
rep(i, n) cin >> a[i];
dp[0] = 1;
rep(i, n) sum += a[i];
rep(i, n) zenbu = (zenbu * 3) % mod;
cerr << "初期化終了" << endl;
}
int main(void) {
init();
rep(i, n) {
reg(j, 0, sum) dp2[j] = 0;
reg(j, 0, sum) {
dp2[j] = (dp2[j] + dp[j] * 2) % mod; //残りの2つに置く
if (j + a[i] <= sum)
dp2[j + a[i]] = (dp2[j + a[i]] + dp[j]) % mod; // Rに置く
}
reg(j, 0, sum) dp[j] = dp2[j];
}
reg(i, (sum + 1) / 2, sum) ue = (ue + dp[i]) % mod;
reg(j, 0, sum) dp[j] = 0;
dp[0] = 1;
rep(i, n) {
reg(j, 0, sum) dp2[j] = 0;
reg(j, 0, sum) {
dp2[j] = (dp2[j] + dp[j]) % mod; // Bに置く
if (j + a[i] <= sum)
dp2[j + a[i]] = (dp2[j + a[i]] + dp[j]) % mod; // Rに置く
}
reg(j, 0, sum) dp[j] = dp2[j];
}
if (sum % 2 == 0)
mannaka = dp[sum / 2];
ans = (zenbu + mod - ue * 3 + mannaka * 3) % mod;
cerr << sum << endl;
cerr << mannaka << endl;
cout << ans << endl;
return 0;
} | #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;
/*
包除原理
*/
ll n, a[310], dp[90010] = {}, dp2[90010] = {}, mod = 998244353, zenbu = 1,
sum = 0, ans = 0, inv2, ue = 0, mannaka = 0;
void init() {
cin >> n;
rep(i, n) cin >> a[i];
dp[0] = 1;
rep(i, n) sum += a[i];
rep(i, n) zenbu = (zenbu * 3) % mod;
cerr << "初期化終了" << endl;
}
int main(void) {
init();
rep(i, n) {
reg(j, 0, sum) dp2[j] = 0;
reg(j, 0, sum) {
dp2[j] = (dp2[j] + dp[j] * 2) % mod; //残りの2つに置く
if (j + a[i] <= sum)
dp2[j + a[i]] = (dp2[j + a[i]] + dp[j]) % mod; // Rに置く
}
reg(j, 0, sum) dp[j] = dp2[j];
}
reg(i, (sum + 1) / 2, sum) ue = (ue + dp[i]) % mod;
reg(j, 0, sum) dp[j] = 0;
dp[0] = 1;
rep(i, n) {
reg(j, 0, sum) dp2[j] = 0;
reg(j, 0, sum) {
dp2[j] = (dp2[j] + dp[j]) % mod; // Bに置く
if (j + a[i] <= sum)
dp2[j + a[i]] = (dp2[j + a[i]] + dp[j]) % mod; // Rに置く
}
reg(j, 0, sum) dp[j] = dp2[j];
}
if (sum % 2 == 0)
mannaka = dp[sum / 2];
ans = (zenbu + mod * 3 - ue * 3 + mannaka * 3) % mod;
cerr << sum << endl;
cerr << mannaka << endl;
cout << ans << endl;
return 0;
} | [
"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() {
char c = getchar();
int d = 0, f = 1;
for (; c < '0' || c > '9'; c = getchar())
if (c == '-')
f = -1;
for (; c >= '0' && c <= '9'; d = d * 10 + c - 48, c = getchar())
;
return d * f;
}
const int N = 310;
const int mod = 998244353;
int n, a[N], dp[N][N * N];
void inc(int &a, int b) {
a += b;
if (a >= mod)
a -= mod;
}
int main() {
cin >> n;
int sum = 0;
ref(i, 1, n) cin >> a[i], sum += a[i];
dp[0][0] = 1;
ref(i, 1, n) ref(j, 0, 90000) if (dp[i - 1][j]) {
inc(dp[i][j + a[i]], dp[i - 1][j]);
inc(dp[i][j], dp[i - 1][j] * 2 % mod);
}
int ans = 0;
ref(i, sum / 2, sum) inc(ans, (LL)dp[n][i] * 3 % mod);
if (sum % 2 == 0) {
memset(dp, 0, sizeof dp);
dp[0][0] = 1;
ref(i, 1, n) ref(j, 0, 90000) if (dp[i - 1][j]) {
inc(dp[i][j + a[i]], dp[i - 1][j]);
inc(dp[i][j], dp[i - 1][j]);
}
inc(ans, mod - (LL)dp[n][sum / 2] * 3 % mod);
}
int anss = 1;
ref(i, 1, n) anss = (LL)anss * 3 % mod;
ans = (anss + mod - ans) % mod;
cout << ans << endl;
} | #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() {
char c = getchar();
int d = 0, f = 1;
for (; c < '0' || c > '9'; c = getchar())
if (c == '-')
f = -1;
for (; c >= '0' && c <= '9'; d = d * 10 + c - 48, c = getchar())
;
return d * f;
}
const int N = 310;
const int mod = 998244353;
int n, a[N], dp[N][N * N];
void inc(int &a, int b) {
a += b;
if (a >= mod)
a -= mod;
}
int main() {
cin >> n;
int sum = 0;
ref(i, 1, n) cin >> a[i], sum += a[i];
dp[0][0] = 1;
ref(i, 1, n) ref(j, 0, 90000) if (dp[i - 1][j]) {
inc(dp[i][j + a[i]], dp[i - 1][j]);
inc(dp[i][j], dp[i - 1][j] * 2 % mod);
}
int ans = 0;
ref(i, (sum + 1) / 2, sum) inc(ans, (LL)dp[n][i] * 3 % mod);
if (sum % 2 == 0) {
memset(dp, 0, sizeof dp);
dp[0][0] = 1;
ref(i, 1, n) ref(j, 0, 90000) if (dp[i - 1][j]) {
inc(dp[i][j + a[i]], dp[i - 1][j]);
inc(dp[i][j], dp[i - 1][j]);
}
inc(ans, mod - (LL)dp[n][sum / 2] * 3 % mod);
}
int anss = 1;
ref(i, 1, n) anss = (LL)anss * 3 % mod;
ans = (anss + mod - ans) % mod;
cout << ans << endl;
} | [
"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];
}
ans = 1;
for (LL i = 1; i <= n; ++i)
ans = ans * 3 % mod;
f[0][0] = 1;
for (LL i = 1; i <= n; ++i)
for (LL j = 0; j <= i * 300; ++j) {
upd(f[i][j], f[i - 1][j] * 2);
upd(f[i][j + a[i]], f[i - 1][j]);
}
for (LL i = (sum + 1) / 2; i <= n * 300; ++i)
upd(ans, -f[n][i] * 3);
if (sum % 2 == 0) {
memset(f, 0, sizeof f);
f[0][0] = 1;
for (LL i = 1; i <= n; ++i)
for (LL j = 0; j <= i * 300; ++j) {
upd(f[i][j], f[i - 1][j]);
upd(f[i][j + a[i]], f[i - 1][j]);
}
upd(ans, f[n][sum / 2] * 3);
}
printf("%lld\n", ans);
return 0;
}
| #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];
}
ans = 1;
for (LL i = 1; i <= n; ++i)
ans = ans * 3 % mod;
f[0][0] = 1;
for (LL i = 1; i <= n; ++i)
for (LL j = 0; j <= i * 300; ++j) {
upd(f[i][j], f[i - 1][j] * 2);
upd(f[i][j + a[i]], f[i - 1][j]);
}
for (LL i = (sum + 1) / 2; i <= n * 300; ++i)
upd(ans, -f[n][i] * 3);
if (sum % 2 == 0) {
memset(f, 0, sizeof f);
f[0][0] = 1;
for (LL i = 1; i <= n; ++i)
for (LL j = 0; j <= i * 300; ++j) {
upd(f[i][j], f[i - 1][j]);
upd(f[i][j + a[i]], f[i - 1][j]);
}
upd(ans, f[n][sum / 2] * 3);
}
printf("%lld\n", ans);
return 0;
}
| [
"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) (c).begin(), (c).end()
#define dump(x) cout << #x << " = " << (x) << endl
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
rep(i, v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
vi enu(int x) {
vi res;
for (int i = 2; i * i <= x; ++i) {
if (x % i == 0) {
while (x % i == 0) {
x /= i;
}
res.pb(i);
}
}
if (x != 1) {
res.pb(x);
}
return res;
}
int main() {
int N;
cin >> N;
vi a(N + 1);
for (int i = 0; i <= N; ++i) {
cin >> a[i];
}
vi cand;
for (int i = 2; i <= N; ++i) {
bool f = 1;
for (int j = 2; j * j <= i; ++j) {
if (i % j == 0) {
f = 0;
}
}
if (f) {
cand.pb(i);
}
}
int d = -1;
for (int i = 0; i <= N; ++i) {
int t = abs(a[i]);
if (d == -1) {
d = t;
} else {
d = __gcd(d, t);
}
}
vi u = enu(d);
set<int> st;
for (int x : cand) {
st.insert(x);
}
for (int x : u) {
st.insert(x);
}
for (auto x : st) {
vi coef = a;
for (int &v : a) {
v %= x;
}
for (int i = 0; i <= N - x; ++i) {
(coef[i + (x - 1)] += coef[i]) %= x;
coef[i] = 0;
}
bool ok = 1;
for (int &t : coef) {
if (t) {
ok = 0;
}
}
if (ok) {
cout << x << endl;
}
}
return 0;
} | #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) (c).begin(), (c).end()
#define dump(x) cout << #x << " = " << (x) << endl
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
rep(i, v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
vi enu(int x) {
vi res;
for (int i = 2; i * i <= x; ++i) {
if (x % i == 0) {
while (x % i == 0) {
x /= i;
}
res.pb(i);
}
}
if (x != 1) {
res.pb(x);
}
return res;
}
int main() {
int N;
cin >> N;
vi a(N + 1);
for (int i = 0; i <= N; ++i) {
cin >> a[i];
}
vi cand;
for (int i = 2; i <= N; ++i) {
bool f = 1;
for (int j = 2; j * j <= i; ++j) {
if (i % j == 0) {
f = 0;
}
}
if (f) {
cand.pb(i);
}
}
int d = -1;
for (int i = 0; i <= N; ++i) {
int t = abs(a[i]);
if (d == -1) {
d = t;
} else {
d = __gcd(d, t);
}
}
vi u = enu(d);
set<int> st;
for (int x : cand) {
st.insert(x);
}
for (int x : u) {
st.insert(x);
}
for (auto x : st) {
vi coef = a;
for (int &v : coef) {
v %= x;
}
for (int i = 0; i + x <= N; ++i) {
(coef[i + (x - 1)] += coef[i]) %= x;
coef[i] = 0;
}
bool ok = 1;
for (int &t : coef) {
if (t) {
ok = 0;
}
}
if (ok) {
cout << x << endl;
}
}
return 0;
} | [
"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++) {
if (is[p]) {
for (int i = p * p; i <= N; i += p) {
is[i] = false;
}
}
}
for (int p = 2; p <= n; p++) {
if (is[p])
prime.emplace_back(p);
}
};
sieve();
auto check = [&](int p) {
if (a[0] % p)
return false;
for (int k = 1; k < p; k++) {
int s = 0;
for (int i = k; i <= n; i += p - 1) {
s = (s + a[i]) % p;
}
s = (s + p) % p;
if (s)
return false;
}
return true;
};
vector<int> res;
res.reserve(N);
for (int p : prime) {
if (p <= n && check(p))
res.emplace_back(p);
}
int g = 0;
for (int x : a) {
g = __gcd(g, abs(x));
}
for (int p : prime) {
if (g % p == 0) {
res.emplace_back(p);
while (g % p == 0) {
g /= p;
}
}
}
if (g > 1)
res.emplace_back(g);
sort(res.begin(), res.end());
res.erase(unique(res.begin(), res.end()), res.end());
for (int p : res) {
cout << p << "\n";
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
cout << endl;
}
| #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++) {
if (is[p]) {
for (int i = p * p; i <= N; i += p) {
is[i] = false;
}
}
}
for (int p = 2; p <= N; p++) {
if (is[p])
prime.emplace_back(p);
}
};
sieve();
auto check = [&](int p) {
if (a[0] % p)
return false;
for (int k = 1; k < p; k++) {
int s = 0;
for (int i = k; i <= n; i += p - 1) {
s = (s + a[i]) % p;
}
s = (s + p) % p;
if (s)
return false;
}
return true;
};
vector<int> res;
res.reserve(N);
for (int p : prime) {
if (p <= n && check(p))
res.emplace_back(p);
}
int g = 0;
for (int x : a) {
g = __gcd(g, abs(x));
}
for (int p : prime) {
if (g % p == 0) {
res.emplace_back(p);
while (g % p == 0) {
g /= p;
}
}
}
if (g > 1)
res.emplace_back(g);
sort(res.begin(), res.end());
res.erase(unique(res.begin(), res.end()), res.end());
for (int p : res) {
cout << p << "\n";
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
cout << endl;
}
| [
"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 gcd(ll a, ll b) { return (b == 0) ? a : (gcd(b, a % b)); }
int main() {
scanf("%d", &n);
ll gg = 0;
fd(i, n, 0) scanf("%lld", &a[i]), gg = gcd(gg, (a[i] > 0) ? (a[i]) : (-a[i]));
fo(i, 2, n) {
if (!bz[i])
ss[++oo] = i;
fo(j, 1, oo) if (i * ss[j] <= n) {
bz[i * ss[j]] = true;
if (i % ss[j] == 0)
break;
}
else break;
}
fo(i, 1, oo) if (a[0] % ss[i] == 0) {
int t = ss[i] - 1, mo = ss[i];
fo(l, 0, n - 1) b[l] = a[l + 1] % mo;
fd(l, n - 1, t) b[l - t] = (b[l - t] + b[l]) % mo;
int ok = 1;
fo(l, 0, t - 1) ok = ok & (b[l] == 0) % mo;
if (ok)
printf("%d\n", mo);
}
int sr = sqrt(gg);
int lef = gg;
fo(i, 2, sr) if (lef % i == 0) {
while (lef % i == 0)
lef /= i;
if (i > n)
printf("%d\n", i);
}
if (lef > n)
printf("%d\n", lef);
} | #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 gcd(ll a, ll b) { return (b == 0) ? a : (gcd(b, a % b)); }
int main() {
scanf("%d", &n);
ll gg = 0;
fd(i, n, 0) scanf("%lld", &a[i]), gg = gcd(gg, (a[i] > 0) ? (a[i]) : (-a[i]));
fo(i, 2, n) {
if (!bz[i])
ss[++oo] = i;
fo(j, 1, oo) if (i * ss[j] <= n) {
bz[i * ss[j]] = true;
if (i % ss[j] == 0)
break;
}
else break;
}
fo(i, 1, oo) if (a[0] % ss[i] == 0) {
int t = ss[i] - 1, mo = ss[i];
fo(l, 0, n - 1) b[l] = a[l + 1] % mo;
fd(l, n - 1, t) b[l - t] = (b[l - t] + b[l]) % mo;
int ok = 1;
fo(l, 0, t - 1) ok = ok & (b[l] == 0) % mo;
if (ok)
printf("%d\n", mo);
}
int sr = sqrt(gg);
int lef = gg;
fo(i, 2, sr) if (lef % i == 0) {
while (lef % i == 0)
lef /= i;
if (i > n)
printf("%d\n", i);
}
if (lef > n && lef > 1)
printf("%d\n", lef);
} | [
"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 (auto &i : a)
cin >> i;
long u{0};
for (const auto i : a)
u = __gcd(u, abs(i));
vector<long> ans;
for (const auto p : prime)
if (u % p == 0) {
ans.push_back(p);
while (u % p == 0)
u /= p;
} else if (p <= N) {
vector<long> v(p);
for (unsigned long j = 0, k = 0; j < N; ++j) {
v[k] += a[j];
if (++k == p - 1)
k = 0;
}
[&] {
if (!(a[N] % p))
return;
for (auto j : v)
if (!(j % p))
return;
ans.push_back(p);
}();
}
for (const auto i : ans)
cout << i << endl;
if (u != 1)
cout << u << endl;
} | #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 (auto &i : a)
cin >> i;
long u{0};
for (const auto i : a)
u = __gcd(u, abs(i));
vector<long> ans;
for (const auto p : prime)
if (u % p == 0) {
ans.push_back(p);
while (u % p == 0)
u /= p;
} else if (p <= N) {
vector<long> v(p);
for (unsigned long j = 0, k = 0; j < N; ++j) {
v[k] += a[j];
if (++k == p - 1)
k = 0;
}
[&] {
if (a[N] % p)
return;
for (auto j : v)
if (j % p)
return;
ans.push_back(p);
}();
}
for (const auto i : ans)
cout << i << endl;
if (u != 1)
cout << u << endl;
} | [
"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) \
{ \
REP(WW, n) cerr << v[WW] << ' '; \
cerr << endl << endl; \
}
#define SHOW2d(v, WW, HH) \
{ \
REP(W_, WW) { \
REP(H_, HH) cerr << v[W_][H_] << ' '; \
cerr << endl; \
} \
cerr << endl; \
}
#define ALL(v) v.begin(), v.end()
#define Decimal fixed << setprecision(20)
#define INF 1000000000
#define LLINF 1000000000000000000LL
#define MOD 998244353
typedef long long ll;
typedef pair<ll, ll> P;
vector<int> makePrimeList() {
int range = 1000000;
vector<int> ret;
vector<bool> notp(range);
notp[0] = notp[1] = true;
for (int i = 2; i < range; i++) {
if (!notp[i]) {
ret.PB(i);
for (int j = 2 * i; j < range; j += i) {
notp[j] = true;
}
}
}
return ret;
}
void check(vector<ll> v, vector<ll> &ans, ll now) {
bool flag = true;
int n = v.size();
REP(i, n) if (v[i] % n) flag = false;
if (flag)
ans.PB(now);
}
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vector<ll> v(n + 1);
REV(i, n + 1) cin >> v[i];
auto p = makePrimeList();
vector<ll> ans;
for (ll i = 0; p[i] <= n; i++) {
if (!(v[0] == 0 || v[0] % p[i] == 0))
continue;
vector<ll> now(p[i] - 1, 0);
for (int j = 1; j <= n; j++) {
now[(j - 1) % (p[i] - 1)] += v[j];
}
bool flag = true;
REP(j, p[i] - 1) {
if (abs(now[j]) % p[i] != 0)
flag = false;
}
if (flag)
ans.PB(p[i]);
}
REP(i, n + 1) v[i] = abs(v[i]);
REP(i, p.size()) {
if (p[i] > n && v[n] % p[i] == 0) {
check(v, ans, p[i]);
}
while (v[n] != 0 && v[n] % p[i] == 0)
v[n] /= p[i];
}
if (v[n] > 1) {
check(v, ans, v[n]);
}
REP(i, ans.size()) { cout << ans[i] << endl; }
return 0;
}
| #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) \
{ \
REP(WW, n) cerr << v[WW] << ' '; \
cerr << endl << endl; \
}
#define SHOW2d(v, WW, HH) \
{ \
REP(W_, WW) { \
REP(H_, HH) cerr << v[W_][H_] << ' '; \
cerr << endl; \
} \
cerr << endl; \
}
#define ALL(v) v.begin(), v.end()
#define Decimal fixed << setprecision(20)
#define INF 1000000000
#define LLINF 1000000000000000000LL
#define MOD 998244353
typedef long long ll;
typedef pair<ll, ll> P;
vector<int> makePrimeList() {
int range = 1000000;
vector<int> ret;
vector<bool> notp(range);
notp[0] = notp[1] = true;
for (int i = 2; i < range; i++) {
if (!notp[i]) {
ret.PB(i);
for (int j = 2 * i; j < range; j += i) {
notp[j] = true;
}
}
}
return ret;
}
void check(vector<ll> v, vector<ll> &ans, ll now) {
bool flag = true;
int n = v.size();
REP(i, n) if (v[i] % now) flag = false;
if (flag)
ans.PB(now);
}
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vector<ll> v(n + 1);
REV(i, n + 1) cin >> v[i];
auto p = makePrimeList();
vector<ll> ans;
for (ll i = 0; p[i] <= n; i++) {
if (!(v[0] == 0 || v[0] % p[i] == 0))
continue;
vector<ll> now(p[i] - 1, 0);
for (int j = 1; j <= n; j++) {
now[(j - 1) % (p[i] - 1)] += v[j];
}
bool flag = true;
REP(j, p[i] - 1) {
if (abs(now[j]) % p[i] != 0)
flag = false;
}
if (flag)
ans.PB(p[i]);
}
REP(i, n + 1) v[i] = abs(v[i]);
REP(i, p.size()) {
if (p[i] > n && v[n] % p[i] == 0) {
check(v, ans, p[i]);
}
while (v[n] != 0 && v[n] % p[i] == 0)
v[n] /= p[i];
}
if (v[n] > 1) {
check(v, ans, v[n]);
}
REP(i, ans.size()) { cout << ans[i] << endl; }
return 0;
}
| [
"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 = s[k];
for (int i = 0; i < n; i++) {
if (s[i] != c)
s[i] = '*';
}
cout << s << endl;
return 0;
}
// EOF
| #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 = s[k - 1];
for (int i = 0; i < n; i++) {
if (s[i] != c)
s[i] = '*';
}
cout << s << endl;
return 0;
}
// EOF
| [
"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 white = 0, black = 0;
rep(i, N) {
if (S[i] == '.')
white++;
}
int ans = INF;
rep(i, N) {
if (S[i] == '#')
black++;
if (S[i] == '.')
white--;
ans = min(ans, black + white);
}
cout << ans << endl;
return 0;
} | #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 white = 0, black = 0;
rep(i, N) {
if (S[i] == '.')
white++;
}
int ans = white;
rep(i, N) {
if (S[i] == '#')
black++;
if (S[i] == '.')
white--;
ans = min(ans, black + white);
}
cout << ans << endl;
return 0;
}
| [
"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 == '.') {
numW++;
} else {
numB++;
}
}
int seenW = 0;
int seenB = 0;
int ret = N + 100;
for (auto c : S) {
if (c == '.') {
seenW++;
numW--;
} else {
seenB++;
numB--;
}
ret = min(ret, seenB + numW);
}
cout << ret << endl;
return 0;
}
| #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) {
if (c == '.') {
numW++;
} else {
numB++;
}
}
int seenW = 0;
int seenB = 0;
int ret = seenB + numW;
for (auto c : S) {
if (c == '.') {
seenW++;
numW--;
} else {
seenB++;
numB--;
}
ret = min(ret, seenB + numW);
}
cout << ret << endl;
return 0;
}
| [
"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) {
if (c == '.') {
numW++;
} else {
numB++;
}
}
int seenW = 0;
int seenB = 0;
int ret = N;
for (auto c : S) {
if (c == '.') {
seenW++;
numW--;
} else {
seenB++;
numB--;
}
ret = min(ret, seenB + numW);
}
cout << ret << endl;
return 0;
}
| #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) {
if (c == '.') {
numW++;
} else {
numB++;
}
}
int seenW = 0;
int seenB = 0;
int ret = seenB + numW;
for (auto c : S) {
if (c == '.') {
seenW++;
numW--;
} else {
seenB++;
numB--;
}
ret = min(ret, seenB + numW);
}
cout << ret << endl;
return 0;
}
| [
"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 REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
ll dx[4] = {1, 0, -1, 0};
ll dy[4] = {0, 1, 0, -1};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
ll a, b;
ll k, t;
string str;
ll h, w;
char c, ko;
cin >> n >> str;
n = str.length();
a = 0;
k = 0;
rep(i, n) {
if (str[i] == '.')
a++;
else
k++;
}
ll sum = min(a, k);
reverse(all(str));
b = 0;
w = 0;
rep(i, n) {
if (str[i] == '#')
b++;
// else w++;
sum = min(sum, k - b + a);
}
cout << sum << endl;
return 0;
}
| // 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 REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
ll dx[4] = {1, 0, -1, 0};
ll dy[4] = {0, 1, 0, -1};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
ll a, b;
ll k, t;
string str;
ll h, w;
char c, ko;
cin >> n >> str;
n = str.length();
a = 0;
k = 0;
rep(i, n) {
if (str[i] == '.')
a++;
else
k++;
}
ll sum = min(a, k);
reverse(all(str));
b = 0;
w = 0;
rep(i, n) {
if (str[i] == '#')
b++;
else
w++;
sum = min(sum, k - b + w);
}
cout << sum << endl;
return 0;
}
| [
"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("%d", &test); \
while (test--)
#define INT(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define yn(ans) \
if (ans) \
printf("Yes\n"); \
else \
printf("No\n")
#define YN(ans) \
if (ans) \
printf("YES\n"); \
else \
printf("NO\n")
#define vector1d(type, name, ...) vector<type> name(__VA_ARGS__)
#define vector2d(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD = 1000000007;
//入力系
void scan(int &a) { scanf("%d", &a); }
void scan(long long &a) { scanf("%lld", &a); }
template <class T> void scan(T &a) { cin >> a; }
template <class T> void scan(vector<T> &vec) {
for (auto &&it : vec)
scan(it);
}
void in() {}
template <class Head, class... Tail> void in(Head &head, Tail &...tail) {
scan(head);
in(tail...);
}
//出力系
void print(const int &a) { printf("%d", a); }
void print(const long long &a) { printf("%lld", a); }
void print(const double &a) { printf("%.15lf", a); }
template <class T> void print(const T &a) { cout << a; }
template <class T> void print(const vector<T> &vec) {
if (vec.empty())
return;
print(vec[0]);
for (auto it = vec.begin(); ++it != vec.end();) {
putchar(' ');
print(*it);
}
}
void out() { putchar('\n'); }
template <class T> void out(const T &t) {
print(t);
putchar('\n');
}
template <class Head, class... Tail>
void out(const Head &head, const Tail &...tail) {
print(head);
putchar(' ');
out(tail...);
}
//デバッグ系
template <class T> void dprint(const T &a) { cerr << a; }
template <class T> void dprint(const vector<T> &vec) {
if (vec.empty())
return;
cerr << vec[0];
for (auto it = vec.begin(); ++it != vec.end();) {
cerr << " " << *it;
}
}
void debug() { cerr << endl; }
template <class T> void debug(const T &t) {
dprint(t);
cerr << endl;
}
template <class Head, class... Tail>
void debug(const Head &head, const Tail &...tail) {
dprint(head);
cerr << " ";
debug(tail...);
}
ll intpow(ll a, ll b) {
ll ans = 1;
while (b) {
if (b & 1)
ans *= a;
a *= a;
b /= 2;
}
return ans;
}
ll modpow(ll a, ll b, ll p) {
ll ans = 1;
while (b) {
if (b & 1)
(ans *= a) %= p;
(a *= a) %= p;
b /= 2;
}
return ans;
}
ll updivide(ll a, ll b) {
if (a % b == 0)
return a / b;
else
return (a / b) + 1;
}
int main() {
INT(n);
string s;
cin >> s;
int black = 0, white = 0;
vector<int> b(n), w(n);
rep(i, n) {
black += (s[i] == '#');
white += (s[i] == '.');
b[i] = black;
w[i] = white;
}
int ans = 1000000;
rep(i, n) { ans = min(ans, b[i] + white - w[i]); }
out(ans);
} | #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("%d", &test); \
while (test--)
#define INT(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define yn(ans) \
if (ans) \
printf("Yes\n"); \
else \
printf("No\n")
#define YN(ans) \
if (ans) \
printf("YES\n"); \
else \
printf("NO\n")
#define vector1d(type, name, ...) vector<type> name(__VA_ARGS__)
#define vector2d(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD = 1000000007;
//入力系
void scan(int &a) { scanf("%d", &a); }
void scan(long long &a) { scanf("%lld", &a); }
template <class T> void scan(T &a) { cin >> a; }
template <class T> void scan(vector<T> &vec) {
for (auto &&it : vec)
scan(it);
}
void in() {}
template <class Head, class... Tail> void in(Head &head, Tail &...tail) {
scan(head);
in(tail...);
}
//出力系
void print(const int &a) { printf("%d", a); }
void print(const long long &a) { printf("%lld", a); }
void print(const double &a) { printf("%.15lf", a); }
template <class T> void print(const T &a) { cout << a; }
template <class T> void print(const vector<T> &vec) {
if (vec.empty())
return;
print(vec[0]);
for (auto it = vec.begin(); ++it != vec.end();) {
putchar(' ');
print(*it);
}
}
void out() { putchar('\n'); }
template <class T> void out(const T &t) {
print(t);
putchar('\n');
}
template <class Head, class... Tail>
void out(const Head &head, const Tail &...tail) {
print(head);
putchar(' ');
out(tail...);
}
//デバッグ系
template <class T> void dprint(const T &a) { cerr << a; }
template <class T> void dprint(const vector<T> &vec) {
if (vec.empty())
return;
cerr << vec[0];
for (auto it = vec.begin(); ++it != vec.end();) {
cerr << " " << *it;
}
}
void debug() { cerr << endl; }
template <class T> void debug(const T &t) {
dprint(t);
cerr << endl;
}
template <class Head, class... Tail>
void debug(const Head &head, const Tail &...tail) {
dprint(head);
cerr << " ";
debug(tail...);
}
ll intpow(ll a, ll b) {
ll ans = 1;
while (b) {
if (b & 1)
ans *= a;
a *= a;
b /= 2;
}
return ans;
}
ll modpow(ll a, ll b, ll p) {
ll ans = 1;
while (b) {
if (b & 1)
(ans *= a) %= p;
(a *= a) %= p;
b /= 2;
}
return ans;
}
ll updivide(ll a, ll b) {
if (a % b == 0)
return a / b;
else
return (a / b) + 1;
}
int main() {
INT(n);
string s;
cin >> s;
int black = 0, white = 0;
vector<int> b(n), w(n);
rep(i, n) {
black += (s[i] == '#');
white += (s[i] == '.');
b[i] = black;
w[i] = white;
}
int ans = min(white, black);
rep(i, n) { ans = min(ans, b[i] + white - w[i]); }
out(ans);
} | [
"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.