2013 ACM/ICPC Asia Regional Changchun Online----hdu4762 Cut the Cake
2013-09-28 17:15
363 查看
简单的求概率,
公式是 n/m^(n-1)
重点是要用大数啊。。。
人生中第一个J***A程序
公式是 n/m^(n-1)
重点是要用大数啊。。。
人生中第一个J***A程序
import java.io.*; import java.util.Scanner; import java.math.BigInteger; public class Main { public static void main(String[] args){ Scanner a=new Scanner(System.in); int t=a.nextInt(); while(t!=0){ t--; BigInteger m=a.nextBigInteger(10); int n=a.nextInt(10); BigInteger ans=m.pow(n-1); BigInteger nn=BigInteger.valueOf(n); BigInteger tmp=ans.gcd(nn); System.out.println(""+nn.divide(tmp)+"/"+ans.divide(tmp)); } } }
相关文章推荐
- hdu 4762 Cut the Cake 概率(2013 ACM/ICPC Asia Regional Changchun Online 1004)
- HDU 5443 The Water Problem 2015 ACM/ICPC Asia Regional Changchun Online
- The 37th ACM/ICPC Asia Regional ChangChun Site Online Contest - K USACO ORZ
- 2013 ACM/ICPC Asia Regional Changchun Online
- hdu4759 Poker Shuffle 2013 ACM/ICPC Asia Regional Changchun Online
- 2013 ACM/ICPC Asia Regional Changchun Online Problem J & hdu4768 Flyer(二分)
- hdu 5443 The Water Problem 2015 ACM/ICPC Asia Regional Changchun Online
- 2013 ACM/ICPC Asia Regional Changchun Online (2013网络赛)
- hdu 4276 The Ghost Blows Light(2012 ACM/ICPC Asia Regional Changchun Online )
- HDU 5443 The Water Problem(水题 找区间最大值)——2015 ACM/ICPC Asia Regional Changchun Online
- 2013 ACM/ICPC Asia Regional Changchun Online
- hdu 4768 Flyer 二分(2013 ACM/ICPC Asia Regional Changchun Online 1010)
- 2015 ACM/ICPC Asia Regional Changchun Online
- HDU4273 Rescue(2012 ACM/ICPC Asia Regional Changchun Online)
- hdu 4272 LianLianKan ( dp + 状态压缩 2012 ACM/ICPC Asia Regional Changchun Online)
- hdu5444 (2015 ACM/ICPC Asia Regional Changchun Online)
- 2015 ACM/ICPC Asia Regional Changchun Online
- HDU 5444 Elven Postman 2015 ACM/ICPC Asia Regional Changchun Online
- 2012 ACM/ICPC Asia Regional Changchun Online 解题报告
- HDU 5441 Travel(2015 ACM/ICPC Asia Regional Changchun Online)