A - MUH and Sticks(471A - MUH and Sticks)

-

  2. 471A - MUH and Sticks
  3. #include<bits/stdc++.h>
  4. using namespace std;
  5. int main(){
  6. int a[6];
  7. for(int i=0;i<6;i++){
  8. cin>>a[i];
  9. }
  10. sort(a,a+6);
  11. multiset<int>x{a,a+6};
  12. set<int>y{a,a+6};
  13. int c=0 ;
  14.  
  15. c=x.count(a[3]);
  16. int s = y.size();
  17. //cout<<c<<s;
  18. int z=a[0];
  19. for(int i=0;i<6;i++){
  20. if(a[i]!=a[3]) {z=a[i]; break;}
  21. }
  22. if( c==6 ){ cout<<"Elephant";
  23. }
  24. else if(c==4 and ((z==a[4] and z==a[5]) or ( z==a[0] and z==a[1])) ){
  25. cout<<"Elephant"; }
  26.  
  27. else if(s<=3 and c>3 or c==5){ cout<<"Bear";
  28.  
  29. }
  30. else cout<<"Alien";
  31. return 0;
  32. }

Comments

Post a Comment

Popular posts from this blog

Codeforce Problem 1703A. YES or YES?

-
A. YES or YES?   There is a string  s �  of length  3 3 , consisting of uppercase and lowercase English letters. Check if it is equal to " YES " (without quotes), where each letter can be in any case. For example, " yES ", " Yes ", " yes " are all allowable. Input The first line of the input contains an integer  t �  ( 1 ≤ t ≤ 10 3 1 ≤ � ≤ 10 3 ) — the number of testcases. The description of each test consists of one line containing one string  s �  consisting of three characters. Each character of  s �  is either an uppercase or lowercase English letter. Output For each test case, output " YES " (without quotes) if  s �  satisfies the condition, and " NO " (without quotes) otherwise. You can output " YES " and " NO " in any case (for example, strings " yES ", " yes " and " Yes " will be recognized as a positive response). Example input Copy 10 YES yES yes Yes YeS Noo orZ yEz Y...
Read more

Aptitude test assistant programmer 2018

-
 #include <stdio.h> #include <stdlib.h> int main() { char str[100]; int i; int space=0;     printf("Enter a string\n");     fgets(str,sizeof(str),stdin);     i=0;     while(i<=str[i]){  if(str[i]==' '){         space++;     }     i++; } printf("Total word count :%d" ,space+1);       return 0; }
Read more

1041A. Heist solution

-
#include <iostream> #include <algorithm> using namespace std ; int main () { long int n ; cin >> n ;   long long arr [ n ]; for ( int j = 0 ; j < n ; j ++){ cin >> arr [ j ];}   sort ( arr , arr + n );   int b = arr [ 0 ];   int l = arr [ n - 1 ];   int x = 0 ;   for ( int i = b ; i <= l ; i ++) {   x ++; }   cout << x - n ;   return 0 ; }
Read more