“今日头条杯”首届湖北省大学程序设计竞赛（网络同步赛）H. GSS and Simple Math Problem

本文主要是介绍“今日头条杯”首届湖北省大学程序设计竞赛（网络同步赛）H. GSS and Simple Math Problem，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

题目描述 

Given n positive integers  , your task is to calculate the product of these integers, The answer is less than 

输入描述:

The first line of input is an integer n, the i-th of the following n lines contains the integer

输出描述:

Output one line with the answer 

示例1

输入

5
11
12
13
14
15

输出

360360

java代码：

import java.math.BigInteger;import java.util.*;import java.io.*;public class Main {public static void main(String[] args) {Scanner cin = new Scanner (System.in);int t = cin.nextInt();BigInteger ans = cin.nextBigInteger();for(;t>1;t--){BigInteger a = cin.nextBigInteger();ans = ans.multiply(a);}System.out.println(ans);;}}

n = int(input())res = 1
for i in range(n):res *= int(input())print(res)

这篇关于“今日头条杯”首届湖北省大学程序设计竞赛（网络同步赛）H. GSS and Simple Math Problem的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！