Cod sursa(job #1974645)
| Utilizator | Data | 28 aprilie 2017 12:30:13 | |
|---|---|---|---|
| Problema | Carte2 | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva ICPC | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int t, i;
vector<int> box;
vector<int> book;
cin >> t;
while (t--)
{
box.resize(3);
book.resize(2);
for (i = 0; i < 2; i++)
cin >> book[i];
for (i = 0; i < 3; i++)
cin >> box[i];
sort(book.begin(), book.end());
sort(box.begin(), box.end());
if (book[0] < box[1] &&
book[1] < box[2])
cout << "posibil\n";
else
cout << "imposibil\n";
box.clear();
book.clear();
}
}