#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<map>
#include<iomanip>
#define INF 0x7ffffff
#define MAXN 10000
using namespace std;
const double eps=1e-10;
double js(double x)
{return 8.0*x*x*x*x + 7.0*x*x*x + 2.0*x*x + 3.0*x + 6.0;
}
int main()
{#ifndef ONLINE_JUDGEfreopen("data.in", "r", stdin);#endifstd::ios::sync_with_stdio(false);std::cin.tie(0);double y;double x;double r,l;int t;cin>>t;while(t--){cin>>y;if(y<6||y>js(100)){cout<<"No solution!"<<endl;}else{l=0; r=100;double mid,res;while(l+eps<r){mid=(l+r)/2;if(y<js(mid)){r=mid;}else{l=mid;}}cout<<fixed<<setprecision(4)<<mid<<endl;}}return 0;
}

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<map>
#include<iomanip>
#define INF 0x7ffffff
#define MAXN 10000
using namespace std;
const double eps=1e-10;
double fd(double x)
{return 42*pow(x,6)+48*pow(x,5)+21*pow(x,2)+10*x;
}
int main()
{#ifndef ONLINE_JUDGEfreopen("data.in", "r", stdin);#endifstd::ios::sync_with_stdio(false);std::cin.tie(0);int t;double y;double l,r,mid;cin>>t;while(t--){cin>>y;l=0;r=100;while(r-l>eps){mid=(l+r)/2;if(fd(mid)>y){r=mid;}else l=mid;}cout<<fixed<<setprecision(4)<<6*pow(mid,7)+8*pow(mid,6)+7*pow(mid,3)+5*mid*mid-y*mid<<endl;}
}

    #include <cstdio>  #include <cstring>  #include <algorithm>  #include <cmath>  using namespace std ;  #define PI 3.1415926535898  #define eqs 1e-5  double s[11000] ;  int n , m ;  double f(double x)  {  int k = (x+eqs) * 10000 ;  x = k * 1.0 / 10000 ;  return x ;  }  int solve(double x)  {  int i , j , num = 0 ;  for(i = n-1 ; i >= 0 && (s[i]-x) > eqs ; i--)  {  j = s[i] / x ;  num += j ;  if( num >= m+1 )return 1 ;  }  if( num >= m+1 ) return 1 ;  return 0 ;  }  int main()  {  int t , i , k ;  double low , mid , high , last ;  while( scanf("%d", &t) != EOF )  {  while(t--)  {  scanf("%d %d", &n, &m) ;  for(i = 0 ; i < n ; i++)  scanf("%lf", &s[i]) ;  sort(s,s+n) ;  for(i = 0 ; i < n ; i++)  s[i] = s[i]*s[i]*PI ;  low = 0 ;  high = s[n-1] ;  while( (high-low) > eqs )  {  mid = (low+high)/2.0 ;  if( solve(mid) )  {  low = mid  ;  last = mid ;  }  else  high = mid ;  }  printf("%.4lf\n", last) ;  }  }  return 0;  }

#include<stdio.h>
#include<algorithm>
using namespace std;
#define K 505
int LN[K*K];
int BinarySearch(int LN[],int h,int t)/*二分查找*/
{int left,right,mid;left=0;right=h-1;mid=(left+right)/2;while(left<=right){mid=(left+right)/2;if(LN[mid]==t)return 1;else if(LN[mid]>t)right=mid-1;else if(LN[mid]<t)left=mid+1;}return 0;
}
int main()
{int i,j,count=1,q;__int32 L[K],N[K],M[K],S,n,m,l;while(scanf("%d%d%d",&l,&n,&m)!=EOF){int h=0;for(i=0;i<l;i++)scanf("%d",&L[i]);for(i=0;i<n;i++)scanf("%d",&N[i]);for(i=0;i<m;i++)scanf("%d",&M[i]);for(i=0;i<l;i++)for(j=0;j<n;j++)LN[h++]=L[i]+N[j];/*合并L和N*/sort(LN,LN+h); /*对LN数组排序*/scanf("%d",&S);printf("Case %d:\n",count++);for(i=0;i<S;i++){scanf("%d",&q);/*q即为题目中的x*/int p=0; /*p为标记，0为找不到，1为能找到*/for(j=0;j<m;j++){int a=q-M[j]; /*因为L[i]+N[j]+M[k]==q，所以q-M[k]=LN[h]*/if(BinarySearch(LN,h,a)) /*在LN数组中查找到a*/{printf("YES\n");p=1;break;}}if(!p) /*找不到a*/printf("NO\n");}}return 0;
}