xtulollipop

Description Here’s a cube whose size of its 3 dimensions are all infinite. Meanwhile, there’re 6 programs operating this cube:FILL(X,Y,Z): Fill some part of the cube with different values.memset(cube,

The name of one small but proud corporation consists of n lowercase English letters. The Corporation has decided to try rebranding — an active marketing strategy, that includes a set of measures to

Problem Description dxy has a collection of a series of books called “The Stories of SDOI”,There are n(n≤19) books in this series.Every book has a number from 1 to n.dxy puts these books in a book sta

问题描述DZY喜欢拆分数字。他想知道能否把n拆成恰好k个不重复的正整数之和。思考了一会儿之后他发现这个题太简单，于是他想要最大化这k个正整数的乘积。你能帮帮他吗？由于答案可能很大，请模10e9+7输出。输入描述第一行t，表示有t组数据。接下来ttt组数据。每组数据包含一行两个正整数n, ,k。1≤t≤50,2≤n,k≤109输出描述对于每个数据，如果不存在拆分方案，输出−1；否则输出最大乘积模10