fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << p.first << " " << p.second ; }
  5. template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os ; string sep; for (const T &x : v) os << sep << x, sep = " "; return os; }
  6. void dbg_out() { cerr << endl; }
  7. template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << ' ' << H; dbg_out(T...); }
  8. #define ar array
  9. #define ll long long
  10. #define ld long double
  11. #define sza(x) ((ll)x.size())
  12. #define all(a) (a).begin(), (a).end()
  13. #define tc(t)  while(t--)
  14. #define vecin(v,tp,n)  vector<tp> v; for(int i=0;i<n;i++){ tp aaa ; cin>>aaa; v.push_back(aaa);}
  15. #define f(i,a,n) for(ll i=a;i<n;i++)
  16. #define vecout(v,n) for(int i=0;i<n;i++){cout<<v[i]<<endl;}
  17. #define mapin(m,tp,pt,n) map<tp,pt> m ; for(int i=0;i<n;i++){ tp a ; pt b;  cin>>a>>b ; m[a]=b;}
  18. #define pairin(p,tp,pt) pair<tp,pt> p ; for(int i=0;i<n;i++){ tp a ; pt b;  cin>>a>>b ; p.insert(a,b);}
  19. #define pb(n) push_back(n)
  20. #define endl "\n"
  21.  
  22. const ll MAX_N = 32768;
  23. const ll MOD = 998244353;
  24. const ll INF = 1e19;
  25. const ld EPS = 1e-9;
  26.  
  27. /*void solve()
  28. {
  29.     string s; cin>>s;
  30.     ll id; cin>>id;
  31.     id--;
  32.     vector<char> g;
  33.     if(sza(s)==2 || (sza(s)==3 && id==1)) cout<<s<<endl;
  34.     else
  35.     {
  36.         f(i,0,sza(s))
  37.             {
  38.                 if(id==0 && i>id+1) g.pb(s[i]);
  39.                 else if(i<id-1 || i>id+1) g.pb(s[i]);
  40.             }
  41.         sort(all(g));
  42.         if(!g.empty())
  43.         {
  44.             if(g[0]<s[id] && id==0) swap(g[0],s[id]);
  45.             else if(g[0]<s[id] && g[0]>s[id-1] && id>0 && id<sza(s)-1 ) swap(g[0],s[id]);
  46.             else if(g[0]<s[id] && id>0 && id<sza(s)-1 ) ||  swap(g[0],s[id]);
  47.             else if(g[sza(g)-1]>s[id] && id==sza(s)-1) swap(g[sza(g)-1],s[id]);
  48.             sort(all(g));
  49.         }
  50.         if(id>1)
  51.         {
  52.             f(i,0,max(0LL,id-1))
  53.             {
  54.                 cout<<g[i];
  55.             }
  56.         }
  57.         f(i,max(0LL,id-1),id+2) {cout<<s[i];}
  58.         f(i,max(0LL,id-1),sza(g))
  59.         {
  60.             cout<<g[i];
  61.         }
  62.         cout<<endl;
  63.     }
  64.  
  65. }*/
  66.  
  67. /*ll ath=50000;
  68. void solve()
  69. {
  70.      ll n;cin>>n;
  71.      ll mar[5][ath];
  72.      vector<ll> adj[n+1];
  73.      f(i,0,5)
  74.      {
  75.          f(j,0,ath)
  76.          {
  77.              mar[i][j]=0;
  78.          }
  79.      }
  80.      f(i,1,n+1)
  81.      {
  82.  
  83.              f(j,0,5)
  84.              {
  85.                  ll x;cin>>x;
  86.                  mar[j][x]=i;
  87.              }
  88.  
  89.      }
  90.      f(k,0,5)
  91.      {
  92.          vector<ll> h;
  93.          f(i,1,ath-1)
  94.          {
  95.            if(mar[k][i]!=0) h.pb(mar[k][i]);
  96.          }
  97.          f(i,0,h.size()-1)
  98.          {
  99.              adj[h[i]].pb(h[i+1]);
  100.          }
  101.      }
  102.      cout<<adj[1]<<endl;
  103.      ll l=1;
  104.      f(i,1,n+1)
  105.      {
  106.          sort(all(adj[i]));
  107.          ll c=1,ans=0;
  108.          f(j,0,sza(adj[i])-1)
  109.          {
  110.              if(adj[i][j]==adj[i][j+1]) c++;
  111.              else if(c==3) {ans++;c=0;}
  112.              else c=0;
  113.          }
  114.          if(ans==n-1) {cout<<i<<endl;l=0;break;}
  115.      }
  116.      if(l) cout<<-1<<endl;
  117.  
  118. }*/
  119. double d,x,y; 
  120. bool cnd(double s) { return x-((double) x/100)*s*d <= y-s; }
  121. void solve()
  122. {
  123.     cin>>d>>x>>y;
  124.     double l=-1,r=101;
  125.     while(l<r-1)
  126.     {
  127.         ll m=l+(r-l)/2; if(cnd(m)) r=m; else l=m;
  128.     }
  129.     cout<<l<<endl;
  130. }
  131.  
  132. int main() {
  133.     ios_base::sync_with_stdio(0);
  134.     cin.tie(0); cout.tie(0);
  135.      ll p; cin>>p;
  136.      //ll p=1;
  137.     tc(p){
  138.         solve();
  139.     }
  140. }
  141.  
Success #stdin #stdout 0.01s 5276KB
comments (?)
stdin
copy 
45
stdout
copy 
100
100
100
100
100
100
100
100
100
100
100
100
100
100
100
100
100
100
100
100
100
100
100
100
100
100
100
100
100
100
100
100
100
100
100
100
100
100
100
100
100
100
100
100
100
https://ideone.com/hNolbK
language:
C++14 (clang 8.0)
created:
8 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!