Treasure Hunt | Codechef

While his trip to an ancient palace Harry found a box while wandering in the palace.
The box is rectangular and consists of a lock on it's each vertical face. He has also found two keys attached to the top of the box. The box displays an arbitrary number N on its top.

You have to find out whether this box can be opened by this number or not.
The box can be opened by a number, iff it is a multiple of a number of keys and number of locks and number of corners in the rectangular box(all 3 conditions satisfying simultaneously).

If the box can be opened by the displayed number print YES otherwise NO.

Input

  • The first line of the input contains an integer T denoting the number of test cases. The description of T test cases is as follows.
  • The first line of each test case contains a single integer N, which is displayed on the top of the box.

Output

For each test case, Output YES if the box can be opened otherwise NO.

Constraints

  • 1 ≤ T ≤ 108
  • 1 ≤ N ≤ 1030

Subtasks

Subtask #1 (10 points):
  • 1 ≤ N ≤ 108
Subtask #2 (40 points):
  • 1 ≤ N ≤ 1018
Subtask #3 (50 points): original constraints
Input:
3
72
32
20

Output:
YES
YES
NO

Solution(C++):

#include
using namespace std;
void check_fact(string num)
{
    int n=0 ;
    if(num.size()==1)
        n=num[0]-'0';
    if(num.size()==2)
        n=(num[num.size()-2]-'0')*10 + num[num.size()-1];
    else
    {
        n=(num[num.size()-3]-'0')*100 + (num[num.size()-2]-'0')*10 + num[num.size()-1];
    }
    if(n%8==0)
      cout<<"YES"<
    else 
      cout<<"NO"<
}
int main() 
{
int t;
cin>>t;
while(t--)
{
    string num;
    cin>>num;
    check_fact(num);
}
return 0;
}

Comments

Post a Comment

Popular posts from this blog

Boxes through a Tunnel | HackerRank

You are transporting some boxes through a tunnel, where each box is a  parallelepiped , and is characterized by its length, width and height. The height of the tunnel   feet and the width can be assumed to be infinite. A box can be carried through the tunnel only if its height is strictly less than the tunnel's height. Find the volume of each box that can be successfully transported to the other end of the tunnel. Note: Boxes cannot be rotated. Input Format The first line contains a single integer  , denoting the number of boxes.  lines follow with three integers on each separated by single spaces    ,   and   which are length, width and height in feet of the  -th box. Constraints Output Format For every box from the input which has a height lesser than   feet, print its volume in a separate line. Sample Input 0 4 5 5 5 1 2 40 10 5 41 7 2 42 Sample ...
Read more

Array Manipulation | HackerRank

Image
Starting with a 1-indexed array of zeros and a list of operations, for each operation add a value to each of the array element between two given indices, inclusive. Once all operations have been performed, return the maximum value in your array. For example, the length of your array of zeros  . Your list of queries is as follows: a b k 1 5 3 4 8 7 6 9 1 Add the values of   between the indices   and   inclusive: index -> 1 2 3 4 5 6 7 8 9 10 [ 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 ] [ 3 , 3 , 3 , 3 , 3 , 0 , 0 , 0 , 0 , 0 ] [ 3 , 3 , 3 , 10 , 10 , 7 , 7 , 7 , 0 , 0 ] [ 3 , 3 , 3 , 10 , 10 , 8 , 8 , 8 , 1 , 0 ] The largest value is   after all operations are performed. Function Description Complete the function  arrayManipulation  in the editor below. It must return an integer, the maximum value in the resulting array. arrayManipulation has the fo...
Read more

String Validators | HackerRank

Python has built-in string validation methods for basic data. It can check if a string is composed of alphabetical characters, alphanumeric characters, digits, etc. str.isalnum() This method checks if all the characters of a string are alphanumeric  (a-z, A-Z and 0-9) . >>> print 'ab123'.isalnum() True >>> print 'ab123#'.isalnum() False str.isalpha() This method checks if all the characters of a string are alphabetical  (a-z and A-Z) . >>> print 'abcD'.isalpha() True >>> print 'abcd1'.isalpha() False str.isdigit() This method checks if all the characters of a string are digits  (0-9) . >>> print '1234'.isdigit() True >>> print '123edsd'.isdigit() False str.islower() This method checks if all the characters of a string are lowercase characters  (a-z) . >>> print 'abcd123#'.islower() True >>> print 'Abcd123#'.islower() False str....
Read more