这是一道数学计算题，要求找出数组中使得乘积最小的三元组(i, j, k)的数量，其中i < j < k。题目提供了一个包含n个正整数的数组，需要计算满足条件的组合数。例如，当数组为[1, 1, 2, 2, 3, 3]时，最小乘积三元组为[1, 1, 2]，有2种不同的选择方式。"
106313685,9317867,NLP实战：tensorflow字符级CNN进行THUCNews文本分类,"['自然语言处理', '深度学习', '模型搭建', '文本分类', 'tensorflow']
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
After returning from the army Makes received a gift — an array a consisting of n positive integer numbers. He hadn't been solving problems for a long time, so he became interested to answer a particular question: how many triples of indices (i, j, k) (i < j < k), such that ai·a
最低0.47元/天 解锁文章
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
