結果
問題 | No.2526 Kth Not-divisible Number |
ユーザー |
![]() |
提出日時 | 2023-11-03 21:39:36 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 463 ms / 2,000 ms |
コード長 | 1,678 bytes |
コンパイル時間 | 1,614 ms |
コンパイル使用メモリ | 192,416 KB |
最終ジャッジ日時 | 2025-02-17 17:54:27 |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 11 |
ソースコード
// (◕ᴗ◕✿)#include <bits/stdc++.h>#define rep(i, n) for (ll i = 0; i < (n); i++)#define srep(i, s, n) for (ll i = s; i < (n); i++)#define len(x) ((int)(x).size())#define all(x) (x).begin(), (x).end()using namespace std;template<typename T> using vc = vector<T>;template<typename T> using vv = vc<vc<T>>;template<typename T> using vvv = vv<vc<T>>;using vi = vc<int>;using vvi = vv<int>; using vvvi = vv<vi>;using ll = long long;using vl = vc<ll>;using vvl = vv<ll>; using vvvl = vv<vl>;using ld = long double; using vld = vc<ld>; using vvld = vc<vld>; using vvvld = vc<vvld>;using uint = unsigned int;using ull = unsigned long long;const ld pi = 3.141592653589793;const int inf = 0x3f3f3f3f;const ll INF = 0x3f3f3f3f3f3f3f3f;// const ll mod = 1000000007;const ll mod = 998244353;inline bool inside(long long y, long long x, long long H, long long W) {return 0 <= (y) and (y) < (H) and 0 <= (x) and (x) < (W); }#define debug(var) do{std::cout << #var << " : \n";view(var);}while(0)template<typename T> void view(T e){cout << e << endl;}template<typename T> void view(const vc<T>& v){for(const auto& e : v){ cout << e << " "; } cout << endl;}template<typename T> void view(const vv<T>& vv){ for(const auto& v : vv){ view(v); } }int main(){int T; cin >> T;while (T--){ll A, B, K; cin >> A >> B >> K;ll top = INF, bottom = 0, g = lcm(A, B);while (top - bottom > 1){ll mid = (top + bottom) / 2;ll dA = mid / A, dB = mid / B, dg = mid / g;if (mid - (dA + dB - dg) < K) bottom = mid;else top = mid;}cout << top << endl;}}