problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p02975 | #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for (LL i = (l); i < (r); ++i)
#define incII(i, l, r) for (LL i = (l); i <= (r); ++i)
#define decID(i, l, r) for (LL i = (r)-1; i >= (l); --i)
#define decII(i, l, r) for (LL i = (r); ... | #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for (LL i = (l); i < (r); ++i)
#define incII(i, l, r) for (LL i = (l); i <= (r); ++i)
#define decID(i, l, r) for (LL i = (r)-1; i >= (l); --i)
#define decII(i, l, r) for (LL i = (r); ... | [
"expression.operation.binary.remove"
] | 783,015 | 783,014 | u568652083 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
int n;
cin >> n;
int a[n];
map<int, int> m;
rep(i, n) {
cin >> a[i];
m[a[i]]++;
}
if (m.size() == 1) {
if (m[0])
cout << "Yes" << endl;
else
cout << "No" << endl;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
int n;
cin >> n;
int a[n];
map<int, int> m;
rep(i, n) {
cin >> a[i];
m[a[i]]++;
}
if (m.size() == 1) {
if (m[0])
cout << "Yes" << endl;
else
cout << "No" << endl;
... | [
"control_flow.branch.if.condition.change"
] | 783,018 | 783,019 | u970690920 | cpp |
p02975 | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const long long int INF = 99999999999999;
const long long int mod = 1000000007... | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const long long int INF = 99999999999999;
const long long int mod = 1000000007... | [
"literal.string.change",
"io.output.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 783,020 | 783,021 | u018872912 | cpp |
p02975 | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const long long int INF = 99999999999999;
const long long int mod = 1000000007... | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const long long int INF = 99999999999999;
const long long int mod = 1000000007... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 783,022 | 783,021 | u018872912 | cpp |
p02975 | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const long long int INF = 99999999999999;
const long long int mod = 1000000007... | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const long long int INF = 99999999999999;
const long long int mod = 1000000007... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 783,023 | 783,021 | u018872912 | cpp |
p02975 | /* ---------- STL Libraries ---------- */
// IO library
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm library
#include <algorithm>
#include <cmath>
#include <cstring>
#include <numeric>
#include <random>
// container library
#include <array>
#include <bitset>
... | /* ---------- STL Libraries ---------- */
// IO library
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm library
#include <algorithm>
#include <cmath>
#include <cstring>
#include <numeric>
#include <random>
// container library
#include <array>
#include <bitset>
... | [
"control_flow.branch.if.condition.change"
] | 783,026 | 783,025 | u853132965 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, N) for (i = 0; i < N; i++)
int main() {
ll i, N, c = 0;
cin >> N;
vector<ll> x(N);
rep(i, N) cin >> x[i];
sort(x.begin(), x.end());
if (N % 3 == 0 && x[0] ^ x[N / 3] ^ x[N - 1] == 0 && x[0] == x[N / 3 - 1] &&
x[N / 3] ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, N) for (i = 0; i < N; i++)
int main() {
ll i, N, c = 0;
cin >> N;
vector<ll> x(N);
rep(i, N) cin >> x[i];
sort(x.begin(), x.end());
if (N % 3 == 0 && (x[0] ^ x[N / 3] ^ x[N - 1]) == 0 && x[0] == x[N / 3 - 1] &&
x[N / 3... | [
"control_flow.branch.if.condition.change"
] | 783,029 | 783,030 | u251847465 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, N) for (i = 0; i < N; i++)
int main() {
ll i, N, c = 0;
cin >> N;
vector<int> x(N);
rep(i, N) cin >> x[i];
sort(x.begin(), x.end());
if (N % 3 == 0 && x[0] ^ x[N / 3] ^ x[N - 1] == 0 && x[0] == x[N / 3 - 1] &&
x[N / 3]... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, N) for (i = 0; i < N; i++)
int main() {
ll i, N, c = 0;
cin >> N;
vector<ll> x(N);
rep(i, N) cin >> x[i];
sort(x.begin(), x.end());
if (N % 3 == 0 && (x[0] ^ x[N / 3] ^ x[N - 1]) == 0 && x[0] == x[N / 3 - 1] &&
x[N / 3... | [
"control_flow.branch.if.condition.change"
] | 783,031 | 783,030 | u251847465 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, N) for (i = 0; i < N; i++)
int main() {
ll i, N, c = 0;
cin >> N;
vector<int> x(N);
rep(i, N) cin >> x[i];
sort(x.begin(), x.end());
if (N % 3 == 0 && x[0] ^ x[N / 3] ^ x[N - 1] == 0 && x[0] == x[N / 3 - 1] &&
x[N / 3]... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, N) for (i = 0; i < N; i++)
int main() {
ll i, N, c = 0;
cin >> N;
vector<ll> x(N);
rep(i, N) cin >> x[i];
sort(x.begin(), x.end());
if (N % 3 == 0 && (x[0] ^ x[N / 3] ^ x[N - 1]) == 0 && x[0] == x[N / 3 - 1] &&
x[N / 3... | [
"control_flow.branch.if.condition.change"
] | 783,032 | 783,030 | u251847465 | cpp |
p02975 | #include <algorithm>
#include <cmath>
#include <functional>
#include <stdio.h>
using namespace std;
long long mod = 1000000007;
long long a[100000];
int main() {
int N;
int count = 1;
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%lld", &a[i]);
}
sort(a, a + N);
long long number = a[0];
long... | #include <algorithm>
#include <cmath>
#include <functional>
#include <stdio.h>
using namespace std;
long long mod = 1000000007;
long long a[100000];
int main() {
int N;
int count = 1;
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%lld", &a[i]);
}
sort(a, a + N);
long long number = a[0];
long... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 783,039 | 783,040 | u475843109 | cpp |
p02975 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); ... | [
"control_flow.branch.if.condition.change"
] | 783,041 | 783,042 | u917282863 | cpp |
p02975 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); ... | [
"control_flow.branch.if.condition.change"
] | 783,043 | 783,044 | u917282863 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(a) (a).begin(), (a).end()
#define ll long long
int main() {
int N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
sort(all(A));
ll X[3] = {};
int j = 0;
rep(i, N) {
if (i)
if (A[i] != A... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(a) (a).begin(), (a).end()
#define ll long long
int main() {
int N;
cin >> N;
vector<int> A(N);
rep(i, N) cin >> A[i];
sort(all(A));
int X[3] = {};
int j = 0;
rep(i, N) {
if (i)
if (A[i] !=... | [
"variable_declaration.type.change",
"control_flow.branch.if.condition.change"
] | 783,051 | 783,052 | u154756110 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(a) (a).begin(), (a).end()
#define ll long long
int main() {
int N;
cin >> N;
vector<int> A(N);
rep(i, N) cin >> A[i];
sort(all(A));
ll X[3] = {};
int j = 0;
rep(i, N) {
if (i)
if (A[i] != ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(a) (a).begin(), (a).end()
#define ll long long
int main() {
int N;
cin >> N;
vector<int> A(N);
rep(i, N) cin >> A[i];
sort(all(A));
int X[3] = {};
int j = 0;
rep(i, N) {
if (i)
if (A[i] !=... | [
"variable_declaration.type.change",
"control_flow.branch.if.condition.change"
] | 783,053 | 783,052 | u154756110 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(a) (a).begin(), (a).end()
#define ll long long
int main() {
int N;
cin >> N;
vector<int> A(N);
rep(i, N) cin >> A[i];
sort(all(A));
int X[3] = {};
int j = 0;
rep(i, N) {
if (i)
if (A[i] !=... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(a) (a).begin(), (a).end()
#define ll long long
int main() {
int N;
cin >> N;
vector<int> A(N);
rep(i, N) cin >> A[i];
sort(all(A));
int X[3] = {};
int j = 0;
rep(i, N) {
if (i)
if (A[i] !=... | [
"control_flow.branch.if.condition.change"
] | 783,054 | 783,052 | u154756110 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll inf = numeric_limits<ll>::max() / 3;
const ll mod = 1e9 + 7;
int main(void) {
int n;
map<ll, ll> a;
cin >> n;
for (int i = 0; i < n; ++i) {
ll tmp;
cin >> tmp;
a[tmp]++;
}
vector<pair<ll, ll>> calc;
for (auto p : a) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll inf = numeric_limits<ll>::max() / 3;
const ll mod = 1e9 + 7;
int main(void) {
int n;
map<ll, ll> a;
cin >> n;
for (int i = 0; i < n; ++i) {
ll tmp;
cin >> tmp;
a[tmp]++;
}
vector<pair<ll, ll>> calc;
for (auto p : a) ... | [
"control_flow.branch.if.condition.change"
] | 783,057 | 783,058 | u488078009 | cpp |
p02975 | #include <bits/stdc++.h>
using namespace std;
bool solve(vector<int> A, long long N) {
for (long long i = 0; i < 3; i++) {
long long check = A[i * (N / 3)];
for (long long j = 0; j < (N / 3); j++) {
if (A[i * (N / 3) + j] != check)
return false;
}
}
if (A[1 * (N / 3)] ^ A[2 * (N / 3)] =... | #include <bits/stdc++.h>
using namespace std;
bool solve(vector<int> A, long long N) {
for (long long i = 0; i < 3; i++) {
long long check = A[i * (N / 3)];
for (long long j = 0; j < (N / 3); j++) {
if (A[i * (N / 3) + j] != check)
return false;
}
}
if ((A[1 * (N / 3)] ^ A[2 * (N / 3)])... | [
"control_flow.branch.if.condition.change"
] | 783,061 | 783,062 | u570018655 | cpp |
p02975 | //#pragma GCC optimize ("-O3","unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#includ... | //#pragma GCC optimize ("-O3","unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#includ... | [
"expression.unary.arithmetic.add"
] | 783,063 | 783,064 | u859396346 | cpp |
p02976 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> pll;
typedef vector<bool> vb;
const ll oo = 0x3f3f3f3f3f3f3f3f;
const double eps = 1e-9;
#define sz(c) ll((c).size())
#define all(c) begin(c), end(c)
#define FOR(i, a, b) for (ll i = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> pll;
typedef vector<bool> vb;
const ll oo = 0x3f3f3f3f3f3f3f3f;
const double eps = 1e-9;
#define sz(c) ll((c).size())
#define all(c) begin(c), end(c)
#define FOR(i, a, b) for (ll i = ... | [
"identifier.change",
"io.output.change"
] | 783,072 | 783,073 | u091970605 | cpp |
p02976 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#ifdef iq
mt19937 rnd(228);
#else
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
#endif
bool f[200000];
vector<int> ans1, ans2, ans3;
vector<int> s[200000], g[200000];
int t, n, m, i, x, y;
int p(int v) {
vector<in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#ifdef iq
mt19937 rnd(228);
#else
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
#endif
bool f[200000];
vector<int> ans1, ans2, ans3;
vector<int> s[200000], g[200000];
int t, n, m, i, x, y;
int p(int v) {
vector<in... | [
"literal.string.change",
"io.output.change",
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 783,074 | 783,075 | u814534994 | cpp |
p02977 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
using namespace std;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef long long ll;
template <typename _T> inline void read(_T &f) {
f = 0;
_T fu = 1;
char c = getchar(... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
using namespace std;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef long long ll;
template <typename _T> inline void read(_T &f) {
f = 0;
_T fu = 1;
char c = getchar(... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 783,097 | 783,098 | u087020019 | cpp |
p02977 | #include <bits/stdc++.h>
#define PB push_back
#define MP std::make_pair
#define FI first
#define SE second
#define M 1000005
#define INF 1000000000
int n;
int read() {
char c = getchar();
int ans = 0;
while (c < '0' || c > '9')
c = getchar();
while (c >= '0' && c <= '9')
ans = ans * 10 + c - '0', c = ge... | #include <bits/stdc++.h>
#define PB push_back
#define MP std::make_pair
#define FI first
#define SE second
#define M 1000005
#define INF 1000000000
int n;
int read() {
char c = getchar();
int ans = 0;
while (c < '0' || c > '9')
c = getchar();
while (c >= '0' && c <= '9')
ans = ans * 10 + c - '0', c = ge... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"function.return_value.change",
"io.output.change"
] | 783,099 | 783,100 | u281390654 | cpp |
p02977 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define rep(i, l, r) for (int i = (l); i <= (r); ++i)
#define per(i, r, l) for (int i = (r); i >= (l); --i)
using namespace ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define rep(i, l, r) for (int i = (l); i <= (r); ++i)
#define per(i, r, l) for (int i = (r); i >= (l); --i)
using namespace ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 783,118 | 783,119 | u058113228 | cpp |
p02977 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
#define int long long
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
#define ic(n) ... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
#define int long long
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
#define ic(n) ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 783,132 | 783,133 | u942393279 | cpp |
p02977 | #include <bits/stdc++.h>
#define fo(a, b, c) for (a = b; a <= c; a++)
#define fd(a, b, c) for (a = b; a >= c; a--)
#define ll long long
//#define file
using namespace std;
int n, i, j, k, l, x;
int jh(int t, int x, int y) { return t == x ? y : (t == y ? x : t); }
int main() {
#ifdef file
freopen("agc035c.in", "r", ... | #include <bits/stdc++.h>
#define fo(a, b, c) for (a = b; a <= c; a++)
#define fd(a, b, c) for (a = b; a >= c; a--)
#define ll long long
//#define file
using namespace std;
int n, i, j, k, l, x;
int jh(int t, int x, int y) { return t == x ? y : (t == y ? x : t); }
int main() {
#ifdef file
freopen("agc035c.in", "r", ... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 783,162 | 783,163 | u741056329 | cpp |
p02977 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if ((1 << (int)log2(n)) == n)
return puts("NO"), 0;
puts("YES"), printf("1 2\n2 3\n3 %d\n%d %d\n%d %d\n", n + 1, n + 1, n + 2,
n + 2, n + 3);
for (int i = 4; i < n; i += 2)
printf("%d %d\n%d %d\n%d %d\n%d... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if ((1 << (int)log2(n)) == n)
return puts("No"), 0;
puts("Yes"), printf("1 2\n2 3\n3 %d\n%d %d\n%d %d\n", n + 1, n + 1, n + 2,
n + 2, n + 3);
for (int i = 4; i < n; i += 2)
printf("%d %d\n%d %d\n%d %d\n%d... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"function.return_value.change",
"io.output.change"
] | 783,183 | 783,184 | u030939205 | cpp |
p02977 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if ((1 << (int)log2(n)) == n)
return puts("NO"), 0;
puts("YES"), printf("1 2\n2 3\n3 %d\n%d %d\n%d %d\n", n + 1, n + 1, n + 2,
n + 2, n + 3);
for (int i = 4; i < n; i += 2)
printf("%d %d\n%d %d\n%d %d\n%d... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if ((1 << (int)log2(n)) == n)
return puts("No"), 0;
puts("Yes"), printf("1 2\n2 3\n3 %d\n%d %d\n%d %d\n", n + 1, n + 1, n + 2,
n + 2, n + 3);
for (int i = 4; i < n; i += 2)
printf("%d %d\n%d %d\n%d %d\n%d... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"function.return_value.change",
"io.output.change"
] | 783,185 | 783,184 | u030939205 | cpp |
p02977 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if ((1 << (int)log2(n)) == n)
return puts("NO"), 0;
puts("YES"), printf("1 2\n2 3\n3 %d\n%d %d\n%d %d\n", n + 1, n + 1, n + 2,
n + 2, n + 3);
for (int i = 4; i < n; i += 2)
printf("%d %d\n%d %d\n%d %d\n%d... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if ((1 << (int)log2(n)) == n)
return puts("No"), 0;
puts("Yes"), printf("1 2\n2 3\n3 %d\n%d %d\n%d %d\n", n + 1, n + 1, n + 2,
n + 2, n + 3);
for (int i = 4; i < n; i += 2)
printf("%d %d\n%d %d\n%d %d\n%d... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"function.return_value.change",
"io.output.change",
"control_flow.branch.if.condition.change"
] | 783,186 | 783,184 | u030939205 | cpp |
p02977 | #include <algorithm>
#include <cstdio>
using namespace std;
void out(int u, int v) { printf("%d %d\n", u, v); }
int main() {
int n, tmp = 1;
scanf("%d", &n);
while (tmp <= n)
tmp <<= 1;
tmp >>= 1;
if (tmp == n)
return puts("NO"), 0;
puts("YES");
for (int i = 2; i <= n; i += 2) {
int u = i, ... | #include <algorithm>
#include <cstdio>
using namespace std;
void out(int u, int v) { printf("%d %d\n", u, v); }
int main() {
int n, tmp = 1;
scanf("%d", &n);
while (tmp <= n)
tmp <<= 1;
tmp >>= 1;
if (tmp == n)
return puts("No"), 0;
puts("Yes");
for (int i = 2; i < n; i += 2) {
int u = i, v... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"function.return_value.change",
"io.output.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 783,205 | 783,203 | u615698034 | cpp |
p02977 | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int n, m;
int main() {
scanf("%d", &n);
m = 1;
while (m - 1 <= n)
m <<= 1;
m >>= 1;
m--;
if (n == m + 1) {
printf("No\n");
return 0;
}
printf("Yes\n");
for (int i = 1; i < m; i++)
printf("%d %d\n%d %d\n", i,... | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int n, m;
int main() {
scanf("%d", &n);
m = 1;
while (m - 1 <= n)
m <<= 1;
m >>= 1;
m--;
if (n == m + 1 || n == 1) {
printf("No\n");
return 0;
}
printf("Yes\n");
for (int i = 1; i < m; i++)
printf("%d %d\n%d... | [
"control_flow.branch.if.condition.change"
] | 783,236 | 783,237 | u656762776 | cpp |
p02978 | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), ... | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), ... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.change"
] | 783,345 | 783,346 | u452725238 | cpp |
p02978 | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), ... | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.change"
] | 783,347 | 783,346 | u452725238 | cpp |
p02979 | #include <cstdio>
#include <cstring>
#include <iostream>
#define cri const int
#define ll long long
#define re register
using namespace std;
int N, K, mod;
int f[152][152];
inline int mo(cri x) { return x >= mod ? x - mod : x; }
inline void solve2() {
f[0][0] = f[1][0] = f[1][1] = f[2][0] = f[2][1] = 1;
K = (K >> 1... | #include <cstdio>
#include <cstring>
#include <iostream>
#define cri const int
#define ll long long
#define re register
using namespace std;
int N, K, mod;
int f[152][152];
inline int mo(cri x) { return x >= mod ? x - mod : x; }
inline void solve2() {
f[0][0] = f[1][0] = f[1][1] = f[2][0] = f[2][1] = 1;
K = (K >> 1... | [
"assignment.variable.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change"
] | 783,356 | 783,357 | u891122128 | cpp |
p02979 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <queue>
using namespace std;
int read() {
char c = getchar();
int res = 0;
while (c < '0' || c > '9')
c = getchar();
while (c >= '0' && c <= '9')
res = (res << 1) + (res << 3) + (c ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <queue>
using namespace std;
int read() {
char c = getchar();
int res = 0;
while (c < '0' || c > '9')
c = getchar();
while (c >= '0' && c <= '9')
res = (res << 1) + (res << 3) + (c ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 783,358 | 783,359 | u562042360 | cpp |
p02979 | #include <bits/stdc++.h>
using namespace std;
int n, k, m;
int s1(int n, int k) {
static int f[155];
f[0] = 1;
for (int i = 1; i <= n + 1; ++i) {
f[i] = 0;
for (int j = 0; j <= k; ++j)
if (i - j - 1 >= 0)
f[i] = (f[i] + f[i - j - 1]) % m;
}
return f[n + 1];
}
int s2(int n, int k) {
... | #include <bits/stdc++.h>
using namespace std;
int n, k, m;
int s1(int n, int k) {
static int f[155];
f[0] = 1;
for (int i = 1; i <= n + 1; ++i) {
f[i] = 0;
for (int j = 0; j <= k; ++j)
if (i - j - 1 >= 0)
f[i] = (f[i] + f[i - j - 1]) % m;
}
return f[n + 1];
}
int s2(int n, int k) {
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 783,360 | 783,361 | u863209865 | cpp |
p02979 | #include <bits/stdc++.h>
using namespace std;
int n, k, m;
int s1(int n, int k) {
static int f[155];
f[0] = 1;
for (int i = 1; i <= n + 1; ++i) {
f[i] = 0;
for (int j = 0; j <= k; ++j)
if (i - j - 1 >= 0)
f[i] = (f[i] + f[i - j - 1]) % m;
}
return f[n + 1];
}
int s2(int n, int k) {
... | #include <bits/stdc++.h>
using namespace std;
int n, k, m;
int s1(int n, int k) {
static int f[155];
f[0] = 1;
for (int i = 1; i <= n + 1; ++i) {
f[i] = 0;
for (int j = 0; j <= k; ++j)
if (i - j - 1 >= 0)
f[i] = (f[i] + f[i - j - 1]) % m;
}
return f[n + 1];
}
int s2(int n, int k) {
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 783,362 | 783,361 | u863209865 | cpp |
p02979 | #include <bits/stdc++.h>
using namespace std;
int n, k, m;
int s1(int n, int k) {
static int f[155];
f[0] = 1;
for (int i = 1; i <= n + 1; ++i) {
f[i] = 0;
for (int j = 0; j <= k; ++j)
if (i - j - 1 >= 0)
f[i] = (f[i] + f[i - j - 1]) % m;
}
return f[n + 1];
}
int s2(int n, int k) {
... | #include <bits/stdc++.h>
using namespace std;
int n, k, m;
int s1(int n, int k) {
static int f[155];
f[0] = 1;
for (int i = 1; i <= n + 1; ++i) {
f[i] = 0;
for (int j = 0; j <= k; ++j)
if (i - j - 1 >= 0)
f[i] = (f[i] + f[i - j - 1]) % m;
}
return f[n + 1];
}
int s2(int n, int k) {
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 783,363 | 783,361 | u863209865 | cpp |
p02979 | /*
Author: QAQAutomaton
Lang: C++
Code: E.cpp
Mail: lk@qaq-am.com
Blog: https://www.qaq-am.com/
*/
#include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define DEBUG printf("Passing [%s] in LINE %d\n", __FUNCTION__, __LINE__)
#define Debug debug("Passing [%s] in LINE %d\n", __FUNCTION__, __LINE__)
#... | /*
Author: QAQAutomaton
Lang: C++
Code: E.cpp
Mail: lk@qaq-am.com
Blog: https://www.qaq-am.com/
*/
#include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define DEBUG printf("Passing [%s] in LINE %d\n", __FUNCTION__, __LINE__)
#define Debug debug("Passing [%s] in LINE %d\n", __FUNCTION__, __LINE__)
#... | [
"type_conversion.add"
] | 783,364 | 783,365 | u228297051 | cpp |
p02979 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 160;
int n, k, mod, g[N][N], f[N][N][N];
int main() {
scanf("%d%d%d", &n, &k, &mod);
if (!(k & 1)) {
g[0][0] = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j <= i && j <= k >> 1; j++) {
g[i + 1][j + 1] = (g... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 160;
int n, k, mod, g[N][N], f[N][N][N];
int main() {
scanf("%d%d%d", &n, &k, &mod);
if (!(k & 1)) {
g[0][0] = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j <= i && j <= k >> 1; j++) {
g[i + 1][j + 1] = (g... | [
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 783,366 | 783,367 | u473087154 | cpp |
p02979 | #include <bits/stdc++.h>
using namespace std;
const int N = 101;
#define fr(i, a, b) for (int i = a; i <= b; ++i)
#define nfr(i, a, b) for (int i = a; i >= b; --i)
int f[2][N];
int g[2][N][N][N];
int n, K, m;
inline void add(int &x, int y) {
x += y;
if (x >= m)
x -= m;
}
int main() {
scanf("%d%d%d", &n, &K... | #include <bits/stdc++.h>
using namespace std;
const int N = 155;
#define fr(i, a, b) for (int i = a; i <= b; ++i)
#define nfr(i, a, b) for (int i = a; i >= b; --i)
int f[2][N];
int g[2][N][N][N];
int n, K, m;
inline void add(int &x, int y) {
x += y;
if (x >= m)
x -= m;
}
int main() {
scanf("%d%d%d", &n, &K... | [
"literal.number.change",
"variable_declaration.value.change"
] | 783,377 | 783,378 | u106671729 | cpp |
p02979 | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef long double louble;
template <typename T1, typename T2> inline T1 max(T1 a, T2 b) {
return a < b ? b : a;
}
template <typename T1, typename T2> inline T1 min(T1 a, T2 b) {
return a < b ? a : b;
}
namespace ae86 {
const int bufl = 1 << ... | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef long double louble;
template <typename T1, typename T2> inline T1 max(T1 a, T2 b) {
return a < b ? b : a;
}
template <typename T1, typename T2> inline T1 min(T1 a, T2 b) {
return a < b ? a : b;
}
namespace ae86 {
const int bufl = 1 << ... | [
"call.arguments.change",
"expression.operation.binary.remove"
] | 783,379 | 783,380 | u326034736 | cpp |
p02979 | #include <bits/stdc++.h>
const int N = 155;
int n, K, mo, f[N][N][N], i, j, k, ans, x, y;
inline void add(int &x, const int &y) {
x += y - mo;
x += x >> 31 & mo;
}
inline int calc(int n, int K) {
static int g[N][N];
memset(g, 0, sizeof g);
g[0][0] = 1;
for (i = 1; i <= n; ++i)
for (j = 0; j <= K; ++j) {... | #include <bits/stdc++.h>
const int N = 155;
int n, K, mo, f[N][N][N], i, j, k, ans, x, y;
inline void add(int &x, const int &y) {
x += y - mo;
x += x >> 31 & mo;
}
inline int calc(int n, int K) {
static int g[N][N];
memset(g, 0, sizeof g);
g[0][0] = 1;
for (i = 1; i <= n; ++i)
for (j = 0; j <= K; ++j) {... | [
"expression.operation.binary.remove"
] | 783,381 | 783,382 | u146586861 | cpp |
p02979 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
#define LL long long
#define LD long double
using namespace std;
const int NN = 200;
const int MM = +117;
int read() {
int fl = 1, x;
char c;
for (c = getchar(); (c ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
#define LL long long
#define LD long double
using namespace std;
const int NN = 200;
const int MM = +117;
int read() {
int fl = 1, x;
char c;
for (c = getchar(); (c ... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_declaration.array_dimensions.change"
] | 783,385 | 783,386 | u634654042 | cpp |
p02979 | #include <cstdio>
#include <iostream>
#define ll long long
using namespace std;
const int N = 360;
int mod;
inline void Add(int &x, int y) {
x += y;
if (x >= mod)
x -= mod;
}
int solve0(int n, int k) { // you can't choose k consecutive integers
static int f[N];
f[0] = 1;
for (int i = 1; i <= n + 1; ++i) {... | #include <cstdio>
#include <iostream>
#define ll long long
using namespace std;
const int N = 360;
int mod;
inline void Add(int &x, int y) {
x += y;
if (x >= mod)
x -= mod;
}
int solve0(int n, int k) { // you can't choose k consecutive integers
static int f[N];
f[0] = 1;
for (int i = 1; i <= n + 1; ++i) {... | [
"expression.operation.binary.add"
] | 783,389 | 783,390 | u973935896 | cpp |
p02980 | #include <bits/stdc++.h>
using namespace std;
long long n, m;
long long inv[100010];
long long qpow(long long a, long long b) {
long long ans = 1, base = a;
while (b) {
if (b & 1) {
ans *= base;
ans %= 998244353;
}
base *= base;
base %= 998244353;
b >>= 1;
}
return ans;
}
long lo... | #include <bits/stdc++.h>
using namespace std;
long long n, m;
long long inv[500010];
long long qpow(long long a, long long b) {
long long ans = 1, base = a;
while (b) {
if (b & 1) {
ans *= base;
ans %= 998244353;
}
base *= base;
base %= 998244353;
b >>= 1;
}
return ans;
}
long lo... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 783,393 | 783,394 | u727749587 | cpp |
p02980 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define MAXN 500006
#define P 998244353
int n, m;
int Pow(int x, int a) {
int ret = 1;
while (a) {
if (a & 1)
ret = 1ll * ret * x % P;
x = 1ll * x * x % P, a >>= 1;
}
return ret;
}
int J[MAXN], iJ[... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define MAXN 500006
#define P 998244353
int n, m;
int Pow(int x, int a) {
int ret = 1;
while (a) {
if (a & 1)
ret = 1ll * ret * x % P;
x = 1ll * x * x % P, a >>= 1;
}
return ret;
}
int J[MAXN], iJ[... | [
"expression.operation.binary.add"
] | 783,397 | 783,398 | u390140944 | cpp |
p02980 | #include <bits/stdc++.h>
#define int long long
const int mo = 998244353, N = 1e5 + 5;
int ksm(int a, int b) {
int ans = 1;
while (b) {
if (b & 1)
ans = ans * a % mo;
a = a * a % mo;
b >>= 1;
}
return ans;
}
int fac[N], inv[N], f[N];
int C(int a, int b) { return fac[a] * inv[b] % mo * inv[a - ... | #include <bits/stdc++.h>
#define int long long
const int mo = 998244353, N = 1e6 + 5;
int ksm(int a, int b) {
int ans = 1;
while (b) {
if (b & 1)
ans = ans * a % mo;
a = a * a % mo;
b >>= 1;
}
return ans;
}
int fac[N], inv[N], f[N];
int C(int a, int b) { return fac[a] * inv[b] % mo * inv[a - ... | [
"literal.number.change",
"expression.operation.binary.change"
] | 783,401 | 783,402 | u658406065 | cpp |
p02977 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<pair<int, int>> a(5);
for (int i = 0; i < 2; i++) {
a.at(i) = make_pair(i + 1, i + 2);
a.at(i + 3) = make_pair(i + N + 1, i + N + 2);
}
a.at(2) = make_pair(3, 1 + N);
if (N < 3) {
cout << "No" << endl;
} else ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<pair<int, int>> a(5);
for (int i = 0; i < 2; i++) {
a.at(i) = make_pair(i + 1, i + 2);
a.at(i + 3) = make_pair(i + N + 1, i + N + 2);
}
a.at(2) = make_pair(3, 1 + N);
if (N < 3) {
cout << "No" << endl;
} else ... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"identifier.change"
] | 783,451 | 783,450 | u222866518 | cpp |
p02977 | #include <algorithm>
#include <cstdio>
#include <set>
using namespace std;
typedef long long ll;
int n, m, k;
int main() {
scanf("%d", &n);
if (n & (n - 1) == 0) {
printf("No\n");
return 0;
}
printf("Yes\n");
printf("%d %d\n%d %d\n%d %d\n%d %d\n%d %d\n", n + 1, n + 2, n + 2, n + 3,
n + 3, 1,... | #include <algorithm>
#include <cstdio>
#include <set>
using namespace std;
typedef long long ll;
int n, m, k;
int main() {
scanf("%d", &n);
if ((n & (n - 1)) == 0) {
printf("No\n");
return 0;
}
printf("Yes\n");
printf("%d %d\n%d %d\n%d %d\n%d %d\n%d %d\n", n + 1, n + 2, n + 2, n + 3,
n + 3, ... | [
"control_flow.branch.if.condition.change"
] | 783,498 | 783,499 | u325423411 | cpp |
p02977 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define ub upper_bound
#define lb upper_bound
#define mp make_pair
#define F first
#define S second
#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()
#de... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define ub upper_bound
#define lb upper_bound
#define mp make_pair
#define F first
#define S second
#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()
#de... | [] | 783,529 | 783,530 | u764234894 | cpp |
p02977 | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 783,637 | 783,638 | u016572066 | cpp |
p02981 | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#inclu... | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#inclu... | [
"expression.operation.binary.remove"
] | 783,641 | 783,642 | u118868154 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, a, b;
cin >> N >> a >> b;
cout << min(N * a, N * b) << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, a, b;
cin >> N >> a >> b;
cout << min(N * a, b) << endl;
} | [
"expression.operation.binary.remove"
] | 783,645 | 783,646 | u401152875 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if (n * a <= n * b) {
cout << n * a;
} else {
cout << n * b;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if (n * a <= b) {
cout << n * a;
} else {
cout << b;
}
return 0;
}
| [
"expression.operation.binary.remove"
] | 783,647 | 783,648 | u746613804 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if (n * a >= n * b) {
cout << n * a;
} else {
cout << n * b;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if (n * a <= b) {
cout << n * a;
} else {
cout << b;
}
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 783,649 | 783,648 | u746613804 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(v) v.begin(), v.end()
int main() {
ll N, A, B;
cin >> N >> A >> B;
if (N * A > B) {
cout << N * A << endl;
} else {
cout << B << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(v) v.begin(), v.end()
int main() {
ll N, A, B;
cin >> N >> A >> B;
if (N * A < B) {
cout << N * A << endl;
} else {
cout << B << endl;
}
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 783,652 | 783,653 | u072293789 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
#define LL long long
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int n, a, b;
cin >> n >> a >> b;
cout << n * min(a, b);
} | #include <bits/stdc++.h>
using namespace std;
#define LL long long
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b);
} | [
"expression.operation.binary.remove"
] | 783,654 | 783,655 | u280859559 | cpp |
p02981 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep1(i, n) for (ll i = 1; i <... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep1(i, n) for (ll i = 1; i <... | [
"expression.operation.binary.remove"
] | 783,658 | 783,659 | u386131832 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << n * a + b << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b) << endl;
return 0;
} | [
"call.add",
"io.output.change",
"call.arguments.change"
] | 783,660 | 783,661 | u221391729 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, N;
cin >> A >> B >> N;
if (N * A > B) {
cout << B;
} else {
cout << N * A;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, N;
cin >> N >> A >> B;
if (N * A > B) {
cout << B;
} else {
cout << N * A;
}
return 0;
}
| [
"expression.operation.binary.remove"
] | 783,668 | 783,669 | u523119383 | cpp |
p02981 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, x, y;
cin >> n >> x >> y;
cout << min({n * x, n * y}) << endl;
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, x, y;
cin >> n >> x >> y;
cout << min({n * x, y}) << endl;
}
| [
"expression.operation.binary.remove"
] | 783,670 | 783,671 | u499138699 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set tree<int, null_type,less<int>,
// rb_tree_tag,tree_order_statistics_node_update>
#define FS ... | #include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set tree<int, null_type,less<int>,
// rb_tree_tag,tree_order_statistics_node_update>
#define FS ... | [
"expression.operation.binary.remove"
] | 783,672 | 783,673 | u293991054 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define endl "\n"
#define F(i, n) for (ll i = 0; i < n; i++)
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define repp(i, a, b) for (ll i = a; i >= b; i--)
#define fast \
ios_base::... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define endl "\n"
#define F(i, n) for (ll i = 0; i < n; i++)
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define repp(i, a, b) for (ll i = a; i >= b; i--)
#define fast \
ios_base::... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 783,674 | 783,675 | u603991349 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define endl "\n"
#define F(i, n) for (ll i = 0; i < n; i++)
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define repp(i, a, b) for (ll i = a; i >= b; i--)
#define fast \
ios_base::... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define endl "\n"
#define F(i, n) for (ll i = 0; i < n; i++)
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define repp(i, a, b) for (ll i = a; i >= b; i--)
#define fast \
ios_base::... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 783,676 | 783,675 | u603991349 | cpp |
p02981 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | [
"expression.operation.binary.remove"
] | 783,677 | 783,678 | u814715203 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (N * A > B) {
cout << N * A << endl;
} else {
cout << B << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (N * A > B) {
cout << B << endl;
} else {
cout << N * A << endl;
}
}
| [
"control_flow.branch.else.add"
] | 783,679 | 783,680 | u740002394 | cpp |
p02981 | #include <bits/stdc++.h>
#define cn count
#define pb push_back
#define in insert
#define fs first
#define sc second
#define sz size
#define len length
#define forn(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define forni(i, n) for (ll i = 1; i < (ll)(n); ++i)
#define IO ... | #include <bits/stdc++.h>
#define cn count
#define pb push_back
#define in insert
#define fs first
#define sc second
#define sz size
#define len length
#define forn(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define forni(i, n) for (ll i = 1; i < (ll)(n); ++i)
#define IO ... | [
"expression.operation.binary.remove"
] | 783,688 | 783,689 | u379682992 | cpp |
p02981 | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <tuple>
#include <unordered_map>
#include <vector>
// #include<bits/stdc++.h>
// #include "unionFind.h"
using namespace std;
#define ll long long
#d... | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <tuple>
#include <unordered_map>
#include <vector>
// #include<bits/stdc++.h>
// #include "unionFind.h"
using namespace std;
#define ll long long
#d... | [
"expression.operation.binary.remove"
] | 783,692 | 783,693 | u204970462 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int ans = min(n * a, b * n);
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int ans = min(n * a, b);
cout << ans << endl;
}
| [
"expression.operation.binary.remove"
] | 783,694 | 783,695 | u864785784 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int ans = min(a, b);
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int ans = min(n * a, b);
cout << ans << endl;
}
| [
"assignment.change"
] | 783,696 | 783,695 | u864785784 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << max(a * n, b) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a * n, b) << endl;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 783,703 | 783,704 | u769530239 | cpp |
p02981 | /*The woods are lovely, dark and deep,
But I have promises to keep,
And miles to go before I sleep,
And miles to go before I sleep.*/
// PRABHJOT SINGH A.K.A. PRABHI
//~~~~~conquizztador~~~~~
#include <bits/stdc++.h>
using namespace std;
using lli = long long int;
#define pb push_back
#define eb emplace_back
#define ... | /*The woods are lovely, dark and deep,
But I have promises to keep,
And miles to go before I sleep,
And miles to go before I sleep.*/
// PRABHJOT SINGH A.K.A. PRABHI
//~~~~~conquizztador~~~~~
#include <bits/stdc++.h>
using namespace std;
using lli = long long int;
#define pb push_back
#define eb emplace_back
#define ... | [
"expression.operation.binary.remove"
] | 783,705 | 783,706 | u217942651 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
int count = A * N;
if (count > B) {
cout << count << endl;
} else {
cout << B << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
int count = A * N;
if (count < B) {
cout << count << endl;
} else {
cout << B << endl;
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 783,707 | 783,708 | u431458875 | cpp |
p02981 | /*
* Author : Sadi
* Mon 06/07/2020
* 16:30:21.13
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#incl... | /*
* Author : Sadi
* Mon 06/07/2020
* 16:30:21.13
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#incl... | [
"expression.operation.binary.remove"
] | 783,709 | 783,710 | u055538052 | cpp |
p02981 | #include <algorithm>
#include <cctype>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int6... | #include <algorithm>
#include <cctype>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int6... | [
"expression.operation.binary.remove"
] | 783,711 | 783,712 | u379928983 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A * B < C) {
cout << C << endl;
} else {
cout << A * B << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A * B < C) {
cout << A * B << endl;
} else {
cout << C << endl;
}
}
| [
"control_flow.branch.else.add"
] | 783,713 | 783,714 | u425231382 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << max(a * b, c);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(a * b, c);
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 783,719 | 783,720 | u829521436 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define mod 1000000007
#define inf 1000000000000000
#define infty 1000000000000000000LL
#define md 998244353
#define PI acos(-1.0)
#define endl "\n"
#define rr return
#define br cout << "\n";
long long prime[1000000];
void sieve... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define mod 1000000007
#define inf 1000000000000000
#define infty 1000000000000000000LL
#define md 998244353
#define PI acos(-1.0)
#define endl "\n"
#define rr return
#define br cout << "\n";
long long prime[1000000];
void sieve... | [
"expression.operation.binary.remove"
] | 783,721 | 783,722 | u874915633 | cpp |
p02981 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if ((n * a) >= (n * b))
cout << (n * b);
else
cout << (n * a);
return 0;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if ((n * a) >= (b))
cout << b;
else
cout << (n * a);
return 0;
} | [
"expression.operation.binary.remove"
] | 783,728 | 783,729 | u128595605 | cpp |
p02981 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a, b, taku, den;
cin >> n >> a >> b;
den = n * a;
taku = n;
cout << min({taku, den}) << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a, b, taku, den;
cin >> n >> a >> b;
den = n * a;
taku = b;
cout << min({taku, den}) << endl;
} | [
"assignment.value.change",
"identifier.change"
] | 783,732 | 783,733 | u540695932 | cpp |
p02981 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int a, b, c, ans;
cin >> a >> b >> c;
ans = min(a * b, a * c);
cout << ans << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int a, b, c, ans;
cin >> a >> b >> c;
ans = min(a * b, c);
cout << ans << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 783,734 | 783,735 | u713617140 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A * B >= C) {
cout << A * B << endl;
} else {
cout << C << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A * B >= C) {
cout << C << endl;
} else {
cout << A * B << endl;
}
}
| [
"control_flow.branch.else.add"
] | 783,736 | 783,737 | u185806788 | cpp |
p02980 | // Have a nice day:)
#include <bits/stdc++.h>
using namespace std;
#define LL long long
inline int read();
const int maxn = 5e5 + 5;
const int mod = 998244353;
int n, m, ans;
int fac[maxn], inv[maxn];
int Pow(int a, int b) {
int u = 1;
for (; b; b >>= 1, a = 1ll * a * a % mod)
if (b & 1)
u = 1ll * u * ... | // Have a nice day:)
#include <bits/stdc++.h>
using namespace std;
#define LL long long
inline int read();
const int maxn = 5e5 + 5;
const int mod = 998244353;
int n, m, ans;
int fac[maxn], inv[maxn];
int Pow(int a, int b) {
int u = 1;
for (; b; b >>= 1, a = 1ll * a * a % mod)
if (b & 1)
u = 1ll * u * ... | [
"call.arguments.change"
] | 783,749 | 783,750 | u724263602 | cpp |
p02981 | #include <algorithm>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, n;
cin >> n >> a >> b;
if (a > n * b)
cou... | #include <algorithm>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, n;
cin >> n >> b >> a;
if (a > n * b)
cou... | [
"expression.operation.binary.remove"
] | 783,758 | 783,759 | u000113982 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if (n * a < n * b)
cout << n * a << endl;
else
cout << n * b << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if (n * a < b)
cout << n * a << endl;
else
cout << b << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 783,760 | 783,761 | u018679195 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (N * A > B) {
cout << N * A << endl;
} else {
cout << B << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (N * A > B) {
cout << B << endl;
} else {
cout << N * A << endl;
}
}
| [
"control_flow.branch.else.add"
] | 783,764 | 783,765 | u308463793 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<vl> vvl;
double EPS = 1e-9;
int INF = 1000000005;
l... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<vl> vvl;
double EPS = 1e-9;
int INF = 1000000005;
l... | [
"expression.operation.binary.remove"
] | 783,766 | 783,767 | u040094338 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
vector<int> forintinput(int n) {
vector<int> x;
for (int i = 0; i < n; i++) {
int ia;
cin >> ia;
x.push_back(ia);
}
return x;
}
int main() {
int n, a, b;
cin >> n >> a >> b;
if (a * n >= b) {
cout << b << endl;
} else {
cout << a << endl... | #include <bits/stdc++.h>
using namespace std;
vector<int> forintinput(int n) {
vector<int> x;
for (int i = 0; i < n; i++) {
int ia;
cin >> ia;
x.push_back(ia);
}
return x;
}
int main() {
int n, a, b;
cin >> n >> a >> b;
if (a * n >= b) {
cout << b << endl;
} else {
cout << a * n << ... | [
"expression.operation.binary.add"
] | 783,776 | 783,777 | u025223061 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
vector<int> forintinput(int n) {
vector<int> x;
for (int i = 0; i < n; i++) {
int ia;
cin >> ia;
x.push_back(ia);
}
return x;
}
int main() {
int n, a, b;
cin >> n >> a >> b;
if (a * n <= b) {
cout << b << endl;
} else {
cout << a << endl... | #include <bits/stdc++.h>
using namespace std;
vector<int> forintinput(int n) {
vector<int> x;
for (int i = 0; i < n; i++) {
int ia;
cin >> ia;
x.push_back(ia);
}
return x;
}
int main() {
int n, a, b;
cin >> n >> a >> b;
if (a * n >= b) {
cout << b << endl;
} else {
cout << a * n << ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 783,778 | 783,777 | u025223061 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
cout << (N * A > B ? N * A : B) << endl;
} | #include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
cout << (N * A > B ? B : N * A) << endl;
} | [] | 783,785 | 783,786 | u449415671 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, n * b) << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b) << '\n';
return 0;
} | [
"expression.operation.binary.remove"
] | 783,789 | 783,790 | u712429027 | cpp |
p02981 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n, a, b;
cin >> n >> a >> b;
if (n * a > b) {
cout << n * a << endl;
} else {
cout << b << endl;
}
}
| #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n, a, b;
cin >> n >> a >> b;
if (n * a > b) {
cout << b << endl;
} else {
cout << n * a << endl;
}
}
| [
"control_flow.branch.else.add"
] | 783,791 | 783,792 | u325443482 | cpp |
p02981 | #include <stdio.h>
int main() {
int a, b, c;
scanf("%d %d", &a, &b, &c);
int trip = a * b;
if (trip <= c) {
printf("%d\n", trip);
}
else {
printf("%d\n", c);
}
return 0;
} | #include <stdio.h>
int main() {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
int trip = a * b;
if (trip <= c) {
printf("%d\n", trip);
}
else {
printf("%d\n", c);
}
return 0;
} | [
"literal.string.change",
"call.arguments.change"
] | 783,793 | 783,794 | u353919145 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (N * A >= B) {
cout << "B" << endl;
} else {
cout << "A" << endl;
}
}
| #include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (N * A >= B) {
cout << B << endl;
} else {
cout << N * A << endl;
}
}
| [
"io.output.change"
] | 783,801 | 783,802 | u312172322 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if (n * a >= b)
cout << n * a << endl;
else
cout << b << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if (n * a >= b)
cout << b << endl;
else
cout << n * a << endl;
}
| [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"control_flow.branch.else.remove"
] | 783,803 | 783,804 | u596234104 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
int ans = max(B, N * A);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
int ans = min(B, N * A);
cout << ans << endl;
} | [
"misc.opposites",
"identifier.change",
"call.function.change"
] | 783,805 | 783,806 | u615258936 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, n * b) << "\n";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int t = 1;
while (t--) {
solve();
}
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b) << "\n";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int t = 1;
while (t--) {
solve();
}
}
| [
"expression.operation.binary.remove"
] | 783,809 | 783,810 | u839715645 | cpp |
p02981 | /*
ID: anonymo14
TASK: wormhole
LANG: C++
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int, int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#d... | /*
ID: anonymo14
TASK: wormhole
LANG: C++
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int, int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#d... | [
"expression.operation.binary.remove"
] | 783,811 | 783,812 | u455371217 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << max(a * n, b) << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a * n, b) << endl;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 783,813 | 783,814 | u897135531 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace ::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream &operator>>(istream &I, vector<T> &v) {
for (T &e : v)
I >> e;
return I;
}
template <class T>... | #include <bits/stdc++.h>
using namespace ::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream &operator>>(istream &I, vector<T> &v) {
for (T &e : v)
I >> e;
return I;
}
template <class T>... | [
"expression.operation.binary.remove"
] | 783,815 | 783,816 | u093681822 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.