Răspuns :
#include <bits/stdc++.h>
using namespace std;
int n, q, i, k, t, el, v[50005], x, nr1, nr2, cif, cmin, pmin, cmax, pmax;
int main()
{
ifstream f("colier.in");
ofstream g("colier.out");
f >> t;
f >> n;
for(i = 1; i <= n; i ++)
{
f >> x;
cmin = 10;
cmax = 0;
k = 0;
while(x != 0)
{
k ++;
cif = x % 10;
if(cif < cmin) cmin = cif, pmin = k;
if(cif > cmax) cmax = cif, pmax = k;
x = x / 10;
}
if(pmax < pmin)
{
nr1 ++;
v[i] = 1;
} else
{
nr2 ++;
v[i] = 2;
}
}
if(t == 1) g << nr1;
if(t == 2)
{
x = q = v[1];
for(i = 2; i <= n; i ++)
{
if(v[i] == q) el ++;
q = v[i];
}
if(x == v[n]) el ++;
g << n - el;
}
return 0;
}
using namespace std;
int n, q, i, k, t, el, v[50005], x, nr1, nr2, cif, cmin, pmin, cmax, pmax;
int main()
{
ifstream f("colier.in");
ofstream g("colier.out");
f >> t;
f >> n;
for(i = 1; i <= n; i ++)
{
f >> x;
cmin = 10;
cmax = 0;
k = 0;
while(x != 0)
{
k ++;
cif = x % 10;
if(cif < cmin) cmin = cif, pmin = k;
if(cif > cmax) cmax = cif, pmax = k;
x = x / 10;
}
if(pmax < pmin)
{
nr1 ++;
v[i] = 1;
} else
{
nr2 ++;
v[i] = 2;
}
}
if(t == 1) g << nr1;
if(t == 2)
{
x = q = v[1];
for(i = 2; i <= n; i ++)
{
if(v[i] == q) el ++;
q = v[i];
}
if(x == v[n]) el ++;
g << n - el;
}
return 0;
}