Cod sursa(job #1838187)
| Utilizator | Data | 31 decembrie 2016 13:12:19 | |
|---|---|---|---|
| Problema | Carte2 | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva ICPC | Marime | 0.48 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("carte2.in");
ofstream fout("carte2.out");
int t, a[3], b[4];
int main()
{
fin >> t;
for (int i = 1; i <= t; i++)
{
fin >> a[1] >> a[2] >> b[1] >> b[2] >> b[3];
sort(a + 1, a + 2 + 1);
sort(b + 1, b + 3 + 1);
if(a[1] < b[2] && a[2] < b[3])
fout << "posibil" << '\n';
else
fout << "imposibil" << '\n';
}
return 0;
}
