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 |
|---|---|---|---|---|---|---|---|
p03183 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define F(i, a, b) for (int i = (int)a; i <= (int)b; i++)
#define FD(i, a, b) for (int i = (int)a; i >= (int)b; i--)
#define pii pair<int, int>
#define reset(x, y) memset(x, y, sizeof(x))
#define MIN(x, y) ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
#define F(i, a, b) for (int i = (int)a; i <= (int)b; i++)
#define FD(i, a, b) for (int i = (int)a; i >= (int)b; i--)
#define pii pair<int, int>
#define reset(x, y) memset(x, y, sizeof(x))
#define MIN(x, y) ... | [] | 989,699 | 989,700 | u117337152 | cpp |
p03183 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> w(n), s(n), v(n);
for (int i = 0; i < n; i++)
cin >> w[i] >> s[i] >> v[i];
vector<int> od(n);
iota(od.begin(), od.end(), 0);
sort(od.begin(), od.end(), [&](int a, int b) {
if (s[a] + w[a] == s[b] + w[b])
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> w(n), s(n), v(n);
for (int i = 0; i < n; i++)
cin >> w[i] >> s[i] >> v[i];
vector<int> od(n);
iota(od.begin(), od.end(), 0);
sort(od.begin(), od.end(), [&](int a, int b) {
if (s[a] + w[a] == s[b] + w[b])
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 989,707 | 989,708 | u251828455 | cpp |
p03183 | #include <bits/stdc++.h>
#define each(i, c) for (auto &i : c)
#define unless(cond) if (!(cond))
using namespace std;
typedef long long int lli;
typedef unsigned long long ull;
typedef complex<double> point;
template <typename P, typename Q>
ostream &operator<<(ostream &os, pair<P, Q> p) {
os << "(" << p.first << ... | #include <bits/stdc++.h>
#define each(i, c) for (auto &i : c)
#define unless(cond) if (!(cond))
using namespace std;
typedef long long int lli;
typedef unsigned long long ull;
typedef complex<double> point;
template <typename P, typename Q>
ostream &operator<<(ostream &os, pair<P, Q> p) {
os << "(" << p.first << ... | [
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 989,730 | 989,731 | u768334187 | cpp |
p03183 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF 1e18 + 5
vector<int> w(1009);
vector<int> s(1009);
vector<int> v(1009);
vector<int> dp(10009);
bool comp(int a, int b) { return s[a] + w[a] > s[b] + w[b]; }
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >>... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF 1e18 + 5
vector<int> w(1009);
vector<int> s(1009);
vector<int> v(1009);
vector<int> dp(20009);
bool comp(int a, int b) { return s[a] + w[a] > s[b] + w[b]; }
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >>... | [
"literal.number.change",
"call.arguments.change"
] | 989,741 | 989,742 | u457198113 | cpp |
p03183 | // Author : Rifayat Samee (Sanzee)
// Problem :
// Algorithm:
/*
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define maxval 10005
struct Node {
int w;
int s;
ll v;
bool operator<(const Node &b) const { return b.w + b.s > w + s; }
};
int main() {
// freopen("in.txt","r",stdin);
... | // Author : Rifayat Samee (Sanzee)
// Problem :
// Algorithm:
/*
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define maxval 2 * 10005
struct Node {
int w;
int s;
ll v;
bool operator<(const Node &b) const { return b.w + b.s > w + s; }
};
int main() {
// freopen("in.txt","r",stdin... | [] | 989,747 | 989,748 | u926505307 | cpp |
p03183 | #include <bits/stdc++.h>
using namespace std;
using ld = double;
using ll = long long;
using ull = unsigned long long;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int SZ = 1 << 13;
char buff[SZ], *pos = buff + SZ - 1;
#define getchar() \
(++... | #include <bits/stdc++.h>
using namespace std;
using ld = double;
using ll = long long;
using ull = unsigned long long;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int SZ = 1 << 13;
char buff[SZ], *pos = buff + SZ - 1;
#define getchar() \
(++... | [
"literal.number.change",
"expression.operation.binary.change"
] | 989,781 | 989,782 | u274463010 | cpp |
p03183 | #include <bits/stdc++.h>
using namespace std;
#define NDEBUG
#include <cassert>
typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef pair<ll, ll> llll;
typedef pair<double, double> dd;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vec... | #include <bits/stdc++.h>
using namespace std;
#define NDEBUG
#include <cassert>
typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef pair<ll, ll> llll;
typedef pair<double, double> dd;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vec... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 989,783 | 989,784 | u108808596 | cpp |
p03183 | #include <bits/stdc++.h>
#define x first
#define y second
#define y1 Y1
#define y2 Y2
#define mp make_pair
#define pb push_back
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
template <typename T> inline int Chkmax(T &a, T b) {
return a < b ? a = b, 1 : 0;
}
template <typename T> inline in... | #include <bits/stdc++.h>
#define x first
#define y second
#define y1 Y1
#define y2 Y2
#define mp make_pair
#define pb push_back
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
template <typename T> inline int Chkmax(T &a, T b) {
return a < b ? a = b, 1 : 0;
}
template <typename T> inline in... | [
"literal.number.change",
"expression.operation.binary.change"
] | 989,792 | 989,793 | u124985450 | cpp |
p03183 | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <casser... | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <casser... | [
"preprocessor.define.value.change",
"literal.integer.change",
"control_flow.loop.for.condition.change"
] | 989,807 | 989,808 | u378419207 | cpp |
p03183 | #include "bits/stdc++.h"
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define LLINF (long long)1e18 // 1234567890987654321
#define INF 1234567890
#define pb push_back
#... | #include "bits/stdc++.h"
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define LLINF (long long)1e18 // 1234567890987654321
#define INF 1234567890
#define pb push_back
#... | [
"variable_declaration.array_dimensions.change",
"expression.operation.binary.add"
] | 989,809 | 989,810 | u844961982 | cpp |
p03183 | #include <bits/stdc++.h>
#define va first
#define vb second
#define lb lower_bound
#define pb push_back
#define all(v) v.begin(), v.end()
#define fio \
ios_base::sync_with_stdio(0); \
cin.tie(0);
using ... | #include <bits/stdc++.h>
#define va first
#define vb second
#define lb lower_bound
#define pb push_back
#define all(v) v.begin(), v.end()
#define fio \
ios_base::sync_with_stdio(0); \
cin.tie(0);
using ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"io.output.change"
] | 989,819 | 989,820 | u582763758 | cpp |
p03183 | #include <bits/stdc++.h>
using namespace std;
struct trio {
int wt, sz, v;
bool operator<(const trio &t) const { return sz + wt < t.sz + t.wt; }
};
int N;
trio arr[1005];
long long dp[10005];
int main() {
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> arr[i].wt >> arr[i].sz >> arr[i].v;
}
sort(arr ... | #include <bits/stdc++.h>
using namespace std;
struct trio {
int wt, sz, v;
bool operator<(const trio &t) const { return sz + wt < t.sz + t.wt; }
};
int N;
trio arr[1005];
long long dp[30005];
int main() {
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> arr[i].wt >> arr[i].sz >> arr[i].v;
}
sort(arr ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 989,857 | 989,858 | u937063359 | cpp |
p03183 | #include <bits/stdc++.h>
#define ll long long
#define ld long double
using namespace std;
int n;
pair<pair<int, int>, int> t[1005];
bool cmp(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) {
return b.first.first + b.first.second > a.first.first + a.first.second;
}
ll dp[10005];
int main() {
cin >> n;
fo... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
using namespace std;
int n;
pair<pair<int, int>, int> t[1005];
bool cmp(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) {
return b.first.first + b.first.second > a.first.first + a.first.second;
}
ll dp[50005];
int main() {
cin >> n;
fo... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change"
] | 989,862 | 989,863 | u559535763 | cpp |
p03183 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
//#include<bits/extc++.h>
using namespace std;
// using namespace __gnu_pbds;
// typedef
// tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
// set_t;
#define mp(a, b) make_pair((a), (b))
#define pii pair<int, int>
#define pll pair<LL, LL... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
//#include<bits/extc++.h>
using namespace std;
// using namespace __gnu_pbds;
// typedef
// tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
// set_t;
#define mp(a, b) make_pair((a), (b))
#define pii pair<int, int>
#define pll pair<LL, LL... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 989,881 | 989,882 | u682550266 | cpp |
p03189 | #include <bits/stdc++.h>
#define pb push_back
#define mk make_pair
#define ll long long
#define int long long
using namespace std;
const int maxn = 3010;
const int mod = 1e9 + 7;
int qsm(int i, int j) {
int ans = 1;
while (j) {
if (j & 1)
ans = ans * i % mod;
j >>= 1;
i = i * i % mod;
}
ret... | #include <bits/stdc++.h>
#define pb push_back
#define mk make_pair
#define ll long long
#define int long long
using namespace std;
const int maxn = 3010;
const int mod = 1e9 + 7;
int qsm(int i, int j) {
int ans = 1;
while (j) {
if (j & 1)
ans = ans * i % mod;
j >>= 1;
i = i * i % mod;
}
ret... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 989,908 | 989,909 | u749011596 | cpp |
p03189 | #include <bits/stdc++.h>
#define pb push_back
#define mk make_pair
#define ll long long
#define int long long
using namespace std;
const int maxn = 3010;
const int mod = 1e9 + 7;
int qsm(int i, int j) {
int ans = 1;
while (j) {
if (j & 1)
ans = ans * i % mod;
j >>= 1;
i = i * i % mod;
}
ret... | #include <bits/stdc++.h>
#define pb push_back
#define mk make_pair
#define ll long long
#define int long long
using namespace std;
const int maxn = 3010;
const int mod = 1e9 + 7;
int qsm(int i, int j) {
int ans = 1;
while (j) {
if (j & 1)
ans = ans * i % mod;
j >>= 1;
i = i * i % mod;
}
ret... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 989,910 | 989,909 | u749011596 | cpp |
p03189 | #include <bits/stdc++.h>
#define pb push_back
#define mk make_pair
#define ll long long
#define int long long
using namespace std;
const int maxn = 3010;
const int mod = 1e9 + 7;
int qsm(int i, int j) {
int ans = 1;
while (j) {
if (j & 1)
ans = ans * i % mod;
j >>= 1;
i = i * i % mod;
}
ret... | #include <bits/stdc++.h>
#define pb push_back
#define mk make_pair
#define ll long long
#define int long long
using namespace std;
const int maxn = 3010;
const int mod = 1e9 + 7;
int qsm(int i, int j) {
int ans = 1;
while (j) {
if (j & 1)
ans = ans * i % mod;
j >>= 1;
i = i * i % mod;
}
ret... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 989,908 | 989,911 | u749011596 | cpp |
p03189 | #include <bits/stdc++.h>
#define pb push_back
#define mk make_pair
#define ll long long
#define int long long
using namespace std;
const int maxn = 3010;
const int mod = 1e9 + 7;
int qsm(int i, int j) {
int ans = 1;
while (j) {
if (j & 1)
ans = ans * i % mod;
j >>= 1;
i = i * i % mod;
}
ret... | #include <bits/stdc++.h>
#define pb push_back
#define mk make_pair
#define ll long long
#define int long long
using namespace std;
const int maxn = 3010;
const int mod = 1e9 + 7;
int qsm(int i, int j) {
int ans = 1;
while (j) {
if (j & 1)
ans = ans * i % mod;
j >>= 1;
i = i * i % mod;
}
ret... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 989,910 | 989,911 | u749011596 | cpp |
p03190 | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define db double
#define pint pair<int, int>
#define mk(x, y) make_pair(x, y)
#define fir first
#define sec second
#define Rep(x, y, z) for (int x = y; x <= z; x++)
#define Red(x, y, z) for (int x = y; x >= z; x--)
using namespace std;
const int MAXN... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define db double
#define pint pair<int, int>
#define mk(x, y) make_pair(x, y)
#define fir first
#define sec second
#define Rep(x, y, z) for (int x = y; x <= z; x++)
#define Red(x, y, z) for (int x = y; x >= z; x--)
using namespace std;
const int MAXN... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 989,944 | 989,945 | u710376653 | cpp |
p03190 | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define db double
#define pint pair<int, int>
#define mk(x, y) make_pair(x, y)
#define fir first
#define sec second
#define Rep(x, y, z) for (int x = y; x <= z; x++)
#define Red(x, y, z) for (int x = y; x >= z; x--)
using namespace std;
const int MAXN... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define db double
#define pint pair<int, int>
#define mk(x, y) make_pair(x, y)
#define fir first
#define sec second
#define Rep(x, y, z) for (int x = y; x <= z; x++)
#define Red(x, y, z) for (int x = y; x >= z; x--)
using namespace std;
const int MAXN... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 989,946 | 989,945 | u710376653 | cpp |
p03190 | #include <bits/stdc++.h>
using namespace std;
constexpr int INF = 1E9;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
string s, t;
cin >> n >> s >> t;
vector<int> x{0}, y{0};
for (int i = 1; i < n; ++i)
if (s[i] != s[i - 1])
x.push_back(i);
for (int i = 1; i < n; ++i)
i... | #include <bits/stdc++.h>
using namespace std;
constexpr int INF = 1E9;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
string s, t;
cin >> n >> s >> t;
vector<int> x{0}, y{0};
for (int i = 1; i < n; ++i)
if (s[i] != s[i - 1])
x.push_back(i);
for (int i = 1; i < n; ++i)
i... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 989,964 | 989,965 | u803731421 | cpp |
p03190 | #include <bits/stdc++.h>
using namespace std;
const int Maxn = 5005;
int n;
char s[Maxn], t[Maxn];
int pool1[2 * Maxn], pool2[2 * Maxn], *a = pool1 + Maxn, *b = pool2 + Maxn;
int main() {
cin >> n >> (s + 1) >> (t + 1);
int cnta = 0, cntb = 0, ans = INT_MAX;
if (s[1] != t[1])
a[++cnta] = 0;
for (int i = 1; ... | #include <bits/stdc++.h>
using namespace std;
const int Maxn = 5005;
int n;
char s[Maxn], t[Maxn];
int pool1[2 * Maxn], pool2[2 * Maxn], *a = pool1 + Maxn, *b = pool2 + Maxn;
int main() {
cin >> n >> (s + 1) >> (t + 1);
int cnta = 0, cntb = 0, ans = INT_MAX;
if (s[1] != t[1])
a[++cnta] = 0;
for (int i = 1; ... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.change",
"expression.operation.binary.remove"
] | 989,969 | 989,970 | u004427876 | cpp |
p03190 | #include <bits/stdc++.h>
using namespace std;
const int Maxn = 5005;
int n;
char s[Maxn], t[Maxn];
int pool1[2 * Maxn], pool2[2 * Maxn], *a = pool1 + Maxn, *b = pool2 + Maxn;
int main() {
cin >> n >> (s + 1) >> (t + 1);
int cnta = 0, cntb = 0, ans = INT_MAX;
if (s[1] != t[1])
a[++cnta] = 0;
for (int i = 1; ... | #include <bits/stdc++.h>
using namespace std;
const int Maxn = 5005;
int n;
char s[Maxn], t[Maxn];
int pool1[2 * Maxn], pool2[2 * Maxn], *a = pool1 + Maxn, *b = pool2 + Maxn;
int main() {
cin >> n >> (s + 1) >> (t + 1);
int cnta = 0, cntb = 0, ans = INT_MAX;
if (s[1] != t[1])
a[++cnta] = 0;
for (int i = 1; ... | [
"assignment.change",
"expression.operation.binary.remove"
] | 989,971 | 989,970 | u004427876 | cpp |
p03190 | #include <bits/stdc++.h>
using namespace std;
const int Maxn = 5005;
int n;
char s[Maxn], t[Maxn];
int pool1[2 * Maxn], pool2[2 * Maxn], *a = pool1 + Maxn, *b = pool2 + Maxn;
int main() {
cin >> n >> (s + 1) >> (t + 1);
int cnta = 0, cntb = 0, ans = INT_MAX;
if (s[1] != t[1])
a[++cnta] = 0;
for (int i = 1; ... | #include <bits/stdc++.h>
using namespace std;
const int Maxn = 5005;
int n;
char s[Maxn], t[Maxn];
int pool1[2 * Maxn], pool2[2 * Maxn], *a = pool1 + Maxn, *b = pool2 + Maxn;
int main() {
cin >> n >> (s + 1) >> (t + 1);
int cnta = 0, cntb = 0, ans = INT_MAX;
if (s[1] != t[1])
a[++cnta] = 0;
for (int i = 1; ... | [
"assignment.change",
"expression.operation.binary.remove"
] | 989,969 | 989,972 | u004427876 | cpp |
p03190 | #include <bits/stdc++.h>
using namespace std;
const int Maxn = 5005;
int n;
char s[Maxn], t[Maxn];
int pool1[2 * Maxn], pool2[2 * Maxn], *a = pool1 + Maxn, *b = pool2 + Maxn;
int main() {
cin >> n >> (s + 1) >> (t + 1);
int cnta = 0, cntb = 0, ans = INT_MAX;
if (s[1] != t[1])
a[++cnta] = 0;
for (int i = 1; ... | #include <bits/stdc++.h>
using namespace std;
const int Maxn = 5005;
int n;
char s[Maxn], t[Maxn];
int pool1[2 * Maxn], pool2[2 * Maxn], *a = pool1 + Maxn, *b = pool2 + Maxn;
int main() {
cin >> n >> (s + 1) >> (t + 1);
int cnta = 0, cntb = 0, ans = INT_MAX;
if (s[1] != t[1])
a[++cnta] = 0;
for (int i = 1; ... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.change",
"expression.operation.binary.remove"
] | 989,971 | 989,972 | u004427876 | cpp |
p03190 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define MAXN 5005
#define P 998244353
#define INF 0x3f3f3f3f
#define rint register int
#define LL long long
#define LD long double
using namespace std;
int n, ans = INF, t1, t2, p... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define MAXN 5005
#define P 998244353
#define INF 0x3f3f3f3f
#define rint register int
#define LL long long
#define LD long double
using namespace std;
int n, ans = INF, t1, t2, p... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 989,995 | 989,996 | u229056063 | cpp |
p03190 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define MAXN 5005
#define P 998244353
#define INF 0x3f3f3f3f
#define rint register int
#define LL long long
#define LD long double
using namespace std;
int n, ans = INF, t1, t2, p... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define MAXN 5005
#define P 998244353
#define INF 0x3f3f3f3f
#define rint register int
#define LL long long
#define LD long double
using namespace std;
int n, ans = INF, t1, t2, p... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 989,997 | 989,996 | u229056063 | cpp |
p03193 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n, h, w;
cin >> n >> h >> w;
int c = 0;
for (int i = 0; i < n; ++i) {
int a, b;
cin >> a >> b;
c += (a <= h && b <= w);
}
cout << c << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n, h, w;
cin >> n >> h >> w;
int c = 0;
for (int i = 0; i < n; ++i) {
int a, b;
cin >> a >> b;
c += (a >= h && b >= w);
}
cout << c << '\n';
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 990,018 | 990,019 | u651918401 | cpp |
p03194 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define mod (1e9 + 7)
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x)... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define mod (1e9 + 7)
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x)... | [
"call.add",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 990,022 | 990,023 | u825343780 | cpp |
p03194 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push... | [
"call.arguments.add"
] | 990,032 | 990,033 | u722640678 | cpp |
p03194 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
template <class T> inline vector<pair<T, T>> primeFactorize(T n) {
vector<pair<T, T>> res;
for (T a = 2; a * a <= n; a++) {
if (n % a != 0)
continue;
T ex = 0;
while (n % a == 0) {
... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
template <class T> inline vector<pair<T, T>> primeFactorize(T n) {
vector<pair<T, T>> res;
for (T a = 2; a * a <= n; a++) {
if (n % a != 0)
continue;
T ex = 0;
while (n % a == 0) {
... | [
"variable_declaration.type.change",
"call.add",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 990,038 | 990,037 | u596385287 | cpp |
p03194 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll ... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll ... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 990,046 | 990,047 | u835805357 | cpp |
p03194 | #include <cstdio>
#include <iostream>
using namespace std;
typedef long long ll;
ll n, p, ans = 1;
int main() {
ll i, j, t;
cin >> n >> p;
if (n == 1) {
return printf("%d", p) * 0;
}
for (i = 2;; i++) {
t = 1;
for (j = 0; j < n; j++) {
t *= i;
if (t < 0 || t > p) {
cout << ans... | #include <cstdio>
#include <iostream>
using namespace std;
typedef long long ll;
ll n, p, ans = 1;
int main() {
ll i, j, t;
cin >> n >> p;
if (n == 1) {
return printf("%lld", p) * 0;
}
for (i = 2;; i++) {
t = 1;
for (j = 0; j < n; j++) {
t *= i;
if (t < 0 || t > p) {
cout << a... | [
"literal.string.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change",
"io.output.change"
] | 990,048 | 990,049 | u093170535 | cpp |
p03194 | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
typedef long long ll;
ll n, p, ans = 1;
int main() {
cin >> n >> p;
if (n == 1) {
return printf("%d", p) * 0;
}
for (ll i = 1; pow(i, n) <= p; i++) {
if (p % (ll)pow(i, n) == 0)
ans = i;
}
cout << ans;
return 0;
} | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
typedef long long ll;
ll n, p, ans = 1;
int main() {
cin >> n >> p;
if (n == 1) {
return printf("%lld", p) * 0;
}
for (ll i = 1; pow(i, n) <= p; i++) {
if (p % (ll)pow(i, n) == 0)
ans = i;
}
cout << ans;
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change",
"io.output.change"
] | 990,050 | 990,051 | u093170535 | cpp |
p03194 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <immintrin.h>
#include <iomanip>
#include <iostream>
#include <list>... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <immintrin.h>
#include <iomanip>
#include <iostream>
#include <list>... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 990,059 | 990,060 | u301704561 | cpp |
p03192 | #include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
int sum;
char hoge[5];
sprintf(hoge, "%d", a);
for (int b = 0; b < 4; b++) {
if (hoge[b] == 2) {
sum++;
}
}
cout << sum;
} | #include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
int sum = 0;
char hoge[5];
sprintf(hoge, "%d", a);
for (int b = 0; b < 4; b++) {
if (hoge[b] == '2') {
sum++;
}
}
cout << sum;
} | [
"variable_declaration.value.change",
"control_flow.branch.if.condition.change"
] | 990,079 | 990,080 | u544397444 | cpp |
p03192 | #include <algorithm>
#include <cstdint>
#include <iostream>
#include <string>
int main() {
std::string n;
std::getline(std::cin, n);
std::cout << std::count(n.begin(), n.end() - 1, '2');
} | #include <algorithm>
#include <cstdint>
#include <iostream>
#include <string>
int main() {
std::string n;
std::getline(std::cin, n);
std::cout << std::count(n.begin(), n.end(), '2');
} | [
"expression.operation.binary.remove"
] | 990,097 | 990,098 | u969319352 | cpp |
p03192 | #include <bits/stdc++.h>
using namespace std;
int main() {
char a;
int i, t = 0;
for (i = 0; i < 4; i++) {
scanf("%c", &a);
if (a == '2') {
t++;
}
}
printf("%d", &t);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char a;
int i, t = 0;
for (i = 0; i < 4; i++) {
scanf("%c", &a);
if (a == '2') {
t++;
}
}
printf("%d", t);
return 0;
} | [
"call.arguments.change"
] | 990,102 | 990,103 | u858741867 | cpp |
p03192 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
int main() {
int n;
cin >> n;
int cnt = 0;
for (int i = 0; i < 3; i++) {
if (n % 10 == 2)
cnt++;
n = n / 10;
}
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
int main() {
int n;
cin >> n;
int cnt = 0;
for (int i = 0; i < 4; i++) {
// cout<<n<<endl;
if (n % 10 == 2)
cnt++;
n = n / 10;
}
cout << cnt << endl;
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 990,114 | 990,115 | u056802256 | cpp |
p03192 | #include <iostream>
using namespace std;
int main(void) {
int n;
int count = 0;
cin >> n;
for (int i = 0; i < 4; i++) {
if (n % 10 == 2) {
count++;
n = n / 10;
}
}
cout << count;
}
| #include <iostream>
using namespace std;
int main(void) {
int n;
int count = 0;
cin >> n;
for (int i = 0; i < 4; i++) {
if (n % 10 == 2) {
count++;
}
n = n / 10;
}
cout << count;
}
| [] | 990,116 | 990,117 | u584355627 | cpp |
p03192 | #include <iostream>
using namespace std;
int main(void) {
int n;
int count = 0;
cin >> n;
for (int i = 0; i < 3; i++) {
if (n % 10 == 2) {
count++;
n = n / 10;
}
}
cout << count;
}
| #include <iostream>
using namespace std;
int main(void) {
int n;
int count = 0;
cin >> n;
for (int i = 0; i < 4; i++) {
if (n % 10 == 2) {
count++;
}
n = n / 10;
}
cout << count;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 990,118 | 990,117 | u584355627 | cpp |
p03194 |
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#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... |
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#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... | [
"assignment.value.change",
"identifier.change"
] | 990,136 | 990,137 | u196497077 | cpp |
p03194 | #include <bits/stdc++.h>
#include <cstdlib>
using namespace std;
#define ll long long
typedef vector<vector<ll>> matrix;
#define pb push_back
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
const double PI = 3.141592... | #include <bits/stdc++.h>
#include <cstdlib>
using namespace std;
#define ll long long
typedef vector<vector<ll>> matrix;
#define pb push_back
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
const double PI = 3.141592... | [
"call.add",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.add"
] | 990,149 | 990,150 | u069935888 | cpp |
p03194 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, i, k, cnt;
unsigned long long int p, ans;
cin >> n >> p;
if (n == 1) {
ans = p;
} else {
for (i = 2; i <= sqrt(p); i++) {
cnt = 0;
while (p % i == 0) {
p = p / i;
cnt++;
}
while (cnt ... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, i, k, cnt;
unsigned long long int p, ans;
cin >> n >> p;
if (n == 1) {
ans = p;
} else {
ans = 1;
for (i = 2; i <= sqrt(p); i++) {
cnt = 0;
while (p % i == 0) {
p = p / i;
cnt++;
}
... | [
"assignment.add"
] | 990,153 | 990,154 | u979960743 | cpp |
p03194 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, P;
cin >> N >> P;
ll i = 2;
ll p = P;
ll ans = 1;
while (i * i <= p) {
if (P == 1) {
break;
}
ll cnt = 0;
while (P % i == 0) {
P = P / i;
cnt++;
}
cnt = cnt / N;
for (int j =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, P;
cin >> N >> P;
ll i = 2;
ll p = P;
ll ans = 1;
while (i * i <= p) {
if (P == 1) {
break;
}
ll cnt = 0;
while (P % i == 0) {
P = P / i;
cnt++;
}
cnt = cnt / N;
for (int j =... | [
"identifier.change",
"io.output.change"
] | 990,157 | 990,158 | u077536797 | cpp |
p03194 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <sstream>
#include <stack... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <sstream>
#include <stack... | [
"call.add",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 990,161 | 990,162 | u200030766 | cpp |
p03194 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1e9;
const int MOD = 1e9 + 7;
// 4近傍、8近傍
int dx[] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
map<ll, ll> mp;
int main() {
ll N, P;
cin >> N >> P;
// 割る数の初期値
ll a = 2;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1e9;
const int MOD = 1e9 + 7;
// 4近傍、8近傍
int dx[] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
map<ll, ll> mp;
int main() {
ll N, P;
cin >> N >> P;
// 割る数の初期値
ll a = 2;
... | [
"call.add",
"assignment.value.change",
"expression.operation.binary.change"
] | 990,166 | 990,167 | u063020782 | cpp |
p03194 | #include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
long long n, p, ans = 1;
cin >> n >> p;
long long e = p;
for (int i = 2; i <= sqrt(e); i++) {
int x = 0;
while (p % i == 0) {
p = p / i;
x++;
}
ans = ans * pow(i, x / n);
}
if (n >= 2)
c... | #include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
long long n, p, ans = 1;
cin >> n >> p;
long long e = p;
for (int i = 2; i <= sqrt(e); i++) {
int x = 0;
while (p % i == 0) {
p = p / i;
x++;
}
ans = ans * pow(i, x / n);
}
if (n >= 2)
c... | [
"identifier.change",
"io.output.change"
] | 990,168 | 990,169 | u441296840 | cpp |
p03194 | #include <algorithm>
#include <array>
#include <cmath>
#include <cstring>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
const int MOD = 1000000007;
using namespace std;
typedef long long ll;
typedef tuple<ll, int, int> tup;
typedef vector<int> v... | #include <algorithm>
#include <array>
#include <cmath>
#include <cstring>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
const int MOD = 1000000007;
using namespace std;
typedef long long ll;
typedef tuple<ll, int, int> tup;
typedef vector<int> v... | [
"variable_declaration.value.change"
] | 990,170 | 990,171 | u945017646 | cpp |
p03194 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int SZ = 100005;
int np[SZ];
vector<pair<ll, int>> v;
void myprime(ll n) {
for (ll i = 2; i < SZ; i++) {
if (np[i] == 1)
continue;
int aa = 0;
while (n % i == 0) {
n /= i;
aa++;
}
if (aa != 0)
v.push_... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int SZ = 1000005;
int np[SZ];
vector<pair<ll, int>> v;
void myprime(ll n) {
for (ll i = 2; i < SZ; i++) {
if (np[i] == 1)
continue;
int aa = 0;
while (n % i == 0) {
n /= i;
aa++;
}
if (aa != 0)
v.push... | [
"literal.number.change",
"variable_declaration.value.change",
"variable_declaration.type.change"
] | 990,172 | 990,173 | u225129981 | cpp |
p03194 | #include <algorithm>
#include <math.h>
#include <stdio.h>
using namespace std;
int main() {
long long n, p;
scanf("%lld %lld", &n, &p);
if (n == 1) {
printf("%lld\n", p);
return 0;
}
int ans = 0;
for (long long i = 2; pow(i, n) <= p; i++) {
if (p % i == 0) {
int tmpcnt = 0;
int tm... | #include <algorithm>
#include <math.h>
#include <stdio.h>
using namespace std;
int main() {
long long n, p;
scanf("%lld %lld", &n, &p);
if (n == 1) {
printf("%lld\n", p);
return 0;
}
long long ans = 0;
for (long long i = 2; pow(i, n) <= p; i++) {
if (p % i == 0) {
int tmpcnt = 0;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 990,176 | 990,177 | u601968297 | cpp |
p03194 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long long n, p;
cin >> n >> p;
long long ans = 0;
for (long long i = int(pow(p, 1.0 / n)) + 3; i >= 1; i--) {
if (p % (long long)(pow(i, n)) == 0) {
ans = i;
break;
}
}
cout << ans << endl;
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long long n, p;
cin >> n >> p;
long long ans = 0;
for (long long i = (long long)(pow(p, 1.0 / n)) + 3; i >= 1; i--) {
if (p % (long long)(pow(i, n)) == 0) {
ans = i;
break;
}
}
cout << ans << endl;
} | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 990,182 | 990,183 | u990764614 | cpp |
p03194 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define pr(num) cout << num << endl
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define pr(num) cout << num << endl
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(... | [
"call.add",
"assignment.value.change",
"expression.operation.binary.change"
] | 990,192 | 990,193 | u768152935 | cpp |
p03194 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 990,194 | 990,195 | u247119183 | cpp |
p03194 | #include <bits/stdc++.h>
#define start_routine \
cin.tie(0); \
cout.tie(0); \
ios_base::sync_with_stdio(false); ... | #include <bits/stdc++.h>
#define start_routine \
cin.tie(0); \
cout.tie(0); \
ios_base::sync_with_stdio(false); ... | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 990,196 | 990,197 | u955177919 | cpp |
p03195 | #include <bits/stdc++.h>
using namespace std;
#define ll int64_t
//ライブラリ始まり
//定数
//円周率
const double PI = 3.1415926535897932384;
//天井
const int INF = 1000000000; // = 10^9
const ll LINF = 1000000000000000; // = 10^15
// ABC文字列
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijk... | #include <bits/stdc++.h>
using namespace std;
#define ll int64_t
//ライブラリ始まり
//定数
//円周率
const double PI = 3.1415926535897932384;
//天井
const int INF = 1000000000; // = 10^9
const ll LINF = 1000000000000000; // = 10^15
// ABC文字列
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijk... | [] | 990,198 | 990,199 | u453366189 | cpp |
p03195 | // I SELL YOU...!
#include <algorithm>
#include <functional>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
signed main() {
ll n, odc = 0;
cin >> n;
ll a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] % 2 == 1) {
o... | // I SELL YOU...!
#include <algorithm>
#include <functional>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
signed main() {
ll n, odc = 0;
cin >> n;
ll a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] % 2 == 1) {
o... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 990,202 | 990,203 | u352248517 | cpp |
p03195 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
bool ans = false;
for (int i = 0; i < n; i++) {
if (a[i] % 2 == 1) {
ans = true;
}
}
cout << (ans ? "First" : "Second") << endl;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
bool ans = false;
for (int i = 0; i < n; i++) {
if (a[i] % 2 == 1) {
ans = true;
}
}
cout << (ans ? "first" : "second") << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 990,211 | 990,212 | u179970156 | cpp |
p03195 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int i;
vector<int> a(n);
for (i = 0; i < n; i++) {
cin >> a.at(i);
}
int s = 0;
for (i = 0; i < n; i++) {
if (a.at(i) % 2 == i) {
s = 1;
break;
}
}
if (s == 1) {
cout << "first" << endl;
} else... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int i;
vector<int> a(n);
for (i = 0; i < n; i++) {
cin >> a.at(i);
}
int s = 0;
for (i = 0; i < n; i++) {
if (a.at(i) % 2 == 1) {
s = 1;
break;
}
}
if (s == 1) {
cout << "first" << endl;
} else... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 990,215 | 990,216 | u989336028 | cpp |
p03195 | #include <iostream>
using namespace std;
int n, m, ans = 1;
int main(void) {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> m;
ans *= (m % 2 == 0);
}
if (ans)
cout << "Second" << endl;
else
cout << "First" << endl;
}
| #include <iostream>
using namespace std;
int n, m, ans = 1;
int main(void) {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> m;
ans *= (m % 2 == 0);
}
if (ans)
cout << "second" << endl;
else
cout << "first" << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 990,221 | 990,222 | u050428930 | cpp |
p03195 | // Harlequin.cpp : This file contains the 'main' function. Program execution
// begins and ends there.
//
#include <iostream>
using namespace std;
int n, x;
int pos;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
if (x % 2 == 1) {
pos = false;
}
}
if (pos) {
cout << "sec... | // Harlequin.cpp : This file contains the 'main' function. Program execution
// begins and ends there.
//
#include <iostream>
using namespace std;
int n, x;
bool pos = true;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
if (x % 2 == 1) {
pos = false;
}
}
if (pos) {
cout... | [
"variable_declaration.type.primitive.change",
"variable_declaration.value.change"
] | 990,233 | 990,234 | u999447364 | cpp |
p03195 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define PB... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define PB... | [
"literal.string.change",
"io.output.change"
] | 990,241 | 990,242 | u257304866 | cpp |
p03195 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
int i = 0;
while (i < n) {
int a;
if (a % 2 == 1) {
cout << "first" << endl;
return 0;
}
i++;
}
cout << "second" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
int i = 0;
while (i < n) {
int a;
cin >> a;
if (a % 2 == 1) {
cout << "first" << endl;
return 0;
}
i++;
}
cout << "second" << endl;
return 0;
} | [] | 990,252 | 990,253 | u369212307 | cpp |
p03195 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int wo;
for (int i = 0; i < N; i++) {
cin >> wo;
if (wo %= 1) {
cout << "first" << endl;
return 0;
}
}
cout << "second" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int wo;
for (int i = 0; i < N; i++) {
cin >> wo;
if (wo % 2 == 1) {
cout << "first" << endl;
return 0;
}
}
cout << "second" << endl;
return 0;
}
| [
"assignment.compound.arithmetic.replace.remove",
"expression.operator.arithmetic.replace.add",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 990,257 | 990,258 | u071695942 | cpp |
p03195 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
bool flag = true;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] % 2 != 0)
flag = false;
}
cout << (flag ? "first" : "second") << endl;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
bool flag = true;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] % 2 != 0)
flag = false;
}
cout << (flag ? "second" : "first") << endl;
}
| [
"literal.string.change",
"io.output.change"
] | 990,271 | 990,272 | u468811760 | cpp |
p03195 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define... | [
"literal.string.change",
"io.output.change"
] | 990,277 | 990,278 | u381714561 | cpp |
p03195 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define VRSORT(v) sort(... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define VRSORT(v) sort(... | [
"control_flow.branch.if.condition.change"
] | 990,279 | 990,280 | u493750228 | cpp |
p03195 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <sstream>
#include <string>
#include <time.h>
#include <vector>
//#include "bits/stdc++.h"
using namespace std;
// using namespace std::v... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <sstream>
#include <string>
#include <time.h>
#include <vector>
//#include "bits/stdc++.h"
using namespace std;
// using namespace std::v... | [
"literal.string.change",
"io.output.change"
] | 990,294 | 990,295 | u301409936 | cpp |
p03195 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <sstream>
#include <string>
#include <time.h>
#include <vector>
//#include "bits/stdc++.h"
using namespace std;
// using namespace std::v... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <sstream>
#include <string>
#include <time.h>
#include <vector>
//#include "bits/stdc++.h"
using namespace std;
// using namespace std::v... | [
"control_flow.break.remove",
"control_flow.return.add",
"function.return_value.change"
] | 990,296 | 990,295 | u301409936 | cpp |
p03195 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long int li;
int main(void) {
ll n;
ll od = 0;
ll ev = 0;
cin >> n;
ll a[n + 1];
for (ll i = 1; i < n + 1; i++)
cin... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long int li;
int main(void) {
ll n;
ll od = 0;
ll ev = 0;
cin >> n;
ll a[n + 1];
for (ll i = 1; i < n + 1; i++)
cin... | [
"literal.string.change",
"io.output.change"
] | 990,311 | 990,305 | u795009336 | cpp |
p03195 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long int li;
int main(void) {
ll n;
ll od = 0;
ll ev = 0;
cin >> n;
ll a[n + 1];
for (ll i = 1; i < n + 1; i++)
cin... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long int li;
int main(void) {
ll n;
ll od = 0;
ll ev = 0;
cin >> n;
ll a[n + 1];
for (ll i = 1; i < n + 1; i++)
cin... | [
"literal.string.change",
"io.output.change"
] | 990,312 | 990,305 | u795009336 | cpp |
p03195 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int n;
int read() {
int x = 0, f = 1;
char ch = getchar();
while ((ch < '0') || (ch > '9')) {
if (ch == '-')
f = -1;
ch = getchar(... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int n;
int read() {
int x = 0, f = 1;
char ch = getchar();
while ((ch < '0') || (ch > '9')) {
if (ch == '-')
f = -1;
ch = getchar(... | [
"literal.string.change",
"io.output.change"
] | 990,326 | 990,327 | u473013083 | cpp |
p03195 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 1000000000
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define LOOP(i, N) for (int i = 0; i < N; i++)
#define LOOP1(i, N) for (int i = 1; i <= N; i++)
typedef... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 1000000000
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define LOOP(i, N) for (int i = 0; i < N; i++)
#define LOOP1(i, N) for (int i = 1; i <= N; i++)
typedef... | [
"control_flow.branch.if.condition.change"
] | 990,333 | 990,334 | u118951811 | cpp |
p03194 | #include <iostream>
using namespace std;
int main() {
long long N, num, ans = 1, was = 0, temp = 1, i, cnt = 0;
bool chk = false;
cin >> N >> num;
if (N == 1)
cout << num << endl;
return 0;
while (num != 0) {
for (i = 2; i <= num; i++) {
if (num % i == 0 && num != 2) {
chk = true;
... | #include <iostream>
using namespace std;
int main() {
long long N, num, ans = 1, was = 0, temp = 1, i, cnt = 0;
bool chk = false;
cin >> N >> num;
if (N == 1) {
cout << num << endl;
return 0;
}
while (num != 0) {
for (i = 2; i <= num; i++) {
if (num % i == 0 && num != 2) {
chk = t... | [] | 990,372 | 990,373 | u053038211 | cpp |
p03194 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
int sss(long long int x) {
long long int a = 2, sum = 0;
long long int mx = 0;
while (x >= a * a) {
if (x % a == 0) {
... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
int sss(long long int x) {
long long int a = 2, sum = 0;
long long int mx = 0;
while (x >= a * a) {
if (x % a == 0) {
... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 990,412 | 990,413 | u385617244 | cpp |
p03194 | #include <cmath>
#include <iostream>
#include <string>
#include <vector>
using std::cin;
using std::cout;
using std::endl;
using std::pair;
using std::string;
using std::vector;
// for(int32_t i = 0; i < N; i++)
int main(void) {
int64_t N, P;
cin >> N >> P;
// cout << "P:" << P << " ,N:" << N << endl;
int64_... | #include <cmath>
#include <iostream>
#include <string>
#include <vector>
using std::cin;
using std::cout;
using std::endl;
using std::pair;
using std::string;
using std::vector;
// for(int32_t i = 0; i < N; i++)
int main(void) {
int64_t N, P;
cin >> N >> P;
// cout << "P:" << P << " ,N:" << N << endl;
int64_... | [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove",
"assignment.add"
] | 990,414 | 990,415 | u668140376 | cpp |
p03194 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, P;
cin >> N >> P;
ll i = 2, l = 1;
while (P != 1) {
if (P % i == 0) {
ll ni = 0;
while (P % i == 0) {
ni++;
P /= i;
}
l *= pow(i, ni / N);
} else if (i * i > P) {
if (N ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, P;
cin >> N >> P;
ll i = 2, l = 1;
while (P != 1) {
if (P % i == 0) {
ll ni = 0;
while (P % i == 0) {
ni++;
P /= i;
}
l *= pow(i, ni / N);
} else if (i * i > P) {
if (N ... | [
"assignment.value.change",
"identifier.change"
] | 990,438 | 990,439 | u077337864 | cpp |
p03194 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
long long n, p;
cin >> n >> p;
long long jg = pow(p, 1.0 / n);
for (long long i = jg + 1;; i--) {
if (p % (long long)pow(i, n - 1) == 0) {
jg = i;
break;
}
}
printf("%lld\n", jg)... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
long long n, p;
cin >> n >> p;
long long jg = pow(p, 1.0 / n);
for (long long i = jg + 1;; i--) {
if (p % (long long)pow(i, n) == 0) {
jg = i;
break;
}
}
printf("%lld\n", jg);
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 990,444 | 990,445 | u061597928 | cpp |
p03194 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
long long maxn = 1;
if (n == 1 || n >= m) {
cout << m << endl;
return 0;
}
double ff = m, fff = n;
double f = pow(ff, 1.0 / fff);
// cout<<f<<endl;
for (long long i = f + 1; i >= 2; i--) {
long long ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
long long maxn = 1;
if (n == 1) {
cout << m << endl;
return 0;
}
double ff = m, fff = n;
double f = pow(ff, 1.0 / fff);
// cout<<f<<endl;
for (long long i = f + 1; i >= 2; i--) {
long long sum = 1;
... | [
"expression.operation.binary.remove"
] | 990,453 | 990,454 | u269278772 | cpp |
p03194 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#define int long long
using namespace std;
int n, p, ans = 1, cnt;
int jl[10000009];
int prime[10000009], isp[10000009];
template <typename T> inline void in(T &x) {
T ch = getchar(), f = 1;
x = 0;
while (!isdigit(ch))
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#define int long long
using namespace std;
int n, p, ans = 1, cnt;
int jl[10000009];
int prime[10000009], isp[10000009];
template <typename T> inline void in(T &x) {
T ch = getchar(), f = 1;
x = 0;
while (!isdigit(ch))
... | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 990,459 | 990,460 | u951877666 | cpp |
p03194 | #include <bits/stdc++.h>
using namespace std;
// Define
using ll = int64_t;
using ul = uint64_t;
using ld = long double;
const ll MOD = 1e9 + 7;
const ll INF = LONG_MAX;
const ul MAX = ULONG_MAX;
const char nl = '\n';
#define elif else if
#define def inline auto
#define run __attribute__((constructor)) def _
// Debu... | #include <bits/stdc++.h>
using namespace std;
// Define
using ll = int64_t;
using ul = uint64_t;
using ld = long double;
const ll MOD = 1e9 + 7;
const ll INF = LONG_MAX;
const ul MAX = ULONG_MAX;
const char nl = '\n';
#define elif else if
#define def inline auto
#define run __attribute__((constructor)) def _
// Debu... | [
"call.add",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 990,464 | 990,465 | u874039158 | cpp |
p03194 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long long n, p;
cin >> n >> p;
long long ans = 1;
for (long long i = 2; i < pow((long double)p, (long double)1 / n); i++) {
if (n == 1) {
ans = p;
break;
}
if (p % (long long)pow((long double)i, (long double)n) == 0)
... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long long n, p;
cin >> n >> p;
long long ans = 1;
for (long long i = 2; i <= pow((long double)p, (long double)1 / n); i++) {
if (n == 1) {
ans = p;
break;
}
if (p % (long long)pow((long double)i, (long double)n) == 0)... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 990,504 | 990,505 | u636608553 | cpp |
p03196 | #include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
using namespace std;
int main() {
long long n, p;
cin >> n >> p;
long long num = p;
map<long long, long long> T;
for (long long i = 2; i * i <= sqrt(p); i++) {
if (num % i != 0) {
continue;
}
long long count = 0;
w... | #include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
using namespace std;
int main() {
long long n, p;
cin >> n >> p;
long long num = p;
map<long long, long long> T;
for (long long i = 2; i * i <= p; i++) {
if (num % i != 0) {
continue;
}
long long count = 0;
while (... | [
"control_flow.loop.for.condition.change",
"call.remove",
"call.arguments.change"
] | 990,531 | 990,532 | u418879326 | cpp |
p03196 | #include <bits/stdc++.h>
using namespace std;
struct edge {
int to; // 辺の行き先
int weight; // 辺の重み
edge(int t, int w) : to(t), weight(w) {}
};
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define brep(n) for (int bit = 0; bit < (1 << n); bit++)
#define erep(i, containe... | #include <bits/stdc++.h>
using namespace std;
struct edge {
int to; // 辺の行き先
int weight; // 辺の重み
edge(int t, int w) : to(t), weight(w) {}
};
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define brep(n) for (int bit = 0; bit < (1 << n); bit++)
#define erep(i, containe... | [
"call.add",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 990,533 | 990,534 | u539011156 | cpp |
p03196 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define FOR(i, b, n) for (ll i = b; i < n; ++i)
using namespace std;
using ll = long long;
void solve(ll N, ll P) {
unordered_map<ll, ll> yakusu;
FOR(i, 2, sqrt(P)) {
while (P % i == 0) {
yakusu[i]++;
P /= i;
}
}
if (P !... | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define FOR(i, b, n) for (ll i = b; i <= n; ++i)
using namespace std;
using ll = long long;
void solve(ll N, ll P) {
unordered_map<ll, ll> yakusu;
FOR(i, 2, sqrt(P)) {
while (P % i == 0) {
yakusu[i]++;
P /= i;
}
}
if (P ... | [
"expression.operator.compare.change",
"preprocessor.define.value.change"
] | 990,547 | 990,548 | u280941196 | cpp |
p03196 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
template <typename T> vector<pair<T, T>> prime_factor(T n) {
vector<pair<T, T>> ret;
for (T i = 2; i * i <= n; i++) {
T tmp = 0;
while (n % i == 0) {
tmp++;
n /= i;
}
ret.push_back(make_pair(i, tm... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
template <typename T> vector<pair<T, T>> prime_factor(T n) {
vector<pair<T, T>> ret;
for (T i = 2; i * i <= n; i++) {
T tmp = 0;
while (n % i == 0) {
tmp++;
n /= i;
}
ret.push_back(make_pair(i, tm... | [
"call.add",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 990,549 | 990,550 | u815026012 | cpp |
p03196 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define MOD 1000000007
const int INF = 1LL << 30;
vector<pair<long long, long long>> prime_factorize(long long n) {
vector<pair<long long, long long>> res;
for (long... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define MOD 1000000007
const int INF = 1LL << 30;
vector<pair<long long, long long>> prime_factorize(long long n) {
vector<pair<long long, long long>> res;
for (long... | [
"call.add",
"assignment.value.change",
"expression.operation.binary.change"
] | 990,571 | 990,572 | u633967774 | cpp |
p03196 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define MOD 1000000007
const int INF = 1LL << 30;
vector<pair<long long, long long>> prime_factorize(long long n) {
vector<pair<long long, long long>> res;
for (long... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define MOD 1000000007
const int INF = 1LL << 30;
vector<pair<long long, long long>> prime_factorize(long long n) {
vector<pair<long long, long long>> res;
for (long... | [
"call.add",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 990,573 | 990,572 | u633967774 | cpp |
p03196 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_s... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_s... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 990,589 | 990,590 | u370785250 | cpp |
p03196 | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Graph =... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Graph =... | [
"call.add",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 990,591 | 990,592 | u266874640 | cpp |
p03196 | #include <bits/stdc++.h>
using namespace std;
template <class T> vector<pair<T, T>> prime_factorization(T n) {
vector<pair<T, T>> ret;
for (T i = 2; i * i <= n; i++) {
T cnt = 0;
while (n % i == 0) {
n /= i;
cnt++;
}
if (cnt != 0)
ret.emplace_back(i, cnt);
}
if (n != 1)
re... | #include <bits/stdc++.h>
using namespace std;
template <class T> vector<pair<T, T>> prime_factorization(T n) {
vector<pair<T, T>> ret;
for (T i = 2; i * i <= n; i++) {
T cnt = 0;
while (n % i == 0) {
n /= i;
cnt++;
}
if (cnt != 0)
ret.emplace_back(i, cnt);
}
if (n != 1)
re... | [
"call.add",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 990,597 | 990,598 | u666049605 | cpp |
p03196 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
vector<pair<ll, ll>> prime_factorize(ll N) {
vector<pair<ll, ll>> ret;
for (ll a = 2; a * a <= N; a++) {
if (N % a != 0)
continue;
ll ex = 0;
while (N ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
vector<pair<ll, ll>> prime_factorize(ll N) {
vector<pair<ll, ll>> ret;
for (ll a = 2; a * a <= N; a++) {
if (N % a != 0)
continue;
ll ex = 0;
while (N ... | [
"call.add",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 990,608 | 990,609 | u893584578 | cpp |
p03196 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, P;
cin >> N >> P;
map<long long, long long> mp;
for (long long i = 2; i * i < P; i++) {
while (P % i == 0) {
mp[i]++;
P /= i;
}
}
if (P != 1)
mp[P]++;
long long ans = 1;
for (auto it = mp.begin(); it != mp.... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, P;
cin >> N >> P;
map<long long, long long> mp;
for (long long i = 2; i * i <= P; i++) {
while (P % i == 0) {
mp[i]++;
P /= i;
}
}
if (P != 1)
mp[P]++;
long long ans = 1;
for (auto it = mp.begin(); it != mp... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 990,623 | 990,624 | u987039629 | cpp |
p03196 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define reps(i, n) for (int i = 1; i <=... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define reps(i, n) for (int i = 1; i <=... | [
"call.add",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 990,627 | 990,628 | u238205921 | cpp |
p03196 | // 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 REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i,... | // 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 REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i,... | [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove",
"expression.operation.binary.change"
] | 990,643 | 990,644 | u683769494 | cpp |
p03196 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, p;
cin >> n >> p;
ll ans = 1;
ll div = 2;
if (n == 1) {
ans = p;
} else {
while (p > pow(div, n)) {
ll m = 0;
while (p % div == 0) {
m++;
p = p / div;
}
if (m >= n)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, p;
cin >> n >> p;
ll ans = 1;
ll div = 2;
if (n == 1) {
ans = p;
} else {
while (p >= pow(div, n)) {
ll m = 0;
while (p % div == 0) {
m++;
p = p / div;
}
if (m >= n)
... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 990,645 | 990,646 | u732578115 | cpp |
p03196 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define vi vector<int>
#define all(x) (x).begin(), (x).end()
#define INF (1 << 30) - 1
using ll = long long;
using namespace std;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template <class T> inline bool chmax(T &a, const T... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define vi vector<int>
#define all(x) (x).begin(), (x).end()
#define INF (1 << 30) - 1
using ll = long long;
using namespace std;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template <class T> inline bool chmax(T &a, const T... | [
"call.add",
"assignment.value.change",
"expression.operation.binary.change"
] | 990,663 | 990,664 | u667375816 | cpp |
p03196 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define vi vector<int>
#define all(x) (x).begin(), (x).end()
#define INF (1 << 30) - 1
using ll = long long;
using namespace std;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template <class T> inline bool chmax(T &a, const T... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define vi vector<int>
#define all(x) (x).begin(), (x).end()
#define INF (1 << 30) - 1
using ll = long long;
using namespace std;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template <class T> inline bool chmax(T &a, const T... | [
"call.add",
"assignment.value.change",
"expression.operation.binary.change",
"identifier.replace.add",
"literal.replace.remove"
] | 990,665 | 990,664 | u667375816 | cpp |
p03196 | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX // 9223372036854775807
#define EPS 1e-9
#define rep(i, n) for (ll i = 0, i##_len = (ll)(n); i < i##_len; i++)
#define repf(i, n) for (ll i = 1, i##_len = (ll)(n + 1); i < i##_len; i++)
#define all(v) v.begin(), v.end()
#define... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX // 9223372036854775807
#define EPS 1e-9
#define rep(i, n) for (ll i = 0, i##_len = (ll)(n); i < i##_len; i++)
#define repf(i, n) for (ll i = 1, i##_len = (ll)(n + 1); i < i##_len; i++)
#define all(v) v.begin(), v.end()
#define... | [
"call.add",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 990,666 | 990,667 | u548791035 | cpp |
p03196 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, P, p, tmp, res = 1;
cin >> N >> P;
if (N == 1) {
cout << P << endl;
return 0;
}
vector<pair<int, int>> D(0);
p = P;
for (int i = 2; i <= sqrt(P); i++) {
if (p == 1)
break;
if (p % i == 0) {
if (D.size() > 0 ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, P, p, tmp, res = 1;
cin >> N >> P;
if (N == 1) {
cout << P << endl;
return 0;
}
vector<pair<int, int>> D(0);
p = P;
for (int i = 2; i <= sqrt(P); i++) {
if (p == 1)
break;
if (p % i == 0) {
if (D.size() > 0 ... | [
"call.add",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 990,670 | 990,671 | u543466827 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.