#include <bits/stdc++.h> using namespace std; // ====== Short types ====== #define ll int #define ld long double #define str string #define pll pair<ll, ll> #define pii pair<int, int> #define vll vector<ll> #define vii vector<int> #define vld vector<ld> #define vs vector<string> #define vch vector<char> #define vpll vector<pll> #define vpii vector<pii> #define vvll vector<vll> #define mll map<ll, ll> #define msl map<string, ll> #define mcl map<char, ll> #define sll set<ll> #define scl set<char> #define ssl set<string> #define mull multiset<ll> #define mupll multiset<pll> #define pqmax priority_queue<ll> // max heap #define pqmin priority_queue<ll, vector<ll>, greater<ll>> // min heap #define pqmaxpll priority_queue<pll> // max heap of pairs #define pqminpll priority_queue<pll, vector<pll>, greater<pll>> // min heap of pairs // ====== Queues ====== #define qll queue<ll> #define qpll queue<pll> // ====== Common macros ====== #define pb push_back #define ph push #define fr front #define pp pop() #define tp top #define ppb pop_back #define ff first #define ss second #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define sz(x) (int)((x).size()) #define mpr make_pair #define bk back #define rtn return #define ctn continue #define brk break // ====== Algorithms ====== #define uniq(x) x.erase(unique(all(x)), x.end()) // works only after sorting #define sortv(v) sort(all(v)) #define rsortv(v) sort(rall(v)) #define maxv(v) *max_element(all(v)) #define minv(v) *min_element(all(v)) #define sumv(v) accumulate(all(v), 0LL) #define rev(v) reverse(all(v)) #define lb lower_bound #define ub upper_bound // ====== Loops ====== #define forr(i, n) for (ll i = 0; i < (n); i++) #define rforr(i, n) for (ll i = (n)-1; i >= 0; i--) #define forab(i, a, b) for (ll i = (a); i <= (b); i++) #define forba(i, a, b) for (ll i = (a); i >= (b); i--) // ====== Input Shortcuts ====== #define cn(n) ll n; cin >> n; #define cna(a, b) ll a, b; cin >> a >> b; #define cna3(a, b, c) ll a, b, c; cin >> a >> b >> c; #define cna4(a, b, c, d) ll a, b, c, d; cin >> a >> b >> c >> d; // ====== String Shortcuts ====== #define cs(s) string s; cin >> s; #define csa(a, b) string a, b; cin >> a >> b; #define csa3(a, b, c) string a, b, c; cin >> a >> b >> c; #define csa4(a, b, c, d) string a, b, c, d; cin >> a >> b >> c >> d; // ====== IO helpers ====== #define fastio ios::sync_with_stdio(false); cin.tie(nullptr); #define nl '\n' #define ct cout #define YES ct << "YES\n" #define NO ct << "NO\n" #define Yes ct << "Yes\n" #define No ct << "No\n" #define YN(x) ct << ((x) ? "YES\n" : "NO\n") #define yn(x) ct << ((x) ? "Yes\n" : "No\n") // ====== Debugging ====== #define debug(x) cerr << #x << " = " << (x) << '\n' #define debugv(v) cerr << #v << ": "; for (auto _x : v) cerr << _x << " "; cerr << '\n' // ====== Miscellaneous ====== #define ins insert #define ers erase #define cntv count #define fnd find #define bg begin #define ed end vector <int> find_subset (int l, int u, vector <int> w) { int n = w.size(); vector <pii> v; for (int i = 0; i < n; ++i) { v.push_back(pii(w[i], i)); } sort(v.begin(), v.end()); ll sum = 0; vector <int> r; for (int i = 0, j = 0; j < n; ++j) { sum += v[j].first; while (sum > u) { sum -= v[i++].first; } if (sum >= l) { for (int k = i; k <= j; ++k) { r.push_back(v[k].second); } break; } } return r; }

molecules.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
molecules_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~