Problem: Two integers are considered to be friendly if all of the digits in the

Question

Problem: Two integers are considered to be friendly if all of the digits in the first number appear in the second
number. Given ten integers as input display all pairs of “friends” in the set where the second number must
come after (order of input) the first in the data set.
• The user will always enter 10 non-negative integers as input. Leading zero digits are ignored.
• Display no more than 5 pairs of friends per line of output.

Example Execution #1:
Enter data #1: 1234
Enter data #2: 4321
Enter data #3: 2111
Enter data #4: 12345
Enter data #5: 5432
Enter data #6: 23451
Enter data #7: 3
Enter data #8: 2341112
Enter data #9: 5423
Enter data #10: 3

Friends: [1234, 4321] [1234, 12345] [1234, 23451] [1234, 2341112] [4321, 12345]
[4321, 23451] [4321, 2341112] [2111, 12345] [2111, 23451] [2111, 2341112]
[12345, 23451] [5432, 23451] [5432, 5423] [3, 2341112] [3, 5423]
[3, 3]

Example Execution #2:
Enter data #1: 2222
Enter data #2: 22222
Enter data #3: 222222
Enter data #4: 2222222
Enter data #5: 222222
Enter data #6: 22222
Enter data #7: 2222
Enter data #8: 222
Enter data #9: 22
Enter data #10: 2

Friends: [2222, 22222] [2222, 222222] [2222, 2222222] [2222, 222222] [2222, 22222]
[2222, 2222] [2222, 222] [2222, 22] [2222, 2] [22222, 222222]
[22222, 2222222] [22222, 222222] [22222, 22222] [22222, 2222] [22222, 222]
[22222, 22] [22222, 2] [222222, 2222222] [222222, 222222] [222222, 22222]
[222222, 2222] [222222, 222] [222222, 22] [222222, 2] [2222222, 222222]
[2222222, 22222] [2222222, 2222] [2222222, 222] [2222222, 22] [2222222, 2]
[222222, 22222] [222222, 2222] [222222, 222] [222222, 22] [222222, 2]
[22222, 2222] [22222, 222] [22222, 22] [22222, 2] [2222, 222]
[2222, 22] [2222, 2] [222, 22] [222, 2] [22, 2]

Example Execution #3:
Enter data #1: 1
Enter data #2: 2
Enter data #3: 3
Enter data #4: 4
Enter data #5: 5
Enter data #6: 6
Enter data #7: 7
Enter data #8: 8
Enter data #9: 9
Enter data #10: 10
Friends: [1, 10]

Example Execution #4 (no friends, so sad):
Enter data #1: 1
Enter data #2: 2
Enter data #3: 3
Enter data #4: 4
Enter data #5: 5
Enter data #6: 6
Enter data #7: 7
Enter data #8: 8
Enter data #9: 9
Enter data #10: 0

Explanation / Answer

Please rate...

#include<stdio.h>
void main()
{
    int a[10];
    int i,j,c,t,t1,c1,a1,b,d=0;
    printf("Enter the 10 numbers:");
    for(i=0;i<10;i++)
    {
        printf(" Enter data #%d: ",(i+1));
        scanf("%d",&a[i]);
    }
    printf("Friends: ");
    for(i=0;i<9;i++)
    {
        c=0;
        t=a[i];
        while(t!=0)
        {
            c++;
            t=t/10;
        }
        //printf("%d ",c);
        t=a[i];
        for(j=i+1;j<10;j++)
        {
            t=a[i];
            t1=a[j];
            c1=0;
            while(t!=0)
            {
                a1=t%10;
                t1=a[j];
                while(t1!=0)
                {
                    b=t1%10;
                    if(a1==b){c1++;t1=t1/10;break;}
                    t1=t1/10;
                }
                //printf(" c1: %d",c1);
                t=t/10;
            }
            if(c1==c){printf("[ %d, %d ]",a[i],a[j]);d++;}
            if(d==5){printf(" ");d=0;}
        }
    }
}

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.