sgu 193
2011-10-01 12:00
197 查看
import java.io.BufferedInputStream; import java.math.BigInteger; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner cin = new Scanner(new BufferedInputStream(System.in)); BigInteger num, two = BigInteger.valueOf(2), one = BigInteger.ONE; while (cin.hasNext()) { num = cin.nextBigInteger(); if (num.mod(two).compareTo(one) == 0) { num = num.subtract(one).divide(two); } else { num = num.divide(two).subtract(one); if (num.mod(two).compareTo(one) != 0) { num = num.subtract(one); } } System.out.println(num); } } }
相关文章推荐
- sgu 193 Chinese Girls' Amusement
- SGU193 Chinese Girls' Amusement(数论,约瑟夫环问题)
- sgu 193
- sgu 193 分类: sgu 2015-03-11 18:38 45人阅读 评论(0) 收藏
- sgu 193 Chinese Girls' Amusement
- sgu 193
- SGU,无语……
- Windows CE: LoadLibrary Fails with Error Code 193
- SGU 326 Perspective
- 完全背包记录路径——sgu 116. Index of super-prime
- sgu 345-Revolution
- sgu 231 打表+二分 水过~~
- SGU 107 987654321 problem
- 启动服务出现错误193: 0xc1的解决方法
- SGU 102 虽然代码比较多,不过还是挺高效的~
- SGU 115 Calendar
- SGU 131 状态压缩dp
- SGU104 Little Shop of Flowers (DP)
- 解题报告 sgu 101
- UVa 193 - Graph Coloring