# Monthly Archives: March 2012

## Poj Solution 2101

http://poj.org/problem?id=2101 import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner cin = new Scanner(System.in); int n = cin.nextInt(); int e = cin.nextInt(); double l1 = 0, l2 = 0; while(–n > 0) { l1 += cin.nextInt(); … Continue reading

Posted in poj | Comments Off on Poj Solution 2101

## Poj Solution 2092

http://poj.org/problem?id=2092 //* @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< Integer,Integer> ts=new HashMap< Integer,Integer>(); while(true) { String[] ss=in.readLine().split(" "); int … Continue reading

Posted in poj | Comments Off on Poj Solution 2092

## Poj Solution 2088

http://poj.org/problem?id=2088 #include<iostream> #include"algorithm" using namespace std; int dis[21][21]; int tim[21],n; int id[21],mint[21]; int cmp(int a,int b) { return mint[a]<mint[b]; } void init() { int i,j,k; for(i=0;i<n;i++) cin>>tim[i]; for(i=0;i<n;i++) for(j=0;j<n;j++) { cin>>dis[i][j]; } for(k=0;k<n;k++) for(i=0;i<n;i++) for(j=0;j<n;j++) if(dis[i][k]+dis[k][j]<dis[i][j]) dis[i][j]=dis[i][k]+dis[k][j]; for(i=0;i<n;i++) { mint[i]=9999;id[i]=i; … Continue reading

Posted in poj | Comments Off on Poj Solution 2088

## Poj Solution 2087

http://poj.org/problem?id=2087 #include<iostream> #include"stdio.h" #include"math.h" #include<algorithm> using namespace std; ///////////////////////// #define Type double /*�������*/ ///////////////////////// struct point { Type x,y; int host; }; const double pi=3.1415926535898; 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);} inline Type dcheng(point a,point b,point c) {return … Continue reading

Posted in poj | Comments Off on Poj Solution 2087

## Poj Solution 2085

http://poj.org/problem?id=2085 import java.util.Scanner; public class Main{ public static void main(String args[]){ int n,m; int i,j,k,sum; Scanner sc=new Scanner(System.in); while(true) { n=sc.nextInt(); m=sc.nextInt(); if(n==-1&&m==-1)break; sum=0; for(i=n;i>=1;i–) { sum+=(n-i); if(sum>=m)break; } for(j=1;j< i;j++) System.out.printf("%d ",j); k=m+i-(n-i)*(n-i-1)/2; System.out.printf("%d",k); for(j=n;j>=i;j–) if(j!=k) System.out.printf(" %d",j); System.out.printf("n"); … Continue reading

Posted in poj | Comments Off on Poj Solution 2085

## Poj Solution 2084

http://poj.org/problem?id=2084 import java.io.*; import java.util.*; import java.math.BigInteger; public class Main { public static void main(String[]args){ Scanner sin=new Scanner(new BufferedInputStream(System.in)); int n; int i = 0; BigInteger big[] = new BigInteger[101]; for(i = 0 ; i < 101 ; i++) big[i] … Continue reading

Posted in poj | Comments Off on Poj Solution 2084

## Poj Solution 2083

http://poj.org/problem?id=2083 //* @author: 82638882@163.com import java.util.Scanner; class Main { static StringBuffer sb=new StringBuffer(); public static void main(String[] args) { Scanner in=new Scanner(System.in); while(true) { int a=in.nextInt(); if(a==-1) break; else if(a==1) System.out.println(‘X’); else g("",a-1); System.out.println("-"); } } static void p(int a) … Continue reading

Posted in poj | Comments Off on Poj Solution 2083

## Poj Solution 2082

http://poj.org/problem?id=2082 //* @author: 82638882@163.com import java.io.*; public class Main { static int[] p,b,c,w; static int a; public static void main(String[] args) throws IOException { InputStreamReader is=new InputStreamReader(System.in); BufferedReader in=new BufferedReader(is); while(true) { String[] ss=in.readLine().split(" "); a=Integer.parseInt(ss[0]); if(a==-1)break; p=new int[a+2]; b=new … Continue reading

Posted in poj | Comments Off on Poj Solution 2082

## Poj Solution 2080

http://poj.org/problem?id=2080 import java.util.*; import java.lang.*; import java.io.*; import java.text.*; public class Main{ public static void main(String[] args) throws IOException{ Date twoK,res,t1,t2; long twoKl,resl,t; //��EEEE������4λΪȫ�ƣ������Ϻ���ġ�Locale.US�������ڻ��������Ŷ�� SimpleDateFormat sdf = new SimpleDateFormat("yyyy-MM-dd EEEE",Locale.US); //BufferedInputStream bin = new BufferedInputStream(new FileInputStream("in.txt")); //System.setIn(bin); Scanner cin = … Continue reading

Posted in poj | Comments Off on Poj Solution 2080

## Poj Solution 2079

http://poj.org/problem?id=2079 #include<iostream> #include"stdio.h" #include<algorithm> //ifstream in("triangle.in"); //#define cin in using namespace std; ///////////////////////// #define Type long /*�������*/ ///////////////////////// 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;} }; int cmp_x_y(point a,point b) {return a.y<b.y||(a.y==b.y&&a.x<b.x);} void sort(point *a,int … Continue reading

Posted in poj | Comments Off on Poj Solution 2079

## Poj Solution 2078

http://poj.org/problem?id=2078 #include "stdio.h" int a[10][10], ans, n; int k[10],sum[10]; void doit( int s ) { int i, maxv; if( s == n ) { maxv = -1; for( i=0; i<n; i++ ) if( sum[i] > maxv ) maxv = sum[i]; … Continue reading

Posted in poj | Comments Off on Poj Solution 2078

## Poj Solution 2076

http://poj.org/problem?id=2076 #include<iostream> #include"algorithm" using namespace std; int dist[101][101],n,m; void init() { int i,a,b,d,j,k; cin>>n>>m; for(i=0;i<n;i++) for(j=0;j<n;j++) dist[i][j]=9999; for(i=0;i<m;i++) { cin>>a>>b>>d; a–;b–; if(d<dist[a][b]) { dist[a][b]=dist[b][a]=d; } } for(i=0;i<n;i++) dist[i][i]=0; for(k=0;k<n;k++) for(i=0;i<n;i++) for(j=0;j<n;j++) if(dist[i][k]+dist[k][j]<dist[i][j]) dist[i][j]=dist[i][k]+dist[k][j]; return ; } int answer[101]; int c1,c2; … Continue reading

Posted in poj | Comments Off on Poj Solution 2076