蓝桥杯-2018-乘积尾零-c++/java/python3

题目描述

本题为填空题,只需要算出结果后,在代码中使用输出语句将所填结果输出即可。

如下的 101010 行数据,每行有 101010 个整数,请你求出它们的乘积的末尾有多少个零?

5650 4542 3554 473 946 4114 3871 9073 90 4329 
2758 7949 6113 5659 5245 7432 3051 4434 6704 3594 
9937 1173 6866 3397 4759 7557 3070 2287 1453 9899 
1486 5722 3135 1170 4014 5510 5120 729 2880 9019 
2049 698 4582 4346 4427 646 9742 7340 1230 7683 
5693 7015 6887 7381 4172 4341 2909 2027 7355 5649 
6701 6645 1671 5978 2704 9926 295 3125 3878 6785 
2066 4247 4800 1578 6652 4616 1113 6205 3264 2915 
3966 5291 2904 1285 2193 1428 2265 8730 9436 7074 
689 5510 8243 6114 337 4096 8199 7313 3685 211 

运行限制

  • 最大运行时间:1s
  • 最大运行内存: 128M

解法一:python 3 (python最简单)
 

import os
import sys

# 请在此输入您的代码
num = (5650,4542,3554,473,946,4114,3871,9073,90,4329,
2758,7949,6113,5659,5245,7432,3051,4434,6704,3594,
9937,1173,6866,3397,4759,7557,3070,2287,1453,9899,
1486,5722,3135,1170,4014,5510,5120,729,2880,9019,
2049,698,4582,4346,4427,646,9742,7340,1230,7683,
5693,7015,6887,7381,4172,4341,2909,2027,7355,5649,
6701,6645,1671,5978,2704,9926,295,3125,3878,6785,
2066,4247,4800,1578,6652,4616,1113,6205,3264,2915,
3966,5291,2904,1285,2193,1428,2265,8730,9436,7074,
689,5510,8243,6114,337,4096,8199,7313,3685,211)

s = 1
z = 0

for i in num:
  s *= i    # 乘一个数
  while s % 10 == 0:    # 末尾是0
    s /= 10    # 除以10,把末尾0去掉
    z += 1
print(z)

解法二:c++
思路:把每个数因式分解,拆成质数乘积的形式,质因子中,每一对2和5都能让末尾多一个0,其他知名因子则不会让末尾有0产生。所以只要记数所有数质因子中2的总和和5的总和,较少的一个就等于尾0的个数。
 

#include <iostream>
using namespace std;
int main()
{
   int count2=0,count5=0;
    int num;
    for(int i=0;i<100;i++){
        cin>>num;
        while(num%5==0){
            count5++;
            num/=5;
        }
        while(num%2==0){
            count2++;
            num/=2;
        }
    }
    int ans=count2<count5?count2:count5;
    cout<<ans;
  return 0;
}

解法三:Java(从别人的博文中学习到的)
思路:使用大数类累乘 ,然后数一下几个零

import java.math.BigInteger;
 
public class 乘积尾零 {
	public static void main(String[] args) {
		int[] a={5650,4542,3554,473,946,4114,3871,9073,90,4329,
				2758,7949,6113,5659,5245,7432,3051,4434,6704,3594,
				9937,1173,6866,3397,4759,7557,3070,2287,1453,9899,
				1486,5722,3135,1170,4014,5510,5120,729,2880,9019,
				2049,698,4582,4346,4427,646,9742,7340,1230,7683,
				5693,7015,6887,7381,4172,4341,2909,2027,7355,5649,
				6701,6645,1671,5978,2704,9926,295,3125,3878,6785,
				2066,4247,4800,1578,6652,4616,1113,6205,3264,2915,
				3966,5291,2904,1285,2193,1428,2265,8730,9436,7074,
				689,5510,8243,6114,337,4096,8199,7313,3685,211};
		//用大数类累乘,数一下尾数几个零
		BigInteger sum = BigInteger.ONE;
		for(int i=0; i<a.length; i++) 
			sum = sum.multiply(BigInteger.valueOf(a[i]));
		System.out.println(sum);
	}
}

结果:

112142221918653666702449201125076321480831896827506427440731023870278025729017605653056978504625081950967446934475613782859722081655293509714201067451491601144000940085173776751705443818861349991600968912829674368417898694508188364854988187881792613763161458365648071883922054736261940944120399031297726871056069331318210560000000000000000000000000000000

  • 2
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值