結果
問題 | No.928 軽減税率? |
ユーザー | Enjapma_kyopro |
提出日時 | 2019-11-22 22:08:35 |
言語 | C++11 (gcc 11.4.0) |
結果 |
AC
|
実行時間 | 7 ms / 1,000 ms |
コード長 | 2,915 bytes |
コンパイル時間 | 1,272 ms |
コンパイル使用メモリ | 162,536 KB |
実行使用メモリ | 20,788 KB |
最終ジャッジ日時 | 2024-10-11 03:48:29 |
合計ジャッジ時間 | 2,488 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 6 ms
20,440 KB |
testcase_01 | AC | 6 ms
19,372 KB |
testcase_02 | AC | 5 ms
15,172 KB |
testcase_03 | AC | 5 ms
15,680 KB |
testcase_04 | AC | 6 ms
19,780 KB |
testcase_05 | AC | 6 ms
19,516 KB |
testcase_06 | AC | 5 ms
19,440 KB |
testcase_07 | AC | 6 ms
20,788 KB |
testcase_08 | AC | 7 ms
20,004 KB |
testcase_09 | AC | 6 ms
20,204 KB |
testcase_10 | AC | 6 ms
20,348 KB |
testcase_11 | AC | 5 ms
19,628 KB |
testcase_12 | AC | 6 ms
20,016 KB |
testcase_13 | AC | 7 ms
19,404 KB |
testcase_14 | AC | 7 ms
20,528 KB |
testcase_15 | AC | 6 ms
19,620 KB |
testcase_16 | AC | 5 ms
19,440 KB |
testcase_17 | AC | 6 ms
19,848 KB |
testcase_18 | AC | 6 ms
20,424 KB |
testcase_19 | AC | 5 ms
19,768 KB |
testcase_20 | AC | 6 ms
20,332 KB |
testcase_21 | AC | 6 ms
19,160 KB |
testcase_22 | AC | 5 ms
15,296 KB |
testcase_23 | AC | 5 ms
15,944 KB |
testcase_24 | AC | 4 ms
15,300 KB |
testcase_25 | AC | 5 ms
15,304 KB |
testcase_26 | AC | 6 ms
15,684 KB |
testcase_27 | AC | 5 ms
15,688 KB |
testcase_28 | AC | 5 ms
16,200 KB |
testcase_29 | AC | 6 ms
15,560 KB |
testcase_30 | AC | 5 ms
15,176 KB |
testcase_31 | AC | 6 ms
16,836 KB |
testcase_32 | AC | 5 ms
16,712 KB |
testcase_33 | AC | 5 ms
15,808 KB |
testcase_34 | AC | 5 ms
15,300 KB |
testcase_35 | AC | 5 ms
15,940 KB |
ソースコード
#include <bits/stdc++.h> #include <unistd.h> using namespace std; typedef long long ll; typedef pair<ll,ll> P; long long int INF = 1e18; const ll fact_table = 5000000; double Pi = 3.1415926535897932384626; //vector<ll> G[550010]; vector<P> tree[500010]; priority_queue <ll> pql; priority_queue <P> pqp; //big priority queue priority_queue <ll,vector<ll>,greater<ll> > pqls; priority_queue <P,vector<P>,greater<P> > pqps; //small priority queue //top pop int dx[8]={1,0,-1,0,1,1,-1,-1}; int dy[8]={0,1,0,-1,1,-1,-1,1}; char dir[] = "DRUL"; //ll bit[500005]; //↓,→,↑,← #define p(x) cout<<x<<"\n"; #define el cout<<endl; #define pe(x) cout<<(x)<<" "; #define ps(x) cout<<fixed<<setprecision(25)<<x<<endl; #define pu(x) cout<<(x); #define pb push_back #define lb lower_bound #define ub upper_bound #define CLEAR(a) a = decltype(a)(); ll mod = 998244353; //ll mod = 1000000007; ll rui(ll number1,ll number2){ if(number2 == 0){ return 1; }else{ ll number3 = rui(number1,number2 / 2); number3 *= number3; number3 %= mod; if(number2%2==1){ number3 *= number1; number3 %= mod; } return number3; } } ll gcd(ll number1,ll number2){ if(number1 > number2){ swap(number1,number2); } if(number1 == 0 || number1 == number2){ return number2; }else{ return gcd(number2 % number1,number1); } } void YES(bool condition){ if(condition){ p("YES"); }else{ p("NO"); } return; } void Yes(bool condition){ if(condition){ p("Yes"); }else{ p("No"); } return; } /* ll fact[fact_table + 5],rfact[fact_table + 5]; void c3_init(){ fact[0] = rfact[0] = 1; for(ll i=1; i<=fact_table; i++){ fact[i] = (fact[i-1]*i) % mod; } rfact[fact_table] = rui(fact[fact_table],mod - 2); for(ll i=fact_table; i>=1; i--){ rfact[i-1] = rfact[i] * i; rfact[i-1] %= mod; } return;} ll c3(ll n,ll r){ return (((fact[n] * rfact[r]) % mod ) * rfact[n-r]) % mod;} */ ll n,m,num,sum,a,b,c,d,e,g,h,w,i,j,q,r,l; ll k,ans; ll x[500005],y[500005],z[500005]; char s[500005]; int main(){ cin >> a >> b >> c; if(b > a){ if(c >= 1){ p(1000000000); return 0; }else{ ll cnt = 0; for(int i=1;i<=1000;i++){ ll res1 = a * i / 100; ll res2 = b * i / 100; if(res1 == res2)cnt++; } p(1000000000 - cnt); return 0; } } if(a == b){ if(c >= 1){ p(1000000000); }else{ p(0); } return 0; } for(int i=1;i<=100;i++){ x[i-1] = (i * a) / 100; y[i-1] = (i * b) / 100; } ll ans = 0; for(int i=0;i<100;i++){ ll tmp = (c - x[i] + y[i]); //pe(i);p(tmp); if(tmp < 0)continue; if(tmp == 0)continue; ll res = (c - x[i] + y[i] - 1) / (a - b); res = min(res, 999999ll); ans += res + 1; } p(ans); return 0; }