Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- #define PB push_back
- #define ZERO (1e-10)
- #define INF (1<<29)
- #define CL(A,I) (memset(A,I,sizeof(A)))
- #define DEB printf("DEB!\n");
- #define D(X) cout<<" "<<#X": "<<X<<endl;
- #define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
- typedef long long ll;
- typedef long double ld;
- typedef pair<ll,ll> pll;
- typedef vector<int> vi;
- typedef pair<int,int> ii;
- typedef vector<ii> vii;
- #define IN(n) int n;scanf("%d",&n);
- #define FOR(i, m, n) for (int i(m); i < n; i++)
- #define REP(i, n) FOR(i, 0, n)
- #define F(n) REP(i, n)
- #define FF(n) REP(j, n)
- #define FT(m, n) FOR(k, m, n)
- #define aa first
- #define bb second
- void ga(int N,int *A){F(N)scanf("%d",A+i);}
- ll a,b,c,d,K;
- #define EV(t) (a*t*t*t+b*t*t+c*t+d)
- bool ok(ll t){return EV(t)>K;}
- ll bs(ll B=0,ll E=INF){
- ll M;
- while(B<E)
- if(ok(M=(B+E)>>1))E=M;
- else B=M+1;
- return max(B-1,0ll);
- }
- int main(void){
- IN(tt)F(tt)
- scanf("%lld%lld%lld%lld%lld",&a,&b,&c,&d,&K),printf("%lld\n",bs(0,8e5));
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement