Varianta 55

I.
1.a
2.
a)Se citeste 5,12,22,1232,3,563
N=5
A=12,22,1232,3
K=0,1,2,1,2
I=2,3,4,5
B=22,1232,3,563
Se va afisa 2
b)7,12,2,22,32,42,43,33
c)
citeste n
citeste a
k<-0
i<-2
executa
citeste b
daca a%10=b%10 atunci k<-k+1
altfel k<-k-1
a<-b
i<-i+1
cat timp(i!=n+1)
scrie k
d)int main()
{
int a,n,k,i,b;
cin>>n>>a;
k=0;
for(i=2;i<=n;i++)
{cin>>b;
if(a%10==b%10) k=k+1;
else k=k-1;
a=b;
}
cout<<k;
}

II.
1.c
3.
4.Se sterge nodul al doilea
5. #include<iostream>
#include<cstring>

using namespace std;

int main()
{ char s[10];
cin>>s;
char *p=strchr(s,'.');
strncpy(s,s,p-s);
long a=atol(s);
long b=atol(p+1);
while(b%10==0) b=b/10;
cout<<a+b;
}

III.

1.
2.
a)f(25) se va afisa 0
b)f(1)+f(5)+f(15)=20+20+10=50
f(1)=5+f(6)=10+f(11)=15+f(16)=20+f(21)=20
f(5)=5+f(10)=10+f(15)=15+f(20)=20+f(25)=20
f(15)=5+f(20)=10+f(25)=10
Se va afisa 50

3.a)
int cifre(int a)
{
int k=0,j,i,v[100],aux,p=1,s=0;
while (a){
v[k]=a%10;
k++;
a=a/10;}
for (i=0;i<=k;i++)
for(j=i;j<k;j++)
if (v[i] > v[j]){
aux=v[i];
v[i]=v[j];
v[j]=aux;}
for (i=0;i<k;i++){
s=s*10+v[i];
 }
return s;
}
b)

4.
#include <iostream>
using namespace std;
int c[100];
int main()
{
int a[100],b[100],n,i,x;
cin>>n;
for(i=1;i<=n;i++)
cin>>a[i];
for(i=1;i<=n;i++)
{
cin>>b[i];
if(a[i]>b[i])
{
c[i]=b[i];
x=a[i];
}
 else
{
c[i]=a[i];
x=b[i];
}
if(x>99)
c[i]=c[i]*1000+x;
else if(a[i]>9)c[i]=c[i]*100+x;
else c[i]=c[i]*100+x;
}

for(i=1;i<=n;i++)
cout<<c[i]<<" ";
}