# Monthly Archives: November 2009

## Poj Solution 1208

http://poj.org/problem?id=1208 /* @author:zeropinzuo */ import java.util.*; public class Main{ static Scanner cin; static MyList list; public static void main(String args[]){ cin = new Scanner(System.in); int n = cin.nextInt(); list = new MyList(); for(int i = 0;i < n;i++) list.add(new Stack(new … Continue reading

## Poj Solution 1207

http://poj.org/problem?id=1207 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)); int t; int s; int[] len; String str; int start; int end; int max; … Continue reading

## Poj Solution 1205

http://poj.org/problem?id=1205 //* @author: import java.util.*; import java.math.BigInteger; public class Main { public static void main(String[] args) { BigInteger a[]=new BigInteger[105]; int i,k; BigInteger temp; a[1]=new BigInteger("1"); for(i=2;i<=100;i++) { temp=new BigInteger("1"); for(k=1;k< i;k++) { temp=temp.add(a[k]); } a[i]=temp.add(a[i-1]); } Scanner stdin=new Scanner(System.in); … Continue reading

## Poj Solution 1201

http://poj.org/problem?id=1201 //* @author: ccQ.SuperSupper import java.io.*; import java.util.*; class Intervals{ int left,right,ci; } public class Main { static final int N = 50000+10; static int DP[] = new int[N],n,left,right; static Intervals Inter[] = new Intervals[N]; static void start(){ for(int i=0;i< … Continue reading

## Poj Solution 1200

http://poj.org/problem?id=1200 #include <iostream> #include <cmath> #include <cstring> using namespace std ; char str[20000000+10] ; int sub, radix, ans, index[256] ; bool hash[20000000+10] ; // 转化为nc进制 void Change() { int i, cnt(0) ; for( i=0; ; ++i ){ if( 0 == … Continue reading

## Poj Solution 1192

http://poj.org/problem?id=1192 /* @author: */ import java.util.Scanner; public class Main { static int n; static int x[]; static int y[]; static int c[]; static int ans=0; static int search(int i,int parent) { int ret=0,t; for(int j=0;j< n;j++) { if(parent!=j&&Math.abs(x[i]-x[j])+Math.abs(y[i]-y[j])==1) { t=search(j,i); … Continue reading

## Poj Solution 1190

http://poj.org/problem?id=1190 /* @author: */ import java.util.Scanner; public class Main { static int end,min; static int M,S; static int dfs(int v,int m,int lastr,int lasth) { if(m==0) { //������Ϊ0ʱ��ʣ�����Ϊ0,˵��˴�����ɹ�,Ӧ���� if(v>0||v< 0) return 0; else { //Ϊ0,����Ŀ���н�,�жϵ�ǰ�������Ƿ���Ѿ��õ�����С���С,��С���û�. end=1; if(min< S) S=min; return 0; … Continue reading

## Poj Solution 1189

http://poj.org/problem?id=1189 /* @author: */ import java.util.*; public class Main { static long gcd(long a,long b)//����a,b�����Լ�� { if(b==0) return a; else return gcd(b,a%b); } public static void main(String[] args){ Scanner sc = new Scanner(System.in); int m,n; long d,tmp; n=sc.nextInt(); m=sc.nextInt(); char … Continue reading

## Poj Solution 1188

http://poj.org/problem?id=1188 /* @author: */ import java.util.Scanner; import java.util.Arrays; public class Main{ static int mins=Integer.MIN_VALUE; static int maxs=Integer.MAX_VALUE; static int min(int a,int b) { return a<=b?a:b; } static int max(int a,int b) { return a>=b?a:b; } public static void main(String args[]) … Continue reading