2012年03月_E_Windrunner

原创 10986 - Sending email

#include#include#include#include#includeusing namespace std;typedef pair pii;#define INF 1000000000;int u[50010*2],v[50010*2],w[50010*2],first[50010*2],nextx[50010*2],d[50010*2],done[50010*2];

2012-03-22 22:18:18 568

原创 HDU 1059

#include#includeint a[7],f[120100],tot;int dp(){ int i,ans,k,num,j; if(tot&1) return 0; ans=tot/2; memset(f,0,sizeof(f)); f[0]=1; for(i=1;i<=6;i++) { k=

2012-03-07 13:23:01 310

原创 HDU 1056

#includeint main(){ double sum,c; int i; while(scanf("%lf",&c)&&c) { sum=0; for(i=2;i<10000;i++) { sum+=1.0/i; if(sum>=c)

2012-03-07 13:22:08 300

原创 HDU 1049

#include int main(){ int n,u,d,i,m; scanf("%d%d%d",&n,&u,&d); while(n!=0) { for(i=n-u;i<n;i++) if(i%(u-d)==0) break; printf("%d\n",i/(u-d)

2012-03-07 13:21:36 263

原创 HDU 1048

#include#includeint main(){ int i,j,flag; char sta[10]="START",end[10]="END",en[15]="ENDOFINPUT",s[300],s1[300]; flag=0; while(1) { gets(s); if(strcmp(s,en))

2012-03-07 13:21:11 342

原创 HDU 1047

#include#includeint main(){ int t,i,j,len,a[11000],b[11000],min,c,temp,sum; char s[10000]; scanf("%d",&t); while(t--) { memset(a,0,sizeof(a)); while(scanf("%s",s

2012-03-07 13:20:33 475

原创 HDU 1042

#include int main(){ int a[20000],i,j,n,t,c,m; while(scanf("%d",&n)!=EOF) { for(i=0;i<20000;i++) a[i]=0; a[0]=1; m=0; for(i=2;i<=n;i++)

2012-03-07 13:20:03 231

原创 HDU 1040

#includeint main(){ int t,n,i,j,k,a[1000]; scanf("%d",&t); while(t--) { scanf("%d",&n); for(i=0;i<n;i++) scanf("%d",&a[i]); for(i=0;i<n;i++)

2012-03-07 13:19:30 274

原创 HDU 1039

#include#includeint isv(char c){ if(c=='a'||c=='o'||c=='e'||c=='i'||c=='u') return 1; return 0;}int main(){ int i,len,flag1,flag2,flag3; char s[100],end[10]="end"; ge

2012-03-07 13:19:05 394

原创 HDU 1038

#includeint main(){ float d,t,s; int r,i; i=1; while(scanf("%f%d%f",&d,&r,&t)&&r!=0) { s=3.1415927*d*r/5280/12; printf("Trip #%d: %.2f %.2f\n",i++,s,s*3600/t);

2012-03-07 13:18:26 387

原创 HDU 1037

#includeint main(){ int a,flag; flag=0; while(scanf("%d",&a)!=EOF) if(a<=168) { flag=1; printf("CRASH %d\n",a); break; } i

2012-03-07 13:17:52 296

原创 HDU 1036

#include#includeint main(){ int set,team,m[25],s[25],time,ansmin,anssec,i; double dis; char h[25],waste[10000]; scanf("%d%lf",&set,&dis); while(scanf("%d",&team)!=EOF) {

2012-03-07 13:17:09 365

原创 HDU 1035

#include#includeint main(){ int n,m,k,i,j,vis[20][20],flag,step,step1; char s[20][20]; while(scanf("%d%d%d",&n,&m,&k)&&!(n==0&&m==0&&k==0)) { getchar(); step=0;

2012-03-07 13:16:31 748

原创 HDU 1032

#includeint num(int n){ int sum; sum=1; while(n!=1) { if(n%2) n=3*n+1; else n/=2; sum++; } return sum;}int main(){ int

2012-03-07 13:15:30 279

原创 HDU 1029

#includeint main(){ int n,count,k,ans; while(scanf("%d",&n)!=EOF) { count=0; while(n--) { scanf("%d",&k); if(!count) {

2012-03-07 13:14:55 198

原创 HDU 1022

#includeint main(){ char a[10000],b[10000],s[10000]; int i,n,top,f[10000],j,count; while(scanf("%d",&n)!=EOF) { getchar(); for(i=0;i<n;i++) a[i]=getchar()

2012-03-07 13:14:16 368

原创 HDU 1020

#include#includeint main(){ int n,t,i,a[10000],count,flag; char s[10000]; scanf("%d",&t); getchar(); while(t--) { gets(s); count=1; for(i=1;i<strlen(

2012-03-07 13:12:29 324

原创 HDU 1018

#include#include int main(){ int n,t,i; double sum; scanf("%d",&t);while(t--){ scanf("%d",&n); sum=0; for(i=1;i<=n;i++) { sum+=log10((double)i); } printf("%d\n",

2012-03-07 13:10:36 204

原创 HDU 1017

#includeint main(){ int m,i,j,k,n,t,count; scanf("%d",&t); while(t--) { k=1; scanf("%d%d",&n,&m); while(!(n==0&&m==0)) { count=0;

2012-03-07 13:08:17 276

原创 HDU 1016

#include#includeint n,ans[21],isprime[]={0,0,1,1,0,1,0,1,0,0,0,1,0,1,0,0,0,1,0,1,0,0,0,1,0,0,0,0,0,1,0,1,0,0,0,0,0,1,0,0,0},vis[21];void dfs(int step){ int i; if(step==n+1) { i

2012-03-06 12:14:30 1102 1

原创 HDU 1015

#include#includeint sum,len,step,vis[30],flag,tar;char s[30],ans[30],anss[30];void dfs(){ int i,j,t; if(step<5) { for(i=0;i<len;i++) if(!vis[i]) {

2012-03-06 12:13:48 591

原创 HDU 1014

#include#includeint a[100010];int main(){ int step,m,i; while(scanf("%d%d",&step,&m)!=EOF) { i=0; memset(a,0,sizeof(a)); a[0]=1; i+=step; i%=m;

2012-03-06 12:12:37 221

原创 HDU 1013

include#includeint main(){ int sum,i,n; char s[10000]; gets(s); while(strcmp(s,"0")) { sum=0; for(i=0;i<strlen(s);i++) sum+=s[i]-'0'; while(s

2012-03-06 12:11:41 205

原创 HDU 1012

#includeint main(){ int n,i,j; double ans; ans=0; printf("n e\n"); printf("- -----------\n"); for(i=0;i<10;i++) { if(i!=0) { for(j=1,n=1;j<=i;

2012-03-06 12:10:49 324

原创 HDU 1010

WA了N次......#include#include#include#include using namespace std;int sign,dir[4][2]={1,0,-1,0,0,1,0,-1},n,m,t,a,b,c,d;char s[10][10];void dfs(int x,int y,int step){ int i,X,Y; if(si

2012-03-06 12:10:05 168

Windrunner