l171424858-优快云博客

import java.util.Scanner;public class POJ_3130 { static double x[], y[]; static double tx[], ty[]; static double txp[], typ[]; static int num; static int tnum; static double a, b, c;

2012-09-14 14:20:33 393

原创 poj 3335 java

import java.util.Scanner;public class POJ_3335 { static double x[], y[]; static double tx[], ty[]; static double txp[], typ[]; static int num; static int tnum; static double a, b, c;

2012-09-14 14:17:53 400

原创 poj 1001 java

import java.math.BigDecimal;import java.util.Scanner;public class POJ_1001 { public static void main(String[] args) { Scanner scan = new Scanner(System.in); while(scan.hasNext()){

2012-09-12 19:54:24 843

原创 poj 1819 java

import java.io.BufferedReader;import java.io.InputStreamReader;public class POJ_1819 { static double r[],x[]; static int touch[]; static boolean flag[]; public static void main(Stri

2012-09-12 19:51:59 585

原创 poj 3277 java

import java.io.*;public class POJ_3277 { static int A[],B[],H[]; static int S[]; static A8 ST[]; static int x; public static void main(String[] args) throws Exception{ Buffer

2012-09-11 19:36:35 390

原创 poj 1177 java

import java.io.*;public class POJ_1177 { static A4 p[]; static A5 ST[]; public static void main(String[] args) throws Exception{ BufferedReader buf = new BufferedReader(new Input

2012-09-10 15:58:48 520

原创 poj 1095

import java.util.Scanner;public class POJ_1095 { public static final int SIZE = 20; static int a[] = new int[21],sum[] = new int[21]; public static void main(String[] args) { a[0

2012-09-09 19:43:47 490

原创 poj 2454 java

import java.io.*;public class POJ_2454 { //题意将所有城市分成三部份（每个城市拥有一定的牛）问至少有两个部份的各自的总牛数大于 500*k // 将所有城市按牛数量排序，从最大的2*k个城市中分成两组（我们已经舍弃最小的k只牛会胜出（当然会不会胜出得看给得数据)); // 调整使得剩下 2*k个城市

2012-09-08 14:54:23 473

原创 poj 1870 java

import java.util.Scanner;public class POJ_1870 { public static void main(String[] args) { Scanner scan = new Scanner(System.in); while(true){ int a = scan.nextInt(); i

2012-09-08 14:49:00 456

原创 poj 2265 java

import java.util.Scanner;public class POJ_2265 { public static void main(String[] args) { Scanner scan = new Scanner(System.in); while(scan.hasNext()){ int n = scan.n

2012-09-08 14:45:37 513

原创 poj 3150

import java.util.Scanner;public class POJ_3150 { static int n,m,d,k; public static void main(String[] args) { Scanner scan = new Scanner(System.in); while(scan.hasNext())

2012-09-04 21:41:44 412

原创 poj 3101

import java.math.BigInteger;import java.util.Scanner;public class POJ_3101 { public static void main(String[] args) { Scanner scan = new Scanner(System.in); int n = scan.ne

2012-09-04 21:40:40 573

原创 poj 3071

import java.util.Scanner;public class POJ_3071 { static double p[][]; static double dp[][]; public static void main(String[] args) { Scanner scan = new Scanner(System.in); whil

2012-09-03 20:42:48 472

原创 poj 2947 java

import java.io.*;import java.util.HashMap;public class POJ_2947 { public static final int MAX = 310; static int equ,var; static int a[][]; static int x[]; static HashMap hash = new H

2012-09-02 16:04:06 401

原创 poj 1947

import java.util.ArrayList;import java.util.List;import java.util.Scanner;public class POJ_1947 { public static final int MAX = 152; static List v[]; static int dp[][]; static int p;

2012-08-31 21:07:38 367

原创 poj 1162 java

import java.util.Scanner;public class POJ_1162 { static int n; static int head[]; static W1 p[]; static int f[]; static int dp[][]; static int num; public static void main(Strin

2012-08-31 21:06:55 481

原创 poj 1185

import java.io.*;public class POJ_1185 { static int n, m; static int a[]; static int sta[]; static int cot[]; static int num; static int sum; static int ans = 0; static int dp[][

2012-08-30 18:27:47 420

原创 poj 2411 java

// 0 表示补上一格的竖放或着表示横放// 当上一层为0时下一层相应位置取0 表示横放所以要连跳两格，取1表示竖放// 有可能会超出 int范围要用longimport java.util.Scanner;public class POJ_2411 { static int h,

2012-08-30 18:27:10 669

原创 poj 3254 java

import java.util.ArrayList;import java.util.List;import java.util.Scanner;public class POJ_3254 { static int n,m; static List num[] = new ArrayList[13]; static int dp[][] = new int[13]

2012-08-30 18:26:35 394

原创 poj 3373

import java.util.Scanner;public class POJ_3373 { static int mod[][]; static int k; static int flag[][]; static int m[],n[]; static int n_mod; static int len; public static void

2012-08-25 18:14:20 449

原创 poj 1703 java

import java.io.*;public class test { static int a[]; static int ans[]; public static void main(String[] args)throws Exception { BufferedReader buf = new BufferedReader(new InputS

2012-08-24 15:25:51 398

原创 poj 2482 java

import java.util.*;public class POJ_2482 { static long height[]; static long tree[]; static XY p[]; static TreeSet ts; static Iterator iterator; static int m; static long sum[];

2012-08-21 21:55:50 383

原创 poj 2528 java

import java.util.Scanner;public class POJ_2528 { public static final int MAX = (int) 1e7; static int dist[]; static int post[][]; static int maxP; static LineTree[] LT; static int n;

2012-08-19 13:22:08 420

原创 poj 2195 java

import java.util.LinkedList;import java.util.Queue;import java.util.Scanner;public class POJ_2195 { static int flow[][]; static int cap[][]; static int cost[][]; static int n ; pub

2012-08-18 17:26:48 453

原创 poj 3308 java

import java.util.ArrayList;import java.util.LinkedList;import java.util.List;import java.util.Queue;import java.util.Scanner;public class POJ_3308 { static List map[]; static double

2012-08-17 20:20:56 338

原创 poj 2706 java

import java.util.LinkedList;import java.util.Queue;import java.util.Scanner;public class Main { public static final int a[][] = {{-2,-1},{-2,1},{-1,2},{1,2},{2,1},{2,-1},{1,-2},{-1,-2}};

2012-08-14 20:11:28 403

原创 poj 2513 为什么一直RE 啊!!!!!

import java.util.Scanner;public class POJ_2513 { public static final int size = 500001; static int color = 1; static int parent[] = new int[size]; public static void main(String[] arg

2012-08-03 18:57:09 408

原创 poj 3274 java

import java.util.HashMap;import java.util.Scanner;public class POJ_3274 { public static final int size = 100001; static int max_dis ; public static void main(String[] args) { S

2012-08-02 20:43:48 389