Category Archives: poj

http://poj.org/problem?id=1276 import java.util.Scanner; public class Main { static int[] value = new int[100]; static int[] dp = new int[100001]; public static void main(String[] args) { Scanner s; try { // s = new Scanner(new InputStreamReader(new FileInputStream( // "c:\1.txt"))); s = … Continue reading →

http://poj.org/problem?id=1274 import java.io.*; import java.util.*; public class Main { static int m,n; static boolean[] flag; static int[] occ; static int[][] adj; public static void main(String args[]) throws Exception { Scanner cin=new Scanner(System.in); while(cin.hasNext()) { n=cin.nextInt(); m=cin.nextInt(); adj=new int[n+1][m+1]; for(int i=0;i< … Continue reading →

http://poj.org/problem?id=1273 //* @author: import java.util.*; public class Main implements Comparator< Integer> { static class Edge{ int e,c; Edge next; Edge rev; public void dec(int f){ c-=f; rev.c+=f; } } int n,m,src,tag; final Edge[] g=new Edge[200]; final int[] h=new int[200]; final … Continue reading →

http://poj.org/problem?id=1269 //* @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[] x,y; double px,py; double k1,k2,b1,b2; System.out.println("INTERSECTING LINES OUTPUT"); for (int i=0;i< n ;i++ ){ x=new double[4]; … Continue reading →

http://poj.org/problem?id=1265 //* @author: ccQ.SuperSupper import java.io.*; import java.util.*; class Point{ int x,y; } public class Main { static final int N = 100+10; static int n; static Point Area[] = new Point[N]; static void start(){ for(int i=0;i< N;++i) Area[i] = … Continue reading →

http://poj.org/problem?id=1263 #include<iostream> #include"math.h" using namespace std; const double pi=3.14159265358979324; struct point {double x,y;}; struct cir {point p; double r;}; struct ray {point p; double dx,dy;}; struct line {double a,b,c;}; //l: ax+by+c=0 inline double sq(double a) {return a*a;} line ray_line(ray s) … Continue reading →

http://poj.org/problem?id=1260 /* @author: */ import java.util.Scanner; import java.util.Arrays; public class Main{ static final int maxn=100; private int a[]=new int[maxn],p[]=new int[maxn],f[]=new int[maxn]; private int min(int a,int b){ return a< b?a:b; } public int dp(int x){ if(x< 0)return 0; if(f[x]!=-1)return f[x]; if(x==0)return … Continue reading →

http://poj.org/problem?id=1258 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)); String s = null; int n; int[][] a; int t; String[] ss; int index; … Continue reading →

http://poj.org/problem?id=1256 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.Arrays; import java.util.Comparator; public class Main { class Compara implements Comparator<Character> { public int compare(Character o1, Character o2) { char a = Character.toLowerCase(o1); char b = Character.toLowerCase(o2); if (a == b) { … Continue reading →

http://poj.org/problem?id=1254 import java.text.DecimalFormat; import java.util.Scanner; public class Main{ public static void main(String[] args) { Scanner cin = new Scanner(System.in); DecimalFormat df1 = new DecimalFormat("0.0000"); int n = cin.nextInt(); while(n– > 0) { int x1 = cin.nextInt(); int y1 = cin.nextInt(); … Continue reading →

http://poj.org/problem?id=1251 import java.io.BufferedInputStream; import java.util.Collections; import java.util.HashMap; import java.util.Iterator; import java.util.LinkedList; import java.util.Map.Entry; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scanner = new Scanner(new BufferedInputStream(System.in)); while (scanner.hasNext()) { int n = scanner.nextInt(); if (n … Continue reading →

http://poj.org/problem?id=1250 //* @author ������&lt;hongxp11@163.com&gt; import java.util.ArrayList; import java.util.HashSet; import java.util.Scanner; import java.util.Set; public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); while (true) { int num = in.nextInt(); if (num == 0) break; String … Continue reading →

http://poj.org/problem?id=1247 //* @author: 82638882@163.com import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner in=new Scanner(System.in); while(true) { int a=in.nextInt(); if(a==0)break; int[] arr=new int[a]; int t=0; for(int i=0;i< a;i++) { arr[i]=in.nextInt(); t+=arr[i]; } if(t%2==1)System.out.println("No equal partitioning."); else … Continue reading →

http://poj.org/problem?id=1244 //* @author popop0p0popo import java.util.*; import java.io.*; public class Main{ public static void main(String[] args) throws Exception{ Scanner scanner=new Scanner(new BufferedReader(new InputStreamReader(System.in))); int n,flag; String line,r; char c; int[] idx; while (true){ n=scanner.nextInt(); if (n==0){ break; } line=scanner.next(); r=""; … Continue reading →

http://poj.org/problem?id=1243 /* @author:zeropinzuo */ import java.util.*; public class Main{ static Scanner cin; static int Case = 0; static int[][] result; public static void main(String args[]){ cin = new Scanner(System.in); result = new int[100][100]; int i,j; for(i = 0;i < 100;i++) … Continue reading →

http://poj.org/problem?id=1240 /* @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()==true) ; } static boolean run(){ int n = cin.nextInt(); if(n==0) return false; Tree tree = new … Continue reading →

http://poj.org/problem?id=1230 //* @author: ccQ.SuperSupper import java.io.*; import java.util.*; interface Pass{ int N = 100+10; void SetInit(int n,int k); void AddData(int left,int right); void InitData(); int GetAns(); } class Interval implements Comparable{ int left,right; void set(int left,int right){ this.left = left; … Continue reading →

http://poj.org/problem?id=1228 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; public class Main { class Point { int x; int y; public Point(int x, int y) { this.x = x; this.y = y; } } public static void main(String[] args) throws NumberFormatException, IOException … Continue reading →

http://poj.org/problem?id=1226 //* @author:alpc12 import java.math.*; import java.io.*; import java.util.*; class Main { public static void main(String[] args) throws Exception { new Main().run(); } private int n; private void run() throws Exception { Scanner cin = new Scanner(System.in); int ntc = … Continue reading →

http://poj.org/problem?id=1222 import java.util.Scanner; public class Main { int times; int[][] puzzle; static final int length = 6; static final int width = 5; int[][] arr; int temp; int req; public Main() { Scanner scan = new Scanner(System.in); times = scan.nextInt(); … Continue reading →

http://poj.org/problem?id=1221 //* @author: ccQ.SuperSupper import java.io.*; import java.util.*; public class Main { static final int N = 500; static long DP[][] = new long[N][N]; static void init(){ int i,j; for(i=0;i< N;++i) for(j=0;j< N;++j) DP[i][j] = 0; for(i=1;i< N;++i){ for(j=i;j>=0;–j) DP[i][j]=1; … Continue reading →

http://poj.org/problem?id=1220 import java.util.*; import java.math.*; public class Main { static int c2i(char c){ if(c>=’0’&&c<=’9′) return c-‘0′; if(c>=’A’&&c<=’Z’) return c-‘A’+10; return c-‘a’+36; } static char i2c(int c){ if(c< 10) return (char)(48+c); if(c>=10&&c< 36) return (char)(‘A’+c-10); return (char)(‘a’+c-36); } public static void … Continue reading →

http://poj.org/problem?id=1219 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)); String s; String r; int time; char[] last; StringBuilder temp; char[] buff; int pos; … Continue reading →

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

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 →

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 →

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 →

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 →

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 →

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 →

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 →

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 →

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 →

http://poj.org/problem?id=1187 //* @author: import java.util.*; public class Main { static int s[][][][]=new int[31][11][11][11]; static int get( int d, int l1, int l2, int l3 ) { int t, j, k, i, h; if( l1 == 0 && l2 == 0 … Continue reading →

http://poj.org/problem?id=1186 //* @author: import java.math.BigInteger; import java.util.Arrays; import java.util.Comparator; import java.util.Hashtable; import java.util.Scanner; public class Main { static int[]k=new int[6]; static int[]p=new int[6]; static int n,m,mark; static int total; static Hashtable< Long,Integer>hash=new Hashtable< Long,Integer>(); public static void main(String[] args) { … Continue reading →

http://poj.org/problem?id=1185 //* @author: /*��Ŀ������һ��n*m�ķ����з����ڱ�Ҫ�����ڣ���û���ڱ�������ܷŶ��� *��ʼ��Ϊû���뵽�õķ�������������һ�Σ�tle… *֪���й���״̬ѹ����㷨���ɲ�̫�����һֱ����û����쿴��һ��״̬ѹ��ģ��㷨 *������д����4���������ڣ�c.. *״̬ѹ����λ4��ʾ״̬������λ�����ʡʱ�䣨���Ǻ�����ᣩ *ö��״̬������״̬ת�ƴӶ�õ����Ž⣬��Ϊ״̬ѹ��DP… */ import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; class cin { static BufferedReader in=new BufferedReader(new InputStreamReader(System.in)); static StringTokenizer st; static int leave=0; static int nextInt()throws IOException { return Integer.parseInt(next()); } … Continue reading →

http://poj.org/problem?id=1183 //* @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))); long a=scanner.nextInt(); long m=1; for (long i=a;i>=1 ;i– ){ if ((a*a+1)%i==0){ m=i; break; } } System.out.println(2*a+m+(a*a+1)/m); } }

http://poj.org/problem?id=1182 import java.io.*; public class Main { public static void main(String[] args) throws IOException { Main poj = new Main(); BufferedReader read = new BufferedReader(new InputStreamReader( System.in)); String[] tm = read.readLine().split(" "); int N = new Integer(tm[0]); int K = … Continue reading →

http://poj.org/problem?id=1178 //* @author: import java.util.*; public class Main { static int dis[][][][]=new int[8][8][8][8]; static int x[]=new int[64],y[]=new int[64], n; static void floyd() { int i1, i2, i3, j1, j2, j3, t; for( i1=0; i1< 8; i1++ ) for( j1=0; j1< … Continue reading →

http://poj.org/problem?id=1171 //* @author: ccQ.SuperSupper import java.io.*; import java.util.*; public class Main { static final int N = 1000+10; static int top,ans; static String opt = new String(); static String str[] =new String[N]; static int score[]={2,5,4,4,1,6,5,5,1,7,6,3,5,2,3,5,7,2,1,2,4,6,6,7,5,7}; public static void main(String[]args)throws Exception{ … Continue reading →

http://poj.org/problem?id=1166 /* @author: */ import java.util.Scanner; public class Main{ public static void main(String args[]){ Scanner sc=new Scanner(System.in); int arr[]=new int[9]; int ans[]=new int[9]; int i=0; for(i=0;i< 9;i++) arr[i]=sc.nextInt(); int a1,a2,a3,a4,a5,a6,a7,a8,a9,cnt; int u[]=new int[9]; int min=100; for(a1=0;a1< 4;a1++) for(a2=0;a2< 4;a2++) for(a3=0;a3< … Continue reading →

http://poj.org/problem?id=1165 //* @author: import java.util.*; public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); int sum=in.nextInt(); int lefttop=in.nextInt(); cnt=new int[11][11][11][11][11]; for (int i = 0; i < cnt.length; i++) { for (int j = … Continue reading →

http://poj.org/problem?id=1164 #include<iostream> #include<string> #include<cmath> #include<algorithm> using namespace std; int mat[55][55]; int num; bool vist[55][55]; void DFS(int x,int y) { num++; vist[x][y]=true; if(mat[x][y]%2==0) //搜索该位置的西方 { if(!vist[x][y-1]) DFS(x,y-1); } mat[x][y]/=2; if(mat[x][y]%2==0) //搜索该位置的北方 { if(!vist[x-1][y]) DFS(x-1,y); } mat[x][y]/=2; if(mat[x][y]%2==0) //搜索该位置的东方 { if(!vist[x][y+1]) DFS(x,y+1); … Continue reading →

http://poj.org/problem?id=1160 /* @author: */ import java.util.Scanner; import java.util.Arrays; public class Main{ static int num[]=new int[302]; static int s[][]=new int[302][302]; static void cost(int n){ int i,j,k; for(i=1;i< n;i++){ for(k=i+1; k <= n; k ++){ int mid=(i+k)/2; for(j=i;j< mid;j++) s[i][k]+=num[mid]-num[j]; for(j=mid+1;j<=k;j++) s[i][k]+=num[j]-num[mid]; … Continue reading →

http://poj.org/problem?id=1159 import java.io.BufferedReader; import java.io.InputStreamReader; public class Main { public static void main(String[] args) throws Exception{ BufferedReader in = new BufferedReader(new InputStreamReader (System.in)); int total = Integer.parseInt(in.readLine()); String string = in.readLine(); System.out.println(total-LCS(string,new StringBuffer(string).reverse().toString())); } //����}��string��lcs�ij��� public static int LCS(String str1,String … Continue reading →

http://poj.org/problem?id=1158 #include <stdio.h> #include <memory.h> #include <vector> #include <queue> using namespace std; int n, begin, end; int b[300], p[300], sum[300]; int r[300]; typedef pair<int,int> p_i; bool s[300][30000]; vector< p_i > e[300]; struct cmp { bool operator()( const p_i &a, const … Continue reading →

http://poj.org/problem?id=1157 //* @author: 82638882@163.com import java.io.*; public class Main { static boolean[][] p; static int sz; static String[] ss; public static void main(String[] args) throws IOException { InputStreamReader is=new InputStreamReader(System.in); BufferedReader in=new BufferedReader(is); String[] ss=in.readLine().split(" "); int a=Integer.parseInt(ss[0]); int b=Integer.parseInt(ss[1]); … Continue reading →

http://poj.org/problem?id=1155 /* @author: */ import java.util.*; import java.util.Scanner; public class Main{ static int[][] dp; static int[] offspring; static int[] vert; static int[] parent; static int[] leaf; static int n,k; public static void main(String[] args) { Scanner cin=new Scanner(System.in); n=cin.nextInt(); leaf=new … Continue reading →

http://poj.org/problem?id=1154 import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.Scanner; public class Main { private static String[] a = null; private static int max = -1; private static int n = 0; private static int m = 0; private static void dfs(int x, … Continue reading →

http://poj.org/problem?id=1153 #include <stdio.h> #include<iostream> #include<algorithm> using namespace std; int P[300000]; int SEG=10000000; int main() { long n; long i; long j; double result,tempresult; cin>>n; for(i=0;i<n;i++) { cin>>P[i]; } sort(P,P+n); for(i=0;i<n;i++) { P[i+n]=P[i]+SEG; P[i+2*n]=P[i+n]+SEG; } tempresult=0; int s; s=P[n]+SEG/2; for(i=n+1;P[i]<=s;++i) { … Continue reading →