結果
問題 | No.546 オンリー・ワン |
ユーザー |
|
提出日時 | 2024-06-18 00:49:37 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 3 ms / 2,000 ms |
コード長 | 2,267 bytes |
コンパイル時間 | 1,732 ms |
コンパイル使用メモリ | 143,476 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-18 00:49:40 |
合計ジャッジ時間 | 3,173 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 7 |
ソースコード
#include <algorithm> #include <cassert> #include <cstdio> #include <cstdlib> #include <cstring> #include <cmath> #include <iostream> #include <numeric> #include <vector> #include <map> #include <set> #include <queue> #include <functional> #include <iomanip> using namespace std; using ll = long long; 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;}}; template<class T, class U> ostream& operator<<(ostream& os, const pair<T, U>& p){ return os << "{" << p.first << ", " << p.second << "}"; } template<typename T> ostream& operator<<(ostream& os, const vector<T>& obj) { os << "{"; for (const auto& e : obj) os << e << ", "; return os << "}"; } template<typename T> ostream& operator<<(ostream& os, const set<T>& obj) { os << "set{"; for (const auto& e : obj) os << e << ", "; return os << "}"; } template<typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& obj) { os << "map{"; for (const auto& e : obj) os << e << ", "; return os << "}"; } #ifdef ONLINE_JUDGE #define dump(expr) ; #else #define dump(expr) { cerr << "\033[33m#L" << __LINE__ << ": " << expr << "\033[39m" << endl; } #endif ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; } ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } ll solve() { ll n, low, high; cin >> n >> low >> high; vector<ll> vs(n); for (int i : range(n)) cin >> vs[i]; ll res = 0; for (int i : range(n)) { int a = vs[i]; vector<int> bs; for (int j : range(n)) if (j != i) bs.push_back(vs[j] / gcd(a, vs[j])); dump(bs); ll tot = 0; for (int bit : range(1 << (n - 1))) { ll b = 1; for (int j : range(n - 1)) if ((bit >> j) & 1) { b = lcm(b, bs[j]); if (b * a > high) break; } b *= a; ll count = high / b - (low - 1) / b; ll sign = (__builtin_popcount(bit) % 2) ? -1 : 1; dump(i << " " << bit << " " << count * sign << " b=" << b) tot += count * sign; } dump(i << " => " << tot); res += tot; } return res; } int main() { cout << fixed << setprecision(12); cout << solve() << endl; }