Mahasena  Codechef solution
Problem of Mahasena  Codechef solution:
Kattapa, as you all know was one of the greatest warriors of his time. The kingdom of Maahishmati had never lost a battle under him (as armychief), and the reason for that was their really powerful army, also called as Mahasena.
Kattapa was known to be a very superstitious person. He believed that a soldier is “lucky” if the soldier is holding an even number of weapons, and “unlucky” otherwise. He considered the army as “READY FOR BATTLE” if the count of “lucky” soldiers is strictly greater than the count of “unlucky” soldiers, and “NOT READY” otherwise.
Given the number of weapons each soldier is holding, your task is to determine whether the army formed by all these soldiers is “READY FOR BATTLE” or “NOT READY”.
Note: You can find the definition of an even number here.
Input of Mahasena  Codechef solution
The first line of input consists of a single integer N denoting the number of soldiers. The second line of input consists of N space separated integers A_{1}, A_{2}, …, A_{N}, where A_{i} denotes the number of weapons that the i^{th} soldier is holding.
Output
Generate one line output saying “READY FOR BATTLE”, if the army satisfies the conditions that Kattapa requires or “NOT READY” otherwise (quotes for clarity).
Constraints
 1 ≤ N ≤ 100
 1 ≤ A_{i} ≤ 100
Example 1
Input:
1
1
Output:
NOT READY
Example 2
Input:
1
2
Output:
READY FOR BATTLE
Example 3
Input:
4
11 12 13 14
Output:
NOT READY
Example 4
Input:
3
2 3 4
Output:
READY FOR BATTLE
Example 5
Input:
5
1 2 3 4 5
Output:
NOT READY
Explanation

 Example 1: For the first example, N = 1 and the array A = [1]. There is only 1 soldier and he is holding 1 weapon, which is odd. The number of soldiers holding an even number of weapons = 0, and number of soldiers holding an odd number of weapons = 1. Hence, the answer is “NOT READY” since the number of soldiers holding an even number of weapons is not greater than the number of soldiers holding an odd number of weapons.
 Example 2: For the second example, N = 1 and the array A = [2]. There is only 1 soldier and he is holding 2 weapons, which is even. The number of soldiers holding an even number of weapons = 1, and number of soldiers holding an odd number of weapons = 0. Hence, the answer is “READY FOR BATTLE” since the number of soldiers holding an even number of weapons is greater than the number of soldiers holding an odd number of weapons.
 Example 3: For the third example, N = 4 and the array A = [11, 12, 13, 14]. The 1^{st} soldier is holding 11 weapons (which is odd), the 2^{nd} soldier is holding 12 weapons (which is even), the 3^{rd} soldier is holding 13 weapons (which is odd), and the 4^{th} soldier is holding 14 weapons (which is even). The number of soldiers holding an even number of weapons = 2, and number of soldiers holding an odd number of weapons = 2. Notice that we have an equal number of people holding even number of weapons and odd number of weapons. The answer here is “NOT READY” since the number of soldiers holding an even number of weapons is not strictly greater than the number of soldiers holding an odd number of weapons.
 Example 4: For the fourth example, N = 3 and the array A = [2, 3, 4]. The 1^{st} soldier is holding 2 weapons (which is even), the 2^{nd} soldier is holding 3 weapons (which is odd), and the 3^{rd} soldier is holding 4 weapons (which is even). The number of soldiers holding an even number of weapons = 2, and number of soldiers holding an odd number of weapons = 1. Hence, the answer is “READY FOR BATTLE” since the number of soldiers holding an even number of weapons is greater than the number of soldiers holding an odd number of weapons.
 Example 5: For the fifth example, N = 5 and the array A = [1, 2, 3, 4, 5]. The 1^{st} soldier is holding 1 weapon (which is odd), the 2^{nd} soldier is holding 2 weapons (which is even), the 3^{rd} soldier is holding 3 weapons (which is odd), the 4^{th} soldier is holding 4 weapons (which is even), and the 5^{th} soldier is holding 5 weapons (which is odd). The number of soldiers holding an even number of weapons = 2, and number of soldiers holding an odd number of weapons = 3. Hence, the answer is “NOT READY” since the number of soldiers holding an even number of weapons is not greater than the number of soldiers holding an odd number of weapons.
Code:
#include <iostream> using namespace std; int main() { int n,a; cin>>n; int even=0,odd=0; for(int i=0;i<n;i++) { cin>>a; if(a%2==0) even++; else odd++; } if(even>odd) cout<<"READY FOR BATTLE"; else cout<<"NOT READY"; return 0; }
Recommended Post:

codechef problems:
Wipro :
 Update the booking ID  Wipro previous year question paper solution
 Pages in PDF
 Find the location id
 Find the odd digits
 Find the Product ID
Infytq :
Key Points;
Hackerrank:
 Python : missing characters : hackerrank solution
 Python : string transformation  Hackerrank solution
 Active Traders certification test problem  Hackerrank Solution
 Usernames changes certification test problem  Hackerrank Solution
 string Representation of objects certification test hackerrank solution
 Average Function  hackerrank certification problem solution
Ctutorial:
 Micros in C
 Pointer in c
 Function declaration
 Types of user define function
 return type of function
 2D array
See more:
 c program to convert specified days into years weeks and days
 Print Reverse Hollow Pyramid
 Update the booking ID  Wipro previous year question paper
 Pages in PDF  Wipro previous year question paper
 Sparse Matrix in data structure
 Find the location ID  Wipro previous year Coding question
 find the odd digits  Wipro Coding question
 Find the product id  Wipro Coding question
 Difference between static and dynamic memory allocation
 What is asymptotic Notation