2013 ACM/ICPC Asia Regional Changchun Online----hdu4762 Cut the Cake
来源:互联网 发布:网络改变了我的生活 编辑:程序博客网 时间:2024/06/01 22:32
简单的求概率,
公式是 n/m^(n-1)
重点是要用大数啊。。。
人生中第一个JAVA程序
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));}}}
- 2013 ACM/ICPC Asia Regional Changchun Online----hdu4762 Cut the Cake
- hdu 4762 Cut the Cake 概率(2013 ACM/ICPC Asia Regional Changchun Online 1004)
- 2013 ACM/ICPC Asia Regional Changchun Online
- 2013 ACM/ICPC Asia Regional Changchun Online
- 2013 ACM/ICPC Asia Regional Changchun Online
- 2012 ACM/ICPC Asia Regional Changchun Online
- 2015 ACM/ICPC Asia Regional Changchun Online
- 2015 ACM/ICPC Asia Regional Changchun Online
- 2013 ACM/ICPC Asia Regional Changchun Online Stone
- 2013 ACM/ICPC Asia Regional Changchun Online hdu Theme Section
- 2015 ACM/ICPC Asia Regional Changchun Online 1012 hdu5448 Marisa’s Cake
- The 2013 ACM/ICPC Asia Changchun Regional Contest题解
- 2012 ACM/ICPC Asia Regional Changchun Online-1001
- 2012 ACM/ICPC Asia Regional Changchun Online-1010
- 2012 ACM/ICPC Asia Regional Changchun Online-1006
- 2012 ACM/ICPC Asia Regional Changchun Online 解题报告
- 2012 ACM/ICPC Asia Regional Changchun Online-1002
- 2012 ACM/ICPC Asia Regional Changchun Online-1011(hdu4277)
- Visual Studio 12 技巧
- jstl fmt用法
- JAVA TIMER用法学习
- 数据库中的锁机制
- 《#诗盗#~山坡羊河蟹》
- 2013 ACM/ICPC Asia Regional Changchun Online----hdu4762 Cut the Cake
- 我开博客了。
- android_Activity/Intent/Process/Service
- JDom解析和生成XML文档
- 利用正则表达式来完成时间日期
- 《#诗盗#~撸妹十分二十秒》
- ios ASIFormDataRequest上传图片到php服务器
- To do: Experiment
- eclipse安装SVN插件