Sub II.

3
 Sub III.1

void secventa (int &n)

{
int nou=0, p=1, ultimeledoua, uc;
while(n)
{
ultimeledoua=n%100;
uc=n%10;
n=n/10;
if(ultimeledoua==22)
{
nou=20*p+nou;
p=p*100; n=n/10;
}
else
{
nou=uc*p + nou;
p=p*10;
}
}
n=nou;
}
 Sub III.2
#include <iostream>
using namespace std;
int a[102][102], n,m,i,j,mini,k;
int main()
{
cin>>m>>n;
for(i=1; i<=m; i++)
for(j=1; j<=n; j++) cin>>a[i][j];
///bordare
for(j=0; j<=n+1; j++)
a[0][j]=a[m+1][j]=11;
for(i=0; i<=m+1; i++)
a[i][0]=a[i][n+1]=11;
/// innisipare
for(i=1; i<=m; i++)
for(j=1; j<=n; j++)
{
mini=11;
if(a[i-1][j]<mini) mini=a[i-1][j];
if(a[i+1][j]<mini) mini=a[i+1][j];
if(a[i][j-1]<mini) mini=a[i][j-1];
if(a[i][j+1]<mini) mini=a[i][j+1];
if(a[i][j]<mini)
{
k=k+(mini-a[i][j]);
a[i][j]=mini;
}
}
/// afisare
cout<<k;
return 0;
}
 Sub III.3
#include <iostream>
#include <fstream>
int x, y, a, ultimul, k;
using namespace std;
ifstream fin("bac.txt");
int main()
{
fin>>x>>y;
fin>>a;
while(a<x) fin>>a;
if(a>=x && a<=y)
{
k++; ultimul=a;
}
while(fin>>a && a<=y)
{
if(a>=x && a<=y && a!=ultimul)
{
k++; ultimul=a;
}
}
cout<<k;
return 0;
}