I was little late for the Div 2 contest today. This would have been my first div 2 contest. but i missed. Started practising. Came across 9C hexadecimal's number problem. It was a simple problem. It asked for counting the numbers within <= given number which are a vaild binay number. I arrived by taking the binary numbers from 1 and comparing representation in decimal with the given number.
12/13/2013
5/27/2013
UVA 10954
This problem uva 10954 can be easily solved using Priority queues in java. This is the first time i wrote code using a priority queue. It automatically sorts the elements added.
Here is my code
Here is my code
Subscribe to:
Posts
(
Atom
)