Regionals 2015 Asia - Daejeon acmliveoj7233

点击打开链接

import java.io.BufferedInputStream;
import java.io.BufferedOutputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.Scanner;public class Main {public static void main(String[] args) {new H().run();}
}class H {void run() {Scanner cin = new Scanner(new BufferedInputStream(System.in));PrintWriter cout = new PrintWriter(new BufferedOutputStream(System.out));int T = cin.nextInt() ;while(T-- > 0){int t = cin.nextInt()  ;for(int i = 0 ; i <= t ; i++)  c[i] = cin.nextBigInteger() ;for(int d = t+1 ; d >= 1 ; d--){BigInteger rightSum = BigInteger.ZERO  ;for(int it_right = t ; it_right >= d-1 ; it_right--){rightSum = rightSum.add(  c[it_right].multiply(C[it_right][d-1]) ) ;}FenShu rightFenshu = new FenShu(rightSum , BigInteger.ONE) ;for(int it_left = t+1 ; it_left >= d+1 ; it_left--){FenShu nowFenshu = new FenShu(a[it_left].multiply(C[it_left][d-1]) , b[it_left] )  ;rightFenshu = rightFenshu.sub(nowFenshu) ;}FenShu abD = rightFenshu.mult(new FenShu(BigInteger.ONE  , C[d][d-1] ) ) ;a[d] = abD.fenzi ;b[d] = abD.fenmu ;}a[0] = c[0] ;BigInteger sum = BigInteger.ZERO ;for(int i = 0 ; i <= t+1 ; i++) sum = sum.add(a[i].abs()) ;cout.println(sum) ;}cout.flush();}final int N = 55;BigInteger[] a = new BigInteger[N] ;BigInteger[] b = new BigInteger[N] ;BigInteger[] c = new BigInteger[N] ;BigInteger[][] C = new BigInteger[N][N];{C[0][0] = BigInteger.ONE;for (int i = 1; i < N; i++) {C[i][0] = C[i][i] = BigInteger.ONE;for (int j = 1; j < i; j++)C[i][j] = C[i - 1][j - 1].add( C[i - 1][j] );}}}class FenShu {BigInteger fenzi;BigInteger fenmu;FenShu(BigInteger zi, BigInteger mu) {BigInteger gcd = zi.gcd(mu) ;fenzi = zi.divide(gcd);fenmu = mu.divide(gcd);}FenShu sub(FenShu other) {BigInteger mu = fenmu.multiply(other.fenmu) ;BigInteger zi = (fenzi.multiply(other.fenmu)).subtract( fenmu.multiply(other.fenzi) ) ;return new FenShu(zi, mu);}FenShu mult(FenShu other) {BigInteger mu = fenmu.multiply(other.fenmu);BigInteger zi = fenzi.multiply(other.fenzi);return new FenShu(zi, mu);}}

Regionals 2015 Asia - Daejeon acmliveoj7233 - Polynomial相关推荐

Regionals 2013 Asia - Daejeon （部分题目题解）
题目链接:Regionals 2013 Asia - Daejeon 6500 Boxes 题意:将箱子(矩阵的1)全移动到矩阵的底部需要几步思路:按列从下到上统计.(n,m)的矩阵,移动一个箱子( ...
UVALive Problem 7456 Least Crucial Node——Regionals 2015 :: Asia - Taipei
此文章可以使用目录功能哟↑(点击上方[+]) UVALive Problem 7456 Least Crucial Node Accept: 0 Submit: 0 Time Limit: 3 ...
Regionals 2014 Asia - Daejeon
D.求一个n点无向图的最大点集,满足每个点的度数均大于k 正难则反删点法.维护一个set,按照度数从小到大排列,每次取出度数最小的点,看是否满足大于k,若满足则点数最大为当前set中点数:否则删除该点 ...
2017-2018 ACM-ICPC, Asia Daejeon Regional Contest
2017-2018 ACM-ICPC, Asia Daejeon Regional Contest 题号题目难度知识点 A Broadcast Stations B Connect3 C Gam ...
2017-2018 ACM-ICPC, Asia Daejeon Regional Contest (大部分题解)
2017-2018 ACM-ICPC, Asia Daejeon Regional Contest ECFINAL PK赛. C 签到题. DAG上的dp. D 签到题. 根据数据范围可知暴力即可. ...
Regionals 2014 Asia - Dhaka H 暴力
题意:将区间分成四分,使得每个区间内的个数比较平均. 解题思路:暴力解题代码: 1 // File Name: h.cpp 2 // Author: darkdream 3 // Created T ...
[Regionals 2012 :: Asia - Tokyo ]
链接: https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&category=56 ...
2017-2018 ACM-ICPC, Asia Daejeon Regional Contest：Gym 101667C
题目链接:https://codeforces.com/gym/101667/attachments 题意:现在有一个无向图,一个人要可以随便找一个起点然后选择一条路径去旅游,要求路径从起点开始之后每 ...
2017-2018 ACM-ICPC, Asia Daejeon Regional Contest 补题
题目链接 http://codeforces.com/gym/101667 参考题解 B - Connect3 简要题意: 给定 4×44×44×4 的棋盘玩 Connect3Connect 3Con ...

Regionals 2015 Asia - Daejeon acmliveoj7233 - Polynomial

Regionals 2015 Asia - Daejeon acmliveoj7233 - Polynomial相关推荐

最新文章

热门文章