蓝桥杯数的潜能

石夏藤

已于 2022-02-12 20:08:01 修改

阅读量5.2k

点赞数 2

文章标签：蓝桥杯算法职场和发展 java

于 2021-12-18 23:35:24 首次发布

本文链接：https://blog.csdn.net/m0_53913012/article/details/122018658

版权

蓝桥杯数的潜能

先来看均值不等式：

$gif.latex?egin{align} &H_n=rac{n}{sum_{i=1}^{n}rac{1}{x_i}}=rac{n}{rac{1}{x_1}+rac{1}{x_2}+dots +rac{1}{x_n}}\ &G_n=sqrt[n]{prod_{i=1}^{n}x_i}=sqrt[n]{x_1x_2dots x_n}\ &A_n=rac{sum_{i=1}^{n}x_i}{n}=rac{x_1+x_2+dots+x_n}{n}\ &Q_n=sqrt{rac{sum_{i=1}^{n}x_i^2}{n}}=sqrt{rac{x_1^2+x_2^2+dots +x_n^2}{n}} end{align}$

从上到下且依次从小到大为(1)调和平均数、(2)几何平均数、(3)算数平均数、(4)平方平均数
由均值不等式(2)和(3)
可知： $gif.latex?egin{align} x_1x_2 cdotcdotcdot x_nle (rac{x_1+x_2+dots+x_n}{n})^n end{align}$

对不等式右边求导，可得：每一份x/n为e.

由于题目要求是整数，所以只要每项最接近e且乘积最大即可。

看代码：

import java.math.BigInteger;import java.util.Scanner;public class NumsPotency {public static void main(String[] args) {Scanner in = new Scanner(System.in);long NUMS = in.nextLong();long M =(long)(NUMS/3);//计算有多少项long flag = (long)(NUMS%3);//余多少，后面补项if(NUMS==1) {System.out.println(1);System.exit(0);}BigInteger e = BigInteger.valueOf(M);BigInteger e_1 = BigInteger.valueOf(M-1); BigInteger three = new BigInteger("3");//构造大整数类型BigInteger four = new BigInteger("4");BigInteger two = new BigInteger("2");BigInteger mod = new BigInteger("5218");BigInteger end1 = three.modPow(e, mod);//e次方后去模%modBigInteger end2 = three.modPow(e_1, mod);if(flag==2) {//补项操作System.out.println(end1.multiply(two).mod(mod));}else if(flag==1) {System.out.println(end2.multiply(four).mod(mod));}else {System.out.println(end1);}in.close();}}