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 <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int ans = max(n * 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;
} | [
"misc.opposites",
"identifier.change",
"call.function.change"
] | 784,935 | 784,936 | u380922176 | cpp |
p02981 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main(void) {
int n, a, b;
scanf("%d%d%d", &n, &a, &b);
printf("%d\n", n * min(a, b));
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main(void) {
int n, a, b;
scanf("%d%d%d", &n, &a, &b);
printf("%d\n", min(n * a, b));
return 0;
}
| [
"expression.operation.binary.remove"
] | 784,947 | 784,948 | u769470336 | 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;
}
} | [
"expression.operation.binary.add"
] | 784,953 | 784,954 | u098652914 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int res;
if (n * a > b) {
res = b;
} else {
res = n * a;
}
cout << a << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int res;
if (n * a > b) {
res = b;
} else {
res = n * a;
}
cout << res << endl;
}
| [
"identifier.change",
"io.output.change"
] | 784,960 | 784,961 | u099277178 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int res;
if (n * a > b) {
res = b;
} else {
res = a;
}
cout << a << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int res;
if (n * a > b) {
res = b;
} else {
res = n * a;
}
cout << res << endl;
}
| [
"assignment.change",
"identifier.change",
"io.output.change"
] | 784,962 | 784,961 | u099277178 | cpp |
p02981 | #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 <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,963 | 784,964 | u005469124 | cpp |
p02981 | /*
*
* Author : Amit Kumar
* Date : June 12 2019
*
*/
#include <bits/stdc++.h>
#define FAST_INPUT_OUTPUT
//#define MORE_THAN_ONE_TESTCASE // COMMENT IT
#define vi vector<int>
#define vl vector<long long>
#define mii map<int, int>
#define mll map<long long, long long>
#define msi map<string, i>
#define msl map<string, long long>
#define umii unordered_map<int, int>
#define umll unordered_map<long long, long long>
#define umsi unordered_map<string, int>
#define umsl map<string, long long>
#define si set<int>
#define sl set<long long>
#define pii pair<int, int>
#define psi pair<string, int>
#define psl pair<string, long>
#define pll pair<long long, long long>
#define vpii vector<pii>
#define vpll vector<pll>
#define vpsi vector<psi>
#define vpsl vector<psl>
#define pqi priority_queue<int>
#define pql priority_queue<long long>
#define ub upper_bound
#define lb lower_bound
#define bint long long int
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define iv(v) \
for (auto &i : v) { \
cin >> i; \
}
#define ov(v) \
for (auto i : v) { \
cout << i << " "; \
} \
cout << endl;
#define ovn(v) \
for (auto i : v) { \
cout << i << endl; \
}
#define euv(v) \
for (auto i : v) { \
cerr << i << " "; \
} \
cerr << endl;
#define eovn(v) \
for (auto i : v) { \
cerr << i << endl; \
}
#define os(s) \
for (auto itr : s) { \
cout << itr << " "; \
} \
cout << endl;
#define osn(s) \
for (auto itr : s) { \
cout << itr << endl; \
}
#define eos(s) \
for (auto itr : s) { \
cerr << itr << " "; \
} \
cerr << endl;
#define eosn(s) \
for (auto itr : s) { \
cerr << itr << endl; \
}
#define rep(x) for (auto i = 0; i < (x); ++i)
#define _rep(a, b) for (auto i = (a); i < (b); ++i)
#define ef else if
#define wh while
#define el else
#define ivv(x) \
int x; \
cin >> x
#define lv(x) \
bint x; \
cin >> x
#define sv(x) \
string x; \
cin >> x
#define cv(x) \
char x; \
cin >> x
#define fv(x) \
float x; \
cin >> x
#define dv(x) \
double x; \
cin >> x
#define endl '\n'
using namespace std;
auto SOLUTION_FUNCTION(void) -> void {
// your solution goes here
ivv(a);
ivv(b);
ivv(c);
cout << a * min(b, c) << endl;
return;
}
int main(void) {
#ifdef FAST_INPUT_OUTPUT
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cout << setprecision(10);
cout << fixed;
cout << boolalpha;
#endif
#ifdef MY_LOCAL_PROJECT
freopen("input", "r", stdin);
freopen("output", "w", stdout);
#endif
int testcase = 1;
#ifdef MORE_THAN_ONE_TESTCASE
cin >> testcase;
#endif
while (testcase--) {
SOLUTION_FUNCTION();
}
#ifdef MY_LOCAL_PROJECT
cout << "Time : " << 1.0 * (double)clock() / CLOCKS_PER_SEC << endl;
#endif
return 0;
} | /*
*
* Author : Amit Kumar
* Date : June 12 2019
*
*/
#include <bits/stdc++.h>
#define FAST_INPUT_OUTPUT
//#define MORE_THAN_ONE_TESTCASE // COMMENT IT
#define vi vector<int>
#define vl vector<long long>
#define mii map<int, int>
#define mll map<long long, long long>
#define msi map<string, i>
#define msl map<string, long long>
#define umii unordered_map<int, int>
#define umll unordered_map<long long, long long>
#define umsi unordered_map<string, int>
#define umsl map<string, long long>
#define si set<int>
#define sl set<long long>
#define pii pair<int, int>
#define psi pair<string, int>
#define psl pair<string, long>
#define pll pair<long long, long long>
#define vpii vector<pii>
#define vpll vector<pll>
#define vpsi vector<psi>
#define vpsl vector<psl>
#define pqi priority_queue<int>
#define pql priority_queue<long long>
#define ub upper_bound
#define lb lower_bound
#define bint long long int
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define iv(v) \
for (auto &i : v) { \
cin >> i; \
}
#define ov(v) \
for (auto i : v) { \
cout << i << " "; \
} \
cout << endl;
#define ovn(v) \
for (auto i : v) { \
cout << i << endl; \
}
#define euv(v) \
for (auto i : v) { \
cerr << i << " "; \
} \
cerr << endl;
#define eovn(v) \
for (auto i : v) { \
cerr << i << endl; \
}
#define os(s) \
for (auto itr : s) { \
cout << itr << " "; \
} \
cout << endl;
#define osn(s) \
for (auto itr : s) { \
cout << itr << endl; \
}
#define eos(s) \
for (auto itr : s) { \
cerr << itr << " "; \
} \
cerr << endl;
#define eosn(s) \
for (auto itr : s) { \
cerr << itr << endl; \
}
#define rep(x) for (auto i = 0; i < (x); ++i)
#define _rep(a, b) for (auto i = (a); i < (b); ++i)
#define ef else if
#define wh while
#define el else
#define ivv(x) \
int x; \
cin >> x
#define lv(x) \
bint x; \
cin >> x
#define sv(x) \
string x; \
cin >> x
#define cv(x) \
char x; \
cin >> x
#define fv(x) \
float x; \
cin >> x
#define dv(x) \
double x; \
cin >> x
#define endl '\n'
using namespace std;
auto SOLUTION_FUNCTION(void) -> void {
// your solution goes here
ivv(a);
ivv(b);
ivv(c);
cout << min(a * b, c) << endl;
return;
}
int main(void) {
#ifdef FAST_INPUT_OUTPUT
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cout << setprecision(10);
cout << fixed;
cout << boolalpha;
#endif
#ifdef MY_LOCAL_PROJECT
freopen("input", "r", stdin);
freopen("output", "w", stdout);
#endif
int testcase = 1;
#ifdef MORE_THAN_ONE_TESTCASE
cin >> testcase;
#endif
while (testcase--) {
SOLUTION_FUNCTION();
}
#ifdef MY_LOCAL_PROJECT
cout << "Time : " << 1.0 * (double)clock() / CLOCKS_PER_SEC << endl;
#endif
return 0;
} | [
"expression.operation.binary.remove"
] | 784,974 | 784,975 | u896543512 | cpp |
p02981 | #include <cstdio>
#include <iomanip>
#include <iostream>
using namespace std;
int n, a, b;
int main() {
cin >> n >> a >> b;
int max1 = n * a;
int Max2 = n * b;
int ans = min(max1, Max2);
cout << ans << endl;
return 0;
} | #include <cstdio>
#include <iomanip>
#include <iostream>
using namespace std;
int n, a, b;
int main() {
cin >> n >> a >> b;
int max1 = n * a;
int Max2 = b;
int ans = min(max1, Max2);
cout << ans << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 784,982 | 784,983 | u516021252 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a;
int b;
cin >> n >> a >> b;
if (n * a >= b)
cout << b;
if (n * a < b)
cout << a * b;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a;
int b;
cin >> n >> a >> b;
if (n * a >= b)
cout << b;
if (n * a < b)
cout << a * n;
} | [
"identifier.change",
"io.output.change"
] | 784,988 | 784,989 | u616998927 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
int a;
int b;
cin >> n >> a >> b;
if (n * a >= b)
cout << b;
if (n * a < b)
cout << a * b;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a;
int b;
cin >> n >> a >> b;
if (n * a >= b)
cout << b;
if (n * a < b)
cout << a * n;
} | [
"identifier.change",
"io.output.change"
] | 784,990 | 784,989 | u616998927 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
template <class T> void ckmin(T &a, T b) { a = min(a, b); }
template <class T> void ckmax(T &a, T b) { a = max(a, b); }
#define pb push_back
#define mp make_pair
#define Red \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define F first
#define S second
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define repr(i, n) for (int i = n - 1; i >= 0; --i)
#define Rep(i, a, n) for (int i = (a); i <= (n); ++i)
#define repst(i, n) for (auto it = n.begin(); it != n.end(); ++it)
#define Repr(i, a, n) for (int i = (n); i >= (a); --i)
typedef long long ll;
const int inf = int(1e9);
const int mod = 256;
const int N = 1e6 + 555;
void solve() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) * n;
}
int main() {
Red;
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
template <class T> void ckmin(T &a, T b) { a = min(a, b); }
template <class T> void ckmax(T &a, T b) { a = max(a, b); }
#define pb push_back
#define mp make_pair
#define Red \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define F first
#define S second
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define repr(i, n) for (int i = n - 1; i >= 0; --i)
#define Rep(i, a, n) for (int i = (a); i <= (n); ++i)
#define repst(i, n) for (auto it = n.begin(); it != n.end(); ++it)
#define Repr(i, a, n) for (int i = (n); i >= (a); --i)
typedef long long ll;
const int inf = int(1e9);
const int mod = 256;
const int N = 1e6 + 555;
void solve() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a * n, b);
}
int main() {
Red;
solve();
return 0;
} | [
"expression.operation.binary.remove"
] | 784,999 | 785,000 | u235396011 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll i, j, k, n, m;
cin >> n >> i >> j;
cout << n * min(i, j) << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll i, j, k, n, m;
cin >> n >> i >> j;
cout << min(n * i, j) << "\n";
return 0;
}
| [
"expression.operation.binary.remove"
] | 785,012 | 785,013 | u038410216 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N;
cin >> A;
cin >> B;
if (N * A <= N * B) {
cout << N * A << endl;
} else if (N * A > N * B) {
cout << N * B << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N;
cin >> A;
cin >> B;
if (N * A <= B) {
cout << N * A << endl;
} else if (N * A > B) {
cout << B << endl;
}
} | [
"expression.operation.binary.remove"
] | 785,022 | 785,023 | u651879504 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
#define asll unsigned long long
#define pii pair<int, int>
#define st first
#define nd second
asll M = 1e9 + 7; // 20190518
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
srand(time(0)); // 20190709
int n, a, b;
cin >> n >> a >> b;
cout << max(n * a, b) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define asll unsigned long long
#define pii pair<int, int>
#define st first
#define nd second
asll M = 1e9 + 7; // 20190518
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
srand(time(0)); // 20190709
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b) << endl;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 785,024 | 785,025 | u248547447 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int ans = max(n * a, 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 = min(n * a, b);
cout << ans << endl;
return 0;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change"
] | 785,035 | 785,036 | u646051775 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
// long long
using ll = long long;
//出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin() end()
#define all(x) (x).begin(), (x).end()
// for
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
//最大公約数
unsigned gcd(unsigned a, unsigned b) {
if (a < b)
return gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int main() {
int N, A, B;
cin >> N >> A >> B;
int ans = min(A, B * N);
print(ans);
} | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
// long long
using ll = long long;
//出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin() end()
#define all(x) (x).begin(), (x).end()
// for
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
//最大公約数
unsigned gcd(unsigned a, unsigned b) {
if (a < b)
return gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int main() {
int N, A, B;
cin >> N >> A >> B;
int ans = min(A * N, B);
print(ans);
} | [
"call.arguments.change",
"call.arguments.add"
] | 785,041 | 785,042 | u832995587 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
// long long
using ll = long long;
//出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin() end()
#define all(x) (x).begin(), (x).end()
// for
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
//最大公約数
unsigned gcd(unsigned a, unsigned b) {
if (a < b)
return gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int main() {
int N, A, B;
cin >> N >> A >> B;
int ans = max(A, B * N);
print(ans);
} | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
// long long
using ll = long long;
//出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin() end()
#define all(x) (x).begin(), (x).end()
// for
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
//最大公約数
unsigned gcd(unsigned a, unsigned b) {
if (a < b)
return gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int main() {
int N, A, B;
cin >> N >> A >> B;
int ans = min(A * N, B);
print(ans);
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"call.arguments.add"
] | 785,043 | 785,042 | u832995587 | cpp |
p02981 | #include <bits/stdc++.h>
#define ll long long
#define endl '\n'
using namespace std;
const ll mod = (ll)1e9 + 7;
const ll INF = 0x3f3f3f3f;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
// freopen("A.txt", "r", stdin);
#endif
int a, b, n;
cin >> n >> a >> b;
cout << n * min(a, b);
}
| #include <bits/stdc++.h>
#define ll long long
#define endl '\n'
using namespace std;
const ll mod = (ll)1e9 + 7;
const ll INF = 0x3f3f3f3f;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
// freopen("A.txt", "r", stdin);
#endif
int a, b, n;
cin >> n >> a >> b;
cout << min(n * a, b);
}
| [
"expression.operation.binary.remove"
] | 785,044 | 785,045 | u990641118 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define watch(x) cout << "->" << #x << " : " << x << endl;
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
typedef long long ll;
typedef unsigned long long llu;
const double PI = 2 * acos(0.0);
signed main() {
// freopen("","r",stdin);
// freopen("","w",stdout);
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, n * b) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define watch(x) cout << "->" << #x << " : " << x << endl;
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
typedef long long ll;
typedef unsigned long long llu;
const double PI = 2 * acos(0.0);
signed main() {
// freopen("","r",stdin);
// freopen("","w",stdout);
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b) << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 785,051 | 785,052 | u733246687 | cpp |
p02981 | #include <iostream>
using namespace std;
int main(void) {
int n, a, b;
cin >> n >> a >> b;
(n * a >= b) ? (cout << n * a) : (cout << b);
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
int n, a, b;
cin >> n >> a >> b;
(n * a >= b) ? (cout << b) : (cout << n * a);
return 0;
}
| [
"identifier.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 785,055 | 785,056 | u139018733 | cpp |
p02981 | #include <fstream>
#include <iostream>
using namespace std;
int main() {
ifstream fin("input.in");
ofstream fout("output.out");
int n, a, b;
fin >> n >> a >> b;
fout << min(n * a, b) << endl;
return 0;
}
| #include <fstream>
#include <iostream>
using namespace std;
int main() {
ifstream fin("input.in");
ofstream fout("output.out");
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b);
return 0;
}
| [
"identifier.change",
"expression.operation.binary.change",
"io.output.change",
"expression.operation.binary.remove"
] | 785,065 | 785,066 | u142188850 | cpp |
p02981 | #include <fstream>
#include <iostream>
using namespace std;
int main() {
ifstream fin("input.in");
ofstream fout("output.out");
int n, a, b;
fin >> n >> a >> b;
fout << min(n * a, b);
return 0;
}
| #include <fstream>
#include <iostream>
using namespace std;
int main() {
ifstream fin("input.in");
ofstream fout("output.out");
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b);
return 0;
}
| [
"identifier.change",
"expression.operation.binary.change",
"io.output.change"
] | 785,067 | 785,066 | u142188850 | cpp |
p02981 | /*
Vivek Rathi
CSE 2nd Year
MNNIT
*/
#include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define ll long long int
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define debug1(x) cout << #x << " " << x << endl;
#define debug2(x, y) cout << #x << " " << x << " " << #y << " " << y << endl;
#define debug3(x, y, z) \
cout << #x << " " << x << " " << #y << " " << y << " " << #z << " " << z \
<< endl;
#define present(c, x) ((c).find(x) != (c).end())
#define null NULL
#define mp make_pair
#define fi first
#define se second
#define boost \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define inf 1e18
#define flush fflush(stdout);
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set \
tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
ll modpower(ll a, ll b, ll c) {
ll res = 1;
while (b) {
if (b & 1LL)
res = (res * a) % c;
a = (a * a) % c;
b >>= 1;
}
return res;
}
//-------------------------------Template--Above------------------------------------------------
int main() {
boost ll n, a, b;
cin >> n >> a >> b;
cout << min(n * a, n * b) << endl;
return 0;
}
| /*
Vivek Rathi
CSE 2nd Year
MNNIT
*/
#include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define ll long long int
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define debug1(x) cout << #x << " " << x << endl;
#define debug2(x, y) cout << #x << " " << x << " " << #y << " " << y << endl;
#define debug3(x, y, z) \
cout << #x << " " << x << " " << #y << " " << y << " " << #z << " " << z \
<< endl;
#define present(c, x) ((c).find(x) != (c).end())
#define null NULL
#define mp make_pair
#define fi first
#define se second
#define boost \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define inf 1e18
#define flush fflush(stdout);
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set \
tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
ll modpower(ll a, ll b, ll c) {
ll res = 1;
while (b) {
if (b & 1LL)
res = (res * a) % c;
a = (a * a) % c;
b >>= 1;
}
return res;
}
//-------------------------------Template--Above------------------------------------------------
int main() {
boost ll n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b) << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 785,072 | 785,073 | u164414906 | cpp |
p02981 | #include <bits/stdc++.h>
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
#define mod 1000000007
#define fi first
#define se second
#define pii pair<int, int>
//#define push_back emplace_back
//#define push emplace
//#define insert emplace
#define int long long
#define endl '\n'
#define pll pair<long long, long long>
#define LONGLONG_MAX 10000000000000000
using namespace std;
// template <typename T>
// using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,
// tree_order_statistics_node_update>;
auto power(auto a, long long b) {
auto ans = 1;
// cout<<ans;
while (b > 0) {
if (b & 1) {
ans = (ans * a) % mod;
}
a = (a * a) % mod;
b >>= 1;
}
/// cout<<ans<<" ";
return ans;
}
void maxi(auto &a, auto b) { a = max(a, b); }
void mini(auto &a, auto b) { a = min(a, b); }
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, a, b;
cin >> n >> a >> b;
cout << n * min(a, b);
return 0;
} | #include <bits/stdc++.h>
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
#define mod 1000000007
#define fi first
#define se second
#define pii pair<int, int>
//#define push_back emplace_back
//#define push emplace
//#define insert emplace
#define int long long
#define endl '\n'
#define pll pair<long long, long long>
#define LONGLONG_MAX 10000000000000000
using namespace std;
// template <typename T>
// using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,
// tree_order_statistics_node_update>;
auto power(auto a, long long b) {
auto ans = 1;
// cout<<ans;
while (b > 0) {
if (b & 1) {
ans = (ans * a) % mod;
}
a = (a * a) % mod;
b >>= 1;
}
/// cout<<ans<<" ";
return ans;
}
void maxi(auto &a, auto b) { a = max(a, b); }
void mini(auto &a, auto b) { a = min(a, b); }
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b);
return 0;
} | [
"expression.operation.binary.remove"
] | 785,074 | 785,075 | u842263845 | 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) ? n * a : b) << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 785,078 | 785,079 | u199427147 | cpp |
p02981 | #include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
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 <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
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"
] | 785,082 | 785,083 | u861337693 | cpp |
p02981 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
int n, a, b;
int main() {
cin >> n >> a >> b;
cout << a * n + b << endl;
return 0;
}
| #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
int n, a, b;
int main() {
cin >> n >> a >> b;
cout << min(a * n, b) << endl;
return 0;
}
| [
"call.add",
"io.output.change",
"call.arguments.change"
] | 785,084 | 785,085 | u519950235 | cpp |
p02981 | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl '\n'
#define rep(i, a, b) for (int i = a; i < b; i++)
#define ff first
#define pii pair<int, int>
#define vii vector<pair<int, int>>
#define vi vector<int>
#define vvi vector<vector<int>>
#define vs vector<string>
#define ss second
#define pb push_back
#define mp make_pair
#define int long long
#define ll long long
#define all(a) a.begin(), a.end()
#define inf (1LL << 61)
#define ull unsigned long long
#define tr1(x) cout << #x << ": " << x << endl
#define tr2(x, y) cout << #x << ": " << x << " | " << #y << ": " << y << endl
#define tr4(x, y, z, d) \
cout << #x << ":" << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << " | " << #d << ": " << d << endl
#define tr3(x, y, z) \
cout << #x << ":" << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl
#define db1(x) cerr << #x << ": " << x << '\n'
#define db2(x, y) cerr << #x << ": " << x << '\t' << #y << ": " << y << '\n'
#define db3(x, y, z) \
cerr << #x << ": " << x << '\t' << #y << ": " << y << '\t' << #z << ": " \
<< z << '\n'
using namespace std;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1}; // 4 Direction
// int dx[]={1,1,0,-1,-1,-1,0,1};int dy[]={0,1,1,1,0,-1,-1,-1};//8 direction
bool compare(const pair<pair<string, int>, int> &a,
const pair<pair<string, int>, int> &b) {
if (a.ff.ff == b.ff.ff) {
return (a.ff.ss > b.ff.ss);
}
return (a.ff.ff < b.ff.ff);
}
int min(int a, int b) {
if (a < b) {
return a;
} else {
return b;
}
}
int max(int a, int b) {
if (a > b) {
return a;
} else {
return b;
}
}
int max(int a, int b, int c) { return (max(max(a, b), c)); }
int min(int a, int b, int c) { return (min(min(a, b), c)); }
int poww(int a, int b) {
int res = 1;
for (int i = 1; i <= b; ++i)
res *= a;
return res;
}
int findlcm(int arr[], int n) {
// Initialize result
int ans = arr[0];
// ans contains LCM of arr[0], ..arr[i]
// after i'th iteration,
for (int i = 1; i < n; i++)
ans = (((arr[i] * ans)) / (__gcd(arr[i], ans)));
return ans;
}
bool prime[100001];
void SieveOfEratosthenes(int n) {
memset(prime, true, sizeof(prime));
for (int p = 2; p * p <= n; p++) {
if (prime[p] == true) {
for (int i = p * p; i <= n; i += p)
prime[i] = false;
}
}
}
// Define mx for maximum range and MOD for large numbers
#define mx 500005
#define mod 1000000007
// Declare all the variables and global functions here -
int32_t main() {
IOS;
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, n * b);
} | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl '\n'
#define rep(i, a, b) for (int i = a; i < b; i++)
#define ff first
#define pii pair<int, int>
#define vii vector<pair<int, int>>
#define vi vector<int>
#define vvi vector<vector<int>>
#define vs vector<string>
#define ss second
#define pb push_back
#define mp make_pair
#define int long long
#define ll long long
#define all(a) a.begin(), a.end()
#define inf (1LL << 61)
#define ull unsigned long long
#define tr1(x) cout << #x << ": " << x << endl
#define tr2(x, y) cout << #x << ": " << x << " | " << #y << ": " << y << endl
#define tr4(x, y, z, d) \
cout << #x << ":" << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << " | " << #d << ": " << d << endl
#define tr3(x, y, z) \
cout << #x << ":" << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl
#define db1(x) cerr << #x << ": " << x << '\n'
#define db2(x, y) cerr << #x << ": " << x << '\t' << #y << ": " << y << '\n'
#define db3(x, y, z) \
cerr << #x << ": " << x << '\t' << #y << ": " << y << '\t' << #z << ": " \
<< z << '\n'
using namespace std;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1}; // 4 Direction
// int dx[]={1,1,0,-1,-1,-1,0,1};int dy[]={0,1,1,1,0,-1,-1,-1};//8 direction
bool compare(const pair<pair<string, int>, int> &a,
const pair<pair<string, int>, int> &b) {
if (a.ff.ff == b.ff.ff) {
return (a.ff.ss > b.ff.ss);
}
return (a.ff.ff < b.ff.ff);
}
int min(int a, int b) {
if (a < b) {
return a;
} else {
return b;
}
}
int max(int a, int b) {
if (a > b) {
return a;
} else {
return b;
}
}
int max(int a, int b, int c) { return (max(max(a, b), c)); }
int min(int a, int b, int c) { return (min(min(a, b), c)); }
int poww(int a, int b) {
int res = 1;
for (int i = 1; i <= b; ++i)
res *= a;
return res;
}
int findlcm(int arr[], int n) {
// Initialize result
int ans = arr[0];
// ans contains LCM of arr[0], ..arr[i]
// after i'th iteration,
for (int i = 1; i < n; i++)
ans = (((arr[i] * ans)) / (__gcd(arr[i], ans)));
return ans;
}
bool prime[100001];
void SieveOfEratosthenes(int n) {
memset(prime, true, sizeof(prime));
for (int p = 2; p * p <= n; p++) {
if (prime[p] == true) {
for (int i = p * p; i <= n; i += p)
prime[i] = false;
}
}
}
// Define mx for maximum range and MOD for large numbers
#define mx 500005
#define mod 1000000007
// Declare all the variables and global functions here -
int32_t main() {
IOS;
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b);
} | [
"expression.operation.binary.remove"
] | 785,102 | 785,103 | u757480088 | cpp |
p02981 | #include <stdio.h>
int main() {
int n, a, b;
scanf("%d", &n);
scanf("%d", &a);
scanf("%d", &b);
if (a * n >= b) {
printf("%d\n", a * n);
} else {
printf("%d\n", b);
}
return 0;
}
| #include <stdio.h>
int main() {
int n, a, b;
scanf("%d", &n);
scanf("%d", &a);
scanf("%d", &b);
if (a * n <= b) {
printf("%d\n", a * n);
} else {
printf("%d\n", b);
}
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 785,109 | 785,110 | u959863738 | cpp |
p02981 | #ifndef LOCAL
#pragma GCC optimize("O3")
#endif
#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i;
ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c &) { ris; }
#endif
}
;
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0);
typedef long long ll;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
int main() {
fastio int n;
int a, b;
cin >> n >> a >> b;
cout << n * min(a, b) << endl;
return 0;
}
| #ifndef LOCAL
#pragma GCC optimize("O3")
#endif
#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i;
ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c &) { ris; }
#endif
}
;
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0);
typedef long long ll;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
int main() {
fastio int n;
int a, b;
cin >> n >> a >> b;
cout << min(a * n, b) << endl;
return 0;
}
| [] | 785,115 | 785,116 | u101513772 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define ffor(i, a, b) for (int i = a; i < b; i++)
#define bfor(i, a, b) for (int i = a - 1; i >= b; i--)
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define mem(x, y) memset(x, y, sizeof(x))
#define all(x) x.begin(), x.end()
#define SP(x) setprecision(x)
#define sz(x) (int)x.size()
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define PI 3.1415926535
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, n * b);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define ffor(i, a, b) for (int i = a; i < b; i++)
#define bfor(i, a, b) for (int i = a - 1; i >= b; i--)
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define mem(x, y) memset(x, y, sizeof(x))
#define all(x) x.begin(), x.end()
#define SP(x) setprecision(x)
#define sz(x) (int)x.size()
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define PI 3.1415926535
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b);
return 0;
}
| [
"expression.operation.binary.remove"
] | 785,128 | 785,129 | u059187806 | cpp |
p02981 | #include "bits/stdc++.h"
#define lpa(i, a, b) for (int i = a; i < b; ++i)
#define lp(i, n) lpa(i, 0, n)
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define print_v(v, n) \
lp(i, n) cout << v[i] << ' '; \
cout << '\n';
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main(int argc, char const *argv[]) {
int n, a, b;
cin >> n >> a >> b;
cout << n * min(a, b);
return 0;
} | #include "bits/stdc++.h"
#define lpa(i, a, b) for (int i = a; i < b; ++i)
#define lp(i, n) lpa(i, 0, n)
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define print_v(v, n) \
lp(i, n) cout << v[i] << ' '; \
cout << '\n';
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main(int argc, char const *argv[]) {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b);
return 0;
} | [
"expression.operation.binary.remove"
] | 785,135 | 785,136 | u603461744 | cpp |
p02981 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define MAX(a, b) (a > b ? a : b)
#define MIN(a, b) (a < b ? a : b)
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int, int> pii;
int gi() {
int a;
scanf("%d", &a);
return a;
}
ll gli() {
ll a;
scanf("%lld", &a);
return a;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n = gi();
int a = gi();
int b = gi();
n *= a;
a = MIN(a, b);
printf("%d\n", a);
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define MAX(a, b) (a > b ? a : b)
#define MIN(a, b) (a < b ? a : b)
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int, int> pii;
int gi() {
int a;
scanf("%d", &a);
return a;
}
ll gli() {
ll a;
scanf("%lld", &a);
return a;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n = gi();
int a = gi();
int b = gi();
n *= a;
a = MIN(n, b);
printf("%d\n", a);
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 785,137 | 785,138 | u507795624 | cpp |
p02981 | #include <stdio.h>
int main() {
int N, A, B;
scanf("%d %d %d", &N, &A, &B);
if (A > B) {
printf("%d", B * N);
} else
(printf("%d", A * N));
return 0;
} | #include <stdio.h>
int main() {
int N, A, B;
scanf("%d %d %d", &N, &A, &B);
if (N * A > B) {
printf("%d", B);
} else
(printf("%d", A * N));
return 0;
} | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 785,143 | 785,144 | u960754554 | cpp |
p02981 | #include <stdio.h>
int main() {
int N, A, B;
scanf("%d %d", &N, &A, &B);
int Train = N * A;
if (Train < B) {
printf("%d", Train);
} else {
printf("%d", B);
}
return 0;
}
| #include <stdio.h>
int main() {
int N, A, B;
scanf("%d %d %d", &N, &A, &B);
int Train = N * A;
if (Train < B) {
printf("%d", Train);
} else {
printf("%d", B);
}
return 0;
}
| [
"literal.string.change",
"call.arguments.change"
] | 785,149 | 785,150 | u715928544 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int n, a, b;
#ifdef true
cin >> n >> a >> b;
#else
n = 4;
a = 2;
b = 7;
n = 20;
a = 50;
b = 50;
#endif
int train = n * a;
int taxi = b;
cout << (train > taxi ? taxi : train) << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, a, b;
#if true
cin >> n >> a >> b;
#else
n = 4;
a = 2;
b = 7;
n = 20;
a = 50;
b = 50;
#endif
int train = n * a;
int taxi = b;
cout << (train > taxi ? taxi : train) << endl;
return 0;
} | [] | 785,168 | 785,169 | u273446375 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int x = n * a;
(x > b) ? cout << (n * a) << endl : cout << b << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int x = n * a;
(x < b) ? cout << x << endl : cout << b << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 785,176 | 785,177 | u447706255 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << n * min(a, b) << "\n";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b) << "\n";
} | [
"expression.operation.binary.remove"
] | 785,182 | 785,183 | u599197778 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << (min(a, b) * n);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << (min(a * n, b));
return 0;
}
| [
"expression.operation.binary.remove"
] | 785,192 | 785,193 | u989928804 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << n * min(a, b) << endl;
return 0;
}
| #include <bits/stdc++.h>
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"
] | 785,204 | 785,205 | u404173371 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if (a > b)
cout << n * 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 << b << endl;
else
cout << n * a << endl;
}
| [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 785,208 | 785,209 | u453725440 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, n;
cin >> n >> a >> b;
cout << min(a, b) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, n;
cin >> n >> a >> b;
cout << min(n * a, b) << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 785,212 | 785,213 | u020799651 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, n;
cin >> n >> a >> b;
cout << min(n * a, n * b) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, n;
cin >> n >> a >> b;
cout << min(n * a, b) << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 785,214 | 785,213 | u020799651 | cpp |
p02981 | #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);
} | #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"
] | 785,219 | 785,220 | u624463308 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mem(dp, a) memset(dp, a, sizeof dp)
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define repb(i, a, b) for (ll i = a; i >= b; i--)
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
#define tr(c, it) for (auto const &it : c)
#define xlr8 \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define sz(c) (c).size()
#define all(c) (c).begin(), (c).end()
#define sl(a) scanf("%lld", &a);
#define TH 1000
#define F first
#define S second
ll INF = 1e18 + 10;
int main() {
int n, a, b;
cin >> n >> a >> b;
if (n * b < a)
cout << n * b;
else
cout << a;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mem(dp, a) memset(dp, a, sizeof dp)
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define repb(i, a, b) for (ll i = a; i >= b; i--)
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
#define tr(c, it) for (auto const &it : c)
#define xlr8 \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define sz(c) (c).size()
#define all(c) (c).begin(), (c).end()
#define sl(a) scanf("%lld", &a);
#define TH 1000
#define F first
#define S second
ll INF = 1e18 + 10;
int main() {
int n, a, b;
cin >> n >> b >> a;
if (n * b < a)
cout << n * b;
else
cout << a;
}
| [
"expression.operation.binary.remove"
] | 785,221 | 785,222 | u258080819 | cpp |
p02981 | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int n, a, b;
int min(int x, int y) { return x < y ? x : y; }
int main() {
scanf("%d%d%d", &n, &a, &b);
printf("%d\n", n * min(a, b));
return 0;
} | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int n, a, b;
int min(int x, int y) { return x < y ? x : y; }
int main() {
scanf("%d%d%d", &n, &a, &b);
printf("%d\n", min(n * a, b));
return 0;
} | [
"expression.operation.binary.remove"
] | 785,225 | 785,226 | u041194459 | cpp |
p02981 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int i, j;
int n, a, b;
cin >> n >> a >> b;
cout << n * min(a, b) << endl;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int i, j;
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b) << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 785,231 | 785,232 | u006421797 | cpp |
p02981 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define sz(a) static_cast<int>((a).size())
#define f first
#define s second
#define els(v) for (auto &el : (v))
#ifdef KIRYA
#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#else
#define dbg(...)
#endif
template <typename T> void _dbg(const char *_s, T _h) {
cerr << _s << " = " << _h << "\n";
}
template <typename T, typename... Ts>
void _dbg(const char *_s, T _h, Ts... _t) {
int _b = 0;
while (((_b += *_s == '(') -= *_s == ')') != 0 || *_s != ',')
cerr << *_s++;
cerr << " = " << _h << ",";
_dbg(_s + 1, _t...);
}
const int64_t INF = static_cast<int64_t>(1e9) + 7;
const int64_t LINF = INF * INF;
const int MAXN = static_cast<int>(1e6) + 17;
void solve() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b) * n;
}
int main() {
cin.tie(nullptr);
cout.tie(nullptr);
ios_base::sync_with_stdio(false);
int q = 1;
for (int i = 0; i < q; ++i) {
solve();
}
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define sz(a) static_cast<int>((a).size())
#define f first
#define s second
#define els(v) for (auto &el : (v))
#ifdef KIRYA
#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#else
#define dbg(...)
#endif
template <typename T> void _dbg(const char *_s, T _h) {
cerr << _s << " = " << _h << "\n";
}
template <typename T, typename... Ts>
void _dbg(const char *_s, T _h, Ts... _t) {
int _b = 0;
while (((_b += *_s == '(') -= *_s == ')') != 0 || *_s != ',')
cerr << *_s++;
cerr << " = " << _h << ",";
_dbg(_s + 1, _t...);
}
const int64_t INF = static_cast<int64_t>(1e9) + 7;
const int64_t LINF = INF * INF;
const int MAXN = static_cast<int>(1e6) + 17;
void solve() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b);
}
int main() {
cin.tie(nullptr);
cout.tie(nullptr);
ios_base::sync_with_stdio(false);
int q = 1;
for (int i = 0; i < q; ++i) {
solve();
}
} | [
"expression.operation.binary.remove"
] | 785,237 | 785,238 | u615833720 | cpp |
p02981 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
#define min_3(a, b, c) min(a, min(b, c))
#define max_3(a, b, c) max(a, max(b, c))
typedef long long ll;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, n * b) << endl;
}
| #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
#define min_3(a, b, c) min(a, min(b, c))
#define max_3(a, b, c) max(a, max(b, c))
typedef long long ll;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b) << endl;
}
| [
"expression.operation.binary.remove"
] | 785,241 | 785,242 | u170650966 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, n, x = 1;
cin >> n >> a >> b;
x = n * a;
if (x > b) {
cout << x << endl;
} else {
cout << b;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, n, x = 1;
cin >> n >> a >> b;
x = n * a;
if (x < b) {
cout << x << endl;
} else {
cout << b << endl;
}
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"io.output.newline.add"
] | 785,243 | 785,244 | u166706609 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define UN unsigned
#define ll long long
int main(void) {
int n, a, b;
cin >> n >> a >> b;
cout << n * min(a, b);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define UN unsigned
#define ll long long
int main(void) {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b);
return 0;
} | [
"expression.operation.binary.remove"
] | 785,245 | 785,246 | u166272617 | cpp |
p02981 | // Littleboy123 Template 1.0
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef long long int ll;
typedef unsigned long long int ull;
#define FOR(a, b, c) for (ll(a) = (b); (a) < (c); ++(a))
#define FORE(a, b, c) for (ll(a) = (b); (a) <= (c); ++(a))
#define FORN(a, b, c) for (ll(a) = (b); (a) > (c); --(a))
#define FORNE(a, b, c) for (ll(a) = (b); (a) >= (c); --(a))
#define COUT(a) cout << (a) << '\n'
#define MEM(a, b) memset((a), (b), sizeof((a)));
#define nl '\n'
#define fi first
#define se second
#define mp make_pair
#define pb push_back
void init() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
// End of template
int main() {
init();
int n, a, b;
cin >> n >> a >> b;
cout << n * min(a, b) << nl;
return 0;
}
| // Littleboy123 Template 1.0
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef long long int ll;
typedef unsigned long long int ull;
#define FOR(a, b, c) for (ll(a) = (b); (a) < (c); ++(a))
#define FORE(a, b, c) for (ll(a) = (b); (a) <= (c); ++(a))
#define FORN(a, b, c) for (ll(a) = (b); (a) > (c); --(a))
#define FORNE(a, b, c) for (ll(a) = (b); (a) >= (c); --(a))
#define COUT(a) cout << (a) << '\n'
#define MEM(a, b) memset((a), (b), sizeof((a)));
#define nl '\n'
#define fi first
#define se second
#define mp make_pair
#define pb push_back
void init() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
// End of template
int main() {
init();
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b) << nl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 785,257 | 785,258 | u398659810 | cpp |
p02981 | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define swap(a, b) (a += b, b = a - b, a -= b)
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
cout << min(A, B) * N << endl;
}
| #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define swap(a, b) (a += b, b = a - b, a -= b)
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
cout << min(B, A * N) << endl;
}
| [
"call.arguments.change",
"io.output.change"
] | 785,259 | 785,260 | u466393447 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, t1, t2;
cin >> n >> a >> b;
t1 = n * a;
t2 = b;
if (t1 < t2)
cout << t1 << endl;
else if (t1 > t2)
cout << t2 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, t1, t2;
cin >> n >> a >> b;
t1 = n * a;
t2 = b;
if (t1 <= t2)
cout << t1 << endl;
else if (t1 >= t2)
cout << t2 << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 785,271 | 785,272 | u346889931 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, t1, t2;
cin >> n >> a >> b;
t1 = n * a;
t2 = n * b;
if (t1 < t2)
cout << t1 << endl;
else if (t1 > t2)
cout << t2 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, t1, t2;
cin >> n >> a >> b;
t1 = n * a;
t2 = b;
if (t1 <= t2)
cout << t1 << endl;
else if (t1 >= t2)
cout << t2 << endl;
return 0;
}
| [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 785,273 | 785,272 | u346889931 | cpp |
p02981 | #include <iostream>
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;
return 0;
}
| #include <iostream>
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;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 785,276 | 785,277 | u777474133 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (A > B) {
cout << N * B;
} else {
cout << N * A;
}
return 0;
}
| #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;
}
| [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 785,281 | 785,282 | u612908015 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (A > B) {
cout << N * B << 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"
] | 785,283 | 785,284 | u729695898 | cpp |
p02981 | #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
typedef pair<long long, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i, x) for (long long i = 0; i < x; i++)
#define repn(i, x) for (long long i = 1; i <= x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define ERASE(x) x.erase(unique(x.begin(), x.end()), x.end())
#define POSL(x, v) (lower_bound(x.begin(), x.end(), v) - x.begin())
#define POSU(x, v) (upper_bound(x.begin(), x.end(), v) - x.begin())
long long n, h[100005];
ll dp[100005];
#define ALL(v) (v).begin(), (v).end()
//#define MAX(a,b) if(a>b)
#define MAX(a, b) (((a) > (b)) ? (a) : (b))
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define DEBUG
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
stack<long long> sta;
queue<long long> que;
set<string> s_set;
int main() {
long long A, B, C, D, E, F, G, H, I, J, L, N, M, K, O, P, Q, R, S, T, U, V, W,
X, Y, Z;
long long ans;
ans = 0;
string s;
long long sum, sum1, sum2, sum3, sum4;
sum = 0;
sum1 = 0;
sum2 = 0;
sum3 = 0;
sum4 = 0;
long long flg, flg1, cnt, cnt1, cnt2, cnt3, cnt4;
flg = 0;
flg1 = 0;
cnt = 0;
cnt1 = 0;
cnt2 = 0;
cnt3 = 0;
cnt4 = 0;
long long max;
long long max1;
max = 0;
max1 = 0;
long long min;
long long min1;
min = INF;
min1 = INF;
long long work, work1, work2, work3, work4;
work = 0;
work1 = 0;
work2 = 0;
work3 = 0;
work4 = 0;
// long long a[4];
long long value;
value = 0;
// std::cin >> N;
// std::cin >> N >> M;
std::cin >> N >> M >> K;
// std::cin >> N >> K;
// std::vector<long long> v(N);
// std::vector<long long> w(N);
// vec.push_back( i );
// accumulate(vec.begin(), vec.end(), 0)
// 配列入力1
/*
for(long long i=0; i<N; i++){
std::cin >> v[i];
}
*/
// std::sort(v.begin(),v.end());//昇順ソート
// std::sort(v.begin(),v.end(),std::greater<long long>());//降順ソート
//通常
/*
for(long long i=0; i<N; i++){
#ifdef DEBUG
//printf("%d\n",v[i]);
#endif
}
*/
//文字列入力
/*
std::cin >> s;
//sort(s.begin(), s.end());
for(long long i=0; i<s.length(); i++){
//work=(s[i+2]-'0')+10*(s[i+1]-'0')+100*(s[i]-'0');
if(s[i]!='1'){
}
//S.substr(i, 5);
//S.size();
}
*/
// 配列入力2
/*
for(long long i=0; i<N; i++){
std::cin >> w[i];
}
*/
// std::sort(w.begin(),w.end());//昇順ソート
// std::sort(w.begin(),w.end(),std::greater<long long>());//降順ソート
// ペア関連
/*
vector<pair<long long, long long> > pairs(N);
for(long long i=0; i<N; i++){
long long a, b;
cin >> a >> b;
pairs[i] = make_pair(a, b);
}
sort(pairs.begin(), pairs.end());
//sort(pairs.begin(), pairs.end(),greater<pair<long long,long long> >());
//通常（ペア用）
for(long long i=0; i<N; i++){
}
*/
// set関連
/*
std::set<long long> st;
for(long long i=0; i<N; i++){
std::cin >> v[i];
if(st.find(v[i])==st.end()){
st.insert(v[i]);
}
else{
st.erase(v[i]);
}
}
*/
// set 文字列関連
/*
for(long long i=0; i<S.size(); i++) {
s.insert(S[i]);
}
cnt=(int)s.find('a');
*/
// map関連
/*
bool ok = true;
map<char,char> ma, ima;
for (int i = 0; i < S.size(); ++i) {
char s = S[i], t = T[i];
if (ma.count(s)) if (ma[s] != t) ok = false;
if (ima.count(t)) if (ima[t] != s) ok = false;
ma[s] = t; ima[t] = s;
}
*/
// 各桁の取り出し 関連
/*
a[0] = (value % 10);
value /= 10;// 1桁目を取り出す
a[1] = (value % 10);
value /= 10;// 2桁目を取り出す
a[2] = (value % 10);
value /= 10;// 3桁目を取り出す
a[3] = (value % 10);
value /= 10;// 4桁目を取り出す
work1=a[0]+10*a[1];
work2=a[2]+10*a[3];
*/
if (M > K) {
printf("%lld", N * K);
// printf("%lld",N);
// puts("Yes");
// printf("%d",st.size());
//文字列の出力
// std::cout << s << std::endl;
// printf("%.12f\n",ret);
// cout << sum << endl;
} else {
printf("%lld", N * M);
}
return 0;
}
| #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
typedef pair<long long, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i, x) for (long long i = 0; i < x; i++)
#define repn(i, x) for (long long i = 1; i <= x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define ERASE(x) x.erase(unique(x.begin(), x.end()), x.end())
#define POSL(x, v) (lower_bound(x.begin(), x.end(), v) - x.begin())
#define POSU(x, v) (upper_bound(x.begin(), x.end(), v) - x.begin())
long long n, h[100005];
ll dp[100005];
#define ALL(v) (v).begin(), (v).end()
//#define MAX(a,b) if(a>b)
#define MAX(a, b) (((a) > (b)) ? (a) : (b))
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define DEBUG
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
stack<long long> sta;
queue<long long> que;
set<string> s_set;
int main() {
long long A, B, C, D, E, F, G, H, I, J, L, N, M, K, O, P, Q, R, S, T, U, V, W,
X, Y, Z;
long long ans;
ans = 0;
string s;
long long sum, sum1, sum2, sum3, sum4;
sum = 0;
sum1 = 0;
sum2 = 0;
sum3 = 0;
sum4 = 0;
long long flg, flg1, cnt, cnt1, cnt2, cnt3, cnt4;
flg = 0;
flg1 = 0;
cnt = 0;
cnt1 = 0;
cnt2 = 0;
cnt3 = 0;
cnt4 = 0;
long long max;
long long max1;
max = 0;
max1 = 0;
long long min;
long long min1;
min = INF;
min1 = INF;
long long work, work1, work2, work3, work4;
work = 0;
work1 = 0;
work2 = 0;
work3 = 0;
work4 = 0;
// long long a[4];
long long value;
value = 0;
// std::cin >> N;
// std::cin >> N >> M;
std::cin >> N >> M >> K;
// std::cin >> N >> K;
// std::vector<long long> v(N);
// std::vector<long long> w(N);
// vec.push_back( i );
// accumulate(vec.begin(), vec.end(), 0)
// 配列入力1
/*
for(long long i=0; i<N; i++){
std::cin >> v[i];
}
*/
// std::sort(v.begin(),v.end());//昇順ソート
// std::sort(v.begin(),v.end(),std::greater<long long>());//降順ソート
//通常
/*
for(long long i=0; i<N; i++){
#ifdef DEBUG
//printf("%d\n",v[i]);
#endif
}
*/
//文字列入力
/*
std::cin >> s;
//sort(s.begin(), s.end());
for(long long i=0; i<s.length(); i++){
//work=(s[i+2]-'0')+10*(s[i+1]-'0')+100*(s[i]-'0');
if(s[i]!='1'){
}
//S.substr(i, 5);
//S.size();
}
*/
// 配列入力2
/*
for(long long i=0; i<N; i++){
std::cin >> w[i];
}
*/
// std::sort(w.begin(),w.end());//昇順ソート
// std::sort(w.begin(),w.end(),std::greater<long long>());//降順ソート
// ペア関連
/*
vector<pair<long long, long long> > pairs(N);
for(long long i=0; i<N; i++){
long long a, b;
cin >> a >> b;
pairs[i] = make_pair(a, b);
}
sort(pairs.begin(), pairs.end());
//sort(pairs.begin(), pairs.end(),greater<pair<long long,long long> >());
//通常（ペア用）
for(long long i=0; i<N; i++){
}
*/
// set関連
/*
std::set<long long> st;
for(long long i=0; i<N; i++){
std::cin >> v[i];
if(st.find(v[i])==st.end()){
st.insert(v[i]);
}
else{
st.erase(v[i]);
}
}
*/
// set 文字列関連
/*
for(long long i=0; i<S.size(); i++) {
s.insert(S[i]);
}
cnt=(int)s.find('a');
*/
// map関連
/*
bool ok = true;
map<char,char> ma, ima;
for (int i = 0; i < S.size(); ++i) {
char s = S[i], t = T[i];
if (ma.count(s)) if (ma[s] != t) ok = false;
if (ima.count(t)) if (ima[t] != s) ok = false;
ma[s] = t; ima[t] = s;
}
*/
// 各桁の取り出し 関連
/*
a[0] = (value % 10);
value /= 10;// 1桁目を取り出す
a[1] = (value % 10);
value /= 10;// 2桁目を取り出す
a[2] = (value % 10);
value /= 10;// 3桁目を取り出す
a[3] = (value % 10);
value /= 10;// 4桁目を取り出す
work1=a[0]+10*a[1];
work2=a[2]+10*a[3];
*/
if (M * N > K) {
printf("%lld", K);
// printf("%lld",N);
// puts("Yes");
// printf("%d",st.size());
//文字列の出力
// std::cout << s << std::endl;
// printf("%.12f\n",ret);
// cout << sum << endl;
} else {
printf("%lld", N * M);
}
return 0;
}
| [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 785,294 | 785,295 | u069521477 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int a, b, n;
cin >> n >> a >> b;
cout << ((n * a) < b) ? (n * a) : b;
} | #include <iostream>
using namespace std;
int main() {
int a, b, n;
cin >> n >> a >> b;
cout << (((n * a) < b) ? (n * a) : b) << endl;
}
| [
"io.output.change"
] | 785,296 | 785,297 | u003243933 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int gcdEx(int a, int b, int *x, int *y) {
if (!a) {
*x = 0;
*y = 1;
return b;
}
int x1, y1, gcd = gcdEx(b % a, a, &x1, &y1);
*x = y1 - (b / a) * x1;
*y = x1;
return gcd;
}
int modI(int b, int m) {
int x, y;
gcdEx(b, m, &x, &y);
return (x % m + m) % m;
}
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef set<int> si;
typedef map<string, int> msi;
#define all(x) (x).begin(), (x).end()
#define make_unique(x) \
sort(all((x))); \
(x).resize(unique(all((x))) - (x).begin())
#define loop(b, n) for (int i = b; i < n; i++)
#define loopv(b, n, a) for (int i = b; i < n; i += a)
#define loopr(b, n) for (int i = n; i >= 0; i--)
#define sum(a) (accumulate((a).begin(), (a).end(), 0ll))
#define mine(a) (*min_element((a).begin(), (a).end()))
#define maxe(a) (*max_element((a).begin(), (a).end()))
#define mini(a) (min_element((a).begin(), (a).end()) - (a).begin())
#define maxi(a) (max_element((a).begin(), (a).end()) - (a).begin())
#define lowb(a, x) (lower_bound((a).begin(), (a).end(), (x)) - (a).begin())
#define uppb(a, x) (upper_bound((a).begin(), (a).end(), (x)) - (a).begin())
#define start_routine() int begtime = clock();
#define end_routine() \
int endtime = clock(); \
cerr << "\n\n" \
<< "Time elapsed: " << (endtime - begtime) * 1000 / CLOCKS_PER_SEC \
<< " ms\n\n"; \
return 0
#define mp make_pair
#define ff first
#define ss second
#define pb push_back
#define MOD 1000000007
#define modA(a, b) (((a % MOD) + (b % MOD)) % MOD)
#define modS(a, b) \
(((((a % MOD) - (b % MOD)) % MOD) < 0) \
? (int)(MOD + ((a % MOD) - (b % MOD)) % MOD) \
: (int)(((a % MOD) - (b % MOD)) % MOD))
#define modM(a, b) (int)((((ll)(a % MOD)) * ((ll)(b % MOD))) % MOD)
#define modD(a, b) ((modI(b, MOD) * (a % MOD)) % MOD)
ll modP(ll x, ll y) {
ll r = 1;
x %= MOD;
while (y > 0) {
if (y & 1) {
r = (r * x) % MOD;
}
y = y >> 1;
x = (x * x) % MOD;
}
return r;
}
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cin.exceptions(cin.failbit);
ll n, a, b, ans;
cin >> n >> a >> b;
ans = n * min(a, b);
cout << ans << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int gcdEx(int a, int b, int *x, int *y) {
if (!a) {
*x = 0;
*y = 1;
return b;
}
int x1, y1, gcd = gcdEx(b % a, a, &x1, &y1);
*x = y1 - (b / a) * x1;
*y = x1;
return gcd;
}
int modI(int b, int m) {
int x, y;
gcdEx(b, m, &x, &y);
return (x % m + m) % m;
}
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef set<int> si;
typedef map<string, int> msi;
#define all(x) (x).begin(), (x).end()
#define make_unique(x) \
sort(all((x))); \
(x).resize(unique(all((x))) - (x).begin())
#define loop(b, n) for (int i = b; i < n; i++)
#define loopv(b, n, a) for (int i = b; i < n; i += a)
#define loopr(b, n) for (int i = n; i >= 0; i--)
#define sum(a) (accumulate((a).begin(), (a).end(), 0ll))
#define mine(a) (*min_element((a).begin(), (a).end()))
#define maxe(a) (*max_element((a).begin(), (a).end()))
#define mini(a) (min_element((a).begin(), (a).end()) - (a).begin())
#define maxi(a) (max_element((a).begin(), (a).end()) - (a).begin())
#define lowb(a, x) (lower_bound((a).begin(), (a).end(), (x)) - (a).begin())
#define uppb(a, x) (upper_bound((a).begin(), (a).end(), (x)) - (a).begin())
#define start_routine() int begtime = clock();
#define end_routine() \
int endtime = clock(); \
cerr << "\n\n" \
<< "Time elapsed: " << (endtime - begtime) * 1000 / CLOCKS_PER_SEC \
<< " ms\n\n"; \
return 0
#define mp make_pair
#define ff first
#define ss second
#define pb push_back
#define MOD 1000000007
#define modA(a, b) (((a % MOD) + (b % MOD)) % MOD)
#define modS(a, b) \
(((((a % MOD) - (b % MOD)) % MOD) < 0) \
? (int)(MOD + ((a % MOD) - (b % MOD)) % MOD) \
: (int)(((a % MOD) - (b % MOD)) % MOD))
#define modM(a, b) (int)((((ll)(a % MOD)) * ((ll)(b % MOD))) % MOD)
#define modD(a, b) ((modI(b, MOD) * (a % MOD)) % MOD)
ll modP(ll x, ll y) {
ll r = 1;
x %= MOD;
while (y > 0) {
if (y & 1) {
r = (r * x) % MOD;
}
y = y >> 1;
x = (x * x) % MOD;
}
return r;
}
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cin.exceptions(cin.failbit);
ll n, a, b, ans;
cin >> n >> a >> b;
ans = min(a * n, b);
cout << ans << "\n";
return 0;
}
| [
"expression.operation.binary.remove",
"assignment.change"
] | 785,298 | 785,299 | u755134895 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, a, b;
cin >> n >> a >> b;
long mi = min(n * a, n * b);
cout << mi << endl;
// your code goes here
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, a, b;
cin >> n >> a >> b;
long mi = min(n * a, b);
cout << mi << endl;
// your code goes here
return 0;
} | [
"expression.operation.binary.remove"
] | 785,302 | 785,303 | u449675403 | cpp |
p02981 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const int inf = 2147483647, dx[] = {-1, 0, 1, 0},
dy[] = {0, -1, 0, 1}; // 上 左 下 右
const int N = 100005, M = 1000005, K = 200005, mod = 1000000007;
const long long llinf = 9223372036854775807ll;
// int & long long
int n, a, b;
int main() {
cin >> n >> a >> b;
cout << n * min(a, b);
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const int inf = 2147483647, dx[] = {-1, 0, 1, 0},
dy[] = {0, -1, 0, 1}; // 上 左 下 右
const int N = 100005, M = 1000005, K = 200005, mod = 1000000007;
const long long llinf = 9223372036854775807ll;
// int & long long
int n, a, b;
int main() {
cin >> n >> a >> b;
cout << min(a * n, b);
return 0;
}
| [
"expression.operation.binary.remove"
] | 785,312 | 785,313 | u965118468 | cpp |
p02981 | #define LOCAL
#include "bits/stdc++.h"
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define LLINF ((long long)1e18) // 1234567890987654321
#define INF 1234567890ll
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define db 0
#define EPS (1e-7) // 0.0000001 the value
#define PI (acos((ld)-1.0))
#define MAXN (300006)
#define ll long long int
#define ld long double
mt19937
rng(chrono::steady_clock::now()
.time_since_epoch()
.count()); // can be used by calling rng() or shuffle(A, A+n, rng)
#define FOR(ii, ss, ee) for (ll ii = ss; ii < (ll)ee; ++ii)
#define space " "
#define cbr cerr << "hi\n"
#define mmst(x, v) memset((x), v, sizeof((x)))
#define siz(x) ((ll)x.size())
#define ph push
#define btinpct(x) __builtin_popcountll((x))
#define all(x) (x).begin(), (x).end()
#define lbd(x, y) lower_bound(all(x), y)
#define ubd(x, y) upper_bound(all(x), y)
typedef pair<ll, ll> pi;
typedef pair<ll, pi> spi;
typedef pair<pi, pi> dpi;
inline ll rand(ll x, ll y) {
++y;
return (rng() % (y - x)) + x;
} // inclusivesss
string to_string(char c) {
string s(1, c);
return s;
}
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A> string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
void degug_out() { cerr << endl; }
template <typename Head, typename... Tail> void degug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
degug_out(T...);
}
inline ll gcd(ll a, ll b) {
if (a > b)
swap(a, b);
if (a == 0)
return b;
return gcd(b % a, a);
}
#ifdef LOCAL
#define degug(...) cerr << "[" << #__VA_ARGS__ << "]:", degug_out(__VA_ARGS__)
#else
#define degug(...) 42
#define cerr \
if (0) \
cout
#endif
ll a, b, c;
int main() {
cin >> a >> b >> b;
cout << min(a * b, c);
}
| #define LOCAL
#include "bits/stdc++.h"
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define LLINF ((long long)1e18) // 1234567890987654321
#define INF 1234567890ll
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define db 0
#define EPS (1e-7) // 0.0000001 the value
#define PI (acos((ld)-1.0))
#define MAXN (300006)
#define ll long long int
#define ld long double
mt19937
rng(chrono::steady_clock::now()
.time_since_epoch()
.count()); // can be used by calling rng() or shuffle(A, A+n, rng)
#define FOR(ii, ss, ee) for (ll ii = ss; ii < (ll)ee; ++ii)
#define space " "
#define cbr cerr << "hi\n"
#define mmst(x, v) memset((x), v, sizeof((x)))
#define siz(x) ((ll)x.size())
#define ph push
#define btinpct(x) __builtin_popcountll((x))
#define all(x) (x).begin(), (x).end()
#define lbd(x, y) lower_bound(all(x), y)
#define ubd(x, y) upper_bound(all(x), y)
typedef pair<ll, ll> pi;
typedef pair<ll, pi> spi;
typedef pair<pi, pi> dpi;
inline ll rand(ll x, ll y) {
++y;
return (rng() % (y - x)) + x;
} // inclusivesss
string to_string(char c) {
string s(1, c);
return s;
}
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A> string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
void degug_out() { cerr << endl; }
template <typename Head, typename... Tail> void degug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
degug_out(T...);
}
inline ll gcd(ll a, ll b) {
if (a > b)
swap(a, b);
if (a == 0)
return b;
return gcd(b % a, a);
}
#ifdef LOCAL
#define degug(...) cerr << "[" << #__VA_ARGS__ << "]:", degug_out(__VA_ARGS__)
#else
#define degug(...) 42
#define cerr \
if (0) \
cout
#endif
ll a, b, c;
int main() {
cin >> a >> b >> c;
cout << min(a * b, c);
}
| [
"identifier.change",
"expression.operation.binary.change"
] | 785,314 | 785,315 | u844961982 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a * b >= a * c) {
cout << a * 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.operation.binary.remove"
] | 785,328 | 785,329 | u308549429 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a * b >= b * c) {
cout << b * 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.operation.binary.remove"
] | 785,330 | 785,329 | u308549429 | 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 << a << endl;
else
cout << b << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n, a, b;
cin >> n >> a >> b;
if (n * a < b)
cout << a * n << endl;
else
cout << b << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 785,340 | 785,341 | u771184600 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int train = n * a;
if (train < b) {
cout << train << endl;
return 0;
}
if (train > b) {
cout << b << endl;
return 0;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int train = n * a;
if (train < b) {
cout << train << endl;
return 0;
}
if (train >= b) {
cout << b << endl;
return 0;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 785,348 | 785,349 | u948618130 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int n, a, b;
int main() {
scanf("%d", &n, &a, &b);
printf("%d", min(n * a, b));
}
| #include <bits/stdc++.h>
using namespace std;
int n, a, b;
int main() {
scanf("%d %d %d", &n, &a, &b);
printf("%d", min(n * a, b));
}
| [
"literal.string.change",
"call.arguments.change"
] | 785,350 | 785,351 | u076783581 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
//#include <vector>
typedef long long ll;
// vector <ll > v[100];
// ll b1[10005][1];
int main() {
int n, a, b;
cin >> n >> a >> b;
if (n * a <= n)
cout << a * n << endl;
else
cout << b << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
//#include <vector>
typedef long long ll;
// vector <ll > v[100];
// ll b1[10005][1];
int main() {
int n, a, b;
cin >> n >> a >> b;
if (n * a < b)
cout << a * n << endl;
else
cout << b << endl;
return 0;
}
| [] | 785,358 | 785,359 | u640918351 | cpp |
p02981 | #define REP(i, t, n) for (int i = t; i < n; i++)
#define ALL(n) (n).begin(), (n).end()
#include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef bool BOOL;
typedef short WORD;
typedef unsigned short U_WORD;
typedef long DWORD;
typedef unsigned long U_DWORD;
typedef long long QWORD;
typedef unsigned long long U_QWORD;
map<char, int> inputMap;
void solve_main() {
DWORD N, B, A;
DWORD ans;
cin >> N >> A >> B;
ans = min(N * A, N * B);
cout << ans << endl;
}
int main() {
#ifdef FOR_IDE
ifstream in("input.txt");
cin.rdbuf(in.rdbuf());
#endif
solve_main();
return 0;
}
| #define REP(i, t, n) for (int i = t; i < n; i++)
#define ALL(n) (n).begin(), (n).end()
#include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef bool BOOL;
typedef short WORD;
typedef unsigned short U_WORD;
typedef long DWORD;
typedef unsigned long U_DWORD;
typedef long long QWORD;
typedef unsigned long long U_QWORD;
map<char, int> inputMap;
void solve_main() {
DWORD N, B, A;
DWORD ans;
cin >> N >> A >> B;
ans = min(N * A, B);
cout << ans << endl;
}
int main() {
#ifdef FOR_IDE
ifstream in("input.txt");
cin.rdbuf(in.rdbuf());
#endif
solve_main();
return 0;
}
| [
"expression.operation.binary.remove"
] | 785,363 | 785,364 | u717315282 | cpp |
p02981 | #include <bits/stdc++.h>
#define mod 1000000007
#define pb push_back
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n, a, b;
cin >> n >> a >> b;
if (8 * n < b)
cout << n * a;
else
cout << b;
cout << endl;
return 0;
} | #include <bits/stdc++.h>
#define mod 1000000007
#define pb push_back
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n, a, b;
cin >> n >> a >> b;
if (a * n < b)
cout << n * a;
else
cout << b;
cout << endl;
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 785,371 | 785,372 | u621632422 | cpp |
p02981 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << (int)max(n * a, b);
return 0;
} | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << (int)min(n * a, b);
return 0;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 785,390 | 785,391 | u021877732 | cpp |
p02981 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << max(n * a, b);
return 0;
} | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << (int)min(n * a, b);
return 0;
} | [
"io.output.change"
] | 785,392 | 785,391 | u021877732 | cpp |
p02981 | #include <cmath>
#include <fstream>
#include <iostream>
#include <iterator>
#include <sstream>
#include <string>
using namespace std;
int main() {
int N;
int A;
int B;
cin >> N >> A >> B;
cout << max(N * A, B) << endl;
return 0;
} | #include <cmath>
#include <fstream>
#include <iostream>
#include <iterator>
#include <sstream>
#include <string>
using namespace std;
int main() {
int N;
int A;
int B;
cin >> N >> A >> B;
cout << min(N * A, B) << endl;
return 0;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 785,393 | 785,394 | u983681697 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (A >= B) {
cout << N * B << endl;
} else {
cout << N * 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 {
cout << N * A << endl;
}
}
| [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 785,395 | 785,396 | u665871498 | cpp |
p02981 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
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 <algorithm>
#include <iostream>
#include <string>
#include <vector>
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;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 785,397 | 785,398 | u743473047 | cpp |
p02981 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
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 <algorithm>
#include <iostream>
#include <string>
#include <vector>
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;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 785,399 | 785,398 | u743473047 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int n, a, b;
int main() {
cin >> n >> a >> b;
cout << n * min(a, b) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int n, a, b;
int main() {
cin >> n >> a >> b;
cout << min(n * a, b) << endl;
} | [
"expression.operation.binary.remove"
] | 785,402 | 785,403 | u775439650 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define ll long long
#define ld long double
int main() {
IOS;
int n, a, b;
cin >> n >> a >> b;
if ((n * a) < (n * b)) {
cout << n * a;
} else {
cout << n * b;
}
cout << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define ll long long
#define ld long double
int main() {
IOS;
int n, a, b;
cin >> n >> a >> b;
if ((n * a) < b) {
cout << n * a;
} else {
cout << b;
}
cout << "\n";
return 0;
} | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 785,404 | 785,405 | u056520266 | cpp |
p02981 | // chandigarh university
// shivamkr21
#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;
}
| // chandigarh university
// shivamkr21
#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;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 785,406 | 785,407 | u036604649 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, n * b);
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b);
} | [
"expression.operation.binary.remove"
] | 785,410 | 785,411 | u506112954 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
long long n, a, b;
cin >> n >> a >> b;
if (a < b)
cout << n * a;
else
cout << b;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
long long n, a, b;
cin >> n >> a >> b;
if (n * a < b)
cout << n * a;
else
cout << b;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 785,418 | 785,419 | u731992934 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
inline int read() {
int x(0);
char ch('@');
bool flag(false);
for (; !isdigit(ch); ch = getchar())
flag |= (ch == '-');
for (; isdigit(ch); ch = getchar())
x = (x << 3) + (x << 1) + (ch ^ 48);
return flag ? -x : x;
}
int a, b, n;
int main() {
n = read(), a = read(), b = read();
printf("%d", n * min(a, b));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
inline int read() {
int x(0);
char ch('@');
bool flag(false);
for (; !isdigit(ch); ch = getchar())
flag |= (ch == '-');
for (; isdigit(ch); ch = getchar())
x = (x << 3) + (x << 1) + (ch ^ 48);
return flag ? -x : x;
}
int a, b, n;
int main() {
n = read(), a = read(), b = read();
printf("%d", min(n * a, b));
return 0;
} | [
"expression.operation.binary.remove"
] | 785,421 | 785,422 | u242638642 | cpp |
p02981 | // in the name of Allah
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define ll long long
#define double long double
#define sz(x) ((int)(x.size()))
#define fr first
#define se second
const ll mod = 1000000007;
inline ll add(ll a, ll b) {
a += b;
if (a >= mod)
return a - mod;
return a;
}
inline ll mul(ll a, ll b) {
a *= b;
if (a >= mod)
return a % mod;
return a;
}
inline ll power(ll a, ll b) {
ll p = 1;
while (b) {
if (b & 1)
p = mul(p, a);
a = mul(a, a);
b /= 2;
}
return p;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll a, b, c;
cin >> a >> b >> c;
cout << max(a * b, c) << endl;
return 0;
} | // in the name of Allah
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define ll long long
#define double long double
#define sz(x) ((int)(x.size()))
#define fr first
#define se second
const ll mod = 1000000007;
inline ll add(ll a, ll b) {
a += b;
if (a >= mod)
return a - mod;
return a;
}
inline ll mul(ll a, ll b) {
a *= b;
if (a >= mod)
return a % mod;
return a;
}
inline ll power(ll a, ll b) {
ll p = 1;
while (b) {
if (b & 1)
p = mul(p, a);
a = mul(a, a);
b /= 2;
}
return p;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll a, b, c;
cin >> a >> b >> c;
cout << min(a * b, c) << endl;
return 0;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 785,427 | 785,428 | u812771098 | cpp |
p02981 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (N * A < B)
cout << N * A << endl;
else
cout << A << endl;
} | #include <algorithm>
#include <iostream>
#include <vector>
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;
} | [
"identifier.change",
"io.output.change"
] | 785,438 | 785,439 | u552004736 | cpp |
p02981 | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
// typename alias
template <class T> using vec = vector<T>;
template <class T> using vvec = vec<vec<T>>;
template <class T, class U> using vep = vec<pair<T, U>>;
template <class T> using PQ = priority_queue<T>;
using ll = long long;
using vll = vec<ll>;
using vvll = vvec<ll>;
using pll = pair<ll, ll>;
using vpll = vec<pll>;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int A, B, N;
cin >> N >> A >> B;
int train_sum = A * N;
int tax_sum = B;
if (train_sum > tax_sum)
cout << tax_sum << endl;
if (train_sum < tax_sum)
cout << train_sum << endl;
return 0;
} | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
// typename alias
template <class T> using vec = vector<T>;
template <class T> using vvec = vec<vec<T>>;
template <class T, class U> using vep = vec<pair<T, U>>;
template <class T> using PQ = priority_queue<T>;
using ll = long long;
using vll = vec<ll>;
using vvll = vvec<ll>;
using pll = pair<ll, ll>;
using vpll = vec<pll>;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int A, B, N;
cin >> N >> A >> B;
int train_sum = A * N;
int tax_sum = B;
if (train_sum > tax_sum)
cout << tax_sum << endl;
if (train_sum <= tax_sum)
cout << train_sum << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 785,440 | 785,441 | u894411949 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int BIG = 1e9 + 555;
int n, a, b;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> a >> b;
cout << min(n * a, n * b) << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int BIG = 1e9 + 555;
int n, a, b;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> a >> b;
cout << min(n * a, b) << '\n';
return 0;
} | [
"expression.operation.binary.remove"
] | 785,444 | 785,445 | u482794458 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef map<int, int> MII;
typedef priority_queue<int> P_QI;
typedef priority_queue<string> P_QS;
typedef vector<int> VI;
typedef vector<long long> VLL;
typedef vector<int>::iterator $$;
#define SET(arr) memset(arr, -1, sizeof(arr))
#define CLR(arr) memset(arr, 0, sizeof(arr))
#define READ(f) freopen(f, "r", stdin)
#define WRITE(f) freopen(f, "w", stdout)
#define $ vector<int>::iterator
#define m_p make_pair
#define p_b push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define forn(i, n) for (int i = 1; i <= (int)(n); ++i)
#define forab(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define forba(i, b, a) for (int i = (int)(b); i >= (int)(a); --i)
#define forv(i, v) rep(i, SZ(v))
#define forit(i, s) for (auto i = (s).begin(); i != (s).end(); ++i)
#define Boost \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define all(a) (a).begin(), (a).end()
#define SZ(x) ((int)(x).size())
#define F first
#define S second
#define _ << " " <<
#define CS(i) cout << "Case " << (int)(i) << ": "
const int MOD = 1e9 + 7;
const int inf = 1e9 + 9;
const long long INF = 1e18 + 3;
const ld eps = 1e-9;
const ld PI = acos(-1.0);
const ld E = 2.71828182845904523536;
int main() {
Boost;
// READ("in.txt");
// WRITE("out.txt");
int n, a, b;
cin >> n >> a >> b;
cout << n * min(a, b) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef map<int, int> MII;
typedef priority_queue<int> P_QI;
typedef priority_queue<string> P_QS;
typedef vector<int> VI;
typedef vector<long long> VLL;
typedef vector<int>::iterator $$;
#define SET(arr) memset(arr, -1, sizeof(arr))
#define CLR(arr) memset(arr, 0, sizeof(arr))
#define READ(f) freopen(f, "r", stdin)
#define WRITE(f) freopen(f, "w", stdout)
#define $ vector<int>::iterator
#define m_p make_pair
#define p_b push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define forn(i, n) for (int i = 1; i <= (int)(n); ++i)
#define forab(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define forba(i, b, a) for (int i = (int)(b); i >= (int)(a); --i)
#define forv(i, v) rep(i, SZ(v))
#define forit(i, s) for (auto i = (s).begin(); i != (s).end(); ++i)
#define Boost \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define all(a) (a).begin(), (a).end()
#define SZ(x) ((int)(x).size())
#define F first
#define S second
#define _ << " " <<
#define CS(i) cout << "Case " << (int)(i) << ": "
const int MOD = 1e9 + 7;
const int inf = 1e9 + 9;
const long long INF = 1e18 + 3;
const ld eps = 1e-9;
const ld PI = acos(-1.0);
const ld E = 2.71828182845904523536;
int main() {
Boost;
// READ("in.txt");
// WRITE("out.txt");
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b) << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 785,446 | 785,447 | u934685914 | cpp |
p02981 | #include <bits/stdc++.h>
#define MAX 100005
using namespace std;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n, a, b;
cin >> n >> a >> b;
cout << (min(a, b) * n) << endl;
return 0;
}
| #include <bits/stdc++.h>
#define MAX 100005
using namespace std;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n, a, b;
cin >> n >> a >> b;
cout << min(a * n, b) << endl;
return 0;
}
| [
"call.arguments.change",
"call.arguments.add"
] | 785,454 | 785,455 | u066910956 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << min(a * 2, b) << endl;
} | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a * n, b) << endl;
} | [
"variable_declaration.add",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 785,458 | 785,459 | u230078189 | cpp |
p02981 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <memory>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
int64_t n, a, b;
cin >> n >> a >> b;
if (a > b) {
cout << n * b << endl;
} else {
cout << n * a << endl;
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <memory>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
int64_t n, a, b;
cin >> n >> a >> b;
if (n * a > b) {
cout << b << endl;
} else {
cout << n * a << endl;
}
return 0;
}
| [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 785,461 | 785,462 | u729166490 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
cout << min(N * A, N * B) << endl;
return 0;
} | #include <bits/stdc++.h>
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"
] | 785,463 | 785,464 | u293072892 | cpp |
p02981 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << n * min(a, b) << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a * n, b) << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 785,469 | 785,470 | u017881341 | cpp |
p02981 | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int n, a, b;
int main() {
scanf("%d%d%d", &n, &a, &b);
printf("%d", n * min(a, b));
} | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int n, a, b;
int main() {
scanf("%d%d%d", &n, &a, &b);
printf("%d", min(n * a, b));
} | [
"expression.operation.binary.remove"
] | 785,471 | 785,472 | u492148983 | cpp |
p02981 | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#define _ << " " <<
#define all(v) v.begin(), v.end()
#define sp(n) fixed << setprecision(n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const int mod = 1e9 + 7;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n, a, b;
cin >> n >> a >> b;
cout << min(a, b) * n << endl;
return 0;
} | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#define _ << " " <<
#define all(v) v.begin(), v.end()
#define sp(n) fixed << setprecision(n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const int mod = 1e9 + 7;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b) << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 785,473 | 785,474 | u866482228 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
namespace fastIO {
#define BUF_SIZE 100000
#define OUT_SIZE 100000
// fread->read
bool IOerror = 0;
// inline char nc(){char ch=getchar();if(ch==-1)IOerror=1;return ch;}
inline char nc() {
static char buf[BUF_SIZE], *p1 = buf + BUF_SIZE, *pend = buf + BUF_SIZE;
if (p1 == pend) {
p1 = buf;
pend = buf + fread(buf, 1, BUF_SIZE, stdin);
if (pend == p1) {
IOerror = 1;
return -1;
}
}
return *p1++;
}
inline bool blank(char ch) {
return ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t';
}
template <class T> inline bool read(T &x) {
bool sign = 0;
char ch = nc();
x = 0;
for (; blank(ch); ch = nc())
;
if (IOerror)
return false;
if (ch == '-')
sign = 1, ch = nc();
for (; ch >= '0' && ch <= '9'; ch = nc())
x = x * 10 + ch - '0';
if (sign)
x = -x;
return true;
}
inline bool read(double &x) {
bool sign = 0;
char ch = nc();
x = 0;
for (; blank(ch); ch = nc())
;
if (IOerror)
return false;
if (ch == '-')
sign = 1, ch = nc();
for (; ch >= '0' && ch <= '9'; ch = nc())
x = x * 10 + ch - '0';
if (ch == '.') {
double tmp = 1;
ch = nc();
for (; ch >= '0' && ch <= '9'; ch = nc())
tmp /= 10.0, x += tmp * (ch - '0');
}
if (sign)
x = -x;
return true;
}
inline bool read(char *s) {
char ch = nc();
for (; blank(ch); ch = nc())
;
if (IOerror)
return false;
for (; !blank(ch) && !IOerror; ch = nc())
*s++ = ch;
*s = 0;
return true;
}
inline bool read(char &c) {
for (c = nc(); blank(c); c = nc())
;
if (IOerror) {
c = -1;
return false;
}
return true;
}
template <class T, class... U> bool read(T &h, U &...t) {
return read(h) && read(t...);
}
#undef OUT_SIZE
#undef BUF_SIZE
}; // namespace fastIO
using namespace fastIO;
/************* debug begin *************/
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string)s); }
string to_string(const bool &b) { return (b ? "true" : "false"); }
template <class T> string to_string(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
template <class A, class B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <class A> string to_string(const vector<A> v) {
int f = 1;
string res = "{";
for (const auto x : v) {
if (!f)
res += ", ";
f = 0;
res += to_string(x);
}
res += "}";
return res;
}
void debug_out() { puts(""); }
template <class T, class... U> void debug_out(const T &h, const U &...t) {
cout << " " << to_string(h);
debug_out(t...);
}
#ifdef tokitsukaze
#define debug(...) cout << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__);
#else
#define debug(...) 233;
#endif
/************* debug end *************/
#define mem(a, b) memset((a), (b), sizeof(a))
#define MP make_pair
#define pb push_back
#define fi first
#define se second
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define sqr(x) (x) * (x)
using namespace __gnu_cxx;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef pair<int, ll> PIL;
typedef pair<ll, int> PLI;
typedef vector<int> VI;
typedef vector<ll> VL;
/************* define end *************/
void read(int *x, int l, int r) {
for (int i = l; i <= r; i++)
read(x[i]);
}
void read(ll *x, int l, int r) {
for (int i = l; i <= r; i++)
read(x[i]);
}
void read(double *x, int l, int r) {
for (int i = l; i <= r; i++)
read(x[i]);
}
void println(VI x) {
for (int i = 0; i < sz(x); i++)
printf("%d%c", x[i], " \n"[i == sz(x) - 1]);
}
void println(VL x) {
for (int i = 0; i < sz(x); i++)
printf("%lld%c", x[i], " \n"[i == sz(x) - 1]);
}
void println(int *x, int l, int r) {
for (int i = l; i <= r; i++)
printf("%d%c", x[i], " \n"[i == r]);
}
void println(ll *x, int l, int r) {
for (int i = l; i <= r; i++)
printf("%lld%c", x[i], " \n"[i == r]);
}
/*************** IO end ***************/
void go();
int main() {
#ifdef tokitsukaze
freopen("TEST.txt", "r", stdin);
#endif
go();
return 0;
}
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3fLL;
const double PI = acos(-1.0);
const double eps = 1e-6;
const int MAX = 1e6 + 10;
const ll mod = 998244353;
/********************************* head *********************************/
void go() {
int a, b, c;
while (read(a, b)) {
printf("%d\n", min(a * b, c));
}
} | #include <bits/stdc++.h>
using namespace std;
namespace fastIO {
#define BUF_SIZE 100000
#define OUT_SIZE 100000
// fread->read
bool IOerror = 0;
// inline char nc(){char ch=getchar();if(ch==-1)IOerror=1;return ch;}
inline char nc() {
static char buf[BUF_SIZE], *p1 = buf + BUF_SIZE, *pend = buf + BUF_SIZE;
if (p1 == pend) {
p1 = buf;
pend = buf + fread(buf, 1, BUF_SIZE, stdin);
if (pend == p1) {
IOerror = 1;
return -1;
}
}
return *p1++;
}
inline bool blank(char ch) {
return ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t';
}
template <class T> inline bool read(T &x) {
bool sign = 0;
char ch = nc();
x = 0;
for (; blank(ch); ch = nc())
;
if (IOerror)
return false;
if (ch == '-')
sign = 1, ch = nc();
for (; ch >= '0' && ch <= '9'; ch = nc())
x = x * 10 + ch - '0';
if (sign)
x = -x;
return true;
}
inline bool read(double &x) {
bool sign = 0;
char ch = nc();
x = 0;
for (; blank(ch); ch = nc())
;
if (IOerror)
return false;
if (ch == '-')
sign = 1, ch = nc();
for (; ch >= '0' && ch <= '9'; ch = nc())
x = x * 10 + ch - '0';
if (ch == '.') {
double tmp = 1;
ch = nc();
for (; ch >= '0' && ch <= '9'; ch = nc())
tmp /= 10.0, x += tmp * (ch - '0');
}
if (sign)
x = -x;
return true;
}
inline bool read(char *s) {
char ch = nc();
for (; blank(ch); ch = nc())
;
if (IOerror)
return false;
for (; !blank(ch) && !IOerror; ch = nc())
*s++ = ch;
*s = 0;
return true;
}
inline bool read(char &c) {
for (c = nc(); blank(c); c = nc())
;
if (IOerror) {
c = -1;
return false;
}
return true;
}
template <class T, class... U> bool read(T &h, U &...t) {
return read(h) && read(t...);
}
#undef OUT_SIZE
#undef BUF_SIZE
}; // namespace fastIO
using namespace fastIO;
/************* debug begin *************/
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string)s); }
string to_string(const bool &b) { return (b ? "true" : "false"); }
template <class T> string to_string(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
template <class A, class B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <class A> string to_string(const vector<A> v) {
int f = 1;
string res = "{";
for (const auto x : v) {
if (!f)
res += ", ";
f = 0;
res += to_string(x);
}
res += "}";
return res;
}
void debug_out() { puts(""); }
template <class T, class... U> void debug_out(const T &h, const U &...t) {
cout << " " << to_string(h);
debug_out(t...);
}
#ifdef tokitsukaze
#define debug(...) cout << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__);
#else
#define debug(...) 233;
#endif
/************* debug end *************/
#define mem(a, b) memset((a), (b), sizeof(a))
#define MP make_pair
#define pb push_back
#define fi first
#define se second
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define sqr(x) (x) * (x)
using namespace __gnu_cxx;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef pair<int, ll> PIL;
typedef pair<ll, int> PLI;
typedef vector<int> VI;
typedef vector<ll> VL;
/************* define end *************/
void read(int *x, int l, int r) {
for (int i = l; i <= r; i++)
read(x[i]);
}
void read(ll *x, int l, int r) {
for (int i = l; i <= r; i++)
read(x[i]);
}
void read(double *x, int l, int r) {
for (int i = l; i <= r; i++)
read(x[i]);
}
void println(VI x) {
for (int i = 0; i < sz(x); i++)
printf("%d%c", x[i], " \n"[i == sz(x) - 1]);
}
void println(VL x) {
for (int i = 0; i < sz(x); i++)
printf("%lld%c", x[i], " \n"[i == sz(x) - 1]);
}
void println(int *x, int l, int r) {
for (int i = l; i <= r; i++)
printf("%d%c", x[i], " \n"[i == r]);
}
void println(ll *x, int l, int r) {
for (int i = l; i <= r; i++)
printf("%lld%c", x[i], " \n"[i == r]);
}
/*************** IO end ***************/
void go();
int main() {
#ifdef tokitsukaze
freopen("TEST.txt", "r", stdin);
#endif
go();
return 0;
}
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3fLL;
const double PI = acos(-1.0);
const double eps = 1e-6;
const int MAX = 1e6 + 10;
const ll mod = 998244353;
/********************************* head *********************************/
void go() {
int a, b, c;
while (read(a, b, c)) {
printf("%d\n", min(a * b, c));
}
} | [
"control_flow.loop.condition.change",
"call.arguments.add"
] | 785,477 | 785,478 | u709755864 | cpp |
p02981 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int a, b, c;
cin >> a >> b >> c;
if (b * 2 <= c) {
cout << b * a;
} else {
cout << c;
}
}
| #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int a, b, c;
cin >> a >> b >> c;
if (b * a <= c) {
cout << b * a;
} else {
cout << c;
}
}
| [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 785,479 | 785,480 | u467848771 | cpp |
p02981 | #include <bits/stdc++.h>
#include <fstream>
#define vi vector<int>
#define vii vector<vi>
#define ll long long
#define vl vector<ll>
#define vll vector<vl>
#define rep(i, a, b) for (long long i = (a); i < (b); i++)
#define per(i, a, b) for (long long i = (a); i > (b); i--)
#define pb push_back
#define sz(v) (int)v.size()
#define CIN \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
using namespace std;
int main() {
CIN;
ll n, a, b;
cin >> n >> a >> b;
cout << min(n * a, n * b);
} | #include <bits/stdc++.h>
#include <fstream>
#define vi vector<int>
#define vii vector<vi>
#define ll long long
#define vl vector<ll>
#define vll vector<vl>
#define rep(i, a, b) for (long long i = (a); i < (b); i++)
#define per(i, a, b) for (long long i = (a); i > (b); i--)
#define pb push_back
#define sz(v) (int)v.size()
#define CIN \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
using namespace std;
int main() {
CIN;
ll n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b);
} | [
"expression.operation.binary.remove"
] | 785,481 | 785,482 | u054759548 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int n, a, b;
int main() {
cin >> n >> a >> b;
cout << min(a, b) * n;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n, a, b;
int main() {
cin >> n >> a >> b;
cout << min(a * n, b);
return 0;
} | [
"expression.operation.binary.remove"
] | 785,483 | 785,484 | u211255798 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.