Problem:
Arpasland has surrounded by attackers. A truck enters the city. The driver claims the load is food and medicine from Iranians. Ali is one of the soldiers in Arpasland. He doubts about the truck, maybe it’s from the siege. He knows that a tag is valid if the sum of every two consecutive digits of it is even and its letter is not a vowel. Determine if the tag of the truck is valid or not.
We consider the letters “A”,”E”,”I”,”O”,”U”,”Y” to be vowels for this problem.
Input Format
The first line contains a string of length 9. The format is “DDXDDDDD”, where D stands for a digit (non zero) and X is an uppercase english letter.
Output Format
Print “valid” (without quotes) if the tag is valid, print “invalid” otherwise (without quotes)
The tag is invalid because the sum of first and second digit of it is odd (also the sum of 4’th and 5’th, 5’th and 6’th and 8’th and 9’th are odd).
Code:
Here I am going to give you two solution first one is on the basis of C language and second one is on the basis of c++ language which you can submit in c++14 and c++17 also
Solution 1 ( C language):
Solution 2 ( C++ language):
Recommended Post:

Hackerearth Problems:
 Very Cool numbers  Hacker earth solution
 Birthday party  Hacker earth solution
 Most frequent  hacker earth problem solution
 program to find symetric difference of two sets
 cost of balloons  Hacker earth problem solution
 Chacha o chacha  hacker earth problem solution
 jadu and dna  hacker earth solution
 Bricks game  hacker earth problem
 AntiPalindrome strings  hacker earth solution
 connected components in the graph  hacker earth data structure
 odd one out  hacker earth problem solution
 Minimum addition  Hackerearth Practice problem
 The magical mountain  Hackerearth Practice problem
 The first overtake  Hackerearth Practice problem
Data structure:
 Program to find cycle in the graph
 Implementation of singly link list
 Implementation of queue by using link list
 Algorithm of quick sort
 stack by using link list
 program to find preorder post order and inorder of the binary search tree
 Minimum weight of spanning tree
 Preorder, inorder and post order traversal of the tree
Key points: