Pagini recente » Cod sursa (job #1991895) | Cod sursa (job #206757) | Cod sursa (job #2465256) | Cod sursa (job #2768339) | Cod sursa (job #1712195)
using namespace std;
#include <fstream>
#include <vector>
#include <algorithm>
#include <string>
using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
vector< int > a(2), b(3);
int main()
{
int i, t;
ifstream fin("carte2.in");
ofstream fout("carte2.out");
for (fin >> t; t; --t)
{
fin >> a[0] >> a[1] >> b[0] >> b[1] >> b[2];
sort(a.begin(), a.end());
sort(b.begin(), b.end());
if (a[0] < b[1] && a[1] < b[2]) fout << "posibil\n";
else fout << "imposibil\n";
}
fin.close();
fout.close();
return 0;
}