# Monthly Archives: November 2012

## Poj Solution 2350

http://poj.org/problem?id=2350 import java.util.Scanner; /** * poj2350 easy * @author NC */ public class Main { public static void main(String[] args) { Scanner scan = new Scanner(System.in); if (scan.hasNext()) { int n = scan.nextInt(); for (int i = 0; i < … Continue reading

Posted in poj | Comments Off on Poj Solution 2350

## Poj Solution 2349

http://poj.org/problem?id=2349 //* @author: 82638882@163.com import java.io.*; import java.util.Arrays; public class Main { static int[] p; public static void main(String[] args) throws NumberFormatException, IOException { InputStreamReader is=new InputStreamReader(System.in); BufferedReader in=new BufferedReader(is); int n=Integer.parseInt(in.readLine()); while((n–)!=0) { String[] ss=in.readLine().split(" "); int a=Integer.parseInt(ss); int … Continue reading

Posted in poj | Comments Off on Poj Solution 2349

## Poj Solution 2348

http://poj.org/problem?id=2348 /* @author: */ import java.util.Scanner; public class Main{ static boolean judge(int x,int y) { int t; if(x< y) {t=x;x=y;y=t;} if(x%y==0) return true; if(x-y< y) return !judge(y,x-y); return true; } public static void main(String args[]) { Scanner sc=new Scanner(System.in); int … Continue reading

Posted in poj | Comments Off on Poj Solution 2348

## Poj Solution 2346

http://poj.org/problem?id=2346 import java.util.*; /** * * @author leo */ public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n, max=0; int[][] dp = new int; for(int i=0;i<=9;i++){ dp[i]=1; } for(int i=1;i<=5;i++){ dp[i]=1; } … Continue reading

Posted in poj | Comments Off on Poj Solution 2346

## Poj Solution 2344

http://poj.org/problem?id=2344 #include"stdio.h" #include"algorithm" #include"math.h" using namespace std; int n,m; const double eps=1e-8; const int size=2000; double a[size][size]; bool sign[size]; void swap_c(int k,int l) { int i; for(i=0;i<m;i++) std::swap(a[i][k],a[i][l]); } bool guass() { int i,j,k,l;double temp; for(i=0;i<m;i++) sign[i]=1; for(l=0,i=0;i<n;i++) { while(fabs(a[l][i])<eps) … Continue reading

Posted in poj | Comments Off on Poj Solution 2344

## Poj Solution 2339

http://poj.org/problem?id=2339 //* @author ������&lt;hongxp11@163.com&gt; import java.util.Scanner; public class Main { /** * @param args */ public static int row; public static int column; public static int replace(int i, int j, int[][] array) { int temp = 0; if (array[i][j] == … Continue reading

Posted in poj | Comments Off on Poj Solution 2339

## Poj Solution 2336

http://poj.org/problem?id=2336 //* @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); int num = in.nextInt(); for(int i = 0; i< num; i++) { int n = in.nextInt(); int t = … Continue reading

Posted in poj | Comments Off on Poj Solution 2336

## Poj Solution 2333

http://poj.org/problem?id=2333 #include <stdio.h> const int size = 5010; struct point { int x, y; }p[size], pt[size]; __int64 s[size]; inline __int64 cross( point &o, point &a, point &b ) { return (__int64)(a.x-o.x)*(b.y-o.y) – (__int64)(a.y-o.y)*(b.x-o.x); } inline __int64 dis( point &a, point … Continue reading

Posted in poj | Comments Off on Poj Solution 2333

## Poj Solution 2328

http://poj.org/problem?id=2328 import java.util.*; public class Main { public static void main(String[] args) { Scanner cin = new Scanner(System.in); List guess = new ArrayList(); List response = new ArrayList(); while(cin.hasNext()) { String guessNum = cin.nextLine(); if(guessNum.equals("0")) break; String result = cin.nextLine(); … Continue reading

Posted in poj | Comments Off on Poj Solution 2328

## Poj Solution 2325

http://poj.org/problem?id=2325 //* @author import java.io.*; import java.util.*; import java.math.*; public class Main { public static void main(String[] args) { BigInteger n,zero,ten; int count,flag,a[],i,j; a=new int; Scanner cin = new Scanner(System.in); while(cin.hasNext()) { n = cin.nextBigInteger(); zero=BigInteger.ZERO; ten=BigInteger.TEN; if(n.compareTo(BigInteger.valueOf(-1))==0) break; if(n.compareTo(ten)< … Continue reading

Posted in poj | Comments Off on Poj Solution 2325

## Poj Solution 2323

http://poj.org/problem?id=2323 //* @author:alpc12 import java.io.BufferedReader; import java.io.FileNotFoundException; import java.io.FileReader; import java.math.BigInteger; import java.util.Arrays; import java.util.Scanner; public class Main { public static void main(String[] args) throws FileNotFoundException { new Main().run(); } BigInteger [][] dp; private void run() throws FileNotFoundException { Scanner … Continue reading

Posted in poj | Comments Off on Poj Solution 2323

## Poj Solution 2318

http://poj.org/problem?id=2318 /* @author:zeropinzuo */ import java.io.*; import java.util.*; public class Main{ static Scanner cin; public static void main(String args[]){ cin = new Scanner(System.in); while(run() != false) ; } static boolean run(){ int n = cin.nextInt(); if(n==0) return false; Box box … Continue reading

Posted in poj | Comments Off on Poj Solution 2318