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 |
|---|---|---|---|---|---|---|---|
p02981 | #include <stdio.h>
int main(int argc, char const *argv[]) {
int a, b, n;
scanf("%d", &n);
scanf("%d", &a);
scanf("%d", &b);
int min;
if (a <= b) {
printf("%d\n", n * a);
} else {
printf("%d\n", n * b);
}
return 0;
} | #include <stdio.h>
int main(int argc, char const *argv[]) {
int a, b, n;
scanf("%d", &n);
scanf("%d", &a);
scanf("%d", &b);
int min;
if (n * a <= b) {
printf("%d\n", n * a);
} else {
printf("%d\n", b);
}
return 0;
} | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 784,249 | 784,250 | u090091127 | cpp |
p02981 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << max(n * a, b);
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b);
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 784,253 | 784,254 | u904019018 | cpp |
p02981 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
#define INF 1001001001
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
#define INF 1001001001
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long... | [
"io.output.change",
"io.output.newline.add"
] | 784,260 | 784,261 | u971166345 | cpp |
p02976 | #include <cctype>
#include <cstdio>
#define RI register int
#define CI const int &
#define Tp template <typename T>
using namespace std;
const int N = 100005;
struct edge {
int to, nxt, id;
} e[N << 1];
int head[N], n, cnt, m, x[N], y[N], out[N], ansx[N], ansy[N], anc[N];
bool vis[N], cs[N];
class FileInputOutput {
p... | #include <cctype>
#include <cstdio>
#define RI register int
#define CI const int &
#define Tp template <typename T>
using namespace std;
const int N = 100005;
struct edge {
int to, nxt, id;
} e[N << 1];
int head[N], n, cnt, m, x[N], y[N], out[N], ansx[N], ansy[N], anc[N];
bool vis[N], cs[N];
class FileInputOutput {
p... | [
"expression.operation.binary.remove",
"identifier.change",
"call.arguments.change"
] | 784,275 | 784,276 | u803115645 | cpp |
p02976 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define FOR(i, a, b) for (ll i = (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define FOR(i, a, b) for (ll i = (... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 784,294 | 784,295 | u432688695 | cpp |
p02976 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 784,296 | 784,297 | u900727536 | cpp |
p02976 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef double db;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
#define pb push_back
#define mp make_pair
#define MAX 1000000
#define mod 100... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef double db;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
#define pb push_back
#define mp make_pair
#define MAX 1000000
#define mod 100... | [
"expression.operation.unary.arithmetic.remove"
] | 784,319 | 784,320 | u868281230 | cpp |
p02976 | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
// template
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (a); i > (b); i--)
typedef long long int ll;
typedef pair<ll, ll> P;
typedef complex<double> com;
template <class T> inline bool chmax(T &a, T b) {... | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
// template
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (a); i > (b); i--)
typedef long long int ll;
typedef pair<ll, ll> P;
typedef complex<double> com;
template <class T> inline bool chmax(T &a, T b) {... | [
"expression.operation.binary.add"
] | 784,341 | 784,342 | u407614884 | cpp |
p02981 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using vll = vector<long long>;
using sll = set<long long>;
t... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using vll = vector<long long>;
using sll = set<long long>;
t... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 784,362 | 784,363 | u757628628 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int mid(int a, int b, int c) {
return a + b + c - max(max(a, b), c) - min(min(a, b), c);
}
int main() {
int N, A, B;
cin >> N >> A >> B;
cout << min(A, B) * N << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int mid(int a, int b, int c) {
return a + b + c - max(max(a, b), c) - min(min(a, b), c);
}
int main() {
int N, A, B;
cin >> N >> A >> B;
cout << min(A * N, B) << endl;
}
| [
"expression.operation.binary.remove"
] | 784,364 | 784,365 | u393754572 | cpp |
p02981 | #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 << A << 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 << B << endl;
} else {
cout << A * N << endl;
}
return 0;
} | [
"expression.operation.binary.add"
] | 784,368 | 784,369 | u966045029 | cpp |
p02981 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << n * a + b << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b) << endl;
} | [
"call.add",
"io.output.change",
"call.arguments.change"
] | 784,383 | 784,384 | u117734686 | cpp |
p02981 | #include <cstdlib>
#include <iostream>
using namespace std;
int main() {
long long int A, B, N;
cin >> N >> A >> B;
if (N * A > B)
cout << N * A << endl;
else
cout << B << endl;
return 0;
} | #include <cstdlib>
#include <iostream>
using namespace std;
int main() {
long long int A, B, N;
cin >> N >> A >> B;
if (N * A > B)
cout << B << endl;
else
cout << N * A << endl;
return 0;
}
| [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"control_flow.branch.else.remove"
] | 784,389 | 784,390 | u163149221 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int ans;
ans = min(n * a, n * b);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int ans;
ans = min(n * a, b);
cout << ans << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 784,391 | 784,392 | u679159704 | cpp |
p02981 | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define vll vector<ll>
using namespace std;
const ll N = 3e5 + 100;
const ll MOD = 1e9 + 7;
int main() {
ll n, a, b;
cin >> n >> a >> b;
cout << min(a, b) * n << end... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define vll vector<ll>
using namespace std;
const ll N = 3e5 + 100;
const ll MOD = 1e9 + 7;
int main() {
ll n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b) << end... | [
"expression.operation.binary.remove"
] | 784,395 | 784,396 | u435416250 | 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;
} else {
cout << B;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (N * A <= B) {
cout << N * A;
} else {
cout << B;
}
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 784,397 | 784,398 | u431125128 | cpp |
p02981 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#includ... | [
"expression.operation.binary.remove"
] | 784,403 | 784,404 | u861345985 | cpp |
p02981 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <string>
using namespace std;
int main() {
FILE *fin = NULL, *fout = NULL;
// fin = freopen("input.txt", "r", stdin);
// fout = freopen("output.txt", "w", stdout);
int N, A, B;
scanf("%d", &N, &A, &B);
prin... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <string>
using namespace std;
int main() {
FILE *fin = NULL, *fout = NULL;
// fin = freopen("input.txt", "r", stdin);
// fout = freopen("output.txt", "w", stdout);
int N, A, B;
scanf("%d%d%d", &N, &A, &B);
... | [
"literal.string.change",
"call.arguments.change"
] | 784,407 | 784,408 | u103357948 | 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.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 784,411 | 784,412 | u368279380 | cpp |
p02981 | #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <ve... | #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <ve... | [
"expression.operation.binary.remove"
] | 784,413 | 784,414 | u696290869 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
//↓0-originか1-originでn回繰り返し
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++) // 0-origin昇順
#define rep1(i, n) for (int i = 1; i <= ((int)(n)); i++) // 1-origin昇順
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--) // 0-origin降順
#define rrep1(i, n) for (i... | #include <bits/stdc++.h>
using namespace std;
//↓0-originか1-originでn回繰り返し
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++) // 0-origin昇順
#define rep1(i, n) for (int i = 1; i <= ((int)(n)); i++) // 1-origin昇順
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--) // 0-origin降順
#define rrep1(i, n) for (i... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 784,419 | 784,420 | u457985479 | cpp |
p02981 | // All Heil Fire Lord Zuko
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define debug(x) cerr << #x << " = " << x << endl
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
typedef long long ll;
typedef long double ld;
const int N = 2 * 100 * 1000 +... | // All Heil Fire Lord Zuko
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define debug(x) cerr << #x << " = " << x << endl
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
typedef long long ll;
typedef long double ld;
const int N = 2 * 100 * 1000 +... | [
"expression.operation.binary.remove"
] | 784,421 | 784,422 | u479179837 | cpp |
p02981 | //自称高知能系Vtuberの高井茅乃です。
// Twitter: https://twitter.com/takaichino
// YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1999999999
#define REP(i, n) for (int i = 0; i < n; i++)
#define MODA 1000000007
int main() {
int an... | //自称高知能系Vtuberの高井茅乃です。
// Twitter: https://twitter.com/takaichino
// YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1999999999
#define REP(i, n) for (int i = 0; i < n; i++)
#define MODA 1000000007
int main() {
int an... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 784,429 | 784,430 | u450007962 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(a * b, c * a) << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(a * b, c) << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 784,441 | 784,442 | u795046389 | cpp |
p02981 | #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 if (N * A < B) {
cout << N * A << endl;
} else {
cout << A << 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 if (N * A < B) {
cout << N * A << endl;
} else {
cout << B << endl;
}
}
| [
"identifier.change",
"io.output.change"
] | 784,454 | 784,455 | u578424352 | cpp |
p02981 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(void) {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, n * b) << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(void) {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b) << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 784,456 | 784,457 | u980485808 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<double>;
using vc = vector<char>;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) x.begin(), x.end()
int main() {
int n, a, b;
cin >> ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<double>;
using vc = vector<char>;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) x.begin(), x.end()
int main() {
int n, a, b;
cin >> ... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 784,460 | 784,461 | u688825490 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
int tra, tax;
tra = N * 2;
tax = B;
cout << min(tra, tax) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
int tra, tax;
tra = N * A;
tax = B;
cout << min(tra, tax) << endl;
} | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 784,468 | 784,469 | u748757847 | cpp |
p02981 | #include <iostream>
#include <string>
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;
}
| #include <iostream>
#include <string>
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;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 784,472 | 784,473 | u444645674 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if (a >= b)
cout << b * n << endl;
else
cout << a * n << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if (a * n >= b)
cout << b << endl;
else
cout << a * n << endl;
}
| [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 784,474 | 784,475 | u799521877 | 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;
} else {
cout << a - b;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a * b > c) {
cout << c;
} else {
cout << a * b;
}
} | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 784,487 | 784,488 | u842290168 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int a, b, c, ab;
cin >> a >> b >> c;
ab = a * b;
if (ab < c) {
cout << ab;
} else if (c < ab) {
cout << c << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int a, b, c, ab;
cin >> a >> b >> c;
ab = a * b;
if (ab < c) {
cout << ab;
} else if (c < ab) {
cout << c << endl;
} else
cout << c;
} | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 784,489 | 784,490 | u515468466 | cpp |
p02981 | #include <iostream>
using namespace std;
#include <algorithm>
int main() {
int N, A, B;
cin >> N >> A >> B;
if (A * N > B)
cout << A * N << endl;
else
cout << B << endl;
}
| #include <iostream>
using namespace std;
#include <algorithm>
int main() {
int N, A, B;
cin >> N >> A >> B;
if (A * N < B)
cout << A * N << endl;
else
cout << B << endl;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 784,501 | 784,502 | u419501474 | cpp |
p02981 | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
void strInit(char str[]); // str[]を0で初期化
void extIntStr(char str[],
int data[]); // str[]から数値(int)を抽出しdata[]に順次格納
void incsort(int data[], int len); // data[]を昇順ソート
void decsort(int data[], int len); // data[]を降順ソート
void printIntArra... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
void strInit(char str[]); // str[]を0で初期化
void extIntStr(char str[],
int data[]); // str[]から数値(int)を抽出しdata[]に順次格納
void incsort(int data[], int len); // data[]を昇順ソート
void decsort(int data[], int len); // data[]を降順ソート
void printIntArra... | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 784,507 | 784,508 | u493708099 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, s;
cin >> n >> a >> b;
s = n * a;
if (s >= b) {
cout << s;
} else {
cout << b;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, s;
cin >> n >> a >> b;
s = n * a;
if (s <= b) {
cout << s;
} else {
cout << b;
}
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 784,511 | 784,512 | u069273180 | cpp |
p02981 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if (b <= a * n) {
cout << b << endl;
} else if (a * n > b) {
cout << a * n << endl;
}
} |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if (b <= a * n) {
cout << b << endl;
} else if (a * n < b) {
cout << a * n << endl;
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 784,513 | 784,514 | u564004296 | cpp |
p02981 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a;
int b;
int c;
int d = 0;
int e = 0;
cin >> a;
cin >> b;
cin >> c;
d = a * b;
if (a > d) {
cout << d << endl;
} else {
cout << a << endl;
}
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int a;
int b;
int c;
int d = 0;
int e = 0;
cin >> a;
cin >> b;
cin >> c;
d = a * b;
if (c > d) {
cout << d << endl;
} else {
cout << c << endl;
}
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 784,515 | 784,516 | u479202791 | cpp |
p02981 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a;
int b;
int c;
int d = 0;
int e = 0;
cin >> a;
cin >> b;
cin >> c;
d = a * b;
if (a > d) {
cout << a << endl;
} else {
cout << d << endl;
}
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int a;
int b;
int c;
int d = 0;
int e = 0;
cin >> a;
cin >> b;
cin >> c;
d = a * b;
if (c > d) {
cout << d << endl;
} else {
cout << c << endl;
}
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 784,517 | 784,516 | u479202791 | cpp |
p02981 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a;
int b;
int c;
int d = 0;
int e = 0;
cin >> a;
cin >> b;
cin >> c;
d = a * b;
if (a > b) {
cout << a << endl;
} else {
cout << d << endl;
}
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int a;
int b;
int c;
int d = 0;
int e = 0;
cin >> a;
cin >> b;
cin >> c;
d = a * b;
if (c > d) {
cout << d << endl;
} else {
cout << c << endl;
}
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 784,518 | 784,516 | u479202791 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << a * min(b, c) << '\n';
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(a * b, c) << '\n';
return 0;
} | [
"expression.operation.binary.remove"
] | 784,523 | 784,524 | u678284395 | cpp |
p02981 | #define NOMINMAX
#define TEST_MODE true
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#include <random>
#include <regex>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define rrep(i, n) for (int... | #define NOMINMAX
#define TEST_MODE true
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#include <random>
#include <regex>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define rrep(i, n) for (int... | [
"call.add",
"io.output.change",
"call.arguments.change"
] | 784,532 | 784,533 | u495267515 | cpp |
p02981 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n, a, b;
cin >> n >> b;
cout << min(n * a, b);
return 0;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b);
return 0;
} | [
"expression.operation.binary.add"
] | 784,536 | 784,537 | u438621426 | cpp |
p02981 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define in insert
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define al... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define in insert
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define al... | [
"expression.operation.binary.remove"
] | 784,538 | 784,539 | u843739531 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
// 整数の入力
int n, a, b;
int chage;
cin >> n >> a >> b;
if (n * a > b) {
chage = b;
} else {
chage = a;
}
cout << chage << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
// 整数の入力
int n, a, b;
int chage;
cin >> n >> a >> b;
if (n * a > b) {
chage = b;
} else {
chage = n * a;
}
cout << chage << endl;
return 0;
} | [
"assignment.change"
] | 784,545 | 784,546 | u761994361 | 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;
} else {
cout << b;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if (n * a < b) {
cout << n * a;
} else {
cout << b;
}
} | [
"expression.operation.binary.add"
] | 784,557 | 784,558 | u397732894 | 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;
}
return 0;
}
| #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;
}
return 0;
}
| [
"expression.operation.binary.add"
] | 784,561 | 784,562 | u647653350 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
#define sc(x) scanf("%d", &x);
#define rep(x, n) for (int x = 0; x < n; x++)
#define ll long long
#define finish(x) return cout << x << endl, 0;
#define scarr(a, n) \
for (int x = 0; x < n; x++) ... | #include <bits/stdc++.h>
using namespace std;
#define sc(x) scanf("%d", &x);
#define rep(x, n) for (int x = 0; x < n; x++)
#define ll long long
#define finish(x) return cout << x << endl, 0;
#define scarr(a, n) \
for (int x = 0; x < n; x++) ... | [
"expression.operation.binary.remove"
] | 784,567 | 784,568 | u091622975 | cpp |
p02981 | #include <bits/stdc++.h>
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;
} | #include <bits/stdc++.h>
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;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 784,582 | 784,583 | u777477705 | cpp |
p02981 | #define A return 0;
#define AA int
#define AAA ;
#define AAAA if
#define AAAAA (
#define AAAAAA )
#define AAAAAAA cin
#define AAAAAAAA >>
#define AAAAAAAAA cout
#define AAAAAAAAAA <<
#define AAAAAAAAAAA endl
#define AAAAAAAAAAAA ,
#define AAAAAAAAAAAAA *
#define AAAAAAAAAAAAAA =
#define AAAAAAAAAAAAAAA else
#define AAA... | #define A return 0;
#define AA int
#define AAA ;
#define AAAA if
#define AAAAA (
#define AAAAAA )
#define AAAAAAA cin
#define AAAAAAAA >>
#define AAAAAAAAA cout
#define AAAAAAAAAA <<
#define AAAAAAAAAAA endl
#define AAAAAAAAAAAA ,
#define AAAAAAAAAAAAA *
#define AAAAAAAAAAAAAA =
#define AAAAAAAAAAAAAAA else
#define AAA... | [
"identifier.change"
] | 784,590 | 784,591 | u274962354 | cpp |
p02981 | #include <bits/stdc++.h>
#define SZ(x) ((int)(x).size())
typedef long long ll;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout.setf(ios::fixed);
cout.precision(20);
int n, a, b;
cin >> n >> a >> b;
cout << n * min(a, b) << "\n";
}
| #include <bits/stdc++.h>
#define SZ(x) ((int)(x).size())
typedef long long ll;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout.setf(ios::fixed);
cout.precision(20);
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b) << "\n";
}
| [
"expression.operation.binary.remove"
] | 784,598 | 784,599 | u282817279 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << max(n * a, b) << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b) << endl;
return 0;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 784,600 | 784,601 | u373958718 | cpp |
p02981 | #include <iostream>
using namespace std;
int n, a, b;
int main() {
cin >> n >> a >> b;
cout << max(a * n, b) << endl;
} | #include <iostream>
using namespace std;
int n, a, b;
int main() {
cin >> n >> a >> b;
cout << min(a * n, b) << endl;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 784,604 | 784,605 | u843139357 | cpp |
p02981 | #include <bits/stdc++.h>
#include <cmath>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define SUBL \
freopen("/home/... | #include <bits/stdc++.h>
#include <cmath>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define SUBL \
freopen("/home/... | [
"expression.operation.binary.remove"
] | 784,606 | 784,607 | u851831516 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << max(n * a, b);
}
| #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b);
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 784,616 | 784,617 | u778738287 | cpp |
p02981 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 784,629 | 784,630 | u950174376 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, minimum;
cin >> N, A, B;
minimum = min(N * A, B);
cout << minimum;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, minimum;
cin >> N >> A >> B;
minimum = min(N * A, B);
cout << minimum;
}
| [] | 784,641 | 784,642 | u447604786 | cpp |
p02981 | #include <algorithm>
#include <bitset>
#include <fstream>
#include <iostream>
#include <map>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << max(n * a, b);
} | #include <algorithm>
#include <bitset>
#include <fstream>
#include <iostream>
#include <map>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b);
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 784,649 | 784,650 | u531246940 | cpp |
p02981 | #include <stdio.h>
int main(void) {
int N, A, B;
scanf("%d %d %d", N, A, B);
if (A * N >= B)
printf("%d", B);
else
printf("%d", A * N);
return 0;
} | #include <stdio.h>
int main(void) {
int N, A, B;
scanf("%d %d %d", &N, &A, &B);
if (A * N >= B)
printf("%d", B);
else
printf("%d", A * N);
return 0;
} | [
"expression.operation.unary.reference.add"
] | 784,668 | 784,669 | u302993900 | cpp |
p02981 | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair... | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair... | [
"expression.operation.binary.remove"
] | 784,683 | 784,684 | u422558819 | cpp |
p02981 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
bool used[1005];
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(a * b, a * c);
}
| #include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
bool used[1005];
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(a * b, c);
}
| [
"expression.operation.binary.remove"
] | 784,695 | 784,696 | u361768313 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, n;
cin >> n >> a >> b;
if (n * a >= b) {
cout << b << '\n';
} else {
cout << a << '\n';
}
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 << '\n';
} else {
cout << a * n << '\n';
}
return (0);
} | [
"expression.operation.binary.add"
] | 784,701 | 784,702 | u600244905 | cpp |
p02981 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
inline ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <class S, class T>
ostream &op... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
inline ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <class S, class T>
ostream &op... | [
"expression.operation.binary.remove"
] | 784,715 | 784,716 | u728732647 | 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;
} | #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;
} | [
"expression.operation.binary.remove"
] | 784,717 | 784,718 | u228232845 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf = -1000;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(a * b, a * c);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf = -1000;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(a * b, c);
return 0;
}
| [
"expression.operation.binary.remove"
] | 784,731 | 784,732 | u702142173 | cpp |
p02981 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
int A;
int B;
int yen;
cin >> N;
cin >> A;
cin >> B;
if (A < B) {
yen = N * A;
} else {
yen = N * B;
}
cout << yen << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
int A;
int B;
int yen;
cin >> N;
cin >> A;
cin >> B;
if (A * N <= B) {
yen = N * A;
} else {
yen = B;
}
cout << yen << endl;
} | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 784,741 | 784,742 | u633728454 | cpp |
p02981 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
int N, T, C;
cin >> N >> T >> C;
if (N * T > C)
cout << N * T << endl;
else
cout << C << endl;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
int N, T, C;
cin >> N >> T >> C;
if (N * T > C)
cout << C << endl;
else
cout << N * T << endl;
} | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"control_flow.branch.else.remove"
] | 784,743 | 784,744 | u431929942 | cpp |
p02981 | #include <bits/stdc++.h>
#include <chrono>
#define watch(x) cout << (#x) << " is " << (x) << endl
#define eps 1e-9
#define f first
#define s second
typedef long long ll;
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, a, b;
cin >> n >> a >> b;
... | #include <bits/stdc++.h>
#include <chrono>
#define watch(x) cout << (#x) << " is " << (x) << endl
#define eps 1e-9
#define f first
#define s second
typedef long long ll;
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, a, b;
cin >> n >> a >> b;
... | [
"expression.operation.binary.remove"
] | 784,750 | 784,751 | u409343817 | cpp |
p02981 | #include <bits/stdc++.h>
#define itn int
#define REP(i, n) for (int i = 0; i < (n); i++)
#define IREP(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, k, n) for (int i = (k); i < (n); i++)
#define REPEACH(itr, k) for (auto &&itr : k)
#define MOD 1000000007
using namespace std;
typedef long long ll;
const ll INF ... | #include <bits/stdc++.h>
#define itn int
#define REP(i, n) for (int i = 0; i < (n); i++)
#define IREP(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, k, n) for (int i = (k); i < (n); i++)
#define REPEACH(itr, k) for (auto &&itr : k)
#define MOD 1000000007
using namespace std;
typedef long long ll;
const ll INF ... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 784,759 | 784,760 | u118875091 | cpp |
p02981 | #include <stdio.h>
int main() {
int N, A, B;
scanf("%d%d%d", N, A, B);
if (N * A <= B)
printf("%d\n", N * A);
else
printf("%d\n", B);
return 0;
} | #include <stdio.h>
int main() {
int N, A, B;
scanf("%d%d%d", &N, &A, &B);
if (N * A <= B)
printf("%d\n", N * A);
else
printf("%d\n", B);
return 0;
}
| [
"expression.operation.unary.reference.add"
] | 784,763 | 784,764 | u507850687 | cpp |
p02981 | #include <algorithm>
#include <cstdio>
using namespace std;
int n, a, b;
int main() {
scanf("%d %d %d", &n, &a, &b);
a *= n;
printf("%d", max(a, b));
return 0;
} | #include <algorithm>
#include <cstdio>
using namespace std;
int n, a, b;
int main() {
scanf("%d %d %d", &n, &a, &b);
a *= n;
printf("%d", min(a, b));
return 0;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"io.output.change"
] | 784,765 | 784,766 | u316376808 | cpp |
p02981 | #include <algorithm>
#include <cstdio>
using namespace std;
int n, a, b;
int main() {
scanf("%d %d %d", &n, &a, &b);
a *= n;
printf("%d", max(a, n));
return 0;
} | #include <algorithm>
#include <cstdio>
using namespace std;
int n, a, b;
int main() {
scanf("%d %d %d", &n, &a, &b);
a *= n;
printf("%d", min(a, b));
return 0;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"io.output.change"
] | 784,767 | 784,766 | u316376808 | cpp |
p02981 | /*
lakshaygpt28
Lakshay Gupta
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using db = double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vll = vector<ll>;
template <typ... | /*
lakshaygpt28
Lakshay Gupta
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using db = double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vll = vector<ll>;
template <typ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 784,773 | 784,774 | u295509734 | cpp |
p02981 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
constexpr static ll MOD = 1000000007ll;
constexpr static int INF = 1 << 28; // for x <= 10^9
constexpr static ll INFL = 1ll << 60; // for x <= 10^19
constexpr static double EPS = 1e-10;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << m... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
constexpr static ll MOD = 1000000007ll;
constexpr static int INF = 1 << 28; // for x <= 10^9
constexpr static ll INFL = 1ll << 60; // for x <= 10^19
constexpr static double EPS = 1e-10;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << m... | [
"call.arguments.change",
"call.arguments.add"
] | 784,778 | 784,779 | u784448849 | cpp |
p02981 | #include <iostream>
using namespace std;
int N, A, B;
int main() {
ios::sync_with_stdio(false);
cin >> N >> A >> B;
cout << (N * A > B ? B : A) << endl;
return 0;
} | #include <iostream>
using namespace std;
int N, A, B;
int main() {
ios::sync_with_stdio(false);
cin >> N >> A >> B;
cout << (N * A > B ? B : A * N);
return 0;
} | [
"expression.operation.binary.remove"
] | 784,782 | 784,783 | u667132583 | cpp |
p02981 | #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 << a * 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 << a * n << endl;
}
} | [
"identifier.change",
"io.output.change"
] | 784,792 | 784,793 | u330025192 | cpp |
p02981 | /*#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")*/
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define amen ;
#define vec vector
#define pb push_ba... | /*#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")*/
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define amen ;
#define vec vector
#define pb push_ba... | [
"expression.operation.binary.remove"
] | 784,798 | 784,799 | u787195982 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int p, a, b;
void check(int p, int a, int b) {
if (p * a < p * b) {
cout << p * a;
return;
}
if (p * a == p * b) {
cout << p * a;
return;
}
cout << p * b;
}
int main() {
cin >> p >> a >> b;
check(p, a, b);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int p, a, b;
void check(int p, int a, int b) {
if (p * a < b) {
cout << p * a;
return;
}
if (p * a == b) {
cout << p * a;
return;
}
cout << b;
}
int main() {
cin >> p >> a >> b;
check(p, a, b);
return 0;
} | [
"expression.operation.binary.remove"
] | 784,804 | 784,805 | u722193545 | cpp |
p02981 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if (a * n >= b) {
cout << a * n << endl;
} else {
cout << b << endl;
}
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if (a * n >= b) {
cout << b << endl;
} else {
cout << a * n << endl;
}
} | [
"control_flow.branch.else.add"
] | 784,806 | 784,807 | u536221891 | cpp |
p02981 | /***"In the name of Allah(swt), the most gracious, most merciful. Allah(swt)
* blesses with knowledge whom he wants."***/
/*Header file starts here*/
//#include<bits/stdc++.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cst... | /***"In the name of Allah(swt), the most gracious, most merciful. Allah(swt)
* blesses with knowledge whom he wants."***/
/*Header file starts here*/
//#include<bits/stdc++.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cst... | [
"expression.operation.binary.remove",
"call.arguments.change"
] | 784,810 | 784,811 | u081421133 | cpp |
p02981 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (A > B) {
cout << N * B;
} else {
cout << N * A;
}
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (A * N > B) {
cout << B;
} else {
cout << N * A;
}
} | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 784,812 | 784,813 | u030068336 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int n;
int a, b;
cin >> n >> a >> b;
int res = n * a;
cout << (res > b ? res : b);
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n;
int a, b;
cin >> n >> a >> b;
int res = n * a;
cout << (res < b ? res : b);
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 784,814 | 784,815 | u634358761 | cpp |
p02981 | #include <array>
#include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <utility>
using namespace std;
int main(void) {
int N, A, B;
scanf("%d", &N);
scanf("%d", &A);
scanf("%d", &B);
int AN = A * B;
if (AN > B) {
printf("%d", B);
} else {
printf("%d", AN);
}
return 0;
} | #include <array>
#include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <utility>
using namespace std;
int main(void) {
int N, A, B;
scanf("%d", &N);
scanf("%d", &A);
scanf("%d", &B);
int AN = A * N;
if (AN >= B) {
printf("%d", B);
} else {
printf("%d", AN);
}
return 0;
} | [
"identifier.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 784,816 | 784,817 | u173561231 | cpp |
p02981 | #include <array>
#include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <utility>
using namespace std;
int main(void) {
int N, A, B;
scanf("%d", &N);
scanf("%d", &A);
scanf("%d", &B);
int AN = A * B;
if (AN > B) {
printf("%d\n", B);
} else {
printf("%d\n", AN);
}
return 0;
} | #include <array>
#include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <utility>
using namespace std;
int main(void) {
int N, A, B;
scanf("%d", &N);
scanf("%d", &A);
scanf("%d", &B);
int AN = A * N;
if (AN >= B) {
printf("%d", B);
} else {
printf("%d", AN);
}
return 0;
} | [
"identifier.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.remove"
] | 784,818 | 784,817 | u173561231 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, t;
string s;
cin >> n >> a >> b;
if (a > b)
t = b;
else
t = a;
cout << n * t << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, t;
string s;
cin >> n >> a >> b;
if (n * a > b)
t = b;
else
t = n * a;
cout << t << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"assignment.change",
"expression.operation.binary.remove"
] | 784,819 | 784,820 | u788350912 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a;
cin >> b;
cin >> 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;
cin >> b;
cin >> c;
if (a * b < c) {
cout << a * b << endl;
} else {
cout << c << endl;
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 784,823 | 784,824 | u872704421 | cpp |
p02981 | /* Dedication has no limitation
*/
// 29 June 2019
// Location: Japan
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, n * b);
}
| /* Dedication has no limitation
*/
// 29 June 2019
// Location: Japan
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b);
}
| [
"expression.operation.binary.remove"
] | 784,833 | 784,834 | u553932989 | cpp |
p02981 | #include <iostream>
void func_A(int N, int A, int B) {
std::cout << (A * N > B ? N : A * N) << std::endl;
}
int main() {
int N, A, B;
std::cin >> N >> A >> B;
func_A(N, A, B);
return 0;
} | #include <iostream>
void func_A(int N, int A, int B) {
std::cout << (A * N > B ? B : A * N) << std::endl;
}
int main() {
int N, A, B;
std::cin >> N >> A >> B;
func_A(N, A, B);
return 0;
} | [
"identifier.change",
"expression.operation.binary.change"
] | 784,843 | 784,844 | u096502015 | cpp |
p02981 | #include <iostream>
void func_A(int N, int A, int B) {
std::cout << (A > B ? N * B : A * N) << std::endl;
}
int main() {
int N, A, B;
std::cin >> N >> A >> B;
func_A(N, A, B);
return 0;
} | #include <iostream>
void func_A(int N, int A, int B) {
std::cout << (A * N > B ? B : A * N) << std::endl;
}
int main() {
int N, A, B;
std::cin >> N >> A >> B;
func_A(N, A, B);
return 0;
} | [
"expression.operation.binary.remove"
] | 784,845 | 784,844 | u096502015 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, n) << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b) << endl;
return 0;
}
| [
"identifier.change",
"io.output.change"
] | 784,856 | 784,857 | u557325877 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
#define mp(a, b) make_pair(a, b)
#define ff first
#define setp(a) setprecision(a) << fixed
#define ss second
#define fori(v) for (ll i = 0; i < v; i++)
#define forj(v) for (ll j = 0; j < v; j++)
#define fork(v) for (ll k = 0; k < v; k++)
#define forl(v) for (ll l = 0; l < v... | #include <bits/stdc++.h>
using namespace std;
#define mp(a, b) make_pair(a, b)
#define ff first
#define setp(a) setprecision(a) << fixed
#define ss second
#define fori(v) for (ll i = 0; i < v; i++)
#define forj(v) for (ll j = 0; j < v; j++)
#define fork(v) for (ll k = 0; k < v; k++)
#define forl(v) for (ll l = 0; l < v... | [
"expression.operation.binary.remove"
] | 784,858 | 784,859 | u936253056 | cpp |
p02981 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int n;
int a;
int b;
cin >> n;
cin >> a;
cin >> b;
if (a < b) {
cout << n * a;
} else {
cout << n * b;
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int n;
int a;
int b;
cin >> n;
cin >> a;
cin >> b;
if (n * a < b) {
cout << n * a;
} else {
cout << b;
}
return 0;
} | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 784,866 | 784,867 | u175232503 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
#define S scanf
#define P printf
#define G getline
#define SZ size()
#define C clear()
#define B begin()
#define F front()
#define T top()
#define E end()
#define EM empty()
#define V vector
#define Q queue
#define DQ deque
#define PQ priority_queue
#define ST stack
#defi... | #include <bits/stdc++.h>
using namespace std;
#define S scanf
#define P printf
#define G getline
#define SZ size()
#define C clear()
#define B begin()
#define F front()
#define T top()
#define E end()
#define EM empty()
#define V vector
#define Q queue
#define DQ deque
#define PQ priority_queue
#define ST stack
#defi... | [
"expression.operation.binary.remove"
] | 784,875 | 784,876 | u380762346 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define pa pair<int, int>
#define F first
#define S second
#define Max 9999
#define d n % 3
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (a * b > c ? a * b : c) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define pa pair<int, int>
#define F first
#define S second
#define Max 9999
#define d n % 3
typedef long long ll;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (a * b < c ? a * b : c) << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 784,886 | 784,887 | u152688173 | cpp |
p02981 | #include <iostream>
int main(int, char **) {
int n, a, b;
std::cin >> n >> a >> b;
std::cout << n * std::min(a, b) << std::endl;
return 0;
}
| #include <iostream>
int main(int, char **) {
int n, a, b;
std::cin >> n >> a >> b;
std::cout << std::min(n * a, b) << std::endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 784,899 | 784,900 | u224390062 | cpp |
p02981 | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, n * b) << endl;
;
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b) << endl;
;
return 0;
}
| [
"expression.operation.binary.remove"
] | 784,922 | 784,923 | u812003342 | cpp |
p02981 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repab(i, a, b) for (int i = a; i <= b; i++)
#define ull unsigned long long int
#define ll long long int
#define pb push_back
#define pop pop_back
#define p0(x) cout << x << " "
#define p1(x) cout << x << '\n'
#define p2(x, y) cout << x << " ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repab(i, a, b) for (int i = a; i <= b; i++)
#define ull unsigned long long int
#define ll long long int
#define pb push_back
#define pop pop_back
#define p0(x) cout << x << " "
#define p1(x) cout << x << '\n'
#define p2(x, y) cout << x << " ... | [
"misc.opposites",
"identifier.change",
"call.function.change"
] | 784,924 | 784,925 | u703362211 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a * b >= c)
cout << a * b;
else
cout << c;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a * b < c)
cout << a * b;
else
cout << c;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 784,926 | 784,927 | u302494292 | cpp |
p02981 | #include <bits/stdc++.h>
#include <iostream>
#define fori(j, n) for (long long i = j; i < n; i++)
#define pb push_back
#define ss string
#define ll long long
#define li long
#include <string.h>
#define pf printf
#define sf scanf
bool isvowel(char s) {
if (s == 'a' || s == 'A' || s == 'e' || s == 'E' || s == 'i' || s ... | #include <bits/stdc++.h>
#include <iostream>
#define fori(j, n) for (long long i = j; i < n; i++)
#define pb push_back
#define ss string
#define ll long long
#define li long
#include <string.h>
#define pf printf
#define sf scanf
bool isvowel(char s) {
if (s == 'a' || s == 'A' || s == 'e' || s == 'E' || s == 'i' || s ... | [
"expression.operation.binary.remove"
] | 784,929 | 784,930 | u107611114 | 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 << n * a << endl;
} | #include <iostream>
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;
} | [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 784,931 | 784,932 | u477516105 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (N > A * B)
cout << A * B;
else
cout << N;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (B > A * N)
cout << A * N;
else
cout << B;
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 784,933 | 784,934 | u638696958 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.