- 博客(13)
- 收藏
- 关注
RSS订阅原创 01背包
#include #include int main(void) { int n,m; while(scanf("%d%d",&n,&m)!=EOF) { int i,j,t,p[505],q[505],v[505],c[505],s[5005]; memset(s,0,sizeof(s)); for(i=0;in;i++)
2014-02-26 20:18:51
442
原创 01背包
#include #include int main(void) { int n; while(scanf("%d",&n)!=EOF&&n!=0) { int i,v,j,a[1055],s[1005],t; memset(s,0,sizeof(s)); for(i=0;in;i++) scanf("
2014-02-26 20:17:10
438
原创 Doing Homework again
#include #include int main(void) { int x; scanf("%d",&x); while(x--) { int n,a1[1005][2],b1[1005],a2[1005][2],b2[1005],c[1005],i,j,t,i1,i2=0,sum=0,max,n1,f; memset(c,0,
2014-02-26 20:12:46
521
原创 Moving Tables
#include #include int main(void) { int x; scanf("%d",&x); while(x--) { int i,j,t,n,a[205],b[205],c[205],e=0,max=0; memset(c,0,sizeof(c)); scanf("%d",&n);
2014-02-26 20:11:01
491
原创 最少拦截系统
#include #include int main(void) { int n; while(scanf("%d",&n)!=EOF) { int i,a[10005],b[10005],max=0,j; memset(b,0,sizeof(b)); for(i=0;in;i++) scanf
2014-02-26 20:09:54
467
原创 Radar Installation
#include #include #include int main(void) { int n,d,o=0; while(scanf("%d%d",&n,&d)!=EOF&&(n!=0||d!=0)) { int i,j,x[1005],y[1005],sum=1,l=0; double a[1005],b[1005],e,t;
2014-02-26 20:08:17
490
原创 Integer Intervals
#include int main(void) { int i,n,a[10005],b[10005],s,e,sum=2,j,t; scanf("%d",&n); for(i=0;in;i++) { scanf("%d%d",&a[i],&b[i]); } for(i=1;in;i++) for(j=0;jn-i;j
2014-02-26 20:06:29
429
原创 Crixalis's Equipment
#include int main(void) { int x; scanf("%d",&x); while(x--) { int v,n,i,j,t,a[1005],b[1005]; scanf("%d%d",&v,&n); for(i=0;in;i++) scanf("%d%d",&a[i]
2014-02-26 20:05:12
421
原创 Tian Ji -- The Horse Racing
#include int main(void) { int n; while(scanf("%d",&n)!=EOF&&n!=0) { int i,j,t,a[1005],b[1005],x1=n,x2=n,s=0,p=0,s1=0,s2=0,f=0; for(i=0;in;i++) scanf("%d",&a[i])
2014-02-26 20:02:59
946
原创 Legal or Not
#include #include int main(void) { int n,m; while(scanf("%d%d",&n,&m)!=EOF&&n!=0) { int i,j,k,map[105][105],a,b,d[105]; memset(map,0,sizeof(map)); memset(d,0,sizeof
2014-02-26 19:58:59
505
原创 确定比赛名次
#include #include int map[505][505]; int main(void) { int n,m; while(scanf("%d%d",&n,&m)!=EOF) {int d[505],i,j,k,a,b; memset(d,0,sizeof(d)); memset(map,0,sizeof(map)); for(i=1;
2014-02-26 19:57:31
489
原创 Farm Irrigation
#include int p[2505]; char s[55][55]; int find(int i) { if(p[i]!=i) p[i]=find(p[i]); return p[i]; } int main(void) { int m,n; while(scanf("%d%d",&m,&n)!=EOF&&(m!=-1||n!=-1)) {
2014-02-26 19:53:58
422
原创 小希的迷宫
#include #include int p[100005],s[100005]; int find(int i) { if(p[i]!=i) p[i]=find(p[i]); return p[i]; } int main(void) { int i,j,a,b,f=0,t,f1=0; memset(s,0,sizeof(s)); for(i=1;i10
2014-02-26 19:50:27
450
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人