int nx,ny; for(int i=-3;i<4;i++){ nx=x+i; ny=y; if(8>nx && nx>-1 && map[ny][nx]=='1'){ map[ny][nx]='0'; saiki(nx,ny); } nx=x; ny=y+i; if(ny>7 || ny<0) continue; if(map[ny][nx]=='1'){ map[ny][nx]='0'; saiki(nx,ny); } }
for(int i=0;i<8;i++){ scanf("%s",map[i]); } int sx,sy; scanf("%d %d",&sx,&sy); saiki(sx-1,sy-1); printf("Data %d:\n",no+1);
for(int i=0;i<8;i++){ printf("%s\n",map[i]); }
int n; scanf("%d",&n); for(int i=0;i<n;i++){ setMap(i); }
int p1,p2,len; bool operator<(const load l)const{ return len>l.len; }
int points[101]={0}; std::priority_queue<load> loads; std::vector<load> map[101]; std::vector<load>::iterator it,end; load l,start; start.len=2000000000; for(int i=0;i<m;i++){ scanf("%d,%d,%d",&l.p1,&l.p2,&l.len); l.len=l.len/100-1; map[l.p1].push_back(l); map[l.p2].push_back(l); start=l.len<start.len?l:start; } int count=1,ans=0,addOK; loads.push(start); while(n>count && loads.empty()==false){ l=loads.top(); loads.pop(); addOK=false; if(points[l.p1]==0){ addOK=true; points[l.p1]=1; it=map[l.p1].begin(); end=map[l.p1].end(); while(it!=end){ loads.push(*it); it++; } } if(points[l.p2]==0){ addOK=true; points[l.p2]=1; it=map[l.p2].begin(); end=map[l.p2].end(); while(it!=end){ loads.push(*it); it++; } } if(addOK==true){ count++; ans+=l.len; } } printf("%d\n",ans);
int n,m; scanf("%d",&n); while(n!=0){ scanf("%d",&m); setMap(n,m); scanf("%d",&n); }
double x,h; while(1){ scanf("%lf %lf",&x,&h); if(x==0&&h==0) break; printf("%lf\n",x*(x+2*sqrt(h*h+x*x/4.0))); }
int h,m,s,max=7200,t,u; while(1){ scanf("%d %d %d",&h,&m,&s); if(h==-1 && m==-1 && s==-1) break; u=h*3600+m*60+s; t=max-u; printf("%02d:%02d:%02d\n",t/3600,t%3600/60,t%60); t*=3; printf("%02d:%02d:%02d\n",t/3600,t%3600/60,t%60); }
int no; double kg,m; while(scanf("%d,%lf,%lf",&no,&kg,&m)!=EOF){ kg/(m*m)>=25?printf("%d\n",no):m; }