Monthly Archives: May 2010

Poj Solution 1416

http://poj.org/problem?id=1416 /* @author: */ import java.util.*; public class Main { private int target; private char num[]; private int max; private StringBuffer s; private StringBuffer result; boolean check; public Main(int target,char num[]){ this.target=target; this.num=num; max=0; s=new StringBuffer(""); result=new StringBuffer(""); } public … Continue reading

Posted in poj | Comments Off on Poj Solution 1416

Poj Solution 1411

http://poj.org/problem?id=1411 import java.util.*; /** * * @author leo */ public class Main { /** * @param args the command line arguments */ public static boolean prime(int n) { for (int i = 2; i * i <= n; i++) { … Continue reading

Posted in poj | Comments Off on Poj Solution 1411

Poj Solution 1410

http://poj.org/problem?id=1410 import java.util.*; import java.io.*; public class Main{ public static void main(String[] args){ Scanner scanner=new Scanner(new BufferedReader(new InputStreamReader(System.in))); int n=scanner.nextInt(); double dx1,dx2,dy1,dy2; double x1,x2,y1,y2; double k,b; double d1,d2,d3,d4; for (int i=0;i<n ;i++ ){ x1=scanner.nextDouble(); y1=scanner.nextDouble(); x2=scanner.nextDouble(); y2=scanner.nextDouble(); dx1=scanner.nextDouble(); dy1=scanner.nextDouble(); dx2=scanner.nextDouble(); … Continue reading

Posted in poj | Comments Off on Poj Solution 1410

Poj Solution 1408

http://poj.org/problem?id=1408 /* @author:����acmilan_fan@yahoo.cn */ import java.io.BufferedReader; import java.io.InputStreamReader; public class Main { static double[][][] mesh=new double[32][32][2]; public static void main(String[] args) throws Exception{ BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); String s; String[] ss; int n,i,j; double max=0d,t; while((s=br.readLine())!=null&&!"0".equals(s)){ n=parseInt(s); s=br.readLine(); … Continue reading

Posted in poj | Comments Off on Poj Solution 1408

Poj Solution 1406

http://poj.org/problem?id=1406 import java.util.*; /** * * @author leo */ public class Main { /** * @param args the command line arguments */ public static void main(String[] args) { Scanner scan = new Scanner(System.in); int total, left; while (true) { total … Continue reading

Posted in poj | Comments Off on Poj Solution 1406

Poj Solution 1405

http://poj.org/problem?id=1405 import java.io.BufferedInputStream; import java.math.BigDecimal; import java.util.ArrayList; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scan = new Scanner(new BufferedInputStream(System.in)); if (scan.hasNext()) { int n = scan.nextInt(); ArrayList<BigDecimal> results = new ArrayList(18); results.add(0, new BigDecimal(2)); … Continue reading

Posted in poj | Comments Off on Poj Solution 1405

Poj Solution 1404

http://poj.org/problem?id=1404 //* @author: import java.util.*; public class Main { public static void main(String[] args){ Scanner in = new Scanner(System.in); int K,L; char key[]=new char[100]; char letter[]=new char[100]; int F[]=new int[100]; int p[]=new int[100]; int best; int map[][][]=new int[100][100][100]; int father[][]=new … Continue reading

Posted in poj | Comments Off on Poj Solution 1404

Poj Solution 1401

http://poj.org/problem?id=1401 #include <iostream> using namespace std; int calc(int z) { int i, count = 0; for (i = 5; i <= z; i *= 5) { count += z / i; } return count; } int main() { int n, … Continue reading

Posted in poj | Comments Off on Poj Solution 1401

Poj Solution 1389

http://poj.org/problem?id=1389 #include<iostream> #include"memory.h" #include"algorithm" using std::sort; using namespace std; int x[2010],y[2010]; int n,index_y[2010],index_x[2010],to_y[2010]; int tree[2048*2],cover[2048*2]; int cmp_x(int a,int b) {return x[a]<x[b];} int cmp_y(int a,int b) {return y[a]<y[b];} int init() {int i; for(i=0;;i++) {cin>>x[2*i]>>y[2*i]>>x[2*i+1]>>y[2*i+1]; if(x[2*i]==-1)break; index_x[2*i]=2*i;index_x[2*i+1]=2*i+1; index_y[2*i]=2*i;index_y[2*i+1]=2*i+1; } n=i; if(n==0)return 0; … Continue reading

Posted in poj | Comments Off on Poj Solution 1389

Poj Solution 1386

http://poj.org/problem?id=1386 //* @author: 82638882@163.com import java.io.*; public class Main { static int[] arr=new int[26]; static int[] cin=new int[26]; static int[] cout=new int[26]; static boolean[] used=new boolean[26]; public static void main(String[] args) throws NumberFormatException, IOException { InputStreamReader is=new InputStreamReader(System.in); BufferedReader in=new … Continue reading

Posted in poj | Comments Off on Poj Solution 1386

Poj Solution 1385

http://poj.org/problem?id=1385 #include<iostream> #include"stdio.h" #include"memory.h" using namespace std; double x,y,x1,y1,xb,yb; double area,x_sum,y_sum,temp; int main() { int t,n,i; cin>>t; while(t–) { cin>>n; cin>>x1>>y1; xb=x1,yb=y1; area=x_sum=y_sum=0; for(i=1;i<=n;i++) { if(i<n)cin>>x>>y; else x=xb,y=yb; temp=x*y1-y*x1; x_sum+=temp*(x+x1); y_sum+=temp*(y+y1); area+=temp; x1=x,y1=y; } printf("%.2lf %.2lfn",(double)((long)(x_sum/area/3*100))/100,(double)(long)(y_sum/area/3*100)/100); } return 0; }

Posted in poj | Comments Off on Poj Solution 1385

Poj Solution 1384

http://poj.org/problem?id=1384 //* @author: ccQ.SuperSupper import java.io.*; import java.util.*; class Coin{ int price,weight; } public class Main { static final int N = 500+10,M = 10000+10; static int DP[] = new int[M],n,m; static Coin coin[] =new Coin[N]; static void start(){ for(int … Continue reading

Posted in poj | Comments Off on Poj Solution 1384