problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int ans = max(n * a, b);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int ans = min(n * a, b);
cout << ans << endl;
} | [
"misc.opposites",
"identifier.change",
"call.function.change"
] | 784,935 | 784,936 | u380922176 | cpp |
p02981 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main(void) {
int n, a, b;
scanf("%d%d%d", &n, &a, &b);
printf("%d\n", n * min(a, b));
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main(void) {
int n, a, b;
scanf("%d%d%d", &n, &a, &b);
printf("%d\n", min(n * a, b));
return 0;
}
| [
"expression.operation.binary.remove"
] | 784,947 | 784,948 | u769470336 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if (n * a >= b) {
cout << b << endl;
} else {
cout << a << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if (n * a >= b) {
cout << b << endl;
} else {
cout << n * a << endl;
}
} | [
"expression.operation.binary.add"
] | 784,953 | 784,954 | u098652914 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int res;
if (n * a > b) {
res = b;
} else {
res = n * a;
}
cout << a << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int res;
if (n * a > b) {
res = b;
} else {
res = n * a;
}
cout << res << endl;
}
| [
"identifier.change",
"io.output.change"
] | 784,960 | 784,961 | u099277178 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int res;
if (n * a > b) {
res = b;
} else {
res = a;
}
cout << a << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int res;
if (n * a > b) {
res = b;
} else {
res = n * a;
}
cout << res << endl;
}
| [
"assignment.change",
"identifier.change",
"io.output.change"
] | 784,962 | 784,961 | u099277178 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
cout << min(N * A, N * B) << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
cout << min(N * A, B) << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 784,963 | 784,964 | u005469124 | cpp |
p02981 | /*
*
* Author : Amit Kumar
* Date : June 12 2019
*
*/
#include <bits/stdc++.h>
#define FAST_INPUT_OUTPUT
//#define MORE_THAN_ONE_TESTCASE // COMMENT IT
#define vi vector<int>
#define vl vector<long long>
#define mii map<int, int>
#define mll map<long long, long long>
#define msi map<string, i>
#defi... | /*
*
* Author : Amit Kumar
* Date : June 12 2019
*
*/
#include <bits/stdc++.h>
#define FAST_INPUT_OUTPUT
//#define MORE_THAN_ONE_TESTCASE // COMMENT IT
#define vi vector<int>
#define vl vector<long long>
#define mii map<int, int>
#define mll map<long long, long long>
#define msi map<string, i>
#defi... | [
"expression.operation.binary.remove"
] | 784,974 | 784,975 | u896543512 | cpp |
p02981 | #include <cstdio>
#include <iomanip>
#include <iostream>
using namespace std;
int n, a, b;
int main() {
cin >> n >> a >> b;
int max1 = n * a;
int Max2 = n * b;
int ans = min(max1, Max2);
cout << ans << endl;
return 0;
} | #include <cstdio>
#include <iomanip>
#include <iostream>
using namespace std;
int n, a, b;
int main() {
cin >> n >> a >> b;
int max1 = n * a;
int Max2 = b;
int ans = min(max1, Max2);
cout << ans << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 784,982 | 784,983 | u516021252 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a;
int b;
cin >> n >> a >> b;
if (n * a >= b)
cout << b;
if (n * a < b)
cout << a * b;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a;
int b;
cin >> n >> a >> b;
if (n * a >= b)
cout << b;
if (n * a < b)
cout << a * n;
} | [
"identifier.change",
"io.output.change"
] | 784,988 | 784,989 | u616998927 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
int a;
int b;
cin >> n >> a >> b;
if (n * a >= b)
cout << b;
if (n * a < b)
cout << a * b;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a;
int b;
cin >> n >> a >> b;
if (n * a >= b)
cout << b;
if (n * a < b)
cout << a * n;
} | [
"identifier.change",
"io.output.change"
] | 784,990 | 784,989 | u616998927 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
template <class T> void ckmin(T &a, T b) { a = min(a, b); }
template <class T> void ckmax(T &a, T b) { a = max(a, b); }
#define pb push_back
#define mp make_pair
#define Red \
ios_base::sync_with_stdio(0);... | #include <bits/stdc++.h>
using namespace std;
template <class T> void ckmin(T &a, T b) { a = min(a, b); }
template <class T> void ckmax(T &a, T b) { a = max(a, b); }
#define pb push_back
#define mp make_pair
#define Red \
ios_base::sync_with_stdio(0);... | [
"expression.operation.binary.remove"
] | 784,999 | 785,000 | u235396011 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll i, j, k, n, m;
cin >> n >> i >> j;
cout << n * min(i, j) << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll i, j, k, n, m;
cin >> n >> i >> j;
cout << min(n * i, j) << "\n";
return 0;
}
| [
"expression.operation.binary.remove"
] | 785,012 | 785,013 | u038410216 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N;
cin >> A;
cin >> B;
if (N * A <= N * B) {
cout << N * A << endl;
} else if (N * A > N * B) {
cout << N * B << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N;
cin >> A;
cin >> B;
if (N * A <= B) {
cout << N * A << endl;
} else if (N * A > B) {
cout << B << endl;
}
} | [
"expression.operation.binary.remove"
] | 785,022 | 785,023 | u651879504 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
#define asll unsigned long long
#define pii pair<int, int>
#define st first
#define nd second
asll M = 1e9 + 7; // 20190518
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
srand(time(0)); // 20190709
int n, a, b;
cin >> n >> a >> b... | #include <bits/stdc++.h>
using namespace std;
#define asll unsigned long long
#define pii pair<int, int>
#define st first
#define nd second
asll M = 1e9 + 7; // 20190518
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
srand(time(0)); // 20190709
int n, a, b;
cin >> n >> a >> b... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 785,024 | 785,025 | u248547447 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int ans = max(n * a, b);
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int ans = min(n * a, b);
cout << ans << endl;
return 0;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change"
] | 785,035 | 785,036 | u646051775 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
// long long
using ll = long long;
//出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin() end()
#define all(x) (x... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
// long long
using ll = long long;
//出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin() end()
#define all(x) (x... | [
"call.arguments.change",
"call.arguments.add"
] | 785,041 | 785,042 | u832995587 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
// long long
using ll = long long;
//出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin() end()
#define all(x) (x... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
// long long
using ll = long long;
//出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin() end()
#define all(x) (x... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"call.arguments.add"
] | 785,043 | 785,042 | u832995587 | cpp |
p02981 | #include <bits/stdc++.h>
#define ll long long
#define endl '\n'
using namespace std;
const ll mod = (ll)1e9 + 7;
const ll INF = 0x3f3f3f3f;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
// freopen("A.txt", "r", stdin);
#endif
int a, b, n;
cin >> n >> a >> b;
cout << n * min(a, b... | #include <bits/stdc++.h>
#define ll long long
#define endl '\n'
using namespace std;
const ll mod = (ll)1e9 + 7;
const ll INF = 0x3f3f3f3f;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
// freopen("A.txt", "r", stdin);
#endif
int a, b, n;
cin >> n >> a >> b;
cout << min(n * a, b... | [
"expression.operation.binary.remove"
] | 785,044 | 785,045 | u990641118 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define watch(x) cout << "->" << #x << " : " << x << endl;
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
typedef long long ll;
typedef unsigned long long llu;
const double PI = 2 * acos(0.0);
signed main() {
// freopen(... | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define watch(x) cout << "->" << #x << " : " << x << endl;
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
typedef long long ll;
typedef unsigned long long llu;
const double PI = 2 * acos(0.0);
signed main() {
// freopen(... | [
"expression.operation.binary.remove"
] | 785,051 | 785,052 | u733246687 | cpp |
p02981 | #include <iostream>
using namespace std;
int main(void) {
int n, a, b;
cin >> n >> a >> b;
(n * a >= b) ? (cout << n * a) : (cout << b);
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
int n, a, b;
cin >> n >> a >> b;
(n * a >= b) ? (cout << b) : (cout << n * a);
return 0;
}
| [
"identifier.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 785,055 | 785,056 | u139018733 | cpp |
p02981 | #include <fstream>
#include <iostream>
using namespace std;
int main() {
ifstream fin("input.in");
ofstream fout("output.out");
int n, a, b;
fin >> n >> a >> b;
fout << min(n * a, b) << endl;
return 0;
}
| #include <fstream>
#include <iostream>
using namespace std;
int main() {
ifstream fin("input.in");
ofstream fout("output.out");
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b);
return 0;
}
| [
"identifier.change",
"expression.operation.binary.change",
"io.output.change",
"expression.operation.binary.remove"
] | 785,065 | 785,066 | u142188850 | cpp |
p02981 | #include <fstream>
#include <iostream>
using namespace std;
int main() {
ifstream fin("input.in");
ofstream fout("output.out");
int n, a, b;
fin >> n >> a >> b;
fout << min(n * a, b);
return 0;
}
| #include <fstream>
#include <iostream>
using namespace std;
int main() {
ifstream fin("input.in");
ofstream fout("output.out");
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b);
return 0;
}
| [
"identifier.change",
"expression.operation.binary.change",
"io.output.change"
] | 785,067 | 785,066 | u142188850 | cpp |
p02981 | /*
Vivek Rathi
CSE 2nd Year
MNNIT
*/
#include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define ll long long int
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define debug1(x) cout << #x << " " << x << endl;
#define debug2(x, y) cout << #x << " " << x << " ... | /*
Vivek Rathi
CSE 2nd Year
MNNIT
*/
#include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define ll long long int
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define debug1(x) cout << #x << " " << x << endl;
#define debug2(x, y) cout << #x << " " << x << " ... | [
"expression.operation.binary.remove"
] | 785,072 | 785,073 | u164414906 | cpp |
p02981 | #include <bits/stdc++.h>
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
#define mod 1000000007
#define fi first
#define se second
#define pii pair<int, int>
//#define push_back emplace_back
//#define push emplace
//#define insert emplace
#define int long l... | #include <bits/stdc++.h>
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
#define mod 1000000007
#define fi first
#define se second
#define pii pair<int, int>
//#define push_back emplace_back
//#define push emplace
//#define insert emplace
#define int long l... | [
"expression.operation.binary.remove"
] | 785,074 | 785,075 | u842263845 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << ((n * a > b) ? n * a : b) << endl;
} | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << ((n * a < b) ? n * a : b) << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 785,078 | 785,079 | u199427147 | cpp |
p02981 | #include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if (n * a < n * b)
cout << n * a;
else
cout << n * b;
return 0;
}
| #include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if (n * a < b)
cout << n * a;
else
cout << b;
return 0;
}
| [
"expression.operation.binary.remove"
] | 785,082 | 785,083 | u861337693 | cpp |
p02981 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#includ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#includ... | [
"call.add",
"io.output.change",
"call.arguments.change"
] | 785,084 | 785,085 | u519950235 | cpp |
p02981 | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl '\n'
#define rep(i, a, b... | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl '\n'
#define rep(i, a, b... | [
"expression.operation.binary.remove"
] | 785,102 | 785,103 | u757480088 | cpp |
p02981 | #include <stdio.h>
int main() {
int n, a, b;
scanf("%d", &n);
scanf("%d", &a);
scanf("%d", &b);
if (a * n >= b) {
printf("%d\n", a * n);
} else {
printf("%d\n", b);
}
return 0;
}
| #include <stdio.h>
int main() {
int n, a, b;
scanf("%d", &n);
scanf("%d", &a);
scanf("%d", &b);
if (a * n <= b) {
printf("%d\n", a * n);
} else {
printf("%d\n", b);
}
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 785,109 | 785,110 | u959863738 | cpp |
p02981 | #ifndef LOCAL
#pragma GCC optimize("O3")
#endif
#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) ... | #ifndef LOCAL
#pragma GCC optimize("O3")
#endif
#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) ... | [] | 785,115 | 785,116 | u101513772 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define ffor(i, a, b) for (int i = a; i < b; i++)
#define bfor(i, a, b) for (int i = a - 1; i >= b; i--)
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define mem(x, y) memset(x, y, sizeof(x))
#defi... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define ffor(i, a, b) for (int i = a; i < b; i++)
#define bfor(i, a, b) for (int i = a - 1; i >= b; i--)
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define mem(x, y) memset(x, y, sizeof(x))
#defi... | [
"expression.operation.binary.remove"
] | 785,128 | 785,129 | u059187806 | cpp |
p02981 | #include "bits/stdc++.h"
#define lpa(i, a, b) for (int i = a; i < b; ++i)
#define lp(i, n) lpa(i, 0, n)
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define print_v(v, n) \
lp(i, n) cout << v... | #include "bits/stdc++.h"
#define lpa(i, a, b) for (int i = a; i < b; ++i)
#define lp(i, n) lpa(i, 0, n)
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define print_v(v, n) \
lp(i, n) cout << v... | [
"expression.operation.binary.remove"
] | 785,135 | 785,136 | u603461744 | cpp |
p02981 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define MAX(a, b) (a > b ? a : b)
#define MIN(a, b) (a... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define MAX(a, b) (a > b ? a : b)
#define MIN(a, b) (a... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 785,137 | 785,138 | u507795624 | cpp |
p02981 | #include <stdio.h>
int main() {
int N, A, B;
scanf("%d %d %d", &N, &A, &B);
if (A > B) {
printf("%d", B * N);
} else
(printf("%d", A * N));
return 0;
} | #include <stdio.h>
int main() {
int N, A, B;
scanf("%d %d %d", &N, &A, &B);
if (N * A > B) {
printf("%d", B);
} else
(printf("%d", A * N));
return 0;
} | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 785,143 | 785,144 | u960754554 | cpp |
p02981 | #include <stdio.h>
int main() {
int N, A, B;
scanf("%d %d", &N, &A, &B);
int Train = N * A;
if (Train < B) {
printf("%d", Train);
} else {
printf("%d", B);
}
return 0;
}
| #include <stdio.h>
int main() {
int N, A, B;
scanf("%d %d %d", &N, &A, &B);
int Train = N * A;
if (Train < B) {
printf("%d", Train);
} else {
printf("%d", B);
}
return 0;
}
| [
"literal.string.change",
"call.arguments.change"
] | 785,149 | 785,150 | u715928544 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int n, a, b;
#ifdef true
cin >> n >> a >> b;
#else
n = 4;
a = 2;
b = 7;
n = 20;
a = 50;
b = 50;
#endif
int train = n * a;
int taxi = b;
cout << (train > taxi ? taxi : train) << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, a, b;
#if true
cin >> n >> a >> b;
#else
n = 4;
a = 2;
b = 7;
n = 20;
a = 50;
b = 50;
#endif
int train = n * a;
int taxi = b;
cout << (train > taxi ? taxi : train) << endl;
return 0;
} | [] | 785,168 | 785,169 | u273446375 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int x = n * a;
(x > b) ? cout << (n * a) << endl : cout << b << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int x = n * a;
(x < b) ? cout << x << endl : cout << b << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 785,176 | 785,177 | u447706255 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << n * min(a, b) << "\n";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b) << "\n";
} | [
"expression.operation.binary.remove"
] | 785,182 | 785,183 | u599197778 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << (min(a, b) * n);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << (min(a * n, b));
return 0;
}
| [
"expression.operation.binary.remove"
] | 785,192 | 785,193 | u989928804 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << n * min(a, b) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b) << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 785,204 | 785,205 | u404173371 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if (a > b)
cout << n * b << endl;
else
cout << n * a << endl;
}
| #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if ((n * a) > b)
cout << b << endl;
else
cout << n * a << endl;
}
| [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 785,208 | 785,209 | u453725440 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, n;
cin >> n >> a >> b;
cout << min(a, b) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, n;
cin >> n >> a >> b;
cout << min(n * a, b) << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 785,212 | 785,213 | u020799651 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, n;
cin >> n >> a >> b;
cout << min(n * a, n * b) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, n;
cin >> n >> a >> b;
cout << min(n * a, b) << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 785,214 | 785,213 | u020799651 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if (n * a > b)
cout << n * a;
else
cout << b;
return (0);
} | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if (n * a < b)
cout << n * a;
else
cout << b;
return (0);
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 785,219 | 785,220 | u624463308 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mem(dp, a) memset(dp, a, sizeof dp)
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define repb(i, a, b) for (ll i = a; i >= b; i--)
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
#define tr(c, it) for (auto const &it : c)
#defin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mem(dp, a) memset(dp, a, sizeof dp)
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define repb(i, a, b) for (ll i = a; i >= b; i--)
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
#define tr(c, it) for (auto const &it : c)
#defin... | [
"expression.operation.binary.remove"
] | 785,221 | 785,222 | u258080819 | cpp |
p02981 | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int n, a, b;
int min(int x, int y) { return x < y ? x : y; }
int main() {
scanf("%d%d%d", &n, &a, &b);
printf("%d\n", n * min(a, b));
return 0;
} | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int n, a, b;
int min(int x, int y) { return x < y ? x : y; }
int main() {
scanf("%d%d%d", &n, &a, &b);
printf("%d\n", min(n * a, b));
return 0;
} | [
"expression.operation.binary.remove"
] | 785,225 | 785,226 | u041194459 | cpp |
p02981 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int i, j;
int n, a, b;
cin >> n >> a >> b;
cout << n * min(a, b) << endl;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int i, j;
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b) << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 785,231 | 785,232 | u006421797 | cpp |
p02981 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define sz(a) static_cast<int>((a).size())
#define f first
#define s second
#define els(v) for (auto &el :... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define sz(a) static_cast<int>((a).size())
#define f first
#define s second
#define els(v) for (auto &el :... | [
"expression.operation.binary.remove"
] | 785,237 | 785,238 | u615833720 | cpp |
p02981 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chma... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chma... | [
"expression.operation.binary.remove"
] | 785,241 | 785,242 | u170650966 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, n, x = 1;
cin >> n >> a >> b;
x = n * a;
if (x > b) {
cout << x << endl;
} else {
cout << b;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, n, x = 1;
cin >> n >> a >> b;
x = n * a;
if (x < b) {
cout << x << endl;
} else {
cout << b << endl;
}
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"io.output.newline.add"
] | 785,243 | 785,244 | u166706609 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define UN unsigned
#define ll long long
int main(void) {
int n, a, b;
cin >> n >> a >> b;
cout << n * min(a, b);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define UN unsigned
#define ll long long
int main(void) {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b);
return 0;
} | [
"expression.operation.binary.remove"
] | 785,245 | 785,246 | u166272617 | cpp |
p02981 | // Littleboy123 Template 1.0
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef long long int ll;
typedef unsigned long long int ull;
#define FOR(a, b, c) for (ll(a) = (b); (a) < (c); ++(a))
#define FORE(a, b, c) for (ll(a) = (b); (a) <= (... | // Littleboy123 Template 1.0
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef long long int ll;
typedef unsigned long long int ull;
#define FOR(a, b, c) for (ll(a) = (b); (a) < (c); ++(a))
#define FORE(a, b, c) for (ll(a) = (b); (a) <= (... | [
"expression.operation.binary.remove"
] | 785,257 | 785,258 | u398659810 | cpp |
p02981 | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define swap(a, b) (a += b, b = a - b, a -= b)
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
cout << min(A, B) * N << endl;
}
| #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define swap(a, b) (a += b, b = a - b, a -= b)
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
cout << min(B, A * N) << endl;
}
| [
"call.arguments.change",
"io.output.change"
] | 785,259 | 785,260 | u466393447 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, t1, t2;
cin >> n >> a >> b;
t1 = n * a;
t2 = b;
if (t1 < t2)
cout << t1 << endl;
else if (t1 > t2)
cout << t2 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, t1, t2;
cin >> n >> a >> b;
t1 = n * a;
t2 = b;
if (t1 <= t2)
cout << t1 << endl;
else if (t1 >= t2)
cout << t2 << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 785,271 | 785,272 | u346889931 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, t1, t2;
cin >> n >> a >> b;
t1 = n * a;
t2 = n * b;
if (t1 < t2)
cout << t1 << endl;
else if (t1 > t2)
cout << t2 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, t1, t2;
cin >> n >> a >> b;
t1 = n * a;
t2 = b;
if (t1 <= t2)
cout << t1 << endl;
else if (t1 >= t2)
cout << t2 << endl;
return 0;
}
| [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 785,273 | 785,272 | u346889931 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (A > B)
cout << B * N << endl;
else
cout << A * N << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (A * N > B)
cout << B << endl;
else
cout << A * N << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 785,276 | 785,277 | u777474133 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (A > B) {
cout << N * B;
} else {
cout << N * A;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if ((N * A) > B) {
cout << B;
} else {
cout << N * A;
}
return 0;
}
| [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 785,281 | 785,282 | u612908015 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (A > B) {
cout << N * B << endl;
}
else {
cout << A * N << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (A * N > B) {
cout << B << endl;
}
else {
cout << A * N << endl;
}
}
| [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 785,283 | 785,284 | u729695898 | cpp |
p02981 | #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
typedef pair<long long, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#def... | #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
typedef pair<long long, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#def... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 785,294 | 785,295 | u069521477 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int a, b, n;
cin >> n >> a >> b;
cout << ((n * a) < b) ? (n * a) : b;
} | #include <iostream>
using namespace std;
int main() {
int a, b, n;
cin >> n >> a >> b;
cout << (((n * a) < b) ? (n * a) : b) << endl;
}
| [
"io.output.change"
] | 785,296 | 785,297 | u003243933 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int gcdEx(int a, int b, int *x, int *y) {
if (!a) {
*x = 0;
*y = 1;
return b;
}
int x1, y1, gcd = gcdEx(b % a, a, &x1, &y1);
*x = y1 - (b / a) * x1;
*y = x1;
return gcd;
}
int modI(int b, int m) {
int x, y;
gcdEx(b, m, &x, &y);
return (x % m + ... | #include <bits/stdc++.h>
using namespace std;
int gcdEx(int a, int b, int *x, int *y) {
if (!a) {
*x = 0;
*y = 1;
return b;
}
int x1, y1, gcd = gcdEx(b % a, a, &x1, &y1);
*x = y1 - (b / a) * x1;
*y = x1;
return gcd;
}
int modI(int b, int m) {
int x, y;
gcdEx(b, m, &x, &y);
return (x % m + ... | [
"expression.operation.binary.remove",
"assignment.change"
] | 785,298 | 785,299 | u755134895 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, a, b;
cin >> n >> a >> b;
long mi = min(n * a, n * b);
cout << mi << endl;
// your code goes here
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, a, b;
cin >> n >> a >> b;
long mi = min(n * a, b);
cout << mi << endl;
// your code goes here
return 0;
} | [
"expression.operation.binary.remove"
] | 785,302 | 785,303 | u449675403 | cpp |
p02981 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <ve... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <ve... | [
"expression.operation.binary.remove"
] | 785,312 | 785,313 | u965118468 | cpp |
p02981 | #define LOCAL
#include "bits/stdc++.h"
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define LLINF ((long long)1e18) // 1234567890987654321
#define INF 1234567890ll
#def... | #define LOCAL
#include "bits/stdc++.h"
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define LLINF ((long long)1e18) // 1234567890987654321
#define INF 1234567890ll
#def... | [
"identifier.change",
"expression.operation.binary.change"
] | 785,314 | 785,315 | u844961982 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a * b >= a * c) {
cout << a * c;
} else {
cout << a * b;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a * b >= c) {
cout << c;
} else {
cout << a * b;
}
} | [
"expression.operation.binary.remove"
] | 785,328 | 785,329 | u308549429 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a * b >= b * c) {
cout << b * c;
} else {
cout << a * b;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a * b >= c) {
cout << c;
} else {
cout << a * b;
}
} | [
"expression.operation.binary.remove"
] | 785,330 | 785,329 | u308549429 | cpp |
p02981 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n, a, b;
cin >> n >> a >> b;
if (n * a < b)
cout << a << endl;
else
cout << b << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int n, a, b;
cin >> n >> a >> b;
if (n * a < b)
cout << a * n << endl;
else
cout << b << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 785,340 | 785,341 | u771184600 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int train = n * a;
if (train < b) {
cout << train << endl;
return 0;
}
if (train > b) {
cout << b << endl;
return 0;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int train = n * a;
if (train < b) {
cout << train << endl;
return 0;
}
if (train >= b) {
cout << b << endl;
return 0;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 785,348 | 785,349 | u948618130 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int n, a, b;
int main() {
scanf("%d", &n, &a, &b);
printf("%d", min(n * a, b));
}
| #include <bits/stdc++.h>
using namespace std;
int n, a, b;
int main() {
scanf("%d %d %d", &n, &a, &b);
printf("%d", min(n * a, b));
}
| [
"literal.string.change",
"call.arguments.change"
] | 785,350 | 785,351 | u076783581 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
//#include <vector>
typedef long long ll;
// vector <ll > v[100];
// ll b1[10005][1];
int main() {
int n, a, b;
cin >> n >> a >> b;
if (n * a <= n)
cout << a * n << endl;
else
cout << b << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
//#include <vector>
typedef long long ll;
// vector <ll > v[100];
// ll b1[10005][1];
int main() {
int n, a, b;
cin >> n >> a >> b;
if (n * a < b)
cout << a * n << endl;
else
cout << b << endl;
return 0;
}
| [] | 785,358 | 785,359 | u640918351 | cpp |
p02981 | #define REP(i, t, n) for (int i = t; i < n; i++)
#define ALL(n) (n).begin(), (n).end()
#include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <stdio.h>
#include... | #define REP(i, t, n) for (int i = t; i < n; i++)
#define ALL(n) (n).begin(), (n).end()
#include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <stdio.h>
#include... | [
"expression.operation.binary.remove"
] | 785,363 | 785,364 | u717315282 | cpp |
p02981 | #include <bits/stdc++.h>
#define mod 1000000007
#define pb push_back
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n, a, b;
cin >> n >> a >> b;
if (8 * n < b)
cout << n * a;
else
cout << b;
cout << endl;
return 0;
} | #include <bits/stdc++.h>
#define mod 1000000007
#define pb push_back
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n, a, b;
cin >> n >> a >> b;
if (a * n < b)
cout << n * a;
else
cout << b;
cout << endl;
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 785,371 | 785,372 | u621632422 | cpp |
p02981 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, a, b;
cin >> n >> a >... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, a, b;
cin >> n >> a >... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 785,390 | 785,391 | u021877732 | cpp |
p02981 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, a, b;
cin >> n >> a >... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, a, b;
cin >> n >> a >... | [
"io.output.change"
] | 785,392 | 785,391 | u021877732 | cpp |
p02981 | #include <cmath>
#include <fstream>
#include <iostream>
#include <iterator>
#include <sstream>
#include <string>
using namespace std;
int main() {
int N;
int A;
int B;
cin >> N >> A >> B;
cout << max(N * A, B) << endl;
return 0;
} | #include <cmath>
#include <fstream>
#include <iostream>
#include <iterator>
#include <sstream>
#include <string>
using namespace std;
int main() {
int N;
int A;
int B;
cin >> N >> A >> B;
cout << min(N * A, B) << endl;
return 0;
} | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 785,393 | 785,394 | u983681697 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (A >= B) {
cout << N * B << endl;
} else {
cout << N * A << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (N * A >= B) {
cout << B << endl;
} else {
cout << N * A << endl;
}
}
| [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 785,395 | 785,396 | u665871498 | cpp |
p02981 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a * b >= c) {
cout << a * b << endl;
} else
cout << c << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a * b <= c) {
cout << a * b << endl;
} else
cout << c << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 785,397 | 785,398 | u743473047 | cpp |
p02981 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a * b > c) {
cout << a * b << endl;
} else
cout << c << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a * b <= c) {
cout << a * b << endl;
} else
cout << c << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 785,399 | 785,398 | u743473047 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int n, a, b;
int main() {
cin >> n >> a >> b;
cout << n * min(a, b) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int n, a, b;
int main() {
cin >> n >> a >> b;
cout << min(n * a, b) << endl;
} | [
"expression.operation.binary.remove"
] | 785,402 | 785,403 | u775439650 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define ll long long
#define ld long double
int main() {
IOS;
int n, a, b;
cin >> n >> a >> b;
if ((n * a) < (n * b)) {
cout << n * a;
} else {
cout << n * b;
}
cout << "\n";
return ... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define ll long long
#define ld long double
int main() {
IOS;
int n, a, b;
cin >> n >> a >> b;
if ((n * a) < b) {
cout << n * a;
} else {
cout << b;
}
cout << "\n";
return 0;
} | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 785,404 | 785,405 | u056520266 | cpp |
p02981 | // chandigarh university
// shivamkr21
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if ((n * a) > b) {
cout << n * a << endl;
} else {
cout << b << endl;
}
return 0;
}
| // chandigarh university
// shivamkr21
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if ((n * a) < b) {
cout << n * a << endl;
} else {
cout << b << endl;
}
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 785,406 | 785,407 | u036604649 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, n * b);
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b);
} | [
"expression.operation.binary.remove"
] | 785,410 | 785,411 | u506112954 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
long long n, a, b;
cin >> n >> a >> b;
if (a < b)
cout << n * a;
else
cout << b;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
long long n, a, b;
cin >> n >> a >> b;
if (n * a < b)
cout << n * a;
else
cout << b;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 785,418 | 785,419 | u731992934 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
inline int read() {
int x(0);
char ch('@');
bool flag(false);
for (; !isdigit(ch); ch = getchar())
flag |= (ch == '-');
for (; isdigit(ch); ch = getchar())
x = (x << 3) + (x << 1) + (ch ^ 48);
return flag ? -x : x;
}
int a, b, n;
int main() {
n = r... | #include <bits/stdc++.h>
using namespace std;
inline int read() {
int x(0);
char ch('@');
bool flag(false);
for (; !isdigit(ch); ch = getchar())
flag |= (ch == '-');
for (; isdigit(ch); ch = getchar())
x = (x << 3) + (x << 1) + (ch ^ 48);
return flag ? -x : x;
}
int a, b, n;
int main() {
n = r... | [
"expression.operation.binary.remove"
] | 785,421 | 785,422 | u242638642 | cpp |
p02981 | // in the name of Allah
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define ll long long
#define double long double
#define sz(x) ((int)(x.size()))
#define fr first
#define se second
const ll mod = 1000000007;
inline ll add(ll a, ll b) {
a += b;
if (a >= mod)
return... | // in the name of Allah
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define ll long long
#define double long double
#define sz(x) ((int)(x.size()))
#define fr first
#define se second
const ll mod = 1000000007;
inline ll add(ll a, ll b) {
a += b;
if (a >= mod)
return... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 785,427 | 785,428 | u812771098 | cpp |
p02981 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (N * A < B)
cout << N * A << endl;
else
cout << A << endl;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (N * A < B)
cout << N * A << endl;
else
cout << B << endl;
} | [
"identifier.change",
"io.output.change"
] | 785,438 | 785,439 | u552004736 | cpp |
p02981 | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 785,440 | 785,441 | u894411949 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int BIG = 1e9 + 555;
int n, a, b;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> a >> b;
cout << min(n * a, n * b) << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int BIG = 1e9 + 555;
int n, a, b;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> a >> b;
cout << min(n * a, b) << '\n';
return 0;
} | [
"expression.operation.binary.remove"
] | 785,444 | 785,445 | u482794458 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef map<int, int> MII;
typedef priority_queue<int> P_QI;
typedef priority_queue<string> P_QS;
typedef vector<int> VI;
typedef vector<long long> VLL;
typedef vecto... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef map<int, int> MII;
typedef priority_queue<int> P_QI;
typedef priority_queue<string> P_QS;
typedef vector<int> VI;
typedef vector<long long> VLL;
typedef vecto... | [
"expression.operation.binary.remove"
] | 785,446 | 785,447 | u934685914 | cpp |
p02981 | #include <bits/stdc++.h>
#define MAX 100005
using namespace std;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n, a, b;
cin >> n >> a >> b;
cout << (min(a, b) * n) << endl;
return 0;
}
| #include <bits/stdc++.h>
#define MAX 100005
using namespace std;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n, a, b;
cin >> n >> a >> b;
cout << min(a * n, b) << endl;
return 0;
}
| [
"call.arguments.change",
"call.arguments.add"
] | 785,454 | 785,455 | u066910956 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << min(a * 2, b) << endl;
} | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a * n, b) << endl;
} | [
"variable_declaration.add",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 785,458 | 785,459 | u230078189 | cpp |
p02981 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <memory>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
int64_t n, a, b;
cin >> n >> a >> b;
if (a > b) ... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <memory>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
int64_t n, a, b;
cin >> n >> a >> b;
if (n * a >... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 785,461 | 785,462 | u729166490 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
cout << min(N * A, N * B) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
cout << min(N * A, B) << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 785,463 | 785,464 | u293072892 | cpp |
p02981 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << n * min(a, b) << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a * n, b) << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 785,469 | 785,470 | u017881341 | cpp |
p02981 | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int n, a, b;
int main() {
scanf("%d%d%d", &n, &a, &b);
printf("%d", n * min(a, b));
} | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int n, a, b;
int main() {
scanf("%d%d%d", &n, &a, &b);
printf("%d", min(n * a, b));
} | [
"expression.operation.binary.remove"
] | 785,471 | 785,472 | u492148983 | cpp |
p02981 | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#define _ << " " <<
#define all(v) v.begin(), v.end()
#define sp(n) fixed << setprecision(n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const int mod = 1e9 + 7;
int main() {
ios::sync_with_stdio(0);
c... | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#define _ << " " <<
#define all(v) v.begin(), v.end()
#define sp(n) fixed << setprecision(n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const int mod = 1e9 + 7;
int main() {
ios::sync_with_stdio(0);
c... | [
"expression.operation.binary.remove"
] | 785,473 | 785,474 | u866482228 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
namespace fastIO {
#define BUF_SIZE 100000
#define OUT_SIZE 100000
// fread->read
bool IOerror = 0;
// inline char nc(){char ch=getchar();if(ch==-1)IOerror=1;return ch;}
inline char nc() {
static char buf[BUF_SIZE], *p1 = buf + BUF_SIZE, *pend = buf + BUF_SIZE;
if (p1 ... | #include <bits/stdc++.h>
using namespace std;
namespace fastIO {
#define BUF_SIZE 100000
#define OUT_SIZE 100000
// fread->read
bool IOerror = 0;
// inline char nc(){char ch=getchar();if(ch==-1)IOerror=1;return ch;}
inline char nc() {
static char buf[BUF_SIZE], *p1 = buf + BUF_SIZE, *pend = buf + BUF_SIZE;
if (p1 ... | [
"control_flow.loop.condition.change",
"call.arguments.add"
] | 785,477 | 785,478 | u709755864 | cpp |
p02981 | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int a, b, c;
cin >> a >> b >> c;
if (b * 2 <= c) {
cout << b * a;
} else {
cout << c;
}
}
| #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int a, b, c;
cin >> a >> b >> c;
if (b * a <= c) {
cout << b * a;
} else {
cout << c;
}
}
| [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 785,479 | 785,480 | u467848771 | cpp |
p02981 | #include <bits/stdc++.h>
#include <fstream>
#define vi vector<int>
#define vii vector<vi>
#define ll long long
#define vl vector<ll>
#define vll vector<vl>
#define rep(i, a, b) for (long long i = (a); i < (b); i++)
#define per(i, a, b) for (long long i = (a); i > (b); i--)
#define pb push_back
#define sz(v) (int)v.size... | #include <bits/stdc++.h>
#include <fstream>
#define vi vector<int>
#define vii vector<vi>
#define ll long long
#define vl vector<ll>
#define vll vector<vl>
#define rep(i, a, b) for (long long i = (a); i < (b); i++)
#define per(i, a, b) for (long long i = (a); i > (b); i--)
#define pb push_back
#define sz(v) (int)v.size... | [
"expression.operation.binary.remove"
] | 785,481 | 785,482 | u054759548 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int n, a, b;
int main() {
cin >> n >> a >> b;
cout << min(a, b) * n;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n, a, b;
int main() {
cin >> n >> a >> b;
cout << min(a * n, b);
return 0;
} | [
"expression.operation.binary.remove"
] | 785,483 | 785,484 | u211255798 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.