結果

問題 No.928 軽減税率?
ユーザー takumi152
提出日時 2019-11-22 22:09:37
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2 ms / 1,000 ms
コード長 1,530 bytes
コンパイル時間 770 ms
コンパイル使用メモリ 88,864 KB
最終ジャッジ日時 2025-01-08 05:03:13
ジャッジサーバーID
(参考情報)
judge1 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 34
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#include <cstdlib>
#include <queue>
#include <map>
using namespace std;
typedef long long int ll;
typedef pair<int, int> Pii;
const ll mod = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll p, q, a;
cin >> p >> q >> a;
if (p < q) {
ll ans = 1000000000;
for (ll i = 1; i <= 1000000000; i++) {
ll in = i * (p + 100) / 100;
ll out = (i * (q + 100) / 100) + a;
if (in >= out) ans--;
else if (in < out - 3) break;
}
cout << ans << endl;
return 0;
}
else if (p == q) {
if (a == 0) cout << 0 << endl;
else cout << 1000000000 << endl;
return 0;
}
ll cleft, cright, left, right;
left = 1;
right = 1000000000;
while (left < right) {
ll center = (left + right) / 2;
ll in = center * (p + 100) / 100;
ll out = (center * (q + 100) / 100) + a;
if (in < out - 3) left = center + 1;
else right = center - 1;
}
cleft = left;
left = 1;
right = 1000000000;
while (left < right) {
ll center = (left + right) / 2;
ll in = center * (p + 100) / 100;
ll out = (center * (q + 100) / 100) + a;
if (in < out + 3) left = center + 1;
else right = center - 1;
}
cright = left;
ll ans = cleft - 1;
for (ll i = cleft; i <= cright; i++) {
ll in = i * (p + 100) / 100;
ll out = (i * (q + 100) / 100) + a;
if (in < out) ans++;
}
cout << ans << endl;
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0