# Monthly Archives: December 2012

## Poj Solution 2372

http://poj.org/problem?id=2372 #include <stdio.h> #include <string.h> char w, *symbol="=+-*/0123456789n"; bool check_comment(int &s) { do { while( w[s] && w[s] != ‘*’ ) s++; if( !w[s] || !w[ s+1 ] ) return false; else if( w[ ++s ] == ‘)’ ) return … Continue reading

Posted in poj | Comments Off on Poj Solution 2372

## Poj Solution 2371

http://poj.org/problem?id=2371 import java.util.Arrays; import java.util.Scanner; public class Main { public static void quickSort(int[] data, int s, int t) { int i = s+1; int j = t; int x = data[s]; while (i <= j) { while (i <= j … Continue reading

Posted in poj | Comments Off on Poj Solution 2371

## Poj Solution 2370

http://poj.org/problem?id=2370 //* @author: 82638882@163.com import java.util.*; public class Main { public static void main(String[] args) { Scanner in=new Scanner(System.in); int a=in.nextInt(),t=0,i; int[] b=new int[a]; for(i=0;i< a;i++) b[i]=in.nextInt(); a/=2; Arrays.sort(b); for(i=0;i<=a;i++) t+=b[i]/2+1; System.out.println(t); } }

Posted in poj | Comments Off on Poj Solution 2370

## Poj Solution 2367

http://poj.org/problem?id=2367 import java.math.BigInteger; import java.util.ArrayList; import java.util.List; import java.util.Scanner; /** * * Accepted. BigInteger is used here. * * */ public class Main { public static void main(String[] args) { Scanner cin = new Scanner(System.in); int n = cin.nextInt(); int[][] … Continue reading

Posted in poj | Comments Off on Poj Solution 2367

## Poj Solution 2366

http://poj.org/problem?id=2366 //* @author: ccQ.SuperSupper import java.io.*; import java.util.*; public class Main { static double N = 10000.0; public static void main(String []args) throws Exception{ double temp; int i,j,n,m,t=1; Map first = new HashMap(); StreamTokenizer in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in))); … Continue reading

Posted in poj | Comments Off on Poj Solution 2366

## Poj Solution 2365

http://poj.org/problem?id=2365 //* @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 r=scanner.nextDouble(); double[] x=new double[n]; double[] y=new double[n]; for (int i=0;i< n ;i++ ){ x[i]=scanner.nextDouble(); y[i]=scanner.nextDouble(); } … Continue reading

Posted in poj | Comments Off on Poj Solution 2365

## Poj Solution 2363

http://poj.org/problem?id=2363 //* @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 c=scanner.nextInt(); int n,sm; for (int l=0;l< c ;l++ ){ n=scanner.nextInt(); sm=4*n+2; for (int i=1;i<=n ;i++ ){ for (int … Continue reading

Posted in poj | Comments Off on Poj Solution 2363

## Poj Solution 2362

http://poj.org/problem?id=2362 import java.io.*; import java.util.*; public class Main { //记录数字的总长度。 int totalNum; //记录各个数字的值的数组。 int[] numArr; //记录每个小短棒是否被使用过。 boolean[] used; public static void main(String args[]) throws Exception { Main m=new Main(); m.begin(); } private void begin() throws Exception { Scanner cin = … Continue reading

Posted in poj | Comments Off on Poj Solution 2362

## Poj Solution 2361

http://poj.org/problem?id=2361 /* @author: */ import java.util.Scanner; public class Main{ public static void main(String args[]) { char cc[][]=new char; Scanner sc=new Scanner(System.in); int n,i,j; n=sc.nextInt(); while((n–)!=0) { for(i=0;i< 3;i++) cc[i]=sc.next().toCharArray(); int x=0,o=0; boolean xw=false,ow=false; boolean bb=true; for(i=0;i< 3;i++) for(j=0;j< 3;j++) { … Continue reading

Posted in poj | Comments Off on Poj Solution 2361

## Poj Solution 2353

http://poj.org/problem?id=2353 #include<stdio.h> #include<string.h> #include<math.h> #include<stdlib.h> #define NMAX 501 #define INF 2000000001 long m[NMAX][NMAX]={0}; long a[NMAX][NMAX]={0}; long M,N; long b[NMAX*NMAX]={0}; int xp={-1,0,1},yp={0,-1,0}; void solve() { int i,j; for(i=1;i<=N;i++) { m[i]=a[i]; } for(i=2;i<=M;i++) { for(j=1;j<=N;j++) { if(m[i][j]>a[i][j]+m[i-1][j]) m[i][j]=a[i][j]+m[i-1][j]; } for(j=2;j<=N;j++) { if(m[i][j]>a[i][j]+m[i][j-1]) … Continue reading

Posted in poj | Comments Off on Poj Solution 2353

## Poj Solution 2352

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

Posted in poj | Comments Off on Poj Solution 2352