Pagini recente » Cod sursa (job #812197) | Cod sursa (job #2194851) | Cod sursa (job #138992) | Cod sursa (job #61152) | Cod sursa (job #1712913)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("carte2.in");
ofstream fout("carte2.out");
int a,b,c,d,e,i,j,t,max1,max2,aux1,aux2;
int v[4];
int main()
{
fin>>t;
for(i=1;i<=t;++i)
{
fin>>a>>b>>c>>d>>e;
v[1]=c;
v[2]=d;
v[3]=e;
sort(v+1,v+4);
aux1=v[2];
aux2=v[3];
v[1]=0;
v[2]=0;
v[3]=0;
if(a<b)
{
if(aux1>a && aux2>b) fout<<"posibil"<<"\n";
else fout<<"imposibil"<<"\n";
}
else
{
if(aux1>b && aux2>a) fout<<"posibil"<<"\n";
else fout<<"imposibil"<<"\n";
}
}
return 0;
}