ZOJ-2417
2013-12-23 20:58
295 查看
import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); while (n != 0) { int i = 0; while (n % 2 == 0) { i++; n /= 2; } System.out.println((int) Math.pow(2, i)); n = sc.nextInt(); } } }
相关文章推荐
- ZOJ Problem Set–2417 Lowest Bit
- zoj 2417 Lowest Bit
- zoj 2417 Lowest Bit
- zoj2417
- Discrete Logging hunnu10590 pku2417 fzu 1352 hit 1928 zoj 1898
- zoj2417
- zoj2417
- zoj 2417 Lowest Bit
- ZOJ 2417解题报告(炫酷)
- ZOJ 2417
- ZOJ 2417
- ZOJ 2417 Lowest Bit
- ZOJ 2417-Lowest Bit
- zoj 2417 Lowest Bit
- zoj 2417.Lowest Bit
- zoj 2417 Lowest Bit(简单的模拟)
- zoj 2417 Lowest Bit
- zoj 2417 Lowest Bit
- ZOJ 2417 Lowest Bit
- zoj 1657 Goldbach's Conjecture