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 <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main(void) {
int a, b, n;
cin >> a >> b >> n;
if (a * n < b)
cout << a * n;
else
cout << b;
}
| #include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main(void) {
int a, b, n;
cin >> n >> a >> b;
if (a * n < b)
cout << a * n;
else
cout << b;
}
| [
"expression.operation.binary.remove"
] | 785,485 | 785,486 | u014852120 | cpp |
p02981 | // --------------------<optimizations>--------------------
#pragma GCC optimize("O3")
//(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)\
#pragma comment(linker, "/stack:200000000")
//(UNCOMMENT WHEN TRYING TO BRUTEFORCE WITH A LOT OF LOOPS)\
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;... | // --------------------<optimizations>--------------------
#pragma GCC optimize("O3")
//(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)\
#pragma comment(linker, "/stack:200000000")
//(UNCOMMENT WHEN TRYING TO BRUTEFORCE WITH A LOT OF LOOPS)\
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;... | [
"expression.operation.binary.remove"
] | 785,490 | 785,491 | u394634573 | 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 << n * a << endl;
else
cout << b << endl;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 785,497 | 785,498 | u943355851 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c;
cin >> n >> a >> b;
c = n * a;
if (c > b)
cout << c << endl;
if (c <= b)
cout << b << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c;
cin >> n >> a >> b;
c = n * a;
if (c > b)
cout << b << endl;
if (c <= b)
cout << c << endl;
return 0;
} | [
"identifier.change",
"io.output.change"
] | 785,501 | 785,502 | u389216879 | cpp |
p02981 | // -D_GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define pi 3.1415926535
#define print(arr, n) \
for (int i = 0; i < n; i++) \
cout << arr[i] << " "; \
cout <... | // -D_GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define pi 3.1415926535
#define print(arr, n) \
for (int i = 0; i < n; i++) \
cout << arr[i] << " "; \
cout <... | [
"call.add",
"call.arguments.change"
] | 785,508 | 785,509 | u724418357 | cpp |
p02981 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = int64_t;
/// <summar... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = int64_t;
/// <summar... | [
"call.arguments.change",
"expression.operator.arithmetic.change",
"io.output.change"
] | 785,510 | 785,511 | u976560086 | cpp |
p02981 | #include <iostream>
int main(void) {
int n, a, b;
std::cin >> n;
std::cin >> a;
std::cin >> b;
if (a < (b / n)) {
std::cout << a * n;
} else {
std::cout << b;
}
return 0;
} | #include <iostream>
int main(void) {
int n, a, b;
std::cin >> n;
std::cin >> a;
std::cin >> b;
if (a * n < b) {
std::cout << a * n;
} else {
std::cout << b;
}
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 785,515 | 785,516 | u617779302 | cpp |
p02981 | #include <bits/stdc++.h>
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define RREP(i, a, b) for (int i = (int)(a); i >= (int)(b); i--)
#define ALL(v) v.begin(), v.end()
#define INF 2e9
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
... | #include <bits/stdc++.h>
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define RREP(i, a, b) for (int i = (int)(a); i >= (int)(b); i--)
#define ALL(v) v.begin(), v.end()
#define INF 2e9
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 785,520 | 785,521 | u245487028 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, init, n) for (lli i = init; i < n; i++)
#define REPE(i, init, n) for (lli i = init; i <= n; i++)
#define REPIT(it, container) \
for (auto it = container.begin(); it != container.end(); it++)
#define REPIT_R... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, init, n) for (lli i = init; i < n; i++)
#define REPE(i, init, n) for (lli i = init; i <= n; i++)
#define REPIT(it, container) \
for (auto it = container.begin(); it != container.end(); it++)
#define REPIT_R... | [
"expression.operation.binary.remove"
] | 785,526 | 785,527 | u058297300 | cpp |
p02981 | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << a * n + b << endl;
} | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(a * n, b) << endl;
} | [
"call.add",
"io.output.change",
"call.arguments.change"
] | 785,530 | 785,531 | u672995180 | cpp |
p02981 | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = (a); i <= (b); i++)
#define END(x) \
do { \
cout << (x) << endl; ... | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = (a); i <= (b); i++)
#define END(x) \
do { \
cout << (x) << endl; ... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 785,544 | 785,545 | u993688697 | 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 if (N * A > B) {
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 << N * A << endl;
} else if (N * A >= B) {
cout << B << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 785,548 | 785,549 | u559112776 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
// Your code here!
int a, b, c;
cin >> a >> b >> c;
if (a * b < c) {
cout << a * b << endl;
} else if (a * b > c) {
cout << c << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
// Your code here!
int a, b, c;
cin >> a >> b >> c;
if (a * b <= c) {
cout << a * b << endl;
} else if (a * b > c) {
cout << c << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 785,550 | 785,551 | u821165477 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
// Your code here!
int a, b, c;
cin >> a >> b >> c;
if (a * b < c) {
cout << b << endl;
} else if (a * b > c) {
cout << c << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
// Your code here!
int a, b, c;
cin >> a >> b >> c;
if (a * b <= c) {
cout << a * b << endl;
} else if (a * b > c) {
cout << c << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 785,552 | 785,551 | u821165477 | cpp |
p02981 | #include <bits/stdc++.h>
#pragma GCC optimize("O999")
using namespace std;
int main() {
ios::sync_with_stdio(0);
int a, b, n;
cin >> n >> a >> b;
cout << n * min(a, b);
return 0;
}
| #include <bits/stdc++.h>
#pragma GCC optimize("O999")
using namespace std;
int main() {
ios::sync_with_stdio(0);
int a, b, n;
cin >> n >> a >> b;
cout << min(n * a, b);
return 0;
}
| [
"expression.operation.binary.remove"
] | 785,561 | 785,562 | u340127670 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, a, b;
cin >> n >> a >> b;
if (n * a < n * b)
cout << n * a;
else
cout << n * b;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, a, b;
cin >> n >> a >> b;
if (n * a < b)
cout << n * a;
else
cout << b;
} | [
"expression.operation.binary.remove"
] | 785,568 | 785,569 | u269192587 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, A, B;
scanf("%d%d", &n, &A, &B);
printf("%d\n", min(n * A, B));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, A, B;
scanf("%d%d%d", &n, &A, &B);
printf("%d\n", min(n * A, B));
return 0;
} | [
"literal.string.change",
"call.arguments.change"
] | 785,570 | 785,571 | u613623257 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, t;
cin >> a >> b >> c;
t = a * b;
if (t > c)
cout << c << "\n";
else if (t < c) {
cout << t << "\n";
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, t;
cin >> a >> b >> c;
t = a * b;
if (t > c)
cout << c << "\n";
else if (t <= c) {
cout << t << "\n";
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 785,578 | 785,579 | u250610025 | cpp |
p02981 | #include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define dofloat cout << fixed << setprecision(8)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define bitcount __builtin_popcount
#define all(vec) vec.begin(), vec.end()
#define rall(vec) vec.rbeg... | #include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define dofloat cout << fixed << setprecision(8)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define bitcount __builtin_popcount
#define all(vec) vec.begin(), vec.end()
#define rall(vec) vec.rbeg... | [
"expression.operation.binary.remove"
] | 785,580 | 785,581 | u091650402 | cpp |
p02981 |
#include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <vector>
#define ll long long
#define rep2(i, a, b) for (int i = a; i <= b; i++)
#define rep(i, n) for (int i = 0; i < n; i+... |
#include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <vector>
#define ll long long
#define rep2(i, a, b) for (int i = a; i <= b; i++)
#define rep(i, n) for (int i = 0; i < n; i+... | [
"call.arguments.change",
"call.arguments.add"
] | 785,582 | 785,583 | u434662823 | cpp |
p02981 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if (n * b > a) {
cout << a << endl;
} else
cout << n * b << endl;
return 0;
} | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if (n * a > b) {
cout << b << endl;
} else
cout << n * a << endl;
return 0;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"identifier.change",
"io.output.change"
] | 785,586 | 785,587 | u325768739 | cpp |
p02981 | #include <bits/stdc++.h>
// #include"testlib.h"
using namespace std;
#define ll long long
#define X first
#define Y second
#define all(x) x.begin(), x.end()
const int MX = (int)5e5 + 10;
const int mod = 998244353;
int main(int argc, char *argv[]) {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
//... | #include <bits/stdc++.h>
// #include"testlib.h"
using namespace std;
#define ll long long
#define X first
#define Y second
#define all(x) x.begin(), x.end()
const int MX = (int)5e5 + 10;
const int mod = 998244353;
int main(int argc, char *argv[]) {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
//... | [
"expression.operation.binary.remove"
] | 785,588 | 785,589 | u770383516 | cpp |
p02981 | #include <algorithm>
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#define ll long long int
#define cases \
int t; \
cin >> t; ... | #include <algorithm>
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#define ll long long int
#define cases \
int t; \
cin >> t; ... | [
"expression.operation.binary.add"
] | 785,592 | 785,593 | u023461939 | cpp |
p02981 | #include <bits/stdc++.h>
#include <numeric>
#define REP(i, s, n) for (int i = s; i < n; ++i)
#define rep(i, n) REP(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#define SORT_INV(c) sort((c).begin(), (c).end(), greater<int>())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG true
#define LL long long... | #include <bits/stdc++.h>
#include <numeric>
#define REP(i, s, n) for (int i = s; i < n; ++i)
#define rep(i, n) REP(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#define SORT_INV(c) sort((c).begin(), (c).end(), greater<int>())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG true
#define LL long long... | [
"expression.operation.binary.remove"
] | 785,594 | 785,595 | u393086221 | cpp |
p02981 | //#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,avx2")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <iostream>
#include <map>
#include <random>
#include <set>
#include <stdio.h>
#include <time.h>
#include <unordered_... | //#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,avx2")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <iostream>
#include <map>
#include <random>
#include <set>
#include <stdio.h>
#include <time.h>
#include <unordered_... | [
"expression.operation.binary.remove"
] | 785,600 | 785,601 | u485550995 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
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() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b) << '\n';
return 0;
} | [
"expression.operation.binary.remove"
] | 785,604 | 785,605 | u941934550 | cpp |
p02981 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
template <class T>
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
ll gcd(ll a, ll b) {
if (a % b == 0)
ret... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
template <class T>
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
ll gcd(ll a, ll b) {
if (a % b == 0)
ret... | [
"call.add",
"io.output.change",
"call.arguments.change"
] | 785,616 | 785,617 | u944316525 | cpp |
p02981 | //#include<bits/stdc++.h> // 全てのヘッダーファイルをinclude
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility> // wrap,pair
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR (i, n) for (int i = n; i > 0; i--)
#define FOR(i, m, n) ... | //#include<bits/stdc++.h> // 全てのヘッダーファイルをinclude
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility> // wrap,pair
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR (i, n) for (int i = n; i > 0; i--)
#define FOR(i, m, n) ... | [
"call.add",
"io.output.change",
"call.arguments.change"
] | 785,618 | 785,619 | u121243942 | cpp |
p02981 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define all(a) a.begin(), a.end()
#define ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define all(a) a.begin(), a.end()
#define ... | [
"expression.operation.binary.remove"
] | 785,620 | 785,621 | u840813237 | cpp |
p02981 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
ret... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
ret... | [
"expression.operation.binary.remove"
] | 785,622 | 785,623 | u746411953 | cpp |
p02981 | #include <bits/stdc++.h>
#define LL long long
#define fi first
#define se second
#define mp make_pair
#define pb push_back
using namespace std;
LL gcd(LL a, LL b) { return b ? gcd(b, a % b) : a; }
LL lcm(LL a, LL b) { return a / gcd(a, b) * b; }
LL powmod(LL a, LL b, LL MOD) {
LL ans = 1;
while (b) {
if (b %... | #include <bits/stdc++.h>
#define LL long long
#define fi first
#define se second
#define mp make_pair
#define pb push_back
using namespace std;
LL gcd(LL a, LL b) { return b ? gcd(b, a % b) : a; }
LL lcm(LL a, LL b) { return a / gcd(a, b) * b; }
LL powmod(LL a, LL b, LL MOD) {
LL ans = 1;
while (b) {
if (b %... | [
"expression.operation.binary.remove"
] | 785,630 | 785,631 | u862237347 | cpp |
p02981 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
int main() {
long long a, b, c;
std::cin >> a >> b >> c;
long long ret = b > c ? c : b;
ret = ret * a;
std::cout << ret << std::endl;
} | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
int main() {
long long a, b, c;
std::cin >> a >> b >> c;
long long ret = b * a > c ? c : b * a;
std::cout << ret << std::endl;
} | [
"assignment.change"
] | 785,633 | 785,634 | u750215086 | cpp |
p02981 | #include <bits/stdc++.h>
#define FOR(i, l, r) for (int i = (l), i##R = (r); i <= i##R; i++)
#define DOR(i, r, l) for (int i = (r), i##L = (l); i >= i##L; i--)
#define loop(i, n) for (int i = 0, i##R = (n); i < i##R; i++)
#define sf scanf
#define pf printf
#define mms(a, x) memset(a, x, sizeof a)
using namespace std;
ty... | #include <bits/stdc++.h>
#define FOR(i, l, r) for (int i = (l), i##R = (r); i <= i##R; i++)
#define DOR(i, r, l) for (int i = (r), i##L = (l); i >= i##L; i--)
#define loop(i, n) for (int i = 0, i##R = (n); i < i##R; i++)
#define sf scanf
#define pf printf
#define mms(a, x) memset(a, x, sizeof a)
using namespace std;
ty... | [
"expression.operation.binary.remove"
] | 785,635 | 785,636 | u753002569 | cpp |
p02981 | //* AuThOr GaRyMr *//
#include <bits/stdc++.h>
#define rb(a, b, c) for (int a = b; a <= c; ++a)
#define rl(a, b, c) for (int a = b; a >= c; --a)
#define niv vector<int>
#define LL long long
#define IT iterator
#define PB(a) push_back(a)
#define II(a, b) make_pair(a, b)
#define FIR first
#define SEC second
using namespa... | //* AuThOr GaRyMr *//
#include <bits/stdc++.h>
#define rb(a, b, c) for (int a = b; a <= c; ++a)
#define rl(a, b, c) for (int a = b; a >= c; --a)
#define niv vector<int>
#define LL long long
#define IT iterator
#define PB(a) push_back(a)
#define II(a, b) make_pair(a, b)
#define FIR first
#define SEC second
using namespa... | [
"expression.operation.binary.remove"
] | 785,639 | 785,640 | u751730221 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> P3;
typedef pair<P, P> PP;
constexpr ll MOD = ll(1e9) + 7;
constexpr int IINF = INT_MAX;
constexpr ll LLINF = LLONG_MAX;
constexpr int MAX_N = int(1e6) + 5;
constexpr double EP... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> P3;
typedef pair<P, P> PP;
constexpr ll MOD = ll(1e9) + 7;
constexpr int IINF = INT_MAX;
constexpr ll LLINF = LLONG_MAX;
constexpr int MAX_N = int(1e6) + 5;
constexpr double EP... | [
"call.add"
] | 785,643 | 785,644 | u271063202 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define eb emplace_back
typedef long long ll;
const int INF = 1e9;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int N, a, b;
cin >> N >> a >> b;
cout << ... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define eb emplace_back
typedef long long ll;
const int INF = 1e9;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int N, a, b;
cin >> N >> a >> b;
cout << ... | [
"expression.operation.binary.remove"
] | 785,645 | 785,646 | u874610744 | cpp |
p02981 | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << n * min(a, b) << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b) << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 785,647 | 785,648 | u535008646 | cpp |
p02974 | #include <bits/stdc++.h>
#define owo(i, a, b) for (int i = (a); i < (b); ++i)
#define uwu(i, a, b) for (int i = (a)-1; i >= (b); --i)
#define senpai push_back
#define ttgl pair<int, int>
#define ayaya cout << "ayaya~" << endl
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
g... | #include <bits/stdc++.h>
#define owo(i, a, b) for (int i = (a); i < (b); ++i)
#define uwu(i, a, b) for (int i = (a)-1; i >= (b); --i)
#define senpai push_back
#define ttgl pair<int, int>
#define ayaya cout << "ayaya~" << endl
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
g... | [
"literal.number.change",
"variable_declaration.value.change"
] | 785,653 | 785,652 | u532199771 | cpp |
p02974 | #include <iostream>
using namespace std;
long mod = 1e9 + 7, dp[51][51][2505];
int N, K;
main() {
cin >> N >> K;
if (K % 2 == 1) {
cout << 0 << '\n';
return 0;
}
K /= 2;
dp[0][0][0] = 1;
for (int i = 0; i < N; i++)
for (int j = 0; j <= i; j++) {
for (int k = 0; k <= K - j + 2; k++) {
... | #include <iostream>
using namespace std;
long mod = 1e9 + 7, dp[51][51][2505];
int N, K;
main() {
cin >> N >> K;
if (K % 2 == 1) {
cout << 0 << '\n';
return 0;
}
K /= 2;
dp[0][0][0] = 1;
for (int i = 0; i < N; i++)
for (int j = 0; j <= i; j++) {
for (int k = 0; k <= K - j + 2; k++) {
... | [
"expression.operation.binary.remove"
] | 785,660 | 785,661 | u478275206 | cpp |
p02974 | #include <bits/stdc++.h>
using namespace std;
#define N 50 + 5
#define M 2500 + 5
#define Mod 1000000007
#define rep(i, l, r) for (int i = l; i <= r; ++i)
int n, m, dp[N][N][M];
int read() {
char c;
int x = 0, f = 1;
c = getchar();
while (c > '9' || c < '0') {
if (c == '-')
f = -1;
c = getchar();
... | #include <bits/stdc++.h>
using namespace std;
#define N 50 + 5
#define M 2500 + 5
#define Mod 1000000007
#define rep(i, l, r) for (int i = l; i <= r; ++i)
int n, m, dp[N][N][M];
int read() {
char c;
int x = 0, f = 1;
c = getchar();
while (c > '9' || c < '0') {
if (c == '-')
f = -1;
c = getchar();
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 785,662 | 785,663 | u220214337 | cpp |
p02974 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
const ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
const ... | [
"expression.operation.binary.remove"
] | 785,668 | 785,669 | u277556971 | cpp |
p02974 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
#define pb push_back
#define mp make_pair
#define taskname "A"
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef tree<int, null_type, ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
#define pb push_back
#define mp make_pair
#define taskname "A"
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef tree<int, null_type, ... | [
"control_flow.loop.for.condition.change",
"identifier.change",
"expression.operation.binary.change"
] | 785,670 | 785,671 | u368329754 | cpp |
p02974 | #include <bits/stdc++.h>
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define FORR(i, n) for (ll i = (ll)n - 1LL; i >= 0LL; i--)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) ((x).begin(), (x).end())
using namespace std;
using ll = long long;
template <typename T> using V = vector<T>;
constexpr int Mod = 99... | #include <bits/stdc++.h>
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define FORR(i, n) for (ll i = (ll)n - 1LL; i >= 0LL; i--)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) ((x).begin(), (x).end())
using namespace std;
using ll = long long;
template <typename T> using V = vector<T>;
constexpr int Mod = 99... | [
"assignment.change"
] | 785,674 | 785,675 | u047554023 | cpp |
p02974 | #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;
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 785,678 | 785,677 | u498141549 | cpp |
p02974 | #include <bits/stdc++.h>
using namespace std;
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
con... | #include <bits/stdc++.h>
using namespace std;
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
con... | [
"assignment.change"
] | 785,679 | 785,680 | u398942100 | cpp |
p02974 | #include <array>
#include <bits/stdc++.h>
using namespace std;
using ULL = unsigned long long;
using UL = unsigned;
using LL = long long;
#define rep(i, n) for (UL i = 0; i < (n); i++)
struct Problem {
static const ULL M = 1000000007;
UL dp[51][51][2500] = {};
void Solve() {
UL N, K;
cin >> N >> K;
... | #include <array>
#include <bits/stdc++.h>
using namespace std;
using ULL = unsigned long long;
using UL = unsigned;
using LL = long long;
#define rep(i, n) for (UL i = 0; i < (n); i++)
struct Problem {
static const ULL M = 1000000007;
ULL dp[51][51][2500] = {};
void Solve() {
UL N, K;
cin >> N >> K;
... | [] | 785,681 | 785,682 | u331948661 | cpp |
p02974 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 785,688 | 785,689 | u275786410 | cpp |
p02974 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
//#define int long long
#define ll long long
//#define int unsigned long long
#define pb push_back
#define double long double
using namespace std;
using namespace __gnu_pbds;
typedef tree<... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
//#define int long long
#define ll long long
//#define int unsigned long long
#define pb push_back
#define double long double
using namespace std;
using namespace __gnu_pbds;
typedef tree<... | [
"assignment.change"
] | 785,690 | 785,691 | u373008269 | cpp |
p02974 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define repl(i, s, n) for (int i = s; i <= n; ++i)
#define rer(i, l, u) for (int(i) = (int)(l); (i) <= (int)(u); ++(i))
#define reu(i, l, u) for (int(i) = (int)(l); (i) < (int)(u); ++(i))
#if defined(_MSC_VER) || __... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define repl(i, s, n) for (int i = s; i <= n; ++i)
#define rer(i, l, u) for (int(i) = (int)(l); (i) <= (int)(u); ++(i))
#define reu(i, l, u) for (int(i) = (int)(l); (i) < (int)(u); ++(i))
#if defined(_MSC_VER) || __... | [
"control_flow.loop.for.condition.change"
] | 785,692 | 785,693 | u703999673 | cpp |
p02974 | /*{{{*/
#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... | [
"control_flow.branch.if.add"
] | 785,694 | 785,695 | u284124505 | cpp |
p02974 | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i > (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x... | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i > (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 785,702 | 785,701 | u139031151 | cpp |
p02974 | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i > (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x... | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i > (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 785,702 | 785,703 | u139031151 | cpp |
p02974 | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i > (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x... | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i > (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 785,702 | 785,704 | u139031151 | cpp |
p02974 | #include <bits/stdc++.h>
#define GET_REP(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_REP(__VA_ARGS__, irep, _rep)(__VA_ARGS__)
#define rep1(...) GET_REP(__VA_ARGS__, irep1, _rep1)(__VA_ARGS__)
#define _rep(i, n) irep(i, 0, n)
#define _rep1(i, n) irep1(i, 1, n)
#define irep(i, a, n) for (int i = a; i < (int)(n); ++... | #include <bits/stdc++.h>
#define GET_REP(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_REP(__VA_ARGS__, irep, _rep)(__VA_ARGS__)
#define rep1(...) GET_REP(__VA_ARGS__, irep1, _rep1)(__VA_ARGS__)
#define _rep(i, n) irep(i, 0, n)
#define _rep1(i, n) irep1(i, 1, n)
#define irep(i, a, n) for (int i = a; i < (int)(n); ++... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 785,718 | 785,719 | u020746846 | cpp |
p02974 | #include <algorithm>
#include <array>
#include <assert.h>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace s... | #include <algorithm>
#include <array>
#include <assert.h>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace s... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 785,720 | 785,721 | u651764969 | cpp |
p02974 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll << 50;
tem... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll << 50;
tem... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 785,725 | 785,726 | u334351654 | cpp |
p02974 | #include <algorithm>
#include <climits>
#include <complex>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
// using
using namespace std;
// typedef
typedef long long ll;
// define
#define FOR(i, a, b, c) for (int i = (int)(a); i < (int)(b); i += (int)(c))
#defi... | #include <algorithm>
#include <climits>
#include <complex>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
// using
using namespace std;
// typedef
typedef long long ll;
// define
#define FOR(i, a, b, c) for (int i = (int)(a); i < (int)(b); i += (int)(c))
#defi... | [
"variable_declaration.type.change"
] | 785,735 | 785,736 | u164300951 | cpp |
p02974 | #include <bits/stdc++.h>
#define INL inline
#define REG register
#define DB double
#define LDB long double
#define ULL unsigned long long
#define LL long long
#define RPT(i, x, y) for (REG int i = (x); i < (y); i++)
#define DRPT(i, x, y) for (REG int i = (x); i > (y); i--)
#define MST(a, b) memset((a), (b), sizeof(a))... | #include <bits/stdc++.h>
#define INL inline
#define REG register
#define DB double
#define LDB long double
#define ULL unsigned long long
#define LL long long
#define RPT(i, x, y) for (REG int i = (x); i < (y); i++)
#define DRPT(i, x, y) for (REG int i = (x); i > (y); i--)
#define MST(a, b) memset((a), (b), sizeof(a))... | [
"variable_declaration.type.change",
"expression.operation.binary.remove"
] | 785,737 | 785,738 | u071420104 | cpp |
p02974 | #include <algorithm>
#include <cstdio>
using namespace std;
static const int A = 1e+9 + 7;
static const int MAX_N = 50;
static const int MAX_K = 1250;
unsigned int dp[MAX_N + 1][MAX_N + 1][MAX_K + 1];
int n, k;
void solve();
int main() {
scanf("%d %d", &n, &k);
if (k > n * n / 2)
printf("0\n");
else {
... | #include <algorithm>
#include <cstdio>
using namespace std;
static const int A = 1e+9 + 7;
static const int MAX_N = 50;
static const int MAX_K = 1250;
unsigned long dp[MAX_N + 1][MAX_N + 1][MAX_K + 1];
int n, k;
void solve();
int main() {
scanf("%d %d", &n, &k);
if (k > n * n / 2)
printf("0\n");
else {
... | [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 785,741 | 785,742 | u675757825 | cpp |
p02974 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl;
int mod = 1000000007;
#define mul(a, b) ((a % mod) * (b % mod)) % mod
int dp... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl;
int mod = 1000000007;
#define mul(a, b) ((a % mod) * (b % mod)) % mod
long l... | [
"variable_declaration.type.widen.change",
"expression.operation.binary.add"
] | 785,747 | 785,748 | u016189984 | cpp |
p02974 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl;
int mod = 1000000007;
#define mul(a, b) ((a % mod) * (b % mod)) % mod
long l... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl;
int mod = 1000000007;
#define mul(a, b) ((a % mod) * (b % mod)) % mod
long l... | [
"expression.operation.binary.add"
] | 785,749 | 785,750 | u016189984 | cpp |
p02974 | #include <iostream>
using namespace std;
long long dp[55][55][2605];
long long mod = 10e9 + 7;
int main(int argc, char *argv[]) {
int n, k;
cin >> n >> k;
dp[0][0][0] = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < i + 1; j++) {
for (int l = 0; l <= k + 1; l++) {
int nj = j;
... | #include <iostream>
using namespace std;
long long dp[55][55][2605];
long long mod = 1e9 + 7;
int main(int argc, char *argv[]) {
int n, k;
cin >> n >> k;
dp[0][0][0] = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < i + 1; j++) {
for (int l = 0; l < k + 1; l++) {
int nj = j;
... | [
"literal.number.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one"
] | 785,759 | 785,760 | u993229809 | cpp |
p02974 | #include <iostream>
using namespace std;
long long dp[55][55][2605];
long long mod = 10e9 + 7;
int main(int argc, char *argv[]) {
int n, k;
cin >> n >> k;
dp[0][0][0] = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < i + 1; j++) {
for (int l = 0; l < k + 1; l++) {
int nj = j;
... | #include <iostream>
using namespace std;
long long dp[55][55][2605];
long long mod = 1e9 + 7;
int main(int argc, char *argv[]) {
int n, k;
cin >> n >> k;
dp[0][0][0] = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < i + 1; j++) {
for (int l = 0; l < k + 1; l++) {
int nj = j;
... | [
"literal.number.change",
"expression.operation.binary.change"
] | 785,761 | 785,760 | u993229809 | cpp |
p02974 | #include <iostream>
using namespace std;
long long dp[55][55][2605];
long long mod = 10e9 + 7;
int main(int argc, char *argv[]) {
int n, k;
cin >> n >> k;
dp[0][0][0] = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < i + 1; j++) {
for (int l = 0; l < k + 1; l++) {
int nj = j;
... | #include <iostream>
using namespace std;
long long dp[55][55][2605];
long long mod = 1e9 + 7;
int main(int argc, char *argv[]) {
int n, k;
cin >> n >> k;
dp[0][0][0] = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < i + 1; j++) {
for (int l = 0; l < k + 1; l++) {
int nj = j;
... | [
"literal.number.change",
"expression.operation.binary.change"
] | 785,762 | 785,760 | u993229809 | cpp |
p02974 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef lon... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef lon... | [
"variable_declaration.type.change"
] | 785,763 | 785,764 | u865835920 | cpp |
p02974 | #include <bits/stdc++.h>
using namespace std;
long long dp[51][51][2551];
int main() {
memset(dp, 0, sizeof(dp));
int mod = 1e9 + 7;
int n, K;
cin >> n >> K;
dp[0][0][0] = 1;
for (int i = 0; i < n; ++i) {
for (int j = 0; j <= i; ++j) {
for (int k = 0; k <= K; ++k) {
int curr = dp[i][j][... | #include <bits/stdc++.h>
using namespace std;
long long dp[51][51][2551];
int main() {
memset(dp, 0, sizeof(dp));
int mod = 1e9 + 7;
int n, K;
cin >> n >> K;
dp[0][0][0] = 1;
for (int i = 0; i < n; ++i) {
for (int j = 0; j <= i; ++j) {
for (int k = 0; k <= K; ++k) {
long long curr = dp[... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 785,765 | 785,766 | u542111796 | cpp |
p02974 | #include <bits/stdc++.h>
using namespace std;
int dp[51][51][2551];
int main() {
memset(dp, 0, sizeof(dp));
int mod = 1e9 + 7;
int n, K;
cin >> n >> K;
dp[0][0][0] = 1;
for (int i = 0; i < n; ++i) {
for (int j = 0; j <= i; ++j) {
for (int k = 0; k <= K; ++k) {
int curr = dp[i][j][k] % m... | #include <bits/stdc++.h>
using namespace std;
long long dp[51][51][2551];
int main() {
memset(dp, 0, sizeof(dp));
int mod = 1e9 + 7;
int n, K;
cin >> n >> K;
dp[0][0][0] = 1;
for (int i = 0; i < n; ++i) {
for (int j = 0; j <= i; ++j) {
for (int k = 0; k <= K; ++k) {
long long curr = dp[... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 785,767 | 785,766 | u542111796 | cpp |
p02974 | // by Balloons
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#define mpr make_pair
#define debug() puts("okkkkkkkk")
#define rep(i, a, b) for (int(i) = (a); (i) <= (b); (i)++)
using namespace std;
typedef long long LL;
#define int LL
const int inf = 1 << 30, mod = 998244353;
int n, k... | // by Balloons
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#define mpr make_pair
#define debug() puts("okkkkkkkk")
#define rep(i, a, b) for (int(i) = (a); (i) <= (b); (i)++)
using namespace std;
typedef long long LL;
#define int LL
const int inf = 1 << 30, mod = 1000000007;
int n, ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 785,785 | 785,786 | u226963522 | cpp |
p02974 | #include <cassert>
#include <iostream>
#include <vector>
long long MOD = 1000000007;
int main() {
int N, K;
std::cin >> N >> K;
std::vector<std::vector<std::vector<long long>>> dp(N + 1);
for (int i = 0; i <= N; ++i) {
dp[i].resize(N + 1);
for (int j = 0; j <= N; ++j)
dp[i][j].assign(N * (N + 3... | #include <cassert>
#include <iostream>
#include <vector>
long long MOD = 1000000007;
int main() {
int N, K;
std::cin >> N >> K;
std::vector<std::vector<std::vector<long long>>> dp(N + 1);
for (int i = 0; i <= N; ++i) {
dp[i].resize(N + 1);
for (int j = 0; j <= N; ++j)
dp[i][j].assign(N * (N + 3... | [
"assignment.change",
"expression.operation.binary.remove"
] | 785,797 | 785,798 | u875972329 | cpp |
p02974 | #include <bits/stdc++.h>
using namespace std;
const int N = 52, M = 1e9 + 7, Z = 2505;
int n, k, dp[N][N][N * N << 1];
void ck(int &x) {
if (x >= M)
x -= M;
}
int main() {
scanf("%d %d", &n, &k);
if (k & 1 || k > n * n / 2) {
puts("0");
return 0;
}
dp[0][0][Z] = 1;
for (int i = 0; i < n; ++i) {
... | #include <bits/stdc++.h>
using namespace std;
const int N = 52, M = 1e9 + 7, Z = 2505;
int n, k, dp[N][N][N * N << 1];
void ck(int &x) {
if (x >= M)
x -= M;
}
int main() {
scanf("%d %d", &n, &k);
if (k & 1 || k > n * n / 2) {
puts("0");
return 0;
}
dp[0][0][Z] = 1;
for (int i = 0; i < n; ++i) {
... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 785,799 | 785,800 | u671537665 | cpp |
p02974 | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 55, M = 1e9 + 7, Z = 3000;
int n, k, dp[N][N][N * N << 1];
void ck(int &x) {
if (x >= M)
x -= M;
}
signed main() {
scanf("%lld %lld", &n, &k);
if (k & 1 || k > (n * n >> 1)) {
puts("0");
return 0;
}
dp[0][0][Z] = 1;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 55, M = 1e9 + 7, Z = 3000;
int n, k, dp[N][N][N * N << 1];
void ck(int &x) {
if (x >= M)
x -= M;
}
signed main() {
scanf("%lld %lld", &n, &k);
if (k & 1 || k > (n * n >> 1)) {
puts("0");
return 0;
}
dp[0][0][Z] = 1;
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 785,801 | 785,802 | u671537665 | cpp |
p02974 | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 55, M = 1e9 + 7, Z = 3000;
int n, k, dp[N][N][N * N << 1];
void ck(int &x) {
if (x >= M)
x -= M;
}
signed main() {
scanf("%lld %lld", &n, &k);
if (k & 1 || k > (n * n >> 1)) {
puts("0");
return 0;
}
dp[0][0][Z] = 1;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 55, M = 1e9 + 7, Z = 3000;
int n, k, dp[N][N][N * N << 1];
void ck(int &x) {
if (x >= M)
x -= M;
}
signed main() {
scanf("%lld %lld", &n, &k);
if (k & 1 || k > (n * n >> 1)) {
puts("0");
return 0;
}
dp[0][0][Z] = 1;
... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 785,803 | 785,802 | u671537665 | cpp |
p02974 | #include <bits/stdc++.h>
using namespace std;
#define M 2550
#define LL long long
const int mo = 1e9 + 7;
int dp[52][5201][52]; // 放到第i位 在我 之前 的空位有h位.
void Add(int &res, int x) {
res += x;
if (res > mo)
res -= mo;
return;
}
#define debug(x) cout << #x << " " << x << endl;
main() {
int n, k;
cin >> n >> k... | #include <bits/stdc++.h>
using namespace std;
#define M 2550
#define LL long long
const int mo = 1e9 + 7;
int dp[52][5201][52]; // 放到第i位 在我 之前 的空位有h位.
void Add(int &res, int x) {
res += x;
if (res > mo)
res -= mo;
return;
}
#define debug(x) cout << #x << " " << x << endl;
main() {
int n, k;
cin >> n >> k... | [
"expression.operation.binary.add"
] | 785,804 | 785,805 | u399268660 | cpp |
p02974 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
const ll MOD = 1e9 + 7;
ll N, K;
cin >> N >> K;
vector<vector<vector<ll>>> dp(N + 1,
vector<vector<ll>>(N + 1, vector<ll>(K + 1)));
dp[0][0][0] = ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
const ll MOD = 1e9 + 7;
ll N, K;
cin >> N >> K;
vector<vector<vector<ll>>> dp(N + 1,
vector<vector<ll>>(N + 2, vector<ll>(K + 1)));
dp[0][0][0] = ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 785,806 | 785,807 | u090097090 | cpp |
p02974 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long long M = 1000000007;
vector<vector<long long>> T(n + 1, vector<long long>(n * n + 1));
T[1][0] = 1;
T[0][0] = 1;
for (int i = 1; i < n; i++) {
vector<vector<long long>> P(n + 1, vector<long long>(n... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long long M = 1000000007;
vector<vector<long long>> T(n + 1, vector<long long>(n * n + 1));
T[1][0] = 1;
T[0][0] = 1;
for (int i = 1; i < n; i++) {
vector<vector<long long>> P(n + 1, vector<long long>(n... | [
"assignment.change"
] | 785,808 | 785,809 | u374099594 | cpp |
p02981 | /*Author: Gautam*/
#include <bits/stdc++.h>
#define FastIO \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using namespace s... | /*Author: Gautam*/
#include <bits/stdc++.h>
#define FastIO \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using namespace s... | [
"expression.operation.binary.remove"
] | 785,819 | 785,820 | u689000653 | cpp |
p02981 | #include <bits/stdc++.h>
#define int long long
#define uint unsigned int
#define ld long double
#define showoff \
ios::sync_with_stdio(false); \
cin.tie(0); ... | #include <bits/stdc++.h>
#define int long long
#define uint unsigned int
#define ld long double
#define showoff \
ios::sync_with_stdio(false); \
cin.tie(0); ... | [
"expression.operation.binary.remove"
] | 785,821 | 785,822 | u578751202 | cpp |
p02981 | #include <iostream>
using namespace std;
int main(void) {
int N, A, B;
cin >> N >> A >> B;
A = A * N;
if (A < B)
cout << B << endl;
else
cout << A << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int N, A, B;
cin >> N >> A >> B;
A = A * N;
if (A > B)
cout << B << endl;
else
cout << A << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 785,825 | 785,826 | u348109388 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
// define
#define str string
#define rep(x, y) for (int i = x; i < y; i++)
#define REP(x, y) for (int j = x; j < y; j++)
#define all(x) x.begin(), x.end()
#define elif else if
// vectordefine
#define vint vector<int>
#define vc vector<char>
#define vtr vector<string>
#defin... | #include <bits/stdc++.h>
using namespace std;
// define
#define str string
#define rep(x, y) for (int i = x; i < y; i++)
#define REP(x, y) for (int j = x; j < y; j++)
#define all(x) x.begin(), x.end()
#define elif else if
// vectordefine
#define vint vector<int>
#define vc vector<char>
#define vtr vector<string>
#defin... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 785,829 | 785,830 | u347579224 | cpp |
p02981 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <fstream>
#include <iostream>
#ifndef _TB
#define _TB
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define RFOR(i, b, a) for (int i = b - 1; i >= a; --i... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <fstream>
#include <iostream>
#ifndef _TB
#define _TB
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define RFOR(i, b, a) for (int i = b - 1; i >= a; --i... | [
"expression.operation.binary.remove"
] | 785,833 | 785,834 | u920200680 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n, a, b;
cin >> n >> a >> b;
cout << n * (min(a, b));
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b);
} | [
"expression.operation.binary.remove"
] | 785,837 | 785,838 | u595786324 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define mp(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define boost \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define mp(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define boost \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | [
"expression.operation.binary.remove"
] | 785,839 | 785,840 | u202858603 | cpp |
p02981 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
#define fi first
#define se second
#define pb push_back
#define pii pair<int, int>
#define ll long long
#define pll pair<ll, ll>
#define rep(i, from, to) for ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
#define fi first
#define se second
#define pb push_back
#define pii pair<int, int>
#define ll long long
#define pll pair<ll, ll>
#define rep(i, from, to) for ... | [
"expression.operation.binary.remove"
] | 785,845 | 785,846 | u352350187 | cpp |
p02981 | #include <algorithm>
#include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define PB(s) push_back(s)
#define ST(n) sort(n.begin(), n.end())
using namespace std;
typedef long long ll;
int main() {
int N, A, B;
cin >> N >> A >> B;
cout << min(N * A, N * B) << endl;
}
| #include <algorithm>
#include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define PB(s) push_back(s)
#define ST(n) sort(n.begin(), n.end())
using namespace std;
typedef long long ll;
int main() {
int N, A, B;
cin >> N >> A >> B;
cout << min(N * A, B) << endl;
}
| [
"expression.operation.binary.remove"
] | 785,851 | 785,852 | u847243301 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ldb = long double;
using pa = pair<ll, ll>;
using vec = vector<ll>;
#define pb push_back
#define po pop_back
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
#define f(i, x, n) for (ll i = x; i < n; i++)
#define unique_... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ldb = long double;
using pa = pair<ll, ll>;
using vec = vector<ll>;
#define pb push_back
#define po pop_back
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
#define f(i, x, n) for (ll i = x; i < n; i++)
#define unique_... | [
"expression.operation.binary.remove"
] | 785,857 | 785,858 | u063404629 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
#define SZ(items) (int)items.size()
#define CLR(a) memset(a, 0, sizeof(a))
#define SET(a) memset(a, -1, sizeof(a))
#ifdef DEBUG
#define debug(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " is " <... | #include <bits/stdc++.h>
using namespace std;
#define SZ(items) (int)items.size()
#define CLR(a) memset(a, 0, sizeof(a))
#define SET(a) memset(a, -1, sizeof(a))
#ifdef DEBUG
#define debug(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " is " <... | [
"expression.operation.binary.remove"
] | 785,859 | 785,860 | u098704227 | cpp |
p02981 | //==========================Head files==========================
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define LL long long
#define db double
#define mp make_pair
#define pr pair<int, int>
#define f... | //==========================Head files==========================
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define LL long long
#define db double
#define mp make_pair
#define pr pair<int, int>
#define f... | [
"expression.operation.binary.remove"
] | 785,861 | 785,862 | u774596402 | cpp |
p02981 | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
#include <list>
#include <map>
#in... | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
#include <list>
#include <map>
#in... | [
"expression.operation.binary.remove"
] | 785,863 | 785,864 | u937608388 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, l, r) for (int i = (int)(l); i < (int)(r); i++)
#define all(x) (x).begin(), (x).end()
#define pb push_back
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmi... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, l, r) for (int i = (int)(l); i < (int)(r); i++)
#define all(x) (x).begin(), (x).end()
#define pb push_back
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmi... | [
"expression.operation.binary.remove"
] | 785,865 | 785,866 | u057866967 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-ffloat-store")
#pragma GCC optimize("-fno-defer-pop")
#define all(a) a.begin(), a.end()
#define ll long long int
#define ld long double
ll power(ll a, ll b, ll m) {
if (b == 0)
r... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-ffloat-store")
#pragma GCC optimize("-fno-defer-pop")
#define all(a) a.begin(), a.end()
#define ll long long int
#define ld long double
ll power(ll a, ll b, ll m) {
if (b == 0)
r... | [
"expression.operation.binary.remove"
] | 785,867 | 785,868 | u838261804 | cpp |
p02981 | #include "bits/stdc++.h"
using namespace std;
#define fi first
#define se second
#define pb push_back
#define int long long
#define all(x) (x).begin(), (x).end()
using LL = long long;
using LD = long double;
using pii = pair<int, int>;
using vii = vector<pii>;
const int INF = 1e18;
const int MOD = 1e9 + 7;
const int... | #include "bits/stdc++.h"
using namespace std;
#define fi first
#define se second
#define pb push_back
#define int long long
#define all(x) (x).begin(), (x).end()
using LL = long long;
using LD = long double;
using pii = pair<int, int>;
using vii = vector<pii>;
const int INF = 1e18;
const int MOD = 1e9 + 7;
const int... | [
"expression.operation.binary.remove"
] | 785,869 | 785,870 | u192295874 | cpp |
p02981 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (N * B <= A * N) {
cout << N * B << endl;
} else {
cout << A * N << endl;
}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
if (B <= A * N) {
cout << B << endl;
} else {
cout << A * N << endl;
}
retur... | [
"expression.operation.binary.remove"
] | 785,873 | 785,874 | u482544950 | cpp |
p02981 | /*
∧,,∧
( 'ω' )つ ＜WA,またお前か！！
（m9 ＼
＼ ＼
) ) ＼
／／ ＼ ＼
(＿） (＿)
*/
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rep(x, y) for (int x = 0; x < y; x++)
#define MOD 1000000007
typedef long long LL;
typedef long double LD;
bool compare_by_b(pair<int, int> a,... | /*
∧,,∧
( 'ω' )つ ＜WA,またお前か！！
（m9 ＼
＼ ＼
) ) ＼
／／ ＼ ＼
(＿） (＿)
*/
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rep(x, y) for (int x = 0; x < y; x++)
#define MOD 1000000007
typedef long long LL;
typedef long double LD;
bool compare_by_b(pair<int, int> a,... | [
"expression.operation.binary.remove"
] | 785,887 | 785,888 | u321915648 | cpp |
p02981 | #include <bits/stdc++.h> //JuniorMonster a.k.a Sho10
#define ll long long
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz size
#define f first
#define s second
#define pb push_back
#de... | #include <bits/stdc++.h> //JuniorMonster a.k.a Sho10
#define ll long long
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz size
#define f first
#define s second
#define pb push_back
#de... | [
"expression.operation.binary.remove"
] | 785,889 | 785,890 | u794807449 | cpp |
p02981 | #include <bits/stdc++.h>
#define endl ("\n")
using namespace std;
#define deb(x) cout << (#x) << " -> " << (x) << endl;
#define mod (1000000007)
int main() {
ios_base::sync_with_stdio(false);
cout.tie(0);
cout << fixed;
cout.precision(10);
// Those who cannot acknowledge themselves, will invariably fail
... | #include <bits/stdc++.h>
#define endl ("\n")
using namespace std;
#define deb(x) cout << (#x) << " -> " << (x) << endl;
#define mod (1000000007)
int main() {
ios_base::sync_with_stdio(false);
cout.tie(0);
cout << fixed;
cout.precision(10);
// Those who cannot acknowledge themselves, will invariably fail
... | [
"call.add",
"io.output.change",
"call.arguments.change"
] | 785,891 | 785,892 | u612695892 | cpp |
p02981 | #include <algorithm>
#include <climits>
#include <complex>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
// using
using namespace std;
// typedef
typedef long long ll;
// define
#define FOR(i, a, b, c) for (int i = (int)(a); i < (int)(b); i += (int)(c))
#defi... | #include <algorithm>
#include <climits>
#include <complex>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
// using
using namespace std;
// typedef
typedef long long ll;
// define
#define FOR(i, a, b, c) for (int i = (int)(a); i < (int)(b); i += (int)(c))
#defi... | [
"expression.operation.binary.remove"
] | 785,893 | 785,894 | u164300951 | cpp |
p02981 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define initdp(a, b) \
for (int i = 0; i <= a; i++) ... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define initdp(a, b) \
for (int i = 0; i <= a; i++) ... | [
"expression.operation.binary.remove"
] | 785,897 | 785,898 | u133630059 | cpp |
p02981 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ld, ld> pdd;
#define fi first
#define se second
#define mp make_pair
#define fastIO \
io... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ld, ld> pdd;
#define fi first
#define se second
#define mp make_pair
#define fastIO \
io... | [
"expression.operation.binary.remove"
] | 785,901 | 785,902 | u722777218 | cpp |
p02981 | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, a, b;
cin >> n >> a >> b;
cout << n * min(a, b) << '\n';
return 0;
}
| #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, a, b;
cin >> n >> a >> b;
cout << min(n * a, b) << '\n';
return 0;
}
| [
"expression.operation.binary.remove"
] | 785,905 | 785,906 | u769237842 | cpp |
p02982 | #include <bits/stdc++.h>
using namespace std;
bool is_integer(double x) { return floor(x) == x; }
double Distance(int *p_1, int *p_2, int D) {
double sum = 0;
for (int i = 0; i < D; i++) {
int r, l;
l = *(p_1 + i);
r = *(p_2 + i);
sum += pow((r - l), 2);
}
return sqrt(sum);
}
int main(void... | #include <bits/stdc++.h>
using namespace std;
bool is_integer(double x) { return floor(x) == x; }
double Distance(int *p_1, int *p_2, int D) {
double sum = 0;
for (int i = 0; i < D; i++) {
int r, l;
l = *(p_1 + i);
r = *(p_2 + i);
sum += pow((r - l), 2);
}
return sqrt(sum);
}
int main(void... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 785,967 | 785,968 | u861231819 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.