OI-ICPC
Austin_Griffin
这个作者很懒,什么都没留下…
展开
-
Luogu P1060 开心的金明 [NOIP 2006 普及组]
#include <algorithm>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;int f[30005];int main () { int n,m; memset (f,-1,sizeof (f)); f[0]=...原创 2019-07-07 23:28:49 · 266 阅读 · 0 评论 -
Luogu P1164 小A点菜
#include <algorithm>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;int f[10005];int main () { int n,m; f[0]=1; scanf ("%d%d",&n,&...原创 2019-07-07 23:50:50 · 141 阅读 · 0 评论 -
Luogu P1064 金明的预算方案 [NOIP 2006 提高组]
#include <algorithm>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;int f[65],g[65][5],h[65][5],v[65],p[65];int ans[32005];int main...原创 2019-07-08 11:48:11 · 167 阅读 · 0 评论 -
Luogu P1048 采药 [NOIP 2006 普及组]
#include <algorithm>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;int f[1005];int main () { int t,m; scanf ("%d%d",&t,&m); m...原创 2019-07-08 12:04:19 · 194 阅读 · 0 评论 -
Luogu P1049 装箱问题 [NOIP 2001 普及组]
#include <algorithm>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;int f[20005];int main () { int v,n; scanf ("%d%d",&v,&n); ...原创 2019-07-08 12:16:47 · 307 阅读 · 0 评论 -
Luogu P1616 疯狂的采药
#include <algorithm>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;int f[100005];int main () { int t,m; scanf ("%d%d",&t,&m); ...原创 2019-07-26 16:06:12 · 181 阅读 · 0 评论