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;
}