Skip to main content

Zoombie Problem

 

 

          => Problem Condition

=>Solution

#include<iostream>
using namespace std;

int common(int a, int b)
{
    if (b == 0)
        return a;
    return common(b, a % b);

}

int find(int input1[],int input2){

int maxValue;  //by default zero in function
for(int i = 0;i <input2; ++i)
    {
       if(maxValue < input1[i])
           maxValue = input1[i];
    }
    cout << "Largest percentage of Zoombie = " << maxValue<<endl<<endl;


int mycount=0;
int index[100];
for(int i=0; i<input2; ++i){
  if(maxValue==input1[i]){
        index[mycount]=i;
    cout<<"Find at city no. "<<i<<endl;
    mycount++;
  }
}


for(int i=0;i<mycount;++i){
    cout<<"index["<<i<<"] : "<<index[i]<<endl;
}


for(int i=0; i<mycount; ++i){

 if(index[i]!=input2-1){
     if(common(input1[index[i]],input1[index[i]+1])==1){
        cout<<input1[index[i]]<<" co-prime with "<<input1[index[i]+1]<<endl;
    return index[i];
  }
 }
}

}


int main(){

int input2;
cout<<"Enter the number of City\n";
cin>>input2;

int input1[input2];

cout<<"Enter the percentage of zombie at city no wise \n";
for(int i=0;i<input2;i++){
    cin>>input1[i];
}

cout<<"Your percentage of zombie at city no wise \n";
for(int i=0;i<input2;i++){
  cout<<"city no["<<i<<"] : "<<input1[i]<<endl;
}
cout<<endl;

cout<<"Number of City : "<<input2<<endl;

int chances=find(input1,input2);

cout<<"Favorable city  No : "<<chances<<endl;

return 0;
}


=>Output :

 

(i). Example 1

 


(ii). Example 2:


Comments

Popular posts from this blog

Maximum possible number of monsters you can defeat?

 Q).Maximum possible number of monsters you can defeat?  =>Introduction: While playing an RPG game, you were assigned to complete one of the hardest quests in this game. There are n monsters you'll need to defeat in this quest. Each monster i is described with two integer numbers - poweri and bonusi. To defeat this monster, you'll need at least poweri experience points. If you try fighting this monster without having enough experience points, you lose immediately. You will also gain bonusi experience points if you defeat this monster. You can defeat monsters in any order. The quest turned out to be very hard - you try to defeat the monsters but keep losing repeatedly. Your friend told you that this quest is impossible to complete. Knowing that, you're interested, what is the maximum possible number of monsters you can defeat? (Question difficulty level: Hardest) => Input: The first line contains an integer, n, denoting the number of monsters. The next line contains an...

Menu with 5 option & selected option should appear in text box

Q6. Create a menu with 5 options and selected option should appear in text box. Android Program : Activity_main.xml <?xml version="1.0" encoding="utf-8"?> <RelativeLayout xmlns:android="http://schemas.android.com/apk/res/android"     xmlns:tools="http://schemas.android.com/tools"     android:id="@+id/activity_main"     android:layout_width="match_parent"     android:layout_height="match_parent"     android:paddingBottom="@dimen/activity_vertical_margin"     android:paddingLeft="@dimen/activity_horizontal_margin"     android:paddingRight="@dimen/activity_horizontal_margin"     android:paddingTop="@dimen/activity_vertical_margin"     tools:context="com.kishanhaldar.program6.MainActivity">                 ...

Closest Number

Closest Number Basic Accuracy: 11.21% Submissions: 1615 Points: 1 Given non-zero two integers N and M . The problem is to find the number closest to N and divisible by M . If there are more than one such number, then output the one having maximum absolute value .   Example 1: Input: N = 13 , M = 4 Output: 12 Explanation: 12 is the Closest Number to 13 which is divisible by 4. Example 2: Input: N = -15 , M = 6 Output: -18 Explanation: -12 and -18 are both similarly close to -15 and divisible by 6. but -18 has the maximum absolute value. So, Output is -18   Your Task: You don't need to read input or print anyth...