Question

Q3 [Number Searching] (25%) Given two non-negative integers A (data type: int) and B (data type: int), write a C++ program to determine whether A contains B, wherein "contains” means an exact match. For example, • If A is 12345 and B is 234, A contains B, where the matching part is underlined in A. • If A is 12345 and B is 235, A does not contain B, even A has the digits 2, 3 and 5. It is not an exact match. Notes: 1. Assume both inputs are correct. No need to check the correctness of input. 2. A and B are both in the simplest form (e.g., no 0 prefix such as 001). 3. Students are not supposed to use char, string or libraries other than cout. Hint: Suppose A is 12345 and B is 234. Because B has n (e.g., 3) digits, you can check the last n(e.g., 3) digits of A. If these n (e.g., 3) digits do not equal to B, you can update A by discarding its last digit, e.g., A is updated to 1234, and continue to check the last n digits of this new A. In addition, when A equals to B, this can be considered as a special case to handle.

Answer 1

_Answer:

_{C++ code in code snippet :}

#include <iostream>

using namespace std;
int numberlen(int i)
{
    int n=0;
    while(i>0)
    {
        i=i/10;
        n++;
    }
    return n;
}

int main()
{
    int a,b;
    cin >>a>>b;
    if(a==b)
    {
    cout <<"A equal to B";
    return 0;
    }
    int n=numberlen(b);
    int an=numberlen(a);
    int temp=1,flag=0;
    for(int i=0;i<n;i++)
    {
        temp=temp*10;
    }
    while(an>=n)
    {
        if(a%temp==b)
        {
           flag=1;
            break;
        }
        else
        {
            a=a/10;
            an--;
        }
    }
    if(flag==1)
    cout <<"A contains B";
    else
    cout<<"A does not contain B";
    return 0;
}

Screenshots of code and output:

File Edit View Search Project Build Debug Fortran wxSmith Tools Tools+ Plugins DoxyBlocks Settings Help Start here x match.cpp X #include <iostream> 1 2 3 4 5 6 7 using namespace std; int numberlen(int i) int i=0; while(i>0) [ isi/10; ntti х 9 10 11 12 12 14 15 16 17 18 19 20 21 C:\Users\Sony\Desktop\talentio\match.exe 12345 234 A contains B Process returned 0 (0x0) execution time : 7.978 S Press any key to continue 25 26 return ni L1 int main() QL int ab: cir: >>>>b: if(a=b [ cout <<"A equal to B": return 0; ) int numberlen(b) int an numberlen(a) int temp=1, Flag=0; for(int i=0;i<n;i++) [ I temp temp 10 ] while (an) D { if(a tempb) { Flags1: break; ] else [ a=a/101 an 29 30 31 32 35 36 37 39 40 41 42 43 1 if (flag=1) cout <<"A contains B": else cout<<"A does not contain B": return 0; 45 46 47 49 Logs & others X
Output in another compiler:

Run Debug Stop Share Save {} Beautify Language C++ main.cpp 23 24 25 26 27 - 28 29 30 31 32 33 - 34 35 36 37 38 - 39 40 41 42 43 44 45 46 47 48} 49 int n=numberlen(b); int an-numberlen(a); int temp=1,flag=0; for(int i=0;i<n;i++) { temp=temp 10; } while(an>=n) { if(a%temp==b) { flag=1; break; } else { a=a/10; an--; } } if(flag==1) cout <<"A contains B"; else cout<<"A does not contain B"; return ; input 12345 235 A does not contain B