# Monthly Archives: July 2013

## Poj Solution 2521

http://poj.org/problem?id=2521 import java.util.*; public class Main { public static void main(String[] args) { Scanner cin = new Scanner(System.in); while(cin.hasNext()) { String tmp = cin.nextLine(); if(tmp.equals("0 0 0 0")) break; String[] tmp1 = tmp.split(" "); int N = Integer.valueOf(tmp1); int M … Continue reading

Posted in poj | Comments Off on Poj Solution 2521

## Poj Solution 2516

http://poj.org/problem?id=2516 #include <stdio.h> #include <vector> #include <algorithm> using namespace std; typedef int type; const type MAX_FEE = 1e8; const int size = 210; const int MAX = 1e8; struct edge { int c,f; type w; int from,to; int rev_i; }; … Continue reading

Posted in poj | Comments Off on Poj Solution 2516

## Poj Solution 2515

http://poj.org/problem?id=2515 import java.io.*; import java.util.*; import java.math.*; /** * * @author gongshaoqing */ public class Main { private static int NULL=0; public static void main(String[] args) { Scanner cin = new Scanner(System.in); int i, j, t; int m; BigInteger N, … Continue reading

Posted in poj | Comments Off on Poj Solution 2515

## Poj Solution 2513

http://poj.org/problem?id=2513 //* @author: import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; public class Main { int sum = 0; int time[] = new int; int parent[] = new int; int rank[] = new int; trieT root; void ini() { root = new … Continue reading

Posted in poj | Comments Off on Poj Solution 2513

## Poj Solution 2512

http://poj.org/problem?id=2512 #include <stdio.h> int dx[]={ 0, 0, 1,-1, 1, 1,-1,-1, 1, 1, 2, 2,-1,-1,-2,-2 }; int dy[]={-1, 1, 0, 0, 1,-1, 1,-1, -2, 2,-1, 1,-2, 2,-1, 1 }; char map; #define true ‘.’ #define false ‘x’ inline bool inmap( int … Continue reading

Posted in poj | Comments Off on Poj Solution 2512

## Poj Solution 2511

http://poj.org/problem?id=2511 #include <stdio.h> #include <memory.h> #include <string.h> #include <algorithm> using namespace std; char word; char mem; int v; int e; int d; int id; int ans; int from; int n; bool cmp( int a, int b ) { return strcmp( … Continue reading

Posted in poj | Comments Off on Poj Solution 2511

## Poj Solution 2509

http://poj.org/problem?id=2509 //* @author ������&lt;hongxp11@163.com&gt; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); while(in.hasNext()) { int n = in.nextInt(); int k = in.nextInt(); int temp = n; int add = 0; while(n>=k) … Continue reading

Posted in poj | Comments Off on Poj Solution 2509

## Poj Solution 2508

http://poj.org/problem?id=2508 //* @author: import java.util.*; public class Main { static public void main( String [] str ){ Scanner sc = new Scanner(System.in); double r, h, d1, a1, d2, a2, dg, l, s, a; while(sc.hasNext()) { r=sc.nextDouble(); h=sc.nextDouble(); d1=sc.nextDouble(); a1=sc.nextDouble(); d2=sc.nextDouble(); … Continue reading

Posted in poj | Comments Off on Poj Solution 2508

## Poj Solution 2507

http://poj.org/problem?id=2507 //* @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); while(in.ready()) { String[] ss=in.readLine().split(" "); double x=Double.parseDouble(ss); double y=Double.parseDouble(ss); double c=Double.parseDouble(ss); double max=Math.min(x, y),min=0; … Continue reading

Posted in poj | Comments Off on Poj Solution 2507

## Poj Solution 2506

http://poj.org/problem?id=2506 import java.util.*; import java.math.*; public class Main{ static BigInteger[] ans; public static void main(String args[]) { Scanner sc=new Scanner(System.in); ans=new BigInteger; ans=BigInteger.valueOf(1); ans=BigInteger.valueOf(1); ans=BigInteger.valueOf(3); for(int i=3;i<=250;i++) ans[i]=ans[i-1].add(ans[i-2].multiply(BigInteger.valueOf(2))); while(sc.hasNextInt()){ int n=sc.nextInt(); System.out.println(ans[n]); } } }

Posted in poj | Comments Off on Poj Solution 2506

## Poj Solution 2505

http://poj.org/problem?id=2505 //* @author: 82638882@163.com import java.util.*; public class Main { public static void main(String[] args) { Scanner in=new Scanner(System.in); while(in.hasNext()) { double m=in.nextDouble(); while(m>18) m/=18; System.out.println(m>9?"Ollie wins.":"Stan wins."); } } }

Posted in poj | Comments Off on Poj Solution 2505

## Poj Solution 2504

http://poj.org/problem?id=2504 /* @author: */ import java.util.Scanner; public class Main{ public static void main(String args[]) { Scanner sc=new Scanner(System.in); int n; double xx1,xx2,xx3,yy1,yy2,yy3,x,y,mnx,mxx,mny,mxy; int t=1; while(sc.hasNext()) { n=sc.nextInt(); if(n==0) break; xx1=sc.nextDouble(); yy1=sc.nextDouble(); xx2=sc.nextDouble(); yy2=sc.nextDouble(); xx3=sc.nextDouble(); yy3=sc.nextDouble(); double A1=2*(xx1-xx2); double A2=2*(xx1-xx3); double … Continue reading

Posted in poj | Comments Off on Poj Solution 2504

## Poj Solution 2502

http://poj.org/problem?id=2502 //* @author: import java.util.Scanner; import java.io.*; public class Main{ double max = Double.MAX_VALUE; int fin[] = new int; double d[] = new double; double dis[][] = new double; pos p[] = new pos; void initial() { for (int i … Continue reading

Posted in poj | Comments Off on Poj Solution 2502