Cod sursa(job #2498878)
| Utilizator | Data | 24 noiembrie 2019 18:32:48 | |
|---|---|---|---|
| Problema | Carte2 | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva ICPC | Marime | 0.51 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("carte2.in");
ofstream fout("carte2.out");
int ct[5], c[5], t, xc, zc;
int main()
{
fin >> t;
for ( int k = 1 ; k <= t ; k ++ )
{
c[1] = 1;
fin >> c[2] >> c[3] >> ct[1] >> ct[2] >> ct[3];
sort(c+1,c+4);
sort(ct+1,ct+4);
if ( ct[1] > c[1] and ct[2] > c[2] and ct[3] > c[3] )
fout << "posibil" << '\n';
else fout << "imposibil" << '\n';
}
return 0;
}
