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 |
|---|---|---|---|---|---|---|---|
p03151 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, ans;
cin >> n;
long long a[n], b[n], c[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
c[i] = a[i] - b[i];
}
long long sum = 0;
for (int i = 0; i < n; i++) {
sum += c[i];
}
if (sum < 0) {
ans = -1;
} else {
sort(c, c + n);
long long beh;
int count = 0;
for (int i = 0; i < n; i++) {
if (c[i] < 0) {
beh += c[i];
count++;
}
}
for (int i = n - 1; i > 0; i--) {
if (beh < 0) {
beh += c[i];
count++;
}
}
ans = count;
}
cout << ans;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, ans;
cin >> n;
long long a[n], b[n], c[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
c[i] = a[i] - b[i];
}
long long sum = 0;
for (int i = 0; i < n; i++) {
sum += c[i];
}
if (sum < 0) {
ans = -1;
} else {
sort(c, c + n);
long long beh = 0;
int count = 0;
for (int i = 0; i < n; i++) {
if (c[i] < 0) {
beh += c[i];
count++;
}
}
for (int i = n - 1; i > 0; i--) {
if (beh < 0) {
beh += c[i];
count++;
}
}
ans = count;
}
cout << ans;
}
| [
"variable_declaration.value.change"
] | 949,021 | 949,022 | u088751997 | cpp |
p03151 | #include <bits/stdc++.h>
using namespace std;
// keyence
int main() {
int n;
scanf("%d", &n);
int sum = 0;
int a[n] = {};
int b[n] = {};
int c[n] = {};
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
for (int i = 0; i < n; i++) {
scanf("%d", &b[i]);
c[i] = a[i] - b[i];
sum += c[i];
}
if (sum < 0)
cout << -1;
else {
sort(c, c + n);
int count = 0;
int total = 0;
for (; c[count] < 0; count++)
total += c[count];
for (int i = n - 1; total < 0; i--) {
total += c[i];
count++;
}
cout << count;
}
} | #include <bits/stdc++.h>
using namespace std;
// keyence
int main() {
int n;
scanf("%d", &n);
long long sum = 0;
int a[n] = {};
int b[n] = {};
int c[n] = {};
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
for (int i = 0; i < n; i++) {
scanf("%d", &b[i]);
c[i] = a[i] - b[i];
sum += c[i];
}
if (sum < 0)
cout << -1;
else {
sort(c, c + n);
int count = 0;
long long total = 0;
for (; c[count] < 0; count++)
total += c[count];
for (int i = n - 1; total < 0; i--) {
total += c[i];
count++;
}
cout << count;
}
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 949,027 | 949,026 | u530812054 | cpp |
p03151 | #include "algorithm"
#include "cmath"
#include "iostream"
#include "string"
#include "vector"
typedef long long ll;
using namespace std;
int main(int argc, char const *argv[]) {
ll NN;
std::cin >> NN;
ll A[NN];
for (ll i = 0; i < NN; i++) {
std::cin >> A[i];
}
ll B[NN];
for (ll i = 0; i < NN; i++) {
std::cin >> B[i];
}
ll sum_A = 0;
ll sum_B = 0;
for (ll i = 0; i < NN; i++) {
sum_A += A[i];
sum_B += B[i];
}
if (sum_B > sum_A) {
std::cout << -1 << '\n';
return 0;
}
ll count_minus = 0;
ll value_minus = 0;
ll count_plus = 0;
ll values_plus[NN];
for (ll i = 0; i < NN; i++) {
if (A[i] >= B[i]) {
values_plus[count_plus] = A[i] - B[i];
count_plus++;
} else {
count_minus++;
value_minus += B[i] - A[i];
}
}
std::vector<ll> v(count_plus);
for (ll i = 0; i < count_plus; i++) {
v[i] = values_plus[i];
}
sort(v.begin(), v.end());
// for (ll i = 0; i < count_plus; i++) {
// std::cout << v[i] << '\n';
// }
ll inv_sum = 0;
ll ans = count_minus;
for (ll i = 0; i < count_plus; i++) {
ll inv_order = count_plus - i - 1;
if (value_minus <= inv_sum) {
// std::cout << "count_minus: "<< count_minus << '\n';
// std::cout << "inv_sum: "<< inv_sum << '\n';
std::cout << ans << '\n';
return 0;
}
// inv_sum+= v[inv_order];
value_minus -= v[inv_order];
ans++;
}
std::cout << "eeeeeeeeeeeeee" << '\n';
return 0;
}
| #include "algorithm"
#include "cmath"
#include "iostream"
#include "string"
#include "vector"
typedef long long ll;
using namespace std;
int main(int argc, char const *argv[]) {
ll NN;
std::cin >> NN;
ll A[NN];
for (ll i = 0; i < NN; i++) {
std::cin >> A[i];
}
ll B[NN];
for (ll i = 0; i < NN; i++) {
std::cin >> B[i];
}
ll sum_A = 0;
ll sum_B = 0;
for (ll i = 0; i < NN; i++) {
sum_A += A[i];
sum_B += B[i];
}
if (sum_B > sum_A) {
std::cout << -1 << '\n';
return 0;
}
ll count_minus = 0;
ll value_minus = 0;
ll count_plus = 0;
ll values_plus[NN];
for (ll i = 0; i < NN; i++) {
if (A[i] >= B[i]) {
values_plus[count_plus] = A[i] - B[i];
count_plus++;
} else {
count_minus++;
value_minus += B[i] - A[i];
}
}
std::vector<ll> v(count_plus);
for (ll i = 0; i < count_plus; i++) {
v[i] = values_plus[i];
}
sort(v.begin(), v.end());
// for (ll i = 0; i < count_plus; i++) {
// std::cout << v[i] << '\n';
// }
ll inv_sum = 0;
ll ans = count_minus;
for (ll i = 0; i < count_plus; i++) {
ll inv_order = count_plus - i - 1;
if (value_minus <= inv_sum) {
// std::cout << "count_minus: "<< count_minus << '\n';
// std::cout << "inv_sum: "<< inv_sum << '\n';
std::cout << ans << '\n';
return 0;
}
// inv_sum+= v[inv_order];
value_minus -= v[inv_order];
ans++;
}
std::cout << ans << '\n';
return 0;
}
| [
"expression.operation.binary.change"
] | 949,028 | 949,029 | u271986615 | cpp |
p03151 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#define INF (ll)1e18
#define MOD (ll)1e9 + 7
#define pb push_back
typedef long long ll;
typedef long long int llt;
typedef pair<int, int> P;
typedef vector<int> V;
typedef map<int, int> M;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int a[112345], b[112345];
rep(i, n) cin >> a[i];
rep(i, n) cin >> b[i];
int plus = 0, minus = 0, cnt = 0;
vector<int> c(100000, 0);
rep(i, n) {
if (a[i] >= b[i]) {
plus += a[i] - b[i];
c.push_back(a[i] - b[i]);
}
if (a[i] < b[i]) {
minus += b[i] - a[i];
cnt++;
}
}
if (minus > plus)
cout << -1 << endl;
else {
int ans = 0;
sort(c.begin(), c.end());
reverse(c.begin(), c.end());
for (int i = 0; i < c.size(); i++) {
if (minus > 0) {
minus -= c[i];
ans++;
}
}
cout << ans + cnt << endl;
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#define INF (ll)1e18
#define MOD (ll)1e9 + 7
#define pb push_back
typedef long long ll;
typedef long long int llt;
typedef pair<int, int> P;
typedef vector<int> V;
typedef map<int, int> M;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
ll a[112345], b[112345];
rep(i, n) cin >> a[i];
rep(i, n) cin >> b[i];
ll plus = 0, minus = 0, cnt = 0;
vector<ll> c(100000, 0);
rep(i, n) {
if (a[i] >= b[i]) {
plus += a[i] - b[i];
c.push_back(a[i] - b[i]);
}
if (a[i] < b[i]) {
minus += b[i] - a[i];
cnt++;
}
}
if (minus > plus)
cout << -1 << endl;
else {
int ans = 0;
sort(c.begin(), c.end());
reverse(c.begin(), c.end());
for (int i = 0; i < c.size(); i++) {
if (minus > 0) {
minus -= c[i];
ans++;
}
}
cout << ans + cnt << endl;
}
return 0;
} | [
"variable_declaration.type.change"
] | 949,039 | 949,040 | u437973379 | cpp |
p03151 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
typedef long long int ll;
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < signed(n); i++)
#define EREP(i, n) for (int i = 1; i <= (n); i++)
#define ALL(a) (a).begin(), (a).end()
//#define EVEL 1
#ifdef EVEL
#define DEB(X) cout << #X << ":" << X << " ";
#define DESS(X) cout << X << " ";
#define TF(f) f ? cout << "true " : cout << "false ";
#define END cout << "\n";
#else
#define DEB(X) \
{}
#define TF(f) \
{}
#define END \
{}
#endif
const int MOD = 10007;
const ll INF = 20000000000;
typedef std::pair<int, int> P;
ll ans = 0;
ll N, M, K;
ll A[200010], B[200010], as, bs;
// ll L[200010],R[200010];
ll deff[200010];
vector<P> Q;
string S, T;
ll id = 0;
ll sum;
bool F = true;
int main() {
ios_base::sync_with_stdio(false);
cin >> N;
REP(i, N) {
cin >> A[i];
as += A[i];
}
REP(i, N) {
cin >> B[i];
bs += B[i];
deff[i] = A[i] - B[i];
}
if (bs > as) {
cout << -1;
return 0;
}
sort(deff, deff + N);
REP(i, N) {
if (deff[i] < 0) {
ans++;
id++;
sum += deff[i];
} else {
break;
}
}
DEB(ans) DEB(id) if (sum >= 0) {
cout << 0 << endl;
return 0;
}
REP(i, N - id) {
sum += deff[N - 1 - i];
ans++;
if (sum >= 0) {
break;
}
}
cout << N - ans << endl;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
typedef long long int ll;
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < signed(n); i++)
#define EREP(i, n) for (int i = 1; i <= (n); i++)
#define ALL(a) (a).begin(), (a).end()
//#define EVEL 1
#ifdef EVEL
#define DEB(X) cout << #X << ":" << X << " ";
#define DESS(X) cout << X << " ";
#define TF(f) f ? cout << "true " : cout << "false ";
#define END cout << "\n";
#else
#define DEB(X) \
{}
#define TF(f) \
{}
#define END \
{}
#endif
const int MOD = 10007;
const ll INF = 20000000000;
typedef std::pair<int, int> P;
ll ans = 0;
ll N, M, K;
ll A[200010], B[200010], as, bs;
// ll L[200010],R[200010];
ll deff[200010];
vector<P> Q;
string S, T;
ll id = 0;
ll sum;
bool F = true;
int main() {
ios_base::sync_with_stdio(false);
cin >> N;
REP(i, N) {
cin >> A[i];
as += A[i];
}
REP(i, N) {
cin >> B[i];
bs += B[i];
deff[i] = A[i] - B[i];
}
if (bs > as) {
cout << -1;
return 0;
}
sort(deff, deff + N);
REP(i, N) {
if (deff[i] < 0) {
ans++;
id++;
sum += deff[i];
} else {
break;
}
}
DEB(ans) DEB(id) if (sum >= 0) {
cout << 0 << endl;
return 0;
}
REP(i, N - id) {
sum += deff[N - 1 - i];
ans++;
if (sum >= 0) {
break;
}
}
cout << ans << endl;
} | [
"expression.operation.binary.remove"
] | 949,063 | 949,064 | u549743442 | cpp |
p03151 | #include <bits/stdc++.h>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
// template<typename key, typename val>
// using ordered_tree =
// tree<key, val, less<key>, rb_tree_tag, tree_order_statistics_node_update>;
using namespace std;
typedef long long int64;
typedef complex<double> comp;
const double pi = 3.14159265358979323846;
const int inf = (int)1e+9 + 2;
const int64 inf64 = (int64)1e+18 + 2;
const double dinf = 1e+20;
const int mod = /*1'000'000'007;*/ 998244353;
const int base = 2187;
const double eps = 1e-8;
const int N = 100'000;
int n, m, k;
int64 a[N], b[N];
void solve(int test) {
cin >> n;
for (int i = 0; i < n; ++i)
cin >> a[i];
priority_queue<int64> q;
for (int i = 0; i < n; ++i) {
cin >> b[i];
if (a[i] - b[i] > 0)
q.push(a[i] - b[i]);
}
int ans = 0;
int64 c = 0;
for (int i = 0; i < n; ++i) {
if (a[i] - b[i] < 0) {
++ans;
if (b[i] - a[i] > c) {
if (q.empty()) {
cout << "-1\n";
return;
}
c += q.top();
q.pop();
++ans;
}
c -= b[i] - a[i];
}
}
cout << ans << '\n';
}
void precalc() {}
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
precalc();
int test = 1;
// cin >> test;
// auto start = chrono::high_resolution_clock::now();
for (int i = 1; i <= test; ++i)
solve(i);
// cerr << endl <<
// chrono::duration_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()
// - start).count();
return 0;
}
| #include <bits/stdc++.h>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
// template<typename key, typename val>
// using ordered_tree =
// tree<key, val, less<key>, rb_tree_tag, tree_order_statistics_node_update>;
using namespace std;
typedef long long int64;
typedef complex<double> comp;
const double pi = 3.14159265358979323846;
const int inf = (int)1e+9 + 2;
const int64 inf64 = (int64)1e+18 + 2;
const double dinf = 1e+20;
const int mod = /*1'000'000'007;*/ 998244353;
const int base = 2187;
const double eps = 1e-8;
const int N = 100'000;
int n, m, k;
int a[N], b[N];
void solve(int test) {
cin >> n;
for (int i = 0; i < n; ++i)
cin >> a[i];
priority_queue<int64> q;
for (int i = 0; i < n; ++i) {
cin >> b[i];
if (a[i] - b[i] > 0)
q.push(a[i] - b[i]);
}
int ans = 0;
int c = 0;
for (int i = 0; i < n; ++i) {
if (a[i] - b[i] < 0) {
++ans;
while (b[i] - a[i] > c) {
if (q.empty()) {
cout << "-1\n";
return;
}
c += q.top();
q.pop();
++ans;
}
c -= b[i] - a[i];
}
}
cout << ans << '\n';
}
void precalc() {}
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
precalc();
int test = 1;
// cin >> test;
// auto start = chrono::high_resolution_clock::now();
for (int i = 1; i <= test; ++i)
solve(i);
// cerr << endl <<
// chrono::duration_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()
// - start).count();
return 0;
}
| [
"variable_declaration.type.change",
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove"
] | 949,071 | 949,072 | u432090061 | cpp |
p03151 | #include <bits/stdc++.h>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
// template<typename key, typename val>
// using ordered_tree =
// tree<key, val, less<key>, rb_tree_tag, tree_order_statistics_node_update>;
using namespace std;
typedef long long int64;
typedef complex<double> comp;
const double pi = 3.14159265358979323846;
const int inf = (int)1e+9 + 2;
const int64 inf64 = (int64)1e+18 + 2;
const double dinf = 1e+20;
const int mod = /*1'000'000'007;*/ 998244353;
const int base = 2187;
const double eps = 1e-8;
const int N = 100'000;
int n, m, k;
int a[N], b[N];
void solve(int test) {
cin >> n;
for (int i = 0; i < n; ++i)
cin >> a[i];
priority_queue<int> q;
for (int i = 0; i < n; ++i) {
cin >> b[i];
if (a[i] - b[i] > 0)
q.push(a[i] - b[i]);
}
int ans = 0;
int c = 0;
for (int i = 0; i < n; ++i) {
if (a[i] - b[i] < 0) {
++ans;
if (b[i] - a[i] > c) {
if (q.empty()) {
cout << "-1\n";
return;
}
c += q.top();
q.pop();
++ans;
}
c -= b[i] - a[i];
}
}
cout << ans << '\n';
}
void precalc() {}
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
precalc();
int test = 1;
// cin >> test;
// auto start = chrono::high_resolution_clock::now();
for (int i = 1; i <= test; ++i)
solve(i);
// cerr << endl <<
// chrono::duration_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()
// - start).count();
return 0;
}
| #include <bits/stdc++.h>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
// template<typename key, typename val>
// using ordered_tree =
// tree<key, val, less<key>, rb_tree_tag, tree_order_statistics_node_update>;
using namespace std;
typedef long long int64;
typedef complex<double> comp;
const double pi = 3.14159265358979323846;
const int inf = (int)1e+9 + 2;
const int64 inf64 = (int64)1e+18 + 2;
const double dinf = 1e+20;
const int mod = /*1'000'000'007;*/ 998244353;
const int base = 2187;
const double eps = 1e-8;
const int N = 100'000;
int n, m, k;
int a[N], b[N];
void solve(int test) {
cin >> n;
for (int i = 0; i < n; ++i)
cin >> a[i];
priority_queue<int64> q;
for (int i = 0; i < n; ++i) {
cin >> b[i];
if (a[i] - b[i] > 0)
q.push(a[i] - b[i]);
}
int ans = 0;
int c = 0;
for (int i = 0; i < n; ++i) {
if (a[i] - b[i] < 0) {
++ans;
while (b[i] - a[i] > c) {
if (q.empty()) {
cout << "-1\n";
return;
}
c += q.top();
q.pop();
++ans;
}
c -= b[i] - a[i];
}
}
cout << ans << '\n';
}
void precalc() {}
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
precalc();
int test = 1;
// cin >> test;
// auto start = chrono::high_resolution_clock::now();
for (int i = 1; i <= test; ++i)
solve(i);
// cerr << endl <<
// chrono::duration_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()
// - start).count();
return 0;
}
| [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove"
] | 949,073 | 949,072 | u432090061 | cpp |
p03151 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define RREP(i, n) RFOR(i, n, 0)
#define MFOR(i, m) for (auto i = (m).begin(); i != (m).end(); i++)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((int)(x).size())
typedef long long int ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1 << 30;
template <typename T> void printv(vector<T> const &s) {
REP(i, SZ(s)) { cout << s[i] << " "; }
cout << endl;
}
int main() {
cin.tie(0);
cout << setprecision(10);
int n;
cin >> n;
vll a(n);
REP(i, n) cin >> a[i];
vll b(n);
REP(i, n) cin >> b[i];
vll d;
ll cnt = 0;
ll mi = 0;
ll pl = 0;
REP(i, n) {
if (a[i] - b[i] < 0) {
cnt++;
mi += b[i] - a[i];
} else {
d.pb(a[i] - b[i]);
pl += a[i] - b[i];
}
}
if (mi > pl) {
cout << -1 << endl;
return 0;
}
sort(ALL(b));
reverse(ALL(b));
int i = 0;
while (mi > 0) {
cnt++;
mi -= d[i];
i++;
}
cout << cnt << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define RREP(i, n) RFOR(i, n, 0)
#define MFOR(i, m) for (auto i = (m).begin(); i != (m).end(); i++)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((int)(x).size())
typedef long long int ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1 << 30;
template <typename T> void printv(vector<T> const &s) {
REP(i, SZ(s)) { cout << s[i] << " "; }
cout << endl;
}
int main() {
cin.tie(0);
cout << setprecision(10);
int n;
cin >> n;
vll a(n);
REP(i, n) cin >> a[i];
vll b(n);
REP(i, n) cin >> b[i];
vll d;
ll cnt = 0;
ll mi = 0;
ll pl = 0;
REP(i, n) {
if (a[i] - b[i] < 0) {
cnt++;
mi += b[i] - a[i];
} else {
d.pb(a[i] - b[i]);
pl += a[i] - b[i];
}
}
if (mi > pl) {
cout << -1 << endl;
return 0;
}
sort(ALL(d));
reverse(ALL(d));
int i = 0;
while (mi > 0) {
cnt++;
mi -= d[i];
i++;
}
cout << cnt << endl;
}
| [
"identifier.change",
"call.arguments.change"
] | 949,084 | 949,085 | u334351654 | cpp |
p03151 | // g++ -std=c++11 a.cpp
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define FOR(i, a) for (auto i : a)
#define pb push_back
#define all(in) in.begin(), in.end()
#define shosu(x) fixed << setprecision(x)
#define show1d(v) \
{ \
rep(_, v.size()) printf("%d ", v[_]); \
cout << "\n"; \
}
#define show2d(v) \
{ rep(__, v.size()) show1d(v[__]); }
using namespace std;
// kaewasuretyuui
typedef long long ll;
#define int ll
typedef int Def;
typedef pair<Def, Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<Def, pii> pip;
typedef vector<pip> vip;
#define mt make_tuple
typedef tuple<int, int, int, int> tp;
typedef vector<tp> vt;
template <typename A, typename B> bool cmin(A &a, const B &b) {
return a > b ? (a = b, true) : false;
}
template <typename A, typename B> bool cmax(A &a, const B &b) {
return a < b ? (a = b, true) : false;
}
// template<class C>constexpr int size(const C &c){return (int)c.size();}
// template<class T,size_t N> constexpr int size(const T
// (&xs)[N])noexcept{return (int)N;}
const double PI = acos(-1);
const double EPS = 1e-9;
Def inf = sizeof(Def) == sizeof(long long) ? 2e18 : 1e9 + 10;
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0}; // RDLU
#define yes puts("YES")
#define no puts("NO")
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vi in(n);
rep(i, n) cin >> in[i];
rep(i, n) {
int a;
cin >> a;
in[i] -= a;
}
sort(all(in));
int sum = 0, co = 0;
rep(i, n) if (in[i] < 0) sum -= in[i], co++;
for (int i = n - 1; i >= 0; i--) {
if (sum <= 0)
break;
if (in[i] > 0) {
sum -= in[i];
co++;
}
}
if (sum >= 0)
cout << -1 << endl;
else
cout << co << endl;
}
| // g++ -std=c++11 a.cpp
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define FOR(i, a) for (auto i : a)
#define pb push_back
#define all(in) in.begin(), in.end()
#define shosu(x) fixed << setprecision(x)
#define show1d(v) \
{ \
rep(_, v.size()) printf("%d ", v[_]); \
cout << "\n"; \
}
#define show2d(v) \
{ rep(__, v.size()) show1d(v[__]); }
using namespace std;
// kaewasuretyuui
typedef long long ll;
#define int ll
typedef int Def;
typedef pair<Def, Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<Def, pii> pip;
typedef vector<pip> vip;
#define mt make_tuple
typedef tuple<int, int, int, int> tp;
typedef vector<tp> vt;
template <typename A, typename B> bool cmin(A &a, const B &b) {
return a > b ? (a = b, true) : false;
}
template <typename A, typename B> bool cmax(A &a, const B &b) {
return a < b ? (a = b, true) : false;
}
// template<class C>constexpr int size(const C &c){return (int)c.size();}
// template<class T,size_t N> constexpr int size(const T
// (&xs)[N])noexcept{return (int)N;}
const double PI = acos(-1);
const double EPS = 1e-9;
Def inf = sizeof(Def) == sizeof(long long) ? 2e18 : 1e9 + 10;
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0}; // RDLU
#define yes puts("YES")
#define no puts("NO")
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vi in(n);
rep(i, n) cin >> in[i];
rep(i, n) {
int a;
cin >> a;
in[i] -= a;
}
sort(all(in));
int sum = 0, co = 0;
rep(i, n) if (in[i] < 0) sum -= in[i], co++;
for (int i = n - 1; i >= 0; i--) {
if (sum <= 0)
break;
if (in[i] > 0) {
sum -= in[i];
co++;
}
}
if (sum > 0)
cout << -1 << endl;
else
cout << co << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 949,092 | 949,093 | u010004797 | cpp |
p03152 | // Copyright 2020 yaito3014
#include <bits/stdc++.h>
int main() {
using namespace std;
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<int> A(N), B(M);
for (auto &e : A)
cin >> e, --e;
for (auto &e : B)
cin >> e, --e;
sort(begin(A), end(A));
sort(begin(B), end(B));
if (unique(begin(A), end(A)) != end(A) ||
unique(begin(B), end(B)) != end(B)) {
cout << "0dayo\n";
return 0;
}
vector<int> count_A(N * M + 1, 0), count_B(N * M + 1, 0);
for (const auto &e : A)
++count_A[e];
for (const auto &e : B)
++count_B[e];
partial_sum(crbegin(count_A), crend(count_A), rbegin(count_A));
partial_sum(crbegin(count_B), crend(count_B), rbegin(count_B));
constexpr int kMod = 1000000007;
long long ans = 1;
for (int i = N * M; i > 0;) {
--i;
int a = count_A[i] - count_A[i + 1];
int b = count_B[i] - count_B[i + 1];
if (a && !b)
ans = ans * count_B[i] % kMod;
else if (!a && b)
ans = ans * count_A[i] % kMod;
else if (!a && !b) {
int p = count_A[i] * count_B[i] - (N * M - i - 1);
ans = ans * p % kMod;
}
}
cout << ans << endl;
}
| // Copyright 2020 yaito3014
#include <bits/stdc++.h>
int main() {
using namespace std;
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<int> A(N), B(M);
for (auto &e : A)
cin >> e, --e;
for (auto &e : B)
cin >> e, --e;
sort(begin(A), end(A));
sort(begin(B), end(B));
if (unique(begin(A), end(A)) != end(A) ||
unique(begin(B), end(B)) != end(B)) {
cout << "0\n";
return 0;
}
vector<int> count_A(N * M + 1, 0), count_B(N * M + 1, 0);
for (const auto &e : A)
++count_A[e];
for (const auto &e : B)
++count_B[e];
partial_sum(crbegin(count_A), crend(count_A), rbegin(count_A));
partial_sum(crbegin(count_B), crend(count_B), rbegin(count_B));
constexpr int kMod = 1000000007;
long long ans = 1;
for (int i = N * M; i > 0;) {
--i;
int a = count_A[i] - count_A[i + 1];
int b = count_B[i] - count_B[i + 1];
if (a && !b)
ans = ans * count_B[i] % kMod;
else if (!a && b)
ans = ans * count_A[i] % kMod;
else if (!a && !b) {
int p = count_A[i] * count_B[i] - (N * M - i - 1);
ans = ans * p % kMod;
}
}
cout << ans << endl;
}
| [
"literal.string.change",
"io.output.change"
] | 949,112 | 949,113 | u264304509 | cpp |
p03152 | #include <bits/stdc++.h>
#define rep(a, n) for (ll a = 0; a < (n); ++a)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<vector<ll>> Graph;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll INF = 1e9;
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const int mod = 1000000007;
// const int mod = 998244353;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
// combination mod prime
// mintが必要
// https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
};
bool a[1010];
bool b[1010];
int main() {
int n, m;
cin >> n >> m;
rep(i, n) {
int A;
cin >> A;
a[A] = true;
}
rep(i, m) {
int B;
cin >> B;
b[B] = true;
}
int v_cnt = 0;
int p_cnt = 0;
mint ans = 1;
int M = n * m;
for (int i = M; i >= 1; i--) {
int u = M - i;
if (a[i] && b[i]) {
v_cnt++;
p_cnt++;
} else if (a[i]) {
ans *= p_cnt;
v_cnt++;
} else if (b[i]) {
ans *= v_cnt;
p_cnt++;
} else {
ans *= (v_cnt * p_cnt - u);
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(a, n) for (ll a = 0; a < (n); ++a)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<vector<ll>> Graph;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll INF = 1e9;
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const int mod = 1000000007;
// const int mod = 998244353;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
// combination mod prime
// mintが必要
// https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
};
bool a[1000010];
bool b[1000010];
int main() {
int n, m;
cin >> n >> m;
rep(i, n) {
int A;
cin >> A;
a[A] = true;
}
rep(i, m) {
int B;
cin >> B;
b[B] = true;
}
int v_cnt = 0;
int p_cnt = 0;
mint ans = 1;
int M = n * m;
for (int i = M; i >= 1; i--) {
int u = M - i;
if (a[i] && b[i]) {
v_cnt++;
p_cnt++;
} else if (a[i]) {
ans *= p_cnt;
v_cnt++;
} else if (b[i]) {
ans *= v_cnt;
p_cnt++;
} else {
ans *= (v_cnt * p_cnt - u);
}
}
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 949,114 | 949,115 | u045408189 | cpp |
p03152 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, m;
cin >> n >> m;
set<int> h, w;
rep(i, n) {
int o;
cin >> o;
if (h.count(o)) {
cout << 0 << endl;
return 0;
}
h.insert(o);
}
rep(i, m) {
int o;
cin >> o;
if (w.count(o)) {
cout << 0 << endl;
return 0;
}
w.insert(o);
}
long long ans = 1;
long long p = 1000000007;
long long hh = 0, ww = 0;
long long cnt = 0;
rep(i, n * m) {
int q = n * m - 1;
if (h.count(q) && w.count(q)) {
hh++;
ww++;
cnt++;
}
if (h.count(q)) {
if (w.count(q))
int c;
else {
ans = ans * ww % p;
hh++;
cnt++;
}
} else {
if (w.count(q)) {
ans = ans * hh % p;
ww++;
cnt++;
} else {
ans *= (hh * ww - cnt) * ans % p;
cnt++;
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, m;
cin >> n >> m;
set<int> h, w;
rep(i, n) {
int o;
cin >> o;
if (h.count(o)) {
cout << 0 << endl;
return 0;
}
h.insert(o);
}
rep(i, m) {
int o;
cin >> o;
if (w.count(o)) {
cout << 0 << endl;
return 0;
}
w.insert(o);
}
long long ans = 1;
long long p = 1000000007;
long long hh = 0, ww = 0;
long long cnt = 0;
rep(i, n * m) {
int q = n * m - i;
if (h.count(q) && w.count(q)) {
hh++;
ww++;
cnt++;
}
if (h.count(q)) {
if (w.count(q))
int c;
else {
ans = ans * ww % p;
hh++;
cnt++;
}
} else {
if (w.count(q)) {
ans = ans * hh % p;
ww++;
cnt++;
} else {
ans = (hh * ww - cnt) * ans % p;
cnt++;
}
}
}
cout << ans << endl;
} | [
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change",
"assignment.value.change"
] | 949,116 | 949,117 | u525560003 | cpp |
p03150 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define repone(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define each(i, mp) for (auto i : mp)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const ll mod = 1000000007;
const ll inf = ll(1e9);
const ll half_inf = ll(1e5);
const ll ll_inf = ll(1e9) * ll(1e9);
int main() {
string s;
cin >> s;
rep(i, s.length()) {
FOR(j, i, s.length()) {
if (s.substr(0, i) + s.substr(j, s.length() - j - 1) == "keyence") {
cout << "YES" << endl;
return 0;
}
}
}
cout << "NO" << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define repone(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define each(i, mp) for (auto i : mp)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const ll mod = 1000000007;
const ll inf = ll(1e9);
const ll half_inf = ll(1e5);
const ll ll_inf = ll(1e9) * ll(1e9);
int main() {
string s;
cin >> s;
rep(i, s.length() + 1) {
FOR(j, i, s.length()) {
if (s.substr(0, i) + s.substr(j, s.length() - j) == "keyence") {
cout << "YES" << endl;
return 0;
}
}
}
cout << "NO" << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 949,124 | 949,125 | u136378781 | cpp |
p03150 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define repone(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define each(i, mp) for (auto i : mp)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const ll mod = 1000000007;
const ll inf = ll(1e9);
const ll half_inf = ll(1e5);
const ll ll_inf = ll(1e9) * ll(1e9);
int main() {
string s;
cin >> s;
rep(i, s.length()) {
FOR(j, i, s.length()) {
if (s.substr(0, i) + s.substr(j, s.length() - j - 1) == "keyence") {
cout << "YES" << endl;
return 0;
}
}
}
cout << "NO" << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define repone(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define each(i, mp) for (auto i : mp)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const ll mod = 1000000007;
const ll inf = ll(1e9);
const ll half_inf = ll(1e5);
const ll ll_inf = ll(1e9) * ll(1e9);
int main() {
string s;
cin >> s;
rep(i, s.length() + 1) {
FOR(j, i, s.length() + 1) {
if (s.substr(0, i) + s.substr(j, s.length() - j) == "keyence") {
cout << "YES" << endl;
return 0;
}
}
}
cout << "NO" << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 949,124 | 949,126 | u136378781 | cpp |
p03150 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define COUT(x) cout << x << endl
#define CIN(x) cin >> x
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, n) FOR(i, 0, n)
#define EXIST(s, e) (s.find(e) != s.end())
#define SORT(c) sort(c.begin(), c.end())
#define ERASEUNIQE(v) v.erase(unique(v.begin(), v.end()), v.end())
// conversion
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
template <class T> inline T sqr(T x) { return x * x; }
// typedef
typedef long long LL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
// container util
#define ALL(c) c.begin(), c.end()
#define RALL(c) c.rbegin(), c.rend()
// constant
const double EPS = 1e-10;
const double PI = acos(-1.0);
// debug
#define dump(x) cerr << #x << " = " << x << endl;
#define debug(x) \
cerr << #x << " = " << x << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
// clear memory
#define CLR(a) memset((a), 0, sizeof(a))
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
int main(int argc, char const *argv[]) {
string words = "keyence";
string S;
CIN(S);
if (S == words) {
COUT("YES");
return 0;
}
for (int i = 0; i < (int)S.size(); i++) {
for (int j = 0; j < (int)S.size(); j++) {
string str = "";
for (int k = 0; k < (int)S.size(); k++) {
if (i <= k && k <= j) {
continue;
} else {
str.push_back(words[k]);
}
}
if (str == words) {
COUT("YES");
return 0;
}
}
}
COUT("NO");
return 0;
}
| #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define COUT(x) cout << x << endl
#define CIN(x) cin >> x
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, n) FOR(i, 0, n)
#define EXIST(s, e) (s.find(e) != s.end())
#define SORT(c) sort(c.begin(), c.end())
#define ERASEUNIQE(v) v.erase(unique(v.begin(), v.end()), v.end())
// conversion
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
template <class T> inline T sqr(T x) { return x * x; }
// typedef
typedef long long LL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
// container util
#define ALL(c) c.begin(), c.end()
#define RALL(c) c.rbegin(), c.rend()
// constant
const double EPS = 1e-10;
const double PI = acos(-1.0);
// debug
#define dump(x) cerr << #x << " = " << x << endl;
#define debug(x) \
cerr << #x << " = " << x << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
// clear memory
#define CLR(a) memset((a), 0, sizeof(a))
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
int main(int argc, char const *argv[]) {
string words = "keyence";
string S;
CIN(S);
if (S == words) {
COUT("YES");
return 0;
}
for (int i = 0; i < (int)S.size(); i++) {
for (int j = 0; j < (int)S.size(); j++) {
string str = "";
for (int k = 0; k < (int)S.size(); k++) {
if (i <= k && k <= j) {
continue;
} else {
str.push_back(S[k]);
}
}
if (str == words) {
COUT("YES");
return 0;
}
}
}
COUT("NO");
return 0;
}
| [
"identifier.change",
"call.arguments.change"
] | 949,127 | 949,128 | u180077477 | cpp |
p03150 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define COUT(x) cout << x << endl
#define CIN(x) cin >> x
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, n) FOR(i, 0, n)
#define EXIST(s, e) (s.find(e) != s.end())
#define SORT(c) sort(c.begin(), c.end())
#define ERASEUNIQE(v) v.erase(unique(v.begin(), v.end()), v.end())
// conversion
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
template <class T> inline T sqr(T x) { return x * x; }
// typedef
typedef long long LL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
// container util
#define ALL(c) c.begin(), c.end()
#define RALL(c) c.rbegin(), c.rend()
// constant
const double EPS = 1e-10;
const double PI = acos(-1.0);
// debug
#define dump(x) cerr << #x << " = " << x << endl;
#define debug(x) \
cerr << #x << " = " << x << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
// clear memory
#define CLR(a) memset((a), 0, sizeof(a))
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
int main(int argc, char const *argv[]) {
string words = "keyence";
string S;
CIN(S);
if (S == words) {
COUT("YES");
return 0;
}
for (int i = 0; i < (int)S.size(); i++) {
for (int j = 0; j < (int)S.size(); j++) {
S = "";
for (int k = 0; k < (int)S.size(); k++) {
if (i <= k && k <= j) {
continue;
} else {
S.push_back(words[k]);
}
}
if (S == words) {
COUT("YES");
return 0;
}
}
}
COUT("NO");
return 0;
}
| #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define COUT(x) cout << x << endl
#define CIN(x) cin >> x
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, n) FOR(i, 0, n)
#define EXIST(s, e) (s.find(e) != s.end())
#define SORT(c) sort(c.begin(), c.end())
#define ERASEUNIQE(v) v.erase(unique(v.begin(), v.end()), v.end())
// conversion
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
template <class T> inline T sqr(T x) { return x * x; }
// typedef
typedef long long LL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
// container util
#define ALL(c) c.begin(), c.end()
#define RALL(c) c.rbegin(), c.rend()
// constant
const double EPS = 1e-10;
const double PI = acos(-1.0);
// debug
#define dump(x) cerr << #x << " = " << x << endl;
#define debug(x) \
cerr << #x << " = " << x << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
// clear memory
#define CLR(a) memset((a), 0, sizeof(a))
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
int main(int argc, char const *argv[]) {
string words = "keyence";
string S;
CIN(S);
if (S == words) {
COUT("YES");
return 0;
}
for (int i = 0; i < (int)S.size(); i++) {
for (int j = 0; j < (int)S.size(); j++) {
string str = "";
for (int k = 0; k < (int)S.size(); k++) {
if (i <= k && k <= j) {
continue;
} else {
str.push_back(S[k]);
}
}
if (str == words) {
COUT("YES");
return 0;
}
}
}
COUT("NO");
return 0;
}
| [
"identifier.change",
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 949,129 | 949,128 | u180077477 | cpp |
p03150 | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(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, a) for (auto &(x) : (a))
typedef long long ll;
using namespace std;
int main(int argc, char const *argv[]) {
string s;
cin >> s;
int n = s.length();
bool f = false;
REP(i, n) REP(j, n + 1) {
string t = s.substr(0, i);
t = t + s.substr(i, j);
if (t == "keyence")
f = true;
}
if (f)
cout << "YES" << std::endl;
else
cout << "NO" << std::endl;
return 0;
} | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(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, a) for (auto &(x) : (a))
typedef long long ll;
using namespace std;
int main(int argc, char const *argv[]) {
string s;
cin >> s;
int n = s.length();
bool f = false;
REP(i, n) REP(j, n + 1) {
string t = s.substr(0, i);
t = t + s.substr(j);
if (t == "keyence")
f = true;
}
if (f)
cout << "YES" << std::endl;
else
cout << "NO" << std::endl;
return 0;
} | [
"call.arguments.change"
] | 949,130 | 949,131 | u102602414 | cpp |
p03150 | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(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, a) for (auto &(x) : (a))
typedef long long ll;
using namespace std;
int main(int argc, char const *argv[]) {
string s;
cin >> s;
int n = s.length();
bool f = false;
REP(i, n + 1) REP(j, n + 1) {
string t = s.substr(0, i);
t = t + s.substr(i, j);
if (t == "keyence")
f = true;
}
if (f)
cout << "YES" << std::endl;
else
cout << "NO" << std::endl;
return 0;
} | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(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, a) for (auto &(x) : (a))
typedef long long ll;
using namespace std;
int main(int argc, char const *argv[]) {
string s;
cin >> s;
int n = s.length();
bool f = false;
REP(i, n) REP(j, n + 1) {
string t = s.substr(0, i);
t = t + s.substr(j);
if (t == "keyence")
f = true;
}
if (f)
cout << "YES" << std::endl;
else
cout << "NO" << std::endl;
return 0;
} | [
"expression.operation.binary.remove",
"call.arguments.change"
] | 949,132 | 949,131 | u102602414 | cpp |
p03150 | #include <bits/stdc++.h>
#define pb push_back
#define S second
#define F first
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int cnt[10];
int32_t main() {
string a;
cin >> a;
int a1 = 0, b1 = 0;
string b = "keyence", c = "ecneyek";
for (int i = 0; i < 7; i++) {
if (a[i] = b[i])
a1++;
else
break;
}
int n = a.length() - 1;
for (int i = 0; i < 7; i++) {
if (c[i] = a[n - i])
b1++;
else
break;
}
if (a1 + b1 >= 7) {
cout << "YES" << endl;
} else
cout << "NO" << endl;
}
| #include <bits/stdc++.h>
#define pb push_back
#define S second
#define F first
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int cnt[10];
int32_t main() {
string a;
cin >> a;
int a1 = 0, b1 = 0;
string b = "keyence", c = "ecneyek";
for (int i = 0; i < 7; i++) {
if (a[i] == b[i])
a1++;
else
break;
}
int n = a.length() - 1;
for (int i = 0; i < 7; i++) {
if (c[i] == a[n - i])
b1++;
else
break;
}
if (a1 + b1 >= 7) {
cout << "YES" << endl;
} else
cout << "NO" << endl;
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 949,137 | 949,138 | u910859532 | cpp |
p03150 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
string s;
cin >> s;
string t = s;
bool flag = false;
int n = s.size();
for (int i = 0; i < n; i++) {
for (int j = 0; i + j < n; j++) {
s.erase(s.begin() + i, s.begin() + i + j);
if (s == "keyence") {
flag = true;
break;
} else
s = t;
}
}
if (flag)
cout << "Yes" << endl;
else
cout << "NO" << endl;
} | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
string s;
cin >> s;
string t = s;
bool flag = false;
int n = s.size();
for (int i = 0; i < n; i++) {
for (int j = 0; i + j < n; j++) {
s.erase(s.begin() + i, s.begin() + i + j);
if (s == "keyence") {
flag = true;
break;
} else
s = t;
}
}
if (flag)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 949,139 | 949,140 | u546943614 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string t = "keyence";
int i = 0;
while (s[i++] == t[0] && !t.empty())
t = t.substr(1);
s = s.size() - 1;
while (s[i--] == t[t.size() - 1] && !t.empty())
t = t.substr(0, t.size() - 1);
if (t.empty())
cout << "YES";
else
cout << "NO";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string t = "keyence";
int i = 0;
while (s[i++] == t[0] && !t.empty())
t = t.substr(1);
i = s.size() - 1;
while (s[i--] == t[t.size() - 1] && !t.empty())
t = t.substr(0, t.size() - 1);
if (!t.size())
cout << "YES";
else
cout << "NO";
} | [
"assignment.variable.change",
"identifier.change",
"expression.operation.unary.add",
"control_flow.branch.if.condition.change",
"call.function.change"
] | 949,155 | 949,156 | u515315348 | cpp |
p03150 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int main() {
string s;
cin >> s;
string answer = "keyence";
int size, i;
size = s.size();
if (s == answer) {
cout << "YES" << endl;
return 0;
}
if (size < 8) {
cout << "NO" << endl;
return 0;
}
for (i = 0; i < size; i++) {
string tmp;
tmp = s;
tmp.erase(tmp.begin() + i, tmp.begin() + i + size - 7);
// cout <<tmp <<endl;
if (tmp == answer) {
cout << "YES" << endl;
return 0;
}
}
cout << "NO" << endl;
return 0;
}
| #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int main() {
string s;
cin >> s;
string answer = "keyence";
int size, i;
size = s.size();
if (s == answer) {
cout << "YES" << endl;
return 0;
}
if (size < 8) {
cout << "NO" << endl;
return 0;
}
for (i = 0; i < 8; i++) {
string tmp;
tmp = s;
tmp.erase(tmp.begin() + i, tmp.begin() + i + size - 7);
// cout <<tmp <<endl;
if (tmp == answer) {
cout << "YES" << endl;
return 0;
}
}
cout << "NO" << endl;
return 0;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 949,159 | 949,160 | u032337012 | cpp |
p03150 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef unsigned long ul;
typedef long long ll;
typedef pair<ul, ul> P;
map<int, int> dp;
#define REP(i, n) for (int i = 0; i < n; i++)
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
ul H, W;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string S;
string answer = "keyence";
cin >> S;
ul n = S.size();
int pos = S.find(answer);
int pos_back = S.rfind(answer);
// cout <<pos <<endl;
// cout <<pos_back << " "<<n<<endl;
if (pos == 0 || pos_back == n - 7) {
cout << "YES" << endl;
return 0;
}
int i = 0;
while (S[i] == answer[i]) {
++i;
}
int j = 0;
while (S[n - 1 - j] == answer[6 - j]) {
++j;
}
if (i + j > 7) {
cout << "YES" << endl;
return 0;
}
cout << "NO" << endl;
return 0;
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef unsigned long ul;
typedef long long ll;
typedef pair<ul, ul> P;
map<int, int> dp;
#define REP(i, n) for (int i = 0; i < n; i++)
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
ul H, W;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string S;
string answer = "keyence";
cin >> S;
ul n = S.size();
int pos = S.find(answer);
int pos_back = S.rfind(answer);
// cout <<pos <<endl;
// cout <<pos_back << " "<<n<<endl;
if (pos == 0 || pos_back == n - 7) {
cout << "YES" << endl;
return 0;
}
int i = 0;
while (S[i] == answer[i]) {
++i;
}
int j = 0;
while (S[n - 1 - j] == answer[6 - j]) {
++j;
}
if (i + j >= 7) {
cout << "YES" << endl;
return 0;
}
cout << "NO" << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 949,186 | 949,187 | u276479653 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string k = "keyence";
int n = s.size();
int j = 0;
for (int i = 0; i < 7; i++) {
if (s.at(i) == k.at(i)) {
j++;
} else {
break;
}
}
if (j == 7) {
cout << "YES" << endl;
} else {
int i = 0;
while (i < 7 - j) {
if (s.at(n - 1 - i) != k.at(6 - i)) {
cout << "NO" << endl;
break;
}
if (i = 6 - j) {
cout << "YES" << endl;
break;
}
i++;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string k = "keyence";
int n = s.size();
int j = 0;
for (int i = 0; i < 7; i++) {
if (s.at(i) == k.at(i)) {
j++;
} else {
break;
}
}
if (j == 7) {
cout << "YES" << endl;
}
else {
int i = 0;
while (i < (7 - j)) {
if (s.at(n - 1 - i) != k.at(6 - i)) {
cout << "NO" << endl;
break;
}
if (i == (6 - j)) {
cout << "YES" << endl;
break;
}
i++;
}
}
} | [
"control_flow.loop.condition.change",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"control_flow.branch.if.condition.change"
] | 949,195 | 949,196 | u578035814 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string k = "keyence";
int n = s.size();
int j = 0;
for (int i = 0; i < n; i++) {
if (s.at(i) == k.at(i)) {
j++;
} else {
break;
}
}
if (j == 7) {
cout << "YES" << endl;
} else {
int i = 0;
while (i < 7 - j) {
if (s.at(n - 1 - i) != k.at(6 - i)) {
cout << "NO" << endl;
break;
}
if (i = 6 - j) {
cout << "YES" << endl;
break;
}
i++;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string k = "keyence";
int n = s.size();
int j = 0;
for (int i = 0; i < 7; i++) {
if (s.at(i) == k.at(i)) {
j++;
} else {
break;
}
}
if (j == 7) {
cout << "YES" << endl;
}
else {
int i = 0;
while (i < (7 - j)) {
if (s.at(n - 1 - i) != k.at(6 - i)) {
cout << "NO" << endl;
break;
}
if (i == (6 - j)) {
cout << "YES" << endl;
break;
}
i++;
}
}
} | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.loop.condition.change",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"control_flow.branch.if.condition.change"
] | 949,197 | 949,196 | u578035814 | cpp |
p03150 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
const int INT_INF = 2147483646;
const ll LL_INF = 9223372036854775807;
bool SecondCompare(const pair<int, int> &a, const pair<int, int> &b) {
return a.second < b.second;
}
bool SecondCompareDes(const pair<int, int> &a, const pair<int, int> &b) {
return a.second > b.second;
}
string s;
bool f = false, f2 = false;
string ans = "keyence";
int pos;
string kou;
int mem, po;
bool ok = true;
int main() {
cin >> s;
pos = 0;
if (s[0] == 'k') {
for (int i = 0; i < s.length(); i++) {
if (ans[pos] == s[i])
++pos;
else {
po = pos;
for (int j = i; j < s.length(); j++) {
if (s[j] == ans[pos]) {
++pos;
} else {
pos = po;
if (s[j] == ans[pos])
++pos;
}
if (pos == ans.length()) {
if (i == s.length() - 1) {
cout << "YES\n";
return 0;
}
pos = po;
}
}
break;
}
if (pos == ans.length()) {
cout << "YES\n";
return 0;
}
}
}
pos = ans.length() - 1;
for (int i = s.length() - 1; i >= 0; i--) {
if (s[i] == ans[pos]) {
--pos;
} else {
break;
}
if (pos == -1) {
cout << "YES\n";
return 0;
}
}
cout << "NO\n";
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
const int INT_INF = 2147483646;
const ll LL_INF = 9223372036854775807;
bool SecondCompare(const pair<int, int> &a, const pair<int, int> &b) {
return a.second < b.second;
}
bool SecondCompareDes(const pair<int, int> &a, const pair<int, int> &b) {
return a.second > b.second;
}
string s;
bool f = false, f2 = false;
string ans = "keyence";
int pos;
string kou;
int mem, po;
bool ok = true;
int main() {
cin >> s;
pos = 0;
if (s[0] == 'k') {
for (int i = 0; i < s.length(); i++) {
if (ans[pos] == s[i])
++pos;
else {
po = pos;
for (int j = i; j < s.length(); j++) {
if (s[j] == ans[pos]) {
++pos;
} else {
pos = po;
if (s[j] == ans[pos])
++pos;
}
if (pos == ans.length()) {
if (j == s.length() - 1) {
cout << "YES\n";
return 0;
}
pos = po;
}
}
break;
}
if (pos == ans.length()) {
cout << "YES\n";
return 0;
}
}
}
pos = ans.length() - 1;
for (int i = s.length() - 1; i >= 0; i--) {
if (s[i] == ans[pos]) {
--pos;
} else {
break;
}
if (pos == -1) {
cout << "YES\n";
return 0;
}
}
cout << "NO\n";
} | [
"control_flow.branch.if.condition.change"
] | 949,200 | 949,201 | u085486962 | cpp |
p03152 | #include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
const int INF = 1ll << 60;
const int MOD = 1e9 + 7;
#define dump(x) \
if (dbg) { \
cerr << #x << " = " << (x) << endl; \
}
#define overload4(_1, _2, _3, _4, name, ...) name
#define FOR1(n) for (ll i = 0; i < (n); ++i)
#define FOR2(i, n) for (ll i = 0; i < (n); ++i)
#define FOR3(i, a, b) for (ll i = (a); i < (b); ++i)
#define FOR4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FORR(i, a, b) for (int i = (a); i <= (b); ++i)
#define bit(n, k) ((n >> k) & 1) /*nのk bit目*/
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
} else
return 0;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
} else
return 0;
}
void Yes(bool flag = true) {
if (flag)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void No(bool flag = true) { Yes(!flag); }
void YES(bool flag = true) {
if (flag)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
void NO(bool flag = true) { YES(!flag); }
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(), (v).end()
#define SZ(x) ((int)(x).size())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vp vector<pair<int, int>>
#define vvp vector<vector<pair<int, int>>>
//#define P pair<int, int>
//#define V vector<int>
//#define S set<int>
#define itn int
#define asn ans
bool dbg = false;
template <uint MD> struct ModInt {
using M = ModInt;
const static M G;
uint v;
ModInt(ll _v = 0) { set_v(_v % MD + MD); }
M &set_v(uint _v) {
v = (_v < MD) ? _v : _v - MD;
return *this;
}
explicit operator bool() const { return v != 0; }
M operator-() const { return M() - *this; }
M operator+(const M &r) const { return M().set_v(v + r.v); }
M operator-(const M &r) const { return M().set_v(v + MD - r.v); }
M operator*(const M &r) const { return M().set_v(ull(v) * r.v % MD); }
M operator/(const M &r) const { return *this * r.inv(); }
M &operator+=(const M &r) { return *this = *this + r; }
M &operator-=(const M &r) { return *this = *this - r; }
M &operator*=(const M &r) { return *this = *this * r; }
M &operator/=(const M &r) { return *this = *this / r; }
bool operator==(const M &r) const { return v == r.v; }
M pow(ll n) const {
M x = *this, r = 1;
while (n) {
if (n & 1)
r *= x;
x *= x;
n >>= 1;
}
return r;
}
M inv() const { return pow(MD - 2); }
friend ostream &operator<<(ostream &os, const M &r) { return os << r.v; }
friend istream &operator>>(istream &is, M &r) { return is >> r.v; }
};
using Mint = ModInt<MOD>;
int N, M;
vi A, B;
void solve() {
Mint ans = 1;
int a = -1, b = -1;
for (int i = N * M - 1; i >= 0; i--) {
bool flaga = false, flagb = false;
if (a + 1 <= N - 1 && i == A[a + 1])
a++, flaga = 1;
if (b + 1 <= M - 1 && i == B[b + 1])
b++, flagb = 1;
if (!flaga && !flagb) {
ans *= Mint{1} * ((a + 1) * (b + 1) - (N * M - i - 1));
} else if (flaga && !flagb) {
ans *= b + 1;
} else if (!flaga && flagb)
ans *= a + 1;
}
cout << ans << endl;
}
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cin >> N >> M;
A.resize(N);
B.resize(N);
FOR(N)
cin >> A[i], A[i]--;
FOR(M)
cin >> B[i], B[i]--;
sort(all(A), greater<itn>());
sort(all(B), greater<itn>());
solve();
return 0;
}
| #include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
const int INF = 1ll << 60;
const int MOD = 1e9 + 7;
#define dump(x) \
if (dbg) { \
cerr << #x << " = " << (x) << endl; \
}
#define overload4(_1, _2, _3, _4, name, ...) name
#define FOR1(n) for (ll i = 0; i < (n); ++i)
#define FOR2(i, n) for (ll i = 0; i < (n); ++i)
#define FOR3(i, a, b) for (ll i = (a); i < (b); ++i)
#define FOR4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FORR(i, a, b) for (int i = (a); i <= (b); ++i)
#define bit(n, k) ((n >> k) & 1) /*nのk bit目*/
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
} else
return 0;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
} else
return 0;
}
void Yes(bool flag = true) {
if (flag)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void No(bool flag = true) { Yes(!flag); }
void YES(bool flag = true) {
if (flag)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
void NO(bool flag = true) { YES(!flag); }
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(), (v).end()
#define SZ(x) ((int)(x).size())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vp vector<pair<int, int>>
#define vvp vector<vector<pair<int, int>>>
//#define P pair<int, int>
//#define V vector<int>
//#define S set<int>
#define itn int
#define asn ans
bool dbg = false;
template <uint MD> struct ModInt {
using M = ModInt;
const static M G;
uint v;
ModInt(ll _v = 0) { set_v(_v % MD + MD); }
M &set_v(uint _v) {
v = (_v < MD) ? _v : _v - MD;
return *this;
}
explicit operator bool() const { return v != 0; }
M operator-() const { return M() - *this; }
M operator+(const M &r) const { return M().set_v(v + r.v); }
M operator-(const M &r) const { return M().set_v(v + MD - r.v); }
M operator*(const M &r) const { return M().set_v(ull(v) * r.v % MD); }
M operator/(const M &r) const { return *this * r.inv(); }
M &operator+=(const M &r) { return *this = *this + r; }
M &operator-=(const M &r) { return *this = *this - r; }
M &operator*=(const M &r) { return *this = *this * r; }
M &operator/=(const M &r) { return *this = *this / r; }
bool operator==(const M &r) const { return v == r.v; }
M pow(ll n) const {
M x = *this, r = 1;
while (n) {
if (n & 1)
r *= x;
x *= x;
n >>= 1;
}
return r;
}
M inv() const { return pow(MD - 2); }
friend ostream &operator<<(ostream &os, const M &r) { return os << r.v; }
friend istream &operator>>(istream &is, M &r) { return is >> r.v; }
};
using Mint = ModInt<MOD>;
int N, M;
vi A, B;
void solve() {
Mint ans = 1;
int a = -1, b = -1;
for (int i = N * M - 1; i >= 0; i--) {
bool flaga = false, flagb = false;
if (a + 1 <= N - 1 && i == A[a + 1])
a++, flaga = 1;
if (b + 1 <= M - 1 && i == B[b + 1])
b++, flagb = 1;
if (!flaga && !flagb) {
ans *= Mint{1} * ((a + 1) * (b + 1) - (N * M - i - 1));
} else if (flaga && !flagb) {
ans *= b + 1;
} else if (!flaga && flagb)
ans *= a + 1;
}
cout << ans << endl;
}
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cin >> N >> M;
A.resize(N);
B.resize(M);
FOR(N)
cin >> A[i], A[i]--;
FOR(M)
cin >> B[i], B[i]--;
sort(all(A), greater<itn>());
sort(all(B), greater<itn>());
solve();
return 0;
}
| [
"identifier.change",
"call.arguments.change"
] | 949,246 | 949,247 | u070600790 | cpp |
p03152 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> p_int;
typedef pair<ll, ll> p_ll;
typedef tuple<ll, ll, ll> t3_ll;
int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
int prime[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41,
43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97};
const ll inf = 1000000007;
ll n, m;
vector<ll> a, b;
ll solve() {
ll res = 1;
ll biggerA = 0, biggerB = 0;
for (int x = n * m; x > 0; x--) {
if (a[biggerA] > x)
return 0;
if (b[biggerB] > x)
return 0;
ll tmp = 1;
if (a[biggerA] == x && b[biggerB] == x) {
tmp = 1;
biggerA++;
biggerB++;
} else if (a[biggerA] == x) {
tmp = biggerA;
biggerA++;
} else if (b[biggerB] == x) {
tmp = biggerB;
biggerB++;
} else {
tmp = biggerA * biggerB - (n * m - x);
if (tmp <= 0)
return 0;
}
res = (res * tmp) % inf;
}
return res;
}
int main() {
cin >> n >> m;
a.resize(n + 1);
b.resize(m + 1);
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < m; i++)
cin >> b[i];
sort(a.begin(), a.end(), greater<ll>());
sort(b.begin(), b.end(), greater<ll>());
cout << solve() << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> p_int;
typedef pair<ll, ll> p_ll;
typedef tuple<ll, ll, ll> t3_ll;
int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
int prime[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41,
43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97};
const ll inf = 1000000007;
ll n, m;
vector<ll> a, b;
ll solve() {
ll res = 1;
ll biggerA = 0, biggerB = 0;
for (int x = n * m; x > 0; x--) {
if (a[biggerA] > x)
return 0;
if (b[biggerB] > x)
return 0;
ll tmp = 1;
if (a[biggerA] == x && b[biggerB] == x) {
tmp = 1;
biggerA++;
biggerB++;
} else if (a[biggerA] == x) {
tmp = biggerB;
biggerA++;
} else if (b[biggerB] == x) {
tmp = biggerA;
biggerB++;
} else {
tmp = biggerA * biggerB - (n * m - x);
if (tmp <= 0)
return 0;
}
res = (res * tmp) % inf;
}
return res;
}
int main() {
cin >> n >> m;
a.resize(n + 1);
b.resize(m + 1);
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < m; i++)
cin >> b[i];
sort(a.begin(), a.end(), greater<ll>());
sort(b.begin(), b.end(), greater<ll>());
cout << solve() << endl;
} | [
"assignment.value.change",
"identifier.change"
] | 949,258 | 949,259 | u764234894 | cpp |
p03152 | #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, a) for (auto &(x) : (a))
#define VECCIN(x) \
for (auto &youso_ : (x)) \
cin >> youso_
#define bitcnt(x) __builtin_popcount(x)
#define lbit(x) __builtin_ffsll(x)
#define rbit(x) (64 - __builtin_clzll(x))
#define fi first
#define se second
#define All(a) (a).begin(), (a).end()
#define rAll(a) (a).rbegin(), (a).rend()
#define cinfast() cin.tie(0), ios::sync_with_stdio(false)
#define PERM(c) \
sort(All(c)); \
for (bool cp = true; cp; cp = next_permutation(All(c)))
#define MKORDER(n) \
vector<int> od(n); \
iota(All(od), 0LL);
template <typename T = long long> inline T IN() {
T x;
cin >> x;
return (x);
}
inline void CIN() {}
template <class Head, class... Tail>
inline void CIN(Head &&head, Tail &&...tail) {
cin >> head;
CIN(move(tail)...);
}
template <class Head> inline void COUT(Head &&head) { cout << head << "\n"; }
template <class Head, class... Tail>
inline void COUT(Head &&head, Tail &&...tail) {
cout << head << " ";
COUT(forward<Tail>(tail)...);
}
#define CCIN(...) \
char __VA_ARGS__; \
CIN(__VA_ARGS__)
#define DCIN(...) \
double __VA_ARGS__; \
CIN(__VA_ARGS__)
#define LCIN(...) \
long long __VA_ARGS__; \
CIN(__VA_ARGS__)
#define SCIN(...) \
string __VA_ARGS__; \
CIN(__VA_ARGS__)
#define Printv(v) \
{ \
FOREACH(x, v) { cout << x << " "; } \
cout << "\n"; \
}
template <typename T = string> inline void eputs(T s) {
cout << s << "\n";
exit(0);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
// generic lambdas
template <typename F>
#if defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)
[[nodiscard]]
#elif defined(__GNUC__) && \
(__GNUC__ > 3 || __GNUC__ == 3 && __GNUC_MINOR__ >= 4)
__attribute__((warn_unused_result))
#endif // defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)
static inline constexpr decltype(auto)
fix(F &&f) noexcept {
return [f = std::forward<F>(f)](auto &&...args) {
return f(f, std::forward<decltype(args)>(args)...);
};
}
template <typename T> using PQG = priority_queue<T, vector<T>, greater<T>>;
template <typename T> using PQ = priority_queue<T>;
typedef long long ll;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<ll, ll> PL;
typedef vector<PL> VPL;
typedef vector<bool> VB;
typedef vector<double> VD;
typedef vector<string> VS;
const int INF = 1e9;
const int MOD = 1e9 + 7;
// const int MOD = 998244353;
const ll LINF = 1e18;
const ll dw[] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dh[] = {0, 1, 1, 1, 0, -1, -1, -1};
#define PI 3.141592653589793238
// 1000000007 で割ったあまりを扱う構造体
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
v += MOD;
}
constexpr int getmod() { return MOD; }
constexpr Fp operator-() const noexcept { return val ? MOD - val : 0; }
constexpr Fp operator+(const Fp &r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator-(const Fp &r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator*(const Fp &r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator/(const Fp &r) const noexcept { return Fp(*this) /= r; }
constexpr Fp &operator+=(const Fp &r) noexcept {
val += r.val;
if (val >= MOD)
val -= MOD;
return *this;
}
constexpr Fp &operator-=(const Fp &r) noexcept {
val -= r.val;
if (val < 0)
val += MOD;
return *this;
}
constexpr Fp &operator*=(const Fp &r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr Fp &operator/=(const Fp &r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
constexpr bool operator==(const Fp &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const Fp &r) const noexcept {
return this->val != r.val;
}
friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr istream &operator>>(istream &is, Fp<MOD> &x) noexcept {
return is >> x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
using mint = Fp<MOD>;
signed main() {
LCIN(N, M);
VL A(N), B(M);
VECCIN(A);
VECCIN(B);
A.emplace_back(-LINF);
B.emplace_back(-LINF);
sort(All(A)), sort(All(B));
A.erase(unique(All(A)), A.end());
B.erase(unique(All(B)), B.end());
if (A.size() != N || B.size() != M)
eputs(0);
ll w = 0, h = 0;
mint ans = 1;
FORR(i, N * M, 1) {
if (*A.rbegin() == i && *B.rbegin() == i) {
h++, w++;
A.pop_back(), B.pop_back();
} else if (*A.rbegin() == i) {
h++;
A.pop_back();
ans *= w;
} else if (*B.rbegin() == i) {
w++;
B.pop_back();
ans *= h;
} else {
mint sum = max(0LL, h * w - (N * M - i));
ans *= sum;
}
if (ans == 0)
break;
}
cout << ans << "\n";
}
| #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, a) for (auto &(x) : (a))
#define VECCIN(x) \
for (auto &youso_ : (x)) \
cin >> youso_
#define bitcnt(x) __builtin_popcount(x)
#define lbit(x) __builtin_ffsll(x)
#define rbit(x) (64 - __builtin_clzll(x))
#define fi first
#define se second
#define All(a) (a).begin(), (a).end()
#define rAll(a) (a).rbegin(), (a).rend()
#define cinfast() cin.tie(0), ios::sync_with_stdio(false)
#define PERM(c) \
sort(All(c)); \
for (bool cp = true; cp; cp = next_permutation(All(c)))
#define MKORDER(n) \
vector<int> od(n); \
iota(All(od), 0LL);
template <typename T = long long> inline T IN() {
T x;
cin >> x;
return (x);
}
inline void CIN() {}
template <class Head, class... Tail>
inline void CIN(Head &&head, Tail &&...tail) {
cin >> head;
CIN(move(tail)...);
}
template <class Head> inline void COUT(Head &&head) { cout << head << "\n"; }
template <class Head, class... Tail>
inline void COUT(Head &&head, Tail &&...tail) {
cout << head << " ";
COUT(forward<Tail>(tail)...);
}
#define CCIN(...) \
char __VA_ARGS__; \
CIN(__VA_ARGS__)
#define DCIN(...) \
double __VA_ARGS__; \
CIN(__VA_ARGS__)
#define LCIN(...) \
long long __VA_ARGS__; \
CIN(__VA_ARGS__)
#define SCIN(...) \
string __VA_ARGS__; \
CIN(__VA_ARGS__)
#define Printv(v) \
{ \
FOREACH(x, v) { cout << x << " "; } \
cout << "\n"; \
}
template <typename T = string> inline void eputs(T s) {
cout << s << "\n";
exit(0);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
// generic lambdas
template <typename F>
#if defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)
[[nodiscard]]
#elif defined(__GNUC__) && \
(__GNUC__ > 3 || __GNUC__ == 3 && __GNUC_MINOR__ >= 4)
__attribute__((warn_unused_result))
#endif // defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)
static inline constexpr decltype(auto)
fix(F &&f) noexcept {
return [f = std::forward<F>(f)](auto &&...args) {
return f(f, std::forward<decltype(args)>(args)...);
};
}
template <typename T> using PQG = priority_queue<T, vector<T>, greater<T>>;
template <typename T> using PQ = priority_queue<T>;
typedef long long ll;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<ll, ll> PL;
typedef vector<PL> VPL;
typedef vector<bool> VB;
typedef vector<double> VD;
typedef vector<string> VS;
const int INF = 1e9;
const int MOD = 1e9 + 7;
// const int MOD = 998244353;
const ll LINF = 1e18;
const ll dw[] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dh[] = {0, 1, 1, 1, 0, -1, -1, -1};
#define PI 3.141592653589793238
// 1000000007 で割ったあまりを扱う構造体
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
v += MOD;
}
constexpr int getmod() { return MOD; }
constexpr Fp operator-() const noexcept { return val ? MOD - val : 0; }
constexpr Fp operator+(const Fp &r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator-(const Fp &r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator*(const Fp &r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator/(const Fp &r) const noexcept { return Fp(*this) /= r; }
constexpr Fp &operator+=(const Fp &r) noexcept {
val += r.val;
if (val >= MOD)
val -= MOD;
return *this;
}
constexpr Fp &operator-=(const Fp &r) noexcept {
val -= r.val;
if (val < 0)
val += MOD;
return *this;
}
constexpr Fp &operator*=(const Fp &r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr Fp &operator/=(const Fp &r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
constexpr bool operator==(const Fp &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const Fp &r) const noexcept {
return this->val != r.val;
}
friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr istream &operator>>(istream &is, Fp<MOD> &x) noexcept {
return is >> x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
using mint = Fp<MOD>;
signed main() {
LCIN(N, M);
VL A(N), B(M);
VECCIN(A);
VECCIN(B);
A.emplace_back(-LINF);
B.emplace_back(-LINF);
sort(All(A)), sort(All(B));
A.erase(unique(All(A)), A.end());
B.erase(unique(All(B)), B.end());
if (A.size() != N + 1 || B.size() != M + 1)
eputs(0);
ll w = 0, h = 0;
mint ans = 1;
FORR(i, N * M, 1) {
if (*A.rbegin() == i && *B.rbegin() == i) {
h++, w++;
A.pop_back(), B.pop_back();
} else if (*A.rbegin() == i) {
h++;
A.pop_back();
ans *= w;
} else if (*B.rbegin() == i) {
w++;
B.pop_back();
ans *= h;
} else {
mint sum = max(0LL, h * w - (N * M - i));
ans *= sum;
}
if (ans == 0)
break;
}
cout << ans << "\n";
}
| [
"control_flow.branch.if.condition.change"
] | 949,280 | 949,281 | u139031151 | cpp |
p03152 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define INF 10e17 // 4倍しても(4回足しても)long longを溢れない
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep_r(i, n, m) for (int i = m; i < n; i++)
#define END cout << endl
#define MOD 1000000007
#define pb push_back
#define sorti(x) sort(x.begin(), x.end())
#define sortd(x) sort(x.begin(), x.end(), std::greater<int>())
void mul(ll &a, ll &b) { a = a * b % MOD; }
int main() {
int n, m;
cin >> n >> m;
vector<ll> a(n), b(n);
rep(i, n) cin >> a[i];
rep(i, m) cin >> b[i];
sortd(a);
sortd(b);
a.pb(-1);
b.pb(-1);
ll apt = 0, bpt = 0, num = n * m;
ll ans = 1;
while (num > 0) {
if (a[apt] == num and b[bpt] == num) {
apt++;
bpt++;
} else if (a[apt] == num) {
apt++;
mul(ans, bpt);
} else if (b[bpt] == num) {
bpt++;
mul(ans, apt);
} else {
ll tmp = apt * bpt - (n * m - num);
mul(ans, tmp);
}
num -= 1;
}
cout << ans << endl;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define INF 10e17 // 4倍しても(4回足しても)long longを溢れない
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep_r(i, n, m) for (int i = m; i < n; i++)
#define END cout << endl
#define MOD 1000000007
#define pb push_back
#define sorti(x) sort(x.begin(), x.end())
#define sortd(x) sort(x.begin(), x.end(), std::greater<int>())
void mul(ll &a, ll &b) { a = a * b % MOD; }
int main() {
int n, m;
cin >> n >> m;
vector<ll> a(n), b(m);
rep(i, n) cin >> a[i];
rep(i, m) cin >> b[i];
sortd(a);
sortd(b);
a.pb(-1);
b.pb(-1);
ll apt = 0, bpt = 0, num = n * m;
ll ans = 1;
while (num > 0) {
if (a[apt] == num and b[bpt] == num) {
apt++;
bpt++;
} else if (a[apt] == num) {
apt++;
mul(ans, bpt);
} else if (b[bpt] == num) {
bpt++;
mul(ans, apt);
} else {
ll tmp = apt * bpt - (n * m - num);
mul(ans, tmp);
}
num -= 1;
}
cout << ans << endl;
}
| [] | 949,350 | 949,351 | u898749314 | cpp |
p03155 | #include <bits/stdc++.h>
#define ll long long int
#define c(a) \
ll a; \
cin >> a;
#define cs(a) \
string a; \
cin >> a;
#define ci(a) cin >> a;
#define co(a) cout << a;
#define nl cout << endl;
#define ca(arr, n) \
for (ll i = 0; i < n; i++) \
cin >> arr[i];
#define f0(i, a, n) for (ll i = a; i >= n; i--)
#define f(i, n) for (ll i = 0; i < n; i++)
#define f1(i, a, n) for (ll i = a; i < n; i++)
#define T \
ll t = 1; \
cin >> t; \
while (t--)
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using namespace std;
int main() {
fast;
c(n) c(h) c(w) cout << (n - h + 1) * (n - w - 1) << endl;
return 0;
}
/*It's not who I am underneath, but what I do that defines me
MMMMMMMMMMMMMMMMMMMMM. MMMMMMMMMMMMMMMMMMMMM
`MMMMMMMMMMMMMMMMMMMM M\ /M MMMMMMMMMMMMMMMMMMMM'
`MMMMMMMMMMMMMMMMMMM MMMMMM MMMMMMMMMMMMMMMMMMM'
MMMMMMMMMMMMMMMMMMM-_______MMMMMMMM_______-MMMMMMMMMMMMMMMMMMM
MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM
MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM
MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM
.MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM.
MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM
`MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM'
`MMMMMMMMMMMMMMMMMM'
`MMMMMMMMMM'
MMMMMM
MMMM
MM
*/
| #include <bits/stdc++.h>
#define ll long long int
#define c(a) \
ll a; \
cin >> a;
#define cs(a) \
string a; \
cin >> a;
#define ci(a) cin >> a;
#define co(a) cout << a;
#define nl cout << endl;
#define ca(arr, n) \
for (ll i = 0; i < n; i++) \
cin >> arr[i];
#define f0(i, a, n) for (ll i = a; i >= n; i--)
#define f(i, n) for (ll i = 0; i < n; i++)
#define f1(i, a, n) for (ll i = a; i < n; i++)
#define T \
ll t = 1; \
cin >> t; \
while (t--)
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using namespace std;
int main() {
fast;
c(n) c(h) c(w) cout << (n - h + 1) * (n - w + 1) << endl;
return 0;
}
/*It's not who I am underneath, but what I do that defines me
MMMMMMMMMMMMMMMMMMMMM. MMMMMMMMMMMMMMMMMMMMM
`MMMMMMMMMMMMMMMMMMMM M\ /M MMMMMMMMMMMMMMMMMMMM'
`MMMMMMMMMMMMMMMMMMM MMMMMM MMMMMMMMMMMMMMMMMMM'
MMMMMMMMMMMMMMMMMMM-_______MMMMMMMM_______-MMMMMMMMMMMMMMMMMMM
MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM
MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM
MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM
.MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM.
MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM
`MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM'
`MMMMMMMMMMMMMMMMMM'
`MMMMMMMMMM'
MMMMMM
MMMM
MM
*/
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 949,356 | 949,357 | u576357372 | cpp |
p03155 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (a - b) + 1 * (a - c + 1) << endl;
return 0;
}
| #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (a - b + 1) * (a - c + 1) << endl;
return 0;
}
| [] | 949,362 | 949,363 | u730499268 | cpp |
p03155 | const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vector<int>> G;
#define forn(i, n) for (int(i) = 0; (i) != (n); (i)++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define fi first
#define se second
#define re return
#define pb push_back
#define uniq(x) \
sort(all(x)); \
(x).resize(unique(all(x)) - (x).begin())
#ifdef LOCAL
#define dbg(x) cerr << __LINE__ << " " << #x << " " << x << endl
#define ln cerr << __LINE__ << endl
#else
#define dbg(x) void(0)
#define ln void(0)
#endif // LOCAL
int cx[4] = {-1, 0, 1, 0};
int cy[4] = {0, -1, 0, 1};
string Ans[2] = {"No", "Yes"};
string ANS[2] = {"NO", "YES"};
ll inq(ll x, ll y) {
if (!y)
re 1 % MOD;
ll l = inq(x, y / 2);
if (y % 2)
re l *l % MOD *x % MOD;
re l *l % MOD;
}
ll rev(ll x) { return inq(x, MOD - 2); }
bool __precomputed_combinatorics = 0;
vector<ll> __fact, __ufact, __rev;
void __precompute_combinatorics() {
__precomputed_combinatorics = 1;
__fact.resize(FN);
__ufact.resize(FN);
__rev.resize(FN);
__rev[1] = 1;
for (int i = 2; i < FN; i++)
__rev[i] = MOD - __rev[MOD % i] * (MOD / i) % MOD;
__fact[0] = 1, __ufact[0] = 1;
for (int i = 1; i < FN; i++)
__fact[i] = __fact[i - 1] * i % MOD,
__ufact[i] = __ufact[i - 1] * __rev[i] % MOD;
}
ll fact(int x) {
if (!__precomputed_combinatorics)
__precompute_combinatorics();
return __fact[x];
}
ll cnk(int n, int k) {
if (k < 0 || k > n)
return 0;
if (!__precomputed_combinatorics)
__precompute_combinatorics();
return __fact[n] * __ufact[n - k] % MOD * __ufact[k] % MOD;
}
int Root(int x, vector<int> &root) {
if (x == root[x])
return x;
return root[x] = Root(root[x], root);
}
void Merge(int v, int u, vector<int> &root, vector<int> &sz) {
v = Root(v, root), u = Root(u, root);
if (v == u)
return;
if (sz[v] < sz[u]) {
sz[u] += sz[v];
root[v] = u;
} else {
sz[v] += sz[u];
root[u] = v;
}
}
int ok(int x, int n) { return 0 <= x && x < n; }
void bfs(int v, vi &dist, vector<vi> &graph) {
fill(all(dist), -1);
dist[v] = 0;
vi q = {v};
for (int i = 0; i < q.size(); i++) {
for (auto u : graph[q[i]]) {
if (dist[u] == -1) {
dist[u] = dist[q[i]] + 1;
q.push_back(u);
}
}
}
}
int t;
void dfs(int v, int p, G &graph, vi &in, vi &up) {
up[v] = in[v] = t;
t++;
for (auto u : graph[v]) {
if (u == p)
continue;
if (in[u] == 0) {
dfs(u, v, graph, in, up);
}
up[v] = min(up[v], up[u]);
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int a, b, c;
cin >> a >> b >> c;
cout << (c - a + 1) * (c - b + 1);
}
/* Note:
Check constants at the beginning of the code.
N is set to 4e5 but be careful in problems with large constant factor.
Setting N in every problem is more effective.
Check corner cases.
N = 1
No def int long long for now.
Add something here.
*/
| const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vector<int>> G;
#define forn(i, n) for (int(i) = 0; (i) != (n); (i)++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define fi first
#define se second
#define re return
#define pb push_back
#define uniq(x) \
sort(all(x)); \
(x).resize(unique(all(x)) - (x).begin())
#ifdef LOCAL
#define dbg(x) cerr << __LINE__ << " " << #x << " " << x << endl
#define ln cerr << __LINE__ << endl
#else
#define dbg(x) void(0)
#define ln void(0)
#endif // LOCAL
int cx[4] = {-1, 0, 1, 0};
int cy[4] = {0, -1, 0, 1};
string Ans[2] = {"No", "Yes"};
string ANS[2] = {"NO", "YES"};
ll inq(ll x, ll y) {
if (!y)
re 1 % MOD;
ll l = inq(x, y / 2);
if (y % 2)
re l *l % MOD *x % MOD;
re l *l % MOD;
}
ll rev(ll x) { return inq(x, MOD - 2); }
bool __precomputed_combinatorics = 0;
vector<ll> __fact, __ufact, __rev;
void __precompute_combinatorics() {
__precomputed_combinatorics = 1;
__fact.resize(FN);
__ufact.resize(FN);
__rev.resize(FN);
__rev[1] = 1;
for (int i = 2; i < FN; i++)
__rev[i] = MOD - __rev[MOD % i] * (MOD / i) % MOD;
__fact[0] = 1, __ufact[0] = 1;
for (int i = 1; i < FN; i++)
__fact[i] = __fact[i - 1] * i % MOD,
__ufact[i] = __ufact[i - 1] * __rev[i] % MOD;
}
ll fact(int x) {
if (!__precomputed_combinatorics)
__precompute_combinatorics();
return __fact[x];
}
ll cnk(int n, int k) {
if (k < 0 || k > n)
return 0;
if (!__precomputed_combinatorics)
__precompute_combinatorics();
return __fact[n] * __ufact[n - k] % MOD * __ufact[k] % MOD;
}
int Root(int x, vector<int> &root) {
if (x == root[x])
return x;
return root[x] = Root(root[x], root);
}
void Merge(int v, int u, vector<int> &root, vector<int> &sz) {
v = Root(v, root), u = Root(u, root);
if (v == u)
return;
if (sz[v] < sz[u]) {
sz[u] += sz[v];
root[v] = u;
} else {
sz[v] += sz[u];
root[u] = v;
}
}
int ok(int x, int n) { return 0 <= x && x < n; }
void bfs(int v, vi &dist, vector<vi> &graph) {
fill(all(dist), -1);
dist[v] = 0;
vi q = {v};
for (int i = 0; i < q.size(); i++) {
for (auto u : graph[q[i]]) {
if (dist[u] == -1) {
dist[u] = dist[q[i]] + 1;
q.push_back(u);
}
}
}
}
int t;
void dfs(int v, int p, G &graph, vi &in, vi &up) {
up[v] = in[v] = t;
t++;
for (auto u : graph[v]) {
if (u == p)
continue;
if (in[u] == 0) {
dfs(u, v, graph, in, up);
}
up[v] = min(up[v], up[u]);
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int a, b, c;
cin >> c >> a >> b;
cout << (c - a + 1) * (c - b + 1);
}
/* Note:
Check constants at the beginning of the code.
N is set to 4e5 but be careful in problems with large constant factor.
Setting N in every problem is more effective.
Check corner cases.
N = 1
No def int long long for now.
Add something here.
*/
| [
"expression.operation.binary.remove"
] | 949,364 | 949,365 | u798339690 | cpp |
p03155 | // include
// ------------------------------------------------
#include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <vector>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
int getDigit(long long n); // 数字の桁数を取得する。
string upper(string str); // 英字を大文字に変換する。
string lower(string str); // 英字を小文字に変換する。
// define
// ------------------------------------------------
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define sz(a) int((a).size())
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repe(i, n) for (int(i) = 0; (i) <= (n); (i)++)
#define vsort(v) sort((v).begin(), (v).end())
#define rvsort(v) sort(rall((v)))
#define vi vector<int>
#define GCD(a, b) __gcd((a), (b))
#define LCM(a, b) (a) / GCD((a), (b)) * (b)
#define kiriage(a, b) ((a) + (b)-1) / (b)
const int INF = 1e9;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vll;
// code
// ------------------------------------------------
int main() {
ll n, h, w;
cin >> n >> h >> w;
cout << (n - h) * (n - w) << endl;
return 0;
}
// funcの実体
// ------------------------------------------------
int getDigit(ll n) {
int i = 1;
while (1) {
n = n / 10;
if (n == 0)
break;
i++;
}
return i;
}
int CalcSumOfDigit(int n) {
int s = 0;
while (n) {
s += n % 10;
n = n / 10;
}
return s;
}
string upper(string str) {
for (auto itr = str.begin(); itr != str.end(); itr++) {
if (97 <= *itr && *itr <= 122) {
*itr = *itr - 32;
}
}
return str;
}
string lower(string str) {
for (auto itr = str.begin(); itr != str.end(); itr++) {
if (65 <= *itr && *itr <= 90) {
*itr = *itr + 32;
}
}
return str;
}
| // include
// ------------------------------------------------
#include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <vector>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
int getDigit(long long n); // 数字の桁数を取得する。
string upper(string str); // 英字を大文字に変換する。
string lower(string str); // 英字を小文字に変換する。
// define
// ------------------------------------------------
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define sz(a) int((a).size())
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repe(i, n) for (int(i) = 0; (i) <= (n); (i)++)
#define vsort(v) sort((v).begin(), (v).end())
#define rvsort(v) sort(rall((v)))
#define vi vector<int>
#define GCD(a, b) __gcd((a), (b))
#define LCM(a, b) (a) / GCD((a), (b)) * (b)
#define kiriage(a, b) ((a) + (b)-1) / (b)
const int INF = 1e9;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vll;
// code
// ------------------------------------------------
int main() {
ll n, h, w;
cin >> n >> h >> w;
cout << (n - h + 1) * (n - w + 1) << endl;
return 0;
}
// funcの実体
// ------------------------------------------------
int getDigit(ll n) {
int i = 1;
while (1) {
n = n / 10;
if (n == 0)
break;
i++;
}
return i;
}
int CalcSumOfDigit(int n) {
int s = 0;
while (n) {
s += n % 10;
n = n / 10;
}
return s;
}
string upper(string str) {
for (auto itr = str.begin(); itr != str.end(); itr++) {
if (97 <= *itr && *itr <= 122) {
*itr = *itr - 32;
}
}
return str;
}
string lower(string str) {
for (auto itr = str.begin(); itr != str.end(); itr++) {
if (65 <= *itr && *itr <= 90) {
*itr = *itr + 32;
}
}
return str;
}
| [
"expression.operation.binary.add"
] | 949,370 | 949,371 | u610897920 | cpp |
p03155 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
signed main() {
int n, h, w;
cin >> n >> h >> w;
cout << (n - h + 1) * (n - w * 1) << endl;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
signed main() {
int n, h, w;
cin >> n >> h >> w;
cout << (n - h + 1) * (n - w + 1) << endl;
}
| [
"expression.operator.arithmetic.change",
"io.output.change"
] | 949,372 | 949,373 | u141968173 | cpp |
p03155 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, H, W;
cin >> N >> H >> W;
cout << (N - H + 1) * (N - W - 1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, H, W;
cin >> N >> H >> W;
cout << (N - H + 1) * (N - W + 1) << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 949,374 | 949,375 | u280120599 | cpp |
p03155 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF (1ll << 60)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
using vl = vector<ll>;
using vvl = vector<vl>;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int MOD = 1000000007;
using ll = long long;
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;
}
void print(const std::vector<int> &v) {
std::for_each(v.begin(), v.end(), [](int x) { std::cout << x << " "; });
std::cout << std::endl;
}
int main() {
int N, H, W;
cin >> N >> H >> W;
cout << (H - N + 1) * (W - N + 1) << endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF (1ll << 60)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
using vl = vector<ll>;
using vvl = vector<vl>;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int MOD = 1000000007;
using ll = long long;
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;
}
void print(const std::vector<int> &v) {
std::for_each(v.begin(), v.end(), [](int x) { std::cout << x << " "; });
std::cout << std::endl;
}
int main() {
int N, H, W;
cin >> N >> H >> W;
cout << (H - N - 1) * (W - N - 1) << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 949,390 | 949,391 | u824337972 | cpp |
p03155 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, h, w;
cin >> n >> h >> w;
cout << (n - h) * (n - w) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, h, w;
cin >> n >> h >> w;
cout << (n - h + 1) * (n - w + 1) << endl;
} | [
"expression.operation.binary.add"
] | 949,392 | 949,393 | u431125128 | cpp |
p03155 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, w, h;
cin >> n >> w >> h;
cout << (n - w) * (n - h) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, w, h;
cin >> n >> w >> h;
cout << (n - w + 1) * (n - h + 1) << endl;
} | [
"expression.operation.binary.add"
] | 949,394 | 949,395 | u091552241 | cpp |
p03155 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define pb push_back
#define eb emplace_back
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 50;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
void solve() {
int n, h, w;
cin >> n >> h >> w;
cout << (n - h + 1) * (n - w * 1) << "\n";
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
solve();
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define pb push_back
#define eb emplace_back
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 50;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
void solve() {
int n, h, w;
cin >> n >> h >> w;
cout << (n - h + 1) * (n - w + 1) << "\n";
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
solve();
return 0;
} | [
"expression.operator.arithmetic.change",
"io.output.change"
] | 949,396 | 949,397 | u698883164 | cpp |
p03155 | #include <iostream>
using namespace std;
int main(void) {
int a, b, c;
string s;
cin >> a >> b >> c;
cout << (a - b - 1) * (a - c - 1);
} | #include <iostream>
using namespace std;
int main(void) {
int a, b, c;
string s;
cin >> a >> b >> c;
cout << (a - (b - 1)) * (a - (c - 1));
} | [] | 949,398 | 949,399 | u259356079 | cpp |
p03152 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <iostream>
#include <math.h>
#include <numeric>
#include <regex>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using dbl = double;
using pii = pair<int, int>;
using pl4 = pair<ll, ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
using vvs = vector<vs>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vpii = vector<pii>;
using vvpii = vector<vpii>;
using vpl4 = vector<pl4>;
using vvpl4 = vector<vpl4>;
using vd = vector<dbl>;
using vvd = vector<vd>;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pob pop_back()
#define pf push_front
#define pof pop_front()
#define sz size()
#define bgn begin()
#define en end()
#define asn assign
#define emp empty()
#define fr front()
#define bk back()
#define clr clear()
#define ins insert
#define ers erase
#define res resize
#define tp top()
#define p_q priority_queue
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rFOR(i, a, b) for (int i = (b); i >= (a); i--)
#define REP(i, a) FOR((i), 0, (a)-1)
#define REP0(i, a) FOR((i), 0, (a))
#define REP1(i, a) FOR((i), 1, (a))
#define rREP(i, a) rFOR((i), 0, (a)-1)
#define rREP0(i, a) rFOR((i), 0, (a))
#define rREP1(i, a) rFOR((i), 1, (a))
#define ROR(v, i) for (auto &(i) : (v))
#define IOTA(a, n) iota((a).bgn, (a).en, (n))
#define SORT(a) sort((a).bgn, (a).en)
#define rSORT(a) sort((a).rbegin(), (a).rend())
#define UNIQUE(a) (a).erase(unique((a).bgn, (a).en), (a).en)
#define PREVP(a) prev_permutation((a).bgn, (a).en)
#define NEXTP(a) next_permutation((a).bgn, (a).en)
#define BINS(a, b) binary_search((a).bgn, (a).en, (b))
#define LOWB(a, b) (lower_bound((a).bgn, (a).en, (b)) - (a).bgn)
#define UPB(a, b) (upper_bound((a).bgn, (a).en, (b)) - (a).bgn)
#define CNT(a, b) count((a).bgn, (a).en, b)
#define SUM(a) accumulate((a).bgn, (a).en, 0)
#define REV(a) reverse((a).bgn, (a).en)
#define REGS(a, b) regex_search((a), regex(b))
#define REGM(a, b) regex_match((a), regex(b))
#define yn(a) cout << ((a) ? "yes" : "no") << endl;
#define Yn(a) cout << ((a) ? "Yes" : "No") << endl;
#define YN(a) cout << ((a) ? "YES" : "NO") << endl;
#define Imp(a) cout << ((a) ? "Possible" : "Impossible") << endl;
#define IMP(a) cout << ((a) ? "POSSIBLE" : "IMPOSSIBLE") << endl;
#define say(a) cout << (a);
#define sal(a) cout << (a) << endl;
#define sak cout << endl;
#define sas cout << " ";
#define sat cout << "\t";
#define dbg(a) cout << (#a) << ": " << (a) << endl;
#define c2l(a) ((ll)(a - 48))
#define a2l(a) ((ll)(a - 97))
#define A2l(a) ((ll)(a - 65))
#define l2c(a) ((char)(a + 48))
#define l2a(a) ((char)(a + 97))
#define l2A(a) ((char)(a + 65))
#define DigN2(a) ((llabs(a) == 0) ? (1) : ((ll)(log2(double(llabs(a)))) + 1))
#define DigN10(a) ((llabs(a) == 0) ? (1) : ((ll)(log10(double(llabs(a)))) + 1))
#define Dig2(a, b) (((a) >> (b)) & 1)
#define Dig10(a, b) (ll)(((a) / ((ll)(pow(10.0, (double)(b))))) % 10)
#define Pow2(a) (1 << (a))
#define Pow10(a) ((ll)(pow(10.0, double(a))))
#define LSB(a) ((a) & (-(a)))
#define llin(a) \
ll(a); \
cin >> (a);
#define stin(a) \
string(a); \
cin >> (a);
#define vin(v) \
ROR((v), (i)) { cin >> (i); };
#define vllin(v, N) \
vll(v)((N)); \
vin(v);
#define vsin(v, N) \
vs(v)((N)); \
vin(v);
#define rdn(a, b) ((a) / (b))
#define rou(a, b) \
((((double(a) / double(b)) - ((a) / (b))) < 0.5) ? ((a) / (b)) \
: (((a) / (b)) + 1))
#define rup(a, b) ((((a) % (b)) == 0) ? ((a) / (b)) : (((a) / (b)) + 1))
#define min(a, b) ((a < b) ? (a) : (b))
#define max(a, b) ((a > b) ? (a) : (b))
#define powll(a, b) (ll)(pow((double)(a), (double)(b)))
#define Triangle(x1, y1, x2, y2, x3, y3) \
(((x1) - (x2)) * ((y1) - (y3)) - ((x1) - (x3)) * ((y1) - (y2)))
#define int ll
const ll MOD = 1e9 + 7;
const ll N = 1e5 + 20;
// const ll MOD = 998244353;
// const ll MOD = 9007199254740881;
const ll INF = 1LL << 60;
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
class BIT {
public:
vll d;
vll v;
ll size;
BIT(ll sizeget) {
size = sizeget;
d.asn(size + 1, 0);
v.asn(size, 0);
}
BIT(vll cpyvec) { copy(cpyvec); }
void add(ll index, ll num) {
// if (index < 0) return false;
// if (index >= size) return false;
v[index] += num;
index++;
while (index <= size) {
d[index] += num;
index += LSB(index);
}
// return true;
return;
}
ll sum(ll index = INF) {
index++;
index = min(index, size);
ll ans = 0;
while (index) {
ans += d[index];
index -= LSB(index);
}
return ans;
}
void copy(vll cpyvec) {
size = cpyvec.sz;
d.asn(size + 1, 0);
v.asn(size, 0);
REP(i, size) add(i, cpyvec[i]);
}
};
class UFT {
public:
ll size;
ll mode;
vll root;
vll rank;
UFT(ll sizeget, ll modeget = 0) {
size = sizeget;
mode = modeget;
root.res(size, 0);
if (!mode)
rank.res(size, 0);
IOTA(root, 0);
}
ll find(ll x) { return root[x] == x ? x : root[x] = find(root[x]); }
bool same(ll x, ll y) { return find(x) == find(y); }
void unite(ll x, ll y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (mode)
root[y] = x;
else {
if (rank[x] < rank[y]) {
root[x] = y;
} else {
root[y] = x;
if (rank[x] == rank[y])
rank[x]++;
}
}
}
};
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll inverse[N];
void init_inverse() {
inverse[1] = 1;
for (int i = 2; i < N; i++)
inverse[i] = (MOD - MOD / i) * inverse[MOD % i] % MOD;
}
pl4 Bezout(ll a, ll b) {
if (b != 0) {
pl4 xy;
xy = Bezout(b, a % b);
return mp(xy.se, xy.fi - ((a / b) * xy.se));
}
if (b == 0) {
return mp(1, 0);
}
}
pl4 Bez(ll a, ll b, ll c) {
pl4 xy;
ll x, y, z, gc;
xy = Bezout(a, b);
gc = gcd(a, b);
if (c % gc != 0)
return mp(-1, -1);
x = xy.fi * (c / gc);
y = xy.se * (c / gc);
if (x < 0)
z = rup(-x, (b / gc));
if (x >= 0)
z = -x / (b / gc);
x += z * (b / gc);
y -= z * (a / gc);
return mp(x, y);
}
void salv(vll v) {
say("{");
FOR(i, 0, v.sz - 1) {
say(v[i]);
if (i != v.sz - 1)
say(",");
}
sal("}")
}
ll DigS10(ll n) {
ll m = 0;
FOR(i, 0, DigN10(n) - 1) {
m += (ll)((llabs(n) % (ll)(pow(10.0, (double)(i + 1)))) /
(ll)(pow(10.0, (double)i)));
}
return m;
}
ll isP(ll n) {
if (n <= 1)
return 0;
FOR(i, 2, (ll)sqrt(n)) {
if (n % i == 0)
return 0;
}
return 1;
}
vll FactM(1, 1);
vll FactMI(1, 1);
ll PowM(ll a, ll b) {
ll ans = 1, x = (a % MOD);
FOR(i, 0, DigN2(b) - 1) {
if (Dig2(b, i) == 1)
ans = (ans * x) % MOD;
if (i != (DigN2(b) - 1))
x = (x * x) % MOD;
}
return ans;
}
ll Mod(ll a) {
a %= MOD;
a = (a + MOD) % MOD;
return a;
}
ll InvM(ll a) {
a = Mod(a);
a = PowM(a, MOD - 2);
return a;
}
void CFactM(ll n) {
if (FactM.sz <= n) {
FOR(i, FactM.sz, n) { FactM.pb((FactM[i - 1] * (i % MOD)) % MOD); }
}
return;
}
void CFactMI(ll n) {
CFactM(n);
if (FactMI.sz < (n + 1))
FactMI.res(n + 1, -1);
if (FactMI[n] == -1)
FactMI[n] = PowM(FactM[n], MOD - 2);
rFOR(i, 1, n - 1) {
if (FactMI[i] != -1)
break;
FactMI[i] = ((FactMI[i + 1] * ((i + 1) % MOD)) % MOD);
}
return;
}
ll CombM(ll n, ll k) {
if ((n < 0) || (k < 0))
return 0;
if (n < k)
return 0;
if (n + 1 > FactMI.sz)
CFactMI(n);
return ((((FactMI[k] * FactMI[n - k]) % MOD) * FactM[n]) % MOD);
}
ll LIS(vll v, ll m = 0) {
if (v.sz > 0) {
ll ans = 0;
vll dp(v.sz, INF);
FOR(i, 0, v.sz - 1) { dp[m ? UPB(dp, v[i]) : LOWB(dp, v[i])] = v[i]; }
FOR(i, 0, v.sz - 1) {
if (dp[i] == INF)
break;
ans++;
}
return ans;
} else {
return 0;
}
}
void cmprs(vll &v) {
if (v.sz == 0)
return;
vll vv(v);
IOTA(vv, 0);
sort(vv.bgn, vv.en, [&](ll v1, ll v2) { return v[v1] < v[v2]; });
IOTA(v, 0);
sort(v.bgn, v.en, [&](ll v1, ll v2) { return vv[v1] < vv[v2]; });
return;
}
ll BblCnt(vll v) {
cmprs(v);
BIT b(v.sz);
ll ans = 0;
REP(i, v.sz) {
ans += (i - b.sum(v[i]));
b.add(v[i], 1);
}
return ans;
}
signed main() {
ll n, m, r = 1;
cin >> n >> m;
vll a(n), b(m);
REP(i, n) {
cin >> a[i];
a[i]--;
}
REP(i, m) {
cin >> b[i];
b[i]--;
}
rSORT(a);
rSORT(b);
REP(i, n - 1) {
if (a[i] == a[i + 1]) {
cout << 0;
return 0;
}
}
REP(i, m - 1) {
if (b[i] == b[i + 1]) {
cout << 0;
return 0;
}
}
ll ac = 0, bc = 0, ri;
REP(i, n * m) {
ri = n * m - 1 - i;
if (a[ac] == ri && b[bc] == ri) {
ac++;
bc++;
} else if (a[ac] == ri) {
r *= bc;
ac++;
r %= MOD;
} else if (b[bc] == ri) {
r *= ac;
bc++;
r %= MOD;
} else {
if (ac * bc - i <= 0) {
cout << 0;
return 0;
} else {
r *= ac * bc - i;
r %= MOD;
}
}
}
cout << r;
return 0;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <iostream>
#include <math.h>
#include <numeric>
#include <regex>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using dbl = double;
using pii = pair<int, int>;
using pl4 = pair<ll, ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
using vvs = vector<vs>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vpii = vector<pii>;
using vvpii = vector<vpii>;
using vpl4 = vector<pl4>;
using vvpl4 = vector<vpl4>;
using vd = vector<dbl>;
using vvd = vector<vd>;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pob pop_back()
#define pf push_front
#define pof pop_front()
#define sz size()
#define bgn begin()
#define en end()
#define asn assign
#define emp empty()
#define fr front()
#define bk back()
#define clr clear()
#define ins insert
#define ers erase
#define res resize
#define tp top()
#define p_q priority_queue
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rFOR(i, a, b) for (int i = (b); i >= (a); i--)
#define REP(i, a) FOR((i), 0, (a)-1)
#define REP0(i, a) FOR((i), 0, (a))
#define REP1(i, a) FOR((i), 1, (a))
#define rREP(i, a) rFOR((i), 0, (a)-1)
#define rREP0(i, a) rFOR((i), 0, (a))
#define rREP1(i, a) rFOR((i), 1, (a))
#define ROR(v, i) for (auto &(i) : (v))
#define IOTA(a, n) iota((a).bgn, (a).en, (n))
#define SORT(a) sort((a).bgn, (a).en)
#define rSORT(a) sort((a).rbegin(), (a).rend())
#define UNIQUE(a) (a).erase(unique((a).bgn, (a).en), (a).en)
#define PREVP(a) prev_permutation((a).bgn, (a).en)
#define NEXTP(a) next_permutation((a).bgn, (a).en)
#define BINS(a, b) binary_search((a).bgn, (a).en, (b))
#define LOWB(a, b) (lower_bound((a).bgn, (a).en, (b)) - (a).bgn)
#define UPB(a, b) (upper_bound((a).bgn, (a).en, (b)) - (a).bgn)
#define CNT(a, b) count((a).bgn, (a).en, b)
#define SUM(a) accumulate((a).bgn, (a).en, 0)
#define REV(a) reverse((a).bgn, (a).en)
#define REGS(a, b) regex_search((a), regex(b))
#define REGM(a, b) regex_match((a), regex(b))
#define yn(a) cout << ((a) ? "yes" : "no") << endl;
#define Yn(a) cout << ((a) ? "Yes" : "No") << endl;
#define YN(a) cout << ((a) ? "YES" : "NO") << endl;
#define Imp(a) cout << ((a) ? "Possible" : "Impossible") << endl;
#define IMP(a) cout << ((a) ? "POSSIBLE" : "IMPOSSIBLE") << endl;
#define say(a) cout << (a);
#define sal(a) cout << (a) << endl;
#define sak cout << endl;
#define sas cout << " ";
#define sat cout << "\t";
#define dbg(a) cout << (#a) << ": " << (a) << endl;
#define c2l(a) ((ll)(a - 48))
#define a2l(a) ((ll)(a - 97))
#define A2l(a) ((ll)(a - 65))
#define l2c(a) ((char)(a + 48))
#define l2a(a) ((char)(a + 97))
#define l2A(a) ((char)(a + 65))
#define DigN2(a) ((llabs(a) == 0) ? (1) : ((ll)(log2(double(llabs(a)))) + 1))
#define DigN10(a) ((llabs(a) == 0) ? (1) : ((ll)(log10(double(llabs(a)))) + 1))
#define Dig2(a, b) (((a) >> (b)) & 1)
#define Dig10(a, b) (ll)(((a) / ((ll)(pow(10.0, (double)(b))))) % 10)
#define Pow2(a) (1 << (a))
#define Pow10(a) ((ll)(pow(10.0, double(a))))
#define LSB(a) ((a) & (-(a)))
#define llin(a) \
ll(a); \
cin >> (a);
#define stin(a) \
string(a); \
cin >> (a);
#define vin(v) \
ROR((v), (i)) { cin >> (i); };
#define vllin(v, N) \
vll(v)((N)); \
vin(v);
#define vsin(v, N) \
vs(v)((N)); \
vin(v);
#define rdn(a, b) ((a) / (b))
#define rou(a, b) \
((((double(a) / double(b)) - ((a) / (b))) < 0.5) ? ((a) / (b)) \
: (((a) / (b)) + 1))
#define rup(a, b) ((((a) % (b)) == 0) ? ((a) / (b)) : (((a) / (b)) + 1))
#define min(a, b) ((a < b) ? (a) : (b))
#define max(a, b) ((a > b) ? (a) : (b))
#define powll(a, b) (ll)(pow((double)(a), (double)(b)))
#define Triangle(x1, y1, x2, y2, x3, y3) \
(((x1) - (x2)) * ((y1) - (y3)) - ((x1) - (x3)) * ((y1) - (y2)))
#define int ll
const ll MOD = 1e9 + 7;
const ll N = 1e5 + 20;
// const ll MOD = 998244353;
// const ll MOD = 9007199254740881;
const ll INF = 1LL << 60;
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
class BIT {
public:
vll d;
vll v;
ll size;
BIT(ll sizeget) {
size = sizeget;
d.asn(size + 1, 0);
v.asn(size, 0);
}
BIT(vll cpyvec) { copy(cpyvec); }
void add(ll index, ll num) {
// if (index < 0) return false;
// if (index >= size) return false;
v[index] += num;
index++;
while (index <= size) {
d[index] += num;
index += LSB(index);
}
// return true;
return;
}
ll sum(ll index = INF) {
index++;
index = min(index, size);
ll ans = 0;
while (index) {
ans += d[index];
index -= LSB(index);
}
return ans;
}
void copy(vll cpyvec) {
size = cpyvec.sz;
d.asn(size + 1, 0);
v.asn(size, 0);
REP(i, size) add(i, cpyvec[i]);
}
};
class UFT {
public:
ll size;
ll mode;
vll root;
vll rank;
UFT(ll sizeget, ll modeget = 0) {
size = sizeget;
mode = modeget;
root.res(size, 0);
if (!mode)
rank.res(size, 0);
IOTA(root, 0);
}
ll find(ll x) { return root[x] == x ? x : root[x] = find(root[x]); }
bool same(ll x, ll y) { return find(x) == find(y); }
void unite(ll x, ll y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (mode)
root[y] = x;
else {
if (rank[x] < rank[y]) {
root[x] = y;
} else {
root[y] = x;
if (rank[x] == rank[y])
rank[x]++;
}
}
}
};
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll inverse[N];
void init_inverse() {
inverse[1] = 1;
for (int i = 2; i < N; i++)
inverse[i] = (MOD - MOD / i) * inverse[MOD % i] % MOD;
}
pl4 Bezout(ll a, ll b) {
if (b != 0) {
pl4 xy;
xy = Bezout(b, a % b);
return mp(xy.se, xy.fi - ((a / b) * xy.se));
}
if (b == 0) {
return mp(1, 0);
}
}
pl4 Bez(ll a, ll b, ll c) {
pl4 xy;
ll x, y, z, gc;
xy = Bezout(a, b);
gc = gcd(a, b);
if (c % gc != 0)
return mp(-1, -1);
x = xy.fi * (c / gc);
y = xy.se * (c / gc);
if (x < 0)
z = rup(-x, (b / gc));
if (x >= 0)
z = -x / (b / gc);
x += z * (b / gc);
y -= z * (a / gc);
return mp(x, y);
}
void salv(vll v) {
say("{");
FOR(i, 0, v.sz - 1) {
say(v[i]);
if (i != v.sz - 1)
say(",");
}
sal("}")
}
ll DigS10(ll n) {
ll m = 0;
FOR(i, 0, DigN10(n) - 1) {
m += (ll)((llabs(n) % (ll)(pow(10.0, (double)(i + 1)))) /
(ll)(pow(10.0, (double)i)));
}
return m;
}
ll isP(ll n) {
if (n <= 1)
return 0;
FOR(i, 2, (ll)sqrt(n)) {
if (n % i == 0)
return 0;
}
return 1;
}
vll FactM(1, 1);
vll FactMI(1, 1);
ll PowM(ll a, ll b) {
ll ans = 1, x = (a % MOD);
FOR(i, 0, DigN2(b) - 1) {
if (Dig2(b, i) == 1)
ans = (ans * x) % MOD;
if (i != (DigN2(b) - 1))
x = (x * x) % MOD;
}
return ans;
}
ll Mod(ll a) {
a %= MOD;
a = (a + MOD) % MOD;
return a;
}
ll InvM(ll a) {
a = Mod(a);
a = PowM(a, MOD - 2);
return a;
}
void CFactM(ll n) {
if (FactM.sz <= n) {
FOR(i, FactM.sz, n) { FactM.pb((FactM[i - 1] * (i % MOD)) % MOD); }
}
return;
}
void CFactMI(ll n) {
CFactM(n);
if (FactMI.sz < (n + 1))
FactMI.res(n + 1, -1);
if (FactMI[n] == -1)
FactMI[n] = PowM(FactM[n], MOD - 2);
rFOR(i, 1, n - 1) {
if (FactMI[i] != -1)
break;
FactMI[i] = ((FactMI[i + 1] * ((i + 1) % MOD)) % MOD);
}
return;
}
ll CombM(ll n, ll k) {
if ((n < 0) || (k < 0))
return 0;
if (n < k)
return 0;
if (n + 1 > FactMI.sz)
CFactMI(n);
return ((((FactMI[k] * FactMI[n - k]) % MOD) * FactM[n]) % MOD);
}
ll LIS(vll v, ll m = 0) {
if (v.sz > 0) {
ll ans = 0;
vll dp(v.sz, INF);
FOR(i, 0, v.sz - 1) { dp[m ? UPB(dp, v[i]) : LOWB(dp, v[i])] = v[i]; }
FOR(i, 0, v.sz - 1) {
if (dp[i] == INF)
break;
ans++;
}
return ans;
} else {
return 0;
}
}
void cmprs(vll &v) {
if (v.sz == 0)
return;
vll vv(v);
IOTA(vv, 0);
sort(vv.bgn, vv.en, [&](ll v1, ll v2) { return v[v1] < v[v2]; });
IOTA(v, 0);
sort(v.bgn, v.en, [&](ll v1, ll v2) { return vv[v1] < vv[v2]; });
return;
}
ll BblCnt(vll v) {
cmprs(v);
BIT b(v.sz);
ll ans = 0;
REP(i, v.sz) {
ans += (i - b.sum(v[i]));
b.add(v[i], 1);
}
return ans;
}
signed main() {
ll n, m, r = 1;
cin >> n >> m;
vll a(n + 1), b(m + 1);
REP(i, n) {
cin >> a[i];
a[i]--;
}
REP(i, m) {
cin >> b[i];
b[i]--;
}
rSORT(a);
rSORT(b);
REP(i, n - 1) {
if (a[i] == a[i + 1]) {
cout << 0;
return 0;
}
}
REP(i, m - 1) {
if (b[i] == b[i + 1]) {
cout << 0;
return 0;
}
}
ll ac = 0, bc = 0, ri;
REP(i, n * m) {
ri = n * m - 1 - i;
if (a[ac] == ri && b[bc] == ri) {
ac++;
bc++;
} else if (a[ac] == ri) {
r *= bc;
ac++;
r %= MOD;
} else if (b[bc] == ri) {
r *= ac;
bc++;
r %= MOD;
} else {
if (ac * bc - i <= 0) {
cout << 0;
return 0;
} else {
r *= ac * bc - i;
r %= MOD;
}
}
}
cout << r;
return 0;
} | [
"assignment.change"
] | 949,425 | 949,426 | u172929647 | cpp |
p03152 | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
scanf("%d%d", &N, &M);
vector<int> A(N), B(M);
const int MAX_N = N * M;
constexpr long long int MOD = 1000000007;
for (int i = 0; i < N; ++i)
scanf("%d", &A[i]);
for (int j = 0; j < M; ++j)
scanf("%d", &B[j]);
sort(begin(A), end(A), greater<int>());
sort(begin(B), end(B), greater<int>());
long long int ba = 0, bb = 0;
long long int ans = 1;
for (long long int i = MAX_N; i > 0; --i) {
if (A[ba] == i && B[bb] == i) {
++ba, ++bb;
} else if (A[ba] == i && B[bb] != i) {
++ba;
ans = (ans * bb) % MOD;
} else if (A[ba] != i && B[bb] == i) {
++bb;
ans = (ans * ba) % MOD;
} else {
ans = (ans * (ba * bb - MAX_N + i)) % MOD;
}
if (ans <= 0) {
ans = 0;
break;
}
}
cout << ans << endl;
} | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
scanf("%d%d", &N, &M);
vector<int> A(N + 1), B(M + 1);
const int MAX_N = N * M;
constexpr long long int MOD = 1000000007;
for (int i = 0; i < N; ++i)
scanf("%d", &A[i]);
for (int j = 0; j < M; ++j)
scanf("%d", &B[j]);
sort(begin(A), end(A), greater<int>());
sort(begin(B), end(B), greater<int>());
long long int ba = 0, bb = 0;
long long int ans = 1;
for (long long int i = MAX_N; i > 0; --i) {
if (A[ba] == i && B[bb] == i) {
++ba, ++bb;
} else if (A[ba] == i && B[bb] != i) {
++ba;
ans = (ans * bb) % MOD;
} else if (A[ba] != i && B[bb] == i) {
++bb;
ans = (ans * ba) % MOD;
} else {
ans = (ans * (ba * bb - MAX_N + i)) % MOD;
}
if (ans <= 0) {
ans = 0;
break;
}
}
cout << ans << endl;
} | [
"assignment.change"
] | 949,429 | 949,430 | u982123883 | cpp |
p03152 | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
scanf("%d%d", &N, &M);
vector<int> A(N), B(M);
const int MAX_N = N * M;
constexpr long long int MOD = 1000000007;
for (int i = 0; i < N; ++i)
scanf("%d", &A[i]);
for (int j = 0; j < M; ++j)
scanf("%d", &B[j]);
sort(begin(A), end(A), greater<int>());
sort(begin(B), end(B), greater<int>());
long long int ba = 0, bb = 0;
long long int ans = 1;
for (long long int i = MAX_N; i > 0; --i) {
if (A[ba] > i) {
ans = 0;
break;
}
if (B[bb] > i) {
ans = 0;
break;
}
if (A[ba] == i && B[bb] == i) {
++ba, ++bb;
} else if (A[ba] == i && B[bb] != i) {
++ba;
ans = (ans * bb) % MOD;
} else if (A[ba] != i && B[bb] == i) {
++bb;
ans = (ans * ba) % MOD;
} else {
ans = (ans * (ba * bb - MAX_N + i)) % MOD;
}
if (ans <= 0) {
ans = 0;
break;
}
}
cout << ans << endl;
} | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
scanf("%d%d", &N, &M);
vector<int> A(N + 1), B(M + 1);
const int MAX_N = N * M;
constexpr long long int MOD = 1000000007;
for (int i = 0; i < N; ++i)
scanf("%d", &A[i]);
for (int j = 0; j < M; ++j)
scanf("%d", &B[j]);
sort(begin(A), end(A), greater<int>());
sort(begin(B), end(B), greater<int>());
long long int ba = 0, bb = 0;
long long int ans = 1;
for (long long int i = MAX_N; i > 0; --i) {
if (A[ba] > i) {
ans = 0;
break;
}
if (B[bb] > i) {
ans = 0;
break;
}
if (A[ba] == i && B[bb] == i) {
++ba, ++bb;
} else if (A[ba] == i && B[bb] != i) {
++ba;
ans = (ans * bb) % MOD;
} else if (A[ba] != i && B[bb] == i) {
++bb;
ans = (ans * ba) % MOD;
} else {
ans = (ans * (ba * bb - MAX_N + i)) % MOD;
}
if (ans <= 0) {
ans = 0;
break;
}
}
cout << ans << endl;
} | [
"assignment.change"
] | 949,431 | 949,432 | u982123883 | cpp |
p03152 | #include <iostream>
#include <unordered_set>
using namespace std;
const long MOD = 1000000007;
int main() {
int n, m, nm;
cin >> n >> m;
nm = n * m;
unordered_set<int> a, b;
int count_a[nm + 1], count_b[nm + 1];
fill(count_a, count_a + nm + 1, 0);
fill(count_b, count_b + nm + 1, 0);
for (int i = 0; i < n; i++) {
int x;
cin >> x;
a.insert(x);
count_a[x] = 1;
}
for (int i = 0; i < m; i++) {
int x;
cin >> x;
b.insert(x);
count_b[x] = 1;
}
for (int i = nm; i > 0; i--) {
count_a[i - 1] += count_a[i];
count_b[i - 1] += count_b[i];
}
long ans = 1;
for (int i = nm; i > 0; i--) {
bool a_find = (a.find(i) != a.end()), b_find = (b.find(i) != b.end());
long mul = 1;
if (a_find) {
if (!b_find) {
mul *= count_a[i];
}
} else {
mul *= count_b[i];
if (!b_find) {
mul *= count_a[i];
mul -= nm - i;
}
}
ans *= mul;
ans %= MOD;
}
cout << ans << endl;
return 0;
}
| #include <iostream>
#include <unordered_set>
using namespace std;
const long MOD = 1000000007;
int main() {
int n, m, nm;
cin >> n >> m;
nm = n * m;
unordered_set<int> a, b;
int count_a[nm + 1], count_b[nm + 1];
fill(count_a, count_a + nm + 1, 0);
fill(count_b, count_b + nm + 1, 0);
for (int i = 0; i < n; i++) {
int x;
cin >> x;
a.insert(x);
count_a[x] = 1;
}
for (int i = 0; i < m; i++) {
int x;
cin >> x;
b.insert(x);
count_b[x] = 1;
}
for (int i = nm; i > 0; i--) {
count_a[i - 1] += count_a[i];
count_b[i - 1] += count_b[i];
}
long ans = 1;
for (int i = nm; i > 0; i--) {
bool a_find = (a.find(i) != a.end()), b_find = (b.find(i) != b.end());
long mul = 1;
if (a_find) {
if (!b_find) {
mul *= count_b[i];
}
} else {
mul *= count_a[i];
if (!b_find) {
mul *= count_b[i];
mul -= nm - i;
}
}
ans *= mul;
ans %= MOD;
}
cout << ans << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.change"
] | 949,440 | 949,441 | u280512618 | cpp |
p03155 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, h, w;
cin >> n;
cin >> h;
cin >> w;
cout << (n - h) * (n - w) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, h, w;
cin >> n;
cin >> h;
cin >> w;
cout << (n - h + 1) * (n - w + 1) << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 949,527 | 949,528 | u681869152 | cpp |
p03155 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define vel vector<long long>
#define vvel vector<vel>
void mmin(int &a, int b) { a = min(a, b); }
void mmax(int &a, int b) { a = max(a, b); }
int nibl(vel &v, int tan) {
int up = v.size() - 1;
int lo = 0;
if (v[up] <= tan)
return up;
while (up - lo > 1) {
int mi = (up + lo) / 2;
if (v[mi] <= tan)
lo = mi;
if (tan < v[mi])
up = mi;
}
return lo;
}
signed main() {
int h, w, n;
cin >> h >> w >> n;
cout << (n - w + 1) * (n - h + 1) << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define vel vector<long long>
#define vvel vector<vel>
void mmin(int &a, int b) { a = min(a, b); }
void mmax(int &a, int b) { a = max(a, b); }
int nibl(vel &v, int tan) {
int up = v.size() - 1;
int lo = 0;
if (v[up] <= tan)
return up;
while (up - lo > 1) {
int mi = (up + lo) / 2;
if (v[mi] <= tan)
lo = mi;
if (tan < v[mi])
up = mi;
}
return lo;
}
signed main() {
int h, w, n;
cin >> n >> h >> w;
cout << (n - w + 1) * (n - h + 1) << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 949,536 | 949,537 | u021034020 | cpp |
p03155 | #include <stdio.h>
int main() {
int n; // 枠の一辺
int h; // ポスターの縦の長さ
int w; // ポスターの横の長さ
int ptn_h; // 縦の配置パターン
int ptn_w; // 横の配置パターン
int ptn_result; // 配置パターン総計
scanf("%d\n%d\n%d\n", &n, &h, &w);
ptn_h = n - h + 1;
ptn_w = n - w + 1;
ptn_result = ptn_h * ptn_h;
printf("%d", ptn_result);
} | #include <stdio.h>
int main() {
int n; // 枠の一辺
int h; // ポスターの縦の長さ
int w; // ポスターの横の長さ
int ptn_h; // 縦の配置パターン
int ptn_w; // 横の配置パターン
int ptn_result; // 配置パターン総計
scanf("%d\n%d\n%d\n", &n, &h, &w);
ptn_h = n - h + 1;
ptn_w = n - w + 1;
ptn_result = ptn_h * ptn_w;
printf("%d", ptn_result);
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 949,540 | 949,541 | u385748551 | cpp |
p03155 | #include <stdio.h>
int main() {
int n; // 枠の一辺
int h; // ポスターの縦の長さ
int w; // ポスターの横の長さ
int ptn_h; // 縦の配置パターン
int ptn_w; // 横の配置パターン
int ptn_result; // 配置パターン総計
scanf("%d\n%d\n%d\n", n, h, w);
ptn_h = n - h + 1;
ptn_w = n - w + 1;
ptn_result = ptn_h * ptn_h;
printf("%d", ptn_result);
} | #include <stdio.h>
int main() {
int n; // 枠の一辺
int h; // ポスターの縦の長さ
int w; // ポスターの横の長さ
int ptn_h; // 縦の配置パターン
int ptn_w; // 横の配置パターン
int ptn_result; // 配置パターン総計
scanf("%d\n%d\n%d\n", &n, &h, &w);
ptn_h = n - h + 1;
ptn_w = n - w + 1;
ptn_result = ptn_h * ptn_w;
printf("%d", ptn_result);
} | [
"expression.operation.unary.reference.add",
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 949,542 | 949,541 | u385748551 | cpp |
p03155 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define repi(i, a, b) for (int i = (a); i > (b); i--)
#define db(x) (cerr << #x << ": " << (x) << '\n')
#define sync ios_base::sync_with_stdio(false), cin.tie(NULL)
#define tests(t) \
int t; \
cin >> t; \
while (t--)
#define iceil(n, x) (((n) + (x)-1) / (x))
#define ll long long
#define gcd __gcd
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define sz size()
#define all(v) (v).begin(), (v).end()
#define uni(v) \
sort(all(v)); \
(v).erase(unique(all(v)), (v).end());
#define pii pair<int, int>
#define vi vector<int>
#define vpii vector<pii>
#define vvi vector<vi>
#define fi first
#define se second
#define umap unordered_map
#define uset unordered_set
#define pqueue priority_queue
#define si(a) scanf("%d", &a)
#define sll(a) scanf("%lld", &a)
#define bitcount(x) __builtin_popcount(x)
#define cps CLOCKS_PER_SEC
#define PI acos(-1.0)
#define EPS 1e-9
#define mod 1000000007
#define MOD 1000000007
#define N 1005
using namespace std;
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
template <typename T> using minpq = priority_queue<T, vector<T>, greater<T>>;
template <typename T> using maxpq = priority_queue<T>;
// All indexing is 0-based
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
// methods: find_by_order(k); & order_of_key(k);
// To make it an ordered_multiset, use pairs of (value, time_of_insertion)
// to distinguish values which are similar.
template <class key, class value, class cmp = std::less<key>>
using ordered_map =
tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;
// ordered_map<int, int> my_map;
// Returns no. of values x for which ceil(n / x) == y (y must be > 1).
inline ll CC(ll n, ll y) { return iceil(n, y - 1) - iceil(n, y); }
// Returns no. of values x for which floor(n / x) == y
inline ll FF(ll n, ll y) { return n / y - n / (y + 1); }
// a and b are assumed to be taken modulo p
inline int add(int a, int b, int p = mod) {
int c = a + b;
if (c >= p)
c -= p;
return c;
}
inline int sub(int a, int b, int p = mod) {
int c = a - b;
if (c < 0)
c += p;
return c;
}
inline int mul(int a, int b, int p = mod) { return (a * 1ll * b) % p; }
#define int ll
main() {
#ifndef ONLINE_JUDGE
freopen("/home/tarun/Desktop/input.txt", "r", stdin);
// freopen("/home/tarun/Desktop/output.txt", "w", stdout);
#endif
sync;
clock_t clk = clock();
cerr << "I will return...\n";
int n, h, w;
cin >> n >> h >> w;
cout << (n - w + 1) * (n - h + 1) << '\n';
cerr << "...don't you ever hang your head.\n";
cerr << "Time (in ms): " << double(clock() - clk) * 1000.0 / cps << '\n';
}
// Compile using:
// g++ -o filename.exe --std=c++11 filename.cpp
// Use -D CP for defining a macro CP in the local environment
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define repi(i, a, b) for (int i = (a); i > (b); i--)
#define db(x) (cerr << #x << ": " << (x) << '\n')
#define sync ios_base::sync_with_stdio(false), cin.tie(NULL)
#define tests(t) \
int t; \
cin >> t; \
while (t--)
#define iceil(n, x) (((n) + (x)-1) / (x))
#define ll long long
#define gcd __gcd
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define sz size()
#define all(v) (v).begin(), (v).end()
#define uni(v) \
sort(all(v)); \
(v).erase(unique(all(v)), (v).end());
#define pii pair<int, int>
#define vi vector<int>
#define vpii vector<pii>
#define vvi vector<vi>
#define fi first
#define se second
#define umap unordered_map
#define uset unordered_set
#define pqueue priority_queue
#define si(a) scanf("%d", &a)
#define sll(a) scanf("%lld", &a)
#define bitcount(x) __builtin_popcount(x)
#define cps CLOCKS_PER_SEC
#define PI acos(-1.0)
#define EPS 1e-9
#define mod 1000000007
#define MOD 1000000007
#define N 1005
using namespace std;
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
template <typename T> using minpq = priority_queue<T, vector<T>, greater<T>>;
template <typename T> using maxpq = priority_queue<T>;
// All indexing is 0-based
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
// methods: find_by_order(k); & order_of_key(k);
// To make it an ordered_multiset, use pairs of (value, time_of_insertion)
// to distinguish values which are similar.
template <class key, class value, class cmp = std::less<key>>
using ordered_map =
tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;
// ordered_map<int, int> my_map;
// Returns no. of values x for which ceil(n / x) == y (y must be > 1).
inline ll CC(ll n, ll y) { return iceil(n, y - 1) - iceil(n, y); }
// Returns no. of values x for which floor(n / x) == y
inline ll FF(ll n, ll y) { return n / y - n / (y + 1); }
// a and b are assumed to be taken modulo p
inline int add(int a, int b, int p = mod) {
int c = a + b;
if (c >= p)
c -= p;
return c;
}
inline int sub(int a, int b, int p = mod) {
int c = a - b;
if (c < 0)
c += p;
return c;
}
inline int mul(int a, int b, int p = mod) { return (a * 1ll * b) % p; }
#define int ll
main() {
#ifdef CP
freopen("/home/tarun/Desktop/input.txt", "r", stdin);
// freopen("/home/tarun/Desktop/output.txt", "w", stdout);
#endif
sync;
clock_t clk = clock();
cerr << "I will return...\n";
int n, h, w;
cin >> n >> h >> w;
cout << (n - w + 1) * (n - h + 1) << '\n';
cerr << "...don't you ever hang your head.\n";
cerr << "Time (in ms): " << double(clock() - clk) * 1000.0 / cps << '\n';
}
// Compile using:
// g++ -o filename.exe --std=c++11 filename.cpp
// Use -D CP for defining a macro CP in the local environment
| [] | 949,554 | 949,555 | u567489994 | cpp |
p03155 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define ll long long
#define mod 1000000007
#define maxn 10000010
inline ll read() {
ll x = 0;
char c = getchar(), f = 1;
for (; c < '0' || '9' < c; c = getchar())
if (c == '-')
f = -1;
for (; '0' <= c && c <= '9'; c = getchar())
x = x * 10 + c - '0';
return x * f;
}
inline void write(ll x) {
static char buff[20], len;
len = 0;
if (x < 0)
putchar('-'), x = -x;
for (; x; x /= 10)
buff[len++] = x % 10;
if (!len)
putchar('0');
else
while (len)
putchar(buff[--len] + '0');
}
inline void writeln(ll x) {
write(x);
putchar('\n');
}
inline void writesp(ll x) {
write(x);
putchar(' ');
}
int n, h, w;
int main() {
n = read();
h = read();
w = read();
writeln((n - h) * (w - h));
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define ll long long
#define mod 1000000007
#define maxn 10000010
inline ll read() {
ll x = 0;
char c = getchar(), f = 1;
for (; c < '0' || '9' < c; c = getchar())
if (c == '-')
f = -1;
for (; '0' <= c && c <= '9'; c = getchar())
x = x * 10 + c - '0';
return x * f;
}
inline void write(ll x) {
static char buff[20], len;
len = 0;
if (x < 0)
putchar('-'), x = -x;
for (; x; x /= 10)
buff[len++] = x % 10;
if (!len)
putchar('0');
else
while (len)
putchar(buff[--len] + '0');
}
inline void writeln(ll x) {
write(x);
putchar('\n');
}
inline void writesp(ll x) {
write(x);
putchar(' ');
}
int n, h, w;
int main() {
n = read();
h = read();
w = read();
writeln((n - h + 1) * (n - w + 1));
return 0;
} | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 949,556 | 949,557 | u245106490 | cpp |
p03155 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#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) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define REPO(i, n) for (int i = 1; i <= n; i++)
#define ll long long
#define INF 999999999
#define MINF -999999999
#define ALL(n) n.begin(), n.end()
int main() {
int n, h, w;
cin >> n >> h >> w;
cout << (n - h * 1) * (n - w + 1) << endl;
}
| #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#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) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define REPO(i, n) for (int i = 1; i <= n; i++)
#define ll long long
#define INF 999999999
#define MINF -999999999
#define ALL(n) n.begin(), n.end()
int main() {
int n, h, w;
cin >> n >> h >> w;
cout << (n - h + 1) * (n - w + 1) << endl;
}
| [
"expression.operator.arithmetic.change",
"io.output.change"
] | 949,558 | 949,559 | u196497077 | cpp |
p03155 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#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) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define REPO(i, n) for (int i = 1; i <= n; i++)
#define ll long long
#define INF 999999999
#define MINF -999999999
#define ALL(n) n.begin(), n.end()
int main() {
int n, h, w;
cin >> n >> h >> w;
cout << (n - h * 1) * (n = w + 1) << endl;
}
| #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#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) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define REPO(i, n) for (int i = 1; i <= n; i++)
#define ll long long
#define INF 999999999
#define MINF -999999999
#define ALL(n) n.begin(), n.end()
int main() {
int n, h, w;
cin >> n >> h >> w;
cout << (n - h + 1) * (n - w + 1) << endl;
}
| [
"expression.operator.arithmetic.change",
"io.output.change"
] | 949,560 | 949,559 | u196497077 | cpp |
p03155 | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i, s, e) for (int(i) = (s); (i) <= (e); (i)++)
#define all(x) x.begin(), x.end()
int main() {
int N, H, W;
cin >> N >> H >> W;
cout << (N - H + 1) << (N - W + 1) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i, s, e) for (int(i) = (s); (i) <= (e); (i)++)
#define all(x) x.begin(), x.end()
int main() {
int N, H, W;
cin >> N >> H >> W;
cout << (N - H + 1) * (N - W + 1) << endl;
}
| [
"io.output.change"
] | 949,561 | 949,562 | u852585808 | cpp |
p03155 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
#define rep(i, a) for (int i = 0; (i) < (int)(a); (i)++)
#define reps(i, a, b) for (int i = (int)(a); (i) < (int)(b); (i)++)
#define rrep(i, a) for (int i = (int)a - 1; (i) >= 0; (i)--)
#define rreps(i, a, b) for (int i = (int)(a)-1; (i) >= (int)(b); (i)--)
#define MP(a, b) make_pair((a), (b))
#define PB(a) push_back((a))
#define all(v) (v).begin(), (v).end()
#define PERM(v) next_permutation(all(v))
#define UNIQUE(v) \
sort(all(v)); \
(v).erase(unique(all(v)), v.end())
#define CIN(type, x) \
type x; \
cin >> x
#define TRUE__ "Yes"
#define FALSE__ "No"
#define PRINT(f) \
if ((f)) { \
cout << (TRUE__) << endl; \
} else { \
cout << FALSE__ << endl; \
}
#define RS resize
#define CINV(v, N) \
do { \
v.RS(N); \
rep(i, N) cin >> v[i]; \
} while (0);
#define RCINV(v, N) \
do { \
v.RS(N); \
rrep(i, N) cin >> v[i]; \
} while (0);
#define MOD 1000000007
template <class T> inline T GET() {
T x;
cin >> x;
return x;
}
void init();
void solve();
signed main() {
init();
solve();
}
void init() {
int H, W, N;
cin >> H >> W >> N;
N++;
cout << (N - H) * (N - W) << endl;
}
void solve() {}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
#define rep(i, a) for (int i = 0; (i) < (int)(a); (i)++)
#define reps(i, a, b) for (int i = (int)(a); (i) < (int)(b); (i)++)
#define rrep(i, a) for (int i = (int)a - 1; (i) >= 0; (i)--)
#define rreps(i, a, b) for (int i = (int)(a)-1; (i) >= (int)(b); (i)--)
#define MP(a, b) make_pair((a), (b))
#define PB(a) push_back((a))
#define all(v) (v).begin(), (v).end()
#define PERM(v) next_permutation(all(v))
#define UNIQUE(v) \
sort(all(v)); \
(v).erase(unique(all(v)), v.end())
#define CIN(type, x) \
type x; \
cin >> x
#define TRUE__ "Yes"
#define FALSE__ "No"
#define PRINT(f) \
if ((f)) { \
cout << (TRUE__) << endl; \
} else { \
cout << FALSE__ << endl; \
}
#define RS resize
#define CINV(v, N) \
do { \
v.RS(N); \
rep(i, N) cin >> v[i]; \
} while (0);
#define RCINV(v, N) \
do { \
v.RS(N); \
rrep(i, N) cin >> v[i]; \
} while (0);
#define MOD 1000000007
template <class T> inline T GET() {
T x;
cin >> x;
return x;
}
void init();
void solve();
signed main() {
init();
solve();
}
void init() {
int H, W, N;
cin >> N >> H >> W;
N++;
cout << (N - H) * (N - W) << endl;
}
void solve() {}
| [
"expression.operation.binary.remove"
] | 949,571 | 949,572 | u946322619 | cpp |
p03155 | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <algorithm>
#include <assert.h>
#include <complex>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <typeinfo>
#include <utility>
#include <vector>
using namespace std;
#define eps 0.000001
#define LONG_INF 10000000000000000
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007
#define MOD 998244353
#define seg_size 65536 * 16
#define REP(i, n) for (long long i = 0; i < n; ++i)
int main() {
int h, w, n;
cin >> h >> w >> n;
n++;
cout << (n - h) * (n - w) << endl;
return 0;
} | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <algorithm>
#include <assert.h>
#include <complex>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <typeinfo>
#include <utility>
#include <vector>
using namespace std;
#define eps 0.000001
#define LONG_INF 10000000000000000
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007
#define MOD 998244353
#define seg_size 65536 * 16
#define REP(i, n) for (long long i = 0; i < n; ++i)
int main() {
int h, w, n;
cin >> n >> h >> w;
n++;
cout << (n - h) * (n - w) << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 949,573 | 949,574 | u545022164 | cpp |
p03155 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
int main(void) {
int h, w, n;
std::cin >> h >> w >> n;
std::cout << (n - h + 1) * (n - w + 1) << std::endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
int main(void) {
int h, w, n;
std::cin >> n >> h >> w;
std::cout << (n - h + 1) * (n - w + 1) << std::endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 949,575 | 949,576 | u914739916 | cpp |
p03155 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, h, w;
cin >> n >> h >> w;
cout << (n - h - 1) * (n - w - 1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, h, w;
cin >> n >> h >> w;
cout << (n - h + 1) * (n - w + 1) << endl;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 949,577 | 949,578 | u546943614 | cpp |
p03155 | #include <iostream>
int main() {
int N, H, W;
std::cin >> N >> H >> W;
std::cout << (N - H) * (N - W);
return 0;
} | #include <iostream>
int main() {
int N, H, W;
std::cin >> N >> H >> W;
std::cout << (N - H + 1) * (N - W + 1);
return 0;
} | [
"expression.operation.binary.add"
] | 949,581 | 949,582 | u005702636 | cpp |
p03155 | #include <algorithm>
#include <cmath>
#include <functional>
#include <ios>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using namespace std;
typedef long long int lli;
// const int MAX=;
int main() {
int N, H, W;
cin >> N >> H >> H;
cout << (N - W + 1) * (N - H + 1);
} | #include <algorithm>
#include <cmath>
#include <functional>
#include <ios>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using namespace std;
typedef long long int lli;
// const int MAX=;
int main() {
int N, H, W;
cin >> N >> H >> W;
cout << (N - W + 1) * (N - H + 1);
} | [
"identifier.change",
"expression.operation.binary.change"
] | 949,587 | 949,588 | u228214259 | cpp |
p03155 | #include <stdio.h>
#include <string.h>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
inline void print() { std::cout << "\n"; }
template <class T> inline void print(T obj, char *delim = "\n") {
std::cout << obj << delim;
}
template <class T> inline void print(std::vector<T> obj, char *delim = "\n") {
for (const auto &e : obj) {
print(e, " ");
}
print();
}
std::vector<std::string> split(const std::string &s, char delim);
std::string getline(FILE *fp = stdin);
std::vector<std::string> getlines(FILE *fp = stdin);
template <class src, class Func>
auto map_vector(const std::vector<src> &v, const Func &func) {
std::vector<decltype(func(v[0]))> new_v;
new_v.reserve(v.size());
for (unsigned i = 0; i < v.size(); ++i) {
new_v.emplace_back(func(v[i]));
}
return std::move(new_v);
}
std::vector<int> convert_line_into_ints(std::string line);
inline vector<string> split(const string &s, char delim) {
vector<string> elems;
stringstream ss(s);
string item;
while (std::getline(ss, item, delim)) {
if (!item.empty()) {
elems.push_back(item);
}
}
return move(elems);
}
string getline(FILE *fp) {
char buffer[256];
if (!fgets(buffer, 256, fp))
return "";
size_t length = strlen(buffer);
if (length > 0 && buffer[length - 1] == '\n')
buffer[--length] = '\0';
return buffer;
}
vector<string> getlines(FILE *fp) {
vector<string> lines;
while (fp) {
std::string line = getline(fp);
if (line.length() >= 1)
lines.emplace_back(move(line));
else
break;
}
return move(lines);
}
std::vector<int> convert_line_into_ints(string line) {
auto func = [](string str) { return stoi(str); };
return map_vector(split(line, ' '), func);
}
int q(vector<vector<int>> &values) {
auto N = values[0][0];
auto H = values[1][0];
auto W = values[2][0];
return (W - H + 1) * (N - W + 1);
}
int main(int argc, char *argv[]) {
auto lines = getlines();
auto values = map_vector(lines, convert_line_into_ints);
std::cout << q(values) << endl;
return 0;
}
| #include <stdio.h>
#include <string.h>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
inline void print() { std::cout << "\n"; }
template <class T> inline void print(T obj, char *delim = "\n") {
std::cout << obj << delim;
}
template <class T> inline void print(std::vector<T> obj, char *delim = "\n") {
for (const auto &e : obj) {
print(e, " ");
}
print();
}
std::vector<std::string> split(const std::string &s, char delim);
std::string getline(FILE *fp = stdin);
std::vector<std::string> getlines(FILE *fp = stdin);
template <class src, class Func>
auto map_vector(const std::vector<src> &v, const Func &func) {
std::vector<decltype(func(v[0]))> new_v;
new_v.reserve(v.size());
for (unsigned i = 0; i < v.size(); ++i) {
new_v.emplace_back(func(v[i]));
}
return std::move(new_v);
}
std::vector<int> convert_line_into_ints(std::string line);
inline vector<string> split(const string &s, char delim) {
vector<string> elems;
stringstream ss(s);
string item;
while (std::getline(ss, item, delim)) {
if (!item.empty()) {
elems.push_back(item);
}
}
return move(elems);
}
string getline(FILE *fp) {
char buffer[256];
if (!fgets(buffer, 256, fp))
return "";
size_t length = strlen(buffer);
if (length > 0 && buffer[length - 1] == '\n')
buffer[--length] = '\0';
return buffer;
}
vector<string> getlines(FILE *fp) {
vector<string> lines;
while (fp) {
std::string line = getline(fp);
if (line.length() >= 1)
lines.emplace_back(move(line));
else
break;
}
return move(lines);
}
std::vector<int> convert_line_into_ints(string line) {
auto func = [](string str) { return stoi(str); };
return map_vector(split(line, ' '), func);
}
int q(vector<vector<int>> &values) {
auto N = values[0][0];
auto H = values[1][0];
auto W = values[2][0];
return (N - H + 1) * (N - W + 1);
}
int main(int argc, char *argv[]) {
auto lines = getlines();
auto values = map_vector(lines, convert_line_into_ints);
std::cout << q(values) << endl;
return 0;
}
| [
"identifier.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 949,589 | 949,590 | u331542638 | cpp |
p03155 | #include <iostream>
using namespace std;
int main() {
int n, h, w;
cin >> n >> w;
cout << (n - w + 1) * (n - h + 1) << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, h, w;
cin >> n >> h >> w;
cout << (n - w + 1) * (n - h + 1) << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 949,597 | 949,598 | u734519000 | cpp |
p03156 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a, b;
cin >> a >> b;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
}
// A点以下の数、A+1点以上B点以下の数、B+1点以上の数のminimum
int prob1_cnt = 0, prob2_cnt = 0, prob3_cnt;
for (int i = 0; i < n; i++) {
if (p.at(i) <= a)
prob1_cnt++;
else if (p.at(i) > a && p.at(i) <= b)
prob2_cnt++;
else
prob3_cnt++;
}
cout << min(min(prob1_cnt, prob2_cnt), prob3_cnt) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a, b;
cin >> a >> b;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
}
int prob1_cnt = 0, prob2_cnt = 0, prob3_cnt = 0;
for (int i = 0; i < n; i++) {
if (p.at(i) <= a)
prob1_cnt++;
else if (p.at(i) > a && p.at(i) <= b)
prob2_cnt++;
else
prob3_cnt++;
}
cout << min(min(prob1_cnt, prob2_cnt), prob3_cnt) << endl;
return 0;
}
| [
"variable_declaration.value.change"
] | 949,603 | 949,604 | u729703601 | cpp |
p03156 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
vector<int> v(3);
for (int i = 0; i < n; i++) {
int p;
cin >> p;
v[p <= a + p <= b]++;
}
cout << *min_element(v.begin(), v.end()) << "\n";
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
vector<int> v(3);
for (int i = 0; i < n; i++) {
int p;
cin >> p;
v[(p <= a) + (p <= b)]++;
}
cout << *min_element(v.begin(), v.end()) << "\n";
}
| [] | 949,607 | 949,608 | u532573979 | cpp |
p03156 | #include <bits/stdc++.h>
using namespace std;
#include <iomanip>
#include <math.h>
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = 1001001001;
vector<pair<int64_t, int64_t>> prime_factorize(int64_t x) {
vector<pair<int64_t, int64_t>> p;
for (int64_t i = 2; i * i <= x; i++) {
int cnt = 0;
if (x % i == 0) {
while (x % i == 0) {
cnt++;
x /= i;
}
p.push_back(make_pair(i, cnt));
}
}
if (x != 1) {
p.push_back(make_pair(x, 1));
}
return p;
}
int main() {
int N, A, B;
cin >> N >> A >> B;
vector<int> P(N);
map<int, int> k;
k[0] = 0, k[1] = 0, k[2] = 0;
for (int i = 0; i < N; i++) {
cin >> P[i];
if (P[i] <= A) {
k[0]++;
}
if (P[i] > A && P[i] <= B) {
k[1]++;
} else {
k[2]++;
}
}
int MIN = 999;
for (auto c : k) {
MIN = min(MIN, c.second);
}
cout << MIN << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#include <iomanip>
#include <math.h>
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = 1001001001;
vector<pair<int64_t, int64_t>> prime_factorize(int64_t x) {
vector<pair<int64_t, int64_t>> p;
for (int64_t i = 2; i * i <= x; i++) {
int cnt = 0;
if (x % i == 0) {
while (x % i == 0) {
cnt++;
x /= i;
}
p.push_back(make_pair(i, cnt));
}
}
if (x != 1) {
p.push_back(make_pair(x, 1));
}
return p;
}
int main() {
int N, A, B;
cin >> N >> A >> B;
vector<int> P(N);
map<int, int> k;
k[0] = 0, k[1] = 0, k[2] = 0;
for (int i = 0; i < N; i++) {
cin >> P[i];
if (P[i] <= A) {
k[0]++;
} else if (P[i] > A && P[i] <= B) {
k[1]++;
} else {
k[2]++;
}
}
int MIN = 999;
for (auto c : k) {
MIN = min(MIN, c.second);
}
cout << MIN << endl;
return 0;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 949,615 | 949,616 | u209457657 | cpp |
p03156 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int c1 = 0, c2 = 0, c3 = 0;
for (int i = 0; i < n; ++i) {
int p;
p++;
if (p <= a)
c1++;
else if (p <= b)
c2++;
else
c3++;
}
cout << min({c1, c2, c3}) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int c1 = 0, c2 = 0, c3 = 0;
for (int i = 0; i < n; ++i) {
int p;
cin >> p;
if (p <= a)
c1++;
else if (p <= b)
c2++;
else
c3++;
}
cout << min({c1, c2, c3}) << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 949,619 | 949,620 | u174509352 | cpp |
p03156 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <climits>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <functional>
#include <iomanip> //setprecision
#include <iostream>
#include <map> // map
#include <math.h>
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define mod 1000000007
vector<ll> to[1000005];
int main() {
ll a, b, c = 0, d = 0, e = 0, f, g;
cin >> a >> f >> g;
rep(i, a) {
cin >> b;
if (b <= f)
c++;
else if (b >= g)
e++;
else
d++;
}
cout << min({c, d, e});
}
| #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <climits>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <functional>
#include <iomanip> //setprecision
#include <iostream>
#include <map> // map
#include <math.h>
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define mod 1000000007
vector<ll> to[1000005];
int main() {
ll a, b, c = 0, d = 0, e = 0, f, g;
cin >> a >> f >> g;
rep(i, a) {
cin >> b;
if (b <= f)
c++;
else if (b <= g)
e++;
else
d++;
}
cout << min({c, d, e});
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 949,621 | 949,622 | u683078179 | cpp |
p03156 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const double PI = acos(-1);
// long long
using ll = long long;
//出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin() end()
#define all(x) (x).begin(), (x).end()
// for
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
//最大公約数（ll）
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
//素因数分解
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> res;
for (ll i = 2; i * i <= n; ++i) {
if (n % i)
continue;
res.emplace_back(i, 0);
while (n % i == 0) {
n /= i;
res.back().second++;
}
}
if (n != 1)
res.emplace_back(n, 1);
return res;
}
// // 二分探索(最小値を出す問題は疑う)
// bool C(ll x){
// ll res = 0;
// for(int i = 0; i < N; ++i){
// res += max(0ll, A[i]-x/F[i]);
// }
// return res <= K;
// }
// ll binary_search(ll ok, ll ng){
// while(abs(ok - ng) > 1){
// ll mid = (ok + ng) / 2;
// if(C(mid)) ok = mid;
// else ng = mid;
// }
// return ok;
// }
int main() {
int N;
cin >> N;
int A, B;
cin >> A >> B;
int first, second, third;
REP(i, N) {
int p;
cin >> p;
if (p <= A)
first++;
else if (p <= B)
second++;
else
third++;
}
int ans = min(first, min(second, third));
print(ans);
} | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const double PI = acos(-1);
// long long
using ll = long long;
//出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin() end()
#define all(x) (x).begin(), (x).end()
// for
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
//最大公約数（ll）
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
//素因数分解
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> res;
for (ll i = 2; i * i <= n; ++i) {
if (n % i)
continue;
res.emplace_back(i, 0);
while (n % i == 0) {
n /= i;
res.back().second++;
}
}
if (n != 1)
res.emplace_back(n, 1);
return res;
}
// // 二分探索(最小値を出す問題は疑う)
// bool C(ll x){
// ll res = 0;
// for(int i = 0; i < N; ++i){
// res += max(0ll, A[i]-x/F[i]);
// }
// return res <= K;
// }
// ll binary_search(ll ok, ll ng){
// while(abs(ok - ng) > 1){
// ll mid = (ok + ng) / 2;
// if(C(mid)) ok = mid;
// else ng = mid;
// }
// return ok;
// }
int main() {
int N;
cin >> N;
int A, B;
cin >> A >> B;
int first = 0, second = 0, third = 0;
REP(i, N) {
int p;
cin >> p;
if (p <= A)
first++;
else if (p <= B)
second++;
else
third++;
}
int ans = min(first, min(second, third));
print(ans);
} | [
"variable_declaration.value.change"
] | 949,634 | 949,635 | u832995587 | cpp |
p03156 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
struct point {
int x;
int y;
};
int i, j, k, count1 = 0, count2 = 0;
int main() {
int n, a, b;
cin >> n >> a >> b;
int x;
vector<int> vec(3, 0);
rep(i, n) {
cin >> x;
if (x <= a)
vec[0]++;
if (x > a && b <= b)
vec[1]++;
if (x > b)
vec[2]++;
}
sort(vec.begin(), vec.end());
cout << vec[0] << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
struct point {
int x;
int y;
};
int i, j, k, count1 = 0, count2 = 0;
int main() {
int n, a, b;
cin >> n >> a >> b;
int x;
vector<int> vec(3, 0);
rep(i, n) {
cin >> x;
if (x <= a)
vec[0]++;
if (x > a && x <= b)
vec[1]++;
if (x > b)
vec[2]++;
}
sort(vec.begin(), vec.end());
cout << vec[0] << endl;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 949,636 | 949,637 | u225660136 | cpp |
p03156 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fr(i, n) for (ll i = 0; i < (n); ++i)
#define Fr(i, n) for (long long i = 1; i <= (n); ++i)
#define ifr(i, n) for (long long i = (n)-1; i >= 0; --i)
#define iFr(i, n) for (long long i = (n); i > 0; --i)
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int a, b, c, r1, r2, r3;
r1 = 0;
r2 = 0;
r3 = 0;
cin >> a >> b >> c;
fr(i, a) {
int x;
cin >> x;
if (x > b) {
if (x < c) {
++r2;
} else {
++r3;
}
} else {
++r1;
}
}
cout << min(r1, min(r2, r3));
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fr(i, n) for (ll i = 0; i < (n); ++i)
#define Fr(i, n) for (long long i = 1; i <= (n); ++i)
#define ifr(i, n) for (long long i = (n)-1; i >= 0; --i)
#define iFr(i, n) for (long long i = (n); i > 0; --i)
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int a, b, c, r1, r2, r3;
r1 = 0;
r2 = 0;
r3 = 0;
cin >> a >> b >> c;
fr(i, a) {
int x;
cin >> x;
if (x > b) {
if (x <= c) {
++r2;
} else {
++r3;
}
} else {
++r1;
}
}
cout << min(r1, min(r2, r3));
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 949,638 | 949,639 | u608493167 | cpp |
p03156 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int INF = 1e9 + 7;
signed main() {
int N, A, B;
cin >> N >> A >> B;
vector<int> P(N);
int cnt = 0;
int cnt2 = 0;
int cnt3 = 0;
for (int i = 0; i < N; i++) {
cin >> P[i];
if (P[i] > A && P[i] <= B) {
cnt++;
} else if (P[i] < A) {
cnt2++;
} else {
cnt3++;
}
}
cout << min(min(cnt, cnt2), cnt3) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
int INF = 1e9 + 7;
signed main() {
int N, A, B;
cin >> N >> A >> B;
vector<int> P(N);
int cnt = 0;
int cnt2 = 0;
int cnt3 = 0;
for (int i = 0; i < N; i++) {
cin >> P[i];
if (P[i] > A && P[i] <= B) {
cnt++;
} else if (P[i] <= A) {
cnt2++;
} else {
cnt3++;
}
}
cout << min(min(cnt, cnt2), cnt3) << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 949,640 | 949,641 | u237390401 | cpp |
p03156 | #include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
#define int long long
#define double long double
#define all(a) (a).begin(), (a).end()
#define sz(x) (int)x.size()
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define endl "\n"
#define f(i, l, r) for (int i = l; i <= r; i++)
#define rf(i, r, l) for (int i = r; i >= l; i--)
#define bp __builtin_popcountll
#define inf 3e15
const int N = 2e5 + 5;
const int MAXN = 2e5 + 5;
const int M = 1e9 + 7;
void solve() {
int n, aa, bb;
cin >> n >> aa >> bb;
int f1 = 0, f2 = 0, f3 = 0;
int a[n];
f(i, 0, n - 1) {
cin >> a[i];
if (a[i] < aa)
f1++;
else if (a[i] > bb)
f3++;
else
f2++;
}
int ans = min(f1, min(f2, f3));
cout << ans;
}
signed main() {
FAST int t = 1;
// cin>>t;
for (int tc = 1; tc <= t; tc++) {
// cout<<"Case #"<<tc<<": ";
solve();
}
}
| #include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
#define int long long
#define double long double
#define all(a) (a).begin(), (a).end()
#define sz(x) (int)x.size()
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define endl "\n"
#define f(i, l, r) for (int i = l; i <= r; i++)
#define rf(i, r, l) for (int i = r; i >= l; i--)
#define bp __builtin_popcountll
#define inf 3e15
const int N = 2e5 + 5;
const int MAXN = 2e5 + 5;
const int M = 1e9 + 7;
void solve() {
int n, aa, bb;
cin >> n >> aa >> bb;
int f1 = 0, f2 = 0, f3 = 0;
int a[n];
f(i, 0, n - 1) {
cin >> a[i];
if (a[i] <= aa)
f1++;
else if (a[i] > bb)
f3++;
else
f2++;
}
int ans = min(f1, min(f2, f3));
cout << ans;
}
signed main() {
FAST int t = 1;
// cin>>t;
for (int tc = 1; tc <= t; tc++) {
// cout<<"Case #"<<tc<<": ";
solve();
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 949,644 | 949,645 | u224481909 | cpp |
p03156 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const double PI = 3.14159265358979;
const ll INF = pow(10, 18);
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
string abc = "abcdefghijklmnopqrstuvwxyz";
string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main() {
ll n, a, b;
cin >> n >> a >> b;
vl p(n);
ll cnt1 = 0, cnt2 = 0, cnt3 = 0;
rep(i, n) {
cin >> p[i];
if (p[i] <= a) {
cnt1++;
} else if (p[i] >= b + i) {
cnt3++;
} else
cnt2++;
}
cout << min(cnt1, min(cnt2, cnt3)) << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const double PI = 3.14159265358979;
const ll INF = pow(10, 18);
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
string abc = "abcdefghijklmnopqrstuvwxyz";
string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main() {
ll n, a, b;
cin >> n >> a >> b;
vl p(n);
ll cnt1 = 0, cnt2 = 0, cnt3 = 0;
rep(i, n) {
cin >> p[i];
if (p[i] <= a) {
cnt1++;
} else if (p[i] >= b + 1) {
cnt3++;
} else
cnt2++;
}
cout << min(cnt1, min(cnt2, cnt3)) << endl;
} | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 949,655 | 949,656 | u328811800 | cpp |
p03156 | #include <iostream>
//#include <iomanip>
//#include <string>
//#include <vector>
#include <algorithm>
//#include <utility>
//#include <set>
//#include <map>
//#include <queue>
//#include <bitset>
//#include <math.h>
using namespace std;
// using ll = long long ;
// using ld = long double ;
// using vll = vector<ll> ;
// using vvll = vector<vll> ;
// using vc = vector<char> ;
// using vvc = vector<vc> ;
// using vb = vector<bool> ;
// using vvb = vector<vb> ;
// using pll = pair<ll,ll> ;
// ll mod = 1000000007 ;
// long double pie = acos(-1) ;
// string yorn(bool a){if(a) return"Yes" ; return "No" ;}
// string YorN(bool a){if(a) return"YES" ; return "NO" ;}
// ll gcd(long long a,long long b){if(b==0) return a ; return gcd(b,a%b) ;}
// ll lcm(long long a,long long b){return a/gcd(a,b)*b ;}
// ll sa(long long a,long long b){if(a>b) return a-b ; return b-a ;}
// void mysort(vector<long long> &a){sort(a.begin(),a.end()) ;}
// void myrev(vector<long long> &a){reverse(a.begin(),a.end()) ;}
int main() {
int n, a, b;
cin >> n >> a >> b;
int i, j, k;
i = j = k = 0;
for (int i = 0; i < n; i++) {
int p;
cin >> p;
if (p <= a)
i++;
else if (p <= b)
j++;
else
k++;
}
cout << min(i, min(j, k)) << endl;
}
| #include <iostream>
//#include <iomanip>
//#include <string>
//#include <vector>
#include <algorithm>
//#include <utility>
//#include <set>
//#include <map>
//#include <queue>
//#include <bitset>
//#include <math.h>
using namespace std;
// using ll = long long ;
// using ld = long double ;
// using vll = vector<ll> ;
// using vvll = vector<vll> ;
// using vc = vector<char> ;
// using vvc = vector<vc> ;
// using vb = vector<bool> ;
// using vvb = vector<vb> ;
// using pll = pair<ll,ll> ;
// ll mod = 1000000007 ;
// long double pie = acos(-1) ;
// string yorn(bool a){if(a) return"Yes" ; return "No" ;}
// string YorN(bool a){if(a) return"YES" ; return "NO" ;}
// ll gcd(long long a,long long b){if(b==0) return a ; return gcd(b,a%b) ;}
// ll lcm(long long a,long long b){return a/gcd(a,b)*b ;}
// ll sa(long long a,long long b){if(a>b) return a-b ; return b-a ;}
// void mysort(vector<long long> &a){sort(a.begin(),a.end()) ;}
// void myrev(vector<long long> &a){reverse(a.begin(),a.end()) ;}
int main() {
int n, a, b;
cin >> n >> a >> b;
int i, j, k;
i = j = k = 0;
for (int m = 0; m < n; m++) {
int p;
cin >> p;
if (p <= a)
i++;
else if (p <= b)
j++;
else
k++;
}
cout << min(i, min(j, k)) << endl;
}
| [
"variable_declaration.name.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 949,665 | 949,666 | u993074316 | cpp |
p03156 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A, B;
cin >> A >> B;
vector<int> P(N);
for (int i = 0; i < N; i++) {
cin >> P.at(i);
}
int an = 0;
int sw = 0;
int er = 0;
for (int i = 0; i < N; i++) {
if (P.at(i) <= A) {
an++;
}
if (P.at(i) > A && P.at(i) <= B) {
sw++;
}
if (P.at(i)) {
er++;
}
}
cout << min({an, sw, er}) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A, B;
cin >> A >> B;
vector<int> P(N);
for (int i = 0; i < N; i++) {
cin >> P.at(i);
}
int an = 0;
int sw = 0;
int er = 0;
for (int i = 0; i < N; i++) {
if (P.at(i) <= A) {
an++;
}
if (P.at(i) > A && P.at(i) <= B) {
sw++;
}
if (P.at(i) > B) {
er++;
}
}
cout << min({an, sw, er}) << endl;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 949,675 | 949,676 | u629548179 | cpp |
p03156 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long double ld;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
typedef pair<ll, ll> pairs;
bool pairCompare(const pair<double, ll> &firstElof,
const pair<double, ll> &secondElof) {
return firstElof.first < secondElof.first;
}
#define MAX_N 1000100
bool x[MAX_N];
ll num[MAX_N];
ll fibl[MAX_N] = {0};
// 四方向への移動ベクトル
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll fib(ll a) {
if (fibl[a] != 0)
return fibl[a];
if (a == 0) {
return 0;
} else if (a == 1) {
return 1;
}
return fibl[a] = fib(a - 1) + fib(a - 2);
}
ll eratosthenes(ll n) {
int p = 0;
for (ll i = 0; i <= n; ++i)
x[i] = true;
x[0] = x[1] = false;
for (int i = 2; i <= n; ++i) {
if (x[i]) {
p++;
for (int j = 2 * i; j <= n; j += i)
x[j] = false;
}
num[i] = p;
}
return p;
}
ll gcd(ll a, ll b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
ll keta(ll N) {
int tmp{};
while (N > 0) {
tmp += (N % 10);
N /= 10;
}
N = tmp;
return N;
}
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll c = 0, c2 = 0, c3 = 0;
for (ll i = 0; i < n; i++) {
ll x;
cin >> x;
if (x <= a) {
c++;
} else if (a < c and b >= c) {
c2++;
} else {
c3++;
}
}
cout << min(c, min(c2, c3)) << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long double ld;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
typedef pair<ll, ll> pairs;
bool pairCompare(const pair<double, ll> &firstElof,
const pair<double, ll> &secondElof) {
return firstElof.first < secondElof.first;
}
#define MAX_N 1000100
bool x[MAX_N];
ll num[MAX_N];
ll fibl[MAX_N] = {0};
// 四方向への移動ベクトル
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll fib(ll a) {
if (fibl[a] != 0)
return fibl[a];
if (a == 0) {
return 0;
} else if (a == 1) {
return 1;
}
return fibl[a] = fib(a - 1) + fib(a - 2);
}
ll eratosthenes(ll n) {
int p = 0;
for (ll i = 0; i <= n; ++i)
x[i] = true;
x[0] = x[1] = false;
for (int i = 2; i <= n; ++i) {
if (x[i]) {
p++;
for (int j = 2 * i; j <= n; j += i)
x[j] = false;
}
num[i] = p;
}
return p;
}
ll gcd(ll a, ll b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
ll keta(ll N) {
int tmp{};
while (N > 0) {
tmp += (N % 10);
N /= 10;
}
N = tmp;
return N;
}
int main() {
ll n, a, b;
cin >> n >> a >> b;
ll c = 0, c2 = 0, c3 = 0;
for (ll i = 0; i < n; i++) {
ll x;
cin >> x;
if (x <= a) {
c++;
} else if (x <= b) {
c2++;
} else {
c3++;
}
}
cout << min(c, min(c2, c3)) << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"control_flow.loop.for.initializer.change",
"variable_declaration.remove"
] | 949,677 | 949,678 | u273928723 | cpp |
p03156 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int p[n];
for (int i = 0; i < n; i++) {
cin >> p[i];
}
sort(p, p + n);
int ans[3];
for (int i = 0; i > 3; i++)
ans[i] = 0;
for (int i = 0; i < n; i++) {
if (p[i] <= a)
ans[0]++;
else if (p[i] >= a + 1 && p[i] <= b)
ans[1]++;
else if (p[i] >= b + 1)
ans[2]++;
}
cout << min(ans[0], min(ans[1], ans[2])) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int p[n];
for (int i = 0; i < n; i++) {
cin >> p[i];
}
sort(p, p + n);
int ans[3];
for (int i = 0; i < 3; i++)
ans[i] = 0;
for (int i = 0; i < n; i++) {
if (p[i] <= a)
ans[0]++;
else if (p[i] >= a + 1 && p[i] <= b)
ans[1]++;
else if (p[i] >= b + 1)
ans[2]++;
}
cout << min(ans[0], min(ans[1], ans[2])) << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 949,679 | 949,680 | u955282280 | cpp |
p03156 | #include <bits/stdc++.h>
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define rep(i, n) FOR(i, 0, n)
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
template <class T> inline bool chmax(T &a, const T &b) {
if (a >= b)
return false;
a = b;
return true;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (a <= b)
return false;
a = b;
return true;
}
/*-------------------------------------------*/
int n, a, b, p, x, y, z;
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
cin >> n >> a >> b;
rep(i, n) {
cin >> p;
if (p <= a)
x++;
else if (b <= p)
z++;
else
y++;
}
cout << min(min(x, y), z) << endl;
} | #include <bits/stdc++.h>
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define rep(i, n) FOR(i, 0, n)
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
template <class T> inline bool chmax(T &a, const T &b) {
if (a >= b)
return false;
a = b;
return true;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (a <= b)
return false;
a = b;
return true;
}
/*-------------------------------------------*/
int n, a, b, p, x, y, z;
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
cin >> n >> a >> b;
rep(i, n) {
cin >> p;
if (p <= a)
x++;
else if (b < p)
z++;
else
y++;
}
cout << min(min(x, y), z) << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 949,690 | 949,691 | u047554023 | cpp |
p03156 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define repprev(i, a, b) for (ll i = b - 1; i >= a; i--)
#define reprev(i, n) repprev(i, 0, n)
using namespace std;
#define sz(x) ((int)(x).size())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MEMSET(v, h) memset((v), h, sizeof(v))
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class T> int former(const vector<T> &v, T x) {
return upper_bound(v.begin(), v.end(), x) - v.begin() - 1;
}
template <class T> int latter(const vector<T> &v, T x) {
return lower_bound(v.begin(), v.end(), x) - v.begin();
}
#define pb push_back
#define mp make_pair
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define BIT_FLAG_0 (1 << 0) // 0000 0000 0000 0001
#define BIT_FLAG_1 (1 << 1) // 0000 0000 0000 0010
#define BIT_FLAG_2 (1 << 2) // 0000 0000 0000 0100
#define BIT_FLAG_3 (1 << 3) // 0000 0000 0000 1000
#define BIT_FLAG_4 (1 << 4) // 0000 0000 0001 0000
#define BIT_FLAG_5 (1 << 5) // 0000 0000 0010 0000
#define BIT_FLAG_6 (1 << 6) // 0000 0000 0100 0000
#define BIT_FLAG_7 (1 << 7) // 0000 0000 1000 0000
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
const ll LLINF = 1LL << 60;
const int INTINF = 1 << 30;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
struct UnionFind {
vector<ll> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(ll n) : par(n, -1) {}
void init(ll n) { par.assign(n, -1); }
ll root(ll x) {
if (par[x] < 0)
return x;
else
return par[x] = root(par[x]);
}
bool issame(ll x, ll y) { return root(x) == root(y); }
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (par[x] > par[y])
swap(x, y); // merge technique
par[x] += par[y];
par[y] = x;
return true;
}
ll size(ll x) { return -par[root(x)]; }
};
template <typename T>
vector<T> dijkstra(int s, vector<vector<pair<int, T>>> &G) {
const T INF = numeric_limits<T>::max();
using P = pair<T, int>;
int n = G.size();
vector<T> d(n, INF);
vector<int> b(n, -1);
priority_queue<P, vector<P>, greater<P>> q;
d[s] = 0;
q.emplace(d[s], s);
while (!q.empty()) {
P p = q.top();
q.pop();
int v = p.second;
if (d[v] < p.first)
continue;
for (auto &e : G[v]) {
int u = e.first;
T c = e.second;
if (d[u] > d[v] + c) {
d[u] = d[v] + c;
b[u] = v;
q.emplace(d[u], u);
}
}
}
return d;
}
vector<vector<int>> bfs(vector<string> &s, int sy, int sx, char wall, int dir) {
int h = s.size(), w = s.front().size();
vector<vector<int>> dp(h, vector<int>(w, -1));
using P = pair<int, int>;
queue<P> q;
dp[sy][sx] = 0;
q.emplace(sy, sx);
int dy[] = {1, -1, 0, 0, 1, 1, -1, -1};
int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
auto in = [&](int y, int x) { return 0 <= y && y < h && 0 <= x && x < w; };
while (!q.empty()) {
int y, x;
tie(y, x) = q.front();
q.pop();
for (int k = 0; k < dir; k++) {
int ny = y + dy[k], nx = x + dx[k];
if (!in(ny, nx) || s[ny][nx] == wall)
continue;
if (~dp[ny][nx])
continue;
dp[ny][nx] = dp[y][x] + 1;
q.emplace(ny, nx);
}
}
return dp;
}
int64_t power(int64_t x, int64_t n, int64_t mod) {
int64_t ret = 1;
while (n > 0) {
if (n & 1)
(ret *= x) %= mod;
(x *= x) %= mod;
n >>= 1;
}
return ret;
}
vector<int> sieve_of_eratosthenes(int n) {
vector<int> primes(n);
for (int i = 2; i < n; ++i)
primes[i] = i;
for (int i = 2; i * i < n; ++i)
if (primes[i])
for (int j = i * i; j < n; j += i)
primes[j] = 0;
return primes;
}
std::vector<ll> divisor(ll n) // nの約数を列挙
{
std::vector<ll> ret;
for (ll i = 1; i * i <= n; ++i) {
if (n % i == 0) {
ret.push_back(i);
if (i != 1 && i * i != n) {
ret.push_back(n / i);
}
}
}
return ret;
}
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int main(void) {
int N;
cin >> N;
int A, B;
cin >> A >> B;
vector<int> P(N);
rep(i, N) { cin >> P[i]; }
int ans = 0;
sort(all(P));
while (P.empty()) {
if (P[0] > A) {
cout << ans << endl;
return 0;
} else {
P.erase(P.begin());
}
if (*lower_bound(all(P), A + 1) > B ||
lower_bound(all(P), A + 1) == P.end()) {
cout << ans << endl;
return 0;
} else {
P.erase(lower_bound(all(P), A + 1));
}
if (lower_bound(all(P), B + 1) == P.end()) {
cout << ans << endl;
return 0;
} else {
P.erase(lower_bound(all(P), B + 1));
ans++;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define repprev(i, a, b) for (ll i = b - 1; i >= a; i--)
#define reprev(i, n) repprev(i, 0, n)
using namespace std;
#define sz(x) ((int)(x).size())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MEMSET(v, h) memset((v), h, sizeof(v))
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class T> int former(const vector<T> &v, T x) {
return upper_bound(v.begin(), v.end(), x) - v.begin() - 1;
}
template <class T> int latter(const vector<T> &v, T x) {
return lower_bound(v.begin(), v.end(), x) - v.begin();
}
#define pb push_back
#define mp make_pair
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define BIT_FLAG_0 (1 << 0) // 0000 0000 0000 0001
#define BIT_FLAG_1 (1 << 1) // 0000 0000 0000 0010
#define BIT_FLAG_2 (1 << 2) // 0000 0000 0000 0100
#define BIT_FLAG_3 (1 << 3) // 0000 0000 0000 1000
#define BIT_FLAG_4 (1 << 4) // 0000 0000 0001 0000
#define BIT_FLAG_5 (1 << 5) // 0000 0000 0010 0000
#define BIT_FLAG_6 (1 << 6) // 0000 0000 0100 0000
#define BIT_FLAG_7 (1 << 7) // 0000 0000 1000 0000
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
const ll LLINF = 1LL << 60;
const int INTINF = 1 << 30;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
struct UnionFind {
vector<ll> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(ll n) : par(n, -1) {}
void init(ll n) { par.assign(n, -1); }
ll root(ll x) {
if (par[x] < 0)
return x;
else
return par[x] = root(par[x]);
}
bool issame(ll x, ll y) { return root(x) == root(y); }
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (par[x] > par[y])
swap(x, y); // merge technique
par[x] += par[y];
par[y] = x;
return true;
}
ll size(ll x) { return -par[root(x)]; }
};
template <typename T>
vector<T> dijkstra(int s, vector<vector<pair<int, T>>> &G) {
const T INF = numeric_limits<T>::max();
using P = pair<T, int>;
int n = G.size();
vector<T> d(n, INF);
vector<int> b(n, -1);
priority_queue<P, vector<P>, greater<P>> q;
d[s] = 0;
q.emplace(d[s], s);
while (!q.empty()) {
P p = q.top();
q.pop();
int v = p.second;
if (d[v] < p.first)
continue;
for (auto &e : G[v]) {
int u = e.first;
T c = e.second;
if (d[u] > d[v] + c) {
d[u] = d[v] + c;
b[u] = v;
q.emplace(d[u], u);
}
}
}
return d;
}
vector<vector<int>> bfs(vector<string> &s, int sy, int sx, char wall, int dir) {
int h = s.size(), w = s.front().size();
vector<vector<int>> dp(h, vector<int>(w, -1));
using P = pair<int, int>;
queue<P> q;
dp[sy][sx] = 0;
q.emplace(sy, sx);
int dy[] = {1, -1, 0, 0, 1, 1, -1, -1};
int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
auto in = [&](int y, int x) { return 0 <= y && y < h && 0 <= x && x < w; };
while (!q.empty()) {
int y, x;
tie(y, x) = q.front();
q.pop();
for (int k = 0; k < dir; k++) {
int ny = y + dy[k], nx = x + dx[k];
if (!in(ny, nx) || s[ny][nx] == wall)
continue;
if (~dp[ny][nx])
continue;
dp[ny][nx] = dp[y][x] + 1;
q.emplace(ny, nx);
}
}
return dp;
}
int64_t power(int64_t x, int64_t n, int64_t mod) {
int64_t ret = 1;
while (n > 0) {
if (n & 1)
(ret *= x) %= mod;
(x *= x) %= mod;
n >>= 1;
}
return ret;
}
vector<int> sieve_of_eratosthenes(int n) {
vector<int> primes(n);
for (int i = 2; i < n; ++i)
primes[i] = i;
for (int i = 2; i * i < n; ++i)
if (primes[i])
for (int j = i * i; j < n; j += i)
primes[j] = 0;
return primes;
}
std::vector<ll> divisor(ll n) // nの約数を列挙
{
std::vector<ll> ret;
for (ll i = 1; i * i <= n; ++i) {
if (n % i == 0) {
ret.push_back(i);
if (i != 1 && i * i != n) {
ret.push_back(n / i);
}
}
}
return ret;
}
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int main(void) {
int N;
cin >> N;
int A, B;
cin >> A >> B;
vector<int> P(N);
rep(i, N) { cin >> P[i]; }
int ans = 0;
sort(all(P));
while (!P.empty()) {
if (P[0] > A) {
cout << ans << endl;
return 0;
} else {
P.erase(P.begin());
}
if (*lower_bound(all(P), A + 1) > B ||
lower_bound(all(P), A + 1) == P.end()) {
cout << ans << endl;
return 0;
} else {
P.erase(lower_bound(all(P), A + 1));
}
if (lower_bound(all(P), B + 1) == P.end()) {
cout << ans << endl;
return 0;
} else {
P.erase(lower_bound(all(P), B + 1));
ans++;
}
}
cout << ans << endl;
}
| [
"expression.operation.unary.add",
"control_flow.loop.condition.change"
] | 949,692 | 949,693 | u135572611 | cpp |
p03156 | #define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define scan(n, v) \
v.resize(n); \
rep(i, n) { cin >> v[i]; }
#define MOD 1000000007ll
#define Yes(flag) cout << ((flag) ? "Yes" : "No");
#define YES(flag) cout << ((flag) ? "YES" : "NO");
#define be begin
#define pb push_back
#define fi first
#define se second
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
template <class T> T chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> T chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
//------------------------------------------------------
ll n, a, b;
void input() { cin >> n >> a >> b; }
void src() {
int c1, c2, c3;
rep(i, n) {
int p;
cin >> p;
if (p <= a) {
c1++;
} else if (p <= b) {
c2++;
} else {
c3++;
}
}
cout << min({c1, c2, c3});
}
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
// ifstream in( argv[1] ); cin.rdbuf(in.rdbuf());
input();
src();
return 0;
} | #define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define scan(n, v) \
v.resize(n); \
rep(i, n) { cin >> v[i]; }
#define MOD 1000000007ll
#define Yes(flag) cout << ((flag) ? "Yes" : "No");
#define YES(flag) cout << ((flag) ? "YES" : "NO");
#define be begin
#define pb push_back
#define fi first
#define se second
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
template <class T> T chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> T chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
//------------------------------------------------------
ll n, a, b;
void input() { cin >> n >> a >> b; }
void src() {
int c1 = 0, c2 = 0, c3 = 0;
rep(i, n) {
int p;
cin >> p;
if (p <= a) {
c1++;
} else if (p <= b) {
c2++;
} else {
c3++;
}
}
cout << min({c1, c2, c3});
}
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
// ifstream in( argv[1] ); cin.rdbuf(in.rdbuf());
input();
src();
return 0;
} | [
"variable_declaration.value.change"
] | 949,694 | 949,695 | u954176652 | cpp |
p03156 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int i, j, cnt = 0;
int n, a, b;
cin >> n;
cin >> a >> b;
int p[n];
for (i = 0; i < n; i++)
cin >> p[i];
int p1 = 0, p2 = 0, p3 = 0;
for (i = 0; i < n; i++) {
if (p[i] <= a)
p1++;
if (a < p[i] && p[i] <= b)
p2++;
else
p3++;
}
cout << min(p1, min(p2, p3));
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int i, j, cnt = 0;
int n, a, b;
cin >> n;
cin >> a >> b;
int p[n];
for (i = 0; i < n; i++)
cin >> p[i];
int p1 = 0, p2 = 0, p3 = 0;
for (i = 0; i < n; i++) {
if (p[i] <= a)
p1++;
else if (a < p[i] && p[i] <= b)
p2++;
else
p3++;
}
cout << min(p1, min(p2, p3));
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 949,704 | 949,705 | u952130512 | cpp |
p03156 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF (1ll << 60)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
using vl = vector<ll>;
using vvl = vector<vl>;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int MOD = 1000000007;
using ll = long long;
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;
}
void print(const std::vector<int> &v) {
std::for_each(v.begin(), v.end(), [](int x) { std::cout << x << " "; });
std::cout << std::endl;
}
int main() {
int N, A, B;
cin >> N >> A >> B;
vector<int> P(N);
REP(i, N) { cin >> P[i]; }
map<int, int> cnt;
REP(i, N) {
if (P[i] <= A) {
cnt[0]++;
}
if (A + 1 <= P[i] and P[i] <= B) {
cnt[1]++;
}
if (P[i] >= B + 1) {
cnt[2]++;
}
}
int ans = 0;
REP(i, 3) { ans = min(ans, cnt[i]); }
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF (1ll << 60)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
using vl = vector<ll>;
using vvl = vector<vl>;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int MOD = 1000000007;
using ll = long long;
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;
}
void print(const std::vector<int> &v) {
std::for_each(v.begin(), v.end(), [](int x) { std::cout << x << " "; });
std::cout << std::endl;
}
int main() {
int N, A, B;
cin >> N >> A >> B;
vector<int> P(N);
REP(i, N) { cin >> P[i]; }
map<int, int> cnt;
REP(i, N) {
if (P[i] <= A) {
cnt[0]++;
}
if (A + 1 <= P[i] and P[i] <= B) {
cnt[1]++;
}
if (P[i] >= B + 1) {
cnt[2]++;
}
}
int ans = 100;
REP(i, 3) { ans = min(ans, cnt[i]); }
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 949,710 | 949,711 | u824337972 | cpp |
p03156 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rreps(i, e, n) for (int i = (n)-1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define uniq(x) (x).erase(unique((x).begin(), (x).end()), (x).end())
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, A, B;
cin >> N >> A >> B;
int ecnt, mcnt, dcnt;
rep(i, N) {
int p;
cin >> p;
if (p <= A) {
ecnt++;
} else if (p > B) {
dcnt++;
} else {
mcnt++;
}
}
cout << min(ecnt, min(mcnt, dcnt)) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rreps(i, e, n) for (int i = (n)-1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define uniq(x) (x).erase(unique((x).begin(), (x).end()), (x).end())
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, A, B;
cin >> N >> A >> B;
int ecnt = 0, mcnt = 0, dcnt = 0;
rep(i, N) {
int p;
cin >> p;
if (p <= A) {
ecnt++;
} else if (p > B) {
dcnt++;
} else {
mcnt++;
}
}
cout << min(ecnt, min(mcnt, dcnt)) << endl;
return 0;
} | [
"variable_declaration.value.change"
] | 949,716 | 949,717 | u225581241 | cpp |
p03156 | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); i++)
#define FOR(i, a, b) for (int(i) = a; (i) < (int)b; i++)
#define RREP(i, n) for (int(i) = ((int)(n)-1); (i) >= 0; i--)
#define RFOR(i, a, b) for (int(i) = ((int)(b)-1); (i) >= (int)a; i--)
#define ALL(v) (v).begin(), (v).end()
#define MOD 1000000007
#define FI first
#define SE second
#define MP make_pair
#define PB push_back
#define SZ(x) (int)x.size()
#define SP(x) setprecision((int)x)
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vint> vvint;
typedef vector<string> vstr;
typedef pair<int, int> pii;
const int INF = 1e9;
const ll LINF = 1e18;
const double EPS = 1e-9;
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; } //最小公倍数
int main() {
int n, a, b;
cin >> n >> a >> b;
int cnt1 = 0;
int cnt2 = 0;
int cnt3 = 0;
REP(i, n) {
int c;
cin >> c;
if (c <= a) {
cnt1++;
} else if (a > c && c <= b) {
cnt2++;
} else {
cnt3++;
}
}
cout << min({cnt1, cnt2, cnt3}) << endl;
return 0;
}
| #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); i++)
#define FOR(i, a, b) for (int(i) = a; (i) < (int)b; i++)
#define RREP(i, n) for (int(i) = ((int)(n)-1); (i) >= 0; i--)
#define RFOR(i, a, b) for (int(i) = ((int)(b)-1); (i) >= (int)a; i--)
#define ALL(v) (v).begin(), (v).end()
#define MOD 1000000007
#define FI first
#define SE second
#define MP make_pair
#define PB push_back
#define SZ(x) (int)x.size()
#define SP(x) setprecision((int)x)
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vint> vvint;
typedef vector<string> vstr;
typedef pair<int, int> pii;
const int INF = 1e9;
const ll LINF = 1e18;
const double EPS = 1e-9;
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; } //最小公倍数
int main() {
int n, a, b;
cin >> n >> a >> b;
int cnt1 = 0;
int cnt2 = 0;
int cnt3 = 0;
REP(i, n) {
int c;
cin >> c;
if (c <= a) {
cnt1++;
} else if (a < c && c <= b) {
cnt2++;
} else {
cnt3++;
}
}
cout << min({cnt1, cnt2, cnt3}) << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 949,720 | 949,721 | u852449189 | cpp |
p03156 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
#define rep(i, N) for (int i = 0; i < (int)N; i++)
using namespace std;
typedef long long ll;
const ll LLINF = 9223372036854775807;
const int INF = pow(2, 29);
const int MOD = 1000000007;
int main() {
int N, A, B;
cin >> N >> A >> B;
int x = 0, y = 0, z = 0;
rep(i, N) {
int P;
cin >> P;
if (P <= N)
x++;
else if (P <= B)
y++;
else
z++;
}
int result = min(x, min(y, z));
cout << result << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
#define rep(i, N) for (int i = 0; i < (int)N; i++)
using namespace std;
typedef long long ll;
const ll LLINF = 9223372036854775807;
const int INF = pow(2, 29);
const int MOD = 1000000007;
int main() {
int N, A, B;
cin >> N >> A >> B;
int x = 0, y = 0, z = 0;
rep(i, N) {
int P;
cin >> P;
if (P <= A)
x++;
else if (P <= B)
y++;
else
z++;
}
int result = min(x, min(y, z));
cout << result << endl;
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 949,724 | 949,725 | u680707192 | cpp |
p03156 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll arr[3];
int main() {
memset(arr, 0, sizeof(arr));
ll n, a, b;
cin >> n >> a >> b;
for (int i = 0; i < n; i++) {
int m;
cin >> m;
if (m < a)
arr[0]++;
else if (m >= a + 1 && m <= b)
arr[1]++;
else if (m >= b + 1)
arr[2]++;
}
sort(arr, arr + 3);
printf("%lld", arr[0]);
} | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll arr[3];
int main() {
memset(arr, 0, sizeof(arr));
ll n, a, b;
cin >> n >> a >> b;
for (int i = 0; i < n; i++) {
int m;
cin >> m;
if (m <= a)
arr[0]++;
else if (m >= a + 1 && m <= b)
arr[1]++;
else if (m >= b + 1)
arr[2]++;
}
sort(arr, arr + 3);
printf("%lld", arr[0]);
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 949,730 | 949,731 | u935016091 | cpp |
p03156 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll arr[3];
int main() {
memset(arr, 0, sizeof(arr));
ll n, a, b;
cin >> n >> a >> b;
for (int i = 0; i < n; i++) {
int m;
cin >> m;
if (m > 0 && m < a)
arr[0]++;
else if (m >= a + 1 && m <= b)
arr[1]++;
else if (m >= b + 1)
arr[2]++;
}
sort(arr, arr + 3);
printf("%lld", arr[0]);
} | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll arr[3];
int main() {
memset(arr, 0, sizeof(arr));
ll n, a, b;
cin >> n >> a >> b;
for (int i = 0; i < n; i++) {
int m;
cin >> m;
if (m <= a)
arr[0]++;
else if (m >= a + 1 && m <= b)
arr[1]++;
else if (m >= b + 1)
arr[2]++;
}
sort(arr, arr + 3);
printf("%lld", arr[0]);
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 949,733 | 949,731 | u935016091 | cpp |
p03156 | #include <bits/stdc++.h>
using namespace std;
// Compiler version g++ 6.3.0
int main() {
int n, a, b;
cin >> n >> a >> b;
int x = 0, y = 0, z = 0;
for (int i = 0; i < n; i++) {
int t;
cin >> t;
if (t <= a) {
x++;
} else if (b <= t) {
y++;
} else {
z++;
}
}
int ans;
if (x <= y && x <= z) {
ans = x;
} else if (y <= x && y <= z) {
ans = y;
} else {
ans = z;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
// Compiler version g++ 6.3.0
int main() {
int n, a, b;
cin >> n >> a >> b;
int x = 0, y = 0, z = 0;
for (int i = 0; i < n; i++) {
int t;
cin >> t;
if (t <= a) {
x++;
} else if (t <= b) {
y++;
} else {
z++;
}
}
int ans;
if (x <= y && x <= z) {
ans = x;
} else if (y <= x && y <= z) {
ans = y;
} else {
ans = z;
}
cout << ans << endl;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 949,734 | 949,735 | u483156389 | cpp |
p03156 | #include <bits/stdc++.h>
using namespace std;
// Compiler version g++ 6.3.0
int main() {
int n, a, b;
cin >> n >> a >> b;
int x = 0, y = 0, z = 0;
for (int i = 0; i < n; i++) {
int t;
cin >> t;
if (t < a) {
x++;
} else if (b < t) {
y++;
} else {
z++;
}
}
int ans;
if (x <= y && x <= z) {
ans = x;
} else if (y <= x && y <= z) {
ans = y;
} else {
ans = z;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
// Compiler version g++ 6.3.0
int main() {
int n, a, b;
cin >> n >> a >> b;
int x = 0, y = 0, z = 0;
for (int i = 0; i < n; i++) {
int t;
cin >> t;
if (t <= a) {
x++;
} else if (t <= b) {
y++;
} else {
z++;
}
}
int ans;
if (x <= y && x <= z) {
ans = x;
} else if (y <= x && y <= z) {
ans = y;
} else {
ans = z;
}
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 949,736 | 949,735 | u483156389 | cpp |
p03156 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
int main() {
int n, i, j, k, a, b;
cin >> n >> a >> b;
int p[n];
int ca = 0, cb = 0, cc = 0;
for (i = 0; i < n; i++) {
cin >> p[i];
if (p[i] <= a)
ca++;
if (p[i] > b)
cc++;
else
cb++;
}
cout << min(ca, min(cb, cc));
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
int main() {
int n, i, j, k, a, b;
cin >> n >> a >> b;
int p[n];
int ca = 0, cb = 0, cc = 0;
for (i = 0; i < n; i++) {
cin >> p[i];
if (p[i] <= a)
ca++;
else if (p[i] > b)
cc++;
else
cb++;
}
cout << min(ca, min(cb, cc));
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 949,739 | 949,740 | u573483192 | cpp |
p03156 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
vector<int> P(N);
for (int i = 0; i < N; i++) {
cin >> P.at(i);
}
vector<int> count(3);
for (int i = 0; i < N; i++) {
if (P.at(i) < A) {
count.at(0)++;
} else if (P.at(i) < B) {
count.at(1)++;
} else {
count.at(2)++;
}
}
sort(count.begin(), count.end());
cout << count.at(0) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
vector<int> P(N);
for (int i = 0; i < N; i++) {
cin >> P.at(i);
}
vector<int> count(3);
for (int i = 0; i < N; i++) {
if (P.at(i) <= A) {
count.at(0)++;
} else if (P.at(i) <= B) {
count.at(1)++;
} else {
count.at(2)++;
}
}
sort(count.begin(), count.end());
cout << count.at(0) << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 949,741 | 949,742 | u989696545 | cpp |
p03156 | #include <bits/stdc++.h>
using namespace std;
int p[205];
int main() {
int n, a, b;
cin >> n >> a >> b;
for (int i = 0; i < n; i++)
cin >> p[i];
sort(p, p + n);
int ans = 0;
int c1 = 0, c2 = 0, c3 = 0;
for (int i = 0; i < n; i++) {
if (p[i] < a)
c1++;
else if (p[i] > b)
c3++;
else
c2++;
}
cout << min(c1, min(c2, c3));
} | #include <bits/stdc++.h>
using namespace std;
int p[205];
int main() {
int n, a, b;
cin >> n >> a >> b;
for (int i = 0; i < n; i++)
cin >> p[i];
sort(p, p + n);
int ans = 0;
int c1 = 0, c2 = 0, c3 = 0;
for (int i = 0; i < n; i++) {
if (p[i] <= a)
c1++;
else if (p[i] > b)
c3++;
else
c2++;
}
cout << min(c1, min(c2, c3));
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 949,743 | 949,744 | u385577213 | cpp |
p03156 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int N, A, B, i, j, k, p1, p2, p3;
cin >> N;
cin >> A >> B;
int P[N];
for (i = 0; i < N; i++)
cin >> P[i];
p1 = 0;
p2 = 0;
p3 = 0;
for (i = 0; i < N; i++) {
if (P[i] <= A)
p1 += 1;
else if (P[i] <= B)
p2 += 1;
else
p3 += 1;
}
if (p1 >= p2)
k = p2;
if (k >= p3)
k = p3;
cout << k;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int N, A, B, i, j, k, p1, p2, p3;
cin >> N;
cin >> A >> B;
int P[N];
for (i = 0; i < N; i++)
cin >> P[i];
p1 = 0;
p2 = 0;
p3 = 0;
for (i = 0; i < N; i++) {
if (P[i] <= A)
p1 += 1;
else if (P[i] <= B)
p2 += 1;
else
p3 += 1;
}
if (p1 >= p2)
k = p2;
else
k = p1;
if (k >= p3)
k = p3;
cout << k;
return 0;
}
| [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add"
] | 949,757 | 949,758 | u809278162 | cpp |
p03156 | // https://atcoder.jp/contests/aising2019/tasks/aising2019_b
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#ifdef BTK
#define DEBUG if (1)
#else
#define CIN_ONLY if (1)
struct cww {
cww() {
CIN_ONLY {
ios::sync_with_stdio(false);
cin.tie(0);
}
}
} star;
#define DEBUG if (0)
#endif
#define ALL(v) (v).begin(), (v).end()
#define REC(ret, ...) std::function<ret(__VA_ARGS__)>
template <typename T> inline bool chmin(T &l, T r) {
bool a = l > r;
if (a)
l = r;
return a;
}
template <typename T> inline bool chmax(T &l, T r) {
bool a = l < r;
if (a)
l = r;
return a;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &it : v)
is >> it;
return is;
}
class range {
private:
struct I {
int x;
int operator*() { return x; }
bool operator!=(I &lhs) { return x < lhs.x; }
void operator++() { ++x; }
};
I i, n;
public:
range(int n) : i({0}), n({n}) {}
range(int i, int n) : i({i}), n({n}) {}
I &begin() { return i; }
I &end() { return n; }
};
int main() {
int N, A, B;
cin >> N >> A >> B;
int cnt[3] = {};
for (int i : range(N)) {
int p;
cin >> p;
if (p <= A) {
cnt[0]++;
} else if (p <= B) {
cnt[1]++;
} else {
cnt[2]++;
}
}
cout << *min_element(cnt, cnt + 2) << endl;
return 0;
} | // https://atcoder.jp/contests/aising2019/tasks/aising2019_b
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#ifdef BTK
#define DEBUG if (1)
#else
#define CIN_ONLY if (1)
struct cww {
cww() {
CIN_ONLY {
ios::sync_with_stdio(false);
cin.tie(0);
}
}
} star;
#define DEBUG if (0)
#endif
#define ALL(v) (v).begin(), (v).end()
#define REC(ret, ...) std::function<ret(__VA_ARGS__)>
template <typename T> inline bool chmin(T &l, T r) {
bool a = l > r;
if (a)
l = r;
return a;
}
template <typename T> inline bool chmax(T &l, T r) {
bool a = l < r;
if (a)
l = r;
return a;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &it : v)
is >> it;
return is;
}
class range {
private:
struct I {
int x;
int operator*() { return x; }
bool operator!=(I &lhs) { return x < lhs.x; }
void operator++() { ++x; }
};
I i, n;
public:
range(int n) : i({0}), n({n}) {}
range(int i, int n) : i({i}), n({n}) {}
I &begin() { return i; }
I &end() { return n; }
};
int main() {
int N, A, B;
cin >> N >> A >> B;
int cnt[3] = {};
for (int i : range(N)) {
int p;
cin >> p;
if (p <= A) {
cnt[0]++;
} else if (p <= B) {
cnt[1]++;
} else {
cnt[2]++;
}
}
cout << *min_element(cnt, cnt + 3) << endl;
return 0;
} | [
"literal.number.change",
"io.output.change"
] | 949,761 | 949,762 | u613658617 | cpp |
p03156 | #pragma once
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define M_PI acos(-1)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1000000007;
const int MAX_V = 201;
int now = 0;
int deco[1000];
int st[30][100000];
ll dp[52][2510];
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int B[30];
int n;
int t[100010];
struct edge {
int t;
ll cost;
edge(int _t, ll _cost) : t(_t), cost(_cost) {}
};
ll d[305];
int ct[505][505];
int p[22];
void Solve() {
int n, a, b;
cin >> n >> a >> b;
for (size_t i = 0; i < n; i++) {
int pi;
cin >> pi;
if (pi <= a)
p[a]++;
else if (pi <= b)
p[b]++;
else
p[b + 1]++;
}
int res = 0;
while (true) {
p[a]--;
p[b]--;
p[b + 1]--;
if (p[a] < 0)
break;
if (p[b] < 0)
break;
if (p[b - 1] < 0)
break;
res++;
}
cout << res << endl;
}
int main() {
Solve();
return 0;
}
| #pragma once
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define M_PI acos(-1)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1000000007;
const int MAX_V = 201;
int now = 0;
int deco[1000];
int st[30][100000];
ll dp[52][2510];
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int B[30];
int n;
int t[100010];
struct edge {
int t;
ll cost;
edge(int _t, ll _cost) : t(_t), cost(_cost) {}
};
ll d[305];
int ct[505][505];
int p[22];
void Solve() {
int n, a, b;
cin >> n >> a >> b;
for (size_t i = 0; i < n; i++) {
int pi;
cin >> pi;
if (pi <= a)
p[a]++;
else if (pi <= b)
p[b]++;
else
p[b + 1]++;
}
int res = 0;
while (true) {
p[a]--;
p[b]--;
p[b + 1]--;
if (p[a] < 0)
break;
if (p[b] < 0)
break;
if (p[b + 1] < 0)
break;
res++;
}
cout << res << endl;
}
int main() {
Solve();
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 949,765 | 949,766 | u224756887 | cpp |
p03156 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int p;
int t1 = 0;
int t2 = 1;
int t3 = 2;
for (int i = 0; i < n; i++) {
cin >> p;
if (p <= a) {
t1++;
} else if (a < p && p <= b) {
t2++;
} else {
t3++;
}
}
cout << min({t1, t2, t3}) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int p;
int t1 = 0;
int t2 = 0;
int t3 = 0;
for (int i = 0; i < n; i++) {
cin >> p;
if (p <= a) {
t1++;
} else if (a < p && p <= b) {
t2++;
} else {
t3++;
}
}
cout << min({t1, t2, t3}) << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 949,769 | 949,770 | u115086397 | cpp |
p03156 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define LL long long
using namespace std;
int read() {
int f = 1, x = 0;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9')
x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
return x * f;
}
#define MAXN 200
#define INF 0x3f3f3f3f
int a[MAXN + 5];
int main() {
int n = read(), A = read(), B = read(), cnt1 = 0, cnt2 = 0;
for (int i = 1; i <= n; i++)
a[i] = read();
for (int i = 1; i <= n; i++) {
if (a[i] <= A)
cnt1++;
else if (a[i] <= B)
cnt2++;
}
printf("%d\n", min(cnt1, min(cnt1, n - cnt1 - cnt2)));
return 0;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define LL long long
using namespace std;
int read() {
int f = 1, x = 0;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9')
x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
return x * f;
}
#define MAXN 200
#define INF 0x3f3f3f3f
int a[MAXN + 5];
int main() {
int n = read(), A = read(), B = read(), cnt1 = 0, cnt2 = 0;
for (int i = 1; i <= n; i++)
a[i] = read();
for (int i = 1; i <= n; i++) {
if (a[i] <= A)
cnt1++;
else if (a[i] <= B)
cnt2++;
}
printf("%d\n", min(cnt1, min(cnt2, n - cnt1 - cnt2)));
return 0;
}
| [
"identifier.change",
"call.arguments.change"
] | 949,773 | 949,774 | u352557224 | cpp |
p03156 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <string.h>
#include <vector>
using namespace std;
int main(void) {
int N, A, B;
cin >> N >> A >> B;
int P[N];
for (int i = 0; i < N; i++) {
cin >> P[i];
}
sort(P, P + N);
int count1 = 0;
int count2 = 0;
int count3 = 0;
for (int i = 0; i < N; i++) {
if (P[i] <= A) {
count1++;
}
if (A + 1 <= P[i] <= B) {
count2++;
}
if (B + 1 <= P[i]) {
count3++;
}
}
int ans = min({count1, count2, count3});
if (ans > 0) {
cout << ans;
} else {
cout << 0;
}
return 0;
}
| #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <string.h>
#include <vector>
using namespace std;
int main(void) {
int N, A, B;
cin >> N >> A >> B;
int P[N];
for (int i = 0; i < N; i++) {
cin >> P[i];
}
sort(P, P + N);
int count1 = 0;
int count2 = 0;
int count3 = 0;
for (int i = 0; i < N; i++) {
if (P[i] <= A) {
count1++;
}
if (A + 1 <= P[i] && P[i] <= B) {
count2++;
}
if (B + 1 <= P[i]) {
count3++;
}
}
int ans = min({count1, count2, count3});
if (ans > 0) {
cout << ans;
} else {
cout << 0;
}
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 949,775 | 949,776 | u238235808 | cpp |
p03156 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define ll long long int
#define INF 0x3f3f3f3f
const int maxn = 1e5 + 10;
// 2019-1-12 atcoder 20:00
int a[maxn];
int main() {
int n;
int A, B;
int xx = 0, yy = 0, zz = 0;
scanf("%d %d %d", &n, &A, &B);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (a[i] < A)
xx++;
else if (a[i] > B)
zz++;
else
yy++;
}
int Min = maxn;
Min = min(xx, yy);
Min = min(Min, zz);
cout << Min << endl;
return 0;
}
//碳烤小松鼠,油炸老蜈蚣 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define ll long long int
#define INF 0x3f3f3f3f
const int maxn = 1e5 + 10;
// 2019-1-12 atcoder 20:00
int a[maxn];
int main() {
int n;
int A, B;
int xx = 0, yy = 0, zz = 0;
scanf("%d %d %d", &n, &A, &B);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (a[i] <= A)
xx++;
else if (a[i] > B)
zz++;
else
yy++;
}
int Min = maxn;
Min = min(xx, yy);
Min = min(Min, zz);
cout << Min << endl;
return 0;
}
//碳烤小松鼠,油炸老蜈蚣 | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 949,791 | 949,792 | u262070370 | cpp |
p03156 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int main() {
#ifdef LOCAL_DEFINE
freopen("test.in", "r", stdin);
#else
cin.sync_with_stdio(0);
cin.tie(0);
#endif
int n, a, b, n1 = 0, n2 = 0, n3 = 0;
cin >> n >> a >> b;
rep(i, 0, n) {
int x;
cin >> x;
if (x <= a)
n1++;
if (x > a && x <= b)
n2++;
else
n3++;
}
cout << min({n1, n2, n3}) << '\n';
#ifdef LOCAL_DEFINE
cerr << "Time elapsed: " << 1.0 * (double)clock() / CLOCKS_PER_SEC << " s.\n";
#endif
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int main() {
#ifdef LOCAL_DEFINE
freopen("test.in", "r", stdin);
#else
cin.sync_with_stdio(0);
cin.tie(0);
#endif
int n, a, b, n1 = 0, n2 = 0, n3 = 0;
cin >> n >> a >> b;
rep(i, 0, n) {
int x;
cin >> x;
if (x <= a)
n1++;
else if (x > a && x <= b)
n2++;
else
n3++;
}
cout << min({n1, n2, n3}) << '\n';
#ifdef LOCAL_DEFINE
cerr << "Time elapsed: " << 1.0 * (double)clock() / CLOCKS_PER_SEC << " s.\n";
#endif
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 949,793 | 949,794 | u403305794 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.