hdu 5187 zhx's contest ( 数学+java)
来源:互联网 发布:中地集团java怎么样 编辑:程序博客网 时间:2024/05/16 13:03
zhx's contest
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 286 Accepted Submission(s): 102
Problem Description
As one of the most powerful brushes, zhx is required to give his juniorsn problems.
zhx thinks theith problem's difficulty is i . He wants to arrange these problems in a beautiful way.
zhx defines a sequence{ai} beautiful if there is an i that matches two rules below:
1:a1..ai are monotone decreasing or monotone increasing.
2:ai..an are monotone decreasing or monotone increasing.
He wants you to tell him that how many permutations of problems are there if the sequence of the problems' difficulty is beautiful.
zhx knows that the answer may be very huge, and you only need to tell him the answer modulep .
zhx thinks the
zhx defines a sequence
1:
2:
He wants you to tell him that how many permutations of problems are there if the sequence of the problems' difficulty is beautiful.
zhx knows that the answer may be very huge, and you only need to tell him the answer module
Input
Multiply test cases(less than 1000 ). Seek EOF as the end of the file.
For each case, there are two integersn and p separated by a space in a line. (1≤n,p≤1018 )
For each case, there are two integers
Output
For each test case, output a single line indicating the answer.
Sample Input
2 2333 5
Sample Output
21HintIn the first case, both sequence {1, 2} and {2, 1} are legal.In the second case, sequence {1, 2, 3}, {1, 3, 2}, {2, 1, 3}, {2, 3, 1}, {3, 1, 2}, {3, 2, 1} are legal, so the answer is 6 mod 5 = 1
题目大意:求取符合条件数列的个数
题目解析:组合数学题,枚举最大的位置,可以得到C(n-1,0) +........C(n-1,n-1) ,符合二项公式,枚举最小项位置时同理,然后当最大项在两侧,和最小项在两侧重复了两次,减去
懒得写C++大数了,用java过得,C++大数取模就是利用好同余模定理就好了,水题1A
题目解析:组合数学题,枚举最大的位置,可以得到C(n-1,0) +........C(n-1,n-1) ,符合二项公式,枚举最小项位置时同理,然后当最大项在两侧,和最小项在两侧重复了两次,减去
懒得写C++大数了,用java过得,C++大数取模就是利用好同余模定理就好了,水题1A
import java.math.BigInteger;import java.util.Scanner;public class Main{ public static BigInteger pow ( BigInteger n , BigInteger p ) { if ( n.equals( BigInteger.ZERO) ) return BigInteger.ONE; BigInteger temp = pow ( n.divide(BigInteger.valueOf(2) ) , p ); if ( n.mod(BigInteger.valueOf(2) ).equals(BigInteger.ZERO ) ) return temp.multiply( temp ).mod(p); else return temp.multiply(temp).multiply(BigInteger.valueOf(2) ).mod(p); }public static void main ( String[] args ){BigInteger n,p;Scanner cin = new Scanner (System.in );while ( cin.hasNext() ){n = cin.nextBigInteger ( );p = cin.nextBigInteger ( );BigInteger ans = pow(n,p) .subtract(BigInteger.valueOf(2)).add(p).mod(p);System.out.println ( ans );}}}
0 0
- hdu 5187 zhx's contest ( 数学+java)
- Hdu 5187 zhx's contest(数学)
- HDU 5187 zhx's contest(组合数学)
- HDU 5187 zhx's contest
- HDU - 5187 zhx's contest
- hdu 5187-zhx's contest
- HDU - 5187 - zhx's contest
- zhx's contest HDU
- HDU 5187 zhx's contest(快速乘法)
- hdu 5186 zhx's submissions 5187 zhx's contest快速幂小优化
- HDU 5187 zhx's contest(防爆__int64 )
- zhx's contest (hdu 5187 快速幂+快速乘法)
- HDU - 5187 - zhx's contest (快速幂+快速乘)
- HDU 5187 zhx's contest(快速幂+快速乘法)
- HDU 5187-zhx's contest(快速乘法+快速幂取模)
- hdu 5187 zhx's contest(快速幂矩阵6)
- hdu 5187 zhx's contest 快速幂,快速乘
- Hdu 5187 zhx's contest【思维+快速幂+快速乘】
- ssh完成对oracle数据库的增删查改
- java内存溢出问题
- Spark写入数据到MySQL
- 3.14会
- MATLAB神经网络编程(一)——感知器
- hdu 5187 zhx's contest ( 数学+java)
- Android屏幕适配
- 快速乘法
- TortoiseSVN客户端重新设置用户名和密码
- HDU 2444 The Accomodation of Students (二分图判定、求最大匹配)
- vim学习笔记
- 视频术语手记
- ZigBee无线应变采集装置
- 爬楼梯