Problem hidden
This problem was hidden by Editorial Board member probably because it has incorrect language version or invalid test data, or description of the problem is not clear.
Problem hidden on 2010-10-27 21:54:03 by [Trichromatic] XilinX

LOGTWO - PowerOf2

Given a number

Input

First line number of test cases and followed by test cases

Output

the log of the number or "NO" If not power of 2

Note: output range will be <=1000

Example

  Input:
2
4
1000
  Output:
  2
NO
  

Added by:el moatasem
Date:2010-10-26
Time limit:0.200s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:C CSHARP C++ 4.3.2 CPP CPP14 CLPS LISP sbcl LISP clisp D ERL FORTRAN HASK JAVA LUA PAS-GPC PAS-FPC PERL PERL6 PHP PIKE PRLG-swi PYTHON RUBY SCALA SCM guile SCM qobi ST SQLITE TCL WHITESPACE

hide comments
2010-10-30 08:06:17 Piotr KÄ…kol
Why I can still submit a solution to this task as it is hidden? I can't see it in tutorial category BUT it has "SPOJ Problem Set (tutorial)" while it should be "SPOJ Problem Set ()" as it is hidden.
2010-10-28 03:33:56 RYAN 102
Lol...this problem absolutely hard. The hardest among all.
2010-10-27 12:28:35 Muhammad Andri Ihsannudin
I've got a TLE for this.

*no pic hoax gan*
2010-10-27 12:27:23 Prahesa Kusuma Setia
why i got a WA for this? *tapi boong xD*
2010-10-27 12:26:41 pankaj
without source code accepted.
2010-10-27 12:22:33 Husein Alhamid
problem paling menantang
2010-10-27 09:13:42 hendrik
Yeah, submission without code get AC. Cool. Must be fixed and rejudged afterwards. I will discard my submission. Apart from that I think it is rather tutorial.

Last edit: 2010-10-27 10:56:07
2010-10-27 08:38:15 Lukmanul Hakim
Wah, ini mah numpang naikin poin doang XD
2010-10-27 08:06:22 dementor
just submit in python = AC
2010-10-27 06:17:49 sanosukesagara
ckckckck
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.