C++ Class Template Specialization

-

 You are given a main function which reads the enumeration values for two different types as input, then prints out the corresponding enumeration names. Write a class template that can provide the names of the enumeration values for both types. If the enumeration value is not valid, then print unknown.

Input Format

The first line contains , the number of test cases.
Each of the  subsequent lines contains two space-separated integers. The first integer is a color value, , and the second integer is a fruit value, .

Constraints

Output Format

The locked stub code in your editor prints  lines containing the color name and the fruit name corresponding to the input enumeration index.

Sample Input

2
1 0
3 3

Sample Output

green apple
unknown unknown

Explanation

Since , there are two lines of output.

  1. The two input index values,  and , correspond to green in the color enumeration and apple in the fruit enumeration. Thus, we print green apple.
  2. The two input values,  and , are outside of the range of our enums. Thus, we print unknown unknown.
  3.  SOLUTIONS:
  4. #include <iostream>
    using namespace std;
    enum class Fruit { apple, orange, pear };
    enum class Color { red, green, orange };

    template <typename T> struct Traits;


    // Define specializations for the Traits class template here.
    char s []="unknown";
    char f0 []="apple";
    char f1 []="orange";
    char f2 []="pear";
    char c0 []="red";
    char c1 []="green";
    char c2 []="orange";
    template <>
    struct Traits<Fruit>
    {
        public:
        static char* name(int a)
        {
            if(a>=3 || a<0)
                return s;
            else if (a==0)
                return f0;
            else if (a==1)
                return f1;
            else
                return f2;            
        }
    };

    template <>
    struct Traits<Color>
    {
        public:
        static char* name(int a)
        {
            if(a>=3 || a<0)
                return s;
            else if (a==0)
                return c0;
            else if (a==1)
                return c1;
            else
                return c2;  
        }
    };



    int main()
    {
        int t = 0; std::cin >> t;

        for (int i=0; i!=t; ++i) {
            int index1; std::cin >> index1;
            int index2; std::cin >> index2;
            cout << Traits<Color>::name(index1) << " ";
            cout << Traits<Fruit>::name(index2) << "\n";
        }
    }

Comments

Post a Comment

Popular posts from this blog

Valid Username Regular Expression

-
  You are updating the username policy on your company's internal networking platform. According to the policy, a username is considered valid if all the following constraints are satisfied: The username consists of   to   characters inclusive. If the username consists of less than   or greater than   characters, then it is an invalid username. The username can only contain alphanumeric characters and underscores ( _ ). Alphanumeric characters describe the character set consisting of  lowercase  characters  ,  uppercase  characters  , and digits  . The  first  character of the username must be an  alphabetic  character, i.e., either  lowercase  character   or  uppercase  character  . For example: Username Validity INVALID; Username length < 8 characters VALID VALID INVALID; Username begins with non-alphabetic character INVALID; '?' character not allow...
Read more

Java SHA-256

-
  Cryptographic hash functions are mathematical operations run on digital data; by comparing the computed   hash   (i.e., the output produced by executing a hashing algorithm) to a known and expected hash value, a person can determine the data's integrity. For example, computing the hash of a downloaded file and comparing the result to a previously published hash result can show whether the download has been modified or tampered with. In addition, cryptographic hash functions are extremely collision-resistant; in other words, it should be extremely difficult to produce the same hash output from two different input values using a cryptographic hash function. Secure Hash Algorithm 2  ( SHA-2 ) is a set of cryptographic hash functions designed by the National Security Agency (NSA). It consists of six identical hashing algorithms (i.e.,  SHA-256 ,  SHA-512 ,  SHA-224 ,  SHA-384 ,  SHA-512/224 ,  SHA-512/256 ) with a variable digest size....
Read more

Java Interface

-
  A Java interface can only contain method signatures and fields. The interface can be used to achieve polymorphism. In this problem, you will practice your knowledge on interfaces. You are given an interface  AdvancedArithmetic  which contains a method signature  int divisor_sum(int n) . You need to write a class called MyCalculator which implements the interface. divisorSum  function just takes an integer as input and return the sum of all its divisors. For example divisors of 6 are 1, 2, 3 and 6, so  divisor_sum  should return 12. The value of n will be at most 1000. Read the partially completed code in the editor and complete it. You just need to write the MyCalculator class only.  Your class shouldn't be public. Sample Input 6 Sample Output I implemented: AdvancedArithmetic 12 Explanation Divisors of 6 are 1,2,3 and 6. 1+2+3+6=12. SOLUTION: import  java . util .*; interface  AdvancedArithmetic {    int  divisor_sum ( ...
Read more