Pagini recente » Rezultatele filtrării | Cod sursa (job #1709152)
#include <stdio.h>
#include <stdlib.h>
int cmp(const void *q1,const void *q2){
return (*((int*)q1)) - (*((int*)q2));
}
int main()
{
freopen("carte2.in","r",stdin);
freopen("carte2.out","w",stdout);
int t;
scanf("%d",&t);
int A,B,C,D,E;
int F,G,H,I;
int T[3];
while(t--){
scanf("%d%d%d%d%d",&A,&B,&C,&D,&E);
//printf("%d %d %d %d %d\n",A,B,C,D,E);
T[0] = C;
T[1] = D;
T[2] = E;
qsort(T,3,sizeof(int),cmp);
F = T[2];
G = T[1];
H = A>B?A:B;
I = A<B?A:B;
//printf("max %d %d - %d %d\n",F,G,H,I);
if(H<F && I<G){
printf("posibil\n");
}else{
printf("imposibil\n");
}
}
return 0;
}