Cod sursa(job #3281626)
| Utilizator | Data | 2 martie 2025 22:31:27 | |
|---|---|---|---|
| Problema | Carte2 | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva ICPC | Marime | 0.5 kb |
///circular
//unordered_
#include <bits/stdc++.h>
#define MOD 20011
using namespace std;
ifstream fin("carte2.in");
ofstream fout("carte2.out");
int xc,yc,mas[5],i,t;
int main()
{
cin.tie(0);
cout.tie(0);
fin>>t;
for(i=1;i<=t;i++)
{
fin>>xc>>yc>>mas[1]>>mas[2]>>mas[3];
sort(mas+1,mas+4);
if(max(xc,yc)<mas[3] && min(xc,yc)<mas[2])
fout<<"posibil"<<'\n';
else
fout<<"imposibil"<<'\n';
}
return 0;
}
