09 2012 档案

摘要:http://acm.hdu.edu.cn/showproblem.php?pid=2688 #include<iostream>#include<cstring>using namespace std;#define ll __int64#define maxn 10001int a[3000001],n,m;ll c[maxn];int lowbit(int x) { retur... 阅读全文
posted @ 2012-09-15 17:33 Yogurt Shen 阅读(193) 评论(0) 推荐(0)
摘要:http://poj.org/problem?id=1011 #include<iostream>#include<cstring>#include<algorithm>using namespace std;int p[65],vis[65],s,j,n;bool cmp(int a,int b){ return a>b;}int dfs(int sum,int k,int ... 阅读全文
posted @ 2012-09-12 19:42 Yogurt Shen 阅读(163) 评论(0) 推荐(0)
摘要:http://poj.org/problem?id=1833 自己先按着书上的思路写的,结果TLE我勒个去。。。 TLE代码: #include<cstdio>#include<algorithm>using namespace std;int main(void){ int num[1024],m,n,i,j,k,un,_min,temp,t,flag; scanf("%... 阅读全文
posted @ 2012-09-11 23:42 Yogurt Shen 阅读(180) 评论(0) 推荐(0)
摘要:http://acm.hdu.edu.cn/showproblem.php?pid=4278 竟然是八进制转十进制- -,网络赛第一题。 #include<stdio.h>#include<string.h>int base[58];char num[8];void init(){ base['0']=0; base['1']=1; base['2']=2; ba... 阅读全文
posted @ 2012-09-10 22:03 Yogurt Shen 阅读(205) 评论(0) 推荐(0)