# Monthly Archives: November 2013

## Poj Solution 2588

http://poj.org/problem?id=2588 #include"stdio.h" #include"math.h" const double eps=1e-7; struct cir { double x,y,r; }c; inline bool edge(cir &a,cir &b) { return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y))<=a.r+b.r; } int n; bool init() { int i; if(scanf("%d",&n)!=1)return false; for(i=0;i<n;i++) scanf("%lf %lf %lf",&c[i].x,&c[i].y,&c[i].r); return true; } inline bool touch_up(cir … Continue reading

## Poj Solution 2586

http://poj.org/problem?id=2586 import java.io.PrintWriter; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scn = new Scanner(System.in); PrintWriter out = new PrintWriter(System.out); int s,d,result; while(scn.hasNext()){ result = 0; s = scn.nextInt(); d = scn.nextInt(); if(d > 4 … Continue reading

## Poj Solution 2585

http://poj.org/problem?id=2585 //* @author: 82638882@163.com import java.io.*; public class Main { static int[][] map=new int; static int[][] p=new int; public static void main(String[] args)throws IOException { InputStreamReader is=new InputStreamReader(System.in); BufferedReader in=new BufferedReader(is); while(true) { String s=in.readLine(); if(s.equals("ENDOFINPUT"))break; String[] ss; for(int i=0;i< … Continue reading

## Poj Solution 2584

http://poj.org/problem?id=2584 #include"iostream" #include"algorithm" using namespace std; char *size="SMLXT"; int find( char c ) { char *q = size; while( *q != c ) q++; return q – size; } struct person { int b,e; }p; bool cmp( person p1, person … Continue reading

## Poj Solution 2583

http://poj.org/problem?id=2583 import java.io.BufferedInputStream; import java.util.Scanner; /** *poj2583 easy * @author NC */ public class Main { public static void main(String[] args) { Scanner scan = new Scanner(new BufferedInputStream(System.in)); while (scan.hasNext()) { int f0 = scan.nextInt(); int f1 = scan.nextInt(); int … Continue reading

## Poj Solution 2582

http://poj.org/problem?id=2582 #include<iostream> #include"math.h" using namespace std; struct point { int x,y,z; }b,f; inline int sq_dis( point a, point b ) { return (a.x-b.x)*(a.x-b.x) + (a.y-b.y)*(a.y-b.y) + (a.z-b.z)*(a.z-b.z); } int main() { int l,w,d,n,m,ans,i,j; char t,c; cin>>t; while( cin>>l>>w>>d ) { … Continue reading

## Poj Solution 2581

http://poj.org/problem?id=2581 //* @author: import java.util.*; public class Main { static public void main( String [] str ){ Scanner sc = new Scanner(System.in); while(sc.hasNext()) { int a,b,c,d,e,i,j,k,total,s,value; int as=0,bs=0,cs=0,ds=0; double t; t=sc.nextDouble(); b=sc.nextInt(); c=sc.nextInt(); d=sc.nextInt(); e=sc.nextInt(); a = (int)(t*100); total = … Continue reading

## Poj Solution 2580

http://poj.org/problem?id=2580 #include "stdio.h" #include "string.h" #include "stdlib.h" int k,keys,to; int key; int n,begin; bool init() { char w,num,t; int i,j,h; scanf( "%s", w ); if( strcmp( "ENDOFINPUT", w ) == 0 ) return false; scanf( "%d %d", &begin, &n ); … Continue reading

## Poj Solution 2579

http://poj.org/problem?id=2579 #include"stdio.h" char map; int main() { int i, j, m, n; scanf( "%*s" ); while( scanf( "%d %d", &n, &m ) == 2 ) { for( i=0; i<n; i++ ) scanf( "%s", &map[i] ); for( i=0; i<n-1; i++ ) … Continue reading