Question about chained sequence

[aboood]

Hi guys, how are you hope you are ok. First of all I'd like to thank you for the fantastic forum. I have a problem with c++. 10 days ago, I tried to solve a program and i didn’t reach to any thing. Also I asked a lot of people and forums but no body could solve it.:(
Please I'm very depressed, I wish you to help me.
Thank you

[DeMan]

You will probably find that people in most forums (including this one) don't like to complete assignments without seeing some sign that they have been attempted.......

the basic logic would be (in some form of non-standard pseudocode)......

found=false;
if this_number.number_of_digits=last_number.number_of_digits
while(!found && this_number.hasMoreDigits)
{
  if (abs(this_number-last_number)<10)
  {
    found =true;
  }
}
return found
 

[DeMan]

That's not actually (even close to) right (sorry) I don't know what I was thinking last night...

The last digit is the same if the two numbers are equal mod 10.
The last two digits are the same if the numbers are equal mod100
The last 3 digits are equal if the numbers are equal mod1000
.
.
The last n digits are equal if the numbers are equal mod 10^(n-1)
I think is what i meant, but that is still not entirely right

I think that it should've been

found=false;
if( this_number.number_of_digits=last_number.number_of  _digits)
{
n=10;
  while(!found && n<thisnumber)
  {
int difference =this_number-last_number;
    if ((abs(difference)mod n ==0)&&fifference/n <10)
    {
      found =true;
    }
  n=n*10;
  }
  return found;
}
 

Obviously you also need to check that this is true for the last number and first number