![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
模拟
文章平均质量分 74
xtulollipop
这个作者很懒,什么都没留下…
展开
-
Cube Simulation zoj3429 模拟
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,原创 2015-07-26 15:51:49 · 575 阅读 · 0 评论 -
codeforces round#237,div2,B,Rebranding(模拟)
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原创 2015-10-26 14:42:06 · 496 阅读 · 0 评论 -
hdu5500 Reorder the Books (枚举+模拟)
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原创 2015-10-12 23:18:25 · 587 阅读 · 0 评论 -
hdu5646DZY Loves Partition
问题描述DZY喜欢拆分数字。他想知道能否把n拆成恰好k个不重复的正整数之和。思考了一会儿之后他发现这个题太简单,于是他想要最大化这k个正整数的乘积。你能帮帮他吗?由于答案可能很大,请模10e9+7输出。输入描述第一行t,表示有t组数据。接下来ttt组数据。每组数据包含一行两个正整数n, ,k。1≤t≤50,2≤n,k≤109输出描述对于每个数据,如果不存在拆分方案,输出−1;否则输出最大乘积模10原创 2016-03-22 15:36:37 · 505 阅读 · 0 评论