# Monthly Archives: October 2013

## Poj Solution 2576

http://poj.org/problem?id=2576 //* @author: 82638882@163.com import java.io.*; import java.util.Arrays; public class Main { public static void main(String[] args) throws IOException { InputStreamReader is=new InputStreamReader(System.in); BufferedReader in=new BufferedReader(is); int a=Integer.parseInt(in.readLine()); int total=0,l1=0,l2=0,i; int[] arr=new int[a]; for(i=0;i< a;i++) { arr[i]=Integer.parseInt(in.readLine()); total+=arr[i]; } int … Continue reading

## Poj Solution 2575

http://poj.org/problem?id=2575 //* @author: 82638882@163.com import java.util.HashSet; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner in=new Scanner(System.in); while(in.hasNext()) { int a=in.nextInt(); int[] b=new int[a]; for(int i=0;i< a;i++) b[i]=in.nextInt(); HashSet< Integer> h=new HashSet< Integer>(); for(int i=1;i< a;i++) … Continue reading

## Poj Solution 2574

http://poj.org/problem?id=2574 #include<iostream> #include"stdio.h" #include"math.h" #include"algorithm" using namespace std; ////////////////////////////// #define Type double /*????????*/ ////////////////////////////// struct point {Type x,y; point(){x=y=0;} point(Type &x,Type &y):x(x),y(y){;} bool operator==(point &a){return x==a.x&&y==a.y;} }; inline Type cheng(point a,point b,point c) {return (b.x-a.x)*(c.y-a.y)-(c.x-a.x)*(b.y-a.y);} struct line {point a,b; line(){;} … Continue reading

## Poj Solution 2573

http://poj.org/problem?id=2573 //* @author: 82638882@163.com import java.util.*; public class Main { public static void main(String[] args) { Scanner in=new Scanner(System.in); int a=in.nextInt(); ArrayList< Integer> t=new ArrayList< Integer>(); for(int i=0;i< a;i++) t.add(in.nextInt()); if(a==1){ System.out.println(t.get(0)); System.out.println(t.get(0)); } else{ int total=0; Collections.sort(t); ArrayList< Integer> … Continue reading

## Poj Solution 2572

http://poj.org/problem?id=2572 //* @author: 82638882@163.com import java.util.*; public class Main { public static void main(String[] args) { Scanner in=new Scanner(System.in); while(true) { String s=in.next(); String[] s1=s.split("\+"); String[] s2=s1[1].split("\="); StringBuffer b1=new StringBuffer(s1[0]); StringBuffer b2=new StringBuffer(s2[0]); StringBuffer b3=new StringBuffer(s2[1]); b1=b1.reverse(); b2=b2.reverse(); b3=b3.reverse(); int … Continue reading

## Poj Solution 2571

http://poj.org/problem?id=2571 //* @author: import java.util.*; import static java.lang.Math.*; public class Main { static double a, b, c; static double[] change( double th,double fi, double l) { double z = l * sin( th/180*PI ); double y = l * cos( … Continue reading

## Poj Solution 2569

http://poj.org/problem?id=2569 //* @author: 82638882@163.com import java.io.*; import java.util.*; import java.util.Map.Entry; public class Main { public static void main(String[] args) throws NumberFormatException, IOException { InputStreamReader is=new InputStreamReader(System.in); BufferedReader in=new BufferedReader(is); HashMap< String,Integer> ts=new HashMap< String,Integer>(); while(true) { int a=Integer.parseInt(in.readLine()); if(a==0)break; String … Continue reading

## Poj Solution 2568

http://poj.org/problem?id=2568 #include<iostream> #include"stdio.h" #include"stdlib.h" #include"memory.h" using namespace std; bool e[51][51]; bool s[51]; int a[51],n; void print( int f ) { int i; printf( "(%d", f ); for( i=1; i<=n; i++ ) if( e[f][i] ) { printf( " " ); print( … Continue reading

## Poj Solution 2567

http://poj.org/problem?id=2567 #include"stdio.h" #include"stdlib.h" #include"memory.h" int d[51],n; bool e[51][51]; void creat( int f ) { int s; char t[10]; scanf( "%[ ,0-9]", t ); s = atoi( t ); if( s > n ) n = s; if( f ) e[f][s] … Continue reading