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 <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 5;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n, a * b) << endl;
return 0;
} | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 5;
int main() {
int n, a, b;
cin >> a >> b >> n;
cout << min(n, a * b) << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 783,817 | 783,818 | u816631826 | cpp |
p02981 | /*
Created by : imay_10
" It won't be EASY, but I'll make it "
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1e9 + 7;
const ll inf = 1e18;
const double pi = 3.1415926535897932384626;
// Utility for fast exponentiation
ll mpow(ll a, ll b, ll m) {
ll res = 1;
// a%=m;
while (b) {
if (b % 2)
res = res * a % m;
a = a * a % m;
b /= 2;
}
return res;
}
// Utility for GCD Calculation
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
void solve() {
// code
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
return 0;
}
| /*
Created by : imay_10
" It won't be EASY, but I'll make it "
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1e9 + 7;
const ll inf = 1e18;
const double pi = 3.1415926535897932384626;
// Utility for fast exponentiation
ll mpow(ll a, ll b, ll m) {
ll res = 1;
// a%=m;
while (b) {
if (b % 2)
res = res * a % m;
a = a * a % m;
b /= 2;
}
return res;
}
// Utility for GCD Calculation
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
void solve() {
// code
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
solve();
return 0;
}
| [
"call.add"
] | 783,821 | 783,822 | u861899479 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if (a < b) {
cout << n * a;
} else {
cout << n * b;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if (n * a < b) {
cout << n * a;
} else {
cout << b;
}
return 0;
} | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 783,831 | 783,832 | u831336344 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mk make_pair
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
ll sum(int n);
void go() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, b);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
go();
return 0;
}
ll sum(int n) {
if (n == 0) {
return n;
} else {
return sum(n / 10) + n % 10;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mk make_pair
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
ll sum(int n);
void go() {
int n, a, b;
cin >> n >> a >> b;
cout << min({a * n, b});
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
go();
return 0;
}
ll sum(int n) {
if (n == 0) {
return n;
} else {
return sum(n / 10) + n % 10;
}
}
| [
"call.arguments.change"
] | 783,833 | 783,834 | u126236540 | cpp |
p02981 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <array>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define int64 long long
#define uint64 unsigned long long
using namespace std;
int main() {
int64 nn, aa, bb;
cin >> nn >> aa >> bb;
cout << (nn * aa < nn * bb ? nn * aa : nn * bb) << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <array>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define int64 long long
#define uint64 unsigned long long
using namespace std;
int main() {
int64 nn, aa, bb;
cin >> nn >> aa >> bb;
cout << (nn * aa < bb ? nn * aa : bb) << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 783,837 | 783,838 | u834987206 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ii = pair<ll, ll>;
using vi = vector<ll>;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF (ll)1e18
#define all(x) (x).begin(), (x).end()
#define print(a) \
; \
for (auto x : a) \
cout << x << " "; \
cout << "\n";
#define mset(a) \
; \
memset(a, 0, sizeof(a));
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n, a, b;
cin >> n >> a >> b;
cout << n * min(a, b) << "\n";
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ii = pair<ll, ll>;
using vi = vector<ll>;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF (ll)1e18
#define all(x) (x).begin(), (x).end()
#define print(a) \
; \
for (auto x : a) \
cout << x << " "; \
cout << "\n";
#define mset(a) \
; \
memset(a, 0, sizeof(a));
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n, a, b;
cin >> n >> a >> b;
cout << min(a * n, b) << "\n";
}
| [
"expression.operation.binary.remove"
] | 783,839 | 783,840 | u596724731 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, a, b;
cin >> n >> a >> b;
if (a * n >= b)
cout << b << endl;
else
cout << a * b << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, a, b;
cin >> n >> a >> b;
if (a * n >= b)
cout << b << endl;
else
cout << a * n << endl;
}
| [
"identifier.change",
"io.output.change"
] | 783,841 | 783,842 | u425086757 | cpp |
p02981 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define fast_io \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using namespace std;
#define debug(x) cout << (#x) << "=" << (x) << ", ";
#define debug1(x) debug(x) cout << '\n';
#define debug2(x1, x2) debug(x1) debug(x2) cout << '\n';
#define debug3(x1, x2, x3) debug(x1) debug(x2) debug(x3) cout << '\n';
#define debug4(x1, x2, x3, x4) \
debug(x1) debug(x2) debug(x3) debug(x4) cout << '\n';
#define debug5(x1, x2, x3, x4, x5) \
debug(x1) debug(x2) debug(x3) debug(x4) debug(x5) cout << '\n';
#define fcout cout << fixed << setprecision(15)
#define repp(i, j, k) for (int i = j; i < k; ++i)
#define rep(i, j) repp(i, 0, j)
#define rrep(i, j, k) for (int i = j; i >= k; --i)
#define all(x) (x).begin(), (x).end()
#define sort(x) sort(x.begin(), x.end())
#define lb(x, val) lower_bound(x.begin(), x.end(), val)
#define ub(x, val) upper_bound(x.begin(), x.end(), val)
#define pb(x) emplace_back(x);
typedef long long int lli;
typedef pair<int, int> pii;
typedef pair<lli, lli> pll;
typedef vector<int> vi;
typedef vector<lli> vl;
typedef tuple<int, int, lli> tiil;
// const lli M=998244353ll;
const lli M = 1000000007ll;
const double D = 1.0;
int main() {
fast_io int n, a, b;
cin >> n >> a >> b;
cout << (n * min(a, b));
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define fast_io \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using namespace std;
#define debug(x) cout << (#x) << "=" << (x) << ", ";
#define debug1(x) debug(x) cout << '\n';
#define debug2(x1, x2) debug(x1) debug(x2) cout << '\n';
#define debug3(x1, x2, x3) debug(x1) debug(x2) debug(x3) cout << '\n';
#define debug4(x1, x2, x3, x4) \
debug(x1) debug(x2) debug(x3) debug(x4) cout << '\n';
#define debug5(x1, x2, x3, x4, x5) \
debug(x1) debug(x2) debug(x3) debug(x4) debug(x5) cout << '\n';
#define fcout cout << fixed << setprecision(15)
#define repp(i, j, k) for (int i = j; i < k; ++i)
#define rep(i, j) repp(i, 0, j)
#define rrep(i, j, k) for (int i = j; i >= k; --i)
#define all(x) (x).begin(), (x).end()
#define sort(x) sort(x.begin(), x.end())
#define lb(x, val) lower_bound(x.begin(), x.end(), val)
#define ub(x, val) upper_bound(x.begin(), x.end(), val)
#define pb(x) emplace_back(x);
typedef long long int lli;
typedef pair<int, int> pii;
typedef pair<lli, lli> pll;
typedef vector<int> vi;
typedef vector<lli> vl;
typedef tuple<int, int, lli> tiil;
// const lli M=998244353ll;
const lli M = 1000000007ll;
const double D = 1.0;
int main() {
fast_io int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b);
return 0;
} | [
"call.add",
"call.remove"
] | 783,846 | 783,847 | u397886197 | cpp |
p02981 | #include <bits/stdc++.h>
#define fast_io \
ios_base::sync_with_stdio(NULL); \
cin.tie(NULL);
#define endl '\n'
using namespace std;
int main() {
fast_io int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, n * b);
return 0;
}
| #include <bits/stdc++.h>
#define fast_io \
ios_base::sync_with_stdio(NULL); \
cin.tie(NULL);
#define endl '\n'
using namespace std;
int main() {
fast_io int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b);
return 0;
}
| [
"expression.operation.binary.remove"
] | 783,850 | 783,851 | u114487340 | cpp |
p02981 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, a, b;
cin >> n >> a >> b;
a *= n;
int ans = max(a, b);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, a, b;
cin >> n >> a >> b;
a *= n;
int ans = min(a, b);
cout << ans << endl;
return 0;
} | [
"misc.opposites",
"identifier.change",
"call.function.change"
] | 783,854 | 783,855 | u894496005 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> a >> b;
int ans = min(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;
} | [
"expression.operation.binary.add"
] | 783,858 | 783,859 | u572787531 | cpp |
p02981 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<vector<ll>> Matrix;
const char wall = '#';
vector<vector<char>> fields;
vector<vector<bool>> used;
vector<vector<ll>> dist;
const int dx[4] = {0, -1, 0, 1};
const int dy[4] = {1, 0, -1, 0};
vector<ll> A;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, a, b;
cin >> n >> a >> b;
cout << n * min(a, b) << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<vector<ll>> Matrix;
const char wall = '#';
vector<vector<char>> fields;
vector<vector<bool>> used;
vector<vector<ll>> dist;
const int dx[4] = {0, -1, 0, 1};
const int dy[4] = {1, 0, -1, 0};
vector<ll> A;
// vectorのリサイズ
// A.resize(N);
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b) << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 783,868 | 783,869 | u652037179 | cpp |
p02981 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int a, b, c;
vector<int> vec;
cin >> a >> b >> c;
if (a * b > c)
cout << a * b << endl;
else
cout << c << endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int a, b, c;
vector<int> vec;
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"
] | 783,876 | 783,877 | u829243466 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a, b, c;
cout << min(a * b, c) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << min(a * b, c) << endl;
} | [] | 783,883 | 783,884 | u652660628 | cpp |
p02981 | #include <stdio.h>
int main(void) {
int n, a, b;
scanf("%d%d%d", &n, &a, &b);
if (n * a >= b)
printf("%d", n * a);
else
printf("%d", b);
return 0;
} | #include <stdio.h>
int main(void) {
int n, a, b;
scanf("%d%d%d", &n, &a, &b);
if (n * a <= b)
printf("%d", n * a);
else
printf("%d", b);
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 783,885 | 783,886 | u917352184 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (A * N > B)
cout << B;
else
cout << A * B;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (A * N > B)
cout << B;
else
cout << A * N;
} | [
"identifier.change",
"io.output.change"
] | 783,887 | 783,888 | u391725672 | cpp |
p02981 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ok() puts(ok ? "Yes" : "No");
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef set<int> si;
typedef map<string, int> msi;
typedef greater<int> gt;
typedef priority_queue<int, vector<int>, gt> minq;
typedef long long ll;
typedef pair<ll, ll> pll;
const ll LINF = 1e18L + 1;
const int INF = 1e9 + 1;
// clang++ -std=c++11 -stdlib=libc++
int main() {
int n, a, b;
cin >> a >> b;
cout << min(b, a * n) << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ok() puts(ok ? "Yes" : "No");
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef set<int> si;
typedef map<string, int> msi;
typedef greater<int> gt;
typedef priority_queue<int, vector<int>, gt> minq;
typedef long long ll;
typedef pair<ll, ll> pll;
const ll LINF = 1e18L + 1;
const int INF = 1e9 + 1;
// clang++ -std=c++11 -stdlib=libc++
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(b, a * n) << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 783,891 | 783,892 | u213868052 | cpp |
p02981 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void) {
int n, a, b;
cin >> n >> a >> b;
int sum_a = n * a;
int sum_b = n * b;
if (sum_a > sum_b) {
cout << sum_b;
} else {
cout << sum_a;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void) {
int n, a, b;
cin >> n >> a >> b;
int sum_a = n * a;
int sum_b = b;
if (sum_a > sum_b) {
cout << sum_b;
} else {
cout << sum_a;
}
return 0;
} | [
"expression.operation.binary.remove"
] | 783,893 | 783,894 | u043363214 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if (n * a < b)
cout << n * a << endl;
else
cout << n << endl;
} | #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;
} | [
"identifier.change",
"io.output.change"
] | 783,895 | 783,896 | u080465055 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define INF 9223372036854775807
#define all(x) (x).begin(), (x).end()
ll ts = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n, a, b;
cin >> a >> b;
cout << (a * n > b ? b : n * a) << "\n";
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define INF 9223372036854775807
#define all(x) (x).begin(), (x).end()
ll ts = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n, a, b;
cin >> n >> a >> b;
cout << (a * n > b ? b : n * a) << "\n";
} | [
"expression.operation.binary.add"
] | 783,905 | 783,906 | u166419774 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (N * A < B) {
cout << N * A << endl;
} else {
cout << A << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (N * A < B) {
cout << N * A << endl;
} else {
cout << B << endl;
}
return 0;
}
| [
"identifier.change",
"io.output.change"
] | 783,911 | 783,912 | u251242696 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (N * B < A) {
cout << N * B << endl;
} else {
cout << A << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (N * A < B) {
cout << N * A << endl;
} else {
cout << B << endl;
}
return 0;
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"identifier.change",
"io.output.change"
] | 783,913 | 783,912 | u251242696 | cpp |
p02981 | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) REP(i, 0, n)
#define REP(i, l, r) for (int i = l; i < r; i++)
#define MOD (int)(1e9 + 7)
using namespace std;
typedef pair<int, int> P;
struct edge {
int to, cost;
};
class dijkstra {
private:
int V;
int d[100002];
priority_queue<P, vector<P>, greater<>> que;
public:
dijkstra(int v, int s, vector<edge> G[]) {
V = v;
update(s, G);
}
void update(int s, vector<edge> G[]) {
fill(d, d + V + 1, 100000000000ll);
d[s] = 0;
que.push(make_pair(0, s));
while (!que.empty()) {
P p = que.top();
que.pop();
int v = p.second;
if (d[v] < p.first)
continue;
rep(i, G[v].size()) {
edge e = G[v][i];
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(make_pair(d[e.to], e.to));
}
}
}
}
int find(int e) { return d[e]; }
};
int gcd(int a, int b) {
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
bool prime(int a) {
if (a == 1)
return false;
for (int i = 2; i * i <= a; i++) {
if (a % i == 0)
return false;
}
return true;
}
class Union_Find {
private:
vector<int> t, s;
public:
Union_Find(int max_length) {
rep(i, max_length + 1) {
t.push_back(i);
s.push_back(1);
}
}
void Union(int x, int y) {
if (same(x, y))
return;
int tx = Find(x), ty = Find(y);
if (s[tx] < s[ty]) {
s[ty] += s[tx];
t[tx] = ty;
} else if (s[tx] > s[ty]) {
s[tx] += s[ty];
t[ty] = tx;
} else if (tx > ty) {
t[tx] = ty;
s[ty] += s[tx];
} else {
t[ty] = tx;
s[tx] += s[ty];
}
}
int Find(int n) {
if (t[n] == n)
return n;
else
return t[n] = Find(t[n]);
}
bool same(int x, int y) { return Find(x) == Find(y); }
int get_Size(int a) { return s[a]; }
};
vector<int> primeFactorization(int n) {
vector<int> re;
int cnt = 2;
while (n != 1) {
if (n % cnt != 0) {
cnt++;
continue;
}
n /= cnt;
re.push_back(cnt);
}
return re;
}
signed main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b) << endl;
#ifndef DEBUG
cout << 1 << endl;
#endif
}
| #include <bits/stdc++.h>
#define int long long
#define rep(i, n) REP(i, 0, n)
#define REP(i, l, r) for (int i = l; i < r; i++)
#define MOD (int)(1e9 + 7)
using namespace std;
typedef pair<int, int> P;
struct edge {
int to, cost;
};
class dijkstra {
private:
int V;
int d[100002];
priority_queue<P, vector<P>, greater<>> que;
public:
dijkstra(int v, int s, vector<edge> G[]) {
V = v;
update(s, G);
}
void update(int s, vector<edge> G[]) {
fill(d, d + V + 1, 100000000000ll);
d[s] = 0;
que.push(make_pair(0, s));
while (!que.empty()) {
P p = que.top();
que.pop();
int v = p.second;
if (d[v] < p.first)
continue;
rep(i, G[v].size()) {
edge e = G[v][i];
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(make_pair(d[e.to], e.to));
}
}
}
}
int find(int e) { return d[e]; }
};
int gcd(int a, int b) {
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
bool prime(int a) {
if (a == 1)
return false;
for (int i = 2; i * i <= a; i++) {
if (a % i == 0)
return false;
}
return true;
}
class Union_Find {
private:
vector<int> t, s;
public:
Union_Find(int max_length) {
rep(i, max_length + 1) {
t.push_back(i);
s.push_back(1);
}
}
void Union(int x, int y) {
if (same(x, y))
return;
int tx = Find(x), ty = Find(y);
if (s[tx] < s[ty]) {
s[ty] += s[tx];
t[tx] = ty;
} else if (s[tx] > s[ty]) {
s[tx] += s[ty];
t[ty] = tx;
} else if (tx > ty) {
t[tx] = ty;
s[ty] += s[tx];
} else {
t[ty] = tx;
s[tx] += s[ty];
}
}
int Find(int n) {
if (t[n] == n)
return n;
else
return t[n] = Find(t[n]);
}
bool same(int x, int y) { return Find(x) == Find(y); }
int get_Size(int a) { return s[a]; }
};
vector<int> primeFactorization(int n) {
vector<int> re;
int cnt = 2;
while (n != 1) {
if (n % cnt != 0) {
cnt++;
continue;
}
n /= cnt;
re.push_back(cnt);
}
return re;
}
signed main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b) << endl;
#ifdef DEBUG
cout << 1 << endl;
#endif
}
| [] | 783,914 | 783,915 | u073057072 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << max(n * a, b) << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b) << endl;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 783,918 | 783,919 | u634967948 | cpp |
p02981 | #include <iostream>
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 <iostream>
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"
] | 783,920 | 783,921 | u813559924 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int N, A, B;
cin >> N >> A >> B;
cout << N * min(A, B);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
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"
] | 783,924 | 783,925 | u880337594 | cpp |
p02981 | #include <bits/stdc++.h>
int main(void) {
int N, A, B;
scanf("%d %d %d", &N, &A, &B);
A = N * A;
B = N * B;
if (A > B) {
printf("%d\n", B);
} else {
printf("%d\n", A);
}
return 0;
} | #include <bits/stdc++.h>
int main(void) {
int N, A, B;
scanf("%d %d %d", &N, &A, &B);
A = N * A;
if (A > B) {
printf("%d\n", B);
} else {
printf("%d\n", A);
}
return 0;
} | [] | 783,926 | 783,927 | u635358463 | cpp |
p02981 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using u128 = __uint128_t;
#define int long long
#define idxSet \
tree<int, null_type, less_equal<int>, rb_tree_tag, \
tree_order_statistics_node_update>
#define atIdx find_by_order
#define idxOf order_of_key
#define MOD 1000000007
#define MAX 200005
#define endl '\n'
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
int dp[MAX];
void solve() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a * n, b * n) << endl;
}
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t = 1;
// cin>>t;
while (t--)
solve();
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using u128 = __uint128_t;
#define int long long
#define idxSet \
tree<int, null_type, less_equal<int>, rb_tree_tag, \
tree_order_statistics_node_update>
#define atIdx find_by_order
#define idxOf order_of_key
#define MOD 1000000007
#define MAX 200005
#define endl '\n'
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
int dp[MAX];
void solve() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a * n, b) << endl;
}
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t = 1;
// cin>>t;
while (t--)
solve();
return 0;
} | [
"expression.operation.binary.remove"
] | 783,932 | 783,933 | u481963728 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define maxn 100010
const int MOD = 1000000007;
void solve() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, n * b) << endl;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int t = 1;
// cin >> t;
while (t--)
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define maxn 100010
const int MOD = 1000000007;
void solve() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b) << endl;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int t = 1;
// cin >> t;
while (t--)
solve();
return 0;
} | [
"expression.operation.binary.remove"
] | 783,934 | 783,935 | u845356047 | cpp |
p02981 | //
// main.cpp
// uecontest2
//
// Created on 2020/04/29.
// Copyright © 2020 エロやん. All rights reserved.
//
#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;
}
| //
// main.cpp
// uecontest2
//
// Created on 2020/04/29.
// Copyright © 2020 エロやん. All rights reserved.
//
#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"
] | 783,940 | 783,941 | u924721750 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
int S = N * A;
if (S >= B) {
cout << S << endl;
} else {
cout << B << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
int S = N * A;
if (S >= B) {
cout << B << endl;
} else {
cout << S << endl;
}
} | [
"identifier.change",
"io.output.change"
] | 783,949 | 783,950 | u046313635 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if (n * a >= n * b) {
cout << n * 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;
} | [
"expression.operation.binary.remove"
] | 783,962 | 783,963 | u385652268 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int a, b, n;
cin >> n >> a >> b;
if (n * a < b) {
cout << n * b << endl;
} else {
cout << b << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int a, b, n;
cin >> n >> a >> b;
if (n * a < b) {
cout << n * a << endl;
} else {
cout << b << endl;
}
} | [
"identifier.change",
"io.output.change"
] | 783,964 | 783,965 | u293599059 | cpp |
p02981 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define ll long long
#define MAX 10000000
#define SENTINEL 2e10;
int main() {
int n, a, b;
cin >> n >> a >> b;
int tmp = n * a;
if (tmp < b)
cout << tmp << endl;
else
cout << tmp << endl;
} | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define ll long long
#define MAX 10000000
#define SENTINEL 2e10;
int main() {
int n, a, b;
cin >> n >> a >> b;
int tmp = n * a;
if (tmp < b)
cout << tmp << endl;
else
cout << b << endl;
} | [
"identifier.change",
"io.output.change"
] | 783,966 | 783,967 | u101048376 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
const int MAX{200010};
const ll MOD{1000000007}, oo{1LL << 62};
int solve(int N, const vector<int> &xs) { return 0; }
int main() {
ios::sync_with_stdio(false);
int N, A, B;
cin >> N >> A >> B;
cout << min(N * A, N * B) << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
const int MAX{200010};
const ll MOD{1000000007}, oo{1LL << 62};
int solve(int N, const vector<int> &xs) { return 0; }
int main() {
ios::sync_with_stdio(false);
int N, A, B;
cin >> N >> A >> B;
cout << min(N * A, B) << '\n';
return 0;
}
| [
"expression.operation.binary.remove"
] | 783,972 | 783,973 | u389498936 | cpp |
p02981 | #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 << endl;
return 0;
} | #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;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 783,982 | 783,983 | u724499479 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n, a, b;
cout << min(a * n, b) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a * n, b) << endl;
}
| [] | 783,984 | 783,985 | u453095051 | cpp |
p02981 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
#define fir first
#define sec second
#define sz(s) (s).size()
#define pb push_back
#define get(n) scanf("%d", &n);
#define gets(s) \
string s; \
cin >> (s);
#define prfi(n) printf("%d", &n);
#define prfd(n) printf("%lf", &n);
#define All(s) (s).begin(), (s).end()
#define rep(i, j) for (int(i) = 0; (i) < (j); (i)++)
#define For(i, j, k) for (int(i) = (j); (i) < (k); (i)++)
#define drep(i, j) for (int(i) = (j); (i) >= 0; (i)--)
#define Ford(i, j, k) for (int(i) = (j); i >= (k); i--)
#define vfor(c, v) for (auto(c) : (v))
#define lpi(n) for (int i = 0; i < (n); i++)
#define lpj(n) for (int j = 0; j < (n); j++)
#define lpz(n) for (int z = 0; z < (n); z++)
#define mem(a, b) memset(a, b, sizeof(a));
#define dump(x) std::cout << #x << " = " << (x) << std::endl;
#define debug(x) \
cout << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
using ll = long long;
using ld = long double;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;
using vi = std::vector<int>;
using vvi = std::vector<vi>;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vd = std::vector<double>;
using vvd = std::vector<vd>;
using qi = std::queue<int>;
using vpii = std::vector<std::pair<int, int>>;
using vpll = std::vector<pll>;
using namespace std;
const int Mod = (1e9) + 7;
const int INF = 1e9 + 19;
const ll INFL = 1e18 + 19;
const int dx[] = {-1, 0, 0, 1};
const int dy[] = {0, -1, 1, 0};
const int dx2[] = {-1, -1, -1, 0, 0, 0, 1, 1, 1};
const int dy2[] = {1, 0, -1, 1, 0, -1, 1, 0, -1};
//_____________________________________Templates_________________________________________//
template <class T1, class T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <class T1, class T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
template <class T> inline void swap(T &a, T &b) {
T c = a;
a = b;
b = c;
}
template <class T> inline void pri(T a) { cout << a << endl; }
template <class Z> using vec = vector<Z>;
// mainly use for dynamic prog
template <class T1, class T2> void update(T1 &a, T2 b) {
a += b;
if (a > Mod)
a %= Mod;
}
inline void IN(void) { return; }
template <typename First, typename... Rest>
void IN(First &first, Rest &...rest) {
cin >> first;
IN(rest...);
return;
}
inline void OUT(void) {
cout << "\n";
return;
}
template <typename First, typename... Rest>
void OUT(First first, Rest... rest) {
cout << first << " ";
OUT(rest...);
return;
}
bool pairsort(pll pl, pll pr) {
if (pl.first == pr.first)
return pl.second > pr.second;
return pl.first < pr.first;
}
int cntbit(ll a, int n, int j) {
int res = 0;
For(i, j, n) {
if (a >> i & 1) {
res++;
}
}
return res;
}
vector<int> make_bit(int a) {
vector<int> res;
lpi(32) if (a & (1 << i)) res.pb(i);
return res;
}
bool stdbit(int a, int b) { return a & (1 << b); }
int GCD(int a, int b) {
if (b > a)
return GCD(b, a);
if (a % b == 0)
return b;
else
return GCD(b, a % b);
}
int LCM(int a, int b) { return a * b / GCD(a, b); }
int roundup(int a, int b) {
if (a % b == 0)
return a / b;
else
return (a + b) / b;
}
int rounddown(int a, int b) {
if (a % b == 0)
return a / b;
else {
return (a - b) / b;
}
}
ll GetDiviserCount(ll N) //約数の個数
{
ll res = 1;
For(i, 2, sqrt(N) + 1) {
ll cnt = 0;
while (N % i == 0) {
cnt++;
N /= i;
}
res *= (cnt + 1);
if (N == 1)
break;
}
if (N != 1)
res *= 2;
return res;
}
vll GetDivisor(ll N) //約数列挙
{
vll res;
for (ll i = 1; i * i <= N; i++) {
if (N % i == 0) {
res.pb(i);
if (i * i != N)
res.pb(N / i);
}
}
sort(All(res));
return res;
}
//_____________________ following sorce code_________________________//
const int max_n = 3 * (1e5) + 1;
const int max_m = 83 * (1e5) + 1;
int n, m, k;
ll N;
int h, w;
vvi tree;
string S;
int a, b, c;
vi v;
int ans;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
IN(n, a, b);
a = a * n;
if (a > b)
cout << a << endl;
else
cout << b << endl;
// cout << ans << endl;
// for(auto c : ans){cout << c << endl;}
// cout << fixed << setprecision(15) << ans << endl;
return 0;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
#define fir first
#define sec second
#define sz(s) (s).size()
#define pb push_back
#define get(n) scanf("%d", &n);
#define gets(s) \
string s; \
cin >> (s);
#define prfi(n) printf("%d", &n);
#define prfd(n) printf("%lf", &n);
#define All(s) (s).begin(), (s).end()
#define rep(i, j) for (int(i) = 0; (i) < (j); (i)++)
#define For(i, j, k) for (int(i) = (j); (i) < (k); (i)++)
#define drep(i, j) for (int(i) = (j); (i) >= 0; (i)--)
#define Ford(i, j, k) for (int(i) = (j); i >= (k); i--)
#define vfor(c, v) for (auto(c) : (v))
#define lpi(n) for (int i = 0; i < (n); i++)
#define lpj(n) for (int j = 0; j < (n); j++)
#define lpz(n) for (int z = 0; z < (n); z++)
#define mem(a, b) memset(a, b, sizeof(a));
#define dump(x) std::cout << #x << " = " << (x) << std::endl;
#define debug(x) \
cout << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
using ll = long long;
using ld = long double;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;
using vi = std::vector<int>;
using vvi = std::vector<vi>;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vd = std::vector<double>;
using vvd = std::vector<vd>;
using qi = std::queue<int>;
using vpii = std::vector<std::pair<int, int>>;
using vpll = std::vector<pll>;
using namespace std;
const int Mod = (1e9) + 7;
const int INF = 1e9 + 19;
const ll INFL = 1e18 + 19;
const int dx[] = {-1, 0, 0, 1};
const int dy[] = {0, -1, 1, 0};
const int dx2[] = {-1, -1, -1, 0, 0, 0, 1, 1, 1};
const int dy2[] = {1, 0, -1, 1, 0, -1, 1, 0, -1};
//_____________________________________Templates_________________________________________//
template <class T1, class T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <class T1, class T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
template <class T> inline void swap(T &a, T &b) {
T c = a;
a = b;
b = c;
}
template <class T> inline void pri(T a) { cout << a << endl; }
template <class Z> using vec = vector<Z>;
// mainly use for dynamic prog
template <class T1, class T2> void update(T1 &a, T2 b) {
a += b;
if (a > Mod)
a %= Mod;
}
inline void IN(void) { return; }
template <typename First, typename... Rest>
void IN(First &first, Rest &...rest) {
cin >> first;
IN(rest...);
return;
}
inline void OUT(void) {
cout << "\n";
return;
}
template <typename First, typename... Rest>
void OUT(First first, Rest... rest) {
cout << first << " ";
OUT(rest...);
return;
}
bool pairsort(pll pl, pll pr) {
if (pl.first == pr.first)
return pl.second > pr.second;
return pl.first < pr.first;
}
int cntbit(ll a, int n, int j) {
int res = 0;
For(i, j, n) {
if (a >> i & 1) {
res++;
}
}
return res;
}
vector<int> make_bit(int a) {
vector<int> res;
lpi(32) if (a & (1 << i)) res.pb(i);
return res;
}
bool stdbit(int a, int b) { return a & (1 << b); }
int GCD(int a, int b) {
if (b > a)
return GCD(b, a);
if (a % b == 0)
return b;
else
return GCD(b, a % b);
}
int LCM(int a, int b) { return a * b / GCD(a, b); }
int roundup(int a, int b) {
if (a % b == 0)
return a / b;
else
return (a + b) / b;
}
int rounddown(int a, int b) {
if (a % b == 0)
return a / b;
else {
return (a - b) / b;
}
}
ll GetDiviserCount(ll N) //約数の個数
{
ll res = 1;
For(i, 2, sqrt(N) + 1) {
ll cnt = 0;
while (N % i == 0) {
cnt++;
N /= i;
}
res *= (cnt + 1);
if (N == 1)
break;
}
if (N != 1)
res *= 2;
return res;
}
vll GetDivisor(ll N) //約数列挙
{
vll res;
for (ll i = 1; i * i <= N; i++) {
if (N % i == 0) {
res.pb(i);
if (i * i != N)
res.pb(N / i);
}
}
sort(All(res));
return res;
}
//_____________________ following sorce code_________________________//
const int max_n = 3 * (1e5) + 1;
const int max_m = 83 * (1e5) + 1;
int n, m, k;
ll N;
int h, w;
vvi tree;
string S;
int a, b, c;
vi v;
int ans;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
IN(n, a, b);
a *= n;
if (a >= b)
cout << b << endl;
else
cout << a << endl;
// cout << ans << endl;
// for(auto c : ans){cout << c << endl;}
// cout << fixed << setprecision(15) << ans << endl;
return 0;
} | [
"assignment.change",
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.rep... | 783,988 | 783,989 | u264405855 | cpp |
p02981 | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
long long int n, a, b;
cin >> n >> a >> b;
cout << min(a * n, b * n) << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
long long int n, a, b;
cin >> n >> a >> b;
cout << min(a * n, b) << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 783,990 | 783,991 | u519899937 | cpp |
p02981 | #include <bits/stdc++.h>
#include <cstring>
#define ll long long
using namespace std;
long long power(ll x, ll n) {
if (n == 0)
return 1;
ll temp = power(x, n / 2);
if (n % 2 == 0)
return temp * temp;
else
return x * temp * temp;
}
ll max(ll a, ll b) { return a > b ? a : b; }
ll max(ll a, ll b, ll c) { return max(max(a, b), c); }
ll min(ll x, ll y) { return x + y - max(x, y); }
ll min(ll x, ll y, ll z) { return min(min(x, y), z); }
void swap(int *a, int *b) {
int t = *a;
*a = *b;
*b = t;
}
bool f(ll x, ll y) { return x > y; }
int main() {
ll test;
cin >> test;
ll a, b;
cin >> a >> b;
cout << min(a * test, b * test);
return 0;
}
| #include <bits/stdc++.h>
#include <cstring>
#define ll long long
using namespace std;
long long power(ll x, ll n) {
if (n == 0)
return 1;
ll temp = power(x, n / 2);
if (n % 2 == 0)
return temp * temp;
else
return x * temp * temp;
}
ll max(ll a, ll b) { return a > b ? a : b; }
ll max(ll a, ll b, ll c) { return max(max(a, b), c); }
ll min(ll x, ll y) { return x + y - max(x, y); }
ll min(ll x, ll y, ll z) { return min(min(x, y), z); }
void swap(int *a, int *b) {
int t = *a;
*a = *b;
*b = t;
}
bool f(ll x, ll y) { return x > y; }
int main() {
ll test;
cin >> test;
ll a, b;
cin >> a >> b;
cout << min(a * test, b);
return 0;
}
| [
"expression.operation.binary.remove"
] | 783,994 | 783,995 | u790626495 | cpp |
p02981 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, n * b) << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b) << endl;
} | [
"expression.operation.binary.remove"
] | 783,998 | 783,999 | u206390098 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
typedef long long ll;
typedef double dd;
#define pb push_back
#define mp make_pair
#define endl "\n"
#define M 1000000007
#define pi acos(-1)
/*ll power(ll a,ll b)
{
ll res = 1;
while(b > 0)
{
if(b & 1)
res = (res*a)%M;
a = (a*a)%M;
b = b >> 1;
}
return res;
}*/
/*ll modinv(ll a)
{
return power(a,M - 2);
}*/
/*vector<ll> primes(ll n)
{
bool *sieve = new bool[n + 1];
ll i,j;
vector<ll> v;
for(i = 3; i <= n; i+=2)
sieve[i] = true;
sieve[2] = true;
for(i = 3; i*i <= n; i+=2)
{
if(sieve[i])
for(j = i*i; j <= n; j+=i)
sieve[j] = false;
}
if(n >= 2)
{
v.pb(2);
for(i = 3; i <= n; i+=2)
{
if(sieve[i])
v.pb(i);
}
}
return v;
}*/
/*class graph{
public:
vector<ll> *g;
ll n;
graph(ll v)
{
n = v + 1;
g = new vector<ll> [n];
}
void addegde(ll f,ll s)
{
g[f].pb(s);
g[s].pb(f);
}
void dfs(bool *visited,ll sv)
{
visited[sv] = true;
for(auto x: g[sv])
{
if(!visited[x])
{
dfs(visited,x);
}
}
}
void bfs(ll sv){
queue<ll> q;
bool visited[n] = {};
q.push(sv);
visited[sv] = true;
while(!q.empty())
{
ll node = q.front();
q.pop();
for(auto x : g[node])
{
if(!visited[x])
{
visited[x] = true;
q.push(x);
}
}
}
}
};*/
int main() {
fast;
ll i, j, t;
ll n, a, b;
cin >> n >> a >> b;
cout << n * min(a, b);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
typedef long long ll;
typedef double dd;
#define pb push_back
#define mp make_pair
#define endl "\n"
#define M 1000000007
#define pi acos(-1)
/*ll power(ll a,ll b)
{
ll res = 1;
while(b > 0)
{
if(b & 1)
res = (res*a)%M;
a = (a*a)%M;
b = b >> 1;
}
return res;
}*/
/*ll modinv(ll a)
{
return power(a,M - 2);
}*/
/*vector<ll> primes(ll n)
{
bool *sieve = new bool[n + 1];
ll i,j;
vector<ll> v;
for(i = 3; i <= n; i+=2)
sieve[i] = true;
sieve[2] = true;
for(i = 3; i*i <= n; i+=2)
{
if(sieve[i])
for(j = i*i; j <= n; j+=i)
sieve[j] = false;
}
if(n >= 2)
{
v.pb(2);
for(i = 3; i <= n; i+=2)
{
if(sieve[i])
v.pb(i);
}
}
return v;
}*/
/*class graph{
public:
vector<ll> *g;
ll n;
graph(ll v)
{
n = v + 1;
g = new vector<ll> [n];
}
void addegde(ll f,ll s)
{
g[f].pb(s);
g[s].pb(f);
}
void dfs(bool *visited,ll sv)
{
visited[sv] = true;
for(auto x: g[sv])
{
if(!visited[x])
{
dfs(visited,x);
}
}
}
void bfs(ll sv){
queue<ll> q;
bool visited[n] = {};
q.push(sv);
visited[sv] = true;
while(!q.empty())
{
ll node = q.front();
q.pop();
for(auto x : g[node])
{
if(!visited[x])
{
visited[x] = true;
q.push(x);
}
}
}
}
};*/
int main() {
fast;
/*#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif*/
ll i, j, t;
ll n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b);
return 0;
}
| [
"expression.operation.binary.remove"
] | 784,000 | 784,001 | u501547554 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
#define all(ppp) ppp.begin(), ppp.end()
#define out(ppp) cout << (ppp) << endl
#define out1(ppp) cout << (ppp)
#define MAX_CHAR 256
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define pb push_back
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<vi> vvi;
typedef vector<bool> vb;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
typedef vector<vpi> vvpi;
typedef set<pi> spi;
const int INF = INT_MAX;
int main() {
int N, a, b;
cin >> N >> a >> b;
out(N * min(a, b));
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
#define all(ppp) ppp.begin(), ppp.end()
#define out(ppp) cout << (ppp) << endl
#define out1(ppp) cout << (ppp)
#define MAX_CHAR 256
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define pb push_back
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<vi> vvi;
typedef vector<bool> vb;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
typedef vector<vpi> vvpi;
typedef set<pi> spi;
const int INF = INT_MAX;
int main() {
int N, a, b;
cin >> N >> a >> b;
out(min(N * a, b));
return 0;
}
| [
"call.arguments.add",
"call.remove"
] | 784,016 | 784,017 | u084218424 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
std::cin >> n >> a >> b;
int c = n * a;
if (c >= b) {
std::cout << c << '\n';
} else {
std::cout << b << '\n';
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
std::cin >> n >> a >> b;
int c = n * a;
if (c >= b) {
std::cout << b << '\n';
} else {
std::cout << c << '\n';
}
return 0;
}
| [
"identifier.change",
"expression.operation.binary.change"
] | 784,020 | 784,021 | u760467044 | cpp |
p02981 | #include "bits/stdc++.h"
// region Template
#include "ext/pb_ds/assoc_container.hpp"
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
const int MOD2 = 998244353;
const int MOD = 1000000007;
using namespace std;
#define finish(x) \
cout << x; \
exit(0);
#define fastIO \
cin.tie(0); \
cin.sync_with_stdio(false);
void setIn(string s) { freopen(s.c_str(), "r", stdin); }
void setOut(string s) { freopen(s.c_str(), "w", stdout); }
// const string USCAO_TAG = "mountains";
void usaco(const string &USACO_TAG) {
setIn(USACO_TAG + ".in");
setOut(USACO_TAG + ".out");
}
#define is_empty(...) (sizeof((char[]){#__VA_ARGS__}) == 1)
void print() {}
template <typename T, typename... Args> void print(T firstArg, Args... args) {
#ifdef LOCAL
cout << firstArg << endl;
print(args...);
#endif
}
// endregion
/* Notes:
* Fry my kartoshka
*/
const int MAXN = 100 + 2;
const int INF = 2e9;
int tre[4 * MAXN];
int a[] = {1, 2, 3, 4, 5};
int f[4 * MAXN];
void build(int v, int l, int r) {
if (l == r) {
tre[v] = a[l];
} else {
int m = (l + r) / 2;
build(2 * v, l, m);
build(2 * v + 1, m + 1, r);
tre[v] = tre[v * 2] + tre[v * 2 + 1];
}
}
void push(int v, int l, int m, int r) {
f[2 * v] += f[v];
f[2 * v + 1] += f[v];
tre[2 * v] += (m - l + 1) * f[v];
tre[2 * v + 1] += (r - m) * f[v];
f[v] = 0;
}
void update(int v, int tl, int tr, int l, int r, int val) {
if (l > r)
return;
if (l == tl && r == tr) {
tre[v] += val * (r - l + 1);
f[v] += val;
return;
}
int tm = (tl + tr) / 2;
push(v, tl, tm, tr);
update(v * 2, tl, tm, l, min(r, tm), val);
update(v * 2 + 1, tm + 1, tr, max(l, tm + 1), r, val);
tre[v] = tre[2 * v] + tre[2 * v + 1];
}
int sum(int v, int tl, int tr, int l, int r) {
if (l > r)
return 0;
if (l == tl && r == tr) {
;
return tre[v];
}
int tm = (tl + tr) / 2;
push(v, tl, tm, tr);
return sum(v * 2, tl, tm, l, min(r, tm)) +
sum(v * 2 + 1, tm + 1, tr, max(l, tm + 1), r);
}
int g[MAXN][MAXN];
int main() {
// usaco("milkvisits");
#ifdef LOCAL
setIn("in.txt");
setOut("out.txt");
#endif
ll n, a, b;
cin >> n >> a >> b;
cout << min(n * a, n * b);
} | #include "bits/stdc++.h"
// region Template
#include "ext/pb_ds/assoc_container.hpp"
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
const int MOD2 = 998244353;
const int MOD = 1000000007;
using namespace std;
#define finish(x) \
cout << x; \
exit(0);
#define fastIO \
cin.tie(0); \
cin.sync_with_stdio(false);
void setIn(string s) { freopen(s.c_str(), "r", stdin); }
void setOut(string s) { freopen(s.c_str(), "w", stdout); }
// const string USCAO_TAG = "mountains";
void usaco(const string &USACO_TAG) {
setIn(USACO_TAG + ".in");
setOut(USACO_TAG + ".out");
}
#define is_empty(...) (sizeof((char[]){#__VA_ARGS__}) == 1)
void print() {}
template <typename T, typename... Args> void print(T firstArg, Args... args) {
#ifdef LOCAL
cout << firstArg << endl;
print(args...);
#endif
}
// endregion
/* Notes:
* Fry my kartoshka
*/
const int MAXN = 100 + 2;
const int INF = 2e9;
int tre[4 * MAXN];
int a[] = {1, 2, 3, 4, 5};
int f[4 * MAXN];
void build(int v, int l, int r) {
if (l == r) {
tre[v] = a[l];
} else {
int m = (l + r) / 2;
build(2 * v, l, m);
build(2 * v + 1, m + 1, r);
tre[v] = tre[v * 2] + tre[v * 2 + 1];
}
}
void push(int v, int l, int m, int r) {
f[2 * v] += f[v];
f[2 * v + 1] += f[v];
tre[2 * v] += (m - l + 1) * f[v];
tre[2 * v + 1] += (r - m) * f[v];
f[v] = 0;
}
void update(int v, int tl, int tr, int l, int r, int val) {
if (l > r)
return;
if (l == tl && r == tr) {
tre[v] += val * (r - l + 1);
f[v] += val;
return;
}
int tm = (tl + tr) / 2;
push(v, tl, tm, tr);
update(v * 2, tl, tm, l, min(r, tm), val);
update(v * 2 + 1, tm + 1, tr, max(l, tm + 1), r, val);
tre[v] = tre[2 * v] + tre[2 * v + 1];
}
int sum(int v, int tl, int tr, int l, int r) {
if (l > r)
return 0;
if (l == tl && r == tr) {
;
return tre[v];
}
int tm = (tl + tr) / 2;
push(v, tl, tm, tr);
return sum(v * 2, tl, tm, l, min(r, tm)) +
sum(v * 2 + 1, tm + 1, tr, max(l, tm + 1), r);
}
int g[MAXN][MAXN];
int main() {
// usaco("milkvisits");
#ifdef LOCAL
setIn("in.txt");
setOut("out.txt");
#endif
ll n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b);
} | [
"expression.operation.binary.remove"
] | 784,027 | 784,028 | u557558723 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << (b > a * n) ? a * n : b;
} | #include <bits/stdc++.h>
using namespace std;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << ((b > a * n) ? a * n : b);
} | [] | 784,036 | 784,037 | u420245204 | cpp |
p02981 | #include <bits/stdc++.h>
#include <string.h>
typedef long long int ll;
#define all(x) (x).begin(), (x).end()
using namespace std;
int nxt() {
int x;
cin >> x;
return x;
}
ll nxtl() {
ll x;
cin >> x;
return x;
}
void SieveOfEratosthenes(int n, vector<int> &primes) {
// Create a boolean array "prime[0..n]" and initialize
// all entries it as true. A value in prime[i] will
// finally be false if i is Not a prime, else true.
bool prime[n + 1];
memset(prime, true, sizeof(prime));
for (int p = 2; p * p <= n; p++) {
// If prime[p] is not changed, then it is a prime
if (prime[p] == true) {
// Update all multiples of p greater than or
// equal to the square of it
// numbers which are multiple of p and are
// less than p^2 are already been marked.
for (int i = p * p; i <= n; i += p)
prime[i] = false;
}
}
// Print all prime numbers
for (int p = 2; p <= n; p++)
if (prime[p])
primes.push_back(p);
}
ll max(ll a, ll b) {
if (a > b)
return a;
return b;
}
ll power(ll x, ll y, ll mod) {
ll temp;
if (y == 0)
return 1;
temp = power(x, y / 2, mod);
if (y % 2 == 0)
return (temp * temp) % mod;
else
return (((x * temp) % mod) * temp) % mod;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n = nxt(), a = nxt(), b = nxt();
cout << min(n * a, n * b) << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <string.h>
typedef long long int ll;
#define all(x) (x).begin(), (x).end()
using namespace std;
int nxt() {
int x;
cin >> x;
return x;
}
ll nxtl() {
ll x;
cin >> x;
return x;
}
void SieveOfEratosthenes(int n, vector<int> &primes) {
// Create a boolean array "prime[0..n]" and initialize
// all entries it as true. A value in prime[i] will
// finally be false if i is Not a prime, else true.
bool prime[n + 1];
memset(prime, true, sizeof(prime));
for (int p = 2; p * p <= n; p++) {
// If prime[p] is not changed, then it is a prime
if (prime[p] == true) {
// Update all multiples of p greater than or
// equal to the square of it
// numbers which are multiple of p and are
// less than p^2 are already been marked.
for (int i = p * p; i <= n; i += p)
prime[i] = false;
}
}
// Print all prime numbers
for (int p = 2; p <= n; p++)
if (prime[p])
primes.push_back(p);
}
ll max(ll a, ll b) {
if (a > b)
return a;
return b;
}
ll power(ll x, ll y, ll mod) {
ll temp;
if (y == 0)
return 1;
temp = power(x, y / 2, mod);
if (y % 2 == 0)
return (temp * temp) % mod;
else
return (((x * temp) % mod) * temp) % mod;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n = nxt(), a = nxt(), b = nxt();
cout << min(n * a, b) << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 784,040 | 784,041 | u766212984 | cpp |
p02981 | #if defined(DAIJOBU)
#include "/home/ichigo/includes.hpp"
#include "PP.hpp"
#define deb(x...) cerr << "[" << #x << "] = " << x << "\n";
#else
#include <bits/stdc++.h>
#define deb(x...)
#endif
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long lint;
typedef vector<lint> vlint;
typedef vector<vlint> vvlint;
typedef pair<lint, lint> plint;
typedef double ld;
template <class T> bool chmin(T &a, T b) {
return a > b ? (a = b, true) : false;
}
template <class T> bool chmax(T &a, T b) {
return a < b ? (a = b, true) : false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, a, b;
cin >> n >> a >> b;
cout << n * min(a, b) << '\n';
return 0;
}
| #if defined(DAIJOBU)
#include "/home/ichigo/includes.hpp"
#include "PP.hpp"
#define deb(x...) cerr << "[" << #x << "] = " << x << "\n";
#else
#include <bits/stdc++.h>
#define deb(x...)
#endif
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long lint;
typedef vector<lint> vlint;
typedef vector<vlint> vvlint;
typedef pair<lint, lint> plint;
typedef double ld;
template <class T> bool chmin(T &a, T b) {
return a > b ? (a = b, true) : false;
}
template <class T> bool chmax(T &a, T b) {
return a < b ? (a = b, true) : false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b) << '\n';
return 0;
}
| [
"expression.operation.binary.remove"
] | 784,042 | 784,043 | u461913494 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int A, B, N;
cin >> A >> B;
if (B < A * N)
cout << B;
else
cout << N * A;
}
| #include <iostream>
using namespace std;
int main() {
int A, B, N;
cin >> N >> A >> B;
if (B < A * N)
cout << B;
else
cout << N * A;
}
| [
"expression.operation.binary.add"
] | 784,046 | 784,047 | u406246506 | cpp |
p02981 | #include <iostream>
using namespace std;
int main()
{
int n, a, b;
cin >> n >> a >> b;
if (a > b)
cout << b * n;
else
cout << a * n;
}
| #include <iostream>
using namespace std;
int main()
{
int n, a, b;
cin >> n >> a >> b;
if (a * n > b)
cout << b;
else
cout << a * n;
}
| [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 784,048 | 784,049 | u597079106 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int a, b, n;
cin >> n >> a >> b;
if ((n * a) > (n * b))
cout << n * b;
else
cout << n * a;
} | #include <iostream>
using namespace std;
int main() {
int a, b, n;
cin >> n >> a >> b;
if ((n * a) > b)
cout << b;
else
cout << n * a;
} | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 784,050 | 784,051 | u746310630 | cpp |
p02981 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int lo;
#define pb push_back
#define mp make_pair
#define st first
#define nd second
#define inf (lo)1e10 + 7
#define FOR for (lo i = 0; i < n; i++)
#define FORV for (lo i = 0; i < (lo)v.size(); i++)
#define ii pair<lo, lo>
#define iii pair<lo, pair<lo, lo>>
#define si pair<string, lo>
lo a, b, c, d, e, n, m, k, t, h, x, y, a1[100005], a2[100005];
char c1, c2, c3, c4;
string s1, s2, s3, s4;
double d1, d2, d3;
vector<lo> v;
map<lo, lo> mp1;
map<lo, lo> mp2;
set<lo> stt;
queue<lo> q;
priority_queue<lo> pq;
lo vis[10000];
int main() {
// freopen("gir.gir", "r", stdin);
// freopen("cik.cik", "w", stdout);
cin >> n >> a >> b;
cout << n * min(a, b) << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int lo;
#define pb push_back
#define mp make_pair
#define st first
#define nd second
#define inf (lo)1e10 + 7
#define FOR for (lo i = 0; i < n; i++)
#define FORV for (lo i = 0; i < (lo)v.size(); i++)
#define ii pair<lo, lo>
#define iii pair<lo, pair<lo, lo>>
#define si pair<string, lo>
lo a, b, c, d, e, n, m, k, t, h, x, y, a1[100005], a2[100005];
char c1, c2, c3, c4;
string s1, s2, s3, s4;
double d1, d2, d3;
vector<lo> v;
map<lo, lo> mp1;
map<lo, lo> mp2;
set<lo> stt;
queue<lo> q;
priority_queue<lo> pq;
lo vis[10000];
int main() {
// freopen("gir.gir", "r", stdin);
// freopen("cik.cik", "w", stdout);
cin >> n >> a >> b;
cout << min(n * a, b) << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 784,052 | 784,053 | u070211042 | cpp |
p02981 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << n * min(a, b);
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a * n, b);
} | [
"expression.operation.binary.remove"
] | 784,068 | 784,069 | u724012411 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
scanf("%d%d%d", &n, &a, &b);
if (a <= b)
printf("%d", n * a);
else
printf("%d", n * b);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
scanf("%d%d%d", &n, &a, &b);
if (n * a <= b)
printf("%d", n * a);
else
printf("%d", b);
} | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 784,070 | 784,071 | u033208015 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
a *= n;
b *= n;
cout << (a < b ? a : b);
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
a *= n;
cout << (a < b ? a : b);
return 0;
}
| [] | 784,078 | 784,079 | u723394740 | cpp |
p02981 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
int train = N * A;
int min;
if (train > N) {
min = N;
} else {
min = train;
}
cout << min << endl;
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
int train = N * A;
int min;
if (train > B) {
min = B;
} else {
min = train;
}
cout << min << endl;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 784,080 | 784,081 | u848339218 | cpp |
p02981 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, a, b;
cin >> n >> a >> b;
int result = min(a * n, b / n);
cout << result << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, a, b;
cin >> n >> a >> b;
int result = min(a * n, b);
cout << result << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 784,084 | 784,085 | u011438316 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
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;
}
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, n * b) << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
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;
}
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b) << endl;
} | [
"expression.operation.binary.remove"
] | 784,094 | 784,095 | u989306199 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (N * A >= B) {
cout << N * A << endl;
} else {
cout << B << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (N * A >= B) {
cout << B << endl;
} else {
cout << N * A << endl;
}
}
| [
"control_flow.branch.else.add"
] | 784,096 | 784,097 | u492707675 | cpp |
p02981 | // author:luckYrat(twitter:@luckYrat_)
//#include <bits/stdc++.h>
// def
#include <iostream>
#include <algorithm>
#include <cmath>
#include <iomanip>
// array
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define anyfill(n, s) setw(n) << setfill(s)
#define loop(s) for (int i = 0; s > i; i++)
#define rep(i, q) for (int i = 0; (q) > i; i++)
#define repp(i, n, q) for (int i = n; (q) > i; i++)
#define dep(i, q) for (int i = (q); 0 < i; i--)
#define MAX 1000000000
const int mod = 1000000007;
#define EPS (1e-10)
#define pb push_back
#define fir first
#define scn second
#define ednl endl
#define YesNo(a) (a ? "Yes" : "No")
#define YESNO(a) (a ? "YES" : "NO")
#define yesno(a) (a ? "yes" : "no")
P ar4[4] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
P ar8[8] = {{-1, -1}, {-1, 0}, {-1, 1}, {0, -1},
{0, 1}, {1, -1}, {1, 0}, {1, 1}};
/*
確認ポイント
cout << fixed << setprecision(n) << 小数計算//n桁の小数表記になる
vector.unique()は隣接した同じ要素を削除するので先にソートをする
計算量は変わらないが楽できるシリーズ
C++11以降でmin({a,b,c...})で複数個のmic,maxを処理できる
min(max)_element(iter,iter)で一番小さい(大きい)値のポインタが帰ってくる
count(iter,iter,int)でintがiterからiterの間にいくつあったかを取得できる
*/
__attribute__((constructor)) void initial() {
cin.tie(0);
ios::sync_with_stdio(false);
}
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, n * b) << endl;
}
| // author:luckYrat(twitter:@luckYrat_)
//#include <bits/stdc++.h>
// def
#include <iostream>
#include <algorithm>
#include <cmath>
#include <iomanip>
// array
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define anyfill(n, s) setw(n) << setfill(s)
#define loop(s) for (int i = 0; s > i; i++)
#define rep(i, q) for (int i = 0; (q) > i; i++)
#define repp(i, n, q) for (int i = n; (q) > i; i++)
#define dep(i, q) for (int i = (q); 0 < i; i--)
#define MAX 1000000000
const int mod = 1000000007;
#define EPS (1e-10)
#define pb push_back
#define fir first
#define scn second
#define ednl endl
#define YesNo(a) (a ? "Yes" : "No")
#define YESNO(a) (a ? "YES" : "NO")
#define yesno(a) (a ? "yes" : "no")
P ar4[4] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
P ar8[8] = {{-1, -1}, {-1, 0}, {-1, 1}, {0, -1},
{0, 1}, {1, -1}, {1, 0}, {1, 1}};
/*
確認ポイント
cout << fixed << setprecision(n) << 小数計算//n桁の小数表記になる
vector.unique()は隣接した同じ要素を削除するので先にソートをする
計算量は変わらないが楽できるシリーズ
C++11以降でmin({a,b,c...})で複数個のmic,maxを処理できる
min(max)_element(iter,iter)で一番小さい(大きい)値のポインタが帰ってくる
count(iter,iter,int)でintがiterからiterの間にいくつあったかを取得できる
*/
__attribute__((constructor)) void initial() {
cin.tie(0);
ios::sync_with_stdio(false);
}
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(b, n * a) << endl;
}
| [
"identifier.change",
"io.output.change"
] | 784,098 | 784,099 | u466161487 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int c = min(n * a, n * b);
cout << c;
} | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int c = min(n * a, b);
cout << c;
} | [
"expression.operation.binary.remove"
] | 784,104 | 784,105 | u271572148 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int c = min(n * a, n * b);
cout << c;
}
| #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int c = min(n * a, b);
cout << c;
} | [
"expression.operation.binary.remove"
] | 784,106 | 784,105 | u271572148 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int(i) = ((n)-1); (i) >= 0; (i)--)
#define itn int
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
using P = pair<int, int>;
using WeightedGraph = vector<vector<P>>; // to cost
using UnWeightedGraph = vector<vector<int>>;
const long long INF = 1LL << 60;
const int MOD = 1000000007;
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;
}
#define DUMPOUT cerr
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p_var) {
is >> p_var.first >> p_var.second;
return is;
}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <typename T> istream &operator>>(istream &is, vector<vector<T>> &df) {
for (int i = 0; i < df.size(); i++)
for (int j = 0; j < df[i].size(); j++)
is >> df[i][j];
return is;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
DUMPOUT << '{';
os << pair_var.first;
DUMPOUT << ',';
os << " " << pair_var.second;
DUMPOUT << '}';
return os;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &vec) {
DUMPOUT << '[';
for (int i = 0; i < vec.size(); i++)
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
DUMPOUT << ']';
return os;
}
template <typename T> ostream &operator<<(ostream &os, vector<vector<T>> &df) {
for (auto &vec : df)
os << vec;
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
DUMPOUT << "{";
repi(itr, map_var) {
os << *itr;
itr++;
if (itr != map_var.end())
DUMPOUT << ", ";
itr--;
}
DUMPOUT << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) {
DUMPOUT << "{";
repi(itr, set_var) {
os << *itr;
itr++;
if (itr != set_var.end())
DUMPOUT << ", ";
itr--;
}
DUMPOUT << "}";
return os;
}
void print() { cout << endl; }
template <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {
cout << head;
if (sizeof...(tail) != 0)
cout << " ";
print(forward<Tail>(tail)...);
}
void dump_func() { DUMPOUT << '#' << endl; }
template <typename Head, typename... Tail>
void dump_func(Head &&head, Tail &&...tail) {
DUMPOUT << head;
if (sizeof...(Tail) > 0)
DUMPOUT << ", ";
dump_func(std::move(tail)...);
}
#ifdef DEBUG_
#define DEB
#define dump(...) \
DUMPOUT << " " << string(#__VA_ARGS__) << ": " \
<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \
<< " ", \
dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif
signed main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n, a, b;
cin >> n >> a >> b;
print(max(b, n * a));
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int(i) = ((n)-1); (i) >= 0; (i)--)
#define itn int
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
using P = pair<int, int>;
using WeightedGraph = vector<vector<P>>; // to cost
using UnWeightedGraph = vector<vector<int>>;
const long long INF = 1LL << 60;
const int MOD = 1000000007;
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;
}
#define DUMPOUT cerr
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p_var) {
is >> p_var.first >> p_var.second;
return is;
}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <typename T> istream &operator>>(istream &is, vector<vector<T>> &df) {
for (int i = 0; i < df.size(); i++)
for (int j = 0; j < df[i].size(); j++)
is >> df[i][j];
return is;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
DUMPOUT << '{';
os << pair_var.first;
DUMPOUT << ',';
os << " " << pair_var.second;
DUMPOUT << '}';
return os;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &vec) {
DUMPOUT << '[';
for (int i = 0; i < vec.size(); i++)
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
DUMPOUT << ']';
return os;
}
template <typename T> ostream &operator<<(ostream &os, vector<vector<T>> &df) {
for (auto &vec : df)
os << vec;
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
DUMPOUT << "{";
repi(itr, map_var) {
os << *itr;
itr++;
if (itr != map_var.end())
DUMPOUT << ", ";
itr--;
}
DUMPOUT << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) {
DUMPOUT << "{";
repi(itr, set_var) {
os << *itr;
itr++;
if (itr != set_var.end())
DUMPOUT << ", ";
itr--;
}
DUMPOUT << "}";
return os;
}
void print() { cout << endl; }
template <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {
cout << head;
if (sizeof...(tail) != 0)
cout << " ";
print(forward<Tail>(tail)...);
}
void dump_func() { DUMPOUT << '#' << endl; }
template <typename Head, typename... Tail>
void dump_func(Head &&head, Tail &&...tail) {
DUMPOUT << head;
if (sizeof...(Tail) > 0)
DUMPOUT << ", ";
dump_func(std::move(tail)...);
}
#ifdef DEBUG_
#define DEB
#define dump(...) \
DUMPOUT << " " << string(#__VA_ARGS__) << ": " \
<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \
<< " ", \
dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif
signed main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n, a, b;
cin >> n >> a >> b;
print(min(b, n * a));
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"io.output.change"
] | 784,107 | 784,108 | u616029737 | cpp |
p02981 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define log(x) cout << x << endl
#define pb push_back
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long lint;
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if (n * a > b) {
cout << b;
} else if (n * a < b) {
cout << a;
} else {
cout << b;
}
} | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define log(x) cout << x << endl
#define pb push_back
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long lint;
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if (n * a > b) {
cout << b;
} else if (n * a < b) {
cout << n * a;
} else {
cout << b;
}
} | [
"expression.operation.binary.add"
] | 784,109 | 784,110 | u765118693 | cpp |
p02981 | #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 << endl;
}
return 0;
} | #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;
}
return 0;
} | [
"expression.operation.binary.add"
] | 784,111 | 784,112 | u059787063 | cpp |
p02981 | #include <iostream>
using namespace std;
int main(void) {
int n, a, b;
cin >> n >> a >> b;
int ans = min(a, b);
cout << ans * n << endl;
}
| #include <iostream>
using namespace std;
int main(void) {
int n, a, b;
cin >> n >> a >> b;
int ans = min(a * n, b);
cout << ans << endl;
}
| [
"expression.operation.binary.remove"
] | 784,113 | 784,114 | u336381735 | cpp |
p02981 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
typedef long long int Int;
constexpr Int TEN(int n) { return n == 0 ? 1 : 10 * TEN(n - 1); }
int main(void) {
int N, A, B;
cin >> N >> A >> B;
cout << max(A * N, B) << endl;
return 0;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
typedef long long int Int;
constexpr Int TEN(int n) { return n == 0 ? 1 : 10 * TEN(n - 1); }
int main(void) {
int N, A, B;
cin >> N >> A >> B;
cout << min(A * N, B) << endl;
return 0;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 784,119 | 784,120 | u498141549 | cpp |
p02981 | #include <algorithm>
#include <iostream>
#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 << endl;
else
cout << n * b << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#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;
return 0;
} | [
"expression.operation.binary.remove"
] | 784,121 | 784,122 | u003026289 | cpp |
p02981 | #include <iostream>
using namespace std;
int main(int argc, char **argv) {
int n, a, b;
cin >> n;
cin >> a;
cin >> b;
int x = n * a;
int y = b;
if (x > y)
cout << x << endl;
else
cout << y << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(int argc, char **argv) {
int n, a, b;
cin >> n;
cin >> a;
cin >> b;
int x = n * a;
int y = b;
if (x < y)
cout << x << endl;
else
cout << y << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 784,127 | 784,128 | u353547517 | cpp |
p02981 | #include <algorithm>
#include <stdio.h>
using namespace std;
using ll = long long;
int n, a, b;
int main() {
scanf("%d %d %d", &n, &a, &b);
printf("%d\n", n * min(a, b));
} | #include <algorithm>
#include <stdio.h>
using namespace std;
using ll = long long;
int n, a, b;
int main() {
scanf("%d %d %d", &n, &a, &b);
printf("%d\n", min(n * a, b));
} | [
"expression.operation.binary.remove"
] | 784,132 | 784,133 | u196520288 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(vec) (vec).begin(), (vec).end()
#define lli long long int
#define pi 3.1415926535897932384626433832795
#define MAX_INF 9223372036854775807
#define MIN_INF 9223372036854775807 + 1
int main() {
int A, B, C;
cin >> A >> B >> C;
if (B < C)
cout << A * B << endl;
else
cout << A * C << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(vec) (vec).begin(), (vec).end()
#define lli long long int
#define pi 3.1415926535897932384626433832795
#define MAX_INF 9223372036854775807
#define MIN_INF 9223372036854775807 + 1
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A * B < C)
cout << A * B << endl;
else
cout << C << endl;
}
| [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 784,136 | 784,137 | u170513117 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int32_t main() {
int a, b, n;
cin >> n >> a >> b;
cout << min(a, b) * n << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int32_t main() {
int a, b, n;
cin >> n >> a >> b;
cout << min(a * n, b) << endl;
}
| [
"expression.operation.binary.remove"
] | 784,138 | 784,139 | u508688268 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, a, b;
cin >> n >> a >> b;
if (a * n >= b)
cout << b << endl;
else
cout << a << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, a, b;
cin >> n >> a >> b;
if (a * n >= b)
cout << b << endl;
else
cout << n * a << endl;
} | [
"expression.operation.binary.add"
] | 784,144 | 784,145 | u740686641 | cpp |
p02981 | #include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define eb emplace_back
#define emp emplace
#define ins insert
#define mp make_pair
#define mt make_tuple
#define sz(s) (int)s.size()
#define forp(i, a, b) for (int i = a; i <= b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define ren(i, n) for (int i = n - 1; i >= 0; i--)
#define forn(i, a, b) for (int i = a; i >= b; i--)
#define w(t) while (t)
#define sc(a) scanf("%d", &a);
#define on cout << "\n"
#define os cout << " "
#define o2(a, b) cout << a << " " << b
#define o(a) cout << a
#define ppr(a) cout << a.first << " " << a.second
#define bitcount __builtin_popcount
#define gcd __gcd
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define mem(n, m) memset(n, m, sizeof(n))
#define pii pair<int, int>
#define tiii tuple<int, int, int>
#define pll pair<long long, long long>
#define sii set<int>
#define sll set<long long>
#define vii vector<int>
#define vll vector<long long>
#define mii map<int, int>
#define mll map<long long, long long>
#define lob lower_bound
#define upb upper_bound
#define ret return
#define present(s, x) (s.find(x) != s.end())
#define cpresent(s, x) (find(all(s), x) != s.end())
#define ford(container, it) \
for (auto it = container.begin(); it != container.end(); it++)
#define fors(container, it, a, b) for (auto it = a; it != b; it++)
#define boost \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define MOD 1000000007
#define EPSILON 1e-9
#define PI acos(-1)
#define int long long
#define inf 1e15
#define debug(a) \
cerr << #a << ": "; \
for (auto i : a) \
cerr << i << " "; \
cerr << '\n';
#define trace(a) cerr << #a << ": " << a << "\n"
#define ordered_set \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
typedef long long ll;
typedef long double ldo;
typedef double db;
using namespace std;
auto start = std::chrono::system_clock::now();
inline void skj() {
std::chrono::time_point<std::chrono::system_clock> end;
end = std::chrono::system_clock::now();
std::chrono::duration<double> elapsed_seconds = end - start;
std::time_t end_time = std::chrono::system_clock::to_time_t(end);
cerr << "Time taken " << elapsed_seconds.count() * 1000 << "\n";
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// uniform_int_distribution<int> ud(1, 100); use this for random number
// generator
// custom hash for unordered map
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
// http://xorshift.di.unimi.it/splitmix64.c
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
inline int binexp(int a, int b, int m) {
if (a == 0) {
ret 0;
}
int res = 1;
a %= m;
while (b) {
if (b & 1)
res = (res * 1ll * a) % m;
a = (a * 1ll * a) % m;
b >>= 1;
}
return res;
}
inline int binmul(int a, int b, int m) {
a %= m;
int res = 0;
w(b) {
if (b & 1) {
res = (res + a) % m;
}
a = (a + a) % m;
b >>= 1;
}
ret res;
}
inline void solve_me_senpai() {
int n, a, b;
cin >> n >> a >> b;
o(min(n * a, n * b));
}
int32_t main() {
boost int t = 1;
// cin >> t;
int a = 1;
while (t--) {
// cout << "Case #" << a << ": ";
solve_me_senpai();
a++;
}
// skj();
return 0;
} | #include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define eb emplace_back
#define emp emplace
#define ins insert
#define mp make_pair
#define mt make_tuple
#define sz(s) (int)s.size()
#define forp(i, a, b) for (int i = a; i <= b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define ren(i, n) for (int i = n - 1; i >= 0; i--)
#define forn(i, a, b) for (int i = a; i >= b; i--)
#define w(t) while (t)
#define sc(a) scanf("%d", &a);
#define on cout << "\n"
#define os cout << " "
#define o2(a, b) cout << a << " " << b
#define o(a) cout << a
#define ppr(a) cout << a.first << " " << a.second
#define bitcount __builtin_popcount
#define gcd __gcd
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define mem(n, m) memset(n, m, sizeof(n))
#define pii pair<int, int>
#define tiii tuple<int, int, int>
#define pll pair<long long, long long>
#define sii set<int>
#define sll set<long long>
#define vii vector<int>
#define vll vector<long long>
#define mii map<int, int>
#define mll map<long long, long long>
#define lob lower_bound
#define upb upper_bound
#define ret return
#define present(s, x) (s.find(x) != s.end())
#define cpresent(s, x) (find(all(s), x) != s.end())
#define ford(container, it) \
for (auto it = container.begin(); it != container.end(); it++)
#define fors(container, it, a, b) for (auto it = a; it != b; it++)
#define boost \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define MOD 1000000007
#define EPSILON 1e-9
#define PI acos(-1)
#define int long long
#define inf 1e15
#define debug(a) \
cerr << #a << ": "; \
for (auto i : a) \
cerr << i << " "; \
cerr << '\n';
#define trace(a) cerr << #a << ": " << a << "\n"
#define ordered_set \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
typedef long long ll;
typedef long double ldo;
typedef double db;
using namespace std;
auto start = std::chrono::system_clock::now();
inline void skj() {
std::chrono::time_point<std::chrono::system_clock> end;
end = std::chrono::system_clock::now();
std::chrono::duration<double> elapsed_seconds = end - start;
std::time_t end_time = std::chrono::system_clock::to_time_t(end);
cerr << "Time taken " << elapsed_seconds.count() * 1000 << "\n";
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// uniform_int_distribution<int> ud(1, 100); use this for random number
// generator
// custom hash for unordered map
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
// http://xorshift.di.unimi.it/splitmix64.c
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
inline int binexp(int a, int b, int m) {
if (a == 0) {
ret 0;
}
int res = 1;
a %= m;
while (b) {
if (b & 1)
res = (res * 1ll * a) % m;
a = (a * 1ll * a) % m;
b >>= 1;
}
return res;
}
inline int binmul(int a, int b, int m) {
a %= m;
int res = 0;
w(b) {
if (b & 1) {
res = (res + a) % m;
}
a = (a + a) % m;
b >>= 1;
}
ret res;
}
inline void solve_me_senpai() {
int n, a, b;
cin >> n >> a >> b;
o(min(n * a, b));
}
int32_t main() {
boost int t = 1;
// cin >> t;
int a = 1;
while (t--) {
// cout << "Case #" << a << ": ";
solve_me_senpai();
a++;
}
// skj();
return 0;
} | [
"expression.operation.binary.remove"
] | 784,146 | 784,147 | u382427338 | cpp |
p02981 | #include <stdio.h>
int main() {
int N, A, B;
scanf("%d %d %d", &N, &A, &B);
if (N * A < B) {
printf("%d", N * A);
}
printf("%d", B);
return 0;
}
| #include <stdio.h>
int main() {
int N, A, B;
scanf("%d %d %d", &N, &A, &B);
if (N * A < B) {
printf("%d\n", N * A);
return 0;
}
printf("%d", B);
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add",
"control_flow.return.add",
"control_flow.return.0.add"
] | 784,156 | 784,157 | u313629793 | cpp |
p02981 | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#define pan(i, n) for (int i = 0; i < n; i++)
#define ll long long int
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int tc = n * a;
if (tc < b)
cout << tc;
else
cout << tc;
}
| #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#define pan(i, n) for (int i = 0; i < n; i++)
#define ll long long int
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int tc = n * a;
if (tc < b)
cout << tc;
else
cout << b;
}
| [
"identifier.change",
"io.output.change"
] | 784,165 | 784,166 | u116744073 | cpp |
p02981 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, n * b);
return 0;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b);
return 0;
}
| [
"expression.operation.binary.remove"
] | 784,167 | 784,168 | u800427717 | cpp |
p02981 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int d, r;
d = ceil(n / 4);
r = n * a;
if (r < (d * b))
cout << r;
else
cout << d * b;
return 0;
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int d, r;
d = ceil(n / 4);
r = n * a;
if (r <= (b))
cout << r;
else
cout << b;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 784,173 | 784,174 | u641500793 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if (a * n < b)
cout << a * n << endl;
else
cout << b * n << endl;
return 0;
}
| #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;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"control_flow.branch.else.remove"
] | 784,175 | 784,176 | u199299168 | cpp |
p02981 | /*
* AUTHOR : MANAV PATEl
*/
#include <bits/stdc++.h>
#include <functional>
//#include<boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision;
using namespace std;
namespace fastio {
template <class T> istream &operator>>(istream &os, vector<T> &vec) {
for (auto &u : vec)
os >> u;
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &vec) {
for (auto &u : vec)
os << u << " ";
return os;
}
template <class T1, class T2>
inline istream &operator>>(istream &os, pair<T1, T2> &p) {
return os >> p.first >> p.second;
}
template <class T1, class T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
return os << p.first << " " << p.second;
}
template <class T> ostream &operator<<(ostream &os, set<T> &con) {
for (auto &u : con)
os << u << " ";
return os;
}
void re() {}
template <typename T, typename... args> void re(T &x, args &...tail) {
cin >> x;
re(tail...);
}
void pr() {}
template <typename T> void pr(const T &x) { cout << x; }
template <typename T, typename... args>
void pr(const T &x, const args &...tail) {
cout << x << " ";
pr(tail...);
}
template <typename... args> void prln(const args &...tail) {
pr(tail...);
cout << "\n";
}
} // namespace fastio
using namespace fastio;
typedef long long int ll;
typedef long double ld;
const ll mod = 1e9 + 7;
const ll mod1 = 998244353;
#define fill(a) memset(a, 0, sizeof(a))
#define fst first
#define snd second
#define mp make_pair
#define pb push_back
int main() {
cin.sync_with_stdio(false);
cin.exceptions(cin.failbit);
cin.tie(0);
ll n, a, b;
re(n, a, b);
cout << n * min(a, b);
}
| /*
* AUTHOR : MANAV PATEl
*/
#include <bits/stdc++.h>
#include <functional>
//#include<boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision;
using namespace std;
namespace fastio {
template <class T> istream &operator>>(istream &os, vector<T> &vec) {
for (auto &u : vec)
os >> u;
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &vec) {
for (auto &u : vec)
os << u << " ";
return os;
}
template <class T1, class T2>
inline istream &operator>>(istream &os, pair<T1, T2> &p) {
return os >> p.first >> p.second;
}
template <class T1, class T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
return os << p.first << " " << p.second;
}
template <class T> ostream &operator<<(ostream &os, set<T> &con) {
for (auto &u : con)
os << u << " ";
return os;
}
void re() {}
template <typename T, typename... args> void re(T &x, args &...tail) {
cin >> x;
re(tail...);
}
void pr() {}
template <typename T> void pr(const T &x) { cout << x; }
template <typename T, typename... args>
void pr(const T &x, const args &...tail) {
cout << x << " ";
pr(tail...);
}
template <typename... args> void prln(const args &...tail) {
pr(tail...);
cout << "\n";
}
} // namespace fastio
using namespace fastio;
typedef long long int ll;
typedef long double ld;
const ll mod = 1e9 + 7;
const ll mod1 = 998244353;
#define fill(a) memset(a, 0, sizeof(a))
#define fst first
#define snd second
#define mp make_pair
#define pb push_back
int main() {
cin.sync_with_stdio(false);
cin.exceptions(cin.failbit);
cin.tie(0);
ll n, a, b;
re(n, a, b);
cout << min(n * a, b);
}
| [
"expression.operation.binary.remove"
] | 784,177 | 784,178 | u795263927 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, densha = 0;
cin >> n >> a >> b;
densha = n * a;
if (densha >= b)
cout << n * a << endl;
else if (densha < b)
cout << b << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, densha = 0;
cin >> n >> a >> b;
densha = n * a;
if (densha >= b)
cout << b << endl;
else if (densha <= b)
cout << densha << endl;
return 0;
} | [
"identifier.change",
"io.output.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 784,179 | 784,180 | u166550014 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, densha = 0;
cin >> n >> a >> b;
densha = n * a;
if (densha >= b)
cout << n * a << endl;
else if (densha <= b)
cout << b << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, densha = 0;
cin >> n >> a >> b;
densha = n * a;
if (densha >= b)
cout << b << endl;
else if (densha <= b)
cout << densha << endl;
return 0;
} | [
"identifier.change",
"io.output.change",
"expression.operation.binary.remove"
] | 784,181 | 784,180 | u166550014 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << n * min(n * a, b);
} | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b);
}
| [
"expression.operation.binary.remove"
] | 784,182 | 784,183 | u185011403 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << max(n * a, b);
} | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b);
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 784,184 | 784,183 | u185011403 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << n * min(a, b);
} | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b);
}
| [
"expression.operation.binary.remove"
] | 784,185 | 784,183 | u185011403 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int n = 0, a = 0, b = 0;
cin >> n >> a >> b;
if (n * a < n * b)
cout << n * a << endl;
else if (n * a > n * b)
cout << n * b << endl;
else {
cout << n * a << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n = 0, a = 0, b = 0;
cin >> n >> a >> b;
if (n * a < b)
cout << n * a << endl;
else if (n * a > b)
cout << b << endl;
else {
cout << n * a << endl;
}
return 0;
} | [
"expression.operation.binary.remove"
] | 784,186 | 784,187 | u127042341 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int n = 0, a = 0, b = 0;
cin >> n >> a >> b;
if (a < b)
cout << n * a << endl;
else if (a > b)
cout << n * b << endl;
else {
cout << n * a << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n = 0, a = 0, b = 0;
cin >> n >> a >> b;
if (n * a < b)
cout << n * a << endl;
else if (n * a > b)
cout << b << endl;
else {
cout << n * a << endl;
}
return 0;
} | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 784,188 | 784,187 | u127042341 | cpp |
p02981 | /*input
2
ip cc
*/
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define ALL(a) a.begin(), a.end()
#define SZ(a) ((int)a.size())
#define F first
#define S second
#define REP(i, n) for (int i = 0; i < ((int)n); i++)
#define eb emplace_back
#define pb push_back
#define MP(a, b) make_pair(a, b)
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define EL cout << '\n'
#define BS(a, x) binary_search(ALL(a), x)
template <typename T1, typename T2>
ostream &operator<<(ostream &out, pair<T1, T2> P) {
out << '(' << P.F << ',' << P.S << ')';
return out;
}
template <typename T> ostream &operator<<(ostream &out, vector<T> V) {
REP(i, SZ(V)) out << V[i] << ((i != SZ(V) - 1) ? " " : "");
return out;
}
//}}}
const ll maxn = 300005;
const ll maxlg = 20;
const ll INF64 = 1e18;
const int INF = 0x3f3f3f3f;
const ll MOD = ll(1e9 + 7);
const ld PI = acos(-1);
const ld eps = 1e-9;
// const ll p=880301;
// const ll P=31;
ll mypow(ll a, ll b) {
ll res = 1LL;
while (b) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return res;
}
int main() {
IOS;
int n, a, b;
cin >> n >> a >> b;
cout << n * min(a, b);
return 0;
}
| /*input
2
ip cc
*/
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define ALL(a) a.begin(), a.end()
#define SZ(a) ((int)a.size())
#define F first
#define S second
#define REP(i, n) for (int i = 0; i < ((int)n); i++)
#define eb emplace_back
#define pb push_back
#define MP(a, b) make_pair(a, b)
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define EL cout << '\n'
#define BS(a, x) binary_search(ALL(a), x)
template <typename T1, typename T2>
ostream &operator<<(ostream &out, pair<T1, T2> P) {
out << '(' << P.F << ',' << P.S << ')';
return out;
}
template <typename T> ostream &operator<<(ostream &out, vector<T> V) {
REP(i, SZ(V)) out << V[i] << ((i != SZ(V) - 1) ? " " : "");
return out;
}
//}}}
const ll maxn = 300005;
const ll maxlg = 20;
const ll INF64 = 1e18;
const int INF = 0x3f3f3f3f;
const ll MOD = ll(1e9 + 7);
const ld PI = acos(-1);
const ld eps = 1e-9;
// const ll p=880301;
// const ll P=31;
ll mypow(ll a, ll b) {
ll res = 1LL;
while (b) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return res;
}
int main() {
IOS;
int n, a, b;
cin >> n >> a >> b;
cout << min(a * n, b);
return 0;
}
| [
"expression.operation.binary.remove"
] | 784,189 | 784,190 | u010467501 | cpp |
p02981 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
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) << "\n";
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b) << "\n";
return 0;
} | [
"expression.operation.binary.remove"
] | 784,191 | 784,192 | u606442430 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a, n * b) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b) << endl;
} | [
"call.arguments.change",
"call.arguments.add"
] | 784,193 | 784,194 | u113298224 | cpp |
p02981 | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#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 REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I)
#define RS(X) scanf("%s", (X))
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define CASET \
int ___T; \
scanf("%d", &___T); \
for (int cs = 1; cs <= ___T; cs++)
#define MP make_pair
#define PB push_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PII> VPII;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VPLL;
template <class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(LL &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template <class T, class... U> void R(T &head, U &...tail) {
_R(head);
R(tail...);
}
template <class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const LL &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template <class T, class U> void _W(const pair<T, U> &x) {
_W(x.F);
putchar(' ');
_W(x.S);
}
template <class T> void _W(const vector<T> &x) {
for (auto i = x.begin(); i != x.end(); _W(*i++))
if (i != x.cbegin())
putchar(' ');
}
void W() {}
template <class T, class... U> void W(const T &head, const U &...tail) {
_W(head);
putchar(sizeof...(tail) ? ' ' : '\n');
W(tail...);
}
#ifdef HOME
#define DEBUG(...) \
{ \
printf("# "); \
printf(__VA_ARGS__); \
puts(""); \
}
#else
#define DEBUG(...)
#endif
int MOD = 1e9 + 7;
void ADD(LL &x, LL v) {
x = (x + v) % MOD;
if (x < 0)
x += MOD;
}
/*}}}*/
const int SIZE = 1e6 + 10;
int main() {
int N, A, B;
R(N, A, B);
W(N * min(A, B));
return 0;
}
| /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#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 REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I)
#define RS(X) scanf("%s", (X))
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define CASET \
int ___T; \
scanf("%d", &___T); \
for (int cs = 1; cs <= ___T; cs++)
#define MP make_pair
#define PB push_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PII> VPII;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VPLL;
template <class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(LL &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template <class T, class... U> void R(T &head, U &...tail) {
_R(head);
R(tail...);
}
template <class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const LL &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template <class T, class U> void _W(const pair<T, U> &x) {
_W(x.F);
putchar(' ');
_W(x.S);
}
template <class T> void _W(const vector<T> &x) {
for (auto i = x.begin(); i != x.end(); _W(*i++))
if (i != x.cbegin())
putchar(' ');
}
void W() {}
template <class T, class... U> void W(const T &head, const U &...tail) {
_W(head);
putchar(sizeof...(tail) ? ' ' : '\n');
W(tail...);
}
#ifdef HOME
#define DEBUG(...) \
{ \
printf("# "); \
printf(__VA_ARGS__); \
puts(""); \
}
#else
#define DEBUG(...)
#endif
int MOD = 1e9 + 7;
void ADD(LL &x, LL v) {
x = (x + v) % MOD;
if (x < 0)
x += MOD;
}
/*}}}*/
const int SIZE = 1e6 + 10;
int main() {
int N, A, B;
R(N, A, B);
W(min(N * A, B));
return 0;
}
| [
"call.arguments.add",
"call.remove"
] | 784,197 | 784,198 | u284124505 | cpp |
p02981 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << max(a * n, 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;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 784,199 | 784,200 | u346214077 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a;
cin >> a;
int b;
cin >> b;
cout << n * min(a, b);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a;
cin >> a;
int b;
cin >> b;
cout << min(n * a, b);
} | [
"expression.operation.binary.remove"
] | 784,201 | 784,202 | u901813121 | 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';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b) << '\n';
return 0;
} | [
"expression.operation.binary.remove"
] | 784,205 | 784,206 | u551519692 | cpp |
p02981 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repe(i, n) for (int i = 0; i <= (n); ++i)
#define all(x) (x).begin(), (x).end()
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
const int INF = 1e9;
const ll mod = 1000000007;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, n * b) << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repe(i, n) for (int i = 0; i <= (n); ++i)
#define all(x) (x).begin(), (x).end()
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
const int INF = 1e9;
const ll mod = 1000000007;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b) << endl;
}
| [
"expression.operation.binary.remove"
] | 784,214 | 784,215 | u673981655 | cpp |
p02981 | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define hell1 1e9 + 7
#define hell2 1e9 + 9
#define pi 3.1415926535
#define ms(s, n) memset(s, n, sizeof(s))
#define prec(n) fixed << setprecision(n)
#define eps 0.000001
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define ll long long
#define ld long double
#define no_of_digits(n) floor(log10(n)) + 1
#define see(x) cout << (#x) << " is " << (x) << endl
#define INF 1e9
using namespace std;
ll mult(ll a, ll b, ll p = hell1) { return ((a % p) * (b % p)) % p; }
ll multbig(ll a, ll b, ll mod = hell1) {
if (a == 0 or b == 0)
return 0;
if (a == 1 or b == 1)
return (a * b) % mod;
ll cur = multbig(a, b / 2, mod);
cur = (2 * cur) % mod;
if (b % 2)
cur = (cur + a) % mod;
return cur;
}
ll add(ll a, ll b, ll p = hell1) {
if (a >= p)
a %= p;
if (b >= p)
b %= p;
if (a + b > p)
return (a + b) % p;
else
return a + b;
}
ll sub(ll a, ll b, ll p = hell1) { return (a % p - b % p + p) % p; }
ll fpow(ll n, ll k, ll p = hell1) {
ll r = 1;
for (; k; k >>= 1) {
if (k & 1)
r = mult(r, n, p);
n = mult(n, n, p);
}
return r;
}
ll inv(ll a, ll p = hell1) { return fpow(a, p - 2, p); }
ll inv_euclid(ll a, ll m = hell1) {
ll m0 = m;
ll y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1) {
ll q = a / m;
ll t = m;
m = a % m, a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0)
x += m0;
return x;
}
int isPowerof2(ll x) { return (x && !(x & x - 1)); }
ll log2(ll x) {
ll res = 0;
while (x >>= 1)
res++;
return res;
}
// max({a, b, c, d})
vector<ll> adj[200005];
ll update[200005];
ll ans[200005];
int binaryToDecimal(string n) {
string num = n;
int dec_value = 0;
// Initializing base value to 1, i.e 2^0
int base = 1;
int len = num.length();
for (int i = len - 1; i >= 0; i--) {
if (num[i] == '1')
dec_value += base;
base = base * 2;
}
return dec_value;
}
int main() {
ll n, a, b;
cin >> n >> a >> b;
cout << n * min(a, b) << "\n";
}
| #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define hell1 1e9 + 7
#define hell2 1e9 + 9
#define pi 3.1415926535
#define ms(s, n) memset(s, n, sizeof(s))
#define prec(n) fixed << setprecision(n)
#define eps 0.000001
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define ll long long
#define ld long double
#define no_of_digits(n) floor(log10(n)) + 1
#define see(x) cout << (#x) << " is " << (x) << endl
#define INF 1e9
using namespace std;
ll mult(ll a, ll b, ll p = hell1) { return ((a % p) * (b % p)) % p; }
ll multbig(ll a, ll b, ll mod = hell1) {
if (a == 0 or b == 0)
return 0;
if (a == 1 or b == 1)
return (a * b) % mod;
ll cur = multbig(a, b / 2, mod);
cur = (2 * cur) % mod;
if (b % 2)
cur = (cur + a) % mod;
return cur;
}
ll add(ll a, ll b, ll p = hell1) {
if (a >= p)
a %= p;
if (b >= p)
b %= p;
if (a + b > p)
return (a + b) % p;
else
return a + b;
}
ll sub(ll a, ll b, ll p = hell1) { return (a % p - b % p + p) % p; }
ll fpow(ll n, ll k, ll p = hell1) {
ll r = 1;
for (; k; k >>= 1) {
if (k & 1)
r = mult(r, n, p);
n = mult(n, n, p);
}
return r;
}
ll inv(ll a, ll p = hell1) { return fpow(a, p - 2, p); }
ll inv_euclid(ll a, ll m = hell1) {
ll m0 = m;
ll y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1) {
ll q = a / m;
ll t = m;
m = a % m, a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0)
x += m0;
return x;
}
int isPowerof2(ll x) { return (x && !(x & x - 1)); }
ll log2(ll x) {
ll res = 0;
while (x >>= 1)
res++;
return res;
}
// max({a, b, c, d})
vector<ll> adj[200005];
ll update[200005];
ll ans[200005];
int binaryToDecimal(string n) {
string num = n;
int dec_value = 0;
// Initializing base value to 1, i.e 2^0
int base = 1;
int len = num.length();
for (int i = len - 1; i >= 0; i--) {
if (num[i] == '1')
dec_value += base;
base = base * 2;
}
return dec_value;
}
int main() {
ll n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b) << "\n";
}
| [
"expression.operation.binary.remove"
] | 784,216 | 784,217 | u962241803 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
cout << (N * A, B) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
cout << min(N * A, B) << endl;
} | [
"call.add"
] | 784,220 | 784,221 | u624689667 | cpp |
p02981 | #include <bits/stdc++.h>
#include <cstring>
#include <queue>
#define mp make_pair
#define pb push_back
#define p push
#define FOR(a, c) for (int a = 0; a < c; a++)
#define ll long long int
#define getI(a) scanf("%d", &a)
#define getII(a, b) scanf("%d%d", &a, &b)
#define getIII(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define getL(a) scanf("%lld", &a)
#define getLL(a, b) scanf("%lld%lld", &a, &b)
#define getLLL(a, b, c) scanf("%lld%lld%lld", &a, &b, &c)
#define BEND(c) (c).begin(), (c).end()
#define BEND2(c) (c).rbegin(), (c).rend()
#define fi first
#define se second
#define pi 3.1415926535897932384626
#define getS(a) scanf("%s", a)
#define pfi(a) printf("%d", a);
#define pfii(a, b) printf("%d%d", a, b);
#define pfl(a) printf("%lld", a);
#define pfll(a, b) printf("%lld%lld", a, b);
#define pfd(a) printf("%lf", a);
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define sag (sol | 1)
#define sol (root << 1)
#define ort (bas + son) / 2
#define SIZE 1000000007
#define MAXN 100005
using namespace std;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<long long> vl;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<long long, long long>> vpl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vi> graph;
int main() {
IOS ll a, b, n;
cin >> a >> b >> n;
ll k = a * b;
if (k > n)
cout << k;
else
cout << n;
return 0;
}
| #include <bits/stdc++.h>
#include <cstring>
#include <queue>
#define mp make_pair
#define pb push_back
#define p push
#define FOR(a, c) for (int a = 0; a < c; a++)
#define ll long long int
#define getI(a) scanf("%d", &a)
#define getII(a, b) scanf("%d%d", &a, &b)
#define getIII(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define getL(a) scanf("%lld", &a)
#define getLL(a, b) scanf("%lld%lld", &a, &b)
#define getLLL(a, b, c) scanf("%lld%lld%lld", &a, &b, &c)
#define BEND(c) (c).begin(), (c).end()
#define BEND2(c) (c).rbegin(), (c).rend()
#define fi first
#define se second
#define pi 3.1415926535897932384626
#define getS(a) scanf("%s", a)
#define pfi(a) printf("%d", a);
#define pfii(a, b) printf("%d%d", a, b);
#define pfl(a) printf("%lld", a);
#define pfll(a, b) printf("%lld%lld", a, b);
#define pfd(a) printf("%lf", a);
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define sag (sol | 1)
#define sol (root << 1)
#define ort (bas + son) / 2
#define SIZE 1000000007
#define MAXN 100005
using namespace std;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<long long> vl;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<long long, long long>> vpl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vi> graph;
int main() {
IOS ll a, b, n;
cin >> a >> b >> n;
ll k = a * b;
if (k > n)
cout << n;
else
cout << k;
return 0;
}
| [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 784,222 | 784,223 | u198530799 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n;
cout << min(n * 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.add"
] | 784,224 | 784,225 | u180716041 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
cout << min({2 * 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;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 784,243 | 784,244 | u767995501 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.