Monthly Archives: July 2012

Poj Solution 2239

http://poj.org/problem?id=2239 //* @author: import java.io.*; import java.util.*; public class Main{ static boolean[][] g=new boolean[305][100]; static int[] xm=new int[305]; static int[] ym=new int[100]; static boolean[] chk=new boolean[100]; static int un,vn; public static boolean search(int u){ int v; for(v=0;v< vn;v++){ if(g[u][v]&&!chk[v]){ chk[v]=true; … Continue reading

Poj Solution 2236

http://poj.org/problem?id=2236 //* @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(); int max=in.nextInt(); max*=max; int[] ax=new int[a+1]; int[] ay=new int[a+1]; int[] arr=new int[a+1]; int[] bool=new int[a+1]; for(int i=1;i<=a;i++) arr[i]=i; for(int … Continue reading

Poj Solution 2234

http://poj.org/problem?id=2234 import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner cin = new Scanner(System.in); while(true) { int n = cin.nextInt(); int i = 0; int[] a = new int[n]; while(n > 0) { a[i++] = cin.nextInt(); … Continue reading

Poj Solution 2231

http://poj.org/problem?id=2231 import java.io.BufferedInputStream; import java.math.BigInteger; import java.util.Arrays; import java.util.Scanner; public class Main { public static BigInteger getVolume(int[] a, int n) { BigInteger sum = new BigInteger("0"); BigInteger s = new BigInteger("0"); int i = 0; for (; i < n … Continue reading

Poj Solution 2229

http://poj.org/problem?id=2229 //* @author: 82638882@163.com import java.util.*; public class Main { public static void main(String[] args) { Scanner in=new Scanner(System.in); int[] arr=new int[1000001]; arr[1]=1; arr[2]=2; for(int i=3;i< 1000001;i++) { if(i%2==0) arr[i]=(arr[i-2]+arr[i/2])%1000000000; else arr[i]=arr[i-1]; } int a=in.nextInt(); System.out.println(arr[a]); } }

Poj Solution 2228

http://poj.org/problem?id=2228 /* @author: */ import java.util.Scanner; import java.util.Arrays; public class Main{ static int maxs=Integer.MAX_VALUE/3; int f[][][]=new int[2][3831][2]; int g[][][]=new int[2][3831][2]; int a[]=new int[3831]; int n,m; int maxv(int x,int y){ return x>y?x:y; } void dp(){ int pre=0,cur=1; for(int i=0;i<=m;i++) f[1][i][0]=f[1][i][1]=g[1][i][0]=g[1][i][1]=-maxs; f[1][0][0]=f[1][1][1]=0; … Continue reading

Poj Solution 2218

http://poj.org/problem?id=2218 //* @author: ccQ.SuperSupper import java.io.*; import java.util.*; class WHO implements Comparable{ String name; int index; public int compareTo(Object temp){ WHO tmp = (WHO)temp; if(tmp.index< this.index) return -1; return 1; } } public class Main { static final int N … Continue reading

Poj Solution 2215

http://poj.org/problem?id=2215 //* @author: import java.io.*; import java.util.*; public class Main { static int SZ=1005; public static void main(String[] args) throws Exception { int r,c,q; int sum; int i,j,x1,y1,x2,y2; int[][] area=new int[SZ][SZ]; for(i=0;i< SZ;++i) area[i][0]=0; Scanner cin=new Scanner(System.in); int T=cin.nextInt(); while(–T>=0) … Continue reading

Poj Solution 2209

http://poj.org/problem?id=2209 //* @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 numOfSon = in.nextInt(); int power = in.nextInt(); int[] potential = new int[numOfSon]; int sum = 0; if(power%2==1) { … Continue reading