S2. 1.

a) 1 275
b) 1234 4321
c)....
d) pana cand (c1-c2)*s<=0 executa
| c1=n%10; n=[n/10]; c2=n%10
#
2 struct cerc
{
struct
{
void x,y;
}centru;
void raza;
}fig;
3. int main()
{
int p;
char s[20];
cin>>s;
for(p=0;p<strlen(s);p++)
{
if(s[p]=='A')
{ if(s[p-1]=='C' || s[p+1]=='C')
strcpy(s+p,s+p+1);
}
}
cout<<s;
return 0;
}

S3. 1
int factori(unsigned int n, unsigned int m)
{
unsigned int a[100]={0},s=0;
while(n!=0)
{
for(int i=1;i*i<n;i++)
while(n%i==0)
{
n/=i;
a[i]=1;
}
}
while(m!=0)
{
for(int i=1;i*i<m;i++)
while(m%i==0)
{
n/=i;
if(a[i]!=0)
s++;
}
}
return s;
}

2.
#include <iostream>
 using namespace std;
int main()
{
unsigned int n[20][20],i,p,j;
cin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
if(i+j==n+1)
{
n[i][j]=0;
for(p=j-1;p>0;p--)
n[i][p]=n[i][p+1]+1;
for(p=j+1;p<=n;p++)
n[i][p]=n[i][p-1]+1;
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
cout<<n[i][j]<<" ";
cout<<'/n';
}
return 0;
}

3. #include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fin("bac.in");
int n=0,v[10000000],a[100000],i=0;
while(fin>>v[++n])
if(v[n]<0)
a[i++]=n;
if(a[1]<=n-a[i])
cout<<n-a[1];
else
cout<<n-a[i];
b. calculand distanta de la primul numar negativ la inceputul secventei si de
la ultimul numar negativ(daca exixta) la sfastitul secventei ,observam care dintre
cele doua este mai mica.
pentru a afla cea mai lunga secventa ceruta scadem numarul total de elemente la cea
mai mica distanta.