# Monthly Archives: January 2010

## Poj Solution 1289

http://poj.org/problem?id=1289 #include<iostream> using namespace std; int main(){ int init_hei, work_num; while(cin >> init_hei >> work_num && init_hei != 0){ int n = 0, v1, v2, x; bool flag = false; while(!flag){ // 模拟解方程(n+1)^x = init_hei, n^x = work_num。 n ++; … Continue reading

Posted in poj | Comments Off on Poj Solution 1289

## Poj Solution 1287

http://poj.org/problem?id=1287 //* @author: ccQ.SuperSupper import java.io.*; import java.util.*; class Edge implements Comparable{ int start,end; int cost; public int compareTo(Object temp){ Edge cnt = (Edge) temp; if(cnt.cost< this.cost) return 1; return -1; } } class Set{ final int N = 100; … Continue reading

Posted in poj | Comments Off on Poj Solution 1287

## Poj Solution 1281

http://poj.org/problem?id=1281 import java.io.PrintWriter; import java.io.PrintWriter; import java.util.Collections; import java.util.PriorityQueue; import java.util.Scanner; public class Main { Scanner cin = new Scanner(System.in); PrintWriter out=new PrintWriter(System.out,true); public void solve() { int maxCost,removeLen; String op; while(cin.hasNext()) { maxCost=cin.nextInt(); removeLen=cin.nextInt(); int [] list=new int[removeLen]; for(int … Continue reading

Posted in poj | Comments Off on Poj Solution 1281

## Poj Solution 1277

http://poj.org/problem?id=1277 /* @author:zeropinzuo */ import java.io.*; import java.util.*; import java.math.BigInteger; public class Main{ static Scanner cin; public static void main(String args[]){ cin = new Scanner(System.in); int num = cin.nextInt(); for(int i=0;i< num;i++) run(); } static void run(){ int p = … Continue reading

Posted in poj | Comments Off on Poj Solution 1277

## Poj Solution 1276

http://poj.org/problem?id=1276 import java.util.Scanner; public class Main { static int[] value = new int[100]; static int[] dp = new int[100001]; public static void main(String[] args) { Scanner s; try { // s = new Scanner(new InputStreamReader(new FileInputStream( // "c:\1.txt"))); s = … Continue reading

Posted in poj | Comments Off on Poj Solution 1276

## Poj Solution 1274

http://poj.org/problem?id=1274 import java.io.*; import java.util.*; public class Main { static int m,n; static boolean[] flag; static int[] occ; static int[][] adj; public static void main(String args[]) throws Exception { Scanner cin=new Scanner(System.in); while(cin.hasNext()) { n=cin.nextInt(); m=cin.nextInt(); adj=new int[n+1][m+1]; for(int i=0;i< … Continue reading

Posted in poj | Comments Off on Poj Solution 1274

## Poj Solution 1273

http://poj.org/problem?id=1273 //* @author: import java.util.*; public class Main implements Comparator< Integer> { static class Edge{ int e,c; Edge next; Edge rev; public void dec(int f){ c-=f; rev.c+=f; } } int n,m,src,tag; final Edge[] g=new Edge[200]; final int[] h=new int[200]; final … Continue reading

Posted in poj | Comments Off on Poj Solution 1273

## Poj Solution 1269

http://poj.org/problem?id=1269 //* @author popop0p0popo 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[] x,y; double px,py; double k1,k2,b1,b2; System.out.println("INTERSECTING LINES OUTPUT"); for (int i=0;i< n ;i++ ){ x=new double[4]; … Continue reading

Posted in poj | Comments Off on Poj Solution 1269

## Poj Solution 1265

http://poj.org/problem?id=1265 //* @author: ccQ.SuperSupper import java.io.*; import java.util.*; class Point{ int x,y; } public class Main { static final int N = 100+10; static int n; static Point Area[] = new Point[N]; static void start(){ for(int i=0;i< N;++i) Area[i] = … Continue reading

Posted in poj | Comments Off on Poj Solution 1265

## Poj Solution 1263

http://poj.org/problem?id=1263 #include<iostream> #include"math.h" using namespace std; const double pi=3.14159265358979324; struct point {double x,y;}; struct cir {point p; double r;}; struct ray {point p; double dx,dy;}; struct line {double a,b,c;}; //l: ax+by+c=0 inline double sq(double a) {return a*a;} line ray_line(ray s) … Continue reading

Posted in poj | Comments Off on Poj Solution 1263

## Poj Solution 1260

http://poj.org/problem?id=1260 /* @author: */ import java.util.Scanner; import java.util.Arrays; public class Main{ static final int maxn=100; private int a[]=new int[maxn],p[]=new int[maxn],f[]=new int[maxn]; private int min(int a,int b){ return a< b?a:b; } public int dp(int x){ if(x< 0)return 0; if(f[x]!=-1)return f[x]; if(x==0)return … Continue reading

Posted in poj | Comments Off on Poj Solution 1260

## Poj Solution 1258

http://poj.org/problem?id=1258 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; public class Main { public static void main(String[] args) throws IOException { BufferedReader read = new BufferedReader(new InputStreamReader( System.in)); String s = null; int n; int[][] a; int t; String[] ss; int index; … Continue reading

Posted in poj | Comments Off on Poj Solution 1258

## Poj Solution 1256

http://poj.org/problem?id=1256 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.Arrays; import java.util.Comparator; public class Main { class Compara implements Comparator<Character> { public int compare(Character o1, Character o2) { char a = Character.toLowerCase(o1); char b = Character.toLowerCase(o2); if (a == b) { … Continue reading

Posted in poj | Comments Off on Poj Solution 1256

## Poj Solution 1254

http://poj.org/problem?id=1254 import java.text.DecimalFormat; import java.util.Scanner; public class Main{ public static void main(String[] args) { Scanner cin = new Scanner(System.in); DecimalFormat df1 = new DecimalFormat("0.0000"); int n = cin.nextInt(); while(n– > 0) { int x1 = cin.nextInt(); int y1 = cin.nextInt(); … Continue reading

Posted in poj | Comments Off on Poj Solution 1254