marți, 23 noiembrie 2010

d

#include
int verificare(int x)
{int c[10],i,j,ok,k;
j=0;
while(x!=0)
{j++;
c[j]=x%10;
x=x/10;
}
ok=0;
for(i=1;i<=j;i++)
for(j=1;j<=k;j++)
if(c[i]==c[k]&&j!=k)
ok=1;
return ok;
}
int main()
{int a[20],i,n,l;
cin>>n;
for(i=1;i<=n;i++)
{cout<<"a["<cin>>a[i];}
for(i=1;i<=n;i++)
if(verificare(a[i])==0)
l++;
cout<<"in vector sunt "<return 0;
}

prob9

#include
int inversa(int x)
{int inv=0,c,y;
while(x!=0)
{c=x%10;
inv=inv*10+c;
y=y/10;}
if(nr==inv)
return 1;

else
return 0;
}
int main()
{int nr;
cout<<"nr=";cin>>nr;
if(invers(nr)==1)
cout<<"nr este palindrom";
else
cout<<"nr nu este palindrom";
return 0;
}

palind

#include < iostream . h >
int inversa(int x )
{int inv=0,c,y;
while(x!=0)
{c=x%10;
inv=inv*10+c;
y = y/10;}
if ( nr ==inv)
return 1;

else
return 0;
}
int main()
{int nr;
cout < < "nr = ";cin > > nr;
if(invers(nr)==1)
cout < < "nr este palindrom";
else
cout < < " n r nu este palindrom";
return 0;
}

problema 10

#include < iostream . h >
int verificare ( int x )
{ int c[10],i,j,ok,k;
j=0;
while ( x!=0)
{ j + + ;
c[ j ] = x % 10;
x= x / 1 0 ;
}
ok =0;
for(i=1;i<=j;i++)
for(j=1;j<=k;j++)
if(c[i]==c[k]&&j!=k)
ok=1;
return ok;
}
int main()
{int a[20],i,n,l;
cin > > n;
for(i=1;i<=n;i++)
{cout < <"a[" < < i < <"]=";
cin> > a [i];}
if(verificare(a[i])==0)
l++;
cout < <"in vector sunt " < < l < < " valori cu toate cifrele distincte";
return 0;
}

marți, 12 octombrie 2010

min si max (tema)

#include < iostream.h >
#include < math.h >
int main()
{int a[50],n,i,min,max,p1,p2,ok,aux;
cout< <"n=";cin> >n;
for(i=1;i<=n;i++)
{cout< <"a["< < <"]=";
cin>>a[i];}
min=a[i];
max=a[i];
for(i=1;i<=n;i++)
{if(a[i]
{min=a[i];
p1=i;}
if(a[i]>max)
{max=a[i];
p2=i;}
if(p1>p2)
{aux=p1;
p1=p2;
p2=aux;}
}
do
{ok=0;
for(i=p1;i<=p2-1;i++)
if(a[i]>a[i+1])
{aux=a[i];
a[i]=a[i+1];
a[i+1]=aux;
ok=1;}
}
while(ok==1);
for(i=1;i<=n;i++)
cout < < " ";
return 0;
}

luni, 11 octombrie 2010

prob cu min

/*se citeste un vector cu n nr intregi disticte.Sa se determine pozitia pe care se afla cea mai mica val din vector si de
la ea in colo sa se ordoneze crescator vec folosind met bulelor*/
#include
#include
int main()
{int a[50],i,n,ok,min,aux,p;
cout < < "n=";cin > > n;
for(i=1;i<=n;i++)
{cout < <"a["<cin > > a[i];}
min = a [ 1 ] ;
for ( i = 1 ; i < =n;i++)
if(a[i] {min=a[i];
p=i;}
do
{ok=0;
for(i=p;i<=n-1;i++)
if(a[i]>a[i+1])
{aux=a[i];
a[i]=a[i+1];
a[i+1]=aux;
ok=1;
}
}
while(ok==1);
for(i=1;i<=n;i++)
cout < < a[ i ] < < " ";
return 0;
}

marți, 5 octombrie 2010

05.10

/*inter clasarea a 2 vectori
se citesc 2 vec ordon cresc sa se formeze al 3 vec ordon cresc*/
#include< iostream.h >
#include< conio.h >
int main()
cout<< "n=";cin>> n;
for(i=1;i<=n;i++)
{cout<< "a[" << i << "]=";
cin>> a[i];}
cout<<"m=";cin>>m;
for(j=1;j<=n;j++)
{cout<< "b[" << i << "]=";
cin>>b[j];}
while(i<=n&&j<=m)
{if(a[i] {c[k]=a[i];
i++;k++;}
else
if(a[i]>b[j])
{c[k]=b[j];
j++;k++;}
if(i>n)
for(i=j;j<=m;i++)
{c=[k]=b[i];
k++;
else
if(j>m)
for(j=1;j<=n;j++)
{c[k]=a[j];
k++;
for(i=1;i<=n;i++)
cout i
r