結果
問題 | No.2526 Kth Not-divisible Number |
ユーザー |
![]() |
提出日時 | 2023-11-03 22:17:45 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 655 ms / 2,000 ms |
コード長 | 1,699 bytes |
コンパイル時間 | 1,663 ms |
コンパイル使用メモリ | 192,080 KB |
最終ジャッジ日時 | 2025-02-17 18:27:55 |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 11 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define rep(i, n) for (int i = 0; i < (n); i++)#define rep1(i, n) for (int i = 1; i <= (n); i++)#define rrep(i, n) for (int i = n - 1; i >= 0; i--)#define rrep1(i, n) for (int i = n; i >= 1; i--)#define all(x) x.begin(), x.end()#define rall(x) x.rbegin(), x.rend()#define eb emplace_back#define fi first#define se second#define sz(x) (int)(x).size()template <class T> using V = vector<T>;template <class T> using VV = V<V<T>>;typedef long long int ll;void speedUpIO() {cin.tie(nullptr);ios::sync_with_stdio(false);}template <class T> bool chmax(T &a, const T &b) {if (a < b) {a = b;return true;}return false;}template <class T> bool chmin(T &a, const T &b) {if (b < a) {a = b;return true;}return false;}/*--------------------------------------------------*/typedef pair<int, int> P;const int INF = 1e9;const ll LINF = 9e18;const int MX = 100010;ll solve() {ll a, b, k;cin >> a >> b >> k;ll ok = 1, ng = LINF;while (ng - ok > 1) {ll mid = ok / 2 + ng / 2 + (ok % 2 + ng % 2) / 2;ll cnt = mid / a;cnt += mid / b;cnt -= mid / lcm(a, b);cnt = mid - cnt;if (cnt <= k) {ok = mid;} else {ng = mid;}}while (ok % a == 0 || ok % b == 0) ok--;return ok;}int main() {speedUpIO();int t = 1;cin >> t;while (t--) {// solve();cout << solve() << "\n";// cout << (solve() ? "YES" : "NO") << "\n";// cout << fixed << setprecision(15) << solve() << "\n";}return 0;}