Question

Error Interview Bit Trilogy Innovations 29th July 2021 00 Hr: 40 min : 31 sec 1/3 Attempted End Test S1 Default Section Q1 Q2 > Q3 Homecoming Party Flag Question 1 Problem Description The original family in the town has organised a homecoming party with N people invited. 2 Each person has a special trust value denoted by array A. A person i will be friends with a person j only if either A[i]%A[j]==0 or A[j]%A[i]==0. 3 Find the maximum number of friends each person can make in this party. Problem Constraintsĺ​

Answer 1

Answer:

it is the 69

Explanation:

the 69 is a number which is reversed also same very funny

Answer 2

Answer:its hard to to get without time limit exceedeing  i tryied but couldnt make it without nested for loop

Explanation:

all i can do was use for loop

vector<int>out(A.size(),0);

for(int i=0;i<A.size;i++){

for(i=j+1;j<A.size;j++){

if(A[i]%A[j]==0||A[j]%A[i]==0){

out[j]++;

out[i]++;

}

}

}

return out;