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 =... | /*
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 =... | [
"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_b... | #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() {
... | [
"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;
co... | #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;
co... | [
"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) ... | #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) ... | [
"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); ... | #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); ... | [
"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 * ... | #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 * ... | [
"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<l... | #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<l... | [
"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> s... | #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> s... | [
"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... | #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... | [
"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 ?... | #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 ... | [
"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>, g... | #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>, g... | [] | 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<in... | #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<in... | [
"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;
//... | #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;
// ... | [
"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... | #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 <... | [
"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,... | #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,... | [
"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) ... | #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) ... | [
"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, l... | #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, l... | [
"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 ... | #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 ... | [
"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++... | #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++... | [
"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 = 99... | #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 = 99... | [
"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.... | #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.... | [
"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(), (... | #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(), (... | [
"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 ... | #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 ... | [
"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 ... | #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 ... | [
"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... | // 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... | [
"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 = vecto... | #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 = vecto... | [
"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 l... | #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 l... | [
"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;
... | #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;
... | [
"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_I... | #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_I... | [
"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... | #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... | [
"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 >>... | #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 >>... | [
"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;
retur... | /*
* 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;
retur... | [
"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 ... | /*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 ... | [
"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())
#defin... | /*{{{*/
#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())
#defin... | [
"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(... | #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(... | [
"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); ... | #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); ... | [
"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)
#de... | #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)
#de... | [
"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.