申屠志刚

分类

ACM(1) C(128) C++(380) C.++(1) CTF(44) C语言(34) DP(4) JAVA(2) Python(1) 博弈论(1) 并查集(2) 最小生成树(1) 最短路(2) 未归档(435) 浙江理工大学2018年10月赛(2) 生成树(1) 申屠志刚的ACM之路(37) 申屠志刚的CTF之路(2) 矩阵(1) 线段树(1) 经典问题(1) 背包问题(1) 语法(1)

/ 注册

全部文章（共10篇）

A Mini Locomotive

http://poj.org/problem?id=1976 A train has a locomotive that pulls the train with its many passenger coaches. If the locomotive breaks down, there is...

C 01背包 DP

2018-11-23

0 0

最大报销额

http://acm.hdu.edu.cn/showproblem.php?pid=1864 现有一笔经费可以报销一定额度的发票。允许报销的发票类型包括买图书（A类）、文具（B类）、差旅（C类），要求每张发票的总额不得超过1000元，每张发票上，单项物品的价值不得超过600元。现请你编写程序...

C 01背包

2018-11-20

0 733

Big Event in HDU

http://acm.hdu.edu.cn/showproblem.php?pid=1171 Nowadays, we all know that Computer College is the biggest department in HDU. But, maybe you don't kno...

C 01背包

2018-11-20

0 0

Bone Collector

http://acm.hdu.edu.cn/showproblem.php?pid=2602 Many years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to...

C 01背包

2018-11-20

0 467

Proud Merchants

http://acm.hdu.edu.cn/showproblem.php?pid=3466 Recently, iSea went to an ancient country. For such a long time, it was the most wealthy and powerful ...

C 01背包

2018-11-21

0 543

Round Subset

https://codeforces.com/problemset/problem/837/D Let's call the roundness of the number the number of zeros to which it ends. You have an array of n ...

C 01背包

2018-11-28

0 616

Fire

https://codeforces.com/problemset/problem/864/E Polycarp is in really serious trouble — his house is on fire! It's time to save the most valuable ite...

C 01背包

2018-11-28

0 592

The Values You Can Make

https://codeforces.com/problemset/problem/687/C Pari wants to buy an expensive chocolate from Arya. She has n coins, the value of the i-th coin is ci...

C DP 01背包多维背包 DFS

2018-11-28

0 474

Bottles

https://codeforces.com/problemset/problem/730/J Nick has n bottles of soda left after his birthday. Each bottle is described by two values: remaining...

C 01背包 DP

2018-11-29

0 0

Dream City

http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3211 JAVAMAN is visiting Dream City and he sees a yard of gold coin trees. There are ntr...

C 01背包 DP

2018-11-30

0 381