problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03197 | #include <iostream>
using namespace std;
int n;
int a;
int gg;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (a % 2 != 0)
gg++;
}
if (gg % 2 == 0) {
cout << "second" << endl;
} else {
cout << "first" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int n;
int a;
int gg;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (a % 2 != 0)
gg++;
}
if (gg != 0) {
cout << "first" << endl;
} else {
cout << "second" << endl;
}
return 0;
} | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove",
"literal.string.change",
"io.output.change"
] | 991,320 | 991,321 | u816631826 | cpp |
p03197 | #include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1LL... | #include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1LL... | [
"expression.operation.binary.remove",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 991,322 | 991,323 | u187878098 | cpp |
p03197 | #include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1LL... | #include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1LL... | [
"expression.operation.binary.remove",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 991,324 | 991,323 | u187878098 | cpp |
p03197 | #define LOCAL
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, s, n) for (int i = s; i < (n); ++i)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
static const int INTINF = (INT_MAX >> 1); // 10^9 + 10^7
static const ll LLINF = (LLONG_MAX >> 1);
s... | #define LOCAL
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, s, n) for (int i = s; i < (n); ++i)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
static const int INTINF = (INT_MAX >> 1); // 10^9 + 10^7
static const ll LLINF = (LLONG_MAX >> 1);
s... | [
"expression.operation.binary.remove"
] | 991,326 | 991,327 | u895382169 | cpp |
p03197 | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using pll = pair<ll,... | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using pll = pair<ll,... | [
"expression.operation.binary.add"
] | 991,330 | 991,331 | u117348081 | cpp |
p03197 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int N, a;
cin >> N;
string ans = "Second\n";
rep(i, N) {
cin >> a;
if (a % 2)
ans = "First\n";
}
cout << ans;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int N, a;
cin >> N;
string ans = "second\n";
rep(i, N) {
cin >> a;
if (a % 2)
ans = "first\n";
}
cout << ans;
} | [
"literal.string.change",
"literal.string.case.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 991,332 | 991,333 | u555962250 | cpp |
p03197 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int N, a;
cin >> N;
string ans = "second\n";
rep(i, N) {
cin >> a;
if (a % 2)
ans = "First\n";
}
cout << ans;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int N, a;
cin >> N;
string ans = "second\n";
rep(i, N) {
cin >> a;
if (a % 2)
ans = "first\n";
}
cout << ans;
} | [
"literal.string.change",
"literal.string.case.change",
"assignment.value.change"
] | 991,334 | 991,333 | u555962250 | cpp |
p03197 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 991,339 | 991,340 | u136342563 | cpp |
p03197 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
ty... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
ty... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 991,345 | 991,346 | u987913144 | cpp |
p03197 | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
int cnt = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
if (a[i] % 2 == 0) {
cnt++;
}
}
if (cnt % 2 == N) {
cout << "second" << endl;
} else... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
int cnt = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
if (a[i] % 2 == 0) {
cnt++;
}
}
if (cnt == N) {
cout << "second" << endl;
} else {
... | [
"expression.operation.binary.remove"
] | 991,349 | 991,350 | u119098168 | cpp |
p03197 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
typedef l... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
typedef l... | [
"literal.string.change",
"call.arguments.change"
] | 991,351 | 991,352 | u903311413 | cpp |
p03197 | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#in... | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#in... | [
"call.arguments.change"
] | 991,353 | 991,354 | u259053514 | cpp |
p03197 | #include <algorithm>
#include <bits/stdc++.h>
#include <vector>
using namespace std;
int main() {
int a;
cin >> a;
vector<int> apple(a);
for (int i = 0; i < a; i++) {
int ap;
cin >> ap;
apple.at(i) = ap % 2;
}
if (count(apple.begin(), apple.end(), 0) == a)
cout << "Second" << endl;
else
... | #include <algorithm>
#include <bits/stdc++.h>
#include <vector>
using namespace std;
int main() {
int a;
cin >> a;
vector<int> apple(a);
for (int i = 0; i < a; i++) {
int ap;
cin >> ap;
apple.at(i) = ap % 2;
}
if (count(apple.begin(), apple.end(), 0) == a)
cout << "second" << endl;
else
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 991,357 | 991,358 | u623687794 | cpp |
p03197 | #include <bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
using namespace std;
int static fast = []() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
return 0;
}();
// freopen("input.txt", "r", stdin);
int main() {
int n, val;
vector<int> parity = {0, 0};... | #include <bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
using namespace std;
int static fast = []() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
return 0;
}();
// freopen("input.txt", "r", stdin);
int main() {
int n, val;
vector<int> parity = {0, 0};... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 991,360 | 991,361 | u067694854 | cpp |
p03197 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int N;
cin >> N;
// bool f = false; // 奇数のものがあり，先手必勝か
int a;
rep(i, N) {
cin >> a;
if (a % 2 == 1) {
cout << "first" << endl... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int N;
cin >> N;
// bool f = false; // 奇数のものがあり，先手必勝か
int a;
rep(i, N) {
cin >> a;
if (a % 2 == 1) {
cout << "first" << endl... | [] | 991,366 | 991,367 | u042802884 | cpp |
p03197 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
// sort(a.begin(),a.end());
int ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] % 2 != 1)
ans++;
}
if (ans > 0)
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
// sort(a.begin(),a.end());
int ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] % 2 == 1)
ans++;
}
if (ans > 0)
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 991,374 | 991,375 | u313043608 | cpp |
p03197 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <iostream>
#include <limits>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define INF 11000000000
#define MAX 5100
#define MOD 1000000007
typedef long long... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <iostream>
#include <limits>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define INF 11000000000
#define MAX 5100
#define MOD 1000000007
typedef long long... | [] | 991,378 | 991,379 | u591914971 | cpp |
p03197 | #include <cstdio>
int N;
int a;
int main() {
scanf("%d", &N);
int cnt = 0;
bool ans = true;
for (int i; i < N; i++) {
scanf("%d", &a);
if (a % 2 == 1) {
ans = false;
break;
}
}
if (ans)
printf("first");
else
printf("second");
}
| #include <cstdio>
int N;
int a;
int main() {
scanf("%d", &N);
int cnt = 0;
bool ans = false;
for (int i; i < N; i++) {
scanf("%d", &a);
if (a % 2 == 1) {
ans = true;
break;
}
}
if (ans)
printf("first");
else
printf("second");
}
| [
"misc.opposites",
"variable_declaration.value.change",
"assignment.value.change"
] | 991,382 | 991,383 | u118642796 | cpp |
p03197 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <stdlib.h>
#include <string>
#include <vector>
#define ll long long
#define repp(i, a, b) for (int i = (int)a; i < (int)b; ++i)
using namespace std;
int main() {
int N;
cin >> N;
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <stdlib.h>
#include <string>
#include <vector>
#define ll long long
#define repp(i, a, b) for (int i = (int)a; i < (int)b; ++i)
using namespace std;
int main() {
int N;
cin >> N;
... | [
"expression.operation.unary.logical.remove",
"assignment.change"
] | 991,384 | 991,385 | u600896094 | cpp |
p03197 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 991,392 | 991,393 | u043443359 | cpp |
p03197 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 991,394 | 991,393 | u043443359 | cpp |
p03197 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 991,395 | 991,393 | u043443359 | cpp |
p03197 | // https://atcoder.jp/contests/caddi2018/tasks/caddi2018_b
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, t;
cin >> n;
bool ans = false;
REP(i, n) {
cin >> t;
if (ans % 2 != 0) {
ans = ... | // https://atcoder.jp/contests/caddi2018/tasks/caddi2018_b
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, t;
cin >> n;
// 全てが偶数だったら負ける
bool ans = false;
REP(i, n) {
cin >> t;
if (t % 2 != 0... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 991,404 | 991,405 | u858107870 | cpp |
p03197 | #include <algorithm>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
int c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
struct UnionFind {
vector<int> par; // par[i]:iの親の番号 (例) ... | #include <algorithm>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
int c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
struct UnionFind {
vector<int> par; // par[i]:iの親の番号 (例) ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 991,410 | 991,411 | u933068010 | cpp |
p03197 | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++)
cin >> a[i];
bool f = true;
for (int i = 0; i < N; i++)
if (a[i] & 1)
f = false;
if (!f)
cout << "first" << endl;
else
cout << "seconde" ... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++)
cin >> a[i];
bool f = true;
for (int i = 0; i < N; i++)
if (a[i] & 1)
f = false;
if (!f)
cout << "first" << endl;
else
cout << "second" <... | [
"literal.string.change",
"io.output.change"
] | 991,417 | 991,418 | u510175787 | cpp |
p03197 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define int long long
using namespace std;
typedef pair<int, int> P;
const int mod = 1000000007;
const int INF = 1e18;
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
int cnt = 0;
r... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define int long long
using namespace std;
typedef pair<int, int> P;
const int mod = 1000000007;
const int INF = 1e18;
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
int cnt = 0;
r... | [] | 991,421 | 991,422 | u984730891 | cpp |
p03197 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll << 50;
template <typename T> void printv(const vector<T> &s) {
for (int i = 0; i < (int)(s.size()); ++i) {
cout << s[i];
if (i == (int)(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll << 50;
template <typename T> void printv(const vector<T> &s) {
for (int i = 0; i < (int)(s.size()); ++i) {
cout << s[i];
if (i == (int)(... | [
"expression.operator.change"
] | 991,423 | 991,424 | u334351654 | cpp |
p03197 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <vector>
#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()
typedef long long... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <vector>
#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()
typedef long long... | [
"control_flow.branch.if.condition.change"
] | 991,425 | 991,426 | u484460274 | cpp |
p03197 | // g++ -std=c++11 a.cpp
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#incl... | // g++ -std=c++11 a.cpp
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#incl... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 991,429 | 991,430 | u010004797 | cpp |
p03197 | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define pa pair<int, int>
int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9')
x = (x << 3) + (x << 1) + (ch ^ 48), ch = ge... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define pa pair<int, int>
int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9')
x = (x << 3) + (x << 1) + (ch ^ 48), ch = ge... | [
"expression.operator.change"
] | 991,433 | 991,434 | u760076816 | cpp |
p03197 | #include <iostream>
using namespace std;
int main() {
int n;
bool f = false;
cin >> n;
for (int i = 0; i < n; i++) {
int t;
cin >> t;
if (t % 2 == 1)
f = true;
}
if (f)
cout << "second" << endl;
else
cout << "first" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
bool f = false;
cin >> n;
for (int i = 0; i < n; i++) {
int t;
cin >> t;
if (t % 2 == 1)
f = true;
}
if (f)
cout << "first" << endl;
else
cout << "second" << endl;
return 0;
} | [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 991,439 | 991,440 | u107077805 | cpp |
p03197 | #include <iostream>
using namespace std;
int main() {
int N;
long long temp;
cin >> N;
for (int i = 0; i < N; ++i) {
cin >> temp;
if ((temp & 1) == 0) {
cout << "first" << endl;
return 0;
}
}
cout << "second" << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N;
long long temp;
cin >> N;
for (int i = 0; i < N; ++i) {
cin >> temp;
if ((temp & 1) == 1) {
cout << "first" << endl;
return 0;
}
}
cout << "second" << endl;
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 991,441 | 991,442 | u225528554 | cpp |
p03197 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MM = 1000000000;
#define mod = MM + 7;
#define INF (ll)1e18
#define pi acos(-1.0)
#define MAX 10000000005
#define NIL -1
int main() {
ll n;
cin >> n;
ll a[n];
bool flag = true;
for (ll i = 0; i < n; i++) {
cin >> a[i];
if (a[i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MM = 1000000000;
#define mod = MM + 7;
#define INF (ll)1e18
#define pi acos(-1.0)
#define MAX 10000000005
#define NIL -1
int main() {
ll n;
cin >> n;
ll a[n];
bool flag = false;
for (ll i = 0; i < n; i++) {
cin >> a[i];
if (a[... | [
"misc.opposites",
"variable_declaration.value.change",
"assignment.value.change"
] | 991,443 | 991,444 | u342051078 | cpp |
p03197 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MM = 1000000000;
#define mod = MM + 7;
#define INF (ll)1e18
#define pi acos(-1.0)
#define MAX 10000000005
#define NIL -1
int main() {
ll n;
cin >> n;
ll a[n];
bool flag = true;
for (ll i = 0; i < n; i++) {
cin >> a[i];
if (a[i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MM = 1000000000;
#define mod = MM + 7;
#define INF (ll)1e18
#define pi acos(-1.0)
#define MAX 10000000005
#define NIL -1
int main() {
ll n;
cin >> n;
ll a[n];
bool flag = false;
for (ll i = 0; i < n; i++) {
cin >> a[i];
if (a[... | [
"misc.opposites",
"variable_declaration.value.change",
"assignment.value.change"
] | 991,445 | 991,444 | u342051078 | cpp |
p03197 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MM = 1000000000;
#define mod = MM + 7;
#define INF (ll)1e18
#define pi acos(-1.0)
#define MAX 10000000005
#define NIL -1
int main() {
ll n;
cin >> n;
ll a[n];
bool flag = true;
for (ll i = 0; i < n; i++) {
cin >> a[i];
if (a[i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MM = 1000000000;
#define mod = MM + 7;
#define INF (ll)1e18
#define pi acos(-1.0)
#define MAX 10000000005
#define NIL -1
int main() {
ll n;
cin >> n;
ll a[n];
bool flag = false;
for (ll i = 0; i < n; i++) {
cin >> a[i];
if (a[... | [
"misc.opposites",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 991,446 | 991,444 | u342051078 | cpp |
p03197 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>... | [] | 991,455 | 991,456 | u271349541 | cpp |
p03197 | #include <bits/stdc++.h>
using namespace std;
int N;
int main() {
scanf("%d", &N);
int Xor = 0;
for (int i = 0; i < N; i++) {
int t;
scanf("%d", &t);
Xor ^= (t & 1);
}
if (Xor)
printf("first");
else
printf("second");
}
| #include <bits/stdc++.h>
using namespace std;
int N;
int main() {
scanf("%d", &N);
int ans = 0;
for (int i = 0; i < N; i++) {
int t;
scanf("%d", &t);
ans |= (t & 1);
}
if (ans)
printf("first");
else
printf("second");
}
| [
"variable_declaration.name.change",
"identifier.change",
"assignment.change",
"control_flow.branch.if.condition.change"
] | 991,457 | 991,458 | u333877810 | cpp |
p03197 | #include <bits/stdc++.h>
#include <stdio.h>
#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(), x.end()
#define F first
#define S second
#define For(i, x, y) for (int i = x; i <= y;... | #include <bits/stdc++.h>
#include <stdio.h>
#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(), x.end()
#define F first
#define S second
#define For(i, x, y) for (int i = x; i <= y;... | [
"assignment.value.change"
] | 991,459 | 991,460 | u202370403 | cpp |
p03197 | #include <bits/stdc++.h>
using namespace std;
int n, a[110001];
int main() {
cin >> n;
int k = 0;
for (int i = 1; i <= n; i++)
cin >> a[i], k ^= a[i] & 1;
cout << (k ? "first\n" : "second\n");
}
| #include <bits/stdc++.h>
using namespace std;
int n, a[110001];
int main() {
cin >> n;
int k = 0;
for (int i = 1; i <= n; i++)
cin >> a[i], k += a[i] & 1;
cout << (k ? "first\n" : "second\n");
}
| [
"expression.operator.change"
] | 991,461 | 991,462 | u844771757 | cpp |
p03197 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a % 2) {
cout << "First" << endl;
return 0;
}
}
cout << "Second" << endl;
}
| #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a % 2) {
cout << "first" << endl;
return 0;
}
}
cout << "second" << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 991,465 | 991,466 | u374416262 | cpp |
p03197 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
int a[100000];
for (int i = 0; i < N; i = i + 1) {
cin >> a[i];
}
int judge = 0;
for (int i = 0; i < N; i = i + 1) {
if (a[i] % 2 == 0) {
judge = judge + 1;
}
... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
int a[100000];
for (int i = 0; i < N; i = i + 1) {
cin >> a[i];
}
int judge = 0;
for (int i = 0; i < N; i = i + 1) {
if (a[i] % 2 == 0) {
judge = judge + 1;
}
... | [
"io.output.change",
"literal.string.change"
] | 991,467 | 991,468 | u088111798 | cpp |
p03197 | #include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
#define ld long double
// 217
// 44
using namespace std;
int main() {
// ifstream cin("A.in");
// ofstream cout("A.out");
int n, i;
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
cin >> n;
int a... | #include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
#define ld long double
// 217
// 44
using namespace std;
int main() {
// ifstream cin("A.in");
// ofstream cout("A.out");
int n, i;
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
cin >> n;
int a... | [
"expression.operator.change"
] | 991,471 | 991,472 | u094322844 | cpp |
p03197 | #include <bits/stdc++.h>
#include <iterator>
#include <set>
using namespace std;
const int mod = 998244353;
#define ft first
#define sd second
#define pb push_back
#define all(x) x.begin(), x.end()
#define ll long long int
#define vi vector<int>
#define vii vector<pair<int, int>>
#define pii pair<int, int>
#define p... | #include <bits/stdc++.h>
#include <iterator>
#include <set>
using namespace std;
const int mod = 998244353;
#define ft first
#define sd second
#define pb push_back
#define all(x) x.begin(), x.end()
#define ll long long int
#define vi vector<int>
#define vii vector<pair<int, int>>
#define pii pair<int, int>
#define p... | [] | 991,473 | 991,474 | u888735570 | cpp |
p03197 | #include <bits/stdc++.h>
#include <iterator>
#include <set>
using namespace std;
const int mod = 998244353;
#define ft first
#define sd second
#define pb push_back
#define all(x) x.begin(), x.end()
#define ll long long int
#define vi vector<int>
#define vii vector<pair<int, int>>
#define pii pair<int, int>
#define p... | #include <bits/stdc++.h>
#include <iterator>
#include <set>
using namespace std;
const int mod = 998244353;
#define ft first
#define sd second
#define pb push_back
#define all(x) x.begin(), x.end()
#define ll long long int
#define vi vector<int>
#define vii vector<pair<int, int>>
#define pii pair<int, int>
#define p... | [
"literal.string.change",
"io.output.change"
] | 991,475 | 991,474 | u888735570 | cpp |
p03197 | #include "bits/stdc++.h"
using namespace std;
#define int long long
int mod = 1e9 + 7;
signed main() {
int n;
cin >> n;
bool f = true;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a % 2 == 1)
f = false;
}
if (f)
cout << "first" << endl;
else
cout << "second" << endl;
}
| #include "bits/stdc++.h"
using namespace std;
#define int long long
int mod = 1e9 + 7;
signed main() {
int n;
cin >> n;
bool f = true;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a % 2 == 1)
f = false;
}
if (!f)
cout << "first" << endl;
else
cout << "second" << endl;
}
| [
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 991,476 | 991,477 | u890465662 | cpp |
p03197 | // todo idef DEBUGで、境界チェック付きのvectorを作りたい
// http://marycore.jp/prog/cpp/class-extension-methods/
//現状ifdef DEBUG が何故か動かないので出来ない
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
struct initon {
initon() {
cin.tie(0);
ios::sync_with_stdio(false);
cout.setf(ios::fixe... | // todo idef DEBUGで、境界チェック付きのvectorを作りたい
// http://marycore.jp/prog/cpp/class-extension-methods/
//現状ifdef DEBUG が何故か動かないので出来ない
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
struct initon {
initon() {
cin.tie(0);
ios::sync_with_stdio(false);
cout.setf(ios::fixe... | [
"variable_declaration.add",
"expression.operation.binary.remove"
] | 991,480 | 991,481 | u986437843 | cpp |
p03197 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
bool f = false;
for (int i = 0; i < n; i++) {
int64_t a;
cin >> a;
f |= a % 2 == 0;
}
cout << (f ? "first" : "second") << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
bool f = false;
for (int i = 0; i < n; i++) {
int64_t a;
cin >> a;
f |= a % 2 == 1;
}
cout << (f ? "first" : "second") << endl;
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 991,484 | 991,485 | u017167684 | cpp |
p03197 | #include <bits/stdc++.h>
// g++ -std=c++11 -Wall -g -fsanitize=undefined -D_GLIBCXX_DEBUG caddi/d.cpp
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define SZ(x) ((int)(x).size())
#define scint(x) scanf("%d", &x)
#define scll(x) scanf("%lld", &x)
typedef long long ll;
int main() {
cin.ti... | #include <bits/stdc++.h>
// g++ -std=c++11 -Wall -g -fsanitize=undefined -D_GLIBCXX_DEBUG caddi/d.cpp
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define SZ(x) ((int)(x).size())
#define scint(x) scanf("%d", &x)
#define scll(x) scanf("%lld", &x)
typedef long long ll;
int main() {
cin.ti... | [
"variable_declaration.remove"
] | 991,486 | 991,487 | u811561461 | cpp |
p03197 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
#define INF 1e18
#define ret return
... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
#define INF 1e18
#define ret return
... | [
"expression.operator.change"
] | 991,488 | 991,489 | u288466617 | cpp |
p03197 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
#define INF 1e18
#define ret return
... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
#define INF 1e18
#define ret return
... | [
"variable_declaration.type.change",
"expression.operator.change"
] | 991,490 | 991,489 | u288466617 | cpp |
p03197 | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<int, int> P;
const LL mod = 1000000007;
const LL LINF = 1LL << 62;
... | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<int, int> P;
const LL mod = 1000000007;
const LL LINF = 1LL << 62;
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 991,493 | 991,494 | u640323045 | cpp |
p03197 | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<int, int> P;
const LL mod = 1000000007;
const LL LINF = 1LL << 62;
... | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<int, int> P;
const LL mod = 1000000007;
const LL LINF = 1LL << 62;
... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 991,495 | 991,494 | u640323045 | cpp |
p03197 | #include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
using ll = long long;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define pb push_back
#define fill(x, y) memset(x, y, sizeof(x))
#define even(x... | #include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
using ll = long long;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define pb push_back
#define fill(x, y) memset(x, y, sizeof(x))
#define even(x... | [
"control_flow.branch.if.condition.change"
] | 991,502 | 991,503 | u300752229 | cpp |
p03197 | /*************************************************
*************************************************
*************************************************
*** _________________ | | | /***
*** | | | | / ***
*** | | | | / ***
*** |... | /*************************************************
*************************************************
*************************************************
*** _________________ | | | /***
*** | | | | / ***
*** | | | | / ***
*** |... | [
"expression.operation.binary.remove"
] | 991,508 | 991,509 | u424955889 | cpp |
p03197 | #include <bits/stdc++.h>
using namespace std;
int n, b;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
scanf("%d", &b);
if (b & 1) {
cout << "second" << endl;
return 0;
}
}
cout << "first" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int n, b;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
scanf("%d", &b);
if (b & 1) {
cout << "first" << endl;
return 0;
}
}
cout << "second" << endl;
} | [
"literal.string.change",
"io.output.change"
] | 991,512 | 991,513 | u032327689 | cpp |
p03197 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <vector... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <vector... | [
"expression.operator.change"
] | 991,514 | 991,515 | u957188497 | cpp |
p03197 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <vector... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <vector... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operator.change"
] | 991,516 | 991,515 | u957188497 | cpp |
p03197 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, a, b) for (int i = a; i < b; i++)
#define... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, a, b) for (int i = a; i < b; i++)
#define... | [
"expression.operation.binary.remove"
] | 991,521 | 991,522 | u128527648 | cpp |
p03197 | #include "bits/stdc++.h"
using namespace std;
#define Rep(b, e, i) for (int i = b; i <= e; i++)
#define Repr(e, b, i) for (int i = e; i >= b; i--)
#define rep(n, i) Rep(0, n - 1, i)
#define repr(n, i) Repr(n - 1, 0, i)
#define all(v) (v).begin(), (v).end()
#define pb(v) push_back(v)
#define uniq(v) (v).erase(unique(a... | #include "bits/stdc++.h"
using namespace std;
#define Rep(b, e, i) for (int i = b; i <= e; i++)
#define Repr(e, b, i) for (int i = e; i >= b; i--)
#define rep(n, i) Rep(0, n - 1, i)
#define repr(n, i) Repr(n - 1, 0, i)
#define all(v) (v).begin(), (v).end()
#define pb(v) push_back(v)
#define uniq(v) (v).erase(unique(a... | [
"assignment.value.change"
] | 991,523 | 991,524 | u344412812 | cpp |
p03197 | #include <bits/stdc++.h>
#ifdef _WIN32
#include "debug.hpp"
#endif
using namespace std;
#define rep(i, N) repf(i, 0, N)
#define reps(i, N) repfs(i, 1, N)
#define repf(i, a, b) for (int i = a; i < b; i++)
#define repfs(i, a, b) for (int i = a; i <= b; i++)
#define repr(i, N) for (int i = N - 1; i >= 0; i--)
#define rep... | #include <bits/stdc++.h>
#ifdef _WIN32
#include "debug.hpp"
#endif
using namespace std;
#define rep(i, N) repf(i, 0, N)
#define reps(i, N) repfs(i, 1, N)
#define repf(i, a, b) for (int i = a; i < b; i++)
#define repfs(i, a, b) for (int i = a; i <= b; i++)
#define repr(i, N) for (int i = N - 1; i >= 0; i--)
#define rep... | [
"assignment.value.change",
"expression.operation.unary.remove"
] | 991,529 | 991,530 | u073946233 | cpp |
p03197 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define repeat(i, n) for... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define repeat(i, n) for... | [
"variable_declaration.type.change",
"expression.operator.change"
] | 991,534 | 991,535 | u120143737 | cpp |
p03197 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <map>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
typedef long long LL;
inline char gc() {
// static char buf[100000],*p1,*p2;
// return p1==p2&&(p2=(p1=buf)+frea... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <map>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
typedef long long LL;
inline char gc() {
// static char buf[100000],*p1,*p2;
// return p1==p2&&(p2=(p1=buf)+frea... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 991,538 | 991,539 | u122992041 | cpp |
p03197 | #include <bits/stdc++.h>
using namespace std;
int n, x;
int main() {
while (scanf("%d", &n) != EOF) {
x = 0;
for (int i = 1, y; i <= n; ++i) {
scanf("%d", &y);
x += y & 1;
}
puts(x & 1 ? "first" : "second");
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int n, x;
int main() {
while (scanf("%d", &n) != EOF) {
x = 0;
for (int i = 1, y; i <= n; ++i) {
scanf("%d", &y);
x += y & 1;
}
puts(x ? "first" : "second");
}
return 0;
}
| [
"expression.operation.binary.remove"
] | 991,547 | 991,548 | u717168969 | cpp |
p03197 | // Pantyhose(black) + glasses = infinity
#include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << #x << " = " << x << '\n';
#define BP() cerr << "OK!\n";
#define PR(A, n) \
{ ... | // Pantyhose(black) + glasses = infinity
#include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << #x << " = " << x << '\n';
#define BP() cerr << "OK!\n";
#define PR(A, n) \
{ ... | [] | 991,549 | 991,550 | u682090147 | cpp |
p03196 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll i, j, k, n, m, p, ans = 1;
ll Pow(ll n, ll m) {
ll ans = 1;
while (m > 1) {
if (m % 2 == 0) {
m /= 2;
n = n * n;
} else {
ans = ans * n;
m /= 2;
n = n * n;
}
}
return n * ans;
}
int main() {
cin >> ... | #include <bits/stdc++.h>
#define ll unsigned long long
using namespace std;
ll i, j, k, n, m, p, ans = 1;
ll Pow(ll n, ll m) {
ll ans = 1;
while (m > 1) {
if (m % 2 == 0) {
m /= 2;
n = n * n;
} else {
ans = ans * n;
m /= 2;
n = n * n;
}
}
return n * ans;
}
int main() {
... | [
"control_flow.loop.for.initializer.change",
"assignment.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 991,559 | 991,558 | u032327689 | cpp |
p03196 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, a, b) for (int i = a; i < b; i++)
#define... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, a, b) for (int i = a; i < b; i++)
#define... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove"
] | 991,572 | 991,573 | u128527648 | cpp |
p03196 | #pragma GCC optimize "-O3"
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int lmax = 1999999999;
const long long lmx = 1999999999999999999;
ll Nn, N, P;
ll ans = 1LL;
ll lp[10000004];
int main() {
std::ios::sync_with_stdio(false);
cin >> Nn >> P;
if (Nn == 1LL) {
cout << P << en... | #pragma GCC optimize "-O3"
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int lmax = 1999999999;
const long long lmx = 1999999999999999999;
ll Nn, N, P;
ll ans = 1LL;
ll lp[10000004];
int main() {
std::ios::sync_with_stdio(false);
cin >> Nn >> P;
if (Nn == 1LL) {
cout << P << en... | [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove",
"assignment.add"
] | 991,586 | 991,587 | u786839198 | cpp |
p03196 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#includ... | [
"expression.operator.change"
] | 991,588 | 991,589 | u373364108 | cpp |
p03196 | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ALL(a) (a).begin(), (a).end()
#define Yes(hoge) cout << ((hoge) ? "Yes" : "No") << endl;
#define YES(hoge) cout << ((hoge) ? "YES" :... | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ALL(a) (a).begin(), (a).end()
#define Yes(hoge) cout << ((hoge) ? "Yes" : "No") << endl;
#define YES(hoge) cout << ((hoge) ? "YES" :... | [
"call.add",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 991,592 | 991,593 | u905715926 | cpp |
p03196 | #include <bits/stdc++.h>
#define rep2(x, fr, to) for (int(x) = (fr); (x) < (to); (x)++)
#define rep(x, to) for (int(x) = 0; (x) < (to); (x)++)
#define repr(x, fr, to) for (int(x) = (fr); (x) >= (to); (x)--)
#define all(c) (c).begin(), (c).end()
#define sz(v) (int)(v).size()
using namespace std;
typedef long long ll;
... | #include <bits/stdc++.h>
#define rep2(x, fr, to) for (int(x) = (fr); (x) < (to); (x)++)
#define rep(x, to) for (int(x) = 0; (x) < (to); (x)++)
#define repr(x, fr, to) for (int(x) = (fr); (x) >= (to); (x)--)
#define all(c) (c).begin(), (c).end()
#define sz(v) (int)(v).size()
using namespace std;
typedef long long ll;
... | [
"identifier.change",
"io.output.change"
] | 991,594 | 991,595 | u714564133 | cpp |
p03196 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#pragma region
using namespace std;
#define FOR(i, r, n) fo... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#pragma region
using namespace std;
#define FOR(i, r, n) fo... | [
"control_flow.branch.if.condition.change"
] | 991,596 | 991,597 | u215122692 | cpp |
p03196 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <vector>
u... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <vector>
u... | [
"call.add",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 991,604 | 991,605 | u711985352 | cpp |
p03196 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a) for (int i = 0; i < (a); i++)
const ll MOD = 1000000007;
int main() {
ll N, P;
cin >> N >> P;
if (N == 1LL) {
cout << P << endl;
return 0;
}
if (P == 1LL || P <= N) {
cout << 1 << endl;
return 0;
}
map<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a) for (int i = 0; i < (a); i++)
const ll MOD = 1000000007;
int main() {
ll N, P;
cin >> N >> P;
if (N == 1LL) {
cout << P << endl;
return 0;
}
if (P == 1LL || P <= N) {
cout << 1 << endl;
return 0;
}
map<... | [
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 991,606 | 991,607 | u046768272 | cpp |
p03196 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define R... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define R... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 991,612 | 991,613 | u260638714 | cpp |
p03196 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int n, p;
bool is_prime[1000001];
vector<int> prime;
vector<int> f;
int cnt = 0;
int res = 1;
void sieve() {
for (int i = 2; i <= 1000000; i++)
is_prime[i] = true;
is_prime[0] = is_prime[1] = false;
for (int i = 2; i * i <= 1000000; i++)
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int n, p;
bool is_prime[1000001];
vector<int> prime;
vector<int> f;
int cnt = 0;
int res = 1;
void sieve() {
for (int i = 2; i <= 1000000; i++)
is_prime[i] = true;
is_prime[0] = is_prime[1] = false;
for (int i = 2; i * i <= 1000000; i++)
... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 991,616 | 991,617 | u402883146 | cpp |
p03196 | #include <algorithm>
#include <stdio.h>
using namespace std;
using ll = long long;
int main() {
ll n, p, r = 1;
scanf("%lld %lld", &n, &p);
for (ll x = 2; x * x < p; x++) {
int count = 0;
for (; p % x == 0; count++)
p /= x;
for (int i = 0; i + n <= count; i += n)
r *= x;
}
if (n == 1)... | #include <algorithm>
#include <stdio.h>
using namespace std;
using ll = long long;
int main() {
ll n, p, r = 1;
scanf("%lld %lld", &n, &p);
for (ll x = 2; x * x <= p; x++) {
int count = 0;
for (; p % x == 0; count++)
p /= x;
for (int i = 0; i + n <= count; i += n)
r *= x;
}
if (n == 1... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 991,620 | 991,621 | u196520288 | cpp |
p03196 | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for (int64 i = 0; i < (n); i++)
#define FOR(i, a, b) for (int64 i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_... | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for (int64 i = 0; i < (n); i++)
#define FOR(i, a, b) for (int64 i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_... | [
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.add"
] | 991,622 | 991,623 | u360980679 | cpp |
p03196 | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for (int64 i = 0; i < (n); i++)
#define FOR(i, a, b) for (int64 i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_... | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for (int64 i = 0; i < (n); i++)
#define FOR(i, a, b) for (int64 i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.add"
] | 991,624 | 991,623 | u360980679 | cpp |
p03196 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long long N, P;
int count = 0;
int ans = 1;
cin >> P >> N;
if (P == 1) {
cout << N;
return 0;
}
for (long long i = 2; i < sqrt(N); i++) {
while (N % i == 0) {
N /= i;
count++;
}
ans *= (int)(pow(i, (int)... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long long N, P;
int count = 0;
int ans = 1;
cin >> P >> N;
if (P == 1) {
cout << N;
return 0;
}
for (long long i = 2; i < sqrt(N) + 3; i++) {
while (N % i == 0) {
N /= i;
count++;
}
ans *= (int)(pow(i, (... | [
"control_flow.loop.for.condition.change"
] | 991,629 | 991,630 | u637067145 | cpp |
p03196 | #include <bits/stdc++.h>
#ifdef _WIN32
#include "debug.hpp"
#endif
using namespace std;
#define rep(i, N) repf(i, 0, N)
#define reps(i, N) repfs(i, 1, N)
#define repf(i, a, b) for (int i = a; i < b; i++)
#define repfs(i, a, b) for (int i = a; i <= b; i++)
#define repr(i, N) for (int i = N - 1; i >= 0; i--)
#define rep... | #include <bits/stdc++.h>
#ifdef _WIN32
#include "debug.hpp"
#endif
using namespace std;
#define rep(i, N) repf(i, 0, N)
#define reps(i, N) repfs(i, 1, N)
#define repf(i, a, b) for (int i = a; i < b; i++)
#define repfs(i, a, b) for (int i = a; i <= b; i++)
#define repr(i, N) for (int i = N - 1; i >= 0; i--)
#define rep... | [
"control_flow.branch.if.condition.change"
] | 991,643 | 991,644 | u073946233 | cpp |
p03196 | #include <bits/stdc++.h>
#ifdef _WIN32
#include "debug.hpp"
#endif
using namespace std;
#define rep(i, N) repf(i, 0, N)
#define reps(i, N) repfs(i, 1, N)
#define repf(i, a, b) for (int i = a; i < b; i++)
#define repfs(i, a, b) for (int i = a; i <= b; i++)
#define repr(i, N) for (int i = N - 1; i >= 0; i--)
#define rep... | #include <bits/stdc++.h>
#ifdef _WIN32
#include "debug.hpp"
#endif
using namespace std;
#define rep(i, N) repf(i, 0, N)
#define reps(i, N) repfs(i, 1, N)
#define repf(i, a, b) for (int i = a; i < b; i++)
#define repfs(i, a, b) for (int i = a; i <= b; i++)
#define repr(i, N) for (int i = N - 1; i >= 0; i--)
#define rep... | [
"control_flow.branch.if.condition.change"
] | 991,645 | 991,644 | u073946233 | cpp |
p03196 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, a) FOR(i, 0, a)
typedef long long ll;
ll N, P;
ll pw(ll n, int m) {
ll ret = 1;
while (m) {
if (m & 1) {
ret *= n;
n *= n;
}
m >>= 1;
}
return ret;
}
int main() {
cin >> N... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, a) FOR(i, 0, a)
typedef long long ll;
ll N, P;
ll pw(ll n, int m) {
ll ret = 1;
while (m) {
if (m & 1) {
ret *= n;
}
n *= n;
m >>= 1;
}
return ret;
}
int main() {
cin >> N >... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change"
] | 991,656 | 991,655 | u533920479 | cpp |
p03196 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX = 1e6 + 5;
bool isPrime[MAX];
int main() {
ll n, p;
cin >> n >> p;
if (n == 1) {
cout << n;
return 0;
}
vector<int> primes;
for (int i = 0; i < MAX; i++) {
isPrime[i] = true;
}
isPrime[0] = false;
isPrime... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX = 1e6 + 5;
bool isPrime[MAX];
int main() {
ll n, p;
cin >> n >> p;
if (n == 1) {
cout << p;
return 0;
}
vector<int> primes;
for (int i = 0; i < MAX; i++) {
isPrime[i] = true;
}
isPrime[0] = false;
isPrime... | [
"identifier.change",
"io.output.change"
] | 991,659 | 991,660 | u385577213 | cpp |
p03196 | /* ---------- STL Libraries ---------- */
// IO library
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm library
#include <algorithm>
#include <cmath>
#include <numeric>
#include <random>
// container library
#include <array>
#include <bitset>
#include <deque>
#i... | /* ---------- STL Libraries ---------- */
// IO library
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm library
#include <algorithm>
#include <cmath>
#include <numeric>
#include <random>
// container library
#include <array>
#include <bitset>
#include <deque>
#i... | [
"call.add",
"assignment.value.change",
"expression.operation.binary.change"
] | 991,661 | 991,662 | u853132965 | cpp |
p03196 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | [
"expression.operation.binary.remove"
] | 991,665 | 991,666 | u938924220 | cpp |
p03196 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (long long)(n); ++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;
// 素因数分解
map<ll, ll> prime_factor(ll n) {
map<ll, ll> res;
for (ll i = 2; i * i <= n; ++i) {
while (n % i == 0) {
++res[i];
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (long long)(n); ++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;
// 素因数分解
map<ll, ll> prime_factor(ll n) {
map<ll, ll> res;
for (ll i = 2; i * i <= n; ++i) {
while (n % i == 0) {
++res[i];
... | [
"call.add",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 991,669 | 991,670 | u482544950 | cpp |
p03196 | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬╬╬██╬╬╬╬╬╬███
// ... | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬╬╬██╬╬╬╬╬╬███
// ... | [
"call.add",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 991,675 | 991,676 | u239493918 | cpp |
p03196 | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define RREP(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < ll(n); ++i)
#define RFOR(i, m, n) for (ll i = ll(n) - 1; i >= ll(m); --i)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) v.erase(unique(ALL(v... | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define RREP(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < ll(n); ++i)
#define RFOR(i, m, n) for (ll i = ll(n) - 1; i >= ll(m); --i)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) v.erase(unique(ALL(v... | [
"assignment.variable.change",
"identifier.change",
"call.arguments.change"
] | 991,687 | 991,688 | u918357423 | cpp |
p03196 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef ve... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef ve... | [
"identifier.change"
] | 991,689 | 991,690 | u007610006 | cpp |
p03196 | #define _CRT_SECURE_NO_WARNINGS
#define _SCL_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <m... | #define _CRT_SECURE_NO_WARNINGS
#define _SCL_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <m... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"variable_declaration.type.change"
] | 991,691 | 991,692 | u993619636 | cpp |
p03196 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <st... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <st... | [
"call.arguments.add",
"call.arguments.change"
] | 991,695 | 991,696 | u693386219 | cpp |
p03196 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#inclu... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#inclu... | [
"call.add",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 991,702 | 991,703 | u579875569 | cpp |
p03196 | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <s... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <s... | [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove",
"assignment.add"
] | 991,706 | 991,707 | u202239169 | cpp |
p03194 | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>... | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>... | [
"call.add",
"assignment.value.change",
"expression.operation.binary.change"
] | 991,713 | 991,714 | u917972976 | cpp |
p03194 | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define MOD (1000000007)
#define vi vector<int>
#define vl vector<ll>
#define vb vector<b... | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define MOD (1000000007)
#define vi vector<int>
#define vl vector<ll>
#define vb vector<b... | [
"variable_declaration.type.change"
] | 991,715 | 991,716 | u354567428 | cpp |
p03194 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define p(s) std::cout << s;
#define pl(s) std::cout << s << endl;
#define printIf(j, s1, s2) cout << (j ? s1 : s2) << endl;
#define YES(j) cout << (j ? "YES" : "NO") << endl... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define p(s) std::cout << s;
#define pl(s) std::cout << s << endl;
#define printIf(j, s1, s2) cout << (j ? s1 : s2) << endl;
#define YES(j) cout << (j ? "YES" : "NO") << endl... | [
"call.add",
"expression.operation.binary.change"
] | 991,730 | 991,731 | u491550356 | cpp |
p03194 | // g++ -std=c++11 a.cpp
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#incl... | // g++ -std=c++11 a.cpp
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#incl... | [
"assignment.variable.change",
"identifier.change",
"call.arguments.change"
] | 991,737 | 991,738 | u010004797 | cpp |
p03194 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
int main(void) {
ll n, p;
cin >> n >> p;
for (ll i = pow(p, 1.0 / double(n)); i > 0; i--) {
if (p % ll(pow(i, n)) == 0) {
cout << i - 1 << endl;
break;
}
}
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
int main(void) {
ll n, p;
cin >> n >> p;
for (ll i = pow(p, 1.0 / double(n)) + 1; i > 0; i--) {
if (p % ll(pow(i, n)) == 0) {
cout << i << endl;
return 0;
}
}
}
| [
"control_flow.loop.for.initializer.change",
"assignment.change",
"expression.operation.binary.remove",
"control_flow.break.remove",
"control_flow.return.add",
"function.return_value.change"
] | 991,759 | 991,760 | u050428930 | cpp |
p03194 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
int main(void) {
ll n, p;
cin >> n >> p;
for (ll i = pow(p, 1.0 / double(n)); i > 0; i--) {
if (p % ll(pow(i, n)) == 0) {
cout << i + 1 << endl;
break;
}
}
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
int main(void) {
ll n, p;
cin >> n >> p;
for (ll i = pow(p, 1.0 / double(n)) + 1; i > 0; i--) {
if (p % ll(pow(i, n)) == 0) {
cout << i << endl;
return 0;
}
}
}
| [
"control_flow.loop.for.initializer.change",
"assignment.change",
"expression.operation.binary.remove",
"control_flow.break.remove",
"control_flow.return.add",
"function.return_value.change"
] | 991,761 | 991,760 | u050428930 | cpp |
p03194 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, m;
while (cin >> n >> m) {
long long int ans = 1;
if (n == 1 || m == 1) {
cout << m << endl;
continue;
}
long long int maxx = sqrt(m);
maxx += 2;
for (long long int i = 2; i <= maxx; i++) {
long l... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, m;
while (cin >> n >> m) {
long long int ans = 1;
if (n == 1 || m == 1) {
cout << m << endl;
continue;
}
long long int maxx = sqrt(m);
maxx += 2;
for (long long int i = 2; i <= maxx; i++) {
long l... | [
"assignment.add"
] | 991,765 | 991,766 | u886817267 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.