• Result
  • Today's Puzzle
    • Previous Puzzles
    • Prize & Rules
  • Discussion Board
    • Suggestion Board
    • Trending Articles
  • Maths Tricks
  • Placement Papers
    • Placement Questions
    • Interview Experience
    • Placed user Comment
    • Group Discussion
  • English APP
  • login
  • Result
  • Today's Puzzle
    • Previous Puzzles
    • Prize & Rules
  • Discussion Board
    • Suggestion Board
    • Trending Articles
  • Maths Tricks
  • Placement Papers
    • Placement Questions
    • Interview Experience
    • Placed user Comment
    • Group Discussion
  • Walkins
    • Corporate Job Exam
    • Government Job Exam
    • Entrance Exam
  • Training
    • Internship
  • Placement Questions
  • /
  • Others
  • /
  • Programming

Others Programming Math Questions and Answer

Others Select Another Category Programming Select Another Topic

Maths Puzzle

  • A website 299
  • Book 23779
  • Campus 250
  • CMAT 49
  • Exam 86152
  • General 399
  • Interview 141
  • M4maths 295
  • Maths 226
  • Orkut 27
  • Other 72
  • Others 1356
  • Reasoning 101
  • Self 3157

Others Question Topics

    Category (34)

    General Ability (7)

  • General Knowledge (4)
  • HR Interview (11)

  • Interview (8)
  • Logical Reasoning (86)

  • Algebra (1)
  • Blood Relations (9)
  • Coding Decoding (6)
  • Cryptography (12)
  • Decision Making and Problem Solving (4)
  • Direction Sense (2)
  • General Mental Ability (10)
  • Letter Series (1)
  • Logical Sequences (2)
  • Mathematical Reasoning (7)
  • Missing Character (2)
  • Number Series (5)
  • Seating Arrangement (3)
  • Numerical Ability (218)

  • Age Problem (7)
  • Algebra (11)
  • Alligation or Mixture (3)
  • Area and Volume (5)
  • Arithmetic (6)
  • Averages (3)
  • Boats and Streams (1)
  • Clocks and Calendars (3)
  • Data Sufficiency (2)
  • Geometry (6)
  • Height and Distance (1)
  • Number System (19)
  • Percentage (6)
  • Permutation and Combination (16)
  • Probability (11)
  • Profit and Loss (5)
  • Quadratic Equations (5)
  • Ratio and Proportion (4)
  • Sequence and Series (4)
  • Simple & Compound Interest (5)
  • Time and Work (11)
  • Time Distance and Speed (3)
  • Trigonometry (1)
  • Programming (10)

  • Arrays (1)
  • Basics (1)
  • Program (5)
  • Puzzles (1)
  • Verbal Ability (5)

  • Antonyms (2)
  • Miscellaneous (1)
  • Sentence Completion (1)
Keep an EYE (0)
Solved Question (0) UnSolved Question (10)
Pages: 11
Advertisements

(#M40034298) OTHERS QUESTION find output Keep an EYE Keep an eye puzzle Keep an eye puzzle

What is the output of the program

void main()
{
int i,j,k;
i=2;
j=4;
k=i++>j&2;
printf("%d\n",k);
if(++k && ++i<--j|| i++)
{
j=++k;
}
printf(" %d %d %d",i,-j--,k);
getch();
}
Option
A. 4,-3,2
B. 5,-3,2
C. 4,-2,2
D. 5,-2,2

Asked In Others priyanka aggarwal (11 years ago)
Unsolved Read Solution (5)
Is this Puzzle helpful?   (22)   (8) Submit Your Solution Program

(#M40034291) OTHERS QUESTION twin prime number Keep an EYE Keep an eye puzzle Keep an eye puzzle

4,6,12,18,30,42,60,72,102,108,...
Print next 3 number through c programming.

Asked In Others mithilesh kumar (11 years ago)
Unsolved Read Solution (2)
Is this Puzzle helpful?   (18)   (4) Submit Your Solution Program
Advertisements

(#M40034290) OTHERS QUESTION twin prime number Keep an EYE Keep an eye puzzle Keep an eye puzzle

Print the next 3 number of the given pattern series:
4,6,12,18,30,42,60,72,102,108,...

Asked In Others mithilesh kumar (11 years ago)
Unsolved Read Solution (1)
Is this Puzzle helpful?   (2)   (1) Submit Your Solution Program

(#M40034065) OTHERS QUESTION programming Keep an EYE Keep an eye puzzle Keep an eye puzzle

Write a class that represents a minimal heap. The heap class should at a minimum support the following methods: - AllocTinyHeap() which should initialize the heap with a given amount of bytes - DeleteTinyHeap() which frees all memory associated with the heap - TinyAlloc() which allocates a given number of bytes on the heap if there is room - TinyFree() which frees a specific location on the heap You may define whatever parameters are necessary for the above methods as well as write any additional methods. Overall consideration will be given to correctness, design, code readability as well as any unit testing done. As part of a final solution please submit test cases you used to verify correctness in addition to any unit tests done.

Asked In Others srinivas (11 years ago)
Unsolved
Is this Puzzle helpful?   (1)   (0) Submit Your Solution Program

(#M40033558) OTHERS QUESTION fresher Keep an EYE Keep an eye puzzle Keep an eye puzzle

vlsi n digital logic

Asked In Others khalid (11 years ago)
Unsolved
Is this Puzzle helpful?   (0)   (0) Submit Your Solution

(#M40032513) OTHERS QUESTION Coding Keep an EYE Keep an eye puzzle Keep an eye puzzle

Bleak Numbers

In Mathematics each number has one special number, which it supports, chosen as follows. It counts the number of ones in its own binary representation, and adds this count to itself to obtain the value of the number it supports. That is, if j(m) means the number of ones in the binary representation of m, then m supports m+j(m). For example, the number eight (1000 in binary) supports nine, whereas nine supports eleven.

However, in this way not all the numbers get supported; some are left without support, and we call these numbers bleak. For example since one supports two, two supports three and three supports five, there is no number less than four, which would support four, so four is bleak.

Your task is for a given number recognize if it is bleak or supported by some number.



Input

First integer containing the number of test cases, followed by the number to be checked.

Output

For every checked number n write one line containing the word BLEAK if n is bleak or the word SUPPORTED if given n there exists m such that n=m+j(m). In case of wrong input print -999.



Examples

Input:

2,4,9

Asked In Others Ranvir Rana (11 years ago)
Unsolved Read Solution (1)
Is this Puzzle helpful?   (8)   (4) Submit Your Solution

(#M40019807) OTHERS QUESTION Keep an EYE Keep an eye puzzle Keep an eye puzzle

Problem
In a holy village of India, there was a famous Guru. He had a number of followers from different countries. The day came when one of his favourite disciple Shiva was graduating. Filled with gratitude, and as is the ancient Indian custom, Shiva inquired about how he should pay his Guru Dakshina.(Tuition Fees)
The Guru was a wise man. He decided to teach Shiva one last lesson in the Art of Thinking Mathematically. He demanded his Dakshina (Fees) from Shiva in following manner
Guru wanted 100 gems distributed in 7 purses such that number of gems in 7 purses should always sum up to 100. But his condition was that he can demand any number of gems between 1 to 100 and Shiva must be able to satisfy his demand without needing to open any purse. Also once Shiva packs the purses, he will not get another chance to rearrange the number of Gems in those 7 purses. So consider that these purses are sealed the moment Shiva puts appropriate number of Gems in it.
Out of affection, the Guru decided to step up the difficulty level so that Shiva can survive the turbulent world outside the Gurukul. The Guru added one more condition that out of 7 purses Guru will always fill one purse with any number of gems. Thus Shiva need to distribute remaining Gems in rest of the 6 purses.

As,a new techie your task is to write a computer program to help Shiva in fulfilling his Guru's demand.


Input Format:
Input starts with the number of gems in a bag that follower have initially given by his master.
Line 1 N,where N is number of gems in one purse as conditioned by The Guru
Line 2 D, where D is number of gems demanded by The Guru from Shiva


Constraints:
0< N < =100
0 < D < =100
Output Format:
Print Distribution of gems in seven bags in ascending order,followed by the distribution of bags which will fulfill the demand of The Guru in ascending order
Line 1
For Valid Input,print
Distribution of gems in seven bags ordered in ascending,where quantity of gems in each bag is separated by space

For Invalid Input,print
Invalid Input
Line 2
For Valid Input,print
Distribution of bags in ascending order which will fulfill the demand of guru ,where quantity of gems in each bag is separated by space


Sample Test Cases:
SNo. Input Output Explanation
1
37
26
1 2 4 8 16 32 37
2 8 16
The Guru demands that one of the purses should contain 37 Gems. So Shiva packs them in 7 purses as mentioned in the output column.
The Guru now demands 26 Gems, Shiva knows that number of Gems in 3 purses add up to 26. So he gives purses containing 2, 8 and 16 to the Guru. Thus, he satisfies the condition that he does not have to shuffle his original packing.
2
J
25
Invalid Input J is not a number
3
33
150
Invalid Input 150 Gems out of 100 is not a valid demand
4
37
100
1 2 4 8 16 32 37
1 2 4 8 16 32 37
Guru demands 37 Gems be put in one bag and Guru demands a count of 100 Gems. Shiva hands over all 7 purses. Also note that any number between 1 and 100 is achievable using this combination. So Shiva has really satisfied his Guru.

Asked In Others bala (12 years ago)
Unsolved
Is this Puzzle helpful?   (10)   (13) Submit Your Solution Basics

(#M40019806) OTHERS QUESTION Keep an EYE Keep an eye puzzle Keep an eye puzzle

Problem:
A sequence is said to be progressive if it doesn’t decrease at any point in time.
For example 1 1 2 2 is a progressive sequence but 1 2 1 is not a progressive sequence. Let S be the sequence and be represented by T spaced integers Ki, now your task is to find out the first longest progressive sequence present in the given sequence (S).

Input Format:
First line will contain T, the length of the sequence and next line will contain T spaced integers Ki (where i = 0,1, …,T).

Line 1 T,where T is the length of the sequence

Line 2 Ki,where Ki is integer in sequence separated by space

Constraints:
1

Asked In Others bala (12 years ago)
Unsolved
Is this Puzzle helpful?   (17)   (5) Submit Your Solution Program

(#M40019426) OTHERS QUESTION Keep an EYE Keep an eye puzzle Keep an eye puzzle

If

1 = 2
2 = 2
3 = 5
4 = 4
5 = ?

(Use proper logic)

Asked In Others mohan lal garg (12 years ago)
Unsolved Read Solution (1)
Is this Puzzle helpful?   (2)   (0) Submit Your Solution Puzzles

(#M40002752) OTHERS QUESTION Four numbers Keep an EYE Keep an eye puzzle Keep an eye puzzle

Four whole numbers - a, b, c and d are
such that -
1. ( a + b + c + d ) is a perfect square
2. ( a + b ), ( a + c ), ( a + d ), ( b + c ) , ( b + d ) and ( c + d ) are also each a perfect square.
what are the smallest values for a, b, c and d ?

Asked In Others (13 years ago)
Unsolved Read Solution (1)
Is this Puzzle helpful?   (1)   (0) Submit Your Solution Arrays
Keep an EYE (0)
Solved Question (0) UnSolved Question (10)
Pages: 11
  • Login
  • Register

Resend

Sponsored Links

Advertisements

Challenger of the Day

no image
Dimple
India
Punjab
Time: 00:01:33
Points
19

Maths Quotes

The more you know, the less sure you are

Voltaire

my math textbook is my role model. no matter how many problems it has it never sucide's.

prabhpreet singh

Placed User Comments

M4Math helped me a lot.

Vipul Chavan 4 years ago

Thanks m4 maths for helping to get placed in several companies.
I must recommend this website for placement preparations.

yash mittal 5 years ago
  • 2532K+Registerd user
  • 1773K+Engineers
  • 759K+MBA Asprirant
  • 3K+Enginnering College
  • 250+Company Exam
  • 150K+Interview Questions
  • Site Links
  • Home
  • Result
  • Today's Puzzle
  • Discussion Board
  • Maths Tricks
  • Advertise with us
  • Contact Us
  • Useful Info
  • Maths Quotes
  • Previous Puzzles
  • Prize
  • Privacy Policy
  • Disclaimer and Copyright
  • Terms and Conditions
  • Sitemap
  • Placement papers
  • TCS Placement Paper
  • HCL Placement Paper
  • INFOSYS Placement Paper
  • IBM Placement Paper
  • SYNTEL Placement Paper
  • TECHNICAL Interview
  • HR Interview
All rights are reserved to @m4maths.com