結果
問題 | No.928 軽減税率? |
ユーザー |
![]() |
提出日時 | 2020-03-17 03:00:04 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,084 bytes |
コンパイル時間 | 1,514 ms |
コンパイル使用メモリ | 168,228 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-11-29 03:04:03 |
合計ジャッジ時間 | 2,666 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 18 WA * 16 |
ソースコード
#include <bits/stdc++.h>using namespace std;//#include <boost/multiprecision/cpp_int.hpp>//using multiInt = boost::multiprecision::cpp_int;using ll = long long int;using ld = long double;using pii = pair<int, int>;using pll = pair<ll, ll>;template <typename Q_type>using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;const int MOD_TYPE = 1;const ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);const int INF = (int)1e9;const ll LINF = (ll)4e18;const ld PI = acos(-1.0);const ld EPS = 1e-11;#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)#define rep(i, n) REP(i, 0, n)#define MP make_pair#define MT make_tuple#define YES(n) cout << ((n) ? "YES" : "NO") << endl#define Yes(n) cout << ((n) ? "Yes" : "No") << endl#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << endl#define possible(n) cout << ((n) ? "possible" : "impossible") << endl#define Yay(n) cout << ((n) ? "Yay!" : ":(") << endl#define all(v) v.begin(), v.end()#define NP(v) next_permutation(all(v))#define dbg(x) cerr << #x << ":" << x << endl;vector<int> Dx = {0, 0, -1, 1, -1, 1, -1, 1, 0};vector<int> Dy = {1, -1, 0, 0, -1, -1, 1, 1, 0};inline ll CEIL(ll a, ll b){return (a + b - 1) / b;}inline ll div_down(ll a, ll d){if (a < 0)return -(CEIL(-a, d));elsereturn (a / d);}inline ll div_up(ll a, ll d){if (a < 0)return -((-a) / d);elsereturn CEIL(a, d);}int main(){cin.tie(0);ios::sync_with_stdio(false);cout << setprecision(30) << setiosflags(ios::fixed);ll p, q, a;cin >> p >> q >> a;if (p < q){cout << 0 << endl;}else if (p == q){cout << (a == 0 ? INF : 0) << endl;}else{ll M = div_down(100 * (a - 1), p - q);ll N = div_up(100 * (a + 1), p - q);ll cnt = M;auto simulate = [&](ll x) {ll A = ((100 + p) * x) / 100;ll B = ((100 + q) * x) / 100 + a;return A < B;};for (ll i = M + 1; i < N; i++){if (simulate(i))cnt++;}cout << cnt << endl;}return 0;}