Advertisement
Morass

Foo and Exams

Apr 25th, 2016
106
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.02 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define PB push_back
  4. #define ZERO (1e-10)
  5. #define INF (1<<29)
  6. #define CL(A,I) (memset(A,I,sizeof(A)))
  7. #define DEB printf("DEB!\n");
  8. #define D(X) cout<<"  "<<#X": "<<X<<endl;
  9. #define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
  10. typedef long long ll;
  11. typedef long double ld;
  12. typedef pair<ll,ll> pll;
  13. typedef vector<int> vi;
  14. typedef pair<int,int> ii;
  15. typedef vector<ii> vii;
  16. #define IN(n) int n;scanf("%d",&n);
  17. #define FOR(i, m, n) for (int i(m); i < n; i++)
  18. #define REP(i, n) FOR(i, 0, n)
  19. #define F(n) REP(i, n)
  20. #define FF(n) REP(j, n)
  21. #define FT(m, n) FOR(k, m, n)
  22. #define aa first
  23. #define bb second
  24. void ga(int N,int *A){F(N)scanf("%d",A+i);}
  25. ll a,b,c,d,K;
  26. #define EV(t) (a*t*t*t+b*t*t+c*t+d)
  27. bool ok(ll t){return EV(t)>K;}
  28. ll bs(ll B=0,ll E=INF){
  29.     ll M;
  30.     while(B<E)
  31.         if(ok(M=(B+E)>>1))E=M;
  32.         else B=M+1;
  33.     return max(B-1,0ll);
  34. }
  35. int main(void){
  36.     IN(tt)F(tt)
  37.         scanf("%lld%lld%lld%lld%lld",&a,&b,&c,&d,&K),printf("%lld\n",bs(0,8e5));
  38.     return 0;
  39. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement