## DMOPC '16 Contest 4 P1 - Fast Exponents

View as PDF

Points: 5 (partial)
Time limit: 2.0s
Memory limit: 64M

Author:
Problem types
Allowed languages
Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, CommonLisp, D, Dart, F#, Forth, Fortran, Go, Groovy, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, Nim, ObjC, OCaml, Octave, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

Molly's teacher assigned her very tedious homework:

Given an integer , find out if it's a power of two or not.

Molly asks Andrew, but he would much rather play Geometry Dash, so he decides to enslave ask you to do it instead!

#### Input Specification

The first line will contain a single integer, .
Lines will each contain an integer, .

#### Output Specification

For each of the integers, output T if it is a power of , otherwise output F.

#### Sample Input

2
1
3

#### Sample Output

T
F

• commented on Dec. 21, 2020, 3:09 p.m.

tfw when your brute force solution passes

• commented on Dec. 22, 2020, 12:33 p.m.

It's not really brute force/brute force is intended, as your code runs in , which would pass with the constraints.

• commented on Aug. 1, 2020, 7:23 p.m.

why am i getting WA for case 11?

• commented on Aug. 1, 2020, 10:40 p.m.

This comment is hidden due to too much negative feedback. Click here to view it.

• commented on Dec. 21, 2020, 1:15 p.m.

how can you be so contraversial but so true

• commented on June 28, 2018, 8:24 a.m.

PASSA EM nlogn ?

• commented on Dec. 13, 2017, 5:45 p.m.

pls why i get WA in the case 3

• commented on Nov. 24, 2017, 5:02 p.m.

This comment is hidden due to too much negative feedback. Click here to view it.

• commented on Nov. 25, 2017, 9:03 p.m. edited

First, you didn't use the boolean in your loop. Second, use scanf instead of cin. Finally, use long instead of int.

• commented on Feb. 16, 2017, 10:25 a.m.

I submitted the exact same code twice and i got TLE (case 24) on one and AC on the other. What's up with that?

• commented on Feb. 16, 2017, 10:35 a.m. edited

Please read this comment. In a nutshell, the judges don't produce the exact same result each time. As your program is really close to the timelimit, this kind of thing can happen.

• commented on Feb. 14, 2017, 7:49 p.m.

I implemented an algorithm using Python, but it did not pass. I implemented the same algorithm using C++, and it worked.

• commented on Feb. 15, 2017, 3:10 p.m.

This problem has a lot of input, and input() is too slow; your code passes with sys.stdin.readline().