小坏蛋_千千

I was caught in a heavy rain!

2017 ICPC 西安/青岛 站

满月的天空,皎洁的光芒,冷冷清清 时有的路人,走过……

2017-11-22 16:05:20

阅读数:226

评论数:0

计蒜客 ACM-ICPC 2017 Warmup Contest 12

因为等了很久计蒜客上都没有更新,所以目前找不到题目,只能凭借记忆写写咯~全场不在状态抱着不仔细检查直接交让评测机来judge心情的我,最后居然取得了 rk2 ,一定是高手都没有来参加的缘故。 A. Abandoned Animal题意给定一些商品可以在第几家店买的,然后输入购买商品的顺序,问购买序...

2017-11-19 12:42:46

阅读数:264

评论数:0

Codeforces 892 B. Wrath (递推)

Description Hands that shed innocent blood! There are n guilty people in a line, the i-th of them holds a claw with length Li. The bell rings ...

2017-11-18 11:45:18

阅读数:597

评论数:0

Codeforces 892 C. Pride (枚举)

Description You have an array a with length n, you can perform operations. Each operation is like this: choose two adjacent elements from a, say x ...

2017-11-18 11:17:52

阅读数:538

评论数:0

Codeforces 892 D. Gluttony (思维)

Description You are given an array a with n distinct integers. Construct an array b by permuting a such that for every non-empty subset of indices ...

2017-11-18 10:17:53

阅读数:399

评论数:0

Codeforces 890 D. Boxes And Balls (哈夫曼)

Description Ivan has n different boxes. The first of them contains some balls of n different colors. Ivan wants to play a strange game. He wan...

2017-11-17 20:06:30

阅读数:194

评论数:0

Codeforces 890 D. Restoration of string (技巧)

Description A substring of some string is called the most frequent, if the number of its occurrences is not less than number of occurrences of any ...

2017-11-17 15:26:38

阅读数:273

评论数:0

Codeforces 890 C. Petya and Catacombs (贪心)

Description A very brave explorer Petya once decided to explore Paris catacombs. Since Petya is not really experienced, his exploration is just wal...

2017-11-17 12:07:04

阅读数:460

评论数:0

51nod 1350 斐波那契表示 (数学)

Description 每一个正整数都可以表示为若干个斐波那契数的和,一个整数可能存在多种不同的表示方法,例如:14 = 13 + 1 = 8 + 5 + 1,其中13 + 1是最短的表示(只用了2个斐波那契数)。定义F(n) = n的最短表示中的数字个数,F(14) = 2,F(100) =...

2017-11-11 13:41:41

阅读数:198

评论数:0

FZU 2214 Knapsack problem (超大容量背包)

Description Given a set of n items, each with a weight w[i] and a value v[i], determine a way to choose the items into a knapsack so that the total...

2017-11-03 20:19:28

阅读数:160

评论数:0

51nod 1829 函数 (斯特林数)

Description 想知道f:A->B这个函数(其中|A|=n, |B|=m)的所有映射关系要使B的每个元素都要被A的一个元素覆盖到。 数字可能很大你只要输出方案数模1,000,000,007即可。  Input 一共一行两个数,n和m。(1<=n,m<=1...

2017-11-02 21:54:13

阅读数:353

评论数:0

51nod 1836 战忽局的手段 (期望)

Description 众所周知,有一个神秘的组织——战忽局,在暗中保护着我们。在局中任职的官员都有着极强的忽悠技巧,不只能用预言,还能用往事忽悠人。如今某外星间谍已经获得了战忽局曾经参与的n次事件的资料,局座发现了这件事,于是决定再次用忽悠来保证战忽局的安全。局座将发表m次演讲,每一天他都会...

2017-11-02 19:05:23

阅读数:146

评论数:0

ZOJ 3987 Numbers (贪心)

Description DreamGrid has a nonnegative integer nn. He would like to divide nn into mm nonnegative integers a1,a2,…,ama_1, a_2, \dots, a_m and mini...

2017-11-02 14:54:02

阅读数:466

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭